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