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 61 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
1234567891011121314151617181920212223242526272829303132333435363738394041424344454647484950515253545556575859606162636465666768697071727374757677787980818283848586878889909192939495969798991001011021031041051061071081091101111121131141151161171181191201211221231241251261271281291301311321331341351361371381391401411421431441451461471481491501511521531541551561571581591601611621631641651661671681691701711721731741751761771781791801811821831841851861871881891901911921931941951961971981992002012022032042052062072082092102112122132142152162172182192202212222232242252262272282292302312322332342352362372382392402412422432442452462472482492502512522532542552562572582592602612622632642652662672682692702712722732742752762772782792802812822832842852862872882892902912922932942952962972982993003013023033043053063073083093103113123133143153163173183193203213223233243253263273283293303313323333343353363373383393403413423433443453463473483493503513523533543553563573583593603613623633643653663673683693703713723733743753763773783793803813823833843853863873883893903913923933943953963973983994004014024034044054064074084094104114124134144154164174184194204214224234244254264274284294304314324334344354364374384394404414424434444454464474484494504514524534544554564574584594604614624634644654664674684694704714724734744754764774784794804814824834844854864874884894904914924934944954964974984995005015025035045055065075085095105115125135145155165175185195205215225235245255265275285295305315325335345355365375385395405415425435445455465475485495505515525535545555565575585595605615625635645655665675685695705715725735745755765775785795805815825835845855865875885895905915925935945955965975985996006016026036046056066076086096106116126136146156166176186196206216226236246256266276286296306316326336346356366376386396406416426436446456466476486496506516526536546556566576586596606616626636646656666676686696706716726736746756766776786796806816826836846856866876886896906916926936946956966976986997007017027037047057067077087097107117127137147157167177187197207217227237247257267277287297307317327337347357367377387397407417427437447457467477487497507517527537547557567577587597607617627637647657667677687697707717727737747757767777787797807817827837847857867877887897907917927937947957967977987998008018028038048058068078088098108118128138148158168178188198208218228238248258268278288298308318328338348358368378388398408418428438448458468478488498508518528538548558568578588598608618628638648658668678688698708718728738748758768778788798808818828838848858868878888898908918928938948958968978988999009019029039049059069079089099109119129139149159169179189199209219229239249259269279289299309319329339349359369379389399409419429439449459469479489499509519529539549559569579589599609619629639649659669679689699709719729739749759769779789799809819829839849859869879889899909919929939949959969979989991000100110021003100410051006100710081009101010111012101310141015101610171018101910201021102210231024102510261027102810291030103110321033103410351036103710381039104010411042104310441045104610471048104910501051105210531054105510561057105810591060106110621063106410651066106710681069107010711072107310741075107610771078107910801081108210831084108510861087108810891090109110921093109410951096109710981099110011011102110311041105110611071108110911101111111211131114111511161117111811191120112111221123112411251126112711281129113011311132113311341135113611371138113911401141114211431144114511461147114811491150115111521153115411551156115711581159116011611162116311641165116611671168116911701171117211731174117511761177117811791180118111821183118411851186118711881189119011911192119311941195119611971198119912001201120212031204120512061207120812091210121112121213121412151216121712181219122012211222122312241225122612271228122912301231123212331234123512361237123812391240124112421243124412451246124712481249125012511252125312541255125612571258125912601261126212631264126512661267126812691270127112721273127412751276127712781279128012811282128312841285128612871288128912901291129212931294129512961297129812991300130113021303130413051306130713081309131013111312131313141315131613171318131913201321132213231324132513261327132813291330133113321333133413351336133713381339134013411342134313441345134613471348134913501351135213531354135513561357135813591360136113621363136413651366136713681369137013711372137313741375137613771378137913801381138213831384138513861387138813891390139113921393139413951396139713981399140014011402140314041405140614071408140914101411141214131414141514161417141814191420142114221423142414251426142714281429143014311432143314341435143614371438143914401441144214431444144514461447144814491450145114521453145414551456145714581459146014611462146314641465146614671468146914701471147214731474147514761477147814791480148114821483148414851486148714881489149014911492149314941495149614971498149915001501150215031504150515061507150815091510151115121513151415151516151715181519152015211522152315241525152615271528152915301531153215331534153515361537153815391540154115421543154415451546154715481549155015511552155315541555155615571558155915601561156215631564156515661567156815691570157115721573157415751576157715781579158015811582158315841585158615871588158915901591159215931594159515961597159815991600160116021603160416051606160716081609161016111612161316141615161616171618161916201621162216231624162516261627162816291630163116321633163416351636163716381639164016411642164316441645164616471648164916501651165216531654165516561657165816591660166116621663166416651666166716681669167016711672167316741675167616771678167916801681168216831684168516861687168816891690169116921693169416951696169716981699170017011702170317041705170617071708170917101711171217131714171517161717171817191720172117221723172417251726172717281729173017311732173317341735173617371738173917401741174217431744174517461747174817491750175117521753175417551756175717581759176017611762176317641765176617671768176917701771177217731774177517761777177817791780178117821783178417851786178717881789179017911792179317941795179617971798179918001801180218031804180518061807180818091810181118121813181418151816181718181819182018211822182318241825182618271828182918301831183218331834183518361837183818391840184118421843184418451846184718481849185018511852185318541855185618571858185918601861186218631864186518661867186818691870187118721873187418751876187718781879188018811882188318841885188618871888188918901891189218931894189518961897189818991900190119021903190419051906190719081909191019111912191319141915191619171918191919201921192219231924192519261927192819291930193119321933193419351936193719381939194019411942194319441945194619471948194919501951195219531954195519561957195819591960196119621963196419651966196719681969197019711972197319741975197619771978197919801981198219831984198519861987198819891990199119921993199419951996199719981999200020012002200320042005200620072008200920102011201220132014201520162017201820192020202120222023202420252026202720282029203020312032203320342035203620372038203920402041204220432044204520462047204820492050205120522053205420552056205720582059206020612062206320642065206620672068206920702071207220732074207520762077207820792080208120822083208420852086208720882089209020912092209320942095209620972098
  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\\\", {}]")
  185. {
  186. data.resize(init_len, 0.f);
  187. }
  188. else if (p.init == "[\\$one\\$, {}]" || 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 == "_contrib_MultiBoxTarget")
  574. {
  575. n.output_size = 3;
  576. }
  577. else if (n.op == "SliceChannel")
  578. {
  579. n.output_size = n.attr("num_outputs");
  580. }
  581. // distinguish weights and inputs
  582. std::vector<int> weights;
  583. std::vector<int> inputs;
  584. for (int j=0; j<(int)n.inputs.size(); j++)
  585. {
  586. int input_index = n.inputs[j];
  587. if (nodes[input_index].is_weight())
  588. {
  589. weights.push_back(input_index);
  590. continue;
  591. }
  592. inputs.push_back(input_index);
  593. }
  594. n.inputs = inputs;
  595. n.weights = weights;
  596. if (n.op == "_contrib_MultiBoxDetection")
  597. {
  598. // reorder input blob
  599. int temp = n.inputs[0];
  600. n.inputs[0] = n.inputs[1];
  601. n.inputs[1] = temp;
  602. }
  603. // input
  604. for (int j=0; j<(int)n.inputs.size(); j++)
  605. {
  606. int input_index = n.inputs[j];
  607. int subinput_index = n.subinputs[j];
  608. std::string input_name = nodes[input_index].name;
  609. // fprintf(stderr, "input = %s\n", input_name.c_str());
  610. if (subinput_index != 0)
  611. {
  612. char subinputsuffix[256];
  613. sprintf(subinputsuffix, "_subncnn_%d", subinput_index);
  614. input_name = input_name + subinputsuffix;
  615. }
  616. blob_names.insert(input_name);
  617. int input_uid = input_index | (subinput_index << 16);
  618. if (node_reference.find(input_uid) == node_reference.end())
  619. {
  620. node_reference[input_uid] = 1;
  621. }
  622. else
  623. {
  624. node_reference[input_uid] = node_reference[input_uid] + 1;
  625. }
  626. }
  627. // output
  628. // fprintf(stderr, "output = %s\n", output_name.c_str());
  629. blob_names.insert(output_name);
  630. for (int j=1; j<n.output_size; j++)
  631. {
  632. char subinputsuffix[256];
  633. sprintf(subinputsuffix, "_%d", j);
  634. std::string output_name_j = output_name + subinputsuffix;
  635. blob_names.insert(output_name_j);
  636. }
  637. }
  638. // for (std::map<int, int>::iterator it = node_reference.begin(); it != node_reference.end(); it++)
  639. // {
  640. // fprintf(stderr, "ref %d %d\n", it->first, it->second);
  641. // }
  642. // op chain fusion
  643. int reduced_node_count = 0;
  644. for (int i=0; i<node_count; i++)
  645. {
  646. const MXNetNode& n = nodes[i];
  647. if (n.is_weight())
  648. continue;
  649. // ShuffleChannel <= Reshape - SwapAxis - Reshape
  650. if (n.op == "Reshape")
  651. {
  652. if (node_reference[i] != 1)
  653. continue;
  654. // "shape": "(0, -4, X, -1, -2)"
  655. std::vector<int> shape = n.attr("shape");
  656. if (shape.size() != 5)
  657. continue;
  658. if (shape[0] != 0 || shape[1] != -4 || shape[3] != -1 || shape[4] != -2)
  659. continue;
  660. if (i+2 >= node_count)
  661. continue;
  662. const MXNetNode& n2 = nodes[i+1];
  663. const MXNetNode& n3 = nodes[i+2];
  664. if (n2.op != "SwapAxis" || n3.op != "Reshape")
  665. continue;
  666. if (node_reference[i+1] != 1)
  667. continue;
  668. // "dim1": "1", "dim2": "2"
  669. int dim1 = n2.attr("dim1");
  670. int dim2 = n2.attr("dim2");
  671. if (dim1 != 1 || dim2 != 2)
  672. continue;
  673. // "shape": "(0, -3, -2)"
  674. std::vector<int> shape3 = n3.attr("shape");
  675. if (shape3.size() != 3)
  676. continue;
  677. if (shape3[0] != 0 || shape3[1] != -3 || shape3[2] != -2)
  678. continue;
  679. // reduce
  680. nodes[i].op = "noop_reducedncnn";
  681. nodes[i+1].op = "noop_reducedncnn";
  682. node_reference.erase(node_reference.find(i));
  683. node_reference.erase(node_reference.find(i+1));
  684. blob_names.erase(n.name);
  685. blob_names.erase(n2.name);
  686. MXNetNode new_node;
  687. new_node.nodes = &nodes;
  688. new_node.params = &params;
  689. new_node.op = "ShuffleChannel";
  690. // new_node.name = n.name + "_" + n2.name + "_" + n3.name;
  691. new_node.name = n3.name;
  692. new_node.output_size = n3.output_size;
  693. char group[16];
  694. sprintf(group, "%d", shape[2]);
  695. new_node.attrs["group"] = group;
  696. new_node.inputs = n.inputs;
  697. new_node.subinputs = n.subinputs;
  698. nodes[i+2] = new_node;
  699. reduced_node_count += 2;
  700. i += 2;
  701. }
  702. }
  703. // remove node_reference entry with reference equals to one
  704. int splitncnn_blob_count = 0;
  705. std::map<int, int>::iterator it = node_reference.begin();
  706. while (it != node_reference.end())
  707. {
  708. if (it->second == 1)
  709. {
  710. node_reference.erase(it++);
  711. }
  712. else
  713. {
  714. splitncnn_blob_count += it->second;
  715. // fprintf(stderr, "%s %d\n", it->first.c_str(), it->second);
  716. ++it;
  717. }
  718. }
  719. // 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);
  720. fprintf(pp, "%lu %lu\n", node_count - reduced_node_count + node_reference.size() - weight_nodes.size(), blob_names.size() + splitncnn_blob_count);
  721. int internal_split = 0;
  722. for (int i=0; i<node_count; i++)
  723. {
  724. const MXNetNode& n = nodes[i];
  725. if (n.op == "noop_reducedncnn")
  726. {
  727. continue;
  728. }
  729. if (n.op == "null")
  730. {
  731. if (n.is_weight())
  732. {
  733. continue;
  734. }
  735. fprintf(pp, "%-16s", "Input");
  736. }
  737. else if (n.op == "_contrib_MultiBoxDetection")
  738. {
  739. fprintf(pp, "%-16s", "DetectionOutput");
  740. }
  741. else if (n.op == "_contrib_MultiBoxPrior")
  742. {
  743. fprintf(pp, "%-16s", "PriorBox");
  744. }
  745. else if (n.op == "_div_scalar")
  746. {
  747. fprintf(pp, "%-16s", "BinaryOp");
  748. }
  749. else if (n.op == "_maximum_scalar")
  750. {
  751. fprintf(pp, "%-16s", "BinaryOp");
  752. }
  753. else if (n.op == "_minimum_scalar")
  754. {
  755. fprintf(pp, "%-16s", "BinaryOp");
  756. }
  757. else if (n.op == "_minus_scalar")
  758. {
  759. fprintf(pp, "%-16s", "BinaryOp");
  760. }
  761. else if (n.op == "_mul_scalar")
  762. {
  763. fprintf(pp, "%-16s", "BinaryOp");
  764. }
  765. else if (n.op == "_plus_scalar")
  766. {
  767. fprintf(pp, "%-16s", "BinaryOp");
  768. }
  769. else if (n.op == "_power_scalar")
  770. {
  771. fprintf(pp, "%-16s", "BinaryOp");
  772. }
  773. else if (n.op == "_rdiv_scalar")
  774. {
  775. fprintf(pp, "%-16s", "BinaryOp");
  776. }
  777. else if (n.op == "_rminus_scalar")
  778. {
  779. fprintf(pp, "%-16s", "BinaryOp");
  780. }
  781. else if (n.op == "abs")
  782. {
  783. fprintf(pp, "%-16s", "UnaryOp");
  784. }
  785. else if (n.op == "Activation")
  786. {
  787. std::string type = n.attr("act_type");
  788. if (type == "relu")
  789. {
  790. fprintf(pp, "%-16s", "ReLU");
  791. }
  792. else if (type == "sigmoid")
  793. {
  794. fprintf(pp, "%-16s", "Sigmoid");
  795. }
  796. else if (type == "tanh")
  797. {
  798. fprintf(pp, "%-16s", "TanH");
  799. }
  800. }
  801. else if (n.op == "arccos")
  802. {
  803. fprintf(pp, "%-16s", "UnaryOp");
  804. }
  805. else if (n.op == "arcsin")
  806. {
  807. fprintf(pp, "%-16s", "UnaryOp");
  808. }
  809. else if (n.op == "arctan")
  810. {
  811. fprintf(pp, "%-16s", "UnaryOp");
  812. }
  813. else if (n.op == "BatchNorm")
  814. {
  815. fprintf(pp, "%-16s", "BatchNorm");
  816. }
  817. else if (n.op == "broadcast_add")
  818. {
  819. fprintf(pp, "%-16s", "BinaryOp");
  820. }
  821. else if (n.op == "broadcast_div")
  822. {
  823. fprintf(pp, "%-16s", "BinaryOp");
  824. }
  825. else if (n.op == "broadcast_mul")
  826. {
  827. fprintf(pp, "%-16s", "BinaryOp");
  828. }
  829. else if (n.op == "broadcast_sub")
  830. {
  831. fprintf(pp, "%-16s", "BinaryOp");
  832. }
  833. else if (n.op == "ceil")
  834. {
  835. fprintf(pp, "%-16s", "UnaryOp");
  836. }
  837. else if (n.op == "clip")
  838. {
  839. fprintf(pp, "%-16s", "Clip");
  840. }
  841. else if (n.op == "Concat")
  842. {
  843. fprintf(pp, "%-16s", "Concat");
  844. }
  845. else if (n.op == "Convolution")
  846. {
  847. int num_group = n.attr("num_group");
  848. if (num_group > 1) {
  849. fprintf(pp, "%-16s", "ConvolutionDepthWise");
  850. } else {
  851. fprintf(pp, "%-16s", "Convolution");
  852. }
  853. }
  854. else if (n.op == "cos")
  855. {
  856. fprintf(pp, "%-16s", "UnaryOp");
  857. }
  858. else if (n.op == "Deconvolution")
  859. {
  860. int num_group = n.attr("num_group");
  861. if (num_group > 1) {
  862. fprintf(pp, "%-16s", "DeconvolutionDepthWise");
  863. } else {
  864. fprintf(pp, "%-16s", "Deconvolution");
  865. }
  866. }
  867. else if (n.op == "Dropout")
  868. {
  869. fprintf(pp, "%-16s", "Dropout");
  870. }
  871. else if (n.op == "elemwise_add")
  872. {
  873. fprintf(pp, "%-16s", "BinaryOp");
  874. }
  875. else if (n.op == "elemwise_div")
  876. {
  877. fprintf(pp, "%-16s", "BinaryOp");
  878. }
  879. else if (n.op == "elemwise_mul")
  880. {
  881. fprintf(pp, "%-16s", "BinaryOp");
  882. }
  883. else if (n.op == "elemwise_sub")
  884. {
  885. fprintf(pp, "%-16s", "BinaryOp");
  886. }
  887. else if (n.op == "Embedding")
  888. {
  889. fprintf(pp, "%-16s", "Embed");
  890. }
  891. else if (n.op == "exp")
  892. {
  893. fprintf(pp, "%-16s", "UnaryOp");
  894. }
  895. else if (n.op == "expand_dims")
  896. {
  897. fprintf(pp, "%-16s", "ExpandDims");
  898. }
  899. else if (n.op == "Flatten")
  900. {
  901. fprintf(pp, "%-16s", "Flatten");
  902. }
  903. else if (n.op == "floor")
  904. {
  905. fprintf(pp, "%-16s", "UnaryOp");
  906. }
  907. else if (n.op == "FullyConnected")
  908. {
  909. fprintf(pp, "%-16s", "InnerProduct");
  910. }
  911. else if (n.op == "InstanceNorm")
  912. {
  913. fprintf(pp, "%-16s", "InstanceNorm");
  914. }
  915. else if (n.op == "L2Normalization")
  916. {
  917. fprintf(pp, "%-16s", "Normalize");
  918. }
  919. else if (n.op == "LeakyReLU")
  920. {
  921. std::string type = n.attr("act_type");
  922. if (type == "elu")
  923. {
  924. fprintf(pp, "%-16s", "ELU");
  925. }
  926. else if (type == "leaky" || type.empty())
  927. {
  928. fprintf(pp, "%-16s", "ReLU");
  929. }
  930. else if (type == "prelu")
  931. {
  932. fprintf(pp, "%-16s", "PReLU");
  933. }
  934. }
  935. else if (n.op == "log")
  936. {
  937. fprintf(pp, "%-16s", "UnaryOp");
  938. }
  939. else if (n.op == "LogisticRegressionOutput")
  940. {
  941. fprintf(pp, "%-16s", "Sigmoid");
  942. }
  943. else if (n.op == "max")
  944. {
  945. fprintf(pp, "%-16s", "Reduction");
  946. }
  947. else if (n.op == "maximum")
  948. {
  949. fprintf(pp, "%-16s", "BinaryOp");
  950. }
  951. else if (n.op == "mean")
  952. {
  953. fprintf(pp, "%-16s", "Reduction");
  954. }
  955. else if (n.op == "min")
  956. {
  957. fprintf(pp, "%-16s", "Reduction");
  958. }
  959. else if (n.op == "minimum")
  960. {
  961. fprintf(pp, "%-16s", "BinaryOp");
  962. }
  963. else if (n.op == "negative")
  964. {
  965. fprintf(pp, "%-16s", "UnaryOp");
  966. }
  967. else if (n.op == "Pooling")
  968. {
  969. fprintf(pp, "%-16s", "Pooling");
  970. }
  971. else if (n.op == "prod")
  972. {
  973. fprintf(pp, "%-16s", "Reduction");
  974. }
  975. else if (n.op == "reciprocal")
  976. {
  977. fprintf(pp, "%-16s", "UnaryOp");
  978. }
  979. else if (n.op == "relu")
  980. {
  981. fprintf(pp, "%-16s", "ReLU");
  982. }
  983. else if (n.op == "Reshape")
  984. {
  985. fprintf(pp, "%-16s", "Reshape");
  986. }
  987. else if (n.op == "ShuffleChannel")
  988. {
  989. fprintf(pp, "%-16s", "ShuffleChannel");
  990. }
  991. else if (n.op == "sigmoid")
  992. {
  993. fprintf(pp, "%-16s", "Sigmoid");
  994. }
  995. else if (n.op == "sin")
  996. {
  997. fprintf(pp, "%-16s", "UnaryOp");
  998. }
  999. else if (n.op == "SliceChannel")
  1000. {
  1001. fprintf(pp, "%-16s", "Slice");
  1002. }
  1003. else if (n.op == "SoftmaxOutput")
  1004. {
  1005. fprintf(pp, "%-16s", "Softmax");
  1006. }
  1007. else if (n.op == "SoftmaxActivation")
  1008. {
  1009. fprintf(pp, "%-16s", "Softmax");
  1010. }
  1011. else if (n.op == "sqrt")
  1012. {
  1013. fprintf(pp, "%-16s", "UnaryOp");
  1014. }
  1015. else if (n.op == "square")
  1016. {
  1017. fprintf(pp, "%-16s", "UnaryOp");
  1018. }
  1019. else if (n.op == "sum")
  1020. {
  1021. fprintf(pp, "%-16s", "Reduction");
  1022. }
  1023. else if (n.op == "tan")
  1024. {
  1025. fprintf(pp, "%-16s", "UnaryOp");
  1026. }
  1027. else if (n.op == "tanh")
  1028. {
  1029. fprintf(pp, "%-16s", "TanH");
  1030. }
  1031. else if (n.op == "Transpose" || n.op == "transpose")
  1032. {
  1033. fprintf(pp, "%-16s", "Permute");
  1034. }
  1035. else
  1036. {
  1037. fprintf(stderr, "%s not supported yet!\n", n.op.c_str());
  1038. fprintf(pp, "%-16s", n.op.c_str());
  1039. }
  1040. int input_size = n.inputs.size();
  1041. for (int j=0; j<(int)n.inputs.size(); j++)
  1042. {
  1043. int input_index = n.inputs[j];
  1044. if (nodes[input_index].is_weight())
  1045. {
  1046. input_size--;
  1047. }
  1048. }
  1049. if (n.op == "SoftmaxOutput" || n.op == "LogisticRegressionOutput")
  1050. {
  1051. // drop label
  1052. input_size--;
  1053. }
  1054. fprintf(pp, " %-32s %d %d", n.name.c_str(), input_size, n.output_size);
  1055. for (int j=0; j<(int)n.inputs.size(); j++)
  1056. {
  1057. int input_index = n.inputs[j];
  1058. int subinput_index = n.subinputs[j];
  1059. if (nodes[input_index].is_weight())
  1060. {
  1061. continue;
  1062. }
  1063. if (n.op == "SoftmaxOutput" || n.op == "LogisticRegressionOutput")
  1064. {
  1065. // drop label
  1066. if (j == 1)
  1067. continue;
  1068. }
  1069. std::string input_name = nodes[input_index].name;
  1070. if (subinput_index != 0)
  1071. {
  1072. char subinputsuffix[256];
  1073. sprintf(subinputsuffix, "_subncnn_%d", subinput_index);
  1074. input_name = input_name + subinputsuffix;
  1075. }
  1076. int input_uid = input_index | (subinput_index << 16);
  1077. if (node_reference.find(input_uid) != node_reference.end())
  1078. {
  1079. int refidx = node_reference[input_uid] - 1;
  1080. node_reference[input_uid] = refidx;
  1081. char splitsuffix[256];
  1082. sprintf(splitsuffix, "_splitncnn_%d", refidx);
  1083. input_name = input_name + splitsuffix;
  1084. }
  1085. fprintf(pp, " %s", input_name.c_str());
  1086. }
  1087. fprintf(pp, " %s", n.name.c_str());
  1088. for (int j=1; j<n.output_size; j++)
  1089. {
  1090. fprintf(pp, " %s_subncnn_%d", n.name.c_str(), j);
  1091. }
  1092. if (n.op == "null")
  1093. {
  1094. // dummy input shape
  1095. // fprintf(pp, " 0 0 0");
  1096. }
  1097. else if (n.op == "_contrib_MultiBoxDetection")
  1098. {
  1099. float threshold = n.has_attr("threshold") ? n.attr("threshold") : 0.01f;
  1100. float nms_threshold = n.has_attr("nms_threshold") ? n.attr("nms_threshold") : 0.5f;
  1101. int nms_topk = n.has_attr("nms_topk") ? n.attr("nms_topk") : 300;
  1102. fprintf(pp, " 0=-233");
  1103. fprintf(pp, " 1=%f", nms_threshold);
  1104. fprintf(pp, " 2=%d", nms_topk);
  1105. int keep_top_k = 100;
  1106. fprintf(pp, " 3=%d", keep_top_k);
  1107. fprintf(pp, " 4=%f", threshold);
  1108. std::vector<float> variances = n.attr("variances");
  1109. if (variances.empty())
  1110. {
  1111. fprintf(pp, " 5=0.1");
  1112. fprintf(pp, " 6=0.1");
  1113. fprintf(pp, " 7=0.2");
  1114. fprintf(pp, " 8=0.2");
  1115. }
  1116. else
  1117. {
  1118. fprintf(pp, " 5=%f", variances[0]);
  1119. fprintf(pp, " 6=%f", variances[1]);
  1120. fprintf(pp, " 7=%f", variances[2]);
  1121. fprintf(pp, " 8=%f", variances[3]);
  1122. }
  1123. }
  1124. else if (n.op == "_contrib_MultiBoxPrior")
  1125. {
  1126. // mxnet-ssd encode size as scale factor, fill min_size
  1127. std::vector<float> sizes = n.attr("sizes");
  1128. fprintf(pp, " -23300=%d", (int)sizes.size());
  1129. for (int j=0; j<(int)sizes.size(); j++)
  1130. {
  1131. fprintf(pp, ",%f", sizes[j]);
  1132. }
  1133. std::vector<float> aspect_ratios = n.attr("ratios");
  1134. fprintf(pp, " -23302=%d", (int)aspect_ratios.size());
  1135. for (int j=0; j<(int)aspect_ratios.size(); j++)
  1136. {
  1137. fprintf(pp, ",%f", aspect_ratios[j]);
  1138. }
  1139. int flip = 0;
  1140. fprintf(pp, " 7=%d", flip);
  1141. int clip = n.attr("clip");
  1142. fprintf(pp, " 8=%d", clip);
  1143. // auto image size
  1144. fprintf(pp, " 9=-233");
  1145. fprintf(pp, " 10=-233");
  1146. std::vector<float> steps = n.attr("steps");
  1147. if (steps.empty() || (steps[0] == -1.f && steps[1] == -1.f))
  1148. {
  1149. // auto step
  1150. fprintf(pp, " 11=-233.0");
  1151. fprintf(pp, " 12=-233.0");
  1152. }
  1153. else
  1154. {
  1155. fprintf(stderr, "Unsupported steps param! %f %f\n", steps[0], steps[1]);
  1156. }
  1157. std::vector<float> offsets = n.attr("offsets");
  1158. if (offsets.empty() || (offsets[0] == 0.5f && offsets[1] == 0.5f))
  1159. {
  1160. fprintf(pp, " 13=0.5");
  1161. }
  1162. else
  1163. {
  1164. fprintf(stderr, "Unsupported offsets param! %f %f\n", offsets[0], offsets[1]);
  1165. }
  1166. }
  1167. else if (n.op == "_div_scalar")
  1168. {
  1169. int op_type = 3;
  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 == "_maximum_scalar")
  1177. {
  1178. int op_type = 4;
  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 == "_minimum_scalar")
  1186. {
  1187. int op_type = 5;
  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 == "_minus_scalar")
  1195. {
  1196. int op_type = 1;
  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 == "_mul_scalar")
  1204. {
  1205. int op_type = 2;
  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 == "_plus_scalar")
  1213. {
  1214. int op_type = 0;
  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 == "_power_scalar")
  1222. {
  1223. int op_type = 6;
  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 == "_rdiv_scalar")
  1231. {
  1232. int op_type = 8;
  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 == "_rminus_scalar")
  1240. {
  1241. int op_type = 7;
  1242. int with_scalar = 1;
  1243. float scalar = n.attr("scalar");
  1244. fprintf(pp, " 0=%d", op_type);
  1245. fprintf(pp, " 1=%d", with_scalar);
  1246. fprintf(pp, " 2=%f", scalar);
  1247. }
  1248. else if (n.op == "abs")
  1249. {
  1250. int op_type = 0;
  1251. fprintf(pp, " 0=%d", op_type);
  1252. }
  1253. else if (n.op == "Activation")
  1254. {
  1255. std::string type = n.attr("act_type");
  1256. if (type == "relu")
  1257. {
  1258. // fprintf(pp, " 0=%f", 0.f);
  1259. }
  1260. }
  1261. else if (n.op == "arccos")
  1262. {
  1263. int op_type = 13;
  1264. fprintf(pp, " 0=%d", op_type);
  1265. }
  1266. else if (n.op == "arcsin")
  1267. {
  1268. int op_type = 12;
  1269. fprintf(pp, " 0=%d", op_type);
  1270. }
  1271. else if (n.op == "arctan")
  1272. {
  1273. int op_type = 14;
  1274. fprintf(pp, " 0=%d", op_type);
  1275. }
  1276. else if (n.op == "BatchNorm")
  1277. {
  1278. float eps = 1e-3;
  1279. if (n.has_attr("eps")) {
  1280. eps = n.attr("eps");
  1281. }
  1282. std::vector<float> slope_data = n.weight(0);
  1283. std::vector<float> bias_data = n.weight(1);
  1284. int channels = slope_data.size();
  1285. std::vector<float> mean_data = n.weight(2, channels);
  1286. std::vector<float> var_data = n.weight(3, channels);
  1287. for (int j=0; j<(int)var_data.size(); j++)
  1288. {
  1289. var_data[j] += eps;
  1290. }
  1291. fprintf(pp, " 0=%d", channels);
  1292. int fix_gamma = n.has_attr("fix_gamma") ? n.attr("fix_gamma") : 0;
  1293. if (fix_gamma)
  1294. {
  1295. // slope data are all 0 here, force set 1
  1296. for (int j=0; j<channels; j++)
  1297. {
  1298. slope_data[j] = 1.f;
  1299. }
  1300. }
  1301. fwrite(slope_data.data(), sizeof(float), slope_data.size(), bp);
  1302. fwrite(mean_data.data(), sizeof(float), mean_data.size(), bp);
  1303. fwrite(var_data.data(), sizeof(float), var_data.size(), bp);
  1304. fwrite(bias_data.data(), sizeof(float), bias_data.size(), bp);
  1305. }
  1306. else if (n.op == "broadcast_add")
  1307. {
  1308. int op_type = 0;
  1309. fprintf(pp, " 0=%d", op_type);
  1310. }
  1311. else if (n.op == "broadcast_div")
  1312. {
  1313. int op_type = 3;
  1314. fprintf(pp, " 0=%d", op_type);
  1315. }
  1316. else if (n.op == "broadcast_mul")
  1317. {
  1318. int op_type = 2;
  1319. fprintf(pp, " 0=%d", op_type);
  1320. }
  1321. else if (n.op == "broadcast_sub")
  1322. {
  1323. int op_type = 1;
  1324. fprintf(pp, " 0=%d", op_type);
  1325. }
  1326. else if (n.op == "ceil")
  1327. {
  1328. int op_type = 3;
  1329. fprintf(pp, " 0=%d", op_type);
  1330. }
  1331. else if (n.op == "clip")
  1332. {
  1333. float min = n.attr("a_min");
  1334. float max = n.attr("a_max");
  1335. fprintf(pp, " 0=%f", min);
  1336. fprintf(pp, " 1=%f", max);
  1337. }
  1338. else if (n.op == "Concat")
  1339. {
  1340. int dim = n.has_attr("dim") ? n.attr("dim") : 1;
  1341. fprintf(pp, " 0=%d", dim-1);
  1342. }
  1343. else if (n.op == "Convolution")
  1344. {
  1345. int num_filter = n.attr("num_filter");
  1346. std::vector<int> kernel = n.attr("kernel");
  1347. std::vector<int> dilate = n.attr("dilate");
  1348. std::vector<int> stride = n.attr("stride");
  1349. std::vector<int> pad = n.attr("pad");
  1350. int no_bias = n.attr("no_bias");
  1351. int num_group = n.attr("num_group");
  1352. std::vector<float> weight_data = n.weight(0);
  1353. std::vector<float> bias_data = n.weight(1);
  1354. fprintf(pp, " 0=%d", num_filter);
  1355. if (kernel.size() == 1) {
  1356. fprintf(pp, " 1=%d", kernel[0]);
  1357. } else if (kernel.size() == 2) {
  1358. fprintf(pp, " 1=%d", kernel[1]);
  1359. fprintf(pp, " 11=%d", kernel[0]);
  1360. }
  1361. if (dilate.size() == 1) {
  1362. fprintf(pp, " 2=%d", dilate[0]);
  1363. } else if (dilate.size() == 2) {
  1364. fprintf(pp, " 2=%d", dilate[1]);
  1365. fprintf(pp, " 12=%d", dilate[0]);
  1366. }
  1367. if (stride.size() == 1) {
  1368. fprintf(pp, " 3=%d", stride[0]);
  1369. } else if (stride.size() == 2) {
  1370. fprintf(pp, " 3=%d", stride[1]);
  1371. fprintf(pp, " 13=%d", stride[0]);
  1372. }
  1373. if (pad.size() == 1) {
  1374. fprintf(pp, " 4=%d", pad[0]);
  1375. } else if (pad.size() == 2) {
  1376. fprintf(pp, " 4=%d", pad[1]);
  1377. fprintf(pp, " 14=%d", pad[0]);
  1378. }
  1379. fprintf(pp, " 5=%d", no_bias == 1 ? 0 : 1);
  1380. fprintf(pp, " 6=%d", (int)weight_data.size());
  1381. if (num_group > 1) {
  1382. fprintf(pp, " 7=%d", num_group);
  1383. }
  1384. int quantize_tag = 0;
  1385. fwrite(&quantize_tag, sizeof(int), 1, bp);
  1386. fwrite(weight_data.data(), sizeof(float), weight_data.size(), bp);
  1387. fwrite(bias_data.data(), sizeof(float), bias_data.size(), bp);
  1388. }
  1389. else if (n.op == "Deconvolution")
  1390. {
  1391. int num_filter = n.attr("num_filter");
  1392. std::vector<int> kernel = n.attr("kernel");
  1393. std::vector<int> dilate = n.attr("dilate");
  1394. std::vector<int> stride = n.attr("stride");
  1395. std::vector<int> pad = n.attr("pad");
  1396. int no_bias = n.attr("no_bias");
  1397. int num_group = n.attr("num_group");
  1398. std::vector<float> weight_data = n.weight(0);
  1399. std::vector<float> bias_data = n.weight(1);
  1400. fprintf(pp, " 0=%d", num_filter);
  1401. if (kernel.size() == 1) {
  1402. fprintf(pp, " 1=%d", kernel[0]);
  1403. } else if (kernel.size() == 2) {
  1404. fprintf(pp, " 1=%d", kernel[1]);
  1405. fprintf(pp, " 11=%d", kernel[0]);
  1406. }
  1407. if (dilate.size() == 1) {
  1408. fprintf(pp, " 2=%d", dilate[0]);
  1409. } else if (dilate.size() == 2) {
  1410. fprintf(pp, " 2=%d", dilate[1]);
  1411. fprintf(pp, " 12=%d", dilate[0]);
  1412. }
  1413. if (stride.size() == 1) {
  1414. fprintf(pp, " 3=%d", stride[0]);
  1415. } else if (stride.size() == 2) {
  1416. fprintf(pp, " 3=%d", stride[1]);
  1417. fprintf(pp, " 13=%d", stride[0]);
  1418. }
  1419. if (pad.size() == 1) {
  1420. fprintf(pp, " 4=%d", pad[0]);
  1421. } else if (pad.size() == 2) {
  1422. fprintf(pp, " 4=%d", pad[1]);
  1423. fprintf(pp, " 14=%d", pad[0]);
  1424. }
  1425. fprintf(pp, " 5=%d", no_bias == 1 ? 0 : 1);
  1426. fprintf(pp, " 6=%d", (int)weight_data.size());
  1427. if (num_group > 1) {
  1428. fprintf(pp, " 7=%d", num_group);
  1429. }
  1430. int quantize_tag = 0;
  1431. fwrite(&quantize_tag, sizeof(int), 1, bp);
  1432. int maxk = 0;
  1433. if (kernel.size() == 2)
  1434. {
  1435. maxk = kernel[1] * kernel[0];
  1436. }
  1437. else
  1438. {
  1439. maxk = kernel[0] * kernel[0];
  1440. }
  1441. for (int g=0; g<num_group; g++)
  1442. {
  1443. // reorder weight from inch-outch to outch-inch
  1444. int num_filter_g = num_filter / num_group;
  1445. int num_input = weight_data.size() / maxk / num_filter_g / num_group;
  1446. const float* weight_data_ptr = weight_data.data() + g * maxk * num_filter_g * num_input;
  1447. for (int k=0; k<num_filter_g; k++)
  1448. {
  1449. for (int j=0; j<num_input; j++)
  1450. {
  1451. fwrite(weight_data_ptr + (j*num_filter_g + k) * maxk, sizeof(float), maxk, bp);
  1452. }
  1453. }
  1454. }
  1455. fwrite(bias_data.data(), sizeof(float), bias_data.size(), bp);
  1456. }
  1457. else if (n.op == "cos")
  1458. {
  1459. int op_type = 10;
  1460. fprintf(pp, " 0=%d", op_type);
  1461. }
  1462. else if (n.op == "Dropout")
  1463. {
  1464. // float p = n.attr("p");
  1465. // fprintf(pp, " 0=%d", p);
  1466. }
  1467. else if (n.op == "elemwise_add")
  1468. {
  1469. int op_type = 0;
  1470. fprintf(pp, " 0=%d", op_type);
  1471. }
  1472. else if (n.op == "elemwise_div")
  1473. {
  1474. int op_type = 3;
  1475. fprintf(pp, " 0=%d", op_type);
  1476. }
  1477. else if (n.op == "elemwise_mul")
  1478. {
  1479. int op_type = 2;
  1480. fprintf(pp, " 0=%d", op_type);
  1481. }
  1482. else if (n.op == "elemwise_sub")
  1483. {
  1484. int op_type = 1;
  1485. fprintf(pp, " 0=%d", op_type);
  1486. }
  1487. else if (n.op == "Embedding")
  1488. {
  1489. int input_dim = n.attr("input_dim");
  1490. int output_dim = n.attr("output_dim");
  1491. std::vector<float> weight_data = n.weight(0);
  1492. fprintf(pp, " 0=%d", output_dim);
  1493. fprintf(pp, " 1=%d", input_dim);
  1494. fprintf(pp, " 3=%d", (int)weight_data.size());
  1495. int quantize_tag = 0;
  1496. fwrite(&quantize_tag, sizeof(int), 1, bp);
  1497. fwrite(weight_data.data(), sizeof(float), weight_data.size(), bp);
  1498. }
  1499. else if (n.op == "exp")
  1500. {
  1501. int op_type = 7;
  1502. fprintf(pp, " 0=%d", op_type);
  1503. }
  1504. else if (n.op == "expand_dims")
  1505. {
  1506. int axis = n.attr("axis");
  1507. int expand_w = 0;
  1508. int expand_h = 0;
  1509. int expand_c = 0;
  1510. if (axis == 0)
  1511. expand_c = 1;
  1512. if (axis == 1)
  1513. expand_h = 1;
  1514. if (axis == 2)
  1515. expand_w = 1;
  1516. fprintf(pp, " 0=%d", expand_w);
  1517. fprintf(pp, " 1=%d", expand_h);
  1518. fprintf(pp, " 2=%d", expand_c);
  1519. }
  1520. else if (n.op == "Flatten")
  1521. {
  1522. }
  1523. else if (n.op == "floor")
  1524. {
  1525. int op_type = 2;
  1526. fprintf(pp, " 0=%d", op_type);
  1527. }
  1528. else if (n.op == "FullyConnected")
  1529. {
  1530. int num_hidden = n.attr("num_hidden");
  1531. int no_bias = n.attr("no_bias");
  1532. // int flatten = n.attr("flatten");
  1533. // TODO flatten
  1534. std::vector<float> weight_data = n.weight(0);
  1535. std::vector<float> bias_data = n.weight(1);
  1536. fprintf(pp, " 0=%d", num_hidden);
  1537. fprintf(pp, " 1=%d", no_bias == 1 ? 0 : 1);
  1538. fprintf(pp, " 2=%d", (int)weight_data.size());
  1539. int quantize_tag = 0;
  1540. fwrite(&quantize_tag, sizeof(int), 1, bp);
  1541. fwrite(weight_data.data(), sizeof(float), weight_data.size(), bp);
  1542. fwrite(bias_data.data(), sizeof(float), bias_data.size(), bp);
  1543. }
  1544. else if (n.op == "InstanceNorm")
  1545. {
  1546. float eps = n.has_attr("eps") ? n.attr("eps") : 0.001f;
  1547. std::vector<float> gamma_data = n.weight(0);
  1548. std::vector<float> beta_data = n.weight(1);
  1549. fprintf(pp, " 0=%d", (int)gamma_data.size());
  1550. fprintf(pp, " 1=%f", eps);
  1551. fwrite(gamma_data.data(), sizeof(float), gamma_data.size(), bp);
  1552. fwrite(beta_data.data(), sizeof(float), beta_data.size(), bp);
  1553. }
  1554. else if (n.op == "L2Normalization")
  1555. {
  1556. std::string mode = n.attr("mode");
  1557. float eps = n.has_attr("eps") ? n.attr("eps") : 1e-10;
  1558. int across_spatial = 0;
  1559. int across_channel = 1;
  1560. int channel_shared = 1;
  1561. int scale_data_size = 1;
  1562. if (mode == "instance")
  1563. {
  1564. across_spatial = 1;
  1565. across_channel = 1;
  1566. }
  1567. else if (mode == "channel")
  1568. {
  1569. across_spatial = 0;
  1570. across_channel = 1;
  1571. }
  1572. else if (mode == "spatial")
  1573. {
  1574. across_spatial = 1;
  1575. across_channel = 0;
  1576. }
  1577. fprintf(pp, " 0=%d", across_spatial);
  1578. fprintf(pp, " 4=%d", across_channel);
  1579. fprintf(pp, " 1=%d", channel_shared);
  1580. fprintf(pp, " 2=%f", eps);
  1581. fprintf(pp, " 3=%d", scale_data_size);
  1582. const float scale_data[1] = { 1.f };
  1583. fwrite(scale_data, sizeof(float), 1, bp);
  1584. }
  1585. else if (n.op == "LeakyReLU")
  1586. {
  1587. std::string type = n.attr("act_type");
  1588. if (type == "elu")
  1589. {
  1590. float slope = n.has_attr("slope") ? n.attr("slope") : 0.25f;
  1591. fprintf(pp, " 0=%f", slope);
  1592. }
  1593. else if (type == "leaky" || type.empty())
  1594. {
  1595. float slope = n.has_attr("slope") ? n.attr("slope") : 0.25f;
  1596. fprintf(pp, " 0=%f", slope);
  1597. }
  1598. else if (type == "prelu")
  1599. {
  1600. std::vector<float> weight_data = n.weight(0);
  1601. fprintf(pp, " 0=%d", (int)weight_data.size());
  1602. fwrite(weight_data.data(), sizeof(float), weight_data.size(), bp);
  1603. }
  1604. }
  1605. else if (n.op == "log")
  1606. {
  1607. int op_type = 8;
  1608. fprintf(pp, " 0=%d", op_type);
  1609. }
  1610. else if (n.op == "LogisticRegressionOutput")
  1611. {
  1612. }
  1613. else if (n.op == "max")
  1614. {
  1615. int operation = 4;
  1616. fprintf(pp, " 0=%d", operation);
  1617. }
  1618. else if (n.op == "maximum")
  1619. {
  1620. int op_type = 4;
  1621. fprintf(pp, " 0=%d", op_type);
  1622. }
  1623. else if (n.op == "mean")
  1624. {
  1625. int operation = 3;
  1626. fprintf(pp, " 0=%d", operation);
  1627. }
  1628. else if (n.op == "min")
  1629. {
  1630. int operation = 5;
  1631. fprintf(pp, " 0=%d", operation);
  1632. }
  1633. else if (n.op == "minimum")
  1634. {
  1635. int op_type = 5;
  1636. fprintf(pp, " 0=%d", op_type);
  1637. }
  1638. else if (n.op == "negative")
  1639. {
  1640. int op_type = 1;
  1641. fprintf(pp, " 0=%d", op_type);
  1642. }
  1643. else if (n.op == "Pooling")
  1644. {
  1645. std::string pool_type = n.attr("pool_type");
  1646. std::vector<int> kernel = n.attr("kernel");
  1647. std::vector<int> stride = n.attr("stride");
  1648. std::vector<int> pad = n.attr("pad");
  1649. std::string pooling_convention = n.attr("pooling_convention");
  1650. int global_pool = n.attr("global_pool");
  1651. int pool = 0;
  1652. if (pool_type == "max")
  1653. {
  1654. pool = 0;
  1655. }
  1656. else if (pool_type == "avg")
  1657. {
  1658. pool = 1;
  1659. }
  1660. int pad_mode = 1;
  1661. if (pooling_convention == "valid")
  1662. {
  1663. pad_mode = 1;
  1664. }
  1665. else if (pooling_convention == "full")
  1666. {
  1667. pad_mode = 0;
  1668. }
  1669. fprintf(pp, " 0=%d", pool);
  1670. if (!kernel.empty())
  1671. fprintf(pp, " 1=%d", kernel[0]);
  1672. if (!stride.empty())
  1673. fprintf(pp, " 2=%d", stride[0]);
  1674. if (!pad.empty())
  1675. fprintf(pp, " 3=%d", pad[0]);
  1676. fprintf(pp, " 4=%d", global_pool);
  1677. fprintf(pp, " 5=%d", pad_mode);
  1678. }
  1679. else if (n.op == "prod")
  1680. {
  1681. int operation = 6;
  1682. fprintf(pp, " 0=%d", operation);
  1683. }
  1684. else if (n.op == "reciprocal")
  1685. {
  1686. int op_type = 15;
  1687. fprintf(pp, " 0=%d", op_type);
  1688. }
  1689. else if (n.op == "relu")
  1690. {
  1691. }
  1692. else if (n.op == "Reshape")
  1693. {
  1694. std::vector<int> shape = n.attr("shape");
  1695. if (shape.size() == 1) {
  1696. fprintf(pp, " 0=%d", shape[0]);// should never reach here
  1697. } else if (shape.size() == 2) {
  1698. fprintf(pp, " 0=%d", shape[1]);
  1699. } else if (shape.size() == 3) {
  1700. fprintf(pp, " 0=%d", shape[2]);
  1701. fprintf(pp, " 1=%d", shape[1]);
  1702. } else if (shape.size() == 4) {
  1703. fprintf(pp, " 0=%d", shape[3]);
  1704. fprintf(pp, " 1=%d", shape[2]);
  1705. fprintf(pp, " 2=%d", shape[1]);
  1706. } else if (shape.size() == 5) {
  1707. fprintf(pp, " 0=%d", shape[4] * shape[3]);
  1708. fprintf(pp, " 1=%d", shape[2]);
  1709. fprintf(pp, " 2=%d", shape[1]);
  1710. }
  1711. }
  1712. else if (n.op == "ShuffleChannel")
  1713. {
  1714. int group = n.attr("group");
  1715. fprintf(pp, " 0=%d", group);
  1716. }
  1717. else if (n.op == "sigmoid")
  1718. {
  1719. }
  1720. else if (n.op == "sin")
  1721. {
  1722. int op_type = 9;
  1723. fprintf(pp, " 0=%d", op_type);
  1724. }
  1725. else if (n.op == "SliceChannel")
  1726. {
  1727. int num_outputs = n.attr("num_outputs");
  1728. int squeeze_axis = n.attr("squeeze_axis");// TODO
  1729. fprintf(pp, " -23300=%d", num_outputs);
  1730. for (int j=0; j<num_outputs; j++)
  1731. {
  1732. fprintf(pp, ",-233");
  1733. }
  1734. }
  1735. else if (n.op == "SoftmaxOutput")
  1736. {
  1737. }
  1738. else if (n.op == "sqrt")
  1739. {
  1740. int op_type = 5;
  1741. fprintf(pp, " 0=%d", op_type);
  1742. }
  1743. else if (n.op == "square")
  1744. {
  1745. int op_type = 4;
  1746. fprintf(pp, " 0=%d", op_type);
  1747. }
  1748. else if (n.op == "sum")
  1749. {
  1750. int operation = 0;
  1751. fprintf(pp, " 0=%d", operation);
  1752. }
  1753. else if (n.op == "tan")
  1754. {
  1755. int op_type = 11;
  1756. fprintf(pp, " 0=%d", op_type);
  1757. }
  1758. else if (n.op == "tanh")
  1759. {
  1760. }
  1761. else if (n.op == "Transpose" || n.op == "transpose")
  1762. {
  1763. std::vector<int> axes = n.attr("axes");
  1764. if (axes.size() == 3) {
  1765. if (axes[1] == 2 && axes[2] == 1)
  1766. fprintf(pp, " 0=1");// h w c
  1767. else
  1768. fprintf(stderr, "Unsupported transpose type !\n");
  1769. }
  1770. else if (axes.size() == 4) {
  1771. if (axes[1] == 1 && axes[2] == 2 && axes[3] == 3)
  1772. fprintf(pp, " 0=0");// w h c
  1773. else if (axes[1] == 1 && axes[2] == 3 && axes[3] == 2)
  1774. fprintf(pp, " 0=1");// h w c
  1775. else if (axes[1] == 2 && axes[2] == 1 && axes[3] == 3)
  1776. fprintf(pp, " 0=2");// w c h
  1777. else if (axes[1] == 2 && axes[2] == 3 && axes[3] == 1)
  1778. fprintf(pp, " 0=3");// c w h
  1779. else if (axes[1] == 3 && axes[2] == 1 && axes[3] == 2)
  1780. fprintf(pp, " 0=4");// h c w
  1781. else if (axes[1] == 3 && axes[2] == 2 && axes[3] == 1)
  1782. fprintf(pp, " 0=5");// c h w
  1783. } else if (axes.size() == 5) {
  1784. if (axes[1] == 1 && axes[2] == 2 && axes[3] == 3 && axes[4] == 4)
  1785. fprintf(pp, " 0=0");// wx h c
  1786. else if (axes[1] == 1 && axes[2] == 3 && axes[3] == 4 && axes[4] == 2)
  1787. fprintf(pp, " 0=1");// h wx c
  1788. else if (axes[1] == 2 && axes[2] == 1 && axes[3] == 3 && axes[4] == 4)
  1789. fprintf(pp, " 0=2");// wx c h
  1790. else if (axes[1] == 2 && axes[2] == 3 && axes[3] == 4 && axes[4] == 1)
  1791. fprintf(pp, " 0=3");// c wx h
  1792. else if (axes[1] == 3 && axes[2] == 4 && axes[3] == 1 && axes[4] == 2)
  1793. fprintf(pp, " 0=4");// h c wx
  1794. else if (axes[1] == 3 && axes[2] == 4 && axes[3] == 2 && axes[4] == 1)
  1795. fprintf(pp, " 0=5");// c h wx
  1796. else
  1797. fprintf(stderr, "Unsupported transpose type !\n");
  1798. }
  1799. else
  1800. {
  1801. fprintf(stderr, "Unsupported transpose type !\n");
  1802. }
  1803. }
  1804. else
  1805. {
  1806. // TODO op specific params
  1807. std::map<std::string, std::string>::const_iterator it = n.attrs.begin();
  1808. for (; it != n.attrs.end(); it++)
  1809. {
  1810. fprintf(stderr, "# %s=%s\n", it->first.c_str(), it->second.c_str());
  1811. // fprintf(pp, " %s=%s", it->first.c_str(), it->second.c_str());
  1812. }
  1813. }
  1814. fprintf(pp, "\n");
  1815. for (int j=0; j<n.output_size; j++)
  1816. {
  1817. int input_uid = i | (j << 16);
  1818. if (node_reference.find(input_uid) != node_reference.end())
  1819. {
  1820. int refcount = node_reference[input_uid];
  1821. if (refcount > 1)
  1822. {
  1823. std::string output_name = n.name;
  1824. char splitname[256];
  1825. sprintf(splitname, "splitncnn_%d", internal_split);
  1826. fprintf(pp, "%-16s %-32s %d %d", "Split", splitname, 1, refcount);
  1827. if (j == 0)
  1828. {
  1829. fprintf(pp, " %s", output_name.c_str());
  1830. }
  1831. else
  1832. {
  1833. fprintf(pp, " %s_subncnn_%d", output_name.c_str(), j);
  1834. }
  1835. for (int k=0; k<refcount; k++)
  1836. {
  1837. if (j == 0)
  1838. {
  1839. fprintf(pp, " %s_splitncnn_%d", output_name.c_str(), k);
  1840. }
  1841. else
  1842. {
  1843. fprintf(pp, " %s_subncnn_%d_splitncnn_%d", output_name.c_str(), j, k);
  1844. }
  1845. }
  1846. fprintf(pp, "\n");
  1847. internal_split++;
  1848. }
  1849. }
  1850. }
  1851. }
  1852. fclose(pp);
  1853. fclose(bp);
  1854. return 0;
  1855. }