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 50 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
1234567891011121314151617181920212223242526272829303132333435363738394041424344454647484950515253545556575859606162636465666768697071727374757677787980818283848586878889909192939495969798991001011021031041051061071081091101111121131141151161171181191201211221231241251261271281291301311321331341351361371381391401411421431441451461471481491501511521531541551561571581591601611621631641651661671681691701711721731741751761771781791801811821831841851861871881891901911921931941951961971981992002012022032042052062072082092102112122132142152162172182192202212222232242252262272282292302312322332342352362372382392402412422432442452462472482492502512522532542552562572582592602612622632642652662672682692702712722732742752762772782792802812822832842852862872882892902912922932942952962972982993003013023033043053063073083093103113123133143153163173183193203213223233243253263273283293303313323333343353363373383393403413423433443453463473483493503513523533543553563573583593603613623633643653663673683693703713723733743753763773783793803813823833843853863873883893903913923933943953963973983994004014024034044054064074084094104114124134144154164174184194204214224234244254264274284294304314324334344354364374384394404414424434444454464474484494504514524534544554564574584594604614624634644654664674684694704714724734744754764774784794804814824834844854864874884894904914924934944954964974984995005015025035045055065075085095105115125135145155165175185195205215225235245255265275285295305315325335345355365375385395405415425435445455465475485495505515525535545555565575585595605615625635645655665675685695705715725735745755765775785795805815825835845855865875885895905915925935945955965975985996006016026036046056066076086096106116126136146156166176186196206216226236246256266276286296306316326336346356366376386396406416426436446456466476486496506516526536546556566576586596606616626636646656666676686696706716726736746756766776786796806816826836846856866876886896906916926936946956966976986997007017027037047057067077087097107117127137147157167177187197207217227237247257267277287297307317327337347357367377387397407417427437447457467477487497507517527537547557567577587597607617627637647657667677687697707717727737747757767777787797807817827837847857867877887897907917927937947957967977987998008018028038048058068078088098108118128138148158168178188198208218228238248258268278288298308318328338348358368378388398408418428438448458468478488498508518528538548558568578588598608618628638648658668678688698708718728738748758768778788798808818828838848858868878888898908918928938948958968978988999009019029039049059069079089099109119129139149159169179189199209219229239249259269279289299309319329339349359369379389399409419429439449459469479489499509519529539549559569579589599609619629639649659669679689699709719729739749759769779789799809819829839849859869879889899909919929939949959969979989991000100110021003100410051006100710081009101010111012101310141015101610171018101910201021102210231024102510261027102810291030103110321033103410351036103710381039104010411042104310441045104610471048104910501051105210531054105510561057105810591060106110621063106410651066106710681069107010711072107310741075107610771078107910801081108210831084108510861087108810891090109110921093109410951096109710981099110011011102110311041105110611071108110911101111111211131114111511161117111811191120112111221123112411251126112711281129113011311132113311341135113611371138113911401141114211431144114511461147114811491150115111521153115411551156115711581159116011611162116311641165116611671168116911701171117211731174117511761177117811791180118111821183118411851186118711881189119011911192119311941195119611971198119912001201120212031204120512061207120812091210121112121213121412151216121712181219122012211222122312241225122612271228122912301231123212331234123512361237123812391240124112421243124412451246124712481249125012511252125312541255125612571258125912601261126212631264126512661267126812691270127112721273127412751276127712781279128012811282128312841285128612871288128912901291129212931294129512961297129812991300130113021303130413051306130713081309131013111312131313141315131613171318131913201321132213231324132513261327132813291330133113321333133413351336133713381339134013411342134313441345134613471348134913501351135213531354135513561357135813591360136113621363136413651366136713681369137013711372137313741375137613771378137913801381138213831384138513861387138813891390139113921393139413951396139713981399140014011402140314041405140614071408140914101411141214131414141514161417141814191420142114221423142414251426142714281429143014311432143314341435143614371438143914401441144214431444144514461447144814491450145114521453145414551456145714581459146014611462146314641465146614671468146914701471147214731474147514761477147814791480148114821483148414851486148714881489149014911492149314941495149614971498149915001501150215031504150515061507150815091510151115121513151415151516151715181519152015211522152315241525152615271528152915301531153215331534153515361537153815391540154115421543154415451546154715481549155015511552155315541555155615571558155915601561156215631564156515661567156815691570157115721573157415751576157715781579158015811582158315841585158615871588158915901591159215931594159515961597159815991600160116021603160416051606160716081609161016111612161316141615161616171618161916201621162216231624162516261627162816291630163116321633163416351636163716381639164016411642164316441645164616471648164916501651165216531654165516561657165816591660166116621663166416651666166716681669167016711672167316741675167616771678167916801681168216831684168516861687168816891690169116921693169416951696169716981699170017011702170317041705170617071708170917101711171217131714171517161717171817191720172117221723172417251726172717281729173017311732173317341735173617371738173917401741174217431744174517461747174817491750
  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. };
  37. AttrProxy attr(const char* key) const { return AttrProxy(this, key); }
  38. int attr_i(const char* key) const;
  39. float attr_f(const char* key) const;
  40. std::string attr_s(const char* key) const;
  41. std::vector<int> attr_ai(const char* key) const;
  42. public:
  43. bool is_weight() const;
  44. bool has_weight(int i) const;
  45. std::vector<float> weight(int i, int init_len = 0) const;
  46. std::vector<MXNetNode>* nodes;// reference
  47. std::vector<MXNetParam>* params;// reference
  48. public:
  49. std::string op;
  50. std::string name;
  51. std::map<std::string, std::string> attrs;
  52. std::vector<int> inputs;
  53. std::vector<int> subinputs;
  54. std::vector<int> weights;
  55. };
  56. class MXNetParam
  57. {
  58. public:
  59. std::string name;
  60. std::vector<float> data;
  61. std::string init;
  62. };
  63. bool MXNetNode::has_attr(const char* key) const
  64. {
  65. const std::map<std::string, std::string>::const_iterator it = attrs.find(key);
  66. return it != attrs.end();
  67. }
  68. int MXNetNode::attr_i(const char* key) const
  69. {
  70. const std::map<std::string, std::string>::const_iterator it = attrs.find(key);
  71. if (it == attrs.end())
  72. return 0;
  73. if (it->second == "False")
  74. return 0;
  75. if (it->second == "True")
  76. return 1;
  77. int i = 0;
  78. int nscan = sscanf(it->second.c_str(), "%d", &i);
  79. if (nscan != 1)
  80. return 0;
  81. return i;
  82. }
  83. float MXNetNode::attr_f(const char* key) const
  84. {
  85. const std::map<std::string, std::string>::const_iterator it = attrs.find(key);
  86. if (it == attrs.end())
  87. return 0.f;
  88. float f = 0;
  89. int nscan = sscanf(it->second.c_str(), "%f", &f);
  90. if (nscan != 1)
  91. return 0.f;
  92. return f;
  93. }
  94. std::string MXNetNode::attr_s(const char* key) const
  95. {
  96. const std::map<std::string, std::string>::const_iterator it = attrs.find(key);
  97. if (it == attrs.end())
  98. return std::string();
  99. return it->second;
  100. }
  101. std::vector<int> MXNetNode::attr_ai(const char* key) const
  102. {
  103. const std::map<std::string, std::string>::const_iterator it = attrs.find(key);
  104. if (it == attrs.end())
  105. return std::vector<int>();
  106. // (1,2,3)
  107. std::vector<int> list;
  108. int i = 0;
  109. int c = 0;
  110. int nconsumed = 0;
  111. int nscan = sscanf(it->second.c_str() + c, "%*[(,]%d%n", &i, &nconsumed);
  112. while (nscan == 1)
  113. {
  114. list.push_back(i);
  115. // fprintf(stderr, "%d\n", i);
  116. i = 0;
  117. c += nconsumed;
  118. nscan = sscanf(it->second.c_str() + c, "%*[(,]%d%n", &i, &nconsumed);
  119. }
  120. return list;
  121. }
  122. bool MXNetNode::is_weight() const
  123. {
  124. for (int i=0; i<(int)(*params).size(); i++)
  125. {
  126. const MXNetParam& p = (*params)[i];
  127. if (p.name == name)
  128. return true;
  129. }
  130. return false;
  131. }
  132. bool MXNetNode::has_weight(int i) const
  133. {
  134. if (i < 0 || i >= (int)weights.size())
  135. return false;
  136. const std::string& name = (*nodes)[ weights[i] ].name;
  137. for (int i=0; i<(int)(*params).size(); i++)
  138. {
  139. const MXNetParam& p = (*params)[i];
  140. if (p.name == name)
  141. return true;
  142. }
  143. return false;
  144. }
  145. std::vector<float> MXNetNode::weight(int i, int init_len) const
  146. {
  147. if (i < 0 || i >= (int)weights.size())
  148. return std::vector<float>();
  149. const std::string& name = (*nodes)[ weights[i] ].name;
  150. for (int i=0; i<(int)(*params).size(); i++)
  151. {
  152. const MXNetParam& p = (*params)[i];
  153. if (p.name != name)
  154. continue;
  155. if (!p.data.empty())
  156. return p.data;
  157. std::vector<float> data;
  158. if (!p.init.empty() && init_len != 0)
  159. {
  160. if (p.init == "[\\$zero\\$, {}]")
  161. {
  162. data.resize(init_len, 0.f);
  163. }
  164. else if (p.init == "[\\$one\\$, {}]")
  165. {
  166. data.resize(init_len, 1.f);
  167. }
  168. }
  169. return data;
  170. }
  171. return std::vector<float>();
  172. }
  173. static void replace_backslash_doublequote_dollar(char* s)
  174. {
  175. char* a = s;
  176. char* b = s+1;
  177. while (*a && *b)
  178. {
  179. if (*a == '\\' && *b == '\"')
  180. {
  181. *b = '$';
  182. }
  183. a++;
  184. b++;
  185. }
  186. }
  187. static void parse_input_list(const char* s, std::vector<int>& inputs, std::vector<int>& subinputs)
  188. {
  189. inputs.clear();
  190. subinputs.clear();
  191. if (memcmp(s, "[]", 2) == 0)
  192. return;
  193. int nscan = 0;
  194. int nconsumed = 0;
  195. int id;
  196. int subid;
  197. int c = 1;// skip leading [
  198. nscan = sscanf(s + c, "[%d, %d%n", &id, &subid, &nconsumed);
  199. while (nscan == 2)
  200. {
  201. inputs.push_back(id);
  202. subinputs.push_back(subid);
  203. // fprintf(stderr, "%d %d\n", id, subid);
  204. c += nconsumed;
  205. nscan = sscanf(s + c, "%*[^[][%d, %d%n", &id, &subid, &nconsumed);
  206. }
  207. }
  208. static bool read_mxnet_json(const char* jsonpath, std::vector<MXNetNode>& nodes)
  209. {
  210. FILE* fp = fopen(jsonpath, "rb");
  211. if (!fp)
  212. {
  213. fprintf(stderr, "fopen %s failed\n", jsonpath);
  214. return false;
  215. }
  216. int internal_unknown = 0;
  217. char line[1024];
  218. //{
  219. fgets(line, 1024, fp);
  220. MXNetNode n;
  221. bool in_nodes_list = false;
  222. bool in_node_block = false;
  223. bool in_attr_block = false;
  224. while (!feof(fp))
  225. {
  226. char* s = fgets(line, 1024, fp);
  227. if (!s)
  228. break;
  229. if (in_attr_block)
  230. {
  231. // },
  232. if (memcmp(line, " }", 7) == 0)
  233. {
  234. in_attr_block = false;
  235. continue;
  236. }
  237. // replace \" with \$
  238. replace_backslash_doublequote_dollar(line);
  239. // "kernel": "(7,7)",
  240. char key[256] = {0};
  241. char value[256] = {0};
  242. int nscan = sscanf(line, " \"%255[^\"]\": \"%255[^\"]\"", key, value);
  243. if (nscan == 2)
  244. {
  245. n.attrs[key] = value;
  246. // fprintf(stderr, "# %s = %s\n", key, value);
  247. continue;
  248. }
  249. }
  250. if (in_node_block)
  251. {
  252. // },
  253. if (memcmp(line, " }", 5) == 0)
  254. {
  255. // new node
  256. if (n.name.empty())
  257. {
  258. // assign default unknown name
  259. char unknownname[256];
  260. sprintf(unknownname, "unknownncnn_%d", internal_unknown);
  261. n.name = unknownname;
  262. internal_unknown++;
  263. }
  264. nodes.push_back(n);
  265. in_node_block = false;
  266. continue;
  267. }
  268. int nscan;
  269. // "op": "Convolution",
  270. char op[256] = {0};
  271. nscan = sscanf(line, " \"op\": \"%255[^\"]\",", op);
  272. if (nscan == 1)
  273. {
  274. n.op = op;
  275. // fprintf(stderr, "op = %s\n", op);
  276. continue;
  277. }
  278. // "name": "conv0",
  279. char name[256] = {0};
  280. nscan = sscanf(line, " \"name\": \"%255[^\"]\",", name);
  281. if (nscan == 1)
  282. {
  283. n.name = name;
  284. // fprintf(stderr, "name = %s\n", name);
  285. continue;
  286. }
  287. // "inputs": []
  288. char inputs[256] = {0};
  289. nscan = sscanf(line, " \"inputs\": %255[^\n]", inputs);
  290. if (nscan == 1)
  291. {
  292. parse_input_list(inputs, n.inputs, n.subinputs);
  293. // fprintf(stderr, "inputs = %s\n", inputs);
  294. continue;
  295. }
  296. // "param": {},
  297. if (memcmp(line, " \"param\": {}", 17) == 0)
  298. {
  299. continue;
  300. }
  301. // replace \" with \$
  302. replace_backslash_doublequote_dollar(line);
  303. // "attr": {"__init__": "[\"zero\", {}]"},
  304. char key[256] = {0};
  305. char value[256] = {0};
  306. nscan = sscanf(line, " \"attr\": {\"%255[^\"]\": \"%255[^\"]\"}", key, value);
  307. if (nscan == 2)
  308. {
  309. n.attrs[key] = value;
  310. // fprintf(stderr, "# %s = %s\n", key, value);
  311. continue;
  312. }
  313. // "attrs": {"__init__": "[\"zero\", {}]"},
  314. nscan = sscanf(line, " \"attrs\": {\"%255[^\"]\": \"%255[^\"]\"}", key, value);
  315. if (nscan == 2)
  316. {
  317. n.attrs[key] = value;
  318. // fprintf(stderr, "# %s = %s\n", key, value);
  319. continue;
  320. }
  321. // "param": {"p": "0.5"},
  322. nscan = sscanf(line, " \"param\": {\"%255[^\"]\": \"%255[^\"]\"}", key, value);
  323. if (nscan == 2)
  324. {
  325. n.attrs[key] = value;
  326. // fprintf(stderr, "# %s = %s\n", key, value);
  327. continue;
  328. }
  329. // "attr": {
  330. if (memcmp(line, " \"attr\": {", 15) == 0)
  331. {
  332. in_attr_block = true;
  333. continue;
  334. }
  335. // "attrs": {
  336. if (memcmp(line, " \"attrs\": {", 15) == 0)
  337. {
  338. in_attr_block = true;
  339. continue;
  340. }
  341. // "param": {
  342. if (memcmp(line, " \"param\": {", 16) == 0)
  343. {
  344. in_attr_block = true;
  345. continue;
  346. }
  347. }
  348. if (in_nodes_list)
  349. {
  350. // ],
  351. if (memcmp(line, " ],", 4) == 0)
  352. {
  353. in_nodes_list = false;
  354. // all nodes parsed
  355. break;
  356. }
  357. // {
  358. if (memcmp(line, " {", 5) == 0)
  359. {
  360. n = MXNetNode();
  361. in_node_block = true;
  362. continue;
  363. }
  364. }
  365. // "nodes": [
  366. if (memcmp(line, " \"nodes\": [", 12) == 0)
  367. {
  368. in_nodes_list = true;
  369. continue;
  370. }
  371. }
  372. fclose(fp);
  373. return true;
  374. }
  375. static bool read_mxnet_param(const char* parampath, std::vector<MXNetParam>& params)
  376. {
  377. FILE* fp = fopen(parampath, "rb");
  378. if (!fp)
  379. {
  380. fprintf(stderr, "fopen %s failed\n", parampath);
  381. return false;
  382. }
  383. uint64_t header;
  384. uint64_t reserved;
  385. fread(&header, 1, sizeof(uint64_t), fp);
  386. fread(&reserved, 1, sizeof(uint64_t), fp);
  387. // NDArray vec
  388. // each data
  389. uint64_t data_count;
  390. fread(&data_count, 1, sizeof(uint64_t), fp);
  391. // fprintf(stderr, "data count = %d\n", (int)data_count);
  392. for (int i = 0; i < (int)data_count; i++)
  393. {
  394. uint32_t magic;// 0xF993FAC9
  395. fread(&magic, 1, sizeof(uint32_t), fp);
  396. // shape
  397. uint32_t ndim;
  398. std::vector<int64_t> shape;
  399. if (magic == 0xF993FAC9)
  400. {
  401. int32_t stype;
  402. fread(&stype, 1, sizeof(int32_t), fp);
  403. fread(&ndim, 1, sizeof(uint32_t), fp);
  404. shape.resize(ndim);
  405. fread(&shape[0], 1, ndim * sizeof(int64_t), fp);
  406. }
  407. else if (magic == 0xF993FAC8)
  408. {
  409. fread(&ndim, 1, sizeof(uint32_t), fp);
  410. shape.resize(ndim);
  411. fread(&shape[0], 1, ndim * sizeof(int64_t), fp);
  412. }
  413. else
  414. {
  415. ndim = magic;
  416. shape.resize(ndim);
  417. std::vector<uint32_t> shape32;
  418. shape32.resize(ndim);
  419. fread(&shape32[0], 1, ndim * sizeof(uint32_t), fp);
  420. for (int j=0; j<(int)ndim; j++)
  421. {
  422. shape[j] = shape32[j];
  423. }
  424. }
  425. // context
  426. int32_t dev_type;
  427. int32_t dev_id;
  428. fread(&dev_type, 1, sizeof(int32_t), fp);
  429. fread(&dev_id, 1, sizeof(int32_t), fp);
  430. int32_t type_flag;
  431. fread(&type_flag, 1, sizeof(int32_t), fp);
  432. // data
  433. size_t len = 0;
  434. if (shape.size() == 1) len = shape[0];
  435. if (shape.size() == 2) len = shape[0] * shape[1];
  436. if (shape.size() == 3) len = shape[0] * shape[1] * shape[2];
  437. if (shape.size() == 4) len = shape[0] * shape[1] * shape[2] * shape[3];
  438. MXNetParam p;
  439. p.data.resize(len);
  440. fread(&p.data[0], 1, len * sizeof(float), fp);
  441. params.push_back(p);
  442. // fprintf(stderr, "%u read\n", len);
  443. }
  444. // each name
  445. uint64_t name_count;
  446. fread(&name_count, 1, sizeof(uint64_t), fp);
  447. // fprintf(stderr, "name count = %d\n", (int)name_count);
  448. for (int i = 0; i < (int)name_count; i++)
  449. {
  450. uint64_t len;
  451. fread(&len, 1, sizeof(uint64_t), fp);
  452. MXNetParam& p = params[i];
  453. p.name.resize(len);
  454. fread((char*)p.name.data(), 1, len, fp);
  455. // cut leading arg:
  456. if (memcmp(p.name.c_str(), "arg:", 4) == 0)
  457. {
  458. p.name = std::string(p.name.c_str() + 4);
  459. }
  460. if (memcmp(p.name.c_str(), "aux:", 4) == 0)
  461. {
  462. p.name = std::string(p.name.c_str() + 4);
  463. }
  464. // fprintf(stderr, "%s read\n", p.name.c_str());
  465. }
  466. fclose(fp);
  467. return true;
  468. }
  469. int main(int argc, char** argv)
  470. {
  471. const char* jsonpath = argv[1];
  472. const char* parampath = argv[2];
  473. const char* ncnn_prototxt = argc >= 5 ? argv[3] : "ncnn.param";
  474. const char* ncnn_modelbin = argc >= 5 ? argv[4] : "ncnn.bin";
  475. std::vector<MXNetNode> nodes;
  476. std::vector<MXNetParam> params;
  477. read_mxnet_json(jsonpath, nodes);
  478. read_mxnet_param(parampath, params);
  479. FILE* pp = fopen(ncnn_prototxt, "wb");
  480. FILE* bp = fopen(ncnn_modelbin, "wb");
  481. // magic
  482. fprintf(pp, "7767517\n");
  483. int node_count = nodes.size();
  484. // node reference
  485. std::map<int, int> node_reference;
  486. // weight node
  487. std::vector<int> weight_nodes;
  488. // global definition line
  489. // [layer count] [blob count]
  490. std::set<std::string> blob_names;
  491. for (int i=0; i<node_count; i++)
  492. {
  493. MXNetNode& n = nodes[i];
  494. // assign global param reference
  495. n.nodes = &nodes;
  496. n.params = &params;
  497. const std::string& output_name = n.name;
  498. int output_size = 1;
  499. if (n.op == "null")
  500. {
  501. if (n.is_weight())
  502. {
  503. weight_nodes.push_back(i);
  504. }
  505. else
  506. {
  507. if (n.has_attr("__init__"))
  508. {
  509. // init weight param
  510. MXNetParam pi;
  511. pi.name = n.name;
  512. pi.init = (std::string)n.attr("__init__");
  513. params.push_back(pi);
  514. weight_nodes.push_back(i);
  515. }
  516. else
  517. {
  518. // null node without data, treat it as network input
  519. }
  520. }
  521. continue;
  522. }
  523. else if (n.op == "SliceChannel")
  524. {
  525. output_size = n.attr("num_outputs");
  526. }
  527. // distinguish weights and inputs
  528. std::vector<int> weights;
  529. std::vector<int> inputs;
  530. for (int j=0; j<(int)n.inputs.size(); j++)
  531. {
  532. int input_index = n.inputs[j];
  533. if (nodes[input_index].is_weight())
  534. {
  535. weights.push_back(input_index);
  536. continue;
  537. }
  538. inputs.push_back(input_index);
  539. }
  540. n.inputs = inputs;
  541. n.weights = weights;
  542. // input
  543. for (int j=0; j<(int)n.inputs.size(); j++)
  544. {
  545. int input_index = n.inputs[j];
  546. int subinput_index = n.subinputs[j];
  547. std::string input_name = nodes[input_index].name;
  548. // fprintf(stderr, "input = %s\n", input_name.c_str());
  549. if (subinput_index != 0)
  550. {
  551. char subinputsuffix[256];
  552. sprintf(subinputsuffix, "_subncnn_%d", subinput_index);
  553. input_name = input_name + subinputsuffix;
  554. }
  555. blob_names.insert(input_name);
  556. int input_uid = input_index | (subinput_index << 16);
  557. if (node_reference.find(input_uid) == node_reference.end())
  558. {
  559. node_reference[input_uid] = 1;
  560. }
  561. else
  562. {
  563. node_reference[input_uid] = node_reference[input_uid] + 1;
  564. }
  565. }
  566. // output
  567. // fprintf(stderr, "output = %s\n", output_name.c_str());
  568. blob_names.insert(output_name);
  569. for (int j=1; j<output_size; j++)
  570. {
  571. char subinputsuffix[256];
  572. sprintf(subinputsuffix, "_%d", j);
  573. std::string output_name_j = output_name + subinputsuffix;
  574. blob_names.insert(output_name_j);
  575. }
  576. }
  577. // remove node_reference entry with reference equals to one
  578. int splitncnn_blob_count = 0;
  579. std::map<int, int>::iterator it = node_reference.begin();
  580. while (it != node_reference.end())
  581. {
  582. if (it->second == 1)
  583. {
  584. node_reference.erase(it++);
  585. }
  586. else
  587. {
  588. splitncnn_blob_count += it->second;
  589. // fprintf(stderr, "%s %d\n", it->first.c_str(), it->second);
  590. ++it;
  591. }
  592. }
  593. fprintf(pp, "%lu %lu\n", node_count + node_reference.size() - weight_nodes.size(), blob_names.size() + splitncnn_blob_count);
  594. int internal_split = 0;
  595. for (int i=0; i<node_count; i++)
  596. {
  597. const MXNetNode& n = nodes[i];
  598. int output_size = 1;
  599. if (n.op == "null")
  600. {
  601. if (n.is_weight())
  602. {
  603. continue;
  604. }
  605. fprintf(pp, "%-16s", "Input");
  606. }
  607. else if (n.op == "_div_scalar")
  608. {
  609. fprintf(pp, "%-16s", "BinaryOp");
  610. }
  611. else if (n.op == "_minus_scalar")
  612. {
  613. fprintf(pp, "%-16s", "BinaryOp");
  614. }
  615. else if (n.op == "_mul_scalar")
  616. {
  617. fprintf(pp, "%-16s", "BinaryOp");
  618. }
  619. else if (n.op == "_plus_scalar")
  620. {
  621. fprintf(pp, "%-16s", "BinaryOp");
  622. }
  623. else if (n.op == "_rdiv_scalar")
  624. {
  625. fprintf(pp, "%-16s", "BinaryOp");
  626. }
  627. else if (n.op == "_rminus_scalar")
  628. {
  629. fprintf(pp, "%-16s", "BinaryOp");
  630. }
  631. else if (n.op == "abs")
  632. {
  633. fprintf(pp, "%-16s", "UnaryOp");
  634. }
  635. else if (n.op == "Activation")
  636. {
  637. std::string type = n.attr("act_type");
  638. if (type == "relu")
  639. {
  640. fprintf(pp, "%-16s", "ReLU");
  641. }
  642. else if (type == "sigmoid")
  643. {
  644. fprintf(pp, "%-16s", "Sigmoid");
  645. }
  646. else if (type == "tanh")
  647. {
  648. fprintf(pp, "%-16s", "TanH");
  649. }
  650. }
  651. else if (n.op == "arccos")
  652. {
  653. fprintf(pp, "%-16s", "UnaryOp");
  654. }
  655. else if (n.op == "arcsin")
  656. {
  657. fprintf(pp, "%-16s", "UnaryOp");
  658. }
  659. else if (n.op == "arctan")
  660. {
  661. fprintf(pp, "%-16s", "UnaryOp");
  662. }
  663. else if (n.op == "BatchNorm")
  664. {
  665. fprintf(pp, "%-16s", "BatchNorm");
  666. }
  667. else if (n.op == "broadcast_add")
  668. {
  669. fprintf(pp, "%-16s", "BinaryOp");
  670. }
  671. else if (n.op == "broadcast_div")
  672. {
  673. fprintf(pp, "%-16s", "BinaryOp");
  674. }
  675. else if (n.op == "broadcast_mul")
  676. {
  677. fprintf(pp, "%-16s", "BinaryOp");
  678. }
  679. else if (n.op == "broadcast_sub")
  680. {
  681. fprintf(pp, "%-16s", "BinaryOp");
  682. }
  683. else if (n.op == "ceil")
  684. {
  685. fprintf(pp, "%-16s", "UnaryOp");
  686. }
  687. else if (n.op == "clip")
  688. {
  689. fprintf(pp, "%-16s", "Clip");
  690. }
  691. else if (n.op == "Concat")
  692. {
  693. fprintf(pp, "%-16s", "Concat");
  694. }
  695. else if (n.op == "Convolution")
  696. {
  697. int num_group = n.attr("num_group");
  698. if (num_group > 1) {
  699. fprintf(pp, "%-16s", "ConvolutionDepthWise");
  700. } else {
  701. fprintf(pp, "%-16s", "Convolution");
  702. }
  703. }
  704. else if (n.op == "cos")
  705. {
  706. fprintf(pp, "%-16s", "UnaryOp");
  707. }
  708. else if (n.op == "Deconvolution")
  709. {
  710. int num_group = n.attr("num_group");
  711. if (num_group > 1) {
  712. fprintf(pp, "%-16s", "DeconvolutionDepthWise");
  713. } else {
  714. fprintf(pp, "%-16s", "Deconvolution");
  715. }
  716. }
  717. else if (n.op == "Dropout")
  718. {
  719. fprintf(pp, "%-16s", "Dropout");
  720. }
  721. else if (n.op == "elemwise_add")
  722. {
  723. fprintf(pp, "%-16s", "BinaryOp");
  724. }
  725. else if (n.op == "elemwise_div")
  726. {
  727. fprintf(pp, "%-16s", "BinaryOp");
  728. }
  729. else if (n.op == "elemwise_mul")
  730. {
  731. fprintf(pp, "%-16s", "BinaryOp");
  732. }
  733. else if (n.op == "elemwise_sub")
  734. {
  735. fprintf(pp, "%-16s", "BinaryOp");
  736. }
  737. else if (n.op == "Embedding")
  738. {
  739. fprintf(pp, "%-16s", "Embed");
  740. }
  741. else if (n.op == "exp")
  742. {
  743. fprintf(pp, "%-16s", "UnaryOp");
  744. }
  745. else if (n.op == "expand_dims")
  746. {
  747. fprintf(pp, "%-16s", "ExpandDims");
  748. }
  749. else if (n.op == "Flatten")
  750. {
  751. fprintf(pp, "%-16s", "Flatten");
  752. }
  753. else if (n.op == "floor")
  754. {
  755. fprintf(pp, "%-16s", "UnaryOp");
  756. }
  757. else if (n.op == "FullyConnected")
  758. {
  759. fprintf(pp, "%-16s", "InnerProduct");
  760. }
  761. else if (n.op == "InstanceNorm")
  762. {
  763. fprintf(pp, "%-16s", "InstanceNorm");
  764. }
  765. else if (n.op == "L2Normalization")
  766. {
  767. fprintf(pp, "%-16s", "Normalize");
  768. }
  769. else if (n.op == "LeakyReLU")
  770. {
  771. std::string type = n.attr("act_type");
  772. if (type == "elu")
  773. {
  774. fprintf(pp, "%-16s", "ELU");
  775. }
  776. else if (type == "leaky")
  777. {
  778. fprintf(pp, "%-16s", "ReLU");
  779. }
  780. else if (type == "prelu")
  781. {
  782. fprintf(pp, "%-16s", "PReLU");
  783. }
  784. }
  785. else if (n.op == "log")
  786. {
  787. fprintf(pp, "%-16s", "UnaryOp");
  788. }
  789. else if (n.op == "max")
  790. {
  791. fprintf(pp, "%-16s", "Reduction");
  792. }
  793. else if (n.op == "maximum")
  794. {
  795. fprintf(pp, "%-16s", "BinaryOp");
  796. }
  797. else if (n.op == "mean")
  798. {
  799. fprintf(pp, "%-16s", "Reduction");
  800. }
  801. else if (n.op == "min")
  802. {
  803. fprintf(pp, "%-16s", "Reduction");
  804. }
  805. else if (n.op == "minimum")
  806. {
  807. fprintf(pp, "%-16s", "BinaryOp");
  808. }
  809. else if (n.op == "negative")
  810. {
  811. fprintf(pp, "%-16s", "UnaryOp");
  812. }
  813. else if (n.op == "Pooling")
  814. {
  815. fprintf(pp, "%-16s", "Pooling");
  816. }
  817. else if (n.op == "prod")
  818. {
  819. fprintf(pp, "%-16s", "Reduction");
  820. }
  821. else if (n.op == "reciprocal")
  822. {
  823. fprintf(pp, "%-16s", "UnaryOp");
  824. }
  825. else if (n.op == "relu")
  826. {
  827. fprintf(pp, "%-16s", "ReLU");
  828. }
  829. else if (n.op == "Reshape")
  830. {
  831. fprintf(pp, "%-16s", "Reshape");
  832. }
  833. else if (n.op == "sin")
  834. {
  835. fprintf(pp, "%-16s", "UnaryOp");
  836. }
  837. else if (n.op == "SliceChannel")
  838. {
  839. fprintf(pp, "%-16s", "Slice");
  840. output_size = n.attr("num_outputs");
  841. }
  842. else if (n.op == "SoftmaxOutput")
  843. {
  844. fprintf(pp, "%-16s", "Softmax");
  845. }
  846. else if (n.op == "SoftmaxActivation")
  847. {
  848. fprintf(pp, "%-16s", "Softmax");
  849. }
  850. else if (n.op == "sqrt")
  851. {
  852. fprintf(pp, "%-16s", "UnaryOp");
  853. }
  854. else if (n.op == "square")
  855. {
  856. fprintf(pp, "%-16s", "UnaryOp");
  857. }
  858. else if (n.op == "sum")
  859. {
  860. fprintf(pp, "%-16s", "Reduction");
  861. }
  862. else if (n.op == "tan")
  863. {
  864. fprintf(pp, "%-16s", "UnaryOp");
  865. }
  866. else if (n.op == "tanh")
  867. {
  868. fprintf(pp, "%-16s", "TanH");
  869. }
  870. else if (n.op == "Transpose")
  871. {
  872. fprintf(pp, "%-16s", "Permute");
  873. }
  874. else
  875. {
  876. fprintf(stderr, "%s not supported yet!\n", n.op.c_str());
  877. fprintf(pp, "%-16s", n.op.c_str());
  878. }
  879. int input_size = n.inputs.size();
  880. for (int j=0; j<(int)n.inputs.size(); j++)
  881. {
  882. int input_index = n.inputs[j];
  883. if (nodes[input_index].is_weight())
  884. {
  885. input_size--;
  886. }
  887. }
  888. if (n.op == "SoftmaxOutput")
  889. {
  890. // drop label
  891. input_size--;
  892. }
  893. fprintf(pp, " %-32s %d %d", n.name.c_str(), input_size, output_size);
  894. for (int j=0; j<(int)n.inputs.size(); j++)
  895. {
  896. int input_index = n.inputs[j];
  897. int subinput_index = n.subinputs[j];
  898. if (nodes[input_index].is_weight())
  899. {
  900. continue;
  901. }
  902. if (n.op == "SoftmaxOutput")
  903. {
  904. // drop label
  905. if (j == 1)
  906. continue;
  907. }
  908. std::string input_name = nodes[input_index].name;
  909. if (subinput_index != 0)
  910. {
  911. char subinputsuffix[256];
  912. sprintf(subinputsuffix, "_subncnn_%d", subinput_index);
  913. input_name = input_name + subinputsuffix;
  914. }
  915. int input_uid = input_index | (subinput_index << 16);
  916. if (node_reference.find(input_uid) != node_reference.end())
  917. {
  918. int refidx = node_reference[input_uid] - 1;
  919. node_reference[input_uid] = refidx;
  920. char splitsuffix[256];
  921. sprintf(splitsuffix, "_splitncnn_%d", refidx);
  922. input_name = input_name + splitsuffix;
  923. }
  924. fprintf(pp, " %s", input_name.c_str());
  925. }
  926. fprintf(pp, " %s", n.name.c_str());
  927. for (int j=1; j<output_size; j++)
  928. {
  929. fprintf(pp, " %s_subncnn_%d", n.name.c_str(), j);
  930. }
  931. if (n.op == "null")
  932. {
  933. // dummy input shape
  934. // fprintf(pp, " 0 0 0");
  935. }
  936. else if (n.op == "_div_scalar")
  937. {
  938. int op_type = 3;
  939. int with_scalar = 1;
  940. float scalar = n.attr("scalar");
  941. fprintf(pp, " 0=%d", op_type);
  942. fprintf(pp, " 1=%d", with_scalar);
  943. fprintf(pp, " 2=%f", scalar);
  944. }
  945. else if (n.op == "_minus_scalar")
  946. {
  947. int op_type = 1;
  948. int with_scalar = 1;
  949. float scalar = n.attr("scalar");
  950. fprintf(pp, " 0=%d", op_type);
  951. fprintf(pp, " 1=%d", with_scalar);
  952. fprintf(pp, " 2=%f", scalar);
  953. }
  954. else if (n.op == "_mul_scalar")
  955. {
  956. int op_type = 2;
  957. int with_scalar = 1;
  958. float scalar = n.attr("scalar");
  959. fprintf(pp, " 0=%d", op_type);
  960. fprintf(pp, " 1=%d", with_scalar);
  961. fprintf(pp, " 2=%f", scalar);
  962. }
  963. else if (n.op == "_plus_scalar")
  964. {
  965. int op_type = 0;
  966. int with_scalar = 1;
  967. float scalar = n.attr("scalar");
  968. fprintf(pp, " 0=%d", op_type);
  969. fprintf(pp, " 1=%d", with_scalar);
  970. fprintf(pp, " 2=%f", scalar);
  971. }
  972. else if (n.op == "_rdiv_scalar")
  973. {
  974. int op_type = 8;
  975. int with_scalar = 1;
  976. float scalar = n.attr("scalar");
  977. fprintf(pp, " 0=%d", op_type);
  978. fprintf(pp, " 1=%d", with_scalar);
  979. fprintf(pp, " 2=%f", scalar);
  980. }
  981. else if (n.op == "_rminus_scalar")
  982. {
  983. int op_type = 7;
  984. int with_scalar = 1;
  985. float scalar = n.attr("scalar");
  986. fprintf(pp, " 0=%d", op_type);
  987. fprintf(pp, " 1=%d", with_scalar);
  988. fprintf(pp, " 2=%f", scalar);
  989. }
  990. else if (n.op == "abs")
  991. {
  992. int op_type = 0;
  993. fprintf(pp, " 0=%d", op_type);
  994. }
  995. else if (n.op == "Activation")
  996. {
  997. std::string type = n.attr("act_type");
  998. if (type == "relu")
  999. {
  1000. // fprintf(pp, " 0=%f", 0.f);
  1001. }
  1002. }
  1003. else if (n.op == "arccos")
  1004. {
  1005. int op_type = 13;
  1006. fprintf(pp, " 0=%d", op_type);
  1007. }
  1008. else if (n.op == "arcsin")
  1009. {
  1010. int op_type = 12;
  1011. fprintf(pp, " 0=%d", op_type);
  1012. }
  1013. else if (n.op == "arctan")
  1014. {
  1015. int op_type = 14;
  1016. fprintf(pp, " 0=%d", op_type);
  1017. }
  1018. else if (n.op == "BatchNorm")
  1019. {
  1020. float eps = 1e-3;
  1021. if (n.has_attr("eps")) {
  1022. eps = n.attr("eps");
  1023. }
  1024. std::vector<float> slope_data = n.weight(0);
  1025. std::vector<float> bias_data = n.weight(1);
  1026. int channels = slope_data.size();
  1027. std::vector<float> mean_data = n.weight(2, channels);
  1028. std::vector<float> var_data = n.weight(3, channels);
  1029. for (int j=0; j<(int)var_data.size(); j++)
  1030. {
  1031. var_data[j] += eps;
  1032. }
  1033. fprintf(pp, " 0=%d", channels);
  1034. fwrite(slope_data.data(), sizeof(float), slope_data.size(), bp);
  1035. fwrite(mean_data.data(), sizeof(float), mean_data.size(), bp);
  1036. fwrite(var_data.data(), sizeof(float), var_data.size(), bp);
  1037. fwrite(bias_data.data(), sizeof(float), bias_data.size(), bp);
  1038. }
  1039. else if (n.op == "broadcast_add")
  1040. {
  1041. int op_type = 0;
  1042. fprintf(pp, " 0=%d", op_type);
  1043. }
  1044. else if (n.op == "broadcast_div")
  1045. {
  1046. int op_type = 3;
  1047. fprintf(pp, " 0=%d", op_type);
  1048. }
  1049. else if (n.op == "broadcast_mul")
  1050. {
  1051. int op_type = 2;
  1052. fprintf(pp, " 0=%d", op_type);
  1053. }
  1054. else if (n.op == "broadcast_sub")
  1055. {
  1056. int op_type = 1;
  1057. fprintf(pp, " 0=%d", op_type);
  1058. }
  1059. else if (n.op == "ceil")
  1060. {
  1061. int op_type = 3;
  1062. fprintf(pp, " 0=%d", op_type);
  1063. }
  1064. else if (n.op == "clip")
  1065. {
  1066. float min = n.attr("a_min");
  1067. float max = n.attr("a_max");
  1068. fprintf(pp, " 0=%f", min);
  1069. fprintf(pp, " 1=%f", max);
  1070. }
  1071. else if (n.op == "Concat")
  1072. {
  1073. int dim = n.has_attr("dim") ? n.attr("dim") : 1;
  1074. fprintf(pp, " 0=%d", dim-1);
  1075. }
  1076. else if (n.op == "Convolution")
  1077. {
  1078. int num_filter = n.attr("num_filter");
  1079. std::vector<int> kernel = n.attr("kernel");
  1080. std::vector<int> dilate = n.attr("dilate");
  1081. std::vector<int> stride = n.attr("stride");
  1082. std::vector<int> pad = n.attr("pad");
  1083. int no_bias = n.attr("no_bias");
  1084. int num_group = n.attr("num_group");
  1085. std::vector<float> weight_data = n.weight(0);
  1086. std::vector<float> bias_data = n.weight(1);
  1087. fprintf(pp, " 0=%d", num_filter);
  1088. if (kernel.size() == 1) {
  1089. fprintf(pp, " 1=%d", kernel[0]);
  1090. } else if (kernel.size() == 2) {
  1091. fprintf(pp, " 1=%d", kernel[1]);
  1092. fprintf(pp, " 11=%d", kernel[0]);
  1093. }
  1094. if (dilate.size() == 1) {
  1095. fprintf(pp, " 2=%d", dilate[0]);
  1096. } else if (dilate.size() == 2) {
  1097. fprintf(pp, " 2=%d", dilate[1]);
  1098. fprintf(pp, " 12=%d", dilate[0]);
  1099. }
  1100. if (stride.size() == 1) {
  1101. fprintf(pp, " 3=%d", stride[0]);
  1102. } else if (stride.size() == 2) {
  1103. fprintf(pp, " 3=%d", stride[1]);
  1104. fprintf(pp, " 13=%d", stride[0]);
  1105. }
  1106. if (pad.size() == 1) {
  1107. fprintf(pp, " 4=%d", pad[0]);
  1108. } else if (pad.size() == 2) {
  1109. fprintf(pp, " 4=%d", pad[1]);
  1110. fprintf(pp, " 14=%d", pad[0]);
  1111. }
  1112. fprintf(pp, " 5=%d", no_bias == 1 ? 0 : 1);
  1113. fprintf(pp, " 6=%d", (int)weight_data.size());
  1114. if (num_group > 1) {
  1115. fprintf(pp, " 7=%d", num_group);
  1116. }
  1117. int quantize_tag = 0;
  1118. fwrite(&quantize_tag, sizeof(int), 1, bp);
  1119. fwrite(weight_data.data(), sizeof(float), weight_data.size(), bp);
  1120. fwrite(bias_data.data(), sizeof(float), bias_data.size(), bp);
  1121. }
  1122. else if (n.op == "Deconvolution")
  1123. {
  1124. int num_filter = n.attr("num_filter");
  1125. std::vector<int> kernel = n.attr("kernel");
  1126. std::vector<int> dilate = n.attr("dilate");
  1127. std::vector<int> stride = n.attr("stride");
  1128. std::vector<int> pad = n.attr("pad");
  1129. int no_bias = n.attr("no_bias");
  1130. int num_group = n.attr("num_group");
  1131. std::vector<float> weight_data = n.weight(0);
  1132. std::vector<float> bias_data = n.weight(1);
  1133. fprintf(pp, " 0=%d", num_filter);
  1134. if (kernel.size() == 1) {
  1135. fprintf(pp, " 1=%d", kernel[0]);
  1136. } else if (kernel.size() == 2) {
  1137. fprintf(pp, " 1=%d", kernel[1]);
  1138. fprintf(pp, " 11=%d", kernel[0]);
  1139. }
  1140. if (dilate.size() == 1) {
  1141. fprintf(pp, " 2=%d", dilate[0]);
  1142. } else if (dilate.size() == 2) {
  1143. fprintf(pp, " 2=%d", dilate[1]);
  1144. fprintf(pp, " 12=%d", dilate[0]);
  1145. }
  1146. if (stride.size() == 1) {
  1147. fprintf(pp, " 3=%d", stride[0]);
  1148. } else if (stride.size() == 2) {
  1149. fprintf(pp, " 3=%d", stride[1]);
  1150. fprintf(pp, " 13=%d", stride[0]);
  1151. }
  1152. if (pad.size() == 1) {
  1153. fprintf(pp, " 4=%d", pad[0]);
  1154. } else if (pad.size() == 2) {
  1155. fprintf(pp, " 4=%d", pad[1]);
  1156. fprintf(pp, " 14=%d", pad[0]);
  1157. }
  1158. fprintf(pp, " 5=%d", no_bias == 1 ? 0 : 1);
  1159. fprintf(pp, " 6=%d", (int)weight_data.size());
  1160. if (num_group > 1) {
  1161. fprintf(pp, " 7=%d", num_group);
  1162. }
  1163. int quantize_tag = 0;
  1164. fwrite(&quantize_tag, sizeof(int), 1, bp);
  1165. fwrite(weight_data.data(), sizeof(float), weight_data.size(), bp);
  1166. fwrite(bias_data.data(), sizeof(float), bias_data.size(), bp);
  1167. }
  1168. else if (n.op == "cos")
  1169. {
  1170. int op_type = 10;
  1171. fprintf(pp, " 0=%d", op_type);
  1172. }
  1173. else if (n.op == "Dropout")
  1174. {
  1175. // float p = n.attr("p");
  1176. // fprintf(pp, " 0=%d", p);
  1177. }
  1178. else if (n.op == "elemwise_add")
  1179. {
  1180. int op_type = 0;
  1181. fprintf(pp, " 0=%d", op_type);
  1182. }
  1183. else if (n.op == "elemwise_div")
  1184. {
  1185. int op_type = 3;
  1186. fprintf(pp, " 0=%d", op_type);
  1187. }
  1188. else if (n.op == "elemwise_mul")
  1189. {
  1190. int op_type = 2;
  1191. fprintf(pp, " 0=%d", op_type);
  1192. }
  1193. else if (n.op == "elemwise_sub")
  1194. {
  1195. int op_type = 1;
  1196. fprintf(pp, " 0=%d", op_type);
  1197. }
  1198. else if (n.op == "Embedding")
  1199. {
  1200. int input_dim = n.attr("input_dim");
  1201. int output_dim = n.attr("output_dim");
  1202. std::vector<float> weight_data = n.weight(0);
  1203. fprintf(pp, " 0=%d", output_dim);
  1204. fprintf(pp, " 1=%d", input_dim);
  1205. fprintf(pp, " 3=%d", (int)weight_data.size());
  1206. int quantize_tag = 0;
  1207. fwrite(&quantize_tag, sizeof(int), 1, bp);
  1208. fwrite(weight_data.data(), sizeof(float), weight_data.size(), bp);
  1209. }
  1210. else if (n.op == "exp")
  1211. {
  1212. int op_type = 7;
  1213. fprintf(pp, " 0=%d", op_type);
  1214. }
  1215. else if (n.op == "expand_dims")
  1216. {
  1217. int axis = n.attr("axis");
  1218. int expand_w = 0;
  1219. int expand_h = 0;
  1220. int expand_c = 0;
  1221. if (axis == 0)
  1222. expand_c = 1;
  1223. if (axis == 1)
  1224. expand_h = 1;
  1225. if (axis == 2)
  1226. expand_w = 1;
  1227. fprintf(pp, " 0=%d", expand_w);
  1228. fprintf(pp, " 1=%d", expand_h);
  1229. fprintf(pp, " 2=%d", expand_c);
  1230. }
  1231. else if (n.op == "Flatten")
  1232. {
  1233. }
  1234. else if (n.op == "floor")
  1235. {
  1236. int op_type = 2;
  1237. fprintf(pp, " 0=%d", op_type);
  1238. }
  1239. else if (n.op == "FullyConnected")
  1240. {
  1241. int num_hidden = n.attr("num_hidden");
  1242. int no_bias = n.attr("no_bias");
  1243. // int flatten = n.attr("flatten");
  1244. // TODO flatten
  1245. std::vector<float> weight_data = n.weight(0);
  1246. std::vector<float> bias_data = n.weight(1);
  1247. fprintf(pp, " 0=%d", num_hidden);
  1248. fprintf(pp, " 1=%d", no_bias == 1 ? 0 : 1);
  1249. fprintf(pp, " 2=%d", (int)weight_data.size());
  1250. int quantize_tag = 0;
  1251. fwrite(&quantize_tag, sizeof(int), 1, bp);
  1252. fwrite(weight_data.data(), sizeof(float), weight_data.size(), bp);
  1253. fwrite(bias_data.data(), sizeof(float), bias_data.size(), bp);
  1254. }
  1255. else if (n.op == "InstanceNorm")
  1256. {
  1257. float eps = n.has_attr("eps") ? n.attr("eps") : 0.001f;
  1258. std::vector<float> gamma_data = n.weight(0);
  1259. std::vector<float> beta_data = n.weight(1);
  1260. fprintf(pp, " 0=%d", (int)gamma_data.size());
  1261. fprintf(pp, " 1=%f", eps);
  1262. fwrite(gamma_data.data(), sizeof(float), gamma_data.size(), bp);
  1263. fwrite(beta_data.data(), sizeof(float), beta_data.size(), bp);
  1264. }
  1265. else if (n.op == "L2Normalization")
  1266. {
  1267. std::string mode = n.attr("mode");
  1268. float eps = n.has_attr("eps") ? n.attr("eps") : 1e-10;
  1269. int across_spatial = 0;
  1270. int across_channel = 1;
  1271. int channel_shared = 1;
  1272. int scale_data_size = 1;
  1273. if (mode == "instance")
  1274. {
  1275. across_spatial = 1;
  1276. across_channel = 1;
  1277. }
  1278. else if (mode == "channel")
  1279. {
  1280. across_spatial = 0;
  1281. across_channel = 1;
  1282. }
  1283. else if (mode == "spatial")
  1284. {
  1285. across_spatial = 1;
  1286. across_channel = 0;
  1287. }
  1288. fprintf(pp, " 0=%d", across_spatial);
  1289. fprintf(pp, " 4=%d", across_channel);
  1290. fprintf(pp, " 1=%d", channel_shared);
  1291. fprintf(pp, " 2=%f", eps);
  1292. fprintf(pp, " 3=%d", scale_data_size);
  1293. const float scale_data[1] = { 1.f };
  1294. fwrite(scale_data, sizeof(float), 1, bp);
  1295. }
  1296. else if (n.op == "LeakyReLU")
  1297. {
  1298. std::string type = n.attr("act_type");
  1299. if (type == "elu")
  1300. {
  1301. float slope = n.has_attr("slope") ? n.attr("slope") : 0.25f;
  1302. fprintf(pp, " 0=%f", slope);
  1303. }
  1304. else if (type == "leaky")
  1305. {
  1306. float slope = n.has_attr("slope") ? n.attr("slope") : 0.25f;
  1307. fprintf(pp, " 0=%f", slope);
  1308. }
  1309. else if (type == "prelu")
  1310. {
  1311. std::vector<float> weight_data = n.weight(0);
  1312. fprintf(pp, " 0=%d", (int)weight_data.size());
  1313. fwrite(weight_data.data(), sizeof(float), weight_data.size(), bp);
  1314. }
  1315. }
  1316. else if (n.op == "log")
  1317. {
  1318. int op_type = 8;
  1319. fprintf(pp, " 0=%d", op_type);
  1320. }
  1321. else if (n.op == "max")
  1322. {
  1323. int operation = 4;
  1324. fprintf(pp, " 0=%d", operation);
  1325. }
  1326. else if (n.op == "maximum")
  1327. {
  1328. int op_type = 4;
  1329. fprintf(pp, " 0=%d", op_type);
  1330. }
  1331. else if (n.op == "mean")
  1332. {
  1333. int operation = 3;
  1334. fprintf(pp, " 0=%d", operation);
  1335. }
  1336. else if (n.op == "min")
  1337. {
  1338. int operation = 5;
  1339. fprintf(pp, " 0=%d", operation);
  1340. }
  1341. else if (n.op == "minimum")
  1342. {
  1343. int op_type = 5;
  1344. fprintf(pp, " 0=%d", op_type);
  1345. }
  1346. else if (n.op == "negative")
  1347. {
  1348. int op_type = 1;
  1349. fprintf(pp, " 0=%d", op_type);
  1350. }
  1351. else if (n.op == "Pooling")
  1352. {
  1353. std::string pool_type = n.attr("pool_type");
  1354. std::vector<int> kernel = n.attr("kernel");
  1355. std::vector<int> stride = n.attr("stride");
  1356. std::vector<int> pad = n.attr("pad");
  1357. std::string pooling_convention = n.attr("pooling_convention");
  1358. int global_pool = n.attr("global_pool");
  1359. int pool = 0;
  1360. if (pool_type == "max")
  1361. {
  1362. pool = 0;
  1363. }
  1364. else if (pool_type == "avg")
  1365. {
  1366. pool = 1;
  1367. }
  1368. int pad_mode = 1;
  1369. if (pooling_convention == "valid")
  1370. {
  1371. pad_mode = 1;
  1372. }
  1373. else if (pooling_convention == "full")
  1374. {
  1375. pad_mode = 0;
  1376. }
  1377. fprintf(pp, " 0=%d", pool);
  1378. if (!kernel.empty())
  1379. fprintf(pp, " 1=%d", kernel[0]);
  1380. if (!stride.empty())
  1381. fprintf(pp, " 2=%d", stride[0]);
  1382. if (!pad.empty())
  1383. fprintf(pp, " 3=%d", pad[0]);
  1384. fprintf(pp, " 4=%d", global_pool);
  1385. fprintf(pp, " 5=%d", pad_mode);
  1386. }
  1387. else if (n.op == "prod")
  1388. {
  1389. int operation = 6;
  1390. fprintf(pp, " 0=%d", operation);
  1391. }
  1392. else if (n.op == "reciprocal")
  1393. {
  1394. int op_type = 15;
  1395. fprintf(pp, " 0=%d", op_type);
  1396. }
  1397. else if (n.op == "relu")
  1398. {
  1399. }
  1400. else if (n.op == "Reshape")
  1401. {
  1402. std::vector<int> shape = n.attr("shape");
  1403. if (shape.size() == 1) {
  1404. fprintf(pp, " 0=%d", shape[0]);// should never reach here
  1405. } else if (shape.size() == 2) {
  1406. fprintf(pp, " 0=%d", shape[1]);
  1407. } else if (shape.size() == 3) {
  1408. fprintf(pp, " 0=%d", shape[2]);
  1409. fprintf(pp, " 1=%d", shape[1]);
  1410. } else if (shape.size() == 4) {
  1411. fprintf(pp, " 0=%d", shape[3]);
  1412. fprintf(pp, " 1=%d", shape[2]);
  1413. fprintf(pp, " 2=%d", shape[1]);
  1414. } else if (shape.size() == 5) {
  1415. fprintf(pp, " 0=%d", shape[4] * shape[3]);
  1416. fprintf(pp, " 1=%d", shape[2]);
  1417. fprintf(pp, " 2=%d", shape[1]);
  1418. }
  1419. }
  1420. else if (n.op == "sin")
  1421. {
  1422. int op_type = 9;
  1423. fprintf(pp, " 0=%d", op_type);
  1424. }
  1425. else if (n.op == "SliceChannel")
  1426. {
  1427. int num_outputs = n.attr("num_outputs");
  1428. int squeeze_axis = n.attr("squeeze_axis");// TODO
  1429. fprintf(pp, " -23300=%d", num_outputs);
  1430. for (int j=0; j<num_outputs; j++)
  1431. {
  1432. fprintf(pp, ",-233");
  1433. }
  1434. }
  1435. else if (n.op == "SoftmaxOutput")
  1436. {
  1437. }
  1438. else if (n.op == "sqrt")
  1439. {
  1440. int op_type = 5;
  1441. fprintf(pp, " 0=%d", op_type);
  1442. }
  1443. else if (n.op == "square")
  1444. {
  1445. int op_type = 4;
  1446. fprintf(pp, " 0=%d", op_type);
  1447. }
  1448. else if (n.op == "sum")
  1449. {
  1450. int operation = 0;
  1451. fprintf(pp, " 0=%d", operation);
  1452. }
  1453. else if (n.op == "tan")
  1454. {
  1455. int op_type = 11;
  1456. fprintf(pp, " 0=%d", op_type);
  1457. }
  1458. else if (n.op == "tanh")
  1459. {
  1460. }
  1461. else if (n.op == "Transpose")
  1462. {
  1463. std::vector<int> axes = n.attr("axes");
  1464. if (axes.size() == 4) {
  1465. if (axes[1] == 1 && axes[2] == 2 && axes[3] == 3)
  1466. fprintf(pp, " 0=0");// w h c
  1467. else if (axes[1] == 1 && axes[2] == 3 && axes[3] == 2)
  1468. fprintf(pp, " 0=1");// h w c
  1469. else if (axes[1] == 2 && axes[2] == 1 && axes[3] == 3)
  1470. fprintf(pp, " 0=2");// w c h
  1471. else if (axes[1] == 2 && axes[2] == 3 && axes[3] == 1)
  1472. fprintf(pp, " 0=3");// c w h
  1473. else if (axes[1] == 3 && axes[2] == 1 && axes[3] == 2)
  1474. fprintf(pp, " 0=4");// h c w
  1475. else if (axes[1] == 3 && axes[2] == 2 && axes[3] == 1)
  1476. fprintf(pp, " 0=5");// c h w
  1477. } else if (axes.size() == 5) {
  1478. if (axes[1] == 1 && axes[2] == 2 && axes[3] == 3 && axes[4] == 4)
  1479. fprintf(pp, " 0=0");// wx h c
  1480. else if (axes[1] == 1 && axes[2] == 3 && axes[3] == 4 && axes[4] == 2)
  1481. fprintf(pp, " 0=1");// h wx c
  1482. else if (axes[1] == 2 && axes[2] == 1 && axes[3] == 3 && axes[4] == 4)
  1483. fprintf(pp, " 0=2");// wx c h
  1484. else if (axes[1] == 2 && axes[2] == 3 && axes[3] == 4 && axes[4] == 1)
  1485. fprintf(pp, " 0=3");// c wx h
  1486. else if (axes[1] == 3 && axes[2] == 4 && axes[3] == 1 && axes[4] == 2)
  1487. fprintf(pp, " 0=4");// h c wx
  1488. else if (axes[1] == 3 && axes[2] == 4 && axes[3] == 2 && axes[4] == 1)
  1489. fprintf(pp, " 0=5");// c h wx
  1490. else
  1491. fprintf(stderr, "Unsupported transpose type !\n");
  1492. }
  1493. }
  1494. else
  1495. {
  1496. // TODO op specific params
  1497. std::map<std::string, std::string>::const_iterator it = n.attrs.begin();
  1498. for (; it != n.attrs.end(); it++)
  1499. {
  1500. fprintf(stderr, "# %s=%s\n", it->first.c_str(), it->second.c_str());
  1501. // fprintf(pp, " %s=%s", it->first.c_str(), it->second.c_str());
  1502. }
  1503. }
  1504. fprintf(pp, "\n");
  1505. for (int j=0; j<output_size; j++)
  1506. {
  1507. int input_uid = i | (j << 16);
  1508. if (node_reference.find(input_uid) != node_reference.end())
  1509. {
  1510. int refcount = node_reference[input_uid];
  1511. if (refcount > 1)
  1512. {
  1513. std::string output_name = n.name;
  1514. char splitname[256];
  1515. sprintf(splitname, "splitncnn_%d", internal_split);
  1516. fprintf(pp, "%-16s %-32s %d %d", "Split", splitname, 1, refcount);
  1517. if (j == 0)
  1518. {
  1519. fprintf(pp, " %s", output_name.c_str());
  1520. }
  1521. else
  1522. {
  1523. fprintf(pp, " %s_subncnn_%d", output_name.c_str(), j);
  1524. }
  1525. for (int k=0; k<refcount; k++)
  1526. {
  1527. if (j == 0)
  1528. {
  1529. fprintf(pp, " %s_splitncnn_%d", output_name.c_str(), k);
  1530. }
  1531. else
  1532. {
  1533. fprintf(pp, " %s_subncnn_%d_splitncnn_%d", output_name.c_str(), j, k);
  1534. }
  1535. }
  1536. fprintf(pp, "\n");
  1537. internal_split++;
  1538. }
  1539. }
  1540. }
  1541. }
  1542. fclose(pp);
  1543. fclose(bp);
  1544. return 0;
  1545. }