marshalls.cpp 32 KB

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