You can not select more than 25 topics Topics must start with a chinese character,a letter or number, can include dashes ('-') and can be up to 35 characters long.

mxnet2ncnn.cpp 79 kB

8 years ago
8 years ago
8 years ago
8 years ago
8 years ago
8 years ago
8 years ago
8 years ago
8 years ago
8 years ago
8 years ago
12345678910111213141516171819202122232425262728293031323334353637383940414243444546474849505152535455565758596061626364656667686970717273747576777879808182838485868788899091929394959697989910010110210310410510610710810911011111211311411511611711811912012112212312412512612712812913013113213313413513613713813914014114214314414514614714814915015115215315415515615715815916016116216316416516616716816917017117217317417517617717817918018118218318418518618718818919019119219319419519619719819920020120220320420520620720820921021121221321421521621721821922022122222322422522622722822923023123223323423523623723823924024124224324424524624724824925025125225325425525625725825926026126226326426526626726826927027127227327427527627727827928028128228328428528628728828929029129229329429529629729829930030130230330430530630730830931031131231331431531631731831932032132232332432532632732832933033133233333433533633733833934034134234334434534634734834935035135235335435535635735835936036136236336436536636736836937037137237337437537637737837938038138238338438538638738838939039139239339439539639739839940040140240340440540640740840941041141241341441541641741841942042142242342442542642742842943043143243343443543643743843944044144244344444544644744844945045145245345445545645745845946046146246346446546646746846947047147247347447547647747847948048148248348448548648748848949049149249349449549649749849950050150250350450550650750850951051151251351451551651751851952052152252352452552652752852953053153253353453553653753853954054154254354454554654754854955055155255355455555655755855956056156256356456556656756856957057157257357457557657757857958058158258358458558658758858959059159259359459559659759859960060160260360460560660760860961061161261361461561661761861962062162262362462562662762862963063163263363463563663763863964064164264364464564664764864965065165265365465565665765865966066166266366466566666766866967067167267367467567667767867968068168268368468568668768868969069169269369469569669769869970070170270370470570670770870971071171271371471571671771871972072172272372472572672772872973073173273373473573673773873974074174274374474574674774874975075175275375475575675775875976076176276376476576676776876977077177277377477577677777877978078178278378478578678778878979079179279379479579679779879980080180280380480580680780880981081181281381481581681781881982082182282382482582682782882983083183283383483583683783883984084184284384484584684784884985085185285385485585685785885986086186286386486586686786886987087187287387487587687787887988088188288388488588688788888989089189289389489589689789889990090190290390490590690790890991091191291391491591691791891992092192292392492592692792892993093193293393493593693793893994094194294394494594694794894995095195295395495595695795895996096196296396496596696796896997097197297397497597697797897998098198298398498598698798898999099199299399499599699799899910001001100210031004100510061007100810091010101110121013101410151016101710181019102010211022102310241025102610271028102910301031103210331034103510361037103810391040104110421043104410451046104710481049105010511052105310541055105610571058105910601061106210631064106510661067106810691070107110721073107410751076107710781079108010811082108310841085108610871088108910901091109210931094109510961097109810991100110111021103110411051106110711081109111011111112111311141115111611171118111911201121112211231124112511261127112811291130113111321133113411351136113711381139114011411142114311441145114611471148114911501151115211531154115511561157115811591160116111621163116411651166116711681169117011711172117311741175117611771178117911801181118211831184118511861187118811891190119111921193119411951196119711981199120012011202120312041205120612071208120912101211121212131214121512161217121812191220122112221223122412251226122712281229123012311232123312341235123612371238123912401241124212431244124512461247124812491250125112521253125412551256125712581259126012611262126312641265126612671268126912701271127212731274127512761277127812791280128112821283128412851286128712881289129012911292129312941295129612971298129913001301130213031304130513061307130813091310131113121313131413151316131713181319132013211322132313241325132613271328132913301331133213331334133513361337133813391340134113421343134413451346134713481349135013511352135313541355135613571358135913601361136213631364136513661367136813691370137113721373137413751376137713781379138013811382138313841385138613871388138913901391139213931394139513961397139813991400140114021403140414051406140714081409141014111412141314141415141614171418141914201421142214231424142514261427142814291430143114321433143414351436143714381439144014411442144314441445144614471448144914501451145214531454145514561457145814591460146114621463146414651466146714681469147014711472147314741475147614771478147914801481148214831484148514861487148814891490149114921493149414951496149714981499150015011502150315041505150615071508150915101511151215131514151515161517151815191520152115221523152415251526152715281529153015311532153315341535153615371538153915401541154215431544154515461547154815491550155115521553155415551556155715581559156015611562156315641565156615671568156915701571157215731574157515761577157815791580158115821583158415851586158715881589159015911592159315941595159615971598159916001601160216031604160516061607160816091610161116121613161416151616161716181619162016211622162316241625162616271628162916301631163216331634163516361637163816391640164116421643164416451646164716481649165016511652165316541655165616571658165916601661166216631664166516661667166816691670167116721673167416751676167716781679168016811682168316841685168616871688168916901691169216931694169516961697169816991700170117021703170417051706170717081709171017111712171317141715171617171718171917201721172217231724172517261727172817291730173117321733173417351736173717381739174017411742174317441745174617471748174917501751175217531754175517561757175817591760176117621763176417651766176717681769177017711772177317741775177617771778177917801781178217831784178517861787178817891790179117921793179417951796179717981799180018011802180318041805180618071808180918101811181218131814181518161817181818191820182118221823182418251826182718281829183018311832183318341835183618371838183918401841184218431844184518461847184818491850185118521853185418551856185718581859186018611862186318641865186618671868186918701871187218731874187518761877187818791880188118821883188418851886188718881889189018911892189318941895189618971898189919001901190219031904190519061907190819091910191119121913191419151916191719181919192019211922192319241925192619271928192919301931193219331934193519361937193819391940194119421943194419451946194719481949195019511952195319541955195619571958195919601961196219631964196519661967196819691970197119721973197419751976197719781979198019811982198319841985198619871988198919901991199219931994199519961997199819992000200120022003200420052006200720082009201020112012201320142015201620172018201920202021202220232024202520262027202820292030203120322033203420352036203720382039204020412042204320442045204620472048204920502051205220532054205520562057205820592060206120622063206420652066206720682069207020712072207320742075207620772078207920802081208220832084208520862087208820892090209120922093209420952096209720982099210021012102210321042105210621072108210921102111211221132114211521162117211821192120212121222123212421252126212721282129213021312132213321342135213621372138213921402141214221432144214521462147214821492150215121522153215421552156215721582159216021612162216321642165216621672168216921702171217221732174217521762177217821792180218121822183218421852186218721882189219021912192219321942195219621972198219922002201220222032204220522062207220822092210221122122213221422152216221722182219222022212222222322242225222622272228222922302231223222332234223522362237223822392240224122422243224422452246224722482249225022512252225322542255225622572258225922602261226222632264226522662267226822692270227122722273227422752276227722782279228022812282228322842285228622872288228922902291229222932294229522962297229822992300230123022303230423052306230723082309231023112312231323142315231623172318231923202321232223232324232523262327232823292330233123322333233423352336233723382339234023412342234323442345234623472348234923502351235223532354235523562357235823592360236123622363236423652366236723682369237023712372237323742375237623772378237923802381238223832384238523862387238823892390239123922393239423952396239723982399240024012402240324042405240624072408240924102411241224132414241524162417241824192420242124222423242424252426242724282429243024312432243324342435243624372438243924402441244224432444244524462447244824492450245124522453245424552456245724582459246024612462246324642465246624672468246924702471247224732474247524762477247824792480248124822483248424852486248724882489249024912492249324942495249624972498249925002501250225032504250525062507250825092510251125122513251425152516251725182519252025212522252325242525252625272528252925302531253225332534253525362537253825392540254125422543254425452546254725482549255025512552255325542555255625572558255925602561256225632564256525662567256825692570257125722573257425752576257725782579258025812582258325842585258625872588258925902591259225932594259525962597259825992600260126022603260426052606260726082609261026112612261326142615261626172618261926202621262226232624262526262627262826292630263126322633263426352636263726382639264026412642
  1. // Tencent is pleased to support the open source community by making ncnn available.
  2. //
  3. // Copyright (C) 2017 THL A29 Limited, a Tencent company. All rights reserved.
  4. //
  5. // Licensed under the BSD 3-Clause License (the "License"); you may not use this file except
  6. // in compliance with the License. You may obtain a copy of the License at
  7. //
  8. // https://opensource.org/licenses/BSD-3-Clause
  9. //
  10. // Unless required by applicable law or agreed to in writing, software distributed
  11. // under the License is distributed on an "AS IS" BASIS, WITHOUT WARRANTIES OR
  12. // CONDITIONS OF ANY KIND, either express or implied. See the License for the
  13. // specific language governing permissions and limitations under the License.
  14. #include <stdio.h>
  15. #include <stdint.h>
  16. #include <string.h>
  17. #include <map>
  18. #include <set>
  19. #include <string>
  20. #include <vector>
  21. class MXNetParam;
  22. class MXNetNode
  23. {
  24. public:
  25. bool has_attr(const char* key) const;
  26. class AttrProxy
  27. {
  28. MXNetNode const* _n;
  29. const char* const _key;
  30. public:
  31. AttrProxy( MXNetNode const* n, const char* key ) : _n(n), _key(key) {}
  32. operator int() const { return _n->attr_i(_key); }
  33. operator float() const { return _n->attr_f(_key); }
  34. operator std::string() const { return _n->attr_s(_key); }
  35. operator std::vector<int>() const { return _n->attr_ai(_key); }
  36. operator std::vector<float>() const { return _n->attr_af(_key); }
  37. };
  38. AttrProxy attr(const char* key) const { return AttrProxy(this, key); }
  39. int attr_i(const char* key) const;
  40. float attr_f(const char* key) const;
  41. std::string attr_s(const char* key) const;
  42. std::vector<int> attr_ai(const char* key) const;
  43. std::vector<float> attr_af(const char* key) const;
  44. public:
  45. bool is_weight() const;
  46. bool has_weight(int i) const;
  47. std::vector<float> weight(int i, int init_len = 0) const;
  48. std::vector<MXNetNode>* nodes;// reference
  49. std::vector<MXNetParam>* params;// reference
  50. public:
  51. std::string op;
  52. std::string name;
  53. int output_size;
  54. std::map<std::string, std::string> attrs;
  55. std::vector<int> inputs;
  56. std::vector<int> subinputs;
  57. std::vector<int> weights;
  58. };
  59. class MXNetParam
  60. {
  61. public:
  62. std::string name;
  63. std::vector<float> data;
  64. std::string init;
  65. };
  66. bool MXNetNode::has_attr(const char* key) const
  67. {
  68. const std::map<std::string, std::string>::const_iterator it = attrs.find(key);
  69. return it != attrs.end();
  70. }
  71. int MXNetNode::attr_i(const char* key) const
  72. {
  73. const std::map<std::string, std::string>::const_iterator it = attrs.find(key);
  74. if (it == attrs.end())
  75. return 0;
  76. if (it->second == "False")
  77. return 0;
  78. if (it->second == "True")
  79. return 1;
  80. int i = 0;
  81. int nscan = sscanf(it->second.c_str(), "%d", &i);
  82. if (nscan != 1)
  83. return 0;
  84. return i;
  85. }
  86. float MXNetNode::attr_f(const char* key) const
  87. {
  88. const std::map<std::string, std::string>::const_iterator it = attrs.find(key);
  89. if (it == attrs.end())
  90. return 0.f;
  91. float f = 0;
  92. int nscan = sscanf(it->second.c_str(), "%f", &f);
  93. if (nscan != 1)
  94. return 0.f;
  95. return f;
  96. }
  97. std::string MXNetNode::attr_s(const char* key) const
  98. {
  99. const std::map<std::string, std::string>::const_iterator it = attrs.find(key);
  100. if (it == attrs.end())
  101. return std::string();
  102. return it->second;
  103. }
  104. std::vector<int> MXNetNode::attr_ai(const char* key) const
  105. {
  106. const std::map<std::string, std::string>::const_iterator it = attrs.find(key);
  107. if (it == attrs.end())
  108. return std::vector<int>();
  109. // (1,2,3)
  110. std::vector<int> list;
  111. int i = 0;
  112. int c = 0;
  113. int nconsumed = 0;
  114. int nscan = sscanf(it->second.c_str() + c, "%*[(,]%d%n", &i, &nconsumed);
  115. if (nscan != 1)
  116. {
  117. // (None
  118. if (strncmp(it->second.c_str() + c, "(None", 5) == 0)
  119. {
  120. i = -233;
  121. nconsumed = 5;
  122. nscan = 1;
  123. }
  124. }
  125. while (nscan == 1)
  126. {
  127. list.push_back(i);
  128. // fprintf(stderr, "%d\n", i);
  129. i = 0;
  130. c += nconsumed;
  131. nscan = sscanf(it->second.c_str() + c, "%*[(,]%d%n", &i, &nconsumed);
  132. if (nscan != 1)
  133. {
  134. // , None
  135. if (strncmp(it->second.c_str() + c, ", None", 6) == 0)
  136. {
  137. i = -233;
  138. nconsumed = 6;
  139. nscan = 1;
  140. }
  141. }
  142. }
  143. return list;
  144. }
  145. std::vector<float> MXNetNode::attr_af(const char* key) const
  146. {
  147. const std::map<std::string, std::string>::const_iterator it = attrs.find(key);
  148. if (it == attrs.end())
  149. return std::vector<float>();
  150. // (0.1,0.2,0.3)
  151. std::vector<float> list;
  152. float i = 0.f;
  153. int c = 0;
  154. int nconsumed = 0;
  155. int nscan = sscanf(it->second.c_str() + c, "%*[(,]%f%n", &i, &nconsumed);
  156. while (nscan == 1)
  157. {
  158. list.push_back(i);
  159. // fprintf(stderr, "%f\n", i);
  160. i = 0.f;
  161. c += nconsumed;
  162. nscan = sscanf(it->second.c_str() + c, "%*[(,]%f%n", &i, &nconsumed);
  163. }
  164. return list;
  165. }
  166. bool MXNetNode::is_weight() const
  167. {
  168. for (int i=0; i<(int)(*params).size(); i++)
  169. {
  170. const MXNetParam& p = (*params)[i];
  171. if (p.name == name)
  172. return true;
  173. }
  174. return false;
  175. }
  176. bool MXNetNode::has_weight(int i) const
  177. {
  178. if (i < 0 || i >= (int)weights.size())
  179. return false;
  180. const std::string& name = (*nodes)[ weights[i] ].name;
  181. for (int i=0; i<(int)(*params).size(); i++)
  182. {
  183. const MXNetParam& p = (*params)[i];
  184. if (p.name == name)
  185. return true;
  186. }
  187. return false;
  188. }
  189. std::vector<float> MXNetNode::weight(int i, int init_len) const
  190. {
  191. if (i < 0 || i >= (int)weights.size())
  192. return std::vector<float>();
  193. const std::string& name = (*nodes)[ weights[i] ].name;
  194. for (int i=0; i<(int)(*params).size(); i++)
  195. {
  196. const MXNetParam& p = (*params)[i];
  197. if (p.name != name)
  198. continue;
  199. if (!p.data.empty())
  200. return p.data;
  201. std::vector<float> data;
  202. if (!p.init.empty() && init_len != 0)
  203. {
  204. if (p.init == "[\\$zero\\$, {}]" || p.init == "[\\\"zero\\\", {}]" || p.init == "zeros")
  205. {
  206. data.resize(init_len, 0.f);
  207. }
  208. else if (p.init == "[\\$one\\$, {}]" || p.init == "[\\\"one\\\", {}]" || p.init == "ones")
  209. {
  210. data.resize(init_len, 1.f);
  211. }
  212. }
  213. return data;
  214. }
  215. return std::vector<float>();
  216. }
  217. static void replace_backslash_doublequote_dollar(char* s)
  218. {
  219. char* a = s;
  220. char* b = s+1;
  221. while (*a && *b)
  222. {
  223. if (*a == '\\' && *b == '\"')
  224. {
  225. *b = '$';
  226. }
  227. a++;
  228. b++;
  229. }
  230. }
  231. static void parse_input_list(const char* s, std::vector<int>& inputs, std::vector<int>& subinputs)
  232. {
  233. inputs.clear();
  234. subinputs.clear();
  235. if (memcmp(s, "[]", 2) == 0)
  236. return;
  237. int nscan = 0;
  238. int nconsumed = 0;
  239. int id;
  240. int subid;
  241. int c = 1;// skip leading [
  242. nscan = sscanf(s + c, "[%d, %d%n", &id, &subid, &nconsumed);
  243. while (nscan == 2)
  244. {
  245. inputs.push_back(id);
  246. subinputs.push_back(subid);
  247. // fprintf(stderr, "%d %d\n", id, subid);
  248. c += nconsumed;
  249. nscan = sscanf(s + c, "%*[^[][%d, %d%n", &id, &subid, &nconsumed);
  250. }
  251. }
  252. static bool read_mxnet_json(const char* jsonpath, std::vector<MXNetNode>& nodes)
  253. {
  254. FILE* fp = fopen(jsonpath, "rb");
  255. if (!fp)
  256. {
  257. fprintf(stderr, "fopen %s failed\n", jsonpath);
  258. return false;
  259. }
  260. int internal_unknown = 0;
  261. int internal_underscore = 0;
  262. char line[1024];
  263. //{
  264. char* s = fgets(line, 1024, fp);
  265. if (!s)
  266. {
  267. fprintf(stderr, "fgets %s failed\n", jsonpath);
  268. return false;
  269. }
  270. MXNetNode n;
  271. bool in_nodes_list = false;
  272. bool in_node_block = false;
  273. bool in_attr_block = false;
  274. bool in_inputs_block = false;
  275. while (!feof(fp))
  276. {
  277. char* s = fgets(line, 1024, fp);
  278. if (!s)
  279. break;
  280. if (in_inputs_block)
  281. {
  282. // ]
  283. if (memcmp(line, " ]", 7) == 0)
  284. {
  285. in_inputs_block = false;
  286. continue;
  287. }
  288. // [439, 0, 0],
  289. int id;
  290. int subid;
  291. int nscan = sscanf(line, " [%d, %d", &id, &subid);
  292. if (nscan == 2)
  293. {
  294. n.inputs.push_back(id);
  295. n.subinputs.push_back(subid);
  296. continue;
  297. }
  298. }
  299. if (in_attr_block)
  300. {
  301. // },
  302. if (memcmp(line, " }", 7) == 0)
  303. {
  304. in_attr_block = false;
  305. continue;
  306. }
  307. // replace \" with \$
  308. replace_backslash_doublequote_dollar(line);
  309. // "kernel": "(7,7)",
  310. char key[256] = {0};
  311. char value[256] = {0};
  312. int nscan = sscanf(line, " \"%255[^\"]\": \"%255[^\"]\"", key, value);
  313. if (nscan == 2)
  314. {
  315. n.attrs[key] = value;
  316. // fprintf(stderr, "# %s = %s\n", key, value);
  317. continue;
  318. }
  319. }
  320. if (in_node_block)
  321. {
  322. // },
  323. if (memcmp(line, " }", 5) == 0)
  324. {
  325. // new node
  326. if (n.name.empty())
  327. {
  328. // assign default unknown name
  329. char unknownname[256];
  330. sprintf(unknownname, "unknownncnn_%d", internal_unknown);
  331. n.name = unknownname;
  332. internal_unknown++;
  333. }
  334. if (n.name[0] == '_')
  335. {
  336. // workaround for potential duplicated _plus0
  337. char underscorename[256];
  338. sprintf(underscorename, "underscorencnn_%d%s", internal_underscore, n.name.c_str());
  339. n.name = underscorename;
  340. internal_underscore++;
  341. }
  342. nodes.push_back(n);
  343. in_node_block = false;
  344. continue;
  345. }
  346. int nscan;
  347. // "op": "Convolution",
  348. char op[256] = {0};
  349. nscan = sscanf(line, " \"op\": \"%255[^\"]\",", op);
  350. if (nscan == 1)
  351. {
  352. n.op = op;
  353. // fprintf(stderr, "op = %s\n", op);
  354. continue;
  355. }
  356. // "name": "conv0",
  357. char name[256] = {0};
  358. nscan = sscanf(line, " \"name\": \"%255[^\"]\",", name);
  359. if (nscan == 1)
  360. {
  361. n.name = name;
  362. // fprintf(stderr, "name = %s\n", name);
  363. continue;
  364. }
  365. // "inputs": [
  366. if (memcmp(line, " \"inputs\": [\n", 18) == 0)
  367. {
  368. in_inputs_block = true;
  369. continue;
  370. }
  371. // "inputs": []
  372. char inputs[256] = {0};
  373. nscan = sscanf(line, " \"inputs\": %255[^\n]", inputs);
  374. if (nscan == 1)
  375. {
  376. parse_input_list(inputs, n.inputs, n.subinputs);
  377. // fprintf(stderr, "inputs = %s\n", inputs);
  378. continue;
  379. }
  380. // "param": {},
  381. if (memcmp(line, " \"param\": {}", 17) == 0)
  382. {
  383. continue;
  384. }
  385. // replace \" with \$
  386. replace_backslash_doublequote_dollar(line);
  387. // "attr": {"__init__": "[\"zero\", {}]"},
  388. char key[256] = {0};
  389. char value[256] = {0};
  390. nscan = sscanf(line, " \"attr\": {\"%255[^\"]\": \"%255[^\"]\"}", key, value);
  391. if (nscan == 2)
  392. {
  393. n.attrs[key] = value;
  394. // fprintf(stderr, "# %s = %s\n", key, value);
  395. continue;
  396. }
  397. // "attrs": {"__init__": "[\"zero\", {}]"},
  398. nscan = sscanf(line, " \"attrs\": {\"%255[^\"]\": \"%255[^\"]\"}", key, value);
  399. if (nscan == 2)
  400. {
  401. n.attrs[key] = value;
  402. // fprintf(stderr, "# %s = %s\n", key, value);
  403. continue;
  404. }
  405. // "param": {"p": "0.5"},
  406. nscan = sscanf(line, " \"param\": {\"%255[^\"]\": \"%255[^\"]\"}", key, value);
  407. if (nscan == 2)
  408. {
  409. n.attrs[key] = value;
  410. // fprintf(stderr, "# %s = %s\n", key, value);
  411. continue;
  412. }
  413. // "attr": {
  414. if (memcmp(line, " \"attr\": {", 15) == 0)
  415. {
  416. in_attr_block = true;
  417. continue;
  418. }
  419. // "attrs": {
  420. if (memcmp(line, " \"attrs\": {", 16) == 0)
  421. {
  422. in_attr_block = true;
  423. continue;
  424. }
  425. // "param": {
  426. if (memcmp(line, " \"param\": {", 16) == 0)
  427. {
  428. in_attr_block = true;
  429. continue;
  430. }
  431. }
  432. if (in_nodes_list)
  433. {
  434. // ],
  435. if (memcmp(line, " ],", 4) == 0)
  436. {
  437. in_nodes_list = false;
  438. // all nodes parsed
  439. break;
  440. }
  441. // {
  442. if (memcmp(line, " {", 5) == 0)
  443. {
  444. n = MXNetNode();
  445. in_node_block = true;
  446. continue;
  447. }
  448. }
  449. // "nodes": [
  450. if (memcmp(line, " \"nodes\": [", 12) == 0)
  451. {
  452. in_nodes_list = true;
  453. continue;
  454. }
  455. }
  456. fclose(fp);
  457. return true;
  458. }
  459. static bool read_mxnet_param(const char* parampath, std::vector<MXNetParam>& params)
  460. {
  461. FILE* fp = fopen(parampath, "rb");
  462. if (!fp)
  463. {
  464. fprintf(stderr, "fopen %s failed\n", parampath);
  465. return false;
  466. }
  467. int nread;
  468. uint64_t header;
  469. uint64_t reserved;
  470. nread = fread(&header, sizeof(uint64_t), 1, fp);
  471. if (nread != 1)
  472. {
  473. fprintf(stderr, "read header failed %d\n", nread);
  474. return false;
  475. }
  476. nread = fread(&reserved, sizeof(uint64_t), 1, fp);
  477. if (nread != 1)
  478. {
  479. fprintf(stderr, "read reserved failed %d\n", nread);
  480. return false;
  481. }
  482. // NDArray vec
  483. // each data
  484. uint64_t data_count;
  485. nread = fread(&data_count, sizeof(uint64_t), 1, fp);
  486. if (nread != 1)
  487. {
  488. fprintf(stderr, "read data_count failed %d\n", nread);
  489. return false;
  490. }
  491. // fprintf(stderr, "data count = %d\n", (int)data_count);
  492. for (int i = 0; i < (int)data_count; i++)
  493. {
  494. uint32_t magic;// 0xF993FAC9
  495. nread = fread(&magic, sizeof(uint32_t), 1, fp);
  496. if (nread != 1)
  497. {
  498. fprintf(stderr, "read magic failed %d\n", nread);
  499. return false;
  500. }
  501. // shape
  502. uint32_t ndim;
  503. std::vector<int64_t> shape;
  504. if (magic == 0xF993FAC9)
  505. {
  506. int32_t stype;
  507. nread = fread(&stype, sizeof(int32_t), 1, fp);
  508. if (nread != 1)
  509. {
  510. fprintf(stderr, "read stype failed %d\n", nread);
  511. return false;
  512. }
  513. nread = fread(&ndim, sizeof(uint32_t), 1, fp);
  514. if (nread != 1)
  515. {
  516. fprintf(stderr, "read ndim failed %d\n", nread);
  517. return false;
  518. }
  519. shape.resize(ndim);
  520. nread = fread(&shape[0], ndim * sizeof(int64_t), 1, fp);
  521. if (nread != 1)
  522. {
  523. fprintf(stderr, "read shape failed %d\n", nread);
  524. return false;
  525. }
  526. }
  527. else if (magic == 0xF993FAC8)
  528. {
  529. nread = fread(&ndim, sizeof(uint32_t), 1, fp);
  530. if (nread != 1)
  531. {
  532. fprintf(stderr, "read ndim failed %d\n", nread);
  533. return false;
  534. }
  535. shape.resize(ndim);
  536. nread = fread(&shape[0], ndim * sizeof(int64_t), 1, fp);
  537. if (nread != 1)
  538. {
  539. fprintf(stderr, "read shape failed %d\n", nread);
  540. return false;
  541. }
  542. }
  543. else
  544. {
  545. ndim = magic;
  546. shape.resize(ndim);
  547. std::vector<uint32_t> shape32;
  548. shape32.resize(ndim);
  549. nread = fread(&shape32[0], ndim * sizeof(uint32_t), 1, fp);
  550. if (nread != 1)
  551. {
  552. fprintf(stderr, "read shape failed %d\n", nread);
  553. return false;
  554. }
  555. for (int j=0; j<(int)ndim; j++)
  556. {
  557. shape[j] = shape32[j];
  558. }
  559. }
  560. // context
  561. int32_t dev_type;
  562. int32_t dev_id;
  563. nread = fread(&dev_type, sizeof(int32_t), 1, fp);
  564. if (nread != 1)
  565. {
  566. fprintf(stderr, "read dev_type failed %d\n", nread);
  567. return false;
  568. }
  569. nread = fread(&dev_id, sizeof(int32_t), 1, fp);
  570. if (nread != 1)
  571. {
  572. fprintf(stderr, "read dev_id failed %d\n", nread);
  573. return false;
  574. }
  575. int32_t type_flag;
  576. nread = fread(&type_flag, sizeof(int32_t), 1, fp);
  577. if (nread != 1)
  578. {
  579. fprintf(stderr, "read type_flag failed %d\n", nread);
  580. return false;
  581. }
  582. // data
  583. size_t len = 0;
  584. if (shape.size() == 1) len = shape[0];
  585. if (shape.size() == 2) len = shape[0] * shape[1];
  586. if (shape.size() == 3) len = shape[0] * shape[1] * shape[2];
  587. if (shape.size() == 4) len = shape[0] * shape[1] * shape[2] * shape[3];
  588. MXNetParam p;
  589. p.data.resize(len);
  590. nread = fread(&p.data[0], len * sizeof(float), 1, fp);
  591. if (nread != 1)
  592. {
  593. fprintf(stderr, "read MXNetParam data failed %d\n", nread);
  594. return false;
  595. }
  596. params.push_back(p);
  597. // fprintf(stderr, "%u read\n", len);
  598. }
  599. // each name
  600. uint64_t name_count;
  601. nread = fread(&name_count, sizeof(uint64_t), 1, fp);
  602. if (nread != 1)
  603. {
  604. fprintf(stderr, "read name_count failed %d\n", nread);
  605. return false;
  606. }
  607. // fprintf(stderr, "name count = %d\n", (int)name_count);
  608. for (int i = 0; i < (int)name_count; i++)
  609. {
  610. uint64_t len;
  611. nread = fread(&len, sizeof(uint64_t), 1, fp);
  612. if (nread != 1)
  613. {
  614. fprintf(stderr, "read name length failed %d\n", nread);
  615. return false;
  616. }
  617. MXNetParam& p = params[i];
  618. p.name.resize(len);
  619. nread = fread((char*)p.name.data(), len, 1, fp);
  620. if (nread != 1)
  621. {
  622. fprintf(stderr, "read MXNetParam name failed %d\n", nread);
  623. return false;
  624. }
  625. // cut leading arg:
  626. if (memcmp(p.name.c_str(), "arg:", 4) == 0)
  627. {
  628. p.name = std::string(p.name.c_str() + 4);
  629. }
  630. if (memcmp(p.name.c_str(), "aux:", 4) == 0)
  631. {
  632. p.name = std::string(p.name.c_str() + 4);
  633. }
  634. // fprintf(stderr, "%s read\n", p.name.c_str());
  635. }
  636. fclose(fp);
  637. return true;
  638. }
  639. static void fuse_shufflechannel(std::vector<MXNetNode>& nodes, std::vector<MXNetParam>& params, std::map<int, int>& node_reference, std::set<std::string>& blob_names, int& reduced_node_count)
  640. {
  641. int node_count = nodes.size();
  642. for (int i=0; i<node_count; i++)
  643. {
  644. const MXNetNode& n = nodes[i];
  645. if (n.is_weight())
  646. continue;
  647. // ShuffleChannel <= Reshape - SwapAxis - Reshape
  648. if (n.op == "Reshape")
  649. {
  650. if (node_reference.find(i) == node_reference.end() || node_reference[i] != 1)
  651. continue;
  652. // "shape": "(0, -4, X, -1, -2)"
  653. std::vector<int> shape = n.attr("shape");
  654. if (shape.size() != 5)
  655. continue;
  656. if (shape[0] != 0 || shape[1] != -4 || shape[3] != -1 || shape[4] != -2)
  657. continue;
  658. if (i+2 >= node_count)
  659. continue;
  660. const MXNetNode& n2 = nodes[i+1];
  661. const MXNetNode& n3 = nodes[i+2];
  662. if (n2.op != "SwapAxis" || n3.op != "Reshape")
  663. continue;
  664. if (node_reference.find(i+1) == node_reference.end() || node_reference[i+1] != 1)
  665. continue;
  666. // "dim1": "1", "dim2": "2"
  667. int dim1 = n2.attr("dim1");
  668. int dim2 = n2.attr("dim2");
  669. if (dim1 != 1 || dim2 != 2)
  670. continue;
  671. // "shape": "(0, -3, -2)"
  672. std::vector<int> shape3 = n3.attr("shape");
  673. if (shape3.size() != 3)
  674. continue;
  675. if (shape3[0] != 0 || shape3[1] != -3 || shape3[2] != -2)
  676. continue;
  677. // reduce
  678. nodes[i].op = "noop_reducedncnn";
  679. nodes[i+1].op = "noop_reducedncnn";
  680. node_reference.erase(node_reference.find(i));
  681. node_reference.erase(node_reference.find(i+1));
  682. blob_names.erase(n.name);
  683. blob_names.erase(n2.name);
  684. MXNetNode new_node;
  685. new_node.nodes = &nodes;
  686. new_node.params = &params;
  687. new_node.op = "ShuffleChannel";
  688. // new_node.name = n.name + "_" + n2.name + "_" + n3.name;
  689. new_node.name = n3.name;
  690. new_node.output_size = n3.output_size;
  691. char group[16];
  692. sprintf(group, "%d", shape[2]);
  693. new_node.attrs["group"] = group;
  694. new_node.inputs = n.inputs;
  695. new_node.subinputs = n.subinputs;
  696. nodes[i+2] = new_node;
  697. reduced_node_count += 2;
  698. i += 2;
  699. }
  700. }
  701. }
  702. static void fuse_hardsigmoid_hardswish(std::vector<MXNetNode>& nodes, std::vector<MXNetParam>& params, std::map<int, int>& node_reference, std::set<std::string>& blob_names, int& reduced_node_count)
  703. {
  704. int node_count = nodes.size();
  705. for (int i=0; i<node_count; i++)
  706. {
  707. const MXNetNode& n = nodes[i];
  708. if (n.is_weight())
  709. continue;
  710. if (n.op == "_plus_scalar")
  711. {
  712. // HardSigmoid <= _plus_scalar(+3) - clip(0,6) - _div_scalar(/6)
  713. const MXNetNode& n1 = nodes[i+1];
  714. const MXNetNode& n2 = nodes[i+2];
  715. const MXNetNode& n3 = nodes[i+3];
  716. if ((float)n.attr("scalar") != 3.f)
  717. continue;
  718. if (n1.op != "clip" || (float)n1.attr("a_min") != 0.f || (float)n1.attr("a_max") != 6.f)
  719. continue;
  720. if (n2.op != "_div_scalar" || (float)n2.attr("scalar") != 6.f)
  721. continue;
  722. // reduce
  723. nodes[i].op = "noop_reducedncnn";
  724. nodes[i+1].op = "noop_reducedncnn";
  725. node_reference.erase(node_reference.find(i));
  726. node_reference.erase(node_reference.find(i+1));
  727. blob_names.erase(n.name);
  728. blob_names.erase(n1.name);
  729. if (n3.op != "elemwise_mul" || n3.inputs[0] != n.inputs[0])
  730. {
  731. MXNetNode new_node;
  732. new_node.nodes = &nodes;
  733. new_node.params = &params;
  734. new_node.op = "HardSigmoid";
  735. new_node.name = n2.name;
  736. new_node.output_size = n2.output_size;
  737. char alpha[16], beta[16];
  738. sprintf(alpha, "%f", 1.f/6.f);
  739. sprintf(beta, "%f", 3.f/6.f);
  740. new_node.attrs["alpha"] = alpha;
  741. new_node.attrs["beta"] = beta;
  742. new_node.inputs = n.inputs;
  743. new_node.subinputs = n.subinputs;
  744. nodes[i+2] = new_node;
  745. reduced_node_count += 2;
  746. i += 2;
  747. }
  748. else // HardSwish <= HardSigmoid - Mul
  749. {
  750. nodes[i+2].op = "noop_reducedncnn";
  751. node_reference[i-1]--;
  752. node_reference.erase(node_reference.find(i+2));
  753. blob_names.erase(n2.name);
  754. MXNetNode new_node;
  755. new_node.nodes = &nodes;
  756. new_node.params = &params;
  757. new_node.op = "HardSwish";
  758. new_node.name = n3.name;
  759. new_node.output_size = n3.output_size;
  760. char alpha[16], beta[16];
  761. sprintf(alpha, "%f", 1.f/6.f);
  762. sprintf(beta, "%f", 3.f/6.f);
  763. new_node.attrs["alpha"] = alpha;
  764. new_node.attrs["beta"] = beta;
  765. new_node.inputs = n.inputs;
  766. new_node.subinputs = n.subinputs;
  767. nodes[i+3] = new_node;
  768. reduced_node_count += 3;
  769. i += 3;
  770. }
  771. }
  772. }
  773. }
  774. int main(int argc, char** argv)
  775. {
  776. const char* jsonpath = argv[1];
  777. const char* parampath = argv[2];
  778. const char* ncnn_prototxt = argc >= 5 ? argv[3] : "ncnn.param";
  779. const char* ncnn_modelbin = argc >= 5 ? argv[4] : "ncnn.bin";
  780. std::vector<MXNetNode> nodes;
  781. std::vector<MXNetParam> params;
  782. read_mxnet_json(jsonpath, nodes);
  783. read_mxnet_param(parampath, params);
  784. FILE* pp = fopen(ncnn_prototxt, "wb");
  785. FILE* bp = fopen(ncnn_modelbin, "wb");
  786. // magic
  787. fprintf(pp, "7767517\n");
  788. int node_count = nodes.size();
  789. // node reference
  790. std::map<int, int> node_reference;
  791. // weight node
  792. std::vector<int> weight_nodes;
  793. // global definition line
  794. // [layer count] [blob count]
  795. std::set<std::string> blob_names;
  796. for (int i=0; i<node_count; i++)
  797. {
  798. MXNetNode& n = nodes[i];
  799. // assign global param reference
  800. n.nodes = &nodes;
  801. n.params = &params;
  802. const std::string& output_name = n.name;
  803. n.output_size = 1;
  804. if (n.op == "null")
  805. {
  806. if (n.is_weight())
  807. {
  808. weight_nodes.push_back(i);
  809. }
  810. else
  811. {
  812. if (n.has_attr("__init__"))
  813. {
  814. // init weight param
  815. MXNetParam pi;
  816. pi.name = n.name;
  817. pi.init = (std::string)n.attr("__init__");
  818. params.push_back(pi);
  819. weight_nodes.push_back(i);
  820. }
  821. else
  822. {
  823. // null node without data, treat it as network input
  824. }
  825. }
  826. continue;
  827. }
  828. else if (n.op == "_contrib_MultiBoxTarget")
  829. {
  830. n.output_size = 3;
  831. }
  832. else if (n.op == "SliceChannel")
  833. {
  834. n.output_size = n.attr("num_outputs");
  835. }
  836. // distinguish weights and inputs
  837. std::vector<int> weights;
  838. std::vector<int> inputs;
  839. for (int j=0; j<(int)n.inputs.size(); j++)
  840. {
  841. int input_index = n.inputs[j];
  842. if (nodes[input_index].is_weight())
  843. {
  844. weights.push_back(input_index);
  845. continue;
  846. }
  847. inputs.push_back(input_index);
  848. }
  849. n.inputs = inputs;
  850. n.weights = weights;
  851. if (n.op == "_contrib_MultiBoxDetection")
  852. {
  853. // reorder input blob
  854. int temp = n.inputs[0];
  855. n.inputs[0] = n.inputs[1];
  856. n.inputs[1] = temp;
  857. }
  858. // input
  859. for (int j=0; j<(int)n.inputs.size(); j++)
  860. {
  861. int input_index = n.inputs[j];
  862. int subinput_index = n.subinputs[j];
  863. std::string input_name = nodes[input_index].name;
  864. // fprintf(stderr, "input = %s\n", input_name.c_str());
  865. if (subinput_index != 0)
  866. {
  867. char subinputsuffix[256];
  868. sprintf(subinputsuffix, "_subncnn_%d", subinput_index);
  869. input_name = input_name + subinputsuffix;
  870. }
  871. blob_names.insert(input_name);
  872. int input_uid = input_index | (subinput_index << 16);
  873. if (node_reference.find(input_uid) == node_reference.end())
  874. {
  875. node_reference[input_uid] = 1;
  876. }
  877. else
  878. {
  879. node_reference[input_uid] = node_reference[input_uid] + 1;
  880. }
  881. }
  882. // output
  883. // fprintf(stderr, "output = %s\n", output_name.c_str());
  884. blob_names.insert(output_name);
  885. for (int j=1; j<n.output_size; j++)
  886. {
  887. char subinputsuffix[256];
  888. sprintf(subinputsuffix, "_%d", j);
  889. std::string output_name_j = output_name + subinputsuffix;
  890. blob_names.insert(output_name_j);
  891. }
  892. }
  893. // for (std::map<int, int>::iterator it = node_reference.begin(); it != node_reference.end(); it++)
  894. // {
  895. // fprintf(stderr, "ref %d %d\n", it->first, it->second);
  896. // }
  897. // op chain fusion
  898. int reduced_node_count = 0;
  899. fuse_shufflechannel (nodes, params, node_reference, blob_names, reduced_node_count);
  900. fuse_hardsigmoid_hardswish(nodes, params, node_reference, blob_names, reduced_node_count);
  901. // remove node_reference entry with reference equals to one
  902. int splitncnn_blob_count = 0;
  903. std::map<int, int>::iterator it = node_reference.begin();
  904. while (it != node_reference.end())
  905. {
  906. if (it->second == 1)
  907. {
  908. node_reference.erase(it++);
  909. }
  910. else
  911. {
  912. splitncnn_blob_count += it->second;
  913. // fprintf(stderr, "%s %d\n", it->first.c_str(), it->second);
  914. ++it;
  915. }
  916. }
  917. // fprintf(stderr, "%d %d %d %d, %d %d\n", node_count, reduced_node_count, node_reference.size(), weight_nodes.size(), blob_names.size(), splitncnn_blob_count);
  918. fprintf(pp, "%lu %lu\n", node_count - reduced_node_count + node_reference.size() - weight_nodes.size(), blob_names.size() + splitncnn_blob_count);
  919. int internal_split = 0;
  920. for (int i=0; i<node_count; i++)
  921. {
  922. const MXNetNode& n = nodes[i];
  923. if (n.op == "noop_reducedncnn")
  924. {
  925. continue;
  926. }
  927. if (n.op == "null")
  928. {
  929. if (n.is_weight())
  930. {
  931. continue;
  932. }
  933. fprintf(pp, "%-16s", "Input");
  934. }
  935. else if (n.op == "_contrib_BilinearResize2D")
  936. {
  937. fprintf(pp, "%-16s", "Interp");
  938. }
  939. else if (n.op == "_contrib_MultiBoxDetection")
  940. {
  941. fprintf(pp, "%-16s", "DetectionOutput");
  942. }
  943. else if (n.op == "_contrib_MultiBoxPrior")
  944. {
  945. fprintf(pp, "%-16s", "PriorBox");
  946. }
  947. else if (n.op == "_copy")
  948. {
  949. fprintf(pp, "%-16s", "Noop");
  950. }
  951. else if (n.op == "_div_scalar")
  952. {
  953. fprintf(pp, "%-16s", "BinaryOp");
  954. }
  955. else if (n.op == "_maximum_scalar")
  956. {
  957. fprintf(pp, "%-16s", "BinaryOp");
  958. }
  959. else if (n.op == "_minimum_scalar")
  960. {
  961. fprintf(pp, "%-16s", "BinaryOp");
  962. }
  963. else if (n.op == "_minus_scalar")
  964. {
  965. fprintf(pp, "%-16s", "BinaryOp");
  966. }
  967. else if (n.op == "_mul_scalar")
  968. {
  969. fprintf(pp, "%-16s", "BinaryOp");
  970. }
  971. else if (n.op == "_plus_scalar")
  972. {
  973. fprintf(pp, "%-16s", "BinaryOp");
  974. }
  975. else if (n.op == "_power_scalar")
  976. {
  977. fprintf(pp, "%-16s", "BinaryOp");
  978. }
  979. else if (n.op == "_rdiv_scalar")
  980. {
  981. fprintf(pp, "%-16s", "BinaryOp");
  982. }
  983. else if (n.op == "_rminus_scalar")
  984. {
  985. fprintf(pp, "%-16s", "BinaryOp");
  986. }
  987. else if (n.op == "abs")
  988. {
  989. fprintf(pp, "%-16s", "UnaryOp");
  990. }
  991. else if (n.op == "Activation")
  992. {
  993. std::string type = n.attr("act_type");
  994. if (type == "relu")
  995. {
  996. fprintf(pp, "%-16s", "ReLU");
  997. }
  998. else if (type == "sigmoid")
  999. {
  1000. fprintf(pp, "%-16s", "Sigmoid");
  1001. }
  1002. else if (type == "tanh")
  1003. {
  1004. fprintf(pp, "%-16s", "TanH");
  1005. }
  1006. }
  1007. else if (n.op == "add_n" || n.op == "ElementWiseSum")
  1008. {
  1009. fprintf(pp, "%-16s", "Eltwise");
  1010. }
  1011. else if (n.op == "arccos")
  1012. {
  1013. fprintf(pp, "%-16s", "UnaryOp");
  1014. }
  1015. else if (n.op == "arcsin")
  1016. {
  1017. fprintf(pp, "%-16s", "UnaryOp");
  1018. }
  1019. else if (n.op == "arctan")
  1020. {
  1021. fprintf(pp, "%-16s", "UnaryOp");
  1022. }
  1023. else if (n.op == "BatchNorm")
  1024. {
  1025. fprintf(pp, "%-16s", "BatchNorm");
  1026. }
  1027. else if (n.op == "broadcast_add")
  1028. {
  1029. fprintf(pp, "%-16s", "BinaryOp");
  1030. }
  1031. else if (n.op == "broadcast_div")
  1032. {
  1033. fprintf(pp, "%-16s", "BinaryOp");
  1034. }
  1035. else if (n.op == "broadcast_mul")
  1036. {
  1037. fprintf(pp, "%-16s", "BinaryOp");
  1038. }
  1039. else if (n.op == "broadcast_sub")
  1040. {
  1041. fprintf(pp, "%-16s", "BinaryOp");
  1042. }
  1043. else if (n.op == "ceil")
  1044. {
  1045. fprintf(pp, "%-16s", "UnaryOp");
  1046. }
  1047. else if (n.op == "clip")
  1048. {
  1049. fprintf(pp, "%-16s", "Clip");
  1050. }
  1051. else if (n.op == "Concat")
  1052. {
  1053. fprintf(pp, "%-16s", "Concat");
  1054. }
  1055. else if (n.op == "Convolution")
  1056. {
  1057. int num_group = n.attr("num_group");
  1058. if (num_group > 1) {
  1059. fprintf(pp, "%-16s", "ConvolutionDepthWise");
  1060. } else {
  1061. fprintf(pp, "%-16s", "Convolution");
  1062. }
  1063. }
  1064. else if (n.op == "cos")
  1065. {
  1066. fprintf(pp, "%-16s", "UnaryOp");
  1067. }
  1068. else if (n.op == "Crop")
  1069. {
  1070. fprintf(pp, "%-16s", "Crop");
  1071. }
  1072. else if (n.op == "Deconvolution")
  1073. {
  1074. int num_group = n.attr("num_group");
  1075. if (num_group > 1) {
  1076. fprintf(pp, "%-16s", "DeconvolutionDepthWise");
  1077. } else {
  1078. fprintf(pp, "%-16s", "Deconvolution");
  1079. }
  1080. }
  1081. else if (n.op == "Dropout")
  1082. {
  1083. fprintf(pp, "%-16s", "Dropout");
  1084. }
  1085. else if (n.op == "elemwise_add" || n.op == "_add" || n.op == "_plus" || n.op == "_Plus")
  1086. {
  1087. fprintf(pp, "%-16s", "BinaryOp");
  1088. }
  1089. else if (n.op == "elemwise_div" || n.op == "_div" || n.op == "_Div")
  1090. {
  1091. fprintf(pp, "%-16s", "BinaryOp");
  1092. }
  1093. else if (n.op == "elemwise_mul" || n.op == "_mul" || n.op == "_Mul")
  1094. {
  1095. fprintf(pp, "%-16s", "BinaryOp");
  1096. }
  1097. else if (n.op == "elemwise_sub" || n.op == "_sub" || n.op == "_minus" || n.op == "_Minus")
  1098. {
  1099. fprintf(pp, "%-16s", "BinaryOp");
  1100. }
  1101. else if (n.op == "Embedding")
  1102. {
  1103. fprintf(pp, "%-16s", "Embed");
  1104. }
  1105. else if (n.op == "exp")
  1106. {
  1107. fprintf(pp, "%-16s", "UnaryOp");
  1108. }
  1109. else if (n.op == "expand_dims")
  1110. {
  1111. fprintf(pp, "%-16s", "ExpandDims");
  1112. }
  1113. else if (n.op == "Flatten")
  1114. {
  1115. fprintf(pp, "%-16s", "Flatten");
  1116. }
  1117. else if (n.op == "floor")
  1118. {
  1119. fprintf(pp, "%-16s", "UnaryOp");
  1120. }
  1121. else if (n.op == "FullyConnected")
  1122. {
  1123. fprintf(pp, "%-16s", "InnerProduct");
  1124. }
  1125. else if (n.op == "HardSigmoid")
  1126. {
  1127. fprintf(pp, "%-16s", "HardSigmoid");
  1128. }
  1129. else if (n.op == "HardSwish")
  1130. {
  1131. fprintf(pp, "%-16s", "HardSwish");
  1132. }
  1133. else if (n.op == "InstanceNorm")
  1134. {
  1135. fprintf(pp, "%-16s", "InstanceNorm");
  1136. }
  1137. else if (n.op == "L2Normalization")
  1138. {
  1139. fprintf(pp, "%-16s", "Normalize");
  1140. }
  1141. else if (n.op == "LeakyReLU")
  1142. {
  1143. std::string type = n.attr("act_type");
  1144. if (type == "elu")
  1145. {
  1146. fprintf(pp, "%-16s", "ELU");
  1147. }
  1148. else if (type == "leaky" || type.empty())
  1149. {
  1150. fprintf(pp, "%-16s", "ReLU");
  1151. }
  1152. else if (type == "prelu")
  1153. {
  1154. fprintf(pp, "%-16s", "PReLU");
  1155. }
  1156. }
  1157. else if (n.op == "LinearRegressionOutput")
  1158. {
  1159. fprintf(pp, "%-16s", "Noop");
  1160. }
  1161. else if (n.op == "log")
  1162. {
  1163. fprintf(pp, "%-16s", "UnaryOp");
  1164. }
  1165. else if (n.op == "LogisticRegressionOutput")
  1166. {
  1167. fprintf(pp, "%-16s", "Sigmoid");
  1168. }
  1169. else if (n.op == "MAERegressionOutput")
  1170. {
  1171. fprintf(pp, "%-16s", "Noop");
  1172. }
  1173. else if (n.op == "max")
  1174. {
  1175. fprintf(pp, "%-16s", "Reduction");
  1176. }
  1177. else if (n.op == "maximum")
  1178. {
  1179. fprintf(pp, "%-16s", "BinaryOp");
  1180. }
  1181. else if (n.op == "mean")
  1182. {
  1183. fprintf(pp, "%-16s", "Reduction");
  1184. }
  1185. else if (n.op == "min")
  1186. {
  1187. fprintf(pp, "%-16s", "Reduction");
  1188. }
  1189. else if (n.op == "minimum")
  1190. {
  1191. fprintf(pp, "%-16s", "BinaryOp");
  1192. }
  1193. else if (n.op == "negative")
  1194. {
  1195. fprintf(pp, "%-16s", "UnaryOp");
  1196. }
  1197. else if (n.op == "Pad")
  1198. {
  1199. fprintf(pp, "%-16s", "Padding");
  1200. }
  1201. else if (n.op == "Pooling")
  1202. {
  1203. fprintf(pp, "%-16s", "Pooling");
  1204. }
  1205. else if (n.op == "prod")
  1206. {
  1207. fprintf(pp, "%-16s", "Reduction");
  1208. }
  1209. else if (n.op == "reciprocal")
  1210. {
  1211. fprintf(pp, "%-16s", "UnaryOp");
  1212. }
  1213. else if (n.op == "relu")
  1214. {
  1215. fprintf(pp, "%-16s", "ReLU");
  1216. }
  1217. else if (n.op == "Reshape")
  1218. {
  1219. fprintf(pp, "%-16s", "Reshape");
  1220. }
  1221. else if (n.op == "ShuffleChannel")
  1222. {
  1223. fprintf(pp, "%-16s", "ShuffleChannel");
  1224. }
  1225. else if (n.op == "sigmoid")
  1226. {
  1227. fprintf(pp, "%-16s", "Sigmoid");
  1228. }
  1229. else if (n.op == "sin")
  1230. {
  1231. fprintf(pp, "%-16s", "UnaryOp");
  1232. }
  1233. else if (n.op == "slice")
  1234. {
  1235. fprintf(pp, "%-16s", "Crop");
  1236. }
  1237. else if (n.op == "SliceChannel")
  1238. {
  1239. fprintf(pp, "%-16s", "Slice");
  1240. }
  1241. else if (n.op == "SoftmaxActivation")
  1242. {
  1243. fprintf(pp, "%-16s", "Softmax");
  1244. }
  1245. else if (n.op == "SoftmaxOutput")
  1246. {
  1247. fprintf(pp, "%-16s", "Softmax");
  1248. }
  1249. else if (n.op == "softmax")
  1250. {
  1251. fprintf(pp, "%-16s", "Softmax");
  1252. }
  1253. else if (n.op == "sqrt")
  1254. {
  1255. fprintf(pp, "%-16s", "UnaryOp");
  1256. }
  1257. else if (n.op == "square")
  1258. {
  1259. fprintf(pp, "%-16s", "UnaryOp");
  1260. }
  1261. else if (n.op == "sum")
  1262. {
  1263. fprintf(pp, "%-16s", "Reduction");
  1264. }
  1265. else if (n.op == "tan")
  1266. {
  1267. fprintf(pp, "%-16s", "UnaryOp");
  1268. }
  1269. else if (n.op == "tanh")
  1270. {
  1271. fprintf(pp, "%-16s", "TanH");
  1272. }
  1273. else if (n.op == "Transpose" || n.op == "transpose")
  1274. {
  1275. fprintf(pp, "%-16s", "Permute");
  1276. }
  1277. else if (n.op == "UpSampling")
  1278. {
  1279. std::string sample_type = n.attr("sample_type");
  1280. if (sample_type == "nearest")
  1281. {
  1282. fprintf(pp, "%-16s", "Interp");
  1283. }
  1284. else if (sample_type == "bilinear")
  1285. {
  1286. fprintf(pp, "%-16s", "DeconvolutionDepthWise");
  1287. }
  1288. }
  1289. else
  1290. {
  1291. fprintf(stderr, "%s not supported yet!\n", n.op.c_str());
  1292. fprintf(pp, "%-16s", n.op.c_str());
  1293. }
  1294. int input_size = n.inputs.size();
  1295. for (int j=0; j<(int)n.inputs.size(); j++)
  1296. {
  1297. int input_index = n.inputs[j];
  1298. if (nodes[input_index].is_weight())
  1299. {
  1300. input_size--;
  1301. }
  1302. }
  1303. if (n.op == "SoftmaxOutput" || n.op == "LogisticRegressionOutput")
  1304. {
  1305. // drop label
  1306. input_size--;
  1307. }
  1308. fprintf(pp, " %-32s %d %d", n.name.c_str(), input_size, n.output_size);
  1309. for (int j=0; j<(int)n.inputs.size(); j++)
  1310. {
  1311. int input_index = n.inputs[j];
  1312. int subinput_index = n.subinputs[j];
  1313. if (nodes[input_index].is_weight())
  1314. {
  1315. continue;
  1316. }
  1317. if (n.op == "SoftmaxOutput" || n.op == "LogisticRegressionOutput")
  1318. {
  1319. // drop label
  1320. if (j == 1)
  1321. continue;
  1322. }
  1323. std::string input_name = nodes[input_index].name;
  1324. if (subinput_index != 0)
  1325. {
  1326. char subinputsuffix[256];
  1327. sprintf(subinputsuffix, "_subncnn_%d", subinput_index);
  1328. input_name = input_name + subinputsuffix;
  1329. }
  1330. int input_uid = input_index | (subinput_index << 16);
  1331. if (node_reference.find(input_uid) != node_reference.end())
  1332. {
  1333. int refidx = node_reference[input_uid] - 1;
  1334. node_reference[input_uid] = refidx;
  1335. char splitsuffix[256];
  1336. sprintf(splitsuffix, "_splitncnn_%d", refidx);
  1337. input_name = input_name + splitsuffix;
  1338. }
  1339. fprintf(pp, " %s", input_name.c_str());
  1340. }
  1341. fprintf(pp, " %s", n.name.c_str());
  1342. for (int j=1; j<n.output_size; j++)
  1343. {
  1344. fprintf(pp, " %s_subncnn_%d", n.name.c_str(), j);
  1345. }
  1346. if (n.op == "null")
  1347. {
  1348. // dummy input shape
  1349. // fprintf(pp, " 0 0 0");
  1350. }
  1351. else if (n.op == "_contrib_BilinearResize2D")
  1352. {
  1353. float scale_height = n.has_attr("scale_height") ? n.attr("scale_height") : 1.f;
  1354. float scale_width = n.has_attr("scale_width") ? n.attr("scale_width") : 1.f;
  1355. int height = n.has_attr("scale_height") ? 0 : n.attr("height");
  1356. int width = n.has_attr("scale_width") ? 0 : n.attr("width");
  1357. fprintf(pp, " 0=2");
  1358. fprintf(pp, " 1=%e", scale_height);
  1359. fprintf(pp, " 2=%e", scale_width);
  1360. fprintf(pp, " 3=%d", height);
  1361. fprintf(pp, " 4=%d", width);
  1362. }
  1363. else if (n.op == "_contrib_MultiBoxDetection")
  1364. {
  1365. float threshold = n.has_attr("threshold") ? n.attr("threshold") : 0.01f;
  1366. float nms_threshold = n.has_attr("nms_threshold") ? n.attr("nms_threshold") : 0.5f;
  1367. int nms_topk = n.has_attr("nms_topk") ? n.attr("nms_topk") : 300;
  1368. fprintf(pp, " 0=-233");
  1369. fprintf(pp, " 1=%e", nms_threshold);
  1370. fprintf(pp, " 2=%d", nms_topk);
  1371. int keep_top_k = 100;
  1372. fprintf(pp, " 3=%d", keep_top_k);
  1373. fprintf(pp, " 4=%e", threshold);
  1374. std::vector<float> variances = n.attr("variances");
  1375. if (variances.empty())
  1376. {
  1377. fprintf(pp, " 5=0.1");
  1378. fprintf(pp, " 6=0.1");
  1379. fprintf(pp, " 7=0.2");
  1380. fprintf(pp, " 8=0.2");
  1381. }
  1382. else
  1383. {
  1384. fprintf(pp, " 5=%e", variances[0]);
  1385. fprintf(pp, " 6=%e", variances[1]);
  1386. fprintf(pp, " 7=%e", variances[2]);
  1387. fprintf(pp, " 8=%e", variances[3]);
  1388. }
  1389. }
  1390. else if (n.op == "_contrib_MultiBoxPrior")
  1391. {
  1392. // mxnet-ssd encode size as scale factor, fill min_size
  1393. std::vector<float> sizes = n.attr("sizes");
  1394. fprintf(pp, " -23300=%d", (int)sizes.size());
  1395. for (int j=0; j<(int)sizes.size(); j++)
  1396. {
  1397. fprintf(pp, ",%e", sizes[j]);
  1398. }
  1399. std::vector<float> aspect_ratios = n.attr("ratios");
  1400. fprintf(pp, " -23302=%d", (int)aspect_ratios.size());
  1401. for (int j=0; j<(int)aspect_ratios.size(); j++)
  1402. {
  1403. fprintf(pp, ",%e", aspect_ratios[j]);
  1404. }
  1405. int flip = 0;
  1406. fprintf(pp, " 7=%d", flip);
  1407. int clip = n.attr("clip");
  1408. fprintf(pp, " 8=%d", clip);
  1409. // auto image size
  1410. fprintf(pp, " 9=-233");
  1411. fprintf(pp, " 10=-233");
  1412. std::vector<float> steps = n.attr("steps");
  1413. if (steps.empty() || (steps[0] == -1.f && steps[1] == -1.f))
  1414. {
  1415. // auto step
  1416. fprintf(pp, " 11=-233.0");
  1417. fprintf(pp, " 12=-233.0");
  1418. }
  1419. else
  1420. {
  1421. fprintf(pp, " 11=%e", steps[1]);
  1422. fprintf(pp, " 12=%e", steps[0]);
  1423. }
  1424. std::vector<float> offsets = n.attr("offsets");
  1425. if (offsets.empty() || (offsets[0] == 0.5f && offsets[1] == 0.5f))
  1426. {
  1427. fprintf(pp, " 13=0.5");
  1428. }
  1429. else
  1430. {
  1431. fprintf(stderr, "Unsupported offsets param! %g %g\n", offsets[0], offsets[1]);
  1432. }
  1433. }
  1434. else if (n.op == "_copy")
  1435. {
  1436. }
  1437. else if (n.op == "_div_scalar")
  1438. {
  1439. int op_type = 3;
  1440. int with_scalar = 1;
  1441. float scalar = n.attr("scalar");
  1442. fprintf(pp, " 0=%d", op_type);
  1443. fprintf(pp, " 1=%d", with_scalar);
  1444. fprintf(pp, " 2=%e", scalar);
  1445. }
  1446. else if (n.op == "_maximum_scalar")
  1447. {
  1448. int op_type = 4;
  1449. int with_scalar = 1;
  1450. float scalar = n.attr("scalar");
  1451. fprintf(pp, " 0=%d", op_type);
  1452. fprintf(pp, " 1=%d", with_scalar);
  1453. fprintf(pp, " 2=%e", scalar);
  1454. }
  1455. else if (n.op == "_minimum_scalar")
  1456. {
  1457. int op_type = 5;
  1458. int with_scalar = 1;
  1459. float scalar = n.attr("scalar");
  1460. fprintf(pp, " 0=%d", op_type);
  1461. fprintf(pp, " 1=%d", with_scalar);
  1462. fprintf(pp, " 2=%e", scalar);
  1463. }
  1464. else if (n.op == "_minus_scalar")
  1465. {
  1466. int op_type = 1;
  1467. int with_scalar = 1;
  1468. float scalar = n.attr("scalar");
  1469. fprintf(pp, " 0=%d", op_type);
  1470. fprintf(pp, " 1=%d", with_scalar);
  1471. fprintf(pp, " 2=%e", scalar);
  1472. }
  1473. else if (n.op == "_mul_scalar")
  1474. {
  1475. int op_type = 2;
  1476. int with_scalar = 1;
  1477. float scalar = n.attr("scalar");
  1478. fprintf(pp, " 0=%d", op_type);
  1479. fprintf(pp, " 1=%d", with_scalar);
  1480. fprintf(pp, " 2=%e", scalar);
  1481. }
  1482. else if (n.op == "_plus_scalar")
  1483. {
  1484. int op_type = 0;
  1485. int with_scalar = 1;
  1486. float scalar = n.attr("scalar");
  1487. fprintf(pp, " 0=%d", op_type);
  1488. fprintf(pp, " 1=%d", with_scalar);
  1489. fprintf(pp, " 2=%e", scalar);
  1490. }
  1491. else if (n.op == "_power_scalar")
  1492. {
  1493. int op_type = 6;
  1494. int with_scalar = 1;
  1495. float scalar = n.attr("scalar");
  1496. fprintf(pp, " 0=%d", op_type);
  1497. fprintf(pp, " 1=%d", with_scalar);
  1498. fprintf(pp, " 2=%e", scalar);
  1499. }
  1500. else if (n.op == "_rdiv_scalar")
  1501. {
  1502. int op_type = 8;
  1503. int with_scalar = 1;
  1504. float scalar = n.attr("scalar");
  1505. fprintf(pp, " 0=%d", op_type);
  1506. fprintf(pp, " 1=%d", with_scalar);
  1507. fprintf(pp, " 2=%e", scalar);
  1508. }
  1509. else if (n.op == "_rminus_scalar")
  1510. {
  1511. int op_type = 7;
  1512. int with_scalar = 1;
  1513. float scalar = n.attr("scalar");
  1514. fprintf(pp, " 0=%d", op_type);
  1515. fprintf(pp, " 1=%d", with_scalar);
  1516. fprintf(pp, " 2=%e", scalar);
  1517. }
  1518. else if (n.op == "abs")
  1519. {
  1520. int op_type = 0;
  1521. fprintf(pp, " 0=%d", op_type);
  1522. }
  1523. else if (n.op == "Activation")
  1524. {
  1525. std::string type = n.attr("act_type");
  1526. if (type == "relu")
  1527. {
  1528. // fprintf(pp, " 0=%e", 0.f);
  1529. }
  1530. }
  1531. else if (n.op == "add_n" || n.op == "ElementWiseSum")
  1532. {
  1533. int op_type = 1;
  1534. fprintf(pp, " 0=%d", op_type);
  1535. }
  1536. else if (n.op == "arccos")
  1537. {
  1538. int op_type = 13;
  1539. fprintf(pp, " 0=%d", op_type);
  1540. }
  1541. else if (n.op == "arcsin")
  1542. {
  1543. int op_type = 12;
  1544. fprintf(pp, " 0=%d", op_type);
  1545. }
  1546. else if (n.op == "arctan")
  1547. {
  1548. int op_type = 14;
  1549. fprintf(pp, " 0=%d", op_type);
  1550. }
  1551. else if (n.op == "BatchNorm")
  1552. {
  1553. float eps = 1e-3;
  1554. if (n.has_attr("eps")) {
  1555. eps = n.attr("eps");
  1556. }
  1557. std::vector<float> slope_data = n.weight(0);
  1558. std::vector<float> bias_data = n.weight(1);
  1559. int channels = slope_data.size();
  1560. std::vector<float> mean_data = n.weight(2, channels);
  1561. std::vector<float> var_data = n.weight(3, channels);
  1562. for (int j=0; j<(int)var_data.size(); j++)
  1563. {
  1564. var_data[j] += eps;
  1565. }
  1566. fprintf(pp, " 0=%d", channels);
  1567. int fix_gamma = n.has_attr("fix_gamma") ? n.attr("fix_gamma") : 0;
  1568. if (fix_gamma)
  1569. {
  1570. // slope data are all 0 here, force set 1
  1571. for (int j=0; j<channels; j++)
  1572. {
  1573. slope_data[j] = 1.f;
  1574. }
  1575. }
  1576. fwrite(slope_data.data(), sizeof(float), slope_data.size(), bp);
  1577. fwrite(mean_data.data(), sizeof(float), mean_data.size(), bp);
  1578. fwrite(var_data.data(), sizeof(float), var_data.size(), bp);
  1579. fwrite(bias_data.data(), sizeof(float), bias_data.size(), bp);
  1580. }
  1581. else if (n.op == "broadcast_add")
  1582. {
  1583. int op_type = 0;
  1584. fprintf(pp, " 0=%d", op_type);
  1585. }
  1586. else if (n.op == "broadcast_div")
  1587. {
  1588. int op_type = 3;
  1589. fprintf(pp, " 0=%d", op_type);
  1590. }
  1591. else if (n.op == "broadcast_mul")
  1592. {
  1593. int op_type = 2;
  1594. fprintf(pp, " 0=%d", op_type);
  1595. }
  1596. else if (n.op == "broadcast_sub")
  1597. {
  1598. int op_type = 1;
  1599. fprintf(pp, " 0=%d", op_type);
  1600. }
  1601. else if (n.op == "ceil")
  1602. {
  1603. int op_type = 3;
  1604. fprintf(pp, " 0=%d", op_type);
  1605. }
  1606. else if (n.op == "clip")
  1607. {
  1608. float min = n.attr("a_min");
  1609. float max = n.attr("a_max");
  1610. fprintf(pp, " 0=%e", min);
  1611. fprintf(pp, " 1=%e", max);
  1612. }
  1613. else if (n.op == "Concat")
  1614. {
  1615. int dim = n.has_attr("dim") ? n.attr("dim") : 1;
  1616. fprintf(pp, " 0=%d", dim-1);
  1617. }
  1618. else if (n.op == "Convolution")
  1619. {
  1620. int num_filter = n.attr("num_filter");
  1621. std::vector<int> kernel = n.attr("kernel");
  1622. std::vector<int> dilate = n.attr("dilate");
  1623. std::vector<int> stride = n.attr("stride");
  1624. std::vector<int> pad = n.attr("pad");
  1625. int no_bias = n.attr("no_bias");
  1626. int num_group = n.attr("num_group");
  1627. std::vector<float> weight_data = n.weight(0);
  1628. std::vector<float> bias_data = n.weight(1);
  1629. fprintf(pp, " 0=%d", num_filter);
  1630. if (kernel.size() == 1) {
  1631. fprintf(pp, " 1=%d", kernel[0]);
  1632. } else if (kernel.size() == 2) {
  1633. fprintf(pp, " 1=%d", kernel[1]);
  1634. fprintf(pp, " 11=%d", kernel[0]);
  1635. }
  1636. if (dilate.size() == 1) {
  1637. fprintf(pp, " 2=%d", dilate[0]);
  1638. } else if (dilate.size() == 2) {
  1639. fprintf(pp, " 2=%d", dilate[1]);
  1640. fprintf(pp, " 12=%d", dilate[0]);
  1641. }
  1642. if (stride.size() == 1) {
  1643. fprintf(pp, " 3=%d", stride[0]);
  1644. } else if (stride.size() == 2) {
  1645. fprintf(pp, " 3=%d", stride[1]);
  1646. fprintf(pp, " 13=%d", stride[0]);
  1647. }
  1648. if (pad.size() == 1) {
  1649. fprintf(pp, " 4=%d", pad[0]);
  1650. } else if (pad.size() == 2) {
  1651. fprintf(pp, " 4=%d", pad[1]);
  1652. fprintf(pp, " 14=%d", pad[0]);
  1653. }
  1654. fprintf(pp, " 5=%d", no_bias == 1 ? 0 : 1);
  1655. fprintf(pp, " 6=%d", (int)weight_data.size());
  1656. if (num_group > 1) {
  1657. fprintf(pp, " 7=%d", num_group);
  1658. }
  1659. int quantize_tag = 0;
  1660. fwrite(&quantize_tag, sizeof(int), 1, bp);
  1661. fwrite(weight_data.data(), sizeof(float), weight_data.size(), bp);
  1662. fwrite(bias_data.data(), sizeof(float), bias_data.size(), bp);
  1663. }
  1664. else if (n.op == "Deconvolution")
  1665. {
  1666. int num_filter = n.attr("num_filter");
  1667. std::vector<int> kernel = n.attr("kernel");
  1668. std::vector<int> dilate = n.attr("dilate");
  1669. std::vector<int> stride = n.attr("stride");
  1670. std::vector<int> pad = n.attr("pad");
  1671. std::vector<int> adj = n.attr("adj");
  1672. std::vector<int> target_shape = n.attr("target_shape");
  1673. int no_bias = n.attr("no_bias");
  1674. int num_group = n.attr("num_group");
  1675. std::vector<float> weight_data = n.weight(0);
  1676. std::vector<float> bias_data = n.weight(1);
  1677. fprintf(pp, " 0=%d", num_filter);
  1678. if (kernel.size() == 1) {
  1679. fprintf(pp, " 1=%d", kernel[0]);
  1680. } else if (kernel.size() == 2) {
  1681. fprintf(pp, " 1=%d", kernel[1]);
  1682. fprintf(pp, " 11=%d", kernel[0]);
  1683. }
  1684. if (dilate.size() == 1) {
  1685. fprintf(pp, " 2=%d", dilate[0]);
  1686. } else if (dilate.size() == 2) {
  1687. fprintf(pp, " 2=%d", dilate[1]);
  1688. fprintf(pp, " 12=%d", dilate[0]);
  1689. }
  1690. if (stride.size() == 1) {
  1691. fprintf(pp, " 3=%d", stride[0]);
  1692. } else if (stride.size() == 2) {
  1693. fprintf(pp, " 3=%d", stride[1]);
  1694. fprintf(pp, " 13=%d", stride[0]);
  1695. }
  1696. if (target_shape.size() == 0)
  1697. {
  1698. if (pad.size() == 1) {
  1699. fprintf(pp, " 4=%d", pad[0]);
  1700. } else if (pad.size() == 2) {
  1701. fprintf(pp, " 4=%d", pad[1]);
  1702. fprintf(pp, " 14=%d", pad[0]);
  1703. }
  1704. if (adj.size() == 1) {
  1705. fprintf(pp, " 18=%d", adj[0]);
  1706. } else if (adj.size() == 2) {
  1707. fprintf(pp, " 18=%d", adj[1]);
  1708. fprintf(pp, " 19=%d", adj[0]);
  1709. }
  1710. }
  1711. else
  1712. {
  1713. fprintf(pp, " 4=-233");
  1714. if (target_shape.size() == 1) {
  1715. fprintf(pp, " 20=%d", target_shape[0]);
  1716. } else if (target_shape.size() == 2) {
  1717. fprintf(pp, " 20=%d", target_shape[1]);
  1718. fprintf(pp, " 21=%d", target_shape[0]);
  1719. }
  1720. }
  1721. fprintf(pp, " 5=%d", no_bias == 1 ? 0 : 1);
  1722. fprintf(pp, " 6=%d", (int)weight_data.size());
  1723. if (num_group > 1) {
  1724. fprintf(pp, " 7=%d", num_group);
  1725. }
  1726. int quantize_tag = 0;
  1727. fwrite(&quantize_tag, sizeof(int), 1, bp);
  1728. int maxk = 0;
  1729. if (kernel.size() == 2)
  1730. {
  1731. maxk = kernel[1] * kernel[0];
  1732. }
  1733. else
  1734. {
  1735. maxk = kernel[0] * kernel[0];
  1736. }
  1737. for (int g=0; g<num_group; g++)
  1738. {
  1739. // reorder weight from inch-outch to outch-inch
  1740. int num_filter_g = num_filter / num_group;
  1741. int num_input = weight_data.size() / maxk / num_filter_g / num_group;
  1742. const float* weight_data_ptr = weight_data.data() + g * maxk * num_filter_g * num_input;
  1743. for (int k=0; k<num_filter_g; k++)
  1744. {
  1745. for (int j=0; j<num_input; j++)
  1746. {
  1747. fwrite(weight_data_ptr + (j*num_filter_g + k) * maxk, sizeof(float), maxk, bp);
  1748. }
  1749. }
  1750. }
  1751. fwrite(bias_data.data(), sizeof(float), bias_data.size(), bp);
  1752. }
  1753. else if (n.op == "cos")
  1754. {
  1755. int op_type = 10;
  1756. fprintf(pp, " 0=%d", op_type);
  1757. }
  1758. else if (n.op == "Crop")
  1759. {
  1760. int num_args = n.attr("num_args");
  1761. std::vector<int> offset = n.attr("offset");
  1762. int woffset = 0;
  1763. int hoffset = 0;
  1764. if (offset.size() == 2)
  1765. {
  1766. woffset = offset[1];
  1767. hoffset = offset[0];
  1768. }
  1769. fprintf(pp, " 0=%d", woffset);
  1770. fprintf(pp, " 1=%d", hoffset);
  1771. fprintf(pp, " 2=0");
  1772. if (num_args == 1)
  1773. {
  1774. std::vector<int> h_w = n.attr("h_w");
  1775. fprintf(pp, " 3=%d", h_w[1]);
  1776. fprintf(pp, " 4=%d", h_w[0]);
  1777. fprintf(pp, " 5=0");
  1778. }
  1779. }
  1780. else if (n.op == "Dropout")
  1781. {
  1782. // float p = n.attr("p");
  1783. // fprintf(pp, " 0=%d", p);
  1784. }
  1785. else if (n.op == "elemwise_add" || n.op == "_add" || n.op == "_plus" || n.op == "_Plus")
  1786. {
  1787. int op_type = 0;
  1788. fprintf(pp, " 0=%d", op_type);
  1789. }
  1790. else if (n.op == "elemwise_div" || n.op == "_div" || n.op == "_Div")
  1791. {
  1792. int op_type = 3;
  1793. fprintf(pp, " 0=%d", op_type);
  1794. }
  1795. else if (n.op == "elemwise_mul" || n.op == "_mul" || n.op == "_Mul")
  1796. {
  1797. int op_type = 2;
  1798. fprintf(pp, " 0=%d", op_type);
  1799. }
  1800. else if (n.op == "elemwise_sub" || n.op == "_sub" || n.op == "_minus" || n.op == "_Minus")
  1801. {
  1802. int op_type = 1;
  1803. fprintf(pp, " 0=%d", op_type);
  1804. }
  1805. else if (n.op == "Embedding")
  1806. {
  1807. int input_dim = n.attr("input_dim");
  1808. int output_dim = n.attr("output_dim");
  1809. std::vector<float> weight_data = n.weight(0);
  1810. fprintf(pp, " 0=%d", output_dim);
  1811. fprintf(pp, " 1=%d", input_dim);
  1812. fprintf(pp, " 3=%d", (int)weight_data.size());
  1813. int quantize_tag = 0;
  1814. fwrite(&quantize_tag, sizeof(int), 1, bp);
  1815. fwrite(weight_data.data(), sizeof(float), weight_data.size(), bp);
  1816. }
  1817. else if (n.op == "exp")
  1818. {
  1819. int op_type = 7;
  1820. fprintf(pp, " 0=%d", op_type);
  1821. }
  1822. else if (n.op == "expand_dims")
  1823. {
  1824. int axis = n.attr("axis");
  1825. int expand_w = 0;
  1826. int expand_h = 0;
  1827. int expand_c = 0;
  1828. if (axis == 0)
  1829. expand_c = 1;
  1830. if (axis == 1)
  1831. expand_h = 1;
  1832. if (axis == 2)
  1833. expand_w = 1;
  1834. fprintf(pp, " 0=%d", expand_w);
  1835. fprintf(pp, " 1=%d", expand_h);
  1836. fprintf(pp, " 2=%d", expand_c);
  1837. }
  1838. else if (n.op == "Flatten")
  1839. {
  1840. }
  1841. else if (n.op == "floor")
  1842. {
  1843. int op_type = 2;
  1844. fprintf(pp, " 0=%d", op_type);
  1845. }
  1846. else if (n.op == "FullyConnected")
  1847. {
  1848. int num_hidden = n.attr("num_hidden");
  1849. int no_bias = n.attr("no_bias");
  1850. // int flatten = n.attr("flatten");
  1851. // TODO flatten
  1852. std::vector<float> weight_data = n.weight(0);
  1853. std::vector<float> bias_data = n.weight(1);
  1854. fprintf(pp, " 0=%d", num_hidden);
  1855. fprintf(pp, " 1=%d", no_bias == 1 ? 0 : 1);
  1856. fprintf(pp, " 2=%d", (int)weight_data.size());
  1857. int quantize_tag = 0;
  1858. fwrite(&quantize_tag, sizeof(int), 1, bp);
  1859. fwrite(weight_data.data(), sizeof(float), weight_data.size(), bp);
  1860. fwrite(bias_data.data(), sizeof(float), bias_data.size(), bp);
  1861. }
  1862. else if (n.op == "HardSigmoid")
  1863. {
  1864. float alpha = n.attr("alpha");
  1865. float beta = n.attr("beta");
  1866. fprintf(pp, " 0=%e", alpha);
  1867. fprintf(pp, " 1=%e", beta);
  1868. }
  1869. else if (n.op == "HardSwish")
  1870. {
  1871. float alpha = n.attr("alpha");
  1872. float beta = n.attr("beta");
  1873. fprintf(pp, " 0=%e", alpha);
  1874. fprintf(pp, " 1=%e", beta);
  1875. }
  1876. else if (n.op == "InstanceNorm")
  1877. {
  1878. float eps = n.has_attr("eps") ? n.attr("eps") : 0.001f;
  1879. std::vector<float> gamma_data = n.weight(0);
  1880. std::vector<float> beta_data = n.weight(1);
  1881. fprintf(pp, " 0=%d", (int)gamma_data.size());
  1882. fprintf(pp, " 1=%e", eps);
  1883. fwrite(gamma_data.data(), sizeof(float), gamma_data.size(), bp);
  1884. fwrite(beta_data.data(), sizeof(float), beta_data.size(), bp);
  1885. }
  1886. else if (n.op == "L2Normalization")
  1887. {
  1888. std::string mode = n.attr("mode");
  1889. float eps = n.has_attr("eps") ? n.attr("eps") : 1e-10;
  1890. int across_spatial = 0;
  1891. int across_channel = 1;
  1892. int channel_shared = 1;
  1893. int scale_data_size = 1;
  1894. if (mode == "instance")
  1895. {
  1896. across_spatial = 1;
  1897. across_channel = 1;
  1898. }
  1899. else if (mode == "channel")
  1900. {
  1901. across_spatial = 0;
  1902. across_channel = 1;
  1903. }
  1904. else if (mode == "spatial")
  1905. {
  1906. across_spatial = 1;
  1907. across_channel = 0;
  1908. }
  1909. fprintf(pp, " 0=%d", across_spatial);
  1910. fprintf(pp, " 4=%d", across_channel);
  1911. fprintf(pp, " 1=%d", channel_shared);
  1912. fprintf(pp, " 2=%e", eps);
  1913. fprintf(pp, " 3=%d", scale_data_size);
  1914. const float scale_data[1] = { 1.f };
  1915. fwrite(scale_data, sizeof(float), 1, bp);
  1916. }
  1917. else if (n.op == "LeakyReLU")
  1918. {
  1919. std::string type = n.attr("act_type");
  1920. if (type == "elu")
  1921. {
  1922. float slope = n.has_attr("slope") ? n.attr("slope") : 0.25f;
  1923. fprintf(pp, " 0=%e", slope);
  1924. }
  1925. else if (type == "leaky" || type.empty())
  1926. {
  1927. float slope = n.has_attr("slope") ? n.attr("slope") : 0.25f;
  1928. fprintf(pp, " 0=%e", slope);
  1929. }
  1930. else if (type == "prelu")
  1931. {
  1932. std::vector<float> weight_data = n.weight(0);
  1933. fprintf(pp, " 0=%d", (int)weight_data.size());
  1934. fwrite(weight_data.data(), sizeof(float), weight_data.size(), bp);
  1935. }
  1936. }
  1937. else if (n.op == "LinearRegressionOutput")
  1938. {
  1939. }
  1940. else if (n.op == "log")
  1941. {
  1942. int op_type = 8;
  1943. fprintf(pp, " 0=%d", op_type);
  1944. }
  1945. else if (n.op == "LogisticRegressionOutput")
  1946. {
  1947. }
  1948. else if (n.op == "MAERegressionOutput")
  1949. {
  1950. }
  1951. else if (n.op == "max")
  1952. {
  1953. int operation = 4;
  1954. fprintf(pp, " 0=%d", operation);
  1955. }
  1956. else if (n.op == "maximum")
  1957. {
  1958. int op_type = 4;
  1959. fprintf(pp, " 0=%d", op_type);
  1960. }
  1961. else if (n.op == "mean")
  1962. {
  1963. int operation = 3;
  1964. fprintf(pp, " 0=%d", operation);
  1965. }
  1966. else if (n.op == "min")
  1967. {
  1968. int operation = 5;
  1969. fprintf(pp, " 0=%d", operation);
  1970. }
  1971. else if (n.op == "minimum")
  1972. {
  1973. int op_type = 5;
  1974. fprintf(pp, " 0=%d", op_type);
  1975. }
  1976. else if (n.op == "negative")
  1977. {
  1978. int op_type = 1;
  1979. fprintf(pp, " 0=%d", op_type);
  1980. }
  1981. else if (n.op == "Pad")
  1982. {
  1983. std::string mode = n.attr("mode");
  1984. std::vector<int> pad_width = n.attr("pad_width");
  1985. float constant_value = n.attr("constant_value");
  1986. int type = 0;
  1987. if (mode == "constant")
  1988. {
  1989. type = 0;
  1990. }
  1991. else if (mode == "edge")
  1992. {
  1993. type = 1;
  1994. }
  1995. else if (mode == "reflect")
  1996. {
  1997. // FIXME
  1998. }
  1999. if (pad_width.size() != 8)
  2000. {
  2001. fprintf(stderr, "Unsupported pad_width !\n");
  2002. }
  2003. int channel_before = pad_width[2];
  2004. int channel_after = pad_width[3];
  2005. if (channel_before != 0 || channel_after != 0)
  2006. {
  2007. // FIXME
  2008. fprintf(stderr, "Unsupported pad_width on channel axis !\n");
  2009. }
  2010. int top = pad_width[4];
  2011. int bottom = pad_width[5];
  2012. int left = pad_width[6];
  2013. int right = pad_width[7];
  2014. fprintf(pp, " 0=%d", top);
  2015. fprintf(pp, " 1=%d", bottom);
  2016. fprintf(pp, " 2=%d", left);
  2017. fprintf(pp, " 3=%d", right);
  2018. fprintf(pp, " 4=%d", type);
  2019. fprintf(pp, " 5=%e", constant_value);
  2020. }
  2021. else if (n.op == "Pooling")
  2022. {
  2023. std::string pool_type = n.attr("pool_type");
  2024. std::vector<int> kernel = n.attr("kernel");
  2025. std::vector<int> stride = n.attr("stride");
  2026. std::vector<int> pad = n.attr("pad");
  2027. std::string pooling_convention = n.attr("pooling_convention");
  2028. int global_pool = n.attr("global_pool");
  2029. int pool = 0;
  2030. if (pool_type == "max")
  2031. {
  2032. pool = 0;
  2033. }
  2034. else if (pool_type == "avg")
  2035. {
  2036. pool = 1;
  2037. }
  2038. int pad_mode = 1;
  2039. if (pooling_convention == "valid")
  2040. {
  2041. pad_mode = 1;
  2042. }
  2043. else if (pooling_convention == "full")
  2044. {
  2045. pad_mode = 0;
  2046. }
  2047. fprintf(pp, " 0=%d", pool);
  2048. if (kernel.size() == 1) {
  2049. fprintf(pp, " 1=%d", kernel[0]);
  2050. } else if (kernel.size() == 2) {
  2051. fprintf(pp, " 1=%d", kernel[1]);
  2052. fprintf(pp, " 11=%d", kernel[0]);
  2053. }
  2054. if (stride.size() == 1) {
  2055. fprintf(pp, " 2=%d", stride[0]);
  2056. } else if (stride.size() == 2) {
  2057. fprintf(pp, " 2=%d", stride[1]);
  2058. fprintf(pp, " 12=%d", stride[0]);
  2059. }
  2060. if (pad.size() == 1) {
  2061. fprintf(pp, " 3=%d", pad[0]);
  2062. } else if (pad.size() == 2) {
  2063. fprintf(pp, " 3=%d", pad[1]);
  2064. fprintf(pp, " 13=%d", pad[0]);
  2065. }
  2066. fprintf(pp, " 4=%d", global_pool);
  2067. fprintf(pp, " 5=%d", pad_mode);
  2068. if (pool_type == "avg")
  2069. {
  2070. int avgpool_count_include_pad = n.has_attr("count_include_pad") ? n.attr("count_include_pad") : 0;
  2071. fprintf(pp, " 6=%d", avgpool_count_include_pad);
  2072. }
  2073. }
  2074. else if (n.op == "prod")
  2075. {
  2076. int operation = 6;
  2077. fprintf(pp, " 0=%d", operation);
  2078. }
  2079. else if (n.op == "reciprocal")
  2080. {
  2081. int op_type = 15;
  2082. fprintf(pp, " 0=%d", op_type);
  2083. }
  2084. else if (n.op == "relu")
  2085. {
  2086. }
  2087. else if (n.op == "Reshape")
  2088. {
  2089. std::vector<int> shape = n.attr("shape");
  2090. if (shape.size() == 1) {
  2091. fprintf(pp, " 0=%d", shape[0]);// should never reach here
  2092. } else if (shape.size() == 2) {
  2093. fprintf(pp, " 0=%d", shape[1]);
  2094. } else if (shape.size() == 3) {
  2095. fprintf(pp, " 0=%d", shape[2]);
  2096. fprintf(pp, " 1=%d", shape[1]);
  2097. } else if (shape.size() == 4) {
  2098. fprintf(pp, " 0=%d", shape[3]);
  2099. fprintf(pp, " 1=%d", shape[2]);
  2100. fprintf(pp, " 2=%d", shape[1]);
  2101. } else if (shape.size() == 5) {
  2102. fprintf(pp, " 0=%d", shape[4] * shape[3]);
  2103. fprintf(pp, " 1=%d", shape[2]);
  2104. fprintf(pp, " 2=%d", shape[1]);
  2105. }
  2106. }
  2107. else if (n.op == "ShuffleChannel")
  2108. {
  2109. int group = n.attr("group");
  2110. fprintf(pp, " 0=%d", group);
  2111. }
  2112. else if (n.op == "sigmoid")
  2113. {
  2114. }
  2115. else if (n.op == "sin")
  2116. {
  2117. int op_type = 9;
  2118. fprintf(pp, " 0=%d", op_type);
  2119. }
  2120. else if (n.op == "slice")
  2121. {
  2122. std::vector<int> begin = n.attr("begin");
  2123. std::vector<int> end = n.attr("end");
  2124. std::vector<int> step = n.attr("step");// TODO
  2125. // assert step == 1
  2126. for (int i=0; i<(int)step.size(); i++)
  2127. {
  2128. if (step[i] != 1)
  2129. fprintf(stderr, "Unsupported slice step !\n");
  2130. }
  2131. int woffset = 0;
  2132. int hoffset = 0;
  2133. int coffset = 0;
  2134. int outw = -233;
  2135. int outh = -233;
  2136. int outc = -233;
  2137. if (begin.size() == 1)
  2138. {
  2139. woffset = begin[0] == -233 ? 0 : begin[0];
  2140. hoffset = -233;
  2141. coffset = -233;
  2142. outw = end[0] == -233 ? -233 : end[0] - begin[0];
  2143. }
  2144. else if (begin.size() == 2)
  2145. {
  2146. woffset = begin[1] == -233 ? 0 : begin[1];
  2147. hoffset = -233;
  2148. coffset = -233;
  2149. outw = end[1] == -233 ? -233 : end[1] - begin[1];
  2150. }
  2151. else if (begin.size() == 3)
  2152. {
  2153. woffset = begin[2] == -233 ? 0 : begin[2];
  2154. hoffset = begin[1] == -233 ? 0 : begin[1];
  2155. coffset = -233;
  2156. outw = end[2] == -233 ? -233 : end[2] - begin[2];
  2157. outh = end[1] == -233 ? -233 : end[1] - begin[1];
  2158. }
  2159. else if (begin.size() == 4)
  2160. {
  2161. woffset = begin[3] == -233 ? 0 : begin[3];
  2162. hoffset = begin[2] == -233 ? 0 : begin[2];
  2163. coffset = begin[1] == -233 ? 0 : begin[1];
  2164. outw = end[3] == -233 ? -233 : end[3] - begin[3];
  2165. outh = end[2] == -233 ? -233 : end[2] - begin[2];
  2166. outc = end[1] == -233 ? -233 : end[1] - begin[1];
  2167. }
  2168. fprintf(pp, " 0=%d", woffset);
  2169. fprintf(pp, " 1=%d", hoffset);
  2170. fprintf(pp, " 2=%d", coffset);
  2171. fprintf(pp, " 3=%d", outw);
  2172. fprintf(pp, " 4=%d", outh);
  2173. fprintf(pp, " 5=%d", outc);
  2174. }
  2175. else if (n.op == "SliceChannel")
  2176. {
  2177. int num_outputs = n.attr("num_outputs");
  2178. int squeeze_axis = n.attr("squeeze_axis");// TODO
  2179. if (squeeze_axis)
  2180. {
  2181. fprintf(stderr, "Unsupported SliceChannel squeeze_axis !\n");
  2182. }
  2183. fprintf(pp, " -23300=%d", num_outputs);
  2184. for (int j=0; j<num_outputs; j++)
  2185. {
  2186. fprintf(pp, ",-233");
  2187. }
  2188. }
  2189. else if (n.op == "SoftmaxActivation")
  2190. {
  2191. std::string mode = n.attr("mode");
  2192. if (mode != "channel")
  2193. {
  2194. fprintf(stderr, "Unsupported SoftmaxActivation mode !\n");
  2195. }
  2196. fprintf(pp, " 1=1");
  2197. }
  2198. else if (n.op == "SoftmaxOutput")
  2199. {
  2200. fprintf(pp, " 1=1");
  2201. }
  2202. else if (n.op == "softmax")
  2203. {
  2204. fprintf(pp, " 1=1");
  2205. }
  2206. else if (n.op == "sqrt")
  2207. {
  2208. int op_type = 5;
  2209. fprintf(pp, " 0=%d", op_type);
  2210. }
  2211. else if (n.op == "square")
  2212. {
  2213. int op_type = 4;
  2214. fprintf(pp, " 0=%d", op_type);
  2215. }
  2216. else if (n.op == "sum")
  2217. {
  2218. int operation = 0;
  2219. fprintf(pp, " 0=%d", operation);
  2220. }
  2221. else if (n.op == "tan")
  2222. {
  2223. int op_type = 11;
  2224. fprintf(pp, " 0=%d", op_type);
  2225. }
  2226. else if (n.op == "tanh")
  2227. {
  2228. }
  2229. else if (n.op == "Transpose" || n.op == "transpose")
  2230. {
  2231. std::vector<int> axes = n.attr("axes");
  2232. if (axes.size() == 3) {
  2233. if (axes[1] == 2 && axes[2] == 1)
  2234. fprintf(pp, " 0=1");// h w c
  2235. else
  2236. fprintf(stderr, "Unsupported transpose type !\n");
  2237. }
  2238. else if (axes.size() == 4) {
  2239. if (axes[1] == 1 && axes[2] == 2 && axes[3] == 3)
  2240. fprintf(pp, " 0=0");// w h c
  2241. else if (axes[1] == 1 && axes[2] == 3 && axes[3] == 2)
  2242. fprintf(pp, " 0=1");// h w c
  2243. else if (axes[1] == 2 && axes[2] == 1 && axes[3] == 3)
  2244. fprintf(pp, " 0=2");// w c h
  2245. else if (axes[1] == 2 && axes[2] == 3 && axes[3] == 1)
  2246. fprintf(pp, " 0=3");// c w h
  2247. else if (axes[1] == 3 && axes[2] == 1 && axes[3] == 2)
  2248. fprintf(pp, " 0=4");// h c w
  2249. else if (axes[1] == 3 && axes[2] == 2 && axes[3] == 1)
  2250. fprintf(pp, " 0=5");// c h w
  2251. } else if (axes.size() == 5) {
  2252. if (axes[1] == 1 && axes[2] == 2 && axes[3] == 3 && axes[4] == 4)
  2253. fprintf(pp, " 0=0");// wx h c
  2254. else if (axes[1] == 1 && axes[2] == 3 && axes[3] == 4 && axes[4] == 2)
  2255. fprintf(pp, " 0=1");// h wx c
  2256. else if (axes[1] == 2 && axes[2] == 1 && axes[3] == 3 && axes[4] == 4)
  2257. fprintf(pp, " 0=2");// wx c h
  2258. else if (axes[1] == 2 && axes[2] == 3 && axes[3] == 4 && axes[4] == 1)
  2259. fprintf(pp, " 0=3");// c wx h
  2260. else if (axes[1] == 3 && axes[2] == 4 && axes[3] == 1 && axes[4] == 2)
  2261. fprintf(pp, " 0=4");// h c wx
  2262. else if (axes[1] == 3 && axes[2] == 4 && axes[3] == 2 && axes[4] == 1)
  2263. fprintf(pp, " 0=5");// c h wx
  2264. else
  2265. fprintf(stderr, "Unsupported transpose type !\n");
  2266. }
  2267. else
  2268. {
  2269. fprintf(stderr, "Unsupported transpose type !\n");
  2270. }
  2271. }
  2272. else if (n.op == "UpSampling")
  2273. {
  2274. int scale = n.attr("scale");
  2275. std::string sample_type = n.attr("sample_type");
  2276. if (sample_type == "nearest")
  2277. {
  2278. fprintf(pp, " 0=1");
  2279. fprintf(pp, " 1=%e", (float)scale);
  2280. fprintf(pp, " 2=%e", (float)scale);
  2281. }
  2282. else if (sample_type == "bilinear")
  2283. {
  2284. // DeconvolutionDepthWise
  2285. int num_filter = n.attr("num_filter");
  2286. std::vector<float> weight_data = n.weight(0);
  2287. int kernel = scale * 2 - scale % 2;
  2288. int stride = scale;
  2289. int pad = (scale - 1) / 2;
  2290. fprintf(pp, " 0=%d", num_filter);
  2291. fprintf(pp, " 1=%d", kernel);
  2292. fprintf(pp, " 2=1");
  2293. fprintf(pp, " 3=%d", stride);
  2294. fprintf(pp, " 4=%d", pad);
  2295. fprintf(pp, " 5=0");
  2296. fprintf(pp, " 6=%d", (int)weight_data.size());
  2297. fprintf(pp, " 7=%d", num_filter);
  2298. int quantize_tag = 0;
  2299. fwrite(&quantize_tag, sizeof(int), 1, bp);
  2300. fwrite(weight_data.data(), sizeof(float), weight_data.size(), bp);
  2301. }
  2302. }
  2303. else
  2304. {
  2305. // TODO op specific params
  2306. std::map<std::string, std::string>::const_iterator it = n.attrs.begin();
  2307. for (; it != n.attrs.end(); it++)
  2308. {
  2309. fprintf(stderr, "# %s=%s\n", it->first.c_str(), it->second.c_str());
  2310. // fprintf(pp, " %s=%s", it->first.c_str(), it->second.c_str());
  2311. }
  2312. }
  2313. fprintf(pp, "\n");
  2314. for (int j=0; j<n.output_size; j++)
  2315. {
  2316. int input_uid = i | (j << 16);
  2317. if (node_reference.find(input_uid) != node_reference.end())
  2318. {
  2319. int refcount = node_reference[input_uid];
  2320. if (refcount > 1)
  2321. {
  2322. std::string output_name = n.name;
  2323. char splitname[256];
  2324. sprintf(splitname, "splitncnn_%d", internal_split);
  2325. fprintf(pp, "%-16s %-32s %d %d", "Split", splitname, 1, refcount);
  2326. if (j == 0)
  2327. {
  2328. fprintf(pp, " %s", output_name.c_str());
  2329. }
  2330. else
  2331. {
  2332. fprintf(pp, " %s_subncnn_%d", output_name.c_str(), j);
  2333. }
  2334. for (int k=0; k<refcount; k++)
  2335. {
  2336. if (j == 0)
  2337. {
  2338. fprintf(pp, " %s_splitncnn_%d", output_name.c_str(), k);
  2339. }
  2340. else
  2341. {
  2342. fprintf(pp, " %s_subncnn_%d_splitncnn_%d", output_name.c_str(), j, k);
  2343. }
  2344. }
  2345. fprintf(pp, "\n");
  2346. internal_split++;
  2347. }
  2348. }
  2349. }
  2350. }
  2351. fclose(pp);
  2352. fclose(bp);
  2353. return 0;
  2354. }