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
12345678910111213141516171819202122232425262728293031323334353637383940414243444546474849505152535455565758596061626364656667686970717273747576777879808182838485868788899091929394959697989910010110210310410510610710810911011111211311411511611711811912012112212312412512612712812913013113213313413513613713813914014114214314414514614714814915015115215315415515615715815916016116216316416516616716816917017117217317417517617717817918018118218318418518618718818919019119219319419519619719819920020120220320420520620720820921021121221321421521621721821922022122222322422522622722822923023123223323423523623723823924024124224324424524624724824925025125225325425525625725825926026126226326426526626726826927027127227327427527627727827928028128228328428528628728828929029129229329429529629729829930030130230330430530630730830931031131231331431531631731831932032132232332432532632732832933033133233333433533633733833934034134234334434534634734834935035135235335435535635735835936036136236336436536636736836937037137237337437537637737837938038138238338438538638738838939039139239339439539639739839940040140240340440540640740840941041141241341441541641741841942042142242342442542642742842943043143243343443543643743843944044144244344444544644744844945045145245345445545645745845946046146246346446546646746846947047147247347447547647747847948048148248348448548648748848949049149249349449549649749849950050150250350450550650750850951051151251351451551651751851952052152252352452552652752852953053153253353453553653753853954054154254354454554654754854955055155255355455555655755855956056156256356456556656756856957057157257357457557657757857958058158258358458558658758858959059159259359459559659759859960060160260360460560660760860961061161261361461561661761861962062162262362462562662762862963063163263363463563663763863964064164264364464564664764864965065165265365465565665765865966066166266366466566666766866967067167267367467567667767867968068168268368468568668768868969069169269369469569669769869970070170270370470570670770870971071171271371471571671771871972072172272372472572672772872973073173273373473573673773873974074174274374474574674774874975075175275375475575675775875976076176276376476576676776876977077177277377477577677777877978078178278378478578678778878979079179279379479579679779879980080180280380480580680780880981081181281381481581681781881982082182282382482582682782882983083183283383483583683783883984084184284384484584684784884985085185285385485585685785885986086186286386486586686786886987087187287387487587687787887988088188288388488588688788888989089189289389489589689789889990090190290390490590690790890991091191291391491591691791891992092192292392492592692792892993093193293393493593693793893994094194294394494594694794894995095195295395495595695795895996096196296396496596696796896997097197297397497597697797897998098198298398498598698798898999099199299399499599699799899910001001100210031004100510061007100810091010101110121013101410151016101710181019102010211022102310241025102610271028102910301031103210331034103510361037103810391040104110421043104410451046104710481049105010511052105310541055105610571058105910601061106210631064106510661067106810691070107110721073107410751076107710781079108010811082108310841085108610871088108910901091109210931094109510961097109810991100110111021103110411051106110711081109111011111112111311141115111611171118111911201121112211231124112511261127112811291130113111321133113411351136113711381139114011411142114311441145114611471148114911501151115211531154115511561157115811591160116111621163116411651166116711681169117011711172117311741175117611771178117911801181118211831184118511861187118811891190119111921193119411951196119711981199120012011202120312041205120612071208120912101211121212131214121512161217121812191220122112221223122412251226122712281229123012311232123312341235123612371238123912401241124212431244124512461247124812491250125112521253125412551256125712581259126012611262126312641265126612671268126912701271127212731274127512761277127812791280128112821283128412851286128712881289129012911292129312941295129612971298129913001301130213031304130513061307130813091310131113121313131413151316131713181319132013211322132313241325132613271328132913301331133213331334133513361337133813391340134113421343134413451346134713481349135013511352135313541355135613571358135913601361136213631364136513661367136813691370137113721373137413751376137713781379138013811382138313841385138613871388138913901391139213931394139513961397139813991400140114021403140414051406140714081409141014111412141314141415141614171418141914201421142214231424142514261427142814291430143114321433143414351436143714381439144014411442144314441445144614471448144914501451145214531454145514561457145814591460146114621463146414651466146714681469147014711472147314741475147614771478147914801481148214831484148514861487148814891490149114921493149414951496149714981499150015011502150315041505150615071508150915101511151215131514151515161517151815191520152115221523152415251526152715281529153015311532153315341535153615371538153915401541154215431544154515461547154815491550155115521553155415551556155715581559156015611562156315641565156615671568156915701571157215731574157515761577157815791580158115821583158415851586158715881589159015911592159315941595159615971598159916001601160216031604160516061607160816091610161116121613161416151616161716181619162016211622162316241625162616271628162916301631163216331634163516361637163816391640164116421643164416451646164716481649165016511652165316541655165616571658165916601661166216631664166516661667166816691670167116721673167416751676167716781679168016811682168316841685168616871688168916901691169216931694169516961697169816991700170117021703170417051706170717081709171017111712171317141715171617171718171917201721172217231724172517261727172817291730173117321733173417351736173717381739174017411742174317441745174617471748174917501751175217531754175517561757175817591760176117621763176417651766176717681769177017711772177317741775177617771778177917801781178217831784178517861787178817891790179117921793179417951796
  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 == "sin")
  850. {
  851. fprintf(pp, "%-16s", "UnaryOp");
  852. }
  853. else if (n.op == "SliceChannel")
  854. {
  855. fprintf(pp, "%-16s", "Slice");
  856. output_size = n.attr("num_outputs");
  857. }
  858. else if (n.op == "SoftmaxOutput")
  859. {
  860. fprintf(pp, "%-16s", "Softmax");
  861. }
  862. else if (n.op == "SoftmaxActivation")
  863. {
  864. fprintf(pp, "%-16s", "Softmax");
  865. }
  866. else if (n.op == "sqrt")
  867. {
  868. fprintf(pp, "%-16s", "UnaryOp");
  869. }
  870. else if (n.op == "square")
  871. {
  872. fprintf(pp, "%-16s", "UnaryOp");
  873. }
  874. else if (n.op == "sum")
  875. {
  876. fprintf(pp, "%-16s", "Reduction");
  877. }
  878. else if (n.op == "tan")
  879. {
  880. fprintf(pp, "%-16s", "UnaryOp");
  881. }
  882. else if (n.op == "tanh")
  883. {
  884. fprintf(pp, "%-16s", "TanH");
  885. }
  886. else if (n.op == "Transpose")
  887. {
  888. fprintf(pp, "%-16s", "Permute");
  889. }
  890. else
  891. {
  892. fprintf(stderr, "%s not supported yet!\n", n.op.c_str());
  893. fprintf(pp, "%-16s", n.op.c_str());
  894. }
  895. int input_size = n.inputs.size();
  896. for (int j=0; j<(int)n.inputs.size(); j++)
  897. {
  898. int input_index = n.inputs[j];
  899. if (nodes[input_index].is_weight())
  900. {
  901. input_size--;
  902. }
  903. }
  904. if (n.op == "SoftmaxOutput" || n.op == "LogisticRegressionOutput")
  905. {
  906. // drop label
  907. input_size--;
  908. }
  909. fprintf(pp, " %-32s %d %d", n.name.c_str(), input_size, output_size);
  910. for (int j=0; j<(int)n.inputs.size(); j++)
  911. {
  912. int input_index = n.inputs[j];
  913. int subinput_index = n.subinputs[j];
  914. if (nodes[input_index].is_weight())
  915. {
  916. continue;
  917. }
  918. if (n.op == "SoftmaxOutput" || n.op == "LogisticRegressionOutput")
  919. {
  920. // drop label
  921. if (j == 1)
  922. continue;
  923. }
  924. std::string input_name = nodes[input_index].name;
  925. if (subinput_index != 0)
  926. {
  927. char subinputsuffix[256];
  928. sprintf(subinputsuffix, "_subncnn_%d", subinput_index);
  929. input_name = input_name + subinputsuffix;
  930. }
  931. int input_uid = input_index | (subinput_index << 16);
  932. if (node_reference.find(input_uid) != node_reference.end())
  933. {
  934. int refidx = node_reference[input_uid] - 1;
  935. node_reference[input_uid] = refidx;
  936. char splitsuffix[256];
  937. sprintf(splitsuffix, "_splitncnn_%d", refidx);
  938. input_name = input_name + splitsuffix;
  939. }
  940. fprintf(pp, " %s", input_name.c_str());
  941. }
  942. fprintf(pp, " %s", n.name.c_str());
  943. for (int j=1; j<output_size; j++)
  944. {
  945. fprintf(pp, " %s_subncnn_%d", n.name.c_str(), j);
  946. }
  947. if (n.op == "null")
  948. {
  949. // dummy input shape
  950. // fprintf(pp, " 0 0 0");
  951. }
  952. else if (n.op == "_div_scalar")
  953. {
  954. int op_type = 3;
  955. int with_scalar = 1;
  956. float scalar = n.attr("scalar");
  957. fprintf(pp, " 0=%d", op_type);
  958. fprintf(pp, " 1=%d", with_scalar);
  959. fprintf(pp, " 2=%f", scalar);
  960. }
  961. else if (n.op == "_maximum_scalar")
  962. {
  963. int op_type = 4;
  964. int with_scalar = 1;
  965. float scalar = n.attr("scalar");
  966. fprintf(pp, " 0=%d", op_type);
  967. fprintf(pp, " 1=%d", with_scalar);
  968. fprintf(pp, " 2=%f", scalar);
  969. }
  970. else if (n.op == "_minimum_scalar")
  971. {
  972. int op_type = 5;
  973. int with_scalar = 1;
  974. float scalar = n.attr("scalar");
  975. fprintf(pp, " 0=%d", op_type);
  976. fprintf(pp, " 1=%d", with_scalar);
  977. fprintf(pp, " 2=%f", scalar);
  978. }
  979. else if (n.op == "_minus_scalar")
  980. {
  981. int op_type = 1;
  982. int with_scalar = 1;
  983. float scalar = n.attr("scalar");
  984. fprintf(pp, " 0=%d", op_type);
  985. fprintf(pp, " 1=%d", with_scalar);
  986. fprintf(pp, " 2=%f", scalar);
  987. }
  988. else if (n.op == "_mul_scalar")
  989. {
  990. int op_type = 2;
  991. int with_scalar = 1;
  992. float scalar = n.attr("scalar");
  993. fprintf(pp, " 0=%d", op_type);
  994. fprintf(pp, " 1=%d", with_scalar);
  995. fprintf(pp, " 2=%f", scalar);
  996. }
  997. else if (n.op == "_plus_scalar")
  998. {
  999. int op_type = 0;
  1000. int with_scalar = 1;
  1001. float scalar = n.attr("scalar");
  1002. fprintf(pp, " 0=%d", op_type);
  1003. fprintf(pp, " 1=%d", with_scalar);
  1004. fprintf(pp, " 2=%f", scalar);
  1005. }
  1006. else if (n.op == "_power_scalar")
  1007. {
  1008. int op_type = 6;
  1009. int with_scalar = 1;
  1010. float scalar = n.attr("scalar");
  1011. fprintf(pp, " 0=%d", op_type);
  1012. fprintf(pp, " 1=%d", with_scalar);
  1013. fprintf(pp, " 2=%f", scalar);
  1014. }
  1015. else if (n.op == "_rdiv_scalar")
  1016. {
  1017. int op_type = 8;
  1018. int with_scalar = 1;
  1019. float scalar = n.attr("scalar");
  1020. fprintf(pp, " 0=%d", op_type);
  1021. fprintf(pp, " 1=%d", with_scalar);
  1022. fprintf(pp, " 2=%f", scalar);
  1023. }
  1024. else if (n.op == "_rminus_scalar")
  1025. {
  1026. int op_type = 7;
  1027. int with_scalar = 1;
  1028. float scalar = n.attr("scalar");
  1029. fprintf(pp, " 0=%d", op_type);
  1030. fprintf(pp, " 1=%d", with_scalar);
  1031. fprintf(pp, " 2=%f", scalar);
  1032. }
  1033. else if (n.op == "abs")
  1034. {
  1035. int op_type = 0;
  1036. fprintf(pp, " 0=%d", op_type);
  1037. }
  1038. else if (n.op == "Activation")
  1039. {
  1040. std::string type = n.attr("act_type");
  1041. if (type == "relu")
  1042. {
  1043. // fprintf(pp, " 0=%f", 0.f);
  1044. }
  1045. }
  1046. else if (n.op == "arccos")
  1047. {
  1048. int op_type = 13;
  1049. fprintf(pp, " 0=%d", op_type);
  1050. }
  1051. else if (n.op == "arcsin")
  1052. {
  1053. int op_type = 12;
  1054. fprintf(pp, " 0=%d", op_type);
  1055. }
  1056. else if (n.op == "arctan")
  1057. {
  1058. int op_type = 14;
  1059. fprintf(pp, " 0=%d", op_type);
  1060. }
  1061. else if (n.op == "BatchNorm")
  1062. {
  1063. float eps = 1e-3;
  1064. if (n.has_attr("eps")) {
  1065. eps = n.attr("eps");
  1066. }
  1067. std::vector<float> slope_data = n.weight(0);
  1068. std::vector<float> bias_data = n.weight(1);
  1069. int channels = slope_data.size();
  1070. std::vector<float> mean_data = n.weight(2, channels);
  1071. std::vector<float> var_data = n.weight(3, channels);
  1072. for (int j=0; j<(int)var_data.size(); j++)
  1073. {
  1074. var_data[j] += eps;
  1075. }
  1076. fprintf(pp, " 0=%d", channels);
  1077. fwrite(slope_data.data(), sizeof(float), slope_data.size(), bp);
  1078. fwrite(mean_data.data(), sizeof(float), mean_data.size(), bp);
  1079. fwrite(var_data.data(), sizeof(float), var_data.size(), bp);
  1080. fwrite(bias_data.data(), sizeof(float), bias_data.size(), bp);
  1081. }
  1082. else if (n.op == "broadcast_add")
  1083. {
  1084. int op_type = 0;
  1085. fprintf(pp, " 0=%d", op_type);
  1086. }
  1087. else if (n.op == "broadcast_div")
  1088. {
  1089. int op_type = 3;
  1090. fprintf(pp, " 0=%d", op_type);
  1091. }
  1092. else if (n.op == "broadcast_mul")
  1093. {
  1094. int op_type = 2;
  1095. fprintf(pp, " 0=%d", op_type);
  1096. }
  1097. else if (n.op == "broadcast_sub")
  1098. {
  1099. int op_type = 1;
  1100. fprintf(pp, " 0=%d", op_type);
  1101. }
  1102. else if (n.op == "ceil")
  1103. {
  1104. int op_type = 3;
  1105. fprintf(pp, " 0=%d", op_type);
  1106. }
  1107. else if (n.op == "clip")
  1108. {
  1109. float min = n.attr("a_min");
  1110. float max = n.attr("a_max");
  1111. fprintf(pp, " 0=%f", min);
  1112. fprintf(pp, " 1=%f", max);
  1113. }
  1114. else if (n.op == "Concat")
  1115. {
  1116. int dim = n.has_attr("dim") ? n.attr("dim") : 1;
  1117. fprintf(pp, " 0=%d", dim-1);
  1118. }
  1119. else if (n.op == "Convolution")
  1120. {
  1121. int num_filter = n.attr("num_filter");
  1122. std::vector<int> kernel = n.attr("kernel");
  1123. std::vector<int> dilate = n.attr("dilate");
  1124. std::vector<int> stride = n.attr("stride");
  1125. std::vector<int> pad = n.attr("pad");
  1126. int no_bias = n.attr("no_bias");
  1127. int num_group = n.attr("num_group");
  1128. std::vector<float> weight_data = n.weight(0);
  1129. std::vector<float> bias_data = n.weight(1);
  1130. fprintf(pp, " 0=%d", num_filter);
  1131. if (kernel.size() == 1) {
  1132. fprintf(pp, " 1=%d", kernel[0]);
  1133. } else if (kernel.size() == 2) {
  1134. fprintf(pp, " 1=%d", kernel[1]);
  1135. fprintf(pp, " 11=%d", kernel[0]);
  1136. }
  1137. if (dilate.size() == 1) {
  1138. fprintf(pp, " 2=%d", dilate[0]);
  1139. } else if (dilate.size() == 2) {
  1140. fprintf(pp, " 2=%d", dilate[1]);
  1141. fprintf(pp, " 12=%d", dilate[0]);
  1142. }
  1143. if (stride.size() == 1) {
  1144. fprintf(pp, " 3=%d", stride[0]);
  1145. } else if (stride.size() == 2) {
  1146. fprintf(pp, " 3=%d", stride[1]);
  1147. fprintf(pp, " 13=%d", stride[0]);
  1148. }
  1149. if (pad.size() == 1) {
  1150. fprintf(pp, " 4=%d", pad[0]);
  1151. } else if (pad.size() == 2) {
  1152. fprintf(pp, " 4=%d", pad[1]);
  1153. fprintf(pp, " 14=%d", pad[0]);
  1154. }
  1155. fprintf(pp, " 5=%d", no_bias == 1 ? 0 : 1);
  1156. fprintf(pp, " 6=%d", (int)weight_data.size());
  1157. if (num_group > 1) {
  1158. fprintf(pp, " 7=%d", num_group);
  1159. }
  1160. int quantize_tag = 0;
  1161. fwrite(&quantize_tag, sizeof(int), 1, bp);
  1162. fwrite(weight_data.data(), sizeof(float), weight_data.size(), bp);
  1163. fwrite(bias_data.data(), sizeof(float), bias_data.size(), bp);
  1164. }
  1165. else if (n.op == "Deconvolution")
  1166. {
  1167. int num_filter = n.attr("num_filter");
  1168. std::vector<int> kernel = n.attr("kernel");
  1169. std::vector<int> dilate = n.attr("dilate");
  1170. std::vector<int> stride = n.attr("stride");
  1171. std::vector<int> pad = n.attr("pad");
  1172. int no_bias = n.attr("no_bias");
  1173. int num_group = n.attr("num_group");
  1174. std::vector<float> weight_data = n.weight(0);
  1175. std::vector<float> bias_data = n.weight(1);
  1176. fprintf(pp, " 0=%d", num_filter);
  1177. if (kernel.size() == 1) {
  1178. fprintf(pp, " 1=%d", kernel[0]);
  1179. } else if (kernel.size() == 2) {
  1180. fprintf(pp, " 1=%d", kernel[1]);
  1181. fprintf(pp, " 11=%d", kernel[0]);
  1182. }
  1183. if (dilate.size() == 1) {
  1184. fprintf(pp, " 2=%d", dilate[0]);
  1185. } else if (dilate.size() == 2) {
  1186. fprintf(pp, " 2=%d", dilate[1]);
  1187. fprintf(pp, " 12=%d", dilate[0]);
  1188. }
  1189. if (stride.size() == 1) {
  1190. fprintf(pp, " 3=%d", stride[0]);
  1191. } else if (stride.size() == 2) {
  1192. fprintf(pp, " 3=%d", stride[1]);
  1193. fprintf(pp, " 13=%d", stride[0]);
  1194. }
  1195. if (pad.size() == 1) {
  1196. fprintf(pp, " 4=%d", pad[0]);
  1197. } else if (pad.size() == 2) {
  1198. fprintf(pp, " 4=%d", pad[1]);
  1199. fprintf(pp, " 14=%d", pad[0]);
  1200. }
  1201. fprintf(pp, " 5=%d", no_bias == 1 ? 0 : 1);
  1202. fprintf(pp, " 6=%d", (int)weight_data.size());
  1203. if (num_group > 1) {
  1204. fprintf(pp, " 7=%d", num_group);
  1205. }
  1206. int quantize_tag = 0;
  1207. fwrite(&quantize_tag, sizeof(int), 1, bp);
  1208. fwrite(weight_data.data(), sizeof(float), weight_data.size(), bp);
  1209. fwrite(bias_data.data(), sizeof(float), bias_data.size(), bp);
  1210. }
  1211. else if (n.op == "cos")
  1212. {
  1213. int op_type = 10;
  1214. fprintf(pp, " 0=%d", op_type);
  1215. }
  1216. else if (n.op == "Dropout")
  1217. {
  1218. // float p = n.attr("p");
  1219. // fprintf(pp, " 0=%d", p);
  1220. }
  1221. else if (n.op == "elemwise_add")
  1222. {
  1223. int op_type = 0;
  1224. fprintf(pp, " 0=%d", op_type);
  1225. }
  1226. else if (n.op == "elemwise_div")
  1227. {
  1228. int op_type = 3;
  1229. fprintf(pp, " 0=%d", op_type);
  1230. }
  1231. else if (n.op == "elemwise_mul")
  1232. {
  1233. int op_type = 2;
  1234. fprintf(pp, " 0=%d", op_type);
  1235. }
  1236. else if (n.op == "elemwise_sub")
  1237. {
  1238. int op_type = 1;
  1239. fprintf(pp, " 0=%d", op_type);
  1240. }
  1241. else if (n.op == "Embedding")
  1242. {
  1243. int input_dim = n.attr("input_dim");
  1244. int output_dim = n.attr("output_dim");
  1245. std::vector<float> weight_data = n.weight(0);
  1246. fprintf(pp, " 0=%d", output_dim);
  1247. fprintf(pp, " 1=%d", input_dim);
  1248. fprintf(pp, " 3=%d", (int)weight_data.size());
  1249. int quantize_tag = 0;
  1250. fwrite(&quantize_tag, sizeof(int), 1, bp);
  1251. fwrite(weight_data.data(), sizeof(float), weight_data.size(), bp);
  1252. }
  1253. else if (n.op == "exp")
  1254. {
  1255. int op_type = 7;
  1256. fprintf(pp, " 0=%d", op_type);
  1257. }
  1258. else if (n.op == "expand_dims")
  1259. {
  1260. int axis = n.attr("axis");
  1261. int expand_w = 0;
  1262. int expand_h = 0;
  1263. int expand_c = 0;
  1264. if (axis == 0)
  1265. expand_c = 1;
  1266. if (axis == 1)
  1267. expand_h = 1;
  1268. if (axis == 2)
  1269. expand_w = 1;
  1270. fprintf(pp, " 0=%d", expand_w);
  1271. fprintf(pp, " 1=%d", expand_h);
  1272. fprintf(pp, " 2=%d", expand_c);
  1273. }
  1274. else if (n.op == "Flatten")
  1275. {
  1276. }
  1277. else if (n.op == "floor")
  1278. {
  1279. int op_type = 2;
  1280. fprintf(pp, " 0=%d", op_type);
  1281. }
  1282. else if (n.op == "FullyConnected")
  1283. {
  1284. int num_hidden = n.attr("num_hidden");
  1285. int no_bias = n.attr("no_bias");
  1286. // int flatten = n.attr("flatten");
  1287. // TODO flatten
  1288. std::vector<float> weight_data = n.weight(0);
  1289. std::vector<float> bias_data = n.weight(1);
  1290. fprintf(pp, " 0=%d", num_hidden);
  1291. fprintf(pp, " 1=%d", no_bias == 1 ? 0 : 1);
  1292. fprintf(pp, " 2=%d", (int)weight_data.size());
  1293. int quantize_tag = 0;
  1294. fwrite(&quantize_tag, sizeof(int), 1, bp);
  1295. fwrite(weight_data.data(), sizeof(float), weight_data.size(), bp);
  1296. fwrite(bias_data.data(), sizeof(float), bias_data.size(), bp);
  1297. }
  1298. else if (n.op == "InstanceNorm")
  1299. {
  1300. float eps = n.has_attr("eps") ? n.attr("eps") : 0.001f;
  1301. std::vector<float> gamma_data = n.weight(0);
  1302. std::vector<float> beta_data = n.weight(1);
  1303. fprintf(pp, " 0=%d", (int)gamma_data.size());
  1304. fprintf(pp, " 1=%f", eps);
  1305. fwrite(gamma_data.data(), sizeof(float), gamma_data.size(), bp);
  1306. fwrite(beta_data.data(), sizeof(float), beta_data.size(), bp);
  1307. }
  1308. else if (n.op == "L2Normalization")
  1309. {
  1310. std::string mode = n.attr("mode");
  1311. float eps = n.has_attr("eps") ? n.attr("eps") : 1e-10;
  1312. int across_spatial = 0;
  1313. int across_channel = 1;
  1314. int channel_shared = 1;
  1315. int scale_data_size = 1;
  1316. if (mode == "instance")
  1317. {
  1318. across_spatial = 1;
  1319. across_channel = 1;
  1320. }
  1321. else if (mode == "channel")
  1322. {
  1323. across_spatial = 0;
  1324. across_channel = 1;
  1325. }
  1326. else if (mode == "spatial")
  1327. {
  1328. across_spatial = 1;
  1329. across_channel = 0;
  1330. }
  1331. fprintf(pp, " 0=%d", across_spatial);
  1332. fprintf(pp, " 4=%d", across_channel);
  1333. fprintf(pp, " 1=%d", channel_shared);
  1334. fprintf(pp, " 2=%f", eps);
  1335. fprintf(pp, " 3=%d", scale_data_size);
  1336. const float scale_data[1] = { 1.f };
  1337. fwrite(scale_data, sizeof(float), 1, bp);
  1338. }
  1339. else if (n.op == "LeakyReLU")
  1340. {
  1341. std::string type = n.attr("act_type");
  1342. if (type == "elu")
  1343. {
  1344. float slope = n.has_attr("slope") ? n.attr("slope") : 0.25f;
  1345. fprintf(pp, " 0=%f", slope);
  1346. }
  1347. else if (type == "leaky")
  1348. {
  1349. float slope = n.has_attr("slope") ? n.attr("slope") : 0.25f;
  1350. fprintf(pp, " 0=%f", slope);
  1351. }
  1352. else if (type == "prelu")
  1353. {
  1354. std::vector<float> weight_data = n.weight(0);
  1355. fprintf(pp, " 0=%d", (int)weight_data.size());
  1356. fwrite(weight_data.data(), sizeof(float), weight_data.size(), bp);
  1357. }
  1358. }
  1359. else if (n.op == "log")
  1360. {
  1361. int op_type = 8;
  1362. fprintf(pp, " 0=%d", op_type);
  1363. }
  1364. else if (n.op == "LogisticRegressionOutput")
  1365. {
  1366. }
  1367. else if (n.op == "max")
  1368. {
  1369. int operation = 4;
  1370. fprintf(pp, " 0=%d", operation);
  1371. }
  1372. else if (n.op == "maximum")
  1373. {
  1374. int op_type = 4;
  1375. fprintf(pp, " 0=%d", op_type);
  1376. }
  1377. else if (n.op == "mean")
  1378. {
  1379. int operation = 3;
  1380. fprintf(pp, " 0=%d", operation);
  1381. }
  1382. else if (n.op == "min")
  1383. {
  1384. int operation = 5;
  1385. fprintf(pp, " 0=%d", operation);
  1386. }
  1387. else if (n.op == "minimum")
  1388. {
  1389. int op_type = 5;
  1390. fprintf(pp, " 0=%d", op_type);
  1391. }
  1392. else if (n.op == "negative")
  1393. {
  1394. int op_type = 1;
  1395. fprintf(pp, " 0=%d", op_type);
  1396. }
  1397. else if (n.op == "Pooling")
  1398. {
  1399. std::string pool_type = n.attr("pool_type");
  1400. std::vector<int> kernel = n.attr("kernel");
  1401. std::vector<int> stride = n.attr("stride");
  1402. std::vector<int> pad = n.attr("pad");
  1403. std::string pooling_convention = n.attr("pooling_convention");
  1404. int global_pool = n.attr("global_pool");
  1405. int pool = 0;
  1406. if (pool_type == "max")
  1407. {
  1408. pool = 0;
  1409. }
  1410. else if (pool_type == "avg")
  1411. {
  1412. pool = 1;
  1413. }
  1414. int pad_mode = 1;
  1415. if (pooling_convention == "valid")
  1416. {
  1417. pad_mode = 1;
  1418. }
  1419. else if (pooling_convention == "full")
  1420. {
  1421. pad_mode = 0;
  1422. }
  1423. fprintf(pp, " 0=%d", pool);
  1424. if (!kernel.empty())
  1425. fprintf(pp, " 1=%d", kernel[0]);
  1426. if (!stride.empty())
  1427. fprintf(pp, " 2=%d", stride[0]);
  1428. if (!pad.empty())
  1429. fprintf(pp, " 3=%d", pad[0]);
  1430. fprintf(pp, " 4=%d", global_pool);
  1431. fprintf(pp, " 5=%d", pad_mode);
  1432. }
  1433. else if (n.op == "prod")
  1434. {
  1435. int operation = 6;
  1436. fprintf(pp, " 0=%d", operation);
  1437. }
  1438. else if (n.op == "reciprocal")
  1439. {
  1440. int op_type = 15;
  1441. fprintf(pp, " 0=%d", op_type);
  1442. }
  1443. else if (n.op == "relu")
  1444. {
  1445. }
  1446. else if (n.op == "Reshape")
  1447. {
  1448. std::vector<int> shape = n.attr("shape");
  1449. if (shape.size() == 1) {
  1450. fprintf(pp, " 0=%d", shape[0]);// should never reach here
  1451. } else if (shape.size() == 2) {
  1452. fprintf(pp, " 0=%d", shape[1]);
  1453. } else if (shape.size() == 3) {
  1454. fprintf(pp, " 0=%d", shape[2]);
  1455. fprintf(pp, " 1=%d", shape[1]);
  1456. } else if (shape.size() == 4) {
  1457. fprintf(pp, " 0=%d", shape[3]);
  1458. fprintf(pp, " 1=%d", shape[2]);
  1459. fprintf(pp, " 2=%d", shape[1]);
  1460. } else if (shape.size() == 5) {
  1461. fprintf(pp, " 0=%d", shape[4] * shape[3]);
  1462. fprintf(pp, " 1=%d", shape[2]);
  1463. fprintf(pp, " 2=%d", shape[1]);
  1464. }
  1465. }
  1466. else if (n.op == "sin")
  1467. {
  1468. int op_type = 9;
  1469. fprintf(pp, " 0=%d", op_type);
  1470. }
  1471. else if (n.op == "SliceChannel")
  1472. {
  1473. int num_outputs = n.attr("num_outputs");
  1474. int squeeze_axis = n.attr("squeeze_axis");// TODO
  1475. fprintf(pp, " -23300=%d", num_outputs);
  1476. for (int j=0; j<num_outputs; j++)
  1477. {
  1478. fprintf(pp, ",-233");
  1479. }
  1480. }
  1481. else if (n.op == "SoftmaxOutput")
  1482. {
  1483. }
  1484. else if (n.op == "sqrt")
  1485. {
  1486. int op_type = 5;
  1487. fprintf(pp, " 0=%d", op_type);
  1488. }
  1489. else if (n.op == "square")
  1490. {
  1491. int op_type = 4;
  1492. fprintf(pp, " 0=%d", op_type);
  1493. }
  1494. else if (n.op == "sum")
  1495. {
  1496. int operation = 0;
  1497. fprintf(pp, " 0=%d", operation);
  1498. }
  1499. else if (n.op == "tan")
  1500. {
  1501. int op_type = 11;
  1502. fprintf(pp, " 0=%d", op_type);
  1503. }
  1504. else if (n.op == "tanh")
  1505. {
  1506. }
  1507. else if (n.op == "Transpose")
  1508. {
  1509. std::vector<int> axes = n.attr("axes");
  1510. if (axes.size() == 4) {
  1511. if (axes[1] == 1 && axes[2] == 2 && axes[3] == 3)
  1512. fprintf(pp, " 0=0");// w h c
  1513. else if (axes[1] == 1 && axes[2] == 3 && axes[3] == 2)
  1514. fprintf(pp, " 0=1");// h w c
  1515. else if (axes[1] == 2 && axes[2] == 1 && axes[3] == 3)
  1516. fprintf(pp, " 0=2");// w c h
  1517. else if (axes[1] == 2 && axes[2] == 3 && axes[3] == 1)
  1518. fprintf(pp, " 0=3");// c w h
  1519. else if (axes[1] == 3 && axes[2] == 1 && axes[3] == 2)
  1520. fprintf(pp, " 0=4");// h c w
  1521. else if (axes[1] == 3 && axes[2] == 2 && axes[3] == 1)
  1522. fprintf(pp, " 0=5");// c h w
  1523. } else if (axes.size() == 5) {
  1524. if (axes[1] == 1 && axes[2] == 2 && axes[3] == 3 && axes[4] == 4)
  1525. fprintf(pp, " 0=0");// wx h c
  1526. else if (axes[1] == 1 && axes[2] == 3 && axes[3] == 4 && axes[4] == 2)
  1527. fprintf(pp, " 0=1");// h wx c
  1528. else if (axes[1] == 2 && axes[2] == 1 && axes[3] == 3 && axes[4] == 4)
  1529. fprintf(pp, " 0=2");// wx c h
  1530. else if (axes[1] == 2 && axes[2] == 3 && axes[3] == 4 && axes[4] == 1)
  1531. fprintf(pp, " 0=3");// c wx h
  1532. else if (axes[1] == 3 && axes[2] == 4 && axes[3] == 1 && axes[4] == 2)
  1533. fprintf(pp, " 0=4");// h c wx
  1534. else if (axes[1] == 3 && axes[2] == 4 && axes[3] == 2 && axes[4] == 1)
  1535. fprintf(pp, " 0=5");// c h wx
  1536. else
  1537. fprintf(stderr, "Unsupported transpose type !\n");
  1538. }
  1539. }
  1540. else
  1541. {
  1542. // TODO op specific params
  1543. std::map<std::string, std::string>::const_iterator it = n.attrs.begin();
  1544. for (; it != n.attrs.end(); it++)
  1545. {
  1546. fprintf(stderr, "# %s=%s\n", it->first.c_str(), it->second.c_str());
  1547. // fprintf(pp, " %s=%s", it->first.c_str(), it->second.c_str());
  1548. }
  1549. }
  1550. fprintf(pp, "\n");
  1551. for (int j=0; j<output_size; j++)
  1552. {
  1553. int input_uid = i | (j << 16);
  1554. if (node_reference.find(input_uid) != node_reference.end())
  1555. {
  1556. int refcount = node_reference[input_uid];
  1557. if (refcount > 1)
  1558. {
  1559. std::string output_name = n.name;
  1560. char splitname[256];
  1561. sprintf(splitname, "splitncnn_%d", internal_split);
  1562. fprintf(pp, "%-16s %-32s %d %d", "Split", splitname, 1, refcount);
  1563. if (j == 0)
  1564. {
  1565. fprintf(pp, " %s", output_name.c_str());
  1566. }
  1567. else
  1568. {
  1569. fprintf(pp, " %s_subncnn_%d", output_name.c_str(), j);
  1570. }
  1571. for (int k=0; k<refcount; k++)
  1572. {
  1573. if (j == 0)
  1574. {
  1575. fprintf(pp, " %s_splitncnn_%d", output_name.c_str(), k);
  1576. }
  1577. else
  1578. {
  1579. fprintf(pp, " %s_subncnn_%d_splitncnn_%d", output_name.c_str(), j, k);
  1580. }
  1581. }
  1582. fprintf(pp, "\n");
  1583. internal_split++;
  1584. }
  1585. }
  1586. }
  1587. }
  1588. fclose(pp);
  1589. fclose(bp);
  1590. return 0;
  1591. }