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 52 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
123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130131132133134135136137138139140141142143144145146147148149150151152153154155156157158159160161162163164165166167168169170171172173174175176177178179180181182183184185186187188189190191192193194195196197198199200201202203204205206207208209210211212213214215216217218219220221222223224225226227228229230231232233234235236237238239240241242243244245246247248249250251252253254255256257258259260261262263264265266267268269270271272273274275276277278279280281282283284285286287288289290291292293294295296297298299300301302303304305306307308309310311312313314315316317318319320321322323324325326327328329330331332333334335336337338339340341342343344345346347348349350351352353354355356357358359360361362363364365366367368369370371372373374375376377378379380381382383384385386387388389390391392393394395396397398399400401402403404405406407408409410411412413414415416417418419420421422423424425426427428429430431432433434435436437438439440441442443444445446447448449450451452453454455456457458459460461462463464465466467468469470471472473474475476477478479480481482483484485486487488489490491492493494495496497498499500501502503504505506507508509510511512513514515516517518519520521522523524525526527528529530531532533534535536537538539540541542543544545546547548549550551552553554555556557558559560561562563564565566567568569570571572573574575576577578579580581582583584585586587588589590591592593594595596597598599600601602603604605606607608609610611612613614615616617618619620621622623624625626627628629630631632633634635636637638639640641642643644645646647648649650651652653654655656657658659660661662663664665666667668669670671672673674675676677678679680681682683684685686687688689690691692693694695696697698699700701702703704705706707708709710711712713714715716717718719720721722723724725726727728729730731732733734735736737738739740741742743744745746747748749750751752753754755756757758759760761762763764765766767768769770771772773774775776777778779780781782783784785786787788789790791792793794795796797798799800801802803804805806807808809810811812813814815816817818819820821822823824825826827828829830831832833834835836837838839840841842843844845846847848849850851852853854855856857858859860861862863864865866867868869870871872873874875876877878879880881882883884885886887888889890891892893894895896897898899900901902903904905906907908909910911912913914915916917918919920921922923924925926927928929930931932933934935936937938939940941942943944945946947948949950951952953954955956957958959960961962963964965966967968969970971972973974975976977978979980981982983984985986987988989990991992993994995996997998999100010011002100310041005100610071008100910101011101210131014101510161017101810191020102110221023102410251026102710281029103010311032103310341035103610371038103910401041104210431044104510461047104810491050105110521053105410551056105710581059106010611062106310641065106610671068106910701071107210731074107510761077107810791080108110821083108410851086108710881089109010911092109310941095109610971098109911001101110211031104110511061107110811091110111111121113111411151116111711181119112011211122112311241125112611271128112911301131113211331134113511361137113811391140114111421143114411451146114711481149115011511152115311541155115611571158115911601161116211631164116511661167116811691170117111721173117411751176117711781179118011811182118311841185118611871188118911901191119211931194119511961197119811991200120112021203120412051206120712081209121012111212121312141215121612171218121912201221122212231224122512261227122812291230123112321233123412351236123712381239124012411242124312441245124612471248124912501251125212531254125512561257125812591260126112621263126412651266126712681269127012711272127312741275127612771278127912801281128212831284128512861287128812891290129112921293129412951296129712981299130013011302130313041305130613071308130913101311131213131314131513161317131813191320132113221323132413251326132713281329133013311332133313341335133613371338133913401341134213431344134513461347134813491350135113521353135413551356135713581359136013611362136313641365136613671368136913701371137213731374137513761377137813791380138113821383138413851386138713881389139013911392139313941395139613971398139914001401140214031404140514061407140814091410141114121413141414151416141714181419142014211422142314241425142614271428142914301431143214331434143514361437143814391440144114421443144414451446144714481449145014511452145314541455145614571458145914601461146214631464146514661467146814691470147114721473147414751476147714781479148014811482148314841485148614871488148914901491149214931494149514961497149814991500150115021503150415051506150715081509151015111512151315141515151615171518151915201521152215231524152515261527152815291530153115321533153415351536153715381539154015411542154315441545154615471548154915501551155215531554155515561557155815591560156115621563156415651566156715681569157015711572157315741575157615771578157915801581158215831584158515861587158815891590159115921593159415951596159715981599160016011602160316041605160616071608160916101611161216131614161516161617161816191620162116221623162416251626162716281629163016311632163316341635163616371638163916401641164216431644164516461647164816491650165116521653165416551656165716581659166016611662166316641665166616671668166916701671167216731674167516761677167816791680168116821683168416851686168716881689169016911692169316941695169616971698169917001701170217031704170517061707170817091710171117121713171417151716171717181719172017211722172317241725172617271728172917301731173217331734173517361737173817391740174117421743174417451746174717481749175017511752175317541755175617571758175917601761176217631764176517661767176817691770177117721773177417751776177717781779178017811782178317841785178617871788178917901791179217931794179517961797179817991800180118021803180418051806180718081809181018111812181318141815181618171818181918201821182218231824182518261827
  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 == "_maximum_scalar")
  612. {
  613. fprintf(pp, "%-16s", "BinaryOp");
  614. }
  615. else if (n.op == "_minimum_scalar")
  616. {
  617. fprintf(pp, "%-16s", "BinaryOp");
  618. }
  619. else if (n.op == "_minus_scalar")
  620. {
  621. fprintf(pp, "%-16s", "BinaryOp");
  622. }
  623. else if (n.op == "_mul_scalar")
  624. {
  625. fprintf(pp, "%-16s", "BinaryOp");
  626. }
  627. else if (n.op == "_plus_scalar")
  628. {
  629. fprintf(pp, "%-16s", "BinaryOp");
  630. }
  631. else if (n.op == "_power_scalar")
  632. {
  633. fprintf(pp, "%-16s", "BinaryOp");
  634. }
  635. else if (n.op == "_rdiv_scalar")
  636. {
  637. fprintf(pp, "%-16s", "BinaryOp");
  638. }
  639. else if (n.op == "_rminus_scalar")
  640. {
  641. fprintf(pp, "%-16s", "BinaryOp");
  642. }
  643. else if (n.op == "abs")
  644. {
  645. fprintf(pp, "%-16s", "UnaryOp");
  646. }
  647. else if (n.op == "Activation")
  648. {
  649. std::string type = n.attr("act_type");
  650. if (type == "relu")
  651. {
  652. fprintf(pp, "%-16s", "ReLU");
  653. }
  654. else if (type == "sigmoid")
  655. {
  656. fprintf(pp, "%-16s", "Sigmoid");
  657. }
  658. else if (type == "tanh")
  659. {
  660. fprintf(pp, "%-16s", "TanH");
  661. }
  662. }
  663. else if (n.op == "arccos")
  664. {
  665. fprintf(pp, "%-16s", "UnaryOp");
  666. }
  667. else if (n.op == "arcsin")
  668. {
  669. fprintf(pp, "%-16s", "UnaryOp");
  670. }
  671. else if (n.op == "arctan")
  672. {
  673. fprintf(pp, "%-16s", "UnaryOp");
  674. }
  675. else if (n.op == "BatchNorm")
  676. {
  677. fprintf(pp, "%-16s", "BatchNorm");
  678. }
  679. else if (n.op == "broadcast_add")
  680. {
  681. fprintf(pp, "%-16s", "BinaryOp");
  682. }
  683. else if (n.op == "broadcast_div")
  684. {
  685. fprintf(pp, "%-16s", "BinaryOp");
  686. }
  687. else if (n.op == "broadcast_mul")
  688. {
  689. fprintf(pp, "%-16s", "BinaryOp");
  690. }
  691. else if (n.op == "broadcast_sub")
  692. {
  693. fprintf(pp, "%-16s", "BinaryOp");
  694. }
  695. else if (n.op == "ceil")
  696. {
  697. fprintf(pp, "%-16s", "UnaryOp");
  698. }
  699. else if (n.op == "clip")
  700. {
  701. fprintf(pp, "%-16s", "Clip");
  702. }
  703. else if (n.op == "Concat")
  704. {
  705. fprintf(pp, "%-16s", "Concat");
  706. }
  707. else if (n.op == "Convolution")
  708. {
  709. int num_group = n.attr("num_group");
  710. if (num_group > 1) {
  711. fprintf(pp, "%-16s", "ConvolutionDepthWise");
  712. } else {
  713. fprintf(pp, "%-16s", "Convolution");
  714. }
  715. }
  716. else if (n.op == "cos")
  717. {
  718. fprintf(pp, "%-16s", "UnaryOp");
  719. }
  720. else if (n.op == "Deconvolution")
  721. {
  722. int num_group = n.attr("num_group");
  723. if (num_group > 1) {
  724. fprintf(pp, "%-16s", "DeconvolutionDepthWise");
  725. } else {
  726. fprintf(pp, "%-16s", "Deconvolution");
  727. }
  728. }
  729. else if (n.op == "Dropout")
  730. {
  731. fprintf(pp, "%-16s", "Dropout");
  732. }
  733. else if (n.op == "elemwise_add")
  734. {
  735. fprintf(pp, "%-16s", "BinaryOp");
  736. }
  737. else if (n.op == "elemwise_div")
  738. {
  739. fprintf(pp, "%-16s", "BinaryOp");
  740. }
  741. else if (n.op == "elemwise_mul")
  742. {
  743. fprintf(pp, "%-16s", "BinaryOp");
  744. }
  745. else if (n.op == "elemwise_sub")
  746. {
  747. fprintf(pp, "%-16s", "BinaryOp");
  748. }
  749. else if (n.op == "Embedding")
  750. {
  751. fprintf(pp, "%-16s", "Embed");
  752. }
  753. else if (n.op == "exp")
  754. {
  755. fprintf(pp, "%-16s", "UnaryOp");
  756. }
  757. else if (n.op == "expand_dims")
  758. {
  759. fprintf(pp, "%-16s", "ExpandDims");
  760. }
  761. else if (n.op == "Flatten")
  762. {
  763. fprintf(pp, "%-16s", "Flatten");
  764. }
  765. else if (n.op == "floor")
  766. {
  767. fprintf(pp, "%-16s", "UnaryOp");
  768. }
  769. else if (n.op == "FullyConnected")
  770. {
  771. fprintf(pp, "%-16s", "InnerProduct");
  772. }
  773. else if (n.op == "InstanceNorm")
  774. {
  775. fprintf(pp, "%-16s", "InstanceNorm");
  776. }
  777. else if (n.op == "L2Normalization")
  778. {
  779. fprintf(pp, "%-16s", "Normalize");
  780. }
  781. else if (n.op == "LeakyReLU")
  782. {
  783. std::string type = n.attr("act_type");
  784. if (type == "elu")
  785. {
  786. fprintf(pp, "%-16s", "ELU");
  787. }
  788. else if (type == "leaky")
  789. {
  790. fprintf(pp, "%-16s", "ReLU");
  791. }
  792. else if (type == "prelu")
  793. {
  794. fprintf(pp, "%-16s", "PReLU");
  795. }
  796. }
  797. else if (n.op == "log")
  798. {
  799. fprintf(pp, "%-16s", "UnaryOp");
  800. }
  801. else if (n.op == "LogisticRegressionOutput")
  802. {
  803. fprintf(pp, "%-16s", "Sigmoid");
  804. }
  805. else if (n.op == "max")
  806. {
  807. fprintf(pp, "%-16s", "Reduction");
  808. }
  809. else if (n.op == "maximum")
  810. {
  811. fprintf(pp, "%-16s", "BinaryOp");
  812. }
  813. else if (n.op == "mean")
  814. {
  815. fprintf(pp, "%-16s", "Reduction");
  816. }
  817. else if (n.op == "min")
  818. {
  819. fprintf(pp, "%-16s", "Reduction");
  820. }
  821. else if (n.op == "minimum")
  822. {
  823. fprintf(pp, "%-16s", "BinaryOp");
  824. }
  825. else if (n.op == "negative")
  826. {
  827. fprintf(pp, "%-16s", "UnaryOp");
  828. }
  829. else if (n.op == "Pooling")
  830. {
  831. fprintf(pp, "%-16s", "Pooling");
  832. }
  833. else if (n.op == "prod")
  834. {
  835. fprintf(pp, "%-16s", "Reduction");
  836. }
  837. else if (n.op == "reciprocal")
  838. {
  839. fprintf(pp, "%-16s", "UnaryOp");
  840. }
  841. else if (n.op == "relu")
  842. {
  843. fprintf(pp, "%-16s", "ReLU");
  844. }
  845. else if (n.op == "Reshape")
  846. {
  847. fprintf(pp, "%-16s", "Reshape");
  848. }
  849. else if (n.op == "sigmoid")
  850. {
  851. fprintf(pp, "%-16s", "Sigmoid");
  852. }
  853. else if (n.op == "sin")
  854. {
  855. fprintf(pp, "%-16s", "UnaryOp");
  856. }
  857. else if (n.op == "SliceChannel")
  858. {
  859. fprintf(pp, "%-16s", "Slice");
  860. output_size = n.attr("num_outputs");
  861. }
  862. else if (n.op == "SoftmaxOutput")
  863. {
  864. fprintf(pp, "%-16s", "Softmax");
  865. }
  866. else if (n.op == "SoftmaxActivation")
  867. {
  868. fprintf(pp, "%-16s", "Softmax");
  869. }
  870. else if (n.op == "sqrt")
  871. {
  872. fprintf(pp, "%-16s", "UnaryOp");
  873. }
  874. else if (n.op == "square")
  875. {
  876. fprintf(pp, "%-16s", "UnaryOp");
  877. }
  878. else if (n.op == "sum")
  879. {
  880. fprintf(pp, "%-16s", "Reduction");
  881. }
  882. else if (n.op == "tan")
  883. {
  884. fprintf(pp, "%-16s", "UnaryOp");
  885. }
  886. else if (n.op == "tanh")
  887. {
  888. fprintf(pp, "%-16s", "TanH");
  889. }
  890. else if (n.op == "Transpose")
  891. {
  892. fprintf(pp, "%-16s", "Permute");
  893. }
  894. else
  895. {
  896. fprintf(stderr, "%s not supported yet!\n", n.op.c_str());
  897. fprintf(pp, "%-16s", n.op.c_str());
  898. }
  899. int input_size = n.inputs.size();
  900. for (int j=0; j<(int)n.inputs.size(); j++)
  901. {
  902. int input_index = n.inputs[j];
  903. if (nodes[input_index].is_weight())
  904. {
  905. input_size--;
  906. }
  907. }
  908. if (n.op == "SoftmaxOutput" || n.op == "LogisticRegressionOutput")
  909. {
  910. // drop label
  911. input_size--;
  912. }
  913. fprintf(pp, " %-32s %d %d", n.name.c_str(), input_size, output_size);
  914. for (int j=0; j<(int)n.inputs.size(); j++)
  915. {
  916. int input_index = n.inputs[j];
  917. int subinput_index = n.subinputs[j];
  918. if (nodes[input_index].is_weight())
  919. {
  920. continue;
  921. }
  922. if (n.op == "SoftmaxOutput" || n.op == "LogisticRegressionOutput")
  923. {
  924. // drop label
  925. if (j == 1)
  926. continue;
  927. }
  928. std::string input_name = nodes[input_index].name;
  929. if (subinput_index != 0)
  930. {
  931. char subinputsuffix[256];
  932. sprintf(subinputsuffix, "_subncnn_%d", subinput_index);
  933. input_name = input_name + subinputsuffix;
  934. }
  935. int input_uid = input_index | (subinput_index << 16);
  936. if (node_reference.find(input_uid) != node_reference.end())
  937. {
  938. int refidx = node_reference[input_uid] - 1;
  939. node_reference[input_uid] = refidx;
  940. char splitsuffix[256];
  941. sprintf(splitsuffix, "_splitncnn_%d", refidx);
  942. input_name = input_name + splitsuffix;
  943. }
  944. fprintf(pp, " %s", input_name.c_str());
  945. }
  946. fprintf(pp, " %s", n.name.c_str());
  947. for (int j=1; j<output_size; j++)
  948. {
  949. fprintf(pp, " %s_subncnn_%d", n.name.c_str(), j);
  950. }
  951. if (n.op == "null")
  952. {
  953. // dummy input shape
  954. // fprintf(pp, " 0 0 0");
  955. }
  956. else if (n.op == "_div_scalar")
  957. {
  958. int op_type = 3;
  959. int with_scalar = 1;
  960. float scalar = n.attr("scalar");
  961. fprintf(pp, " 0=%d", op_type);
  962. fprintf(pp, " 1=%d", with_scalar);
  963. fprintf(pp, " 2=%f", scalar);
  964. }
  965. else if (n.op == "_maximum_scalar")
  966. {
  967. int op_type = 4;
  968. int with_scalar = 1;
  969. float scalar = n.attr("scalar");
  970. fprintf(pp, " 0=%d", op_type);
  971. fprintf(pp, " 1=%d", with_scalar);
  972. fprintf(pp, " 2=%f", scalar);
  973. }
  974. else if (n.op == "_minimum_scalar")
  975. {
  976. int op_type = 5;
  977. int with_scalar = 1;
  978. float scalar = n.attr("scalar");
  979. fprintf(pp, " 0=%d", op_type);
  980. fprintf(pp, " 1=%d", with_scalar);
  981. fprintf(pp, " 2=%f", scalar);
  982. }
  983. else if (n.op == "_minus_scalar")
  984. {
  985. int op_type = 1;
  986. int with_scalar = 1;
  987. float scalar = n.attr("scalar");
  988. fprintf(pp, " 0=%d", op_type);
  989. fprintf(pp, " 1=%d", with_scalar);
  990. fprintf(pp, " 2=%f", scalar);
  991. }
  992. else if (n.op == "_mul_scalar")
  993. {
  994. int op_type = 2;
  995. int with_scalar = 1;
  996. float scalar = n.attr("scalar");
  997. fprintf(pp, " 0=%d", op_type);
  998. fprintf(pp, " 1=%d", with_scalar);
  999. fprintf(pp, " 2=%f", scalar);
  1000. }
  1001. else if (n.op == "_plus_scalar")
  1002. {
  1003. int op_type = 0;
  1004. int with_scalar = 1;
  1005. float scalar = n.attr("scalar");
  1006. fprintf(pp, " 0=%d", op_type);
  1007. fprintf(pp, " 1=%d", with_scalar);
  1008. fprintf(pp, " 2=%f", scalar);
  1009. }
  1010. else if (n.op == "_power_scalar")
  1011. {
  1012. int op_type = 6;
  1013. int with_scalar = 1;
  1014. float scalar = n.attr("scalar");
  1015. fprintf(pp, " 0=%d", op_type);
  1016. fprintf(pp, " 1=%d", with_scalar);
  1017. fprintf(pp, " 2=%f", scalar);
  1018. }
  1019. else if (n.op == "_rdiv_scalar")
  1020. {
  1021. int op_type = 8;
  1022. int with_scalar = 1;
  1023. float scalar = n.attr("scalar");
  1024. fprintf(pp, " 0=%d", op_type);
  1025. fprintf(pp, " 1=%d", with_scalar);
  1026. fprintf(pp, " 2=%f", scalar);
  1027. }
  1028. else if (n.op == "_rminus_scalar")
  1029. {
  1030. int op_type = 7;
  1031. int with_scalar = 1;
  1032. float scalar = n.attr("scalar");
  1033. fprintf(pp, " 0=%d", op_type);
  1034. fprintf(pp, " 1=%d", with_scalar);
  1035. fprintf(pp, " 2=%f", scalar);
  1036. }
  1037. else if (n.op == "abs")
  1038. {
  1039. int op_type = 0;
  1040. fprintf(pp, " 0=%d", op_type);
  1041. }
  1042. else if (n.op == "Activation")
  1043. {
  1044. std::string type = n.attr("act_type");
  1045. if (type == "relu")
  1046. {
  1047. // fprintf(pp, " 0=%f", 0.f);
  1048. }
  1049. }
  1050. else if (n.op == "arccos")
  1051. {
  1052. int op_type = 13;
  1053. fprintf(pp, " 0=%d", op_type);
  1054. }
  1055. else if (n.op == "arcsin")
  1056. {
  1057. int op_type = 12;
  1058. fprintf(pp, " 0=%d", op_type);
  1059. }
  1060. else if (n.op == "arctan")
  1061. {
  1062. int op_type = 14;
  1063. fprintf(pp, " 0=%d", op_type);
  1064. }
  1065. else if (n.op == "BatchNorm")
  1066. {
  1067. float eps = 1e-3;
  1068. if (n.has_attr("eps")) {
  1069. eps = n.attr("eps");
  1070. }
  1071. std::vector<float> slope_data = n.weight(0);
  1072. std::vector<float> bias_data = n.weight(1);
  1073. int channels = slope_data.size();
  1074. std::vector<float> mean_data = n.weight(2, channels);
  1075. std::vector<float> var_data = n.weight(3, channels);
  1076. for (int j=0; j<(int)var_data.size(); j++)
  1077. {
  1078. var_data[j] += eps;
  1079. }
  1080. fprintf(pp, " 0=%d", channels);
  1081. fwrite(slope_data.data(), sizeof(float), slope_data.size(), bp);
  1082. fwrite(mean_data.data(), sizeof(float), mean_data.size(), bp);
  1083. fwrite(var_data.data(), sizeof(float), var_data.size(), bp);
  1084. fwrite(bias_data.data(), sizeof(float), bias_data.size(), bp);
  1085. }
  1086. else if (n.op == "broadcast_add")
  1087. {
  1088. int op_type = 0;
  1089. fprintf(pp, " 0=%d", op_type);
  1090. }
  1091. else if (n.op == "broadcast_div")
  1092. {
  1093. int op_type = 3;
  1094. fprintf(pp, " 0=%d", op_type);
  1095. }
  1096. else if (n.op == "broadcast_mul")
  1097. {
  1098. int op_type = 2;
  1099. fprintf(pp, " 0=%d", op_type);
  1100. }
  1101. else if (n.op == "broadcast_sub")
  1102. {
  1103. int op_type = 1;
  1104. fprintf(pp, " 0=%d", op_type);
  1105. }
  1106. else if (n.op == "ceil")
  1107. {
  1108. int op_type = 3;
  1109. fprintf(pp, " 0=%d", op_type);
  1110. }
  1111. else if (n.op == "clip")
  1112. {
  1113. float min = n.attr("a_min");
  1114. float max = n.attr("a_max");
  1115. fprintf(pp, " 0=%f", min);
  1116. fprintf(pp, " 1=%f", max);
  1117. }
  1118. else if (n.op == "Concat")
  1119. {
  1120. int dim = n.has_attr("dim") ? n.attr("dim") : 1;
  1121. fprintf(pp, " 0=%d", dim-1);
  1122. }
  1123. else if (n.op == "Convolution")
  1124. {
  1125. int num_filter = n.attr("num_filter");
  1126. std::vector<int> kernel = n.attr("kernel");
  1127. std::vector<int> dilate = n.attr("dilate");
  1128. std::vector<int> stride = n.attr("stride");
  1129. std::vector<int> pad = n.attr("pad");
  1130. int no_bias = n.attr("no_bias");
  1131. int num_group = n.attr("num_group");
  1132. std::vector<float> weight_data = n.weight(0);
  1133. std::vector<float> bias_data = n.weight(1);
  1134. fprintf(pp, " 0=%d", num_filter);
  1135. if (kernel.size() == 1) {
  1136. fprintf(pp, " 1=%d", kernel[0]);
  1137. } else if (kernel.size() == 2) {
  1138. fprintf(pp, " 1=%d", kernel[1]);
  1139. fprintf(pp, " 11=%d", kernel[0]);
  1140. }
  1141. if (dilate.size() == 1) {
  1142. fprintf(pp, " 2=%d", dilate[0]);
  1143. } else if (dilate.size() == 2) {
  1144. fprintf(pp, " 2=%d", dilate[1]);
  1145. fprintf(pp, " 12=%d", dilate[0]);
  1146. }
  1147. if (stride.size() == 1) {
  1148. fprintf(pp, " 3=%d", stride[0]);
  1149. } else if (stride.size() == 2) {
  1150. fprintf(pp, " 3=%d", stride[1]);
  1151. fprintf(pp, " 13=%d", stride[0]);
  1152. }
  1153. if (pad.size() == 1) {
  1154. fprintf(pp, " 4=%d", pad[0]);
  1155. } else if (pad.size() == 2) {
  1156. fprintf(pp, " 4=%d", pad[1]);
  1157. fprintf(pp, " 14=%d", pad[0]);
  1158. }
  1159. fprintf(pp, " 5=%d", no_bias == 1 ? 0 : 1);
  1160. fprintf(pp, " 6=%d", (int)weight_data.size());
  1161. if (num_group > 1) {
  1162. fprintf(pp, " 7=%d", num_group);
  1163. }
  1164. int quantize_tag = 0;
  1165. fwrite(&quantize_tag, sizeof(int), 1, bp);
  1166. fwrite(weight_data.data(), sizeof(float), weight_data.size(), bp);
  1167. fwrite(bias_data.data(), sizeof(float), bias_data.size(), bp);
  1168. }
  1169. else if (n.op == "Deconvolution")
  1170. {
  1171. int num_filter = n.attr("num_filter");
  1172. std::vector<int> kernel = n.attr("kernel");
  1173. std::vector<int> dilate = n.attr("dilate");
  1174. std::vector<int> stride = n.attr("stride");
  1175. std::vector<int> pad = n.attr("pad");
  1176. int no_bias = n.attr("no_bias");
  1177. int num_group = n.attr("num_group");
  1178. std::vector<float> weight_data = n.weight(0);
  1179. std::vector<float> bias_data = n.weight(1);
  1180. fprintf(pp, " 0=%d", num_filter);
  1181. if (kernel.size() == 1) {
  1182. fprintf(pp, " 1=%d", kernel[0]);
  1183. } else if (kernel.size() == 2) {
  1184. fprintf(pp, " 1=%d", kernel[1]);
  1185. fprintf(pp, " 11=%d", kernel[0]);
  1186. }
  1187. if (dilate.size() == 1) {
  1188. fprintf(pp, " 2=%d", dilate[0]);
  1189. } else if (dilate.size() == 2) {
  1190. fprintf(pp, " 2=%d", dilate[1]);
  1191. fprintf(pp, " 12=%d", dilate[0]);
  1192. }
  1193. if (stride.size() == 1) {
  1194. fprintf(pp, " 3=%d", stride[0]);
  1195. } else if (stride.size() == 2) {
  1196. fprintf(pp, " 3=%d", stride[1]);
  1197. fprintf(pp, " 13=%d", stride[0]);
  1198. }
  1199. if (pad.size() == 1) {
  1200. fprintf(pp, " 4=%d", pad[0]);
  1201. } else if (pad.size() == 2) {
  1202. fprintf(pp, " 4=%d", pad[1]);
  1203. fprintf(pp, " 14=%d", pad[0]);
  1204. }
  1205. fprintf(pp, " 5=%d", no_bias == 1 ? 0 : 1);
  1206. fprintf(pp, " 6=%d", (int)weight_data.size());
  1207. if (num_group > 1) {
  1208. fprintf(pp, " 7=%d", num_group);
  1209. }
  1210. int quantize_tag = 0;
  1211. fwrite(&quantize_tag, sizeof(int), 1, bp);
  1212. int maxk = 0;
  1213. if (kernel.size() == 2)
  1214. {
  1215. maxk = kernel[1] * kernel[0];
  1216. }
  1217. else
  1218. {
  1219. maxk = kernel[0] * kernel[0];
  1220. }
  1221. for (int g=0; g<num_group; g++)
  1222. {
  1223. // reorder weight from inch-outch to outch-inch
  1224. int num_filter_g = num_filter / num_group;
  1225. int num_input = weight_data.size() / maxk / num_filter_g / num_group;
  1226. const float* weight_data_ptr = weight_data.data() + g * maxk * num_filter_g * num_input;
  1227. for (int k=0; k<num_filter_g; k++)
  1228. {
  1229. for (int j=0; j<num_input; j++)
  1230. {
  1231. fwrite(weight_data_ptr + (j*num_filter_g + k) * maxk, sizeof(float), maxk, bp);
  1232. }
  1233. }
  1234. }
  1235. fwrite(bias_data.data(), sizeof(float), bias_data.size(), bp);
  1236. }
  1237. else if (n.op == "cos")
  1238. {
  1239. int op_type = 10;
  1240. fprintf(pp, " 0=%d", op_type);
  1241. }
  1242. else if (n.op == "Dropout")
  1243. {
  1244. // float p = n.attr("p");
  1245. // fprintf(pp, " 0=%d", p);
  1246. }
  1247. else if (n.op == "elemwise_add")
  1248. {
  1249. int op_type = 0;
  1250. fprintf(pp, " 0=%d", op_type);
  1251. }
  1252. else if (n.op == "elemwise_div")
  1253. {
  1254. int op_type = 3;
  1255. fprintf(pp, " 0=%d", op_type);
  1256. }
  1257. else if (n.op == "elemwise_mul")
  1258. {
  1259. int op_type = 2;
  1260. fprintf(pp, " 0=%d", op_type);
  1261. }
  1262. else if (n.op == "elemwise_sub")
  1263. {
  1264. int op_type = 1;
  1265. fprintf(pp, " 0=%d", op_type);
  1266. }
  1267. else if (n.op == "Embedding")
  1268. {
  1269. int input_dim = n.attr("input_dim");
  1270. int output_dim = n.attr("output_dim");
  1271. std::vector<float> weight_data = n.weight(0);
  1272. fprintf(pp, " 0=%d", output_dim);
  1273. fprintf(pp, " 1=%d", input_dim);
  1274. fprintf(pp, " 3=%d", (int)weight_data.size());
  1275. int quantize_tag = 0;
  1276. fwrite(&quantize_tag, sizeof(int), 1, bp);
  1277. fwrite(weight_data.data(), sizeof(float), weight_data.size(), bp);
  1278. }
  1279. else if (n.op == "exp")
  1280. {
  1281. int op_type = 7;
  1282. fprintf(pp, " 0=%d", op_type);
  1283. }
  1284. else if (n.op == "expand_dims")
  1285. {
  1286. int axis = n.attr("axis");
  1287. int expand_w = 0;
  1288. int expand_h = 0;
  1289. int expand_c = 0;
  1290. if (axis == 0)
  1291. expand_c = 1;
  1292. if (axis == 1)
  1293. expand_h = 1;
  1294. if (axis == 2)
  1295. expand_w = 1;
  1296. fprintf(pp, " 0=%d", expand_w);
  1297. fprintf(pp, " 1=%d", expand_h);
  1298. fprintf(pp, " 2=%d", expand_c);
  1299. }
  1300. else if (n.op == "Flatten")
  1301. {
  1302. }
  1303. else if (n.op == "floor")
  1304. {
  1305. int op_type = 2;
  1306. fprintf(pp, " 0=%d", op_type);
  1307. }
  1308. else if (n.op == "FullyConnected")
  1309. {
  1310. int num_hidden = n.attr("num_hidden");
  1311. int no_bias = n.attr("no_bias");
  1312. // int flatten = n.attr("flatten");
  1313. // TODO flatten
  1314. std::vector<float> weight_data = n.weight(0);
  1315. std::vector<float> bias_data = n.weight(1);
  1316. fprintf(pp, " 0=%d", num_hidden);
  1317. fprintf(pp, " 1=%d", no_bias == 1 ? 0 : 1);
  1318. fprintf(pp, " 2=%d", (int)weight_data.size());
  1319. int quantize_tag = 0;
  1320. fwrite(&quantize_tag, sizeof(int), 1, bp);
  1321. fwrite(weight_data.data(), sizeof(float), weight_data.size(), bp);
  1322. fwrite(bias_data.data(), sizeof(float), bias_data.size(), bp);
  1323. }
  1324. else if (n.op == "InstanceNorm")
  1325. {
  1326. float eps = n.has_attr("eps") ? n.attr("eps") : 0.001f;
  1327. std::vector<float> gamma_data = n.weight(0);
  1328. std::vector<float> beta_data = n.weight(1);
  1329. fprintf(pp, " 0=%d", (int)gamma_data.size());
  1330. fprintf(pp, " 1=%f", eps);
  1331. fwrite(gamma_data.data(), sizeof(float), gamma_data.size(), bp);
  1332. fwrite(beta_data.data(), sizeof(float), beta_data.size(), bp);
  1333. }
  1334. else if (n.op == "L2Normalization")
  1335. {
  1336. std::string mode = n.attr("mode");
  1337. float eps = n.has_attr("eps") ? n.attr("eps") : 1e-10;
  1338. int across_spatial = 0;
  1339. int across_channel = 1;
  1340. int channel_shared = 1;
  1341. int scale_data_size = 1;
  1342. if (mode == "instance")
  1343. {
  1344. across_spatial = 1;
  1345. across_channel = 1;
  1346. }
  1347. else if (mode == "channel")
  1348. {
  1349. across_spatial = 0;
  1350. across_channel = 1;
  1351. }
  1352. else if (mode == "spatial")
  1353. {
  1354. across_spatial = 1;
  1355. across_channel = 0;
  1356. }
  1357. fprintf(pp, " 0=%d", across_spatial);
  1358. fprintf(pp, " 4=%d", across_channel);
  1359. fprintf(pp, " 1=%d", channel_shared);
  1360. fprintf(pp, " 2=%f", eps);
  1361. fprintf(pp, " 3=%d", scale_data_size);
  1362. const float scale_data[1] = { 1.f };
  1363. fwrite(scale_data, sizeof(float), 1, bp);
  1364. }
  1365. else if (n.op == "LeakyReLU")
  1366. {
  1367. std::string type = n.attr("act_type");
  1368. if (type == "elu")
  1369. {
  1370. float slope = n.has_attr("slope") ? n.attr("slope") : 0.25f;
  1371. fprintf(pp, " 0=%f", slope);
  1372. }
  1373. else if (type == "leaky")
  1374. {
  1375. float slope = n.has_attr("slope") ? n.attr("slope") : 0.25f;
  1376. fprintf(pp, " 0=%f", slope);
  1377. }
  1378. else if (type == "prelu")
  1379. {
  1380. std::vector<float> weight_data = n.weight(0);
  1381. fprintf(pp, " 0=%d", (int)weight_data.size());
  1382. fwrite(weight_data.data(), sizeof(float), weight_data.size(), bp);
  1383. }
  1384. }
  1385. else if (n.op == "log")
  1386. {
  1387. int op_type = 8;
  1388. fprintf(pp, " 0=%d", op_type);
  1389. }
  1390. else if (n.op == "LogisticRegressionOutput")
  1391. {
  1392. }
  1393. else if (n.op == "max")
  1394. {
  1395. int operation = 4;
  1396. fprintf(pp, " 0=%d", operation);
  1397. }
  1398. else if (n.op == "maximum")
  1399. {
  1400. int op_type = 4;
  1401. fprintf(pp, " 0=%d", op_type);
  1402. }
  1403. else if (n.op == "mean")
  1404. {
  1405. int operation = 3;
  1406. fprintf(pp, " 0=%d", operation);
  1407. }
  1408. else if (n.op == "min")
  1409. {
  1410. int operation = 5;
  1411. fprintf(pp, " 0=%d", operation);
  1412. }
  1413. else if (n.op == "minimum")
  1414. {
  1415. int op_type = 5;
  1416. fprintf(pp, " 0=%d", op_type);
  1417. }
  1418. else if (n.op == "negative")
  1419. {
  1420. int op_type = 1;
  1421. fprintf(pp, " 0=%d", op_type);
  1422. }
  1423. else if (n.op == "Pooling")
  1424. {
  1425. std::string pool_type = n.attr("pool_type");
  1426. std::vector<int> kernel = n.attr("kernel");
  1427. std::vector<int> stride = n.attr("stride");
  1428. std::vector<int> pad = n.attr("pad");
  1429. std::string pooling_convention = n.attr("pooling_convention");
  1430. int global_pool = n.attr("global_pool");
  1431. int pool = 0;
  1432. if (pool_type == "max")
  1433. {
  1434. pool = 0;
  1435. }
  1436. else if (pool_type == "avg")
  1437. {
  1438. pool = 1;
  1439. }
  1440. int pad_mode = 1;
  1441. if (pooling_convention == "valid")
  1442. {
  1443. pad_mode = 1;
  1444. }
  1445. else if (pooling_convention == "full")
  1446. {
  1447. pad_mode = 0;
  1448. }
  1449. fprintf(pp, " 0=%d", pool);
  1450. if (!kernel.empty())
  1451. fprintf(pp, " 1=%d", kernel[0]);
  1452. if (!stride.empty())
  1453. fprintf(pp, " 2=%d", stride[0]);
  1454. if (!pad.empty())
  1455. fprintf(pp, " 3=%d", pad[0]);
  1456. fprintf(pp, " 4=%d", global_pool);
  1457. fprintf(pp, " 5=%d", pad_mode);
  1458. }
  1459. else if (n.op == "prod")
  1460. {
  1461. int operation = 6;
  1462. fprintf(pp, " 0=%d", operation);
  1463. }
  1464. else if (n.op == "reciprocal")
  1465. {
  1466. int op_type = 15;
  1467. fprintf(pp, " 0=%d", op_type);
  1468. }
  1469. else if (n.op == "relu")
  1470. {
  1471. }
  1472. else if (n.op == "Reshape")
  1473. {
  1474. std::vector<int> shape = n.attr("shape");
  1475. if (shape.size() == 1) {
  1476. fprintf(pp, " 0=%d", shape[0]);// should never reach here
  1477. } else if (shape.size() == 2) {
  1478. fprintf(pp, " 0=%d", shape[1]);
  1479. } else if (shape.size() == 3) {
  1480. fprintf(pp, " 0=%d", shape[2]);
  1481. fprintf(pp, " 1=%d", shape[1]);
  1482. } else if (shape.size() == 4) {
  1483. fprintf(pp, " 0=%d", shape[3]);
  1484. fprintf(pp, " 1=%d", shape[2]);
  1485. fprintf(pp, " 2=%d", shape[1]);
  1486. } else if (shape.size() == 5) {
  1487. fprintf(pp, " 0=%d", shape[4] * shape[3]);
  1488. fprintf(pp, " 1=%d", shape[2]);
  1489. fprintf(pp, " 2=%d", shape[1]);
  1490. }
  1491. }
  1492. else if (n.op == "sigmoid")
  1493. {
  1494. }
  1495. else if (n.op == "sin")
  1496. {
  1497. int op_type = 9;
  1498. fprintf(pp, " 0=%d", op_type);
  1499. }
  1500. else if (n.op == "SliceChannel")
  1501. {
  1502. int num_outputs = n.attr("num_outputs");
  1503. int squeeze_axis = n.attr("squeeze_axis");// TODO
  1504. fprintf(pp, " -23300=%d", num_outputs);
  1505. for (int j=0; j<num_outputs; j++)
  1506. {
  1507. fprintf(pp, ",-233");
  1508. }
  1509. }
  1510. else if (n.op == "SoftmaxOutput")
  1511. {
  1512. }
  1513. else if (n.op == "sqrt")
  1514. {
  1515. int op_type = 5;
  1516. fprintf(pp, " 0=%d", op_type);
  1517. }
  1518. else if (n.op == "square")
  1519. {
  1520. int op_type = 4;
  1521. fprintf(pp, " 0=%d", op_type);
  1522. }
  1523. else if (n.op == "sum")
  1524. {
  1525. int operation = 0;
  1526. fprintf(pp, " 0=%d", operation);
  1527. }
  1528. else if (n.op == "tan")
  1529. {
  1530. int op_type = 11;
  1531. fprintf(pp, " 0=%d", op_type);
  1532. }
  1533. else if (n.op == "tanh")
  1534. {
  1535. }
  1536. else if (n.op == "Transpose")
  1537. {
  1538. std::vector<int> axes = n.attr("axes");
  1539. if (axes.size() == 4) {
  1540. if (axes[1] == 1 && axes[2] == 2 && axes[3] == 3)
  1541. fprintf(pp, " 0=0");// w h c
  1542. else if (axes[1] == 1 && axes[2] == 3 && axes[3] == 2)
  1543. fprintf(pp, " 0=1");// h w c
  1544. else if (axes[1] == 2 && axes[2] == 1 && axes[3] == 3)
  1545. fprintf(pp, " 0=2");// w c h
  1546. else if (axes[1] == 2 && axes[2] == 3 && axes[3] == 1)
  1547. fprintf(pp, " 0=3");// c w h
  1548. else if (axes[1] == 3 && axes[2] == 1 && axes[3] == 2)
  1549. fprintf(pp, " 0=4");// h c w
  1550. else if (axes[1] == 3 && axes[2] == 2 && axes[3] == 1)
  1551. fprintf(pp, " 0=5");// c h w
  1552. } else if (axes.size() == 5) {
  1553. if (axes[1] == 1 && axes[2] == 2 && axes[3] == 3 && axes[4] == 4)
  1554. fprintf(pp, " 0=0");// wx h c
  1555. else if (axes[1] == 1 && axes[2] == 3 && axes[3] == 4 && axes[4] == 2)
  1556. fprintf(pp, " 0=1");// h wx c
  1557. else if (axes[1] == 2 && axes[2] == 1 && axes[3] == 3 && axes[4] == 4)
  1558. fprintf(pp, " 0=2");// wx c h
  1559. else if (axes[1] == 2 && axes[2] == 3 && axes[3] == 4 && axes[4] == 1)
  1560. fprintf(pp, " 0=3");// c wx h
  1561. else if (axes[1] == 3 && axes[2] == 4 && axes[3] == 1 && axes[4] == 2)
  1562. fprintf(pp, " 0=4");// h c wx
  1563. else if (axes[1] == 3 && axes[2] == 4 && axes[3] == 2 && axes[4] == 1)
  1564. fprintf(pp, " 0=5");// c h wx
  1565. else
  1566. fprintf(stderr, "Unsupported transpose type !\n");
  1567. }
  1568. }
  1569. else
  1570. {
  1571. // TODO op specific params
  1572. std::map<std::string, std::string>::const_iterator it = n.attrs.begin();
  1573. for (; it != n.attrs.end(); it++)
  1574. {
  1575. fprintf(stderr, "# %s=%s\n", it->first.c_str(), it->second.c_str());
  1576. // fprintf(pp, " %s=%s", it->first.c_str(), it->second.c_str());
  1577. }
  1578. }
  1579. fprintf(pp, "\n");
  1580. for (int j=0; j<output_size; j++)
  1581. {
  1582. int input_uid = i | (j << 16);
  1583. if (node_reference.find(input_uid) != node_reference.end())
  1584. {
  1585. int refcount = node_reference[input_uid];
  1586. if (refcount > 1)
  1587. {
  1588. std::string output_name = n.name;
  1589. char splitname[256];
  1590. sprintf(splitname, "splitncnn_%d", internal_split);
  1591. fprintf(pp, "%-16s %-32s %d %d", "Split", splitname, 1, refcount);
  1592. if (j == 0)
  1593. {
  1594. fprintf(pp, " %s", output_name.c_str());
  1595. }
  1596. else
  1597. {
  1598. fprintf(pp, " %s_subncnn_%d", output_name.c_str(), j);
  1599. }
  1600. for (int k=0; k<refcount; k++)
  1601. {
  1602. if (j == 0)
  1603. {
  1604. fprintf(pp, " %s_splitncnn_%d", output_name.c_str(), k);
  1605. }
  1606. else
  1607. {
  1608. fprintf(pp, " %s_subncnn_%d_splitncnn_%d", output_name.c_str(), j, k);
  1609. }
  1610. }
  1611. fprintf(pp, "\n");
  1612. internal_split++;
  1613. }
  1614. }
  1615. }
  1616. }
  1617. fclose(pp);
  1618. fclose(bp);
  1619. return 0;
  1620. }