marshalls.cpp 26 KB

12345678910111213141516171819202122232425262728293031323334353637383940414243444546474849505152535455565758596061626364656667686970717273747576777879808182838485868788899091929394959697989910010110210310410510610710810911011111211311411511611711811912012112212312412512612712812913013113213313413513613713813914014114214314414514614714814915015115215315415515615715815916016116216316416516616716816917017117217317417517617717817918018118218318418518618718818919019119219319419519619719819920020120220320420520620720820921021121221321421521621721821922022122222322422522622722822923023123223323423523623723823924024124224324424524624724824925025125225325425525625725825926026126226326426526626726826927027127227327427527627727827928028128228328428528628728828929029129229329429529629729829930030130230330430530630730830931031131231331431531631731831932032132232332432532632732832933033133233333433533633733833934034134234334434534634734834935035135235335435535635735835936036136236336436536636736836937037137237337437537637737837938038138238338438538638738838939039139239339439539639739839940040140240340440540640740840941041141241341441541641741841942042142242342442542642742842943043143243343443543643743843944044144244344444544644744844945045145245345445545645745845946046146246346446546646746846947047147247347447547647747847948048148248348448548648748848949049149249349449549649749849950050150250350450550650750850951051151251351451551651751851952052152252352452552652752852953053153253353453553653753853954054154254354454554654754854955055155255355455555655755855956056156256356456556656756856957057157257357457557657757857958058158258358458558658758858959059159259359459559659759859960060160260360460560660760860961061161261361461561661761861962062162262362462562662762862963063163263363463563663763863964064164264364464564664764864965065165265365465565665765865966066166266366466566666766866967067167267367467567667767867968068168268368468568668768868969069169269369469569669769869970070170270370470570670770870971071171271371471571671771871972072172272372472572672772872973073173273373473573673773873974074174274374474574674774874975075175275375475575675775875976076176276376476576676776876977077177277377477577677777877978078178278378478578678778878979079179279379479579679779879980080180280380480580680780880981081181281381481581681781881982082182282382482582682782882983083183283383483583683783883984084184284384484584684784884985085185285385485585685785885986086186286386486586686786886987087187287387487587687787887988088188288388488588688788888989089189289389489589689789889990090190290390490590690790890991091191291391491591691791891992092192292392492592692792892993093193293393493593693793893994094194294394494594694794894995095195295395495595695795895996096196296396496596696796896997097197297397497597697797897998098198298398498598698798898999099199299399499599699799899910001001100210031004100510061007100810091010101110121013101410151016101710181019102010211022102310241025102610271028102910301031103210331034103510361037103810391040104110421043104410451046104710481049105010511052105310541055105610571058105910601061106210631064106510661067106810691070107110721073107410751076107710781079108010811082108310841085108610871088108910901091109210931094109510961097109810991100110111021103110411051106110711081109111011111112111311141115111611171118111911201121112211231124112511261127112811291130113111321133113411351136113711381139114011411142114311441145114611471148114911501151115211531154115511561157115811591160116111621163116411651166116711681169117011711172117311741175117611771178117911801181118211831184118511861187118811891190119111921193119411951196119711981199120012011202120312041205120612071208120912101211121212131214121512161217121812191220122112221223122412251226122712281229123012311232123312341235123612371238123912401241124212431244124512461247124812491250125112521253125412551256125712581259126012611262126312641265126612671268126912701271127212731274127512761277127812791280128112821283128412851286128712881289129012911292129312941295129612971298129913001301130213031304130513061307130813091310131113121313131413151316131713181319132013211322132313241325132613271328132913301331133213331334133513361337133813391340134113421343134413451346134713481349135013511352135313541355135613571358135913601361136213631364136513661367136813691370137113721373137413751376137713781379138013811382138313841385138613871388138913901391139213931394139513961397139813991400140114021403140414051406140714081409141014111412141314141415141614171418
  1. /*************************************************************************/
  2. /* marshalls.cpp */
  3. /*************************************************************************/
  4. /* This file is part of: */
  5. /* GODOT ENGINE */
  6. /* http://www.godotengine.org */
  7. /*************************************************************************/
  8. /* Copyright (c) 2007-2017 Juan Linietsky, Ariel Manzur. */
  9. /* */
  10. /* Permission is hereby granted, free of charge, to any person obtaining */
  11. /* a copy of this software and associated documentation files (the */
  12. /* "Software"), to deal in the Software without restriction, including */
  13. /* without limitation the rights to use, copy, modify, merge, publish, */
  14. /* distribute, sublicense, and/or sell copies of the Software, and to */
  15. /* permit persons to whom the Software is furnished to do so, subject to */
  16. /* the following conditions: */
  17. /* */
  18. /* The above copyright notice and this permission notice shall be */
  19. /* included in all copies or substantial portions of the Software. */
  20. /* */
  21. /* THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, */
  22. /* EXPRESS OR IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF */
  23. /* MERCHANTABILITY, FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT.*/
  24. /* IN NO EVENT SHALL THE AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY */
  25. /* CLAIM, DAMAGES OR OTHER LIABILITY, WHETHER IN AN ACTION OF CONTRACT, */
  26. /* TORT OR OTHERWISE, ARISING FROM, OUT OF OR IN CONNECTION WITH THE */
  27. /* SOFTWARE OR THE USE OR OTHER DEALINGS IN THE SOFTWARE. */
  28. /*************************************************************************/
  29. #include "marshalls.h"
  30. #include "print_string.h"
  31. #include "os/keyboard.h"
  32. #include <stdio.h>
  33. Error decode_variant(Variant& r_variant,const uint8_t *p_buffer, int p_len,int *r_len) {
  34. const uint8_t * buf=p_buffer;
  35. int len=p_len;
  36. if (len<4) {
  37. ERR_FAIL_COND_V(len<4,ERR_INVALID_DATA);
  38. }
  39. uint32_t type=decode_uint32(buf);
  40. ERR_FAIL_COND_V(type>=Variant::VARIANT_MAX,ERR_INVALID_DATA);
  41. buf+=4;
  42. len-=4;
  43. if (r_len)
  44. *r_len=4;
  45. switch(type) {
  46. case Variant::NIL: {
  47. r_variant=Variant();
  48. } break;
  49. case Variant::BOOL: {
  50. ERR_FAIL_COND_V(len<4,ERR_INVALID_DATA);
  51. bool val = decode_uint32(buf);
  52. r_variant=val;
  53. if (r_len)
  54. (*r_len)+=4;
  55. } break;
  56. case Variant::INT: {
  57. ERR_FAIL_COND_V(len<4,ERR_INVALID_DATA);
  58. int val = decode_uint32(buf);
  59. r_variant=val;
  60. if (r_len)
  61. (*r_len)+=4;
  62. } break;
  63. case Variant::REAL: {
  64. ERR_FAIL_COND_V(len<(int)4,ERR_INVALID_DATA);
  65. float val = decode_float(buf);
  66. r_variant=val;
  67. if (r_len)
  68. (*r_len)+=4;
  69. } break;
  70. case Variant::STRING: {
  71. ERR_FAIL_COND_V(len<4,ERR_INVALID_DATA);
  72. uint32_t strlen = decode_uint32(buf);
  73. buf+=4;
  74. len-=4;
  75. ERR_FAIL_COND_V((int)strlen>len,ERR_INVALID_DATA);
  76. String str;
  77. str.parse_utf8((const char*)buf,strlen);
  78. r_variant=str;
  79. if (r_len) {
  80. if (strlen%4)
  81. (*r_len)+=4-strlen%4;
  82. (*r_len)+=4+strlen;
  83. }
  84. } break;
  85. // math types
  86. case Variant::VECTOR2: {
  87. ERR_FAIL_COND_V(len<(int)4*2,ERR_INVALID_DATA);
  88. Vector2 val;
  89. val.x=decode_float(&buf[0]);
  90. val.y=decode_float(&buf[4]);
  91. r_variant=val;
  92. if (r_len)
  93. (*r_len)+=4*2;
  94. } break; // 5
  95. case Variant::RECT2: {
  96. ERR_FAIL_COND_V(len<(int)4*4,ERR_INVALID_DATA);
  97. Rect2 val;
  98. val.pos.x=decode_float(&buf[0]);
  99. val.pos.y=decode_float(&buf[4]);
  100. val.size.x=decode_float(&buf[8]);
  101. val.size.y=decode_float(&buf[12]);
  102. r_variant=val;
  103. if (r_len)
  104. (*r_len)+=4*4;
  105. } break;
  106. case Variant::VECTOR3: {
  107. ERR_FAIL_COND_V(len<(int)4*3,ERR_INVALID_DATA);
  108. Vector3 val;
  109. val.x=decode_float(&buf[0]);
  110. val.y=decode_float(&buf[4]);
  111. val.z=decode_float(&buf[8]);
  112. r_variant=val;
  113. if (r_len)
  114. (*r_len)+=4*3;
  115. } break;
  116. case Variant::MATRIX32: {
  117. ERR_FAIL_COND_V(len<(int)4*6,ERR_INVALID_DATA);
  118. Matrix32 val;
  119. for(int i=0;i<3;i++) {
  120. for(int j=0;j<2;j++) {
  121. val.elements[i][j]=decode_float(&buf[(i*2+j)*4]);
  122. }
  123. }
  124. r_variant=val;
  125. if (r_len)
  126. (*r_len)+=4*6;
  127. } break;
  128. case Variant::PLANE: {
  129. ERR_FAIL_COND_V(len<(int)4*4,ERR_INVALID_DATA);
  130. Plane val;
  131. val.normal.x=decode_float(&buf[0]);
  132. val.normal.y=decode_float(&buf[4]);
  133. val.normal.z=decode_float(&buf[8]);
  134. val.d=decode_float(&buf[12]);
  135. r_variant=val;
  136. if (r_len)
  137. (*r_len)+=4*4;
  138. } break;
  139. case Variant::QUAT: {
  140. ERR_FAIL_COND_V(len<(int)4*4,ERR_INVALID_DATA);
  141. Quat val;
  142. val.x=decode_float(&buf[0]);
  143. val.y=decode_float(&buf[4]);
  144. val.z=decode_float(&buf[8]);
  145. val.w=decode_float(&buf[12]);
  146. r_variant=val;
  147. if (r_len)
  148. (*r_len)+=4*4;
  149. } break;
  150. case Variant::_AABB: {
  151. ERR_FAIL_COND_V(len<(int)4*6,ERR_INVALID_DATA);
  152. AABB val;
  153. val.pos.x=decode_float(&buf[0]);
  154. val.pos.y=decode_float(&buf[4]);
  155. val.pos.z=decode_float(&buf[8]);
  156. val.size.x=decode_float(&buf[12]);
  157. val.size.y=decode_float(&buf[16]);
  158. val.size.z=decode_float(&buf[20]);
  159. r_variant=val;
  160. if (r_len)
  161. (*r_len)+=4*6;
  162. } break;
  163. case Variant::MATRIX3: {
  164. ERR_FAIL_COND_V(len<(int)4*9,ERR_INVALID_DATA);
  165. Matrix3 val;
  166. for(int i=0;i<3;i++) {
  167. for(int j=0;j<3;j++) {
  168. val.elements[i][j]=decode_float(&buf[(i*3+j)*4]);
  169. }
  170. }
  171. r_variant=val;
  172. if (r_len)
  173. (*r_len)+=4*9;
  174. } break;
  175. case Variant::TRANSFORM: {
  176. ERR_FAIL_COND_V(len<(int)4*12,ERR_INVALID_DATA);
  177. Transform val;
  178. for(int i=0;i<3;i++) {
  179. for(int j=0;j<3;j++) {
  180. val.basis.elements[i][j]=decode_float(&buf[(i*3+j)*4]);
  181. }
  182. }
  183. val.origin[0]=decode_float(&buf[36]);
  184. val.origin[1]=decode_float(&buf[40]);
  185. val.origin[2]=decode_float(&buf[44]);
  186. r_variant=val;
  187. if (r_len)
  188. (*r_len)+=4*12;
  189. } break;
  190. // misc types
  191. case Variant::COLOR: {
  192. ERR_FAIL_COND_V(len<(int)4*4,ERR_INVALID_DATA);
  193. Color val;
  194. val.r=decode_float(&buf[0]);
  195. val.g=decode_float(&buf[4]);
  196. val.b=decode_float(&buf[8]);
  197. val.a=decode_float(&buf[12]);
  198. r_variant=val;
  199. if (r_len)
  200. (*r_len)+=4*4;
  201. } break;
  202. case Variant::IMAGE: {
  203. ERR_FAIL_COND_V(len<(int)5*4,ERR_INVALID_DATA);
  204. Image::Format fmt = (Image::Format)decode_uint32(&buf[0]);
  205. ERR_FAIL_INDEX_V( fmt, Image::FORMAT_MAX, ERR_INVALID_DATA);
  206. uint32_t mipmaps = decode_uint32(&buf[4]);
  207. uint32_t w = decode_uint32(&buf[8]);
  208. uint32_t h = decode_uint32(&buf[12]);
  209. uint32_t datalen = decode_uint32(&buf[16]);
  210. Image img;
  211. if (datalen>0) {
  212. len-=5*4;
  213. ERR_FAIL_COND_V( len < datalen, ERR_INVALID_DATA );
  214. DVector<uint8_t> data;
  215. data.resize(datalen);
  216. DVector<uint8_t>::Write wr = data.write();
  217. copymem(&wr[0],&buf[20],datalen);
  218. wr = DVector<uint8_t>::Write();
  219. img=Image(w,h,mipmaps,fmt,data);
  220. }
  221. r_variant=img;
  222. if (r_len) {
  223. if (datalen%4)
  224. (*r_len)+=4-datalen%4;
  225. (*r_len)+=4*5+datalen;
  226. }
  227. } break;
  228. case Variant::NODE_PATH: {
  229. ERR_FAIL_COND_V(len<4,ERR_INVALID_DATA);
  230. uint32_t strlen = decode_uint32(buf);
  231. if (strlen&0x80000000) {
  232. //new format
  233. ERR_FAIL_COND_V(len<12,ERR_INVALID_DATA);
  234. Vector<StringName> names;
  235. Vector<StringName> subnames;
  236. StringName prop;
  237. uint32_t namecount=strlen&=0x7FFFFFFF;
  238. uint32_t subnamecount = decode_uint32(buf+4);
  239. uint32_t flags = decode_uint32(buf+8);
  240. len-=12;
  241. buf+=12;
  242. int total=namecount+subnamecount;
  243. if (flags&2)
  244. total++;
  245. if (r_len)
  246. (*r_len)+=12;
  247. for(int i=0;i<total;i++) {
  248. ERR_FAIL_COND_V((int)len<4,ERR_INVALID_DATA);
  249. strlen = decode_uint32(buf);
  250. int pad=0;
  251. if (strlen%4)
  252. pad+=4-strlen%4;
  253. buf+=4;
  254. len-=4;
  255. ERR_FAIL_COND_V((int)strlen+pad>len,ERR_INVALID_DATA);
  256. String str;
  257. str.parse_utf8((const char*)buf,strlen);
  258. if (i<namecount)
  259. names.push_back(str);
  260. else if (i<namecount+subnamecount)
  261. subnames.push_back(str);
  262. else
  263. prop=str;
  264. buf+=strlen+pad;
  265. len-=strlen+pad;
  266. if (r_len)
  267. (*r_len)+=4+strlen+pad;
  268. }
  269. r_variant=NodePath(names,subnames,flags&1,prop);
  270. } else {
  271. //old format, just a string
  272. buf+=4;
  273. len-=4;
  274. ERR_FAIL_COND_V((int)strlen>len,ERR_INVALID_DATA);
  275. String str;
  276. str.parse_utf8((const char*)buf,strlen);
  277. r_variant=NodePath(str);
  278. if (r_len)
  279. (*r_len)+=4+strlen;
  280. }
  281. } break;
  282. /*case Variant::RESOURCE: {
  283. ERR_EXPLAIN("Can't marshallize resources");
  284. ERR_FAIL_V(ERR_INVALID_DATA); //no, i'm sorry, no go
  285. } break;*/
  286. case Variant::_RID: {
  287. r_variant = RID();
  288. } break;
  289. case Variant::OBJECT: {
  290. r_variant = (Object*)NULL;
  291. } break;
  292. case Variant::INPUT_EVENT: {
  293. InputEvent ie;
  294. ie.type=decode_uint32(&buf[0]);
  295. ie.device=decode_uint32(&buf[4]);
  296. if (r_len)
  297. (*r_len)+=12;
  298. switch(ie.type) {
  299. case InputEvent::KEY: {
  300. uint32_t mods=decode_uint32(&buf[12]);
  301. if (mods&KEY_MASK_SHIFT)
  302. ie.key.mod.shift=true;
  303. if (mods&KEY_MASK_CTRL)
  304. ie.key.mod.control=true;
  305. if (mods&KEY_MASK_ALT)
  306. ie.key.mod.alt=true;
  307. if (mods&KEY_MASK_META)
  308. ie.key.mod.meta=true;
  309. ie.key.scancode=decode_uint32(&buf[16]);
  310. if (r_len)
  311. (*r_len)+=8;
  312. } break;
  313. case InputEvent::MOUSE_BUTTON: {
  314. ie.mouse_button.button_index=decode_uint32(&buf[12]);
  315. if (r_len)
  316. (*r_len)+=4;
  317. } break;
  318. case InputEvent::JOYSTICK_BUTTON: {
  319. ie.joy_button.button_index=decode_uint32(&buf[12]);
  320. if (r_len)
  321. (*r_len)+=4;
  322. } break;
  323. case InputEvent::SCREEN_TOUCH: {
  324. ie.screen_touch.index=decode_uint32(&buf[12]);
  325. if (r_len)
  326. (*r_len)+=4;
  327. } break;
  328. case InputEvent::JOYSTICK_MOTION: {
  329. ie.joy_motion.axis=decode_uint32(&buf[12]);
  330. ie.joy_motion.axis_value=decode_float(&buf[16]);
  331. if (r_len)
  332. (*r_len)+=8;
  333. } break;
  334. }
  335. r_variant = ie;
  336. } break;
  337. case Variant::DICTIONARY: {
  338. ERR_FAIL_COND_V(len<4,ERR_INVALID_DATA);
  339. uint32_t count = decode_uint32(buf);
  340. bool shared = count&0x80000000;
  341. count&=0x7FFFFFFF;
  342. buf+=4;
  343. len-=4;
  344. if (r_len) {
  345. (*r_len)+=4;
  346. }
  347. Dictionary d(shared);
  348. for(uint32_t i=0;i<count;i++) {
  349. Variant key,value;
  350. int used;
  351. Error err = decode_variant(key,buf,len,&used);
  352. ERR_FAIL_COND_V(err,err);
  353. buf+=used;
  354. len-=used;
  355. if (r_len) {
  356. (*r_len)+=used;
  357. }
  358. err = decode_variant(value,buf,len,&used);
  359. ERR_FAIL_COND_V(err,err);
  360. buf+=used;
  361. len-=used;
  362. if (r_len) {
  363. (*r_len)+=used;
  364. }
  365. d[key]=value;
  366. }
  367. r_variant=d;
  368. } break;
  369. case Variant::ARRAY: {
  370. ERR_FAIL_COND_V(len<4,ERR_INVALID_DATA);
  371. uint32_t count = decode_uint32(buf);
  372. bool shared = count&0x80000000;
  373. count&=0x7FFFFFFF;
  374. buf+=4;
  375. len-=4;
  376. if (r_len) {
  377. (*r_len)+=4;
  378. }
  379. Array varr(shared);
  380. for(uint32_t i=0;i<count;i++) {
  381. int used=0;
  382. Variant v;
  383. Error err = decode_variant(v,buf,len,&used);
  384. ERR_FAIL_COND_V(err,err);
  385. buf+=used;
  386. len-=used;
  387. varr.push_back(v);
  388. if (r_len) {
  389. (*r_len)+=used;
  390. }
  391. }
  392. r_variant=varr;
  393. } break;
  394. // arrays
  395. case Variant::RAW_ARRAY: {
  396. ERR_FAIL_COND_V(len<4,ERR_INVALID_DATA);
  397. uint32_t count = decode_uint32(buf);
  398. buf+=4;
  399. len-=4;
  400. ERR_FAIL_COND_V((int)count>len,ERR_INVALID_DATA);
  401. DVector<uint8_t> data;
  402. if (count) {
  403. data.resize(count);
  404. DVector<uint8_t>::Write w = data.write();
  405. for(int i=0;i<count;i++) {
  406. w[i]=buf[i];
  407. }
  408. w = DVector<uint8_t>::Write();
  409. }
  410. r_variant=data;
  411. if (r_len) {
  412. if (count%4)
  413. (*r_len)+=4-count%4;
  414. (*r_len)+=4+count;
  415. }
  416. } break;
  417. case Variant::INT_ARRAY: {
  418. ERR_FAIL_COND_V(len<4,ERR_INVALID_DATA);
  419. uint32_t count = decode_uint32(buf);
  420. buf+=4;
  421. len-=4;
  422. ERR_FAIL_COND_V((int)count*4>len,ERR_INVALID_DATA);
  423. DVector<int> data;
  424. if (count) {
  425. //const int*rbuf=(const int*)buf;
  426. data.resize(count);
  427. DVector<int>::Write w = data.write();
  428. for(int i=0;i<count;i++) {
  429. w[i]=decode_uint32(&buf[i*4]);
  430. }
  431. w = DVector<int>::Write();
  432. }
  433. r_variant=Variant(data);
  434. if (r_len) {
  435. (*r_len)+=4+count*sizeof(int);
  436. }
  437. } break;
  438. case Variant::REAL_ARRAY: {
  439. ERR_FAIL_COND_V(len<4,ERR_INVALID_DATA);
  440. uint32_t count = decode_uint32(buf);
  441. buf+=4;
  442. len-=4;
  443. ERR_FAIL_COND_V((int)count*4>len,ERR_INVALID_DATA);
  444. DVector<float> data;
  445. if (count) {
  446. //const float*rbuf=(const float*)buf;
  447. data.resize(count);
  448. DVector<float>::Write w = data.write();
  449. for(int i=0;i<count;i++) {
  450. w[i]=decode_float(&buf[i*4]);
  451. }
  452. w = DVector<float>::Write();
  453. }
  454. r_variant=data;
  455. if (r_len) {
  456. (*r_len)+=4+count*sizeof(float);
  457. }
  458. } break;
  459. case Variant::STRING_ARRAY: {
  460. ERR_FAIL_COND_V(len<4,ERR_INVALID_DATA);
  461. uint32_t count = decode_uint32(buf);
  462. ERR_FAIL_COND_V(count<0,ERR_INVALID_DATA);
  463. DVector<String> strings;
  464. buf+=4;
  465. len-=4;
  466. if (r_len)
  467. (*r_len)+=4;
  468. //printf("string count: %i\n",count);
  469. for(int i=0;i<(int)count;i++) {
  470. ERR_FAIL_COND_V(len<4,ERR_INVALID_DATA);
  471. uint32_t strlen = decode_uint32(buf);
  472. buf+=4;
  473. len-=4;
  474. ERR_FAIL_COND_V((int)strlen>len,ERR_INVALID_DATA);
  475. //printf("loaded string: %s\n",(const char*)buf);
  476. String str;
  477. str.parse_utf8((const char*)buf,strlen);
  478. strings.push_back(str);
  479. buf+=strlen;
  480. len-=strlen;
  481. if (r_len)
  482. (*r_len)+=4+strlen;
  483. if (strlen%4) {
  484. int pad = 4-(strlen%4);
  485. buf+=pad;
  486. len-=pad;
  487. if (r_len) {
  488. (*r_len)+=pad;
  489. }
  490. }
  491. }
  492. r_variant=strings;
  493. } break;
  494. case Variant::VECTOR2_ARRAY: {
  495. ERR_FAIL_COND_V(len<4,ERR_INVALID_DATA);
  496. uint32_t count = decode_uint32(buf);
  497. ERR_FAIL_COND_V(count<0,ERR_INVALID_DATA);
  498. buf+=4;
  499. len-=4;
  500. ERR_FAIL_COND_V((int)count*4*2>len,ERR_INVALID_DATA);
  501. DVector<Vector2> varray;
  502. if (r_len) {
  503. (*r_len)+=4;
  504. }
  505. if (count) {
  506. varray.resize(count);
  507. DVector<Vector2>::Write w = varray.write();
  508. for(int i=0;i<(int)count;i++) {
  509. w[i].x=decode_float(buf+i*4*2+4*0);
  510. w[i].y=decode_float(buf+i*4*2+4*1);
  511. }
  512. int adv = 4*2*count;
  513. if (r_len)
  514. (*r_len)+=adv;
  515. len-=adv;
  516. buf+=adv;
  517. }
  518. r_variant=varray;
  519. } break;
  520. case Variant::VECTOR3_ARRAY: {
  521. ERR_FAIL_COND_V(len<4,ERR_INVALID_DATA);
  522. uint32_t count = decode_uint32(buf);
  523. ERR_FAIL_COND_V(count<0,ERR_INVALID_DATA);
  524. buf+=4;
  525. len-=4;
  526. ERR_FAIL_COND_V((int)count*4*3>len,ERR_INVALID_DATA);
  527. DVector<Vector3> varray;
  528. if (r_len) {
  529. (*r_len)+=4;
  530. }
  531. if (count) {
  532. varray.resize(count);
  533. DVector<Vector3>::Write w = varray.write();
  534. for(int i=0;i<(int)count;i++) {
  535. w[i].x=decode_float(buf+i*4*3+4*0);
  536. w[i].y=decode_float(buf+i*4*3+4*1);
  537. w[i].z=decode_float(buf+i*4*3+4*2);
  538. }
  539. int adv = 4*3*count;
  540. if (r_len)
  541. (*r_len)+=adv;
  542. len-=adv;
  543. buf+=adv;
  544. }
  545. r_variant=varray;
  546. } break;
  547. case Variant::COLOR_ARRAY: {
  548. ERR_FAIL_COND_V(len<4,ERR_INVALID_DATA);
  549. uint32_t count = decode_uint32(buf);
  550. ERR_FAIL_COND_V(count<0,ERR_INVALID_DATA);
  551. buf+=4;
  552. len-=4;
  553. ERR_FAIL_COND_V((int)count*4*4>len,ERR_INVALID_DATA);
  554. DVector<Color> carray;
  555. if (r_len) {
  556. (*r_len)+=4;
  557. }
  558. if (count) {
  559. carray.resize(count);
  560. DVector<Color>::Write w = carray.write();
  561. for(int i=0;i<(int)count;i++) {
  562. w[i].r=decode_float(buf+i*4*4+4*0);
  563. w[i].g=decode_float(buf+i*4*4+4*1);
  564. w[i].b=decode_float(buf+i*4*4+4*2);
  565. w[i].a=decode_float(buf+i*4*4+4*3);
  566. }
  567. int adv = 4*4*count;
  568. if (r_len)
  569. (*r_len)+=adv;
  570. len-=adv;
  571. buf+=adv;
  572. }
  573. r_variant=carray;
  574. } break;
  575. default: { ERR_FAIL_V(ERR_BUG); }
  576. }
  577. return OK;
  578. }
  579. Error encode_variant(const Variant& p_variant, uint8_t *r_buffer, int &r_len) {
  580. uint8_t * buf=r_buffer;
  581. r_len=0;
  582. if (buf) {
  583. encode_uint32(p_variant.get_type(),buf);
  584. buf+=4;
  585. }
  586. r_len+=4;
  587. switch(p_variant.get_type()) {
  588. case Variant::NIL: {
  589. //nothing to do
  590. } break;
  591. case Variant::BOOL: {
  592. if (buf) {
  593. encode_uint32(p_variant.operator bool(),buf);
  594. }
  595. r_len+=4;
  596. } break;
  597. case Variant::INT: {
  598. if (buf) {
  599. encode_uint32(p_variant.operator int(),buf);
  600. }
  601. r_len+=4;
  602. } break;
  603. case Variant::REAL: {
  604. if (buf) {
  605. encode_float(p_variant.operator float(),buf);
  606. }
  607. r_len+=4;
  608. } break;
  609. case Variant::NODE_PATH: {
  610. NodePath np=p_variant;
  611. if (buf) {
  612. encode_uint32(uint32_t(np.get_name_count())|0x80000000,buf); //for compatibility with the old format
  613. encode_uint32(np.get_subname_count(),buf+4);
  614. uint32_t flags=0;
  615. if (np.is_absolute())
  616. flags|=1;
  617. if (np.get_property()!=StringName())
  618. flags|=2;
  619. encode_uint32(flags,buf+8);
  620. buf+=12;
  621. }
  622. r_len+=12;
  623. int total = np.get_name_count()+np.get_subname_count();
  624. if (np.get_property()!=StringName())
  625. total++;
  626. for(int i=0;i<total;i++) {
  627. String str;
  628. if (i<np.get_name_count())
  629. str=np.get_name(i);
  630. else if (i<np.get_name_count()+np.get_subname_count())
  631. str=np.get_subname(i-np.get_subname_count());
  632. else
  633. str=np.get_property();
  634. CharString utf8 = str.utf8();
  635. int pad = 0;
  636. if (utf8.length()%4)
  637. pad=4-utf8.length()%4;
  638. if (buf) {
  639. encode_uint32(utf8.length(),buf);
  640. buf+=4;
  641. copymem(buf,utf8.get_data(),utf8.length());
  642. buf+=pad+utf8.length();
  643. }
  644. r_len+=4+utf8.length()+pad;
  645. }
  646. } break;
  647. case Variant::STRING: {
  648. CharString utf8 = p_variant.operator String().utf8();
  649. if (buf) {
  650. encode_uint32(utf8.length(),buf);
  651. buf+=4;
  652. copymem(buf,utf8.get_data(),utf8.length());
  653. }
  654. r_len+=4+utf8.length();
  655. while (r_len%4)
  656. r_len++; //pad
  657. } break;
  658. // math types
  659. case Variant::VECTOR2: {
  660. if (buf) {
  661. Vector2 v2=p_variant;
  662. encode_float(v2.x,&buf[0]);
  663. encode_float(v2.y,&buf[4]);
  664. }
  665. r_len+=2*4;
  666. } break; // 5
  667. case Variant::RECT2: {
  668. if (buf) {
  669. Rect2 r2=p_variant;
  670. encode_float(r2.pos.x,&buf[0]);
  671. encode_float(r2.pos.y,&buf[4]);
  672. encode_float(r2.size.x,&buf[8]);
  673. encode_float(r2.size.y,&buf[12]);
  674. }
  675. r_len+=4*4;
  676. } break;
  677. case Variant::VECTOR3: {
  678. if (buf) {
  679. Vector3 v3=p_variant;
  680. encode_float(v3.x,&buf[0]);
  681. encode_float(v3.y,&buf[4]);
  682. encode_float(v3.z,&buf[8]);
  683. }
  684. r_len+=3*4;
  685. } break;
  686. case Variant::MATRIX32: {
  687. if (buf) {
  688. Matrix32 val=p_variant;
  689. for(int i=0;i<3;i++) {
  690. for(int j=0;j<2;j++) {
  691. copymem(&buf[(i*2+j)*4],&val.elements[i][j],sizeof(float));
  692. }
  693. }
  694. }
  695. r_len+=6*4;
  696. } break;
  697. case Variant::PLANE: {
  698. if (buf) {
  699. Plane p=p_variant;
  700. encode_float(p.normal.x,&buf[0]);
  701. encode_float(p.normal.y,&buf[4]);
  702. encode_float(p.normal.z,&buf[8]);
  703. encode_float(p.d,&buf[12]);
  704. }
  705. r_len+=4*4;
  706. } break;
  707. case Variant::QUAT: {
  708. if (buf) {
  709. Quat q=p_variant;
  710. encode_float(q.x,&buf[0]);
  711. encode_float(q.y,&buf[4]);
  712. encode_float(q.z,&buf[8]);
  713. encode_float(q.w,&buf[12]);
  714. }
  715. r_len+=4*4;
  716. } break;
  717. case Variant::_AABB: {
  718. if (buf) {
  719. AABB aabb=p_variant;
  720. encode_float(aabb.pos.x,&buf[0]);
  721. encode_float(aabb.pos.y,&buf[4]);
  722. encode_float(aabb.pos.z,&buf[8]);
  723. encode_float(aabb.size.x,&buf[12]);
  724. encode_float(aabb.size.y,&buf[16]);
  725. encode_float(aabb.size.z,&buf[20]);
  726. }
  727. r_len+=6*4;
  728. } break;
  729. case Variant::MATRIX3: {
  730. if (buf) {
  731. Matrix3 val=p_variant;
  732. for(int i=0;i<3;i++) {
  733. for(int j=0;j<3;j++) {
  734. copymem(&buf[(i*3+j)*4],&val.elements[i][j],sizeof(float));
  735. }
  736. }
  737. }
  738. r_len+=9*4;
  739. } break;
  740. case Variant::TRANSFORM: {
  741. if (buf) {
  742. Transform val=p_variant;
  743. for(int i=0;i<3;i++) {
  744. for(int j=0;j<3;j++) {
  745. copymem(&buf[(i*3+j)*4],&val.basis.elements[i][j],sizeof(float));
  746. }
  747. }
  748. encode_float(val.origin.x,&buf[36]);
  749. encode_float(val.origin.y,&buf[40]);
  750. encode_float(val.origin.z,&buf[44]);
  751. }
  752. r_len+=12*4;
  753. } break;
  754. // misc types
  755. case Variant::COLOR: {
  756. if (buf) {
  757. Color c=p_variant;
  758. encode_float(c.r,&buf[0]);
  759. encode_float(c.g,&buf[4]);
  760. encode_float(c.b,&buf[8]);
  761. encode_float(c.a,&buf[12]);
  762. }
  763. r_len+=4*4;
  764. } break;
  765. case Variant::IMAGE: {
  766. Image image = p_variant;
  767. DVector<uint8_t> data=image.get_data();
  768. if (buf) {
  769. encode_uint32(image.get_format(),&buf[0]);
  770. encode_uint32(image.has_mipmaps(),&buf[4]);
  771. encode_uint32(image.get_width(),&buf[8]);
  772. encode_uint32(image.get_height(),&buf[12]);
  773. int ds=data.size();
  774. encode_uint32(ds,&buf[16]);
  775. DVector<uint8_t>::Read r = data.read();
  776. copymem(&buf[20],&r[0],ds);
  777. }
  778. int pad=0;
  779. if (data.size()%4)
  780. pad=4-data.size()%4;
  781. r_len+=data.size()+5*4+pad;
  782. } break;
  783. /*case Variant::RESOURCE: {
  784. ERR_EXPLAIN("Can't marshallize resources");
  785. ERR_FAIL_V(ERR_INVALID_DATA); //no, i'm sorry, no go
  786. } break;*/
  787. case Variant::_RID:
  788. case Variant::OBJECT: {
  789. } break;
  790. case Variant::INPUT_EVENT: {
  791. InputEvent ie=p_variant;
  792. if (buf) {
  793. encode_uint32(ie.type,&buf[0]);
  794. encode_uint32(ie.device,&buf[4]);
  795. encode_uint32(0,&buf[8]);
  796. }
  797. int llen=12;
  798. switch(ie.type) {
  799. case InputEvent::KEY: {
  800. if (buf) {
  801. uint32_t mods=0;
  802. if (ie.key.mod.shift)
  803. mods|=KEY_MASK_SHIFT;
  804. if (ie.key.mod.control)
  805. mods|=KEY_MASK_CTRL;
  806. if (ie.key.mod.alt)
  807. mods|=KEY_MASK_ALT;
  808. if (ie.key.mod.meta)
  809. mods|=KEY_MASK_META;
  810. encode_uint32(mods,&buf[llen]);
  811. encode_uint32(ie.key.scancode,&buf[llen+4]);
  812. }
  813. llen+=8;
  814. } break;
  815. case InputEvent::MOUSE_BUTTON: {
  816. if (buf) {
  817. encode_uint32(ie.mouse_button.button_index,&buf[llen]);
  818. }
  819. llen+=4;
  820. } break;
  821. case InputEvent::JOYSTICK_BUTTON: {
  822. if (buf) {
  823. encode_uint32(ie.joy_button.button_index,&buf[llen]);
  824. }
  825. llen+=4;
  826. } break;
  827. case InputEvent::SCREEN_TOUCH: {
  828. if (buf) {
  829. encode_uint32(ie.screen_touch.index,&buf[llen]);
  830. }
  831. llen+=4;
  832. } break;
  833. case InputEvent::JOYSTICK_MOTION: {
  834. if (buf) {
  835. int axis = ie.joy_motion.axis;
  836. encode_uint32(axis,&buf[llen]);
  837. encode_float(ie.joy_motion.axis_value, &buf[llen+4]);
  838. }
  839. llen+=8;
  840. } break;
  841. }
  842. if (buf)
  843. encode_uint32(llen,&buf[8]);
  844. r_len+=llen;
  845. // not supported
  846. } break;
  847. case Variant::DICTIONARY: {
  848. Dictionary d = p_variant;
  849. if (buf) {
  850. encode_uint32(uint32_t(d.size())|(d.is_shared()?0x80000000:0),buf);
  851. buf+=4;
  852. }
  853. r_len+=4;
  854. List<Variant> keys;
  855. d.get_key_list(&keys);
  856. for(List<Variant>::Element *E=keys.front();E;E=E->next()) {
  857. /*
  858. CharString utf8 = E->->utf8();
  859. if (buf) {
  860. encode_uint32(utf8.length()+1,buf);
  861. buf+=4;
  862. copymem(buf,utf8.get_data(),utf8.length()+1);
  863. }
  864. r_len+=4+utf8.length()+1;
  865. while (r_len%4)
  866. r_len++; //pad
  867. */
  868. int len;
  869. encode_variant(E->get(),buf,len);
  870. ERR_FAIL_COND_V(len%4,ERR_BUG);
  871. r_len+=len;
  872. if (buf)
  873. buf += len;
  874. encode_variant(d[E->get()],buf,len);
  875. ERR_FAIL_COND_V(len%4,ERR_BUG);
  876. r_len+=len;
  877. if (buf)
  878. buf += len;
  879. }
  880. } break;
  881. case Variant::ARRAY: {
  882. Array v = p_variant;
  883. if (buf) {
  884. encode_uint32(uint32_t(v.size())|(v.is_shared()?0x80000000:0),buf);
  885. buf+=4;
  886. }
  887. r_len+=4;
  888. for(int i=0;i<v.size();i++) {
  889. int len;
  890. encode_variant(v.get(i),buf,len);
  891. ERR_FAIL_COND_V(len%4,ERR_BUG);
  892. r_len+=len;
  893. if (buf)
  894. buf+=len;
  895. }
  896. } break;
  897. // arrays
  898. case Variant::RAW_ARRAY: {
  899. DVector<uint8_t> data = p_variant;
  900. int datalen=data.size();
  901. int datasize=sizeof(uint8_t);
  902. if (buf) {
  903. encode_uint32(datalen,buf);
  904. buf+=4;
  905. DVector<uint8_t>::Read r = data.read();
  906. copymem(buf,&r[0],datalen*datasize);
  907. }
  908. r_len+=4+datalen*datasize;
  909. while(r_len%4)
  910. r_len++;
  911. } break;
  912. case Variant::INT_ARRAY: {
  913. DVector<int> data = p_variant;
  914. int datalen=data.size();
  915. int datasize=sizeof(int32_t);
  916. if (buf) {
  917. encode_uint32(datalen,buf);
  918. buf+=4;
  919. DVector<int>::Read r = data.read();
  920. for(int i=0;i<datalen;i++)
  921. encode_uint32(r[i],&buf[i*datasize]);
  922. }
  923. r_len+=4+datalen*datasize;
  924. } break;
  925. case Variant::REAL_ARRAY: {
  926. DVector<real_t> data = p_variant;
  927. int datalen=data.size();
  928. int datasize=sizeof(real_t);
  929. if (buf) {
  930. encode_uint32(datalen,buf);
  931. buf+=4;
  932. DVector<real_t>::Read r = data.read();
  933. for(int i=0;i<datalen;i++)
  934. encode_float(r[i],&buf[i*datasize]);
  935. }
  936. r_len+=4+datalen*datasize;
  937. } break;
  938. case Variant::STRING_ARRAY: {
  939. DVector<String> data = p_variant;
  940. int len=data.size();
  941. if (buf) {
  942. encode_uint32(len,buf);
  943. buf+=4;
  944. }
  945. r_len+=4;
  946. for(int i=0;i<len;i++) {
  947. CharString utf8 = data.get(i).utf8();
  948. if (buf) {
  949. encode_uint32(utf8.length()+1,buf);
  950. buf+=4;
  951. copymem(buf,utf8.get_data(),utf8.length()+1);
  952. buf+=utf8.length()+1;
  953. }
  954. r_len+=4+utf8.length()+1;
  955. while (r_len%4) {
  956. r_len++; //pad
  957. if (buf)
  958. buf++;
  959. }
  960. }
  961. } break;
  962. case Variant::VECTOR2_ARRAY: {
  963. DVector<Vector2> data = p_variant;
  964. int len=data.size();
  965. if (buf) {
  966. encode_uint32(len,buf);
  967. buf+=4;
  968. }
  969. r_len+=4;
  970. if (buf) {
  971. for(int i=0;i<len;i++) {
  972. Vector2 v = data.get(i);
  973. encode_float(v.x,&buf[0]);
  974. encode_float(v.y,&buf[4]);
  975. buf+=4*2;
  976. }
  977. }
  978. r_len+=4*2*len;
  979. } break;
  980. case Variant::VECTOR3_ARRAY: {
  981. DVector<Vector3> data = p_variant;
  982. int len=data.size();
  983. if (buf) {
  984. encode_uint32(len,buf);
  985. buf+=4;
  986. }
  987. r_len+=4;
  988. if (buf) {
  989. for(int i=0;i<len;i++) {
  990. Vector3 v = data.get(i);
  991. encode_float(v.x,&buf[0]);
  992. encode_float(v.y,&buf[4]);
  993. encode_float(v.z,&buf[8]);
  994. buf+=4*3;
  995. }
  996. }
  997. r_len+=4*3*len;
  998. } break;
  999. case Variant::COLOR_ARRAY: {
  1000. DVector<Color> data = p_variant;
  1001. int len=data.size();
  1002. if (buf) {
  1003. encode_uint32(len,buf);
  1004. buf+=4;
  1005. }
  1006. r_len+=4;
  1007. if (buf) {
  1008. for(int i=0;i<len;i++) {
  1009. Color c = data.get(i);
  1010. encode_float(c.r,&buf[0]);
  1011. encode_float(c.g,&buf[4]);
  1012. encode_float(c.b,&buf[8]);
  1013. encode_float(c.a,&buf[12]);
  1014. buf+=4*4;
  1015. }
  1016. }
  1017. r_len+=4*4*len;
  1018. } break;
  1019. default: { ERR_FAIL_V(ERR_BUG); }
  1020. }
  1021. return OK;
  1022. }