marshalls.cpp 29 KB

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