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

mxnet2ncnn.cpp 71 kB

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