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