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