marshalls.cpp 28 KB

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