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 53 kB

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