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