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