marshalls.cpp 32 KB

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