marshalls.cpp 51 KB

1234567891011121314151617181920212223242526272829303132333435363738394041424344454647484950515253545556575859606162636465666768697071727374757677787980818283848586878889909192939495969798991001011021031041051061071081091101111121131141151161171181191201211221231241251261271281291301311321331341351361371381391401411421431441451461471481491501511521531541551561571581591601611621631641651661671681691701711721731741751761771781791801811821831841851861871881891901911921931941951961971981992002012022032042052062072082092102112122132142152162172182192202212222232242252262272282292302312322332342352362372382392402412422432442452462472482492502512522532542552562572582592602612622632642652662672682692702712722732742752762772782792802812822832842852862872882892902912922932942952962972982993003013023033043053063073083093103113123133143153163173183193203213223233243253263273283293303313323333343353363373383393403413423433443453463473483493503513523533543553563573583593603613623633643653663673683693703713723733743753763773783793803813823833843853863873883893903913923933943953963973983994004014024034044054064074084094104114124134144154164174184194204214224234244254264274284294304314324334344354364374384394404414424434444454464474484494504514524534544554564574584594604614624634644654664674684694704714724734744754764774784794804814824834844854864874884894904914924934944954964974984995005015025035045055065075085095105115125135145155165175185195205215225235245255265275285295305315325335345355365375385395405415425435445455465475485495505515525535545555565575585595605615625635645655665675685695705715725735745755765775785795805815825835845855865875885895905915925935945955965975985996006016026036046056066076086096106116126136146156166176186196206216226236246256266276286296306316326336346356366376386396406416426436446456466476486496506516526536546556566576586596606616626636646656666676686696706716726736746756766776786796806816826836846856866876886896906916926936946956966976986997007017027037047057067077087097107117127137147157167177187197207217227237247257267277287297307317327337347357367377387397407417427437447457467477487497507517527537547557567577587597607617627637647657667677687697707717727737747757767777787797807817827837847857867877887897907917927937947957967977987998008018028038048058068078088098108118128138148158168178188198208218228238248258268278288298308318328338348358368378388398408418428438448458468478488498508518528538548558568578588598608618628638648658668678688698708718728738748758768778788798808818828838848858868878888898908918928938948958968978988999009019029039049059069079089099109119129139149159169179189199209219229239249259269279289299309319329339349359369379389399409419429439449459469479489499509519529539549559569579589599609619629639649659669679689699709719729739749759769779789799809819829839849859869879889899909919929939949959969979989991000100110021003100410051006100710081009101010111012101310141015101610171018101910201021102210231024102510261027102810291030103110321033103410351036103710381039104010411042104310441045104610471048104910501051105210531054105510561057105810591060106110621063106410651066106710681069107010711072107310741075107610771078107910801081108210831084108510861087108810891090109110921093109410951096109710981099110011011102110311041105110611071108110911101111111211131114111511161117111811191120112111221123112411251126112711281129113011311132113311341135113611371138113911401141114211431144114511461147114811491150115111521153115411551156115711581159116011611162116311641165116611671168116911701171117211731174117511761177117811791180118111821183118411851186118711881189119011911192119311941195119611971198119912001201120212031204120512061207120812091210121112121213121412151216121712181219122012211222122312241225122612271228122912301231123212331234123512361237123812391240124112421243124412451246124712481249125012511252125312541255125612571258125912601261126212631264126512661267126812691270127112721273127412751276127712781279128012811282128312841285128612871288128912901291129212931294129512961297129812991300130113021303130413051306130713081309131013111312131313141315131613171318131913201321132213231324132513261327132813291330133113321333133413351336133713381339134013411342134313441345134613471348134913501351135213531354135513561357135813591360136113621363136413651366136713681369137013711372137313741375137613771378137913801381138213831384138513861387138813891390139113921393139413951396139713981399140014011402140314041405140614071408140914101411141214131414141514161417141814191420142114221423142414251426142714281429143014311432143314341435143614371438143914401441144214431444144514461447144814491450145114521453145414551456145714581459146014611462146314641465146614671468146914701471147214731474147514761477147814791480148114821483148414851486148714881489149014911492149314941495149614971498149915001501150215031504150515061507150815091510151115121513151415151516151715181519152015211522152315241525152615271528152915301531153215331534153515361537153815391540154115421543154415451546154715481549155015511552155315541555155615571558155915601561156215631564156515661567156815691570157115721573157415751576157715781579158015811582158315841585158615871588158915901591159215931594159515961597159815991600160116021603160416051606160716081609161016111612161316141615161616171618161916201621162216231624162516261627162816291630163116321633163416351636163716381639164016411642164316441645164616471648164916501651165216531654165516561657165816591660166116621663166416651666166716681669167016711672167316741675167616771678167916801681168216831684168516861687168816891690169116921693169416951696169716981699170017011702170317041705170617071708170917101711171217131714171517161717171817191720172117221723172417251726172717281729173017311732173317341735173617371738173917401741174217431744174517461747174817491750175117521753175417551756175717581759176017611762176317641765176617671768176917701771177217731774177517761777177817791780178117821783178417851786178717881789179017911792179317941795179617971798179918001801180218031804180518061807180818091810181118121813181418151816181718181819182018211822182318241825182618271828182918301831183218331834183518361837183818391840184118421843184418451846184718481849185018511852185318541855185618571858185918601861186218631864186518661867186818691870187118721873187418751876187718781879188018811882188318841885188618871888188918901891189218931894189518961897189818991900190119021903190419051906190719081909191019111912191319141915191619171918191919201921192219231924192519261927192819291930193119321933193419351936193719381939194019411942194319441945194619471948194919501951195219531954195519561957195819591960196119621963196419651966196719681969197019711972197319741975197619771978197919801981198219831984198519861987198819891990199119921993199419951996199719981999200020012002200320042005200620072008200920102011201220132014201520162017201820192020202120222023202420252026202720282029203020312032203320342035203620372038203920402041204220432044204520462047204820492050205120522053205420552056205720582059206020612062206320642065206620672068206920702071
  1. /**************************************************************************/
  2. /* marshalls.cpp */
  3. /**************************************************************************/
  4. /* This file is part of: */
  5. /* GODOT ENGINE */
  6. /* https://godotengine.org */
  7. /**************************************************************************/
  8. /* Copyright (c) 2014-present Godot Engine contributors (see AUTHORS.md). */
  9. /* Copyright (c) 2007-2014 Juan Linietsky, Ariel Manzur. */
  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/core_string_names.h"
  32. #include "core/io/resource_loader.h"
  33. #include "core/object/ref_counted.h"
  34. #include "core/object/script_language.h"
  35. #include "core/os/keyboard.h"
  36. #include "core/string/print_string.h"
  37. #include <limits.h>
  38. #include <stdio.h>
  39. void EncodedObjectAsID::_bind_methods() {
  40. ClassDB::bind_method(D_METHOD("set_object_id", "id"), &EncodedObjectAsID::set_object_id);
  41. ClassDB::bind_method(D_METHOD("get_object_id"), &EncodedObjectAsID::get_object_id);
  42. ADD_PROPERTY(PropertyInfo(Variant::INT, "object_id"), "set_object_id", "get_object_id");
  43. }
  44. void EncodedObjectAsID::set_object_id(ObjectID p_id) {
  45. id = p_id;
  46. }
  47. ObjectID EncodedObjectAsID::get_object_id() const {
  48. return id;
  49. }
  50. #define ERR_FAIL_ADD_OF(a, b, err) ERR_FAIL_COND_V(((int32_t)(b)) < 0 || ((int32_t)(a)) < 0 || ((int32_t)(a)) > INT_MAX - ((int32_t)(b)), err)
  51. #define ERR_FAIL_MUL_OF(a, b, err) ERR_FAIL_COND_V(((int32_t)(a)) < 0 || ((int32_t)(b)) <= 0 || ((int32_t)(a)) > INT_MAX / ((int32_t)(b)), err)
  52. // Byte 0: `Variant::Type`, byte 1: unused, bytes 2 and 3: additional data.
  53. #define HEADER_TYPE_MASK 0xFF
  54. // For `Variant::INT`, `Variant::FLOAT` and other math types.
  55. #define HEADER_DATA_FLAG_64 (1 << 16)
  56. // For `Variant::OBJECT`.
  57. #define HEADER_DATA_FLAG_OBJECT_AS_ID (1 << 16)
  58. // For `Variant::ARRAY`.
  59. // Occupies bits 16 and 17.
  60. #define HEADER_DATA_FIELD_TYPED_ARRAY_MASK (0b11 << 16)
  61. #define HEADER_DATA_FIELD_TYPED_ARRAY_NONE (0b00 << 16)
  62. #define HEADER_DATA_FIELD_TYPED_ARRAY_BUILTIN (0b01 << 16)
  63. #define HEADER_DATA_FIELD_TYPED_ARRAY_CLASS_NAME (0b10 << 16)
  64. #define HEADER_DATA_FIELD_TYPED_ARRAY_SCRIPT (0b11 << 16)
  65. static Error _decode_string(const uint8_t *&buf, int &len, int *r_len, String &r_string) {
  66. ERR_FAIL_COND_V(len < 4, ERR_INVALID_DATA);
  67. int32_t strlen = decode_uint32(buf);
  68. int32_t pad = 0;
  69. // Handle padding
  70. if (strlen % 4) {
  71. pad = 4 - strlen % 4;
  72. }
  73. buf += 4;
  74. len -= 4;
  75. // Ensure buffer is big enough
  76. ERR_FAIL_ADD_OF(strlen, pad, ERR_FILE_EOF);
  77. ERR_FAIL_COND_V(strlen < 0 || strlen + pad > len, ERR_FILE_EOF);
  78. String str;
  79. ERR_FAIL_COND_V(str.parse_utf8((const char *)buf, strlen) != OK, ERR_INVALID_DATA);
  80. r_string = str;
  81. // Add padding
  82. strlen += pad;
  83. // Update buffer pos, left data count, and return size
  84. buf += strlen;
  85. len -= strlen;
  86. if (r_len) {
  87. (*r_len) += 4 + strlen;
  88. }
  89. return OK;
  90. }
  91. Error decode_variant(Variant &r_variant, const uint8_t *p_buffer, int p_len, int *r_len, bool p_allow_objects, int p_depth) {
  92. ERR_FAIL_COND_V_MSG(p_depth > Variant::MAX_RECURSION_DEPTH, ERR_OUT_OF_MEMORY, "Variant is too deep. Bailing.");
  93. const uint8_t *buf = p_buffer;
  94. int len = p_len;
  95. ERR_FAIL_COND_V(len < 4, ERR_INVALID_DATA);
  96. uint32_t header = decode_uint32(buf);
  97. ERR_FAIL_COND_V((header & HEADER_TYPE_MASK) >= Variant::VARIANT_MAX, ERR_INVALID_DATA);
  98. buf += 4;
  99. len -= 4;
  100. if (r_len) {
  101. *r_len = 4;
  102. }
  103. // Note: We cannot use sizeof(real_t) for decoding, in case a different size is encoded.
  104. // Decoding math types always checks for the encoded size, while encoding always uses compilation setting.
  105. // This does lead to some code duplication for decoding, but compatibility is the priority.
  106. switch (header & HEADER_TYPE_MASK) {
  107. case Variant::NIL: {
  108. r_variant = Variant();
  109. } break;
  110. case Variant::BOOL: {
  111. ERR_FAIL_COND_V(len < 4, ERR_INVALID_DATA);
  112. bool val = decode_uint32(buf);
  113. r_variant = val;
  114. if (r_len) {
  115. (*r_len) += 4;
  116. }
  117. } break;
  118. case Variant::INT: {
  119. if (header & HEADER_DATA_FLAG_64) {
  120. ERR_FAIL_COND_V(len < 8, ERR_INVALID_DATA);
  121. int64_t val = decode_uint64(buf);
  122. r_variant = val;
  123. if (r_len) {
  124. (*r_len) += 8;
  125. }
  126. } else {
  127. ERR_FAIL_COND_V(len < 4, ERR_INVALID_DATA);
  128. int32_t val = decode_uint32(buf);
  129. r_variant = val;
  130. if (r_len) {
  131. (*r_len) += 4;
  132. }
  133. }
  134. } break;
  135. case Variant::FLOAT: {
  136. if (header & HEADER_DATA_FLAG_64) {
  137. ERR_FAIL_COND_V((size_t)len < sizeof(double), ERR_INVALID_DATA);
  138. double val = decode_double(buf);
  139. r_variant = val;
  140. if (r_len) {
  141. (*r_len) += sizeof(double);
  142. }
  143. } else {
  144. ERR_FAIL_COND_V((size_t)len < sizeof(float), ERR_INVALID_DATA);
  145. float val = decode_float(buf);
  146. r_variant = val;
  147. if (r_len) {
  148. (*r_len) += sizeof(float);
  149. }
  150. }
  151. } break;
  152. case Variant::STRING: {
  153. String str;
  154. Error err = _decode_string(buf, len, r_len, str);
  155. if (err) {
  156. return err;
  157. }
  158. r_variant = str;
  159. } break;
  160. // math types
  161. case Variant::VECTOR2: {
  162. Vector2 val;
  163. if (header & HEADER_DATA_FLAG_64) {
  164. ERR_FAIL_COND_V((size_t)len < sizeof(double) * 2, ERR_INVALID_DATA);
  165. val.x = decode_double(&buf[0]);
  166. val.y = decode_double(&buf[sizeof(double)]);
  167. if (r_len) {
  168. (*r_len) += sizeof(double) * 2;
  169. }
  170. } else {
  171. ERR_FAIL_COND_V((size_t)len < sizeof(float) * 2, ERR_INVALID_DATA);
  172. val.x = decode_float(&buf[0]);
  173. val.y = decode_float(&buf[sizeof(float)]);
  174. if (r_len) {
  175. (*r_len) += sizeof(float) * 2;
  176. }
  177. }
  178. r_variant = val;
  179. } break;
  180. case Variant::VECTOR2I: {
  181. ERR_FAIL_COND_V(len < 4 * 2, ERR_INVALID_DATA);
  182. Vector2i val;
  183. val.x = decode_uint32(&buf[0]);
  184. val.y = decode_uint32(&buf[4]);
  185. r_variant = val;
  186. if (r_len) {
  187. (*r_len) += 4 * 2;
  188. }
  189. } break;
  190. case Variant::RECT2: {
  191. Rect2 val;
  192. if (header & HEADER_DATA_FLAG_64) {
  193. ERR_FAIL_COND_V((size_t)len < sizeof(double) * 4, ERR_INVALID_DATA);
  194. val.position.x = decode_double(&buf[0]);
  195. val.position.y = decode_double(&buf[sizeof(double)]);
  196. val.size.x = decode_double(&buf[sizeof(double) * 2]);
  197. val.size.y = decode_double(&buf[sizeof(double) * 3]);
  198. if (r_len) {
  199. (*r_len) += sizeof(double) * 4;
  200. }
  201. } else {
  202. ERR_FAIL_COND_V((size_t)len < sizeof(float) * 4, ERR_INVALID_DATA);
  203. val.position.x = decode_float(&buf[0]);
  204. val.position.y = decode_float(&buf[sizeof(float)]);
  205. val.size.x = decode_float(&buf[sizeof(float) * 2]);
  206. val.size.y = decode_float(&buf[sizeof(float) * 3]);
  207. if (r_len) {
  208. (*r_len) += sizeof(float) * 4;
  209. }
  210. }
  211. r_variant = val;
  212. } break;
  213. case Variant::RECT2I: {
  214. ERR_FAIL_COND_V(len < 4 * 4, ERR_INVALID_DATA);
  215. Rect2i val;
  216. val.position.x = decode_uint32(&buf[0]);
  217. val.position.y = decode_uint32(&buf[4]);
  218. val.size.x = decode_uint32(&buf[8]);
  219. val.size.y = decode_uint32(&buf[12]);
  220. r_variant = val;
  221. if (r_len) {
  222. (*r_len) += 4 * 4;
  223. }
  224. } break;
  225. case Variant::VECTOR3: {
  226. Vector3 val;
  227. if (header & HEADER_DATA_FLAG_64) {
  228. ERR_FAIL_COND_V((size_t)len < sizeof(double) * 3, ERR_INVALID_DATA);
  229. val.x = decode_double(&buf[0]);
  230. val.y = decode_double(&buf[sizeof(double)]);
  231. val.z = decode_double(&buf[sizeof(double) * 2]);
  232. if (r_len) {
  233. (*r_len) += sizeof(double) * 3;
  234. }
  235. } else {
  236. ERR_FAIL_COND_V((size_t)len < sizeof(float) * 3, ERR_INVALID_DATA);
  237. val.x = decode_float(&buf[0]);
  238. val.y = decode_float(&buf[sizeof(float)]);
  239. val.z = decode_float(&buf[sizeof(float) * 2]);
  240. if (r_len) {
  241. (*r_len) += sizeof(float) * 3;
  242. }
  243. }
  244. r_variant = val;
  245. } break;
  246. case Variant::VECTOR3I: {
  247. ERR_FAIL_COND_V(len < 4 * 3, ERR_INVALID_DATA);
  248. Vector3i val;
  249. val.x = decode_uint32(&buf[0]);
  250. val.y = decode_uint32(&buf[4]);
  251. val.z = decode_uint32(&buf[8]);
  252. r_variant = val;
  253. if (r_len) {
  254. (*r_len) += 4 * 3;
  255. }
  256. } break;
  257. case Variant::VECTOR4: {
  258. Vector4 val;
  259. if (header & HEADER_DATA_FLAG_64) {
  260. ERR_FAIL_COND_V((size_t)len < sizeof(double) * 4, ERR_INVALID_DATA);
  261. val.x = decode_double(&buf[0]);
  262. val.y = decode_double(&buf[sizeof(double)]);
  263. val.z = decode_double(&buf[sizeof(double) * 2]);
  264. val.w = decode_double(&buf[sizeof(double) * 3]);
  265. if (r_len) {
  266. (*r_len) += sizeof(double) * 4;
  267. }
  268. } else {
  269. ERR_FAIL_COND_V((size_t)len < sizeof(float) * 4, ERR_INVALID_DATA);
  270. val.x = decode_float(&buf[0]);
  271. val.y = decode_float(&buf[sizeof(float)]);
  272. val.z = decode_float(&buf[sizeof(float) * 2]);
  273. val.w = decode_float(&buf[sizeof(float) * 3]);
  274. if (r_len) {
  275. (*r_len) += sizeof(float) * 4;
  276. }
  277. }
  278. r_variant = val;
  279. } break;
  280. case Variant::VECTOR4I: {
  281. ERR_FAIL_COND_V(len < 4 * 4, ERR_INVALID_DATA);
  282. Vector4i val;
  283. val.x = decode_uint32(&buf[0]);
  284. val.y = decode_uint32(&buf[4]);
  285. val.z = decode_uint32(&buf[8]);
  286. val.w = decode_uint32(&buf[12]);
  287. r_variant = val;
  288. if (r_len) {
  289. (*r_len) += 4 * 4;
  290. }
  291. } break;
  292. case Variant::TRANSFORM2D: {
  293. Transform2D val;
  294. if (header & HEADER_DATA_FLAG_64) {
  295. ERR_FAIL_COND_V((size_t)len < sizeof(double) * 6, ERR_INVALID_DATA);
  296. for (int i = 0; i < 3; i++) {
  297. for (int j = 0; j < 2; j++) {
  298. val.columns[i][j] = decode_double(&buf[(i * 2 + j) * sizeof(double)]);
  299. }
  300. }
  301. if (r_len) {
  302. (*r_len) += sizeof(double) * 6;
  303. }
  304. } else {
  305. ERR_FAIL_COND_V((size_t)len < sizeof(float) * 6, ERR_INVALID_DATA);
  306. for (int i = 0; i < 3; i++) {
  307. for (int j = 0; j < 2; j++) {
  308. val.columns[i][j] = decode_float(&buf[(i * 2 + j) * sizeof(float)]);
  309. }
  310. }
  311. if (r_len) {
  312. (*r_len) += sizeof(float) * 6;
  313. }
  314. }
  315. r_variant = val;
  316. } break;
  317. case Variant::PLANE: {
  318. Plane val;
  319. if (header & HEADER_DATA_FLAG_64) {
  320. ERR_FAIL_COND_V((size_t)len < sizeof(double) * 4, ERR_INVALID_DATA);
  321. val.normal.x = decode_double(&buf[0]);
  322. val.normal.y = decode_double(&buf[sizeof(double)]);
  323. val.normal.z = decode_double(&buf[sizeof(double) * 2]);
  324. val.d = decode_double(&buf[sizeof(double) * 3]);
  325. if (r_len) {
  326. (*r_len) += sizeof(double) * 4;
  327. }
  328. } else {
  329. ERR_FAIL_COND_V((size_t)len < sizeof(float) * 4, ERR_INVALID_DATA);
  330. val.normal.x = decode_float(&buf[0]);
  331. val.normal.y = decode_float(&buf[sizeof(float)]);
  332. val.normal.z = decode_float(&buf[sizeof(float) * 2]);
  333. val.d = decode_float(&buf[sizeof(float) * 3]);
  334. if (r_len) {
  335. (*r_len) += sizeof(float) * 4;
  336. }
  337. }
  338. r_variant = val;
  339. } break;
  340. case Variant::QUATERNION: {
  341. Quaternion val;
  342. if (header & HEADER_DATA_FLAG_64) {
  343. ERR_FAIL_COND_V((size_t)len < sizeof(double) * 4, ERR_INVALID_DATA);
  344. val.x = decode_double(&buf[0]);
  345. val.y = decode_double(&buf[sizeof(double)]);
  346. val.z = decode_double(&buf[sizeof(double) * 2]);
  347. val.w = decode_double(&buf[sizeof(double) * 3]);
  348. if (r_len) {
  349. (*r_len) += sizeof(double) * 4;
  350. }
  351. } else {
  352. ERR_FAIL_COND_V((size_t)len < sizeof(float) * 4, ERR_INVALID_DATA);
  353. val.x = decode_float(&buf[0]);
  354. val.y = decode_float(&buf[sizeof(float)]);
  355. val.z = decode_float(&buf[sizeof(float) * 2]);
  356. val.w = decode_float(&buf[sizeof(float) * 3]);
  357. if (r_len) {
  358. (*r_len) += sizeof(float) * 4;
  359. }
  360. }
  361. r_variant = val;
  362. } break;
  363. case Variant::AABB: {
  364. AABB val;
  365. if (header & HEADER_DATA_FLAG_64) {
  366. ERR_FAIL_COND_V((size_t)len < sizeof(double) * 6, ERR_INVALID_DATA);
  367. val.position.x = decode_double(&buf[0]);
  368. val.position.y = decode_double(&buf[sizeof(double)]);
  369. val.position.z = decode_double(&buf[sizeof(double) * 2]);
  370. val.size.x = decode_double(&buf[sizeof(double) * 3]);
  371. val.size.y = decode_double(&buf[sizeof(double) * 4]);
  372. val.size.z = decode_double(&buf[sizeof(double) * 5]);
  373. if (r_len) {
  374. (*r_len) += sizeof(double) * 6;
  375. }
  376. } else {
  377. ERR_FAIL_COND_V((size_t)len < sizeof(float) * 6, ERR_INVALID_DATA);
  378. val.position.x = decode_float(&buf[0]);
  379. val.position.y = decode_float(&buf[sizeof(float)]);
  380. val.position.z = decode_float(&buf[sizeof(float) * 2]);
  381. val.size.x = decode_float(&buf[sizeof(float) * 3]);
  382. val.size.y = decode_float(&buf[sizeof(float) * 4]);
  383. val.size.z = decode_float(&buf[sizeof(float) * 5]);
  384. if (r_len) {
  385. (*r_len) += sizeof(float) * 6;
  386. }
  387. }
  388. r_variant = val;
  389. } break;
  390. case Variant::BASIS: {
  391. Basis val;
  392. if (header & HEADER_DATA_FLAG_64) {
  393. ERR_FAIL_COND_V((size_t)len < sizeof(double) * 9, ERR_INVALID_DATA);
  394. for (int i = 0; i < 3; i++) {
  395. for (int j = 0; j < 3; j++) {
  396. val.rows[i][j] = decode_double(&buf[(i * 3 + j) * sizeof(double)]);
  397. }
  398. }
  399. if (r_len) {
  400. (*r_len) += sizeof(double) * 9;
  401. }
  402. } else {
  403. ERR_FAIL_COND_V((size_t)len < sizeof(float) * 9, ERR_INVALID_DATA);
  404. for (int i = 0; i < 3; i++) {
  405. for (int j = 0; j < 3; j++) {
  406. val.rows[i][j] = decode_float(&buf[(i * 3 + j) * sizeof(float)]);
  407. }
  408. }
  409. if (r_len) {
  410. (*r_len) += sizeof(float) * 9;
  411. }
  412. }
  413. r_variant = val;
  414. } break;
  415. case Variant::TRANSFORM3D: {
  416. Transform3D val;
  417. if (header & HEADER_DATA_FLAG_64) {
  418. ERR_FAIL_COND_V((size_t)len < sizeof(double) * 12, ERR_INVALID_DATA);
  419. for (int i = 0; i < 3; i++) {
  420. for (int j = 0; j < 3; j++) {
  421. val.basis.rows[i][j] = decode_double(&buf[(i * 3 + j) * sizeof(double)]);
  422. }
  423. }
  424. val.origin[0] = decode_double(&buf[sizeof(double) * 9]);
  425. val.origin[1] = decode_double(&buf[sizeof(double) * 10]);
  426. val.origin[2] = decode_double(&buf[sizeof(double) * 11]);
  427. if (r_len) {
  428. (*r_len) += sizeof(double) * 12;
  429. }
  430. } else {
  431. ERR_FAIL_COND_V((size_t)len < sizeof(float) * 12, ERR_INVALID_DATA);
  432. for (int i = 0; i < 3; i++) {
  433. for (int j = 0; j < 3; j++) {
  434. val.basis.rows[i][j] = decode_float(&buf[(i * 3 + j) * sizeof(float)]);
  435. }
  436. }
  437. val.origin[0] = decode_float(&buf[sizeof(float) * 9]);
  438. val.origin[1] = decode_float(&buf[sizeof(float) * 10]);
  439. val.origin[2] = decode_float(&buf[sizeof(float) * 11]);
  440. if (r_len) {
  441. (*r_len) += sizeof(float) * 12;
  442. }
  443. }
  444. r_variant = val;
  445. } break;
  446. case Variant::PROJECTION: {
  447. Projection val;
  448. if (header & HEADER_DATA_FLAG_64) {
  449. ERR_FAIL_COND_V((size_t)len < sizeof(double) * 16, ERR_INVALID_DATA);
  450. for (int i = 0; i < 4; i++) {
  451. for (int j = 0; j < 4; j++) {
  452. val.columns[i][j] = decode_double(&buf[(i * 4 + j) * sizeof(double)]);
  453. }
  454. }
  455. if (r_len) {
  456. (*r_len) += sizeof(double) * 16;
  457. }
  458. } else {
  459. ERR_FAIL_COND_V((size_t)len < sizeof(float) * 16, ERR_INVALID_DATA);
  460. for (int i = 0; i < 4; i++) {
  461. for (int j = 0; j < 4; j++) {
  462. val.columns[i][j] = decode_float(&buf[(i * 4 + j) * sizeof(float)]);
  463. }
  464. }
  465. if (r_len) {
  466. (*r_len) += sizeof(float) * 16;
  467. }
  468. }
  469. r_variant = val;
  470. } break;
  471. // misc types
  472. case Variant::COLOR: {
  473. ERR_FAIL_COND_V(len < 4 * 4, ERR_INVALID_DATA);
  474. Color val;
  475. val.r = decode_float(&buf[0]);
  476. val.g = decode_float(&buf[4]);
  477. val.b = decode_float(&buf[8]);
  478. val.a = decode_float(&buf[12]);
  479. r_variant = val;
  480. if (r_len) {
  481. (*r_len) += 4 * 4; // Colors should always be in single-precision.
  482. }
  483. } break;
  484. case Variant::STRING_NAME: {
  485. String str;
  486. Error err = _decode_string(buf, len, r_len, str);
  487. if (err) {
  488. return err;
  489. }
  490. r_variant = StringName(str);
  491. } break;
  492. case Variant::NODE_PATH: {
  493. ERR_FAIL_COND_V(len < 4, ERR_INVALID_DATA);
  494. int32_t strlen = decode_uint32(buf);
  495. if (strlen & 0x80000000) {
  496. //new format
  497. ERR_FAIL_COND_V(len < 12, ERR_INVALID_DATA);
  498. Vector<StringName> names;
  499. Vector<StringName> subnames;
  500. uint32_t namecount = strlen &= 0x7FFFFFFF;
  501. uint32_t subnamecount = decode_uint32(buf + 4);
  502. uint32_t np_flags = decode_uint32(buf + 8);
  503. len -= 12;
  504. buf += 12;
  505. if (np_flags & 2) { // Obsolete format with property separate from subpath.
  506. subnamecount++;
  507. }
  508. uint32_t total = namecount + subnamecount;
  509. if (r_len) {
  510. (*r_len) += 12;
  511. }
  512. for (uint32_t i = 0; i < total; i++) {
  513. String str;
  514. Error err = _decode_string(buf, len, r_len, str);
  515. if (err) {
  516. return err;
  517. }
  518. if (i < namecount) {
  519. names.push_back(str);
  520. } else {
  521. subnames.push_back(str);
  522. }
  523. }
  524. r_variant = NodePath(names, subnames, np_flags & 1);
  525. } else {
  526. //old format, just a string
  527. ERR_FAIL_V(ERR_INVALID_DATA);
  528. }
  529. } break;
  530. case Variant::RID: {
  531. ERR_FAIL_COND_V(len < 8, ERR_INVALID_DATA);
  532. uint64_t id = decode_uint64(buf);
  533. if (r_len) {
  534. (*r_len) += 8;
  535. }
  536. r_variant = RID::from_uint64(id);
  537. } break;
  538. case Variant::OBJECT: {
  539. if (header & HEADER_DATA_FLAG_OBJECT_AS_ID) {
  540. // This _is_ allowed.
  541. ERR_FAIL_COND_V(len < 8, ERR_INVALID_DATA);
  542. ObjectID val = ObjectID(decode_uint64(buf));
  543. if (r_len) {
  544. (*r_len) += 8;
  545. }
  546. if (val.is_null()) {
  547. r_variant = (Object *)nullptr;
  548. } else {
  549. Ref<EncodedObjectAsID> obj_as_id;
  550. obj_as_id.instantiate();
  551. obj_as_id->set_object_id(val);
  552. r_variant = obj_as_id;
  553. }
  554. } else {
  555. ERR_FAIL_COND_V(!p_allow_objects, ERR_UNAUTHORIZED);
  556. String str;
  557. Error err = _decode_string(buf, len, r_len, str);
  558. if (err) {
  559. return err;
  560. }
  561. if (str.is_empty()) {
  562. r_variant = (Object *)nullptr;
  563. } else {
  564. ERR_FAIL_COND_V(!ClassDB::can_instantiate(str), ERR_INVALID_DATA);
  565. Object *obj = ClassDB::instantiate(str);
  566. ERR_FAIL_NULL_V(obj, ERR_UNAVAILABLE);
  567. // Avoid premature free `RefCounted`. This must be done before properties are initialized,
  568. // since script functions (setters, implicit initializer) may be called. See GH-68666.
  569. Variant variant;
  570. if (Object::cast_to<RefCounted>(obj)) {
  571. Ref<RefCounted> ref = Ref<RefCounted>(Object::cast_to<RefCounted>(obj));
  572. variant = ref;
  573. } else {
  574. variant = obj;
  575. }
  576. ERR_FAIL_COND_V(len < 4, ERR_INVALID_DATA);
  577. int32_t count = decode_uint32(buf);
  578. buf += 4;
  579. len -= 4;
  580. if (r_len) {
  581. (*r_len) += 4; // Size of count number.
  582. }
  583. for (int i = 0; i < count; i++) {
  584. str = String();
  585. err = _decode_string(buf, len, r_len, str);
  586. if (err) {
  587. return err;
  588. }
  589. Variant value;
  590. int used;
  591. err = decode_variant(value, buf, len, &used, p_allow_objects, p_depth + 1);
  592. if (err) {
  593. return err;
  594. }
  595. buf += used;
  596. len -= used;
  597. if (r_len) {
  598. (*r_len) += used;
  599. }
  600. if (str == "script" && value.get_type() != Variant::NIL) {
  601. ERR_FAIL_COND_V_MSG(value.get_type() != Variant::STRING, ERR_INVALID_DATA, "Invalid value for \"script\" property, expected script path as String.");
  602. String path = value;
  603. ERR_FAIL_COND_V_MSG(path.is_empty() || !path.begins_with("res://") || !ResourceLoader::exists(path, "Script"), ERR_INVALID_DATA, "Invalid script path: '" + path + "'.");
  604. Ref<Script> script = ResourceLoader::load(path, "Script");
  605. ERR_FAIL_COND_V_MSG(script.is_null(), ERR_INVALID_DATA, "Can't load script at path: '" + path + "'.");
  606. obj->set_script(script);
  607. } else {
  608. obj->set(str, value);
  609. }
  610. }
  611. r_variant = variant;
  612. }
  613. }
  614. } break;
  615. case Variant::CALLABLE: {
  616. r_variant = Callable();
  617. } break;
  618. case Variant::SIGNAL: {
  619. String name;
  620. Error err = _decode_string(buf, len, r_len, name);
  621. if (err) {
  622. return err;
  623. }
  624. ERR_FAIL_COND_V(len < 8, ERR_INVALID_DATA);
  625. ObjectID id = ObjectID(decode_uint64(buf));
  626. if (r_len) {
  627. (*r_len) += 8;
  628. }
  629. r_variant = Signal(id, StringName(name));
  630. } break;
  631. case Variant::DICTIONARY: {
  632. ERR_FAIL_COND_V(len < 4, ERR_INVALID_DATA);
  633. int32_t count = decode_uint32(buf);
  634. // bool shared = count&0x80000000;
  635. count &= 0x7FFFFFFF;
  636. buf += 4;
  637. len -= 4;
  638. if (r_len) {
  639. (*r_len) += 4; // Size of count number.
  640. }
  641. Dictionary d;
  642. for (int i = 0; i < count; i++) {
  643. Variant key, value;
  644. int used;
  645. Error err = decode_variant(key, buf, len, &used, p_allow_objects, p_depth + 1);
  646. ERR_FAIL_COND_V_MSG(err != OK, err, "Error when trying to decode Variant.");
  647. buf += used;
  648. len -= used;
  649. if (r_len) {
  650. (*r_len) += used;
  651. }
  652. err = decode_variant(value, buf, len, &used, p_allow_objects, p_depth + 1);
  653. ERR_FAIL_COND_V_MSG(err != OK, err, "Error when trying to decode Variant.");
  654. buf += used;
  655. len -= used;
  656. if (r_len) {
  657. (*r_len) += used;
  658. }
  659. d[key] = value;
  660. }
  661. r_variant = d;
  662. } break;
  663. case Variant::ARRAY: {
  664. Variant::Type builtin_type = Variant::VARIANT_MAX;
  665. StringName class_name;
  666. Ref<Script> script;
  667. switch (header & HEADER_DATA_FIELD_TYPED_ARRAY_MASK) {
  668. case HEADER_DATA_FIELD_TYPED_ARRAY_NONE:
  669. break; // Untyped array.
  670. case HEADER_DATA_FIELD_TYPED_ARRAY_BUILTIN: {
  671. ERR_FAIL_COND_V(len < 4, ERR_INVALID_DATA);
  672. int32_t bt = decode_uint32(buf);
  673. buf += 4;
  674. len -= 4;
  675. if (r_len) {
  676. (*r_len) += 4;
  677. }
  678. ERR_FAIL_INDEX_V(bt, Variant::VARIANT_MAX, ERR_INVALID_DATA);
  679. builtin_type = (Variant::Type)bt;
  680. if (!p_allow_objects && builtin_type == Variant::OBJECT) {
  681. class_name = EncodedObjectAsID::get_class_static();
  682. }
  683. } break;
  684. case HEADER_DATA_FIELD_TYPED_ARRAY_CLASS_NAME: {
  685. String str;
  686. Error err = _decode_string(buf, len, r_len, str);
  687. if (err) {
  688. return err;
  689. }
  690. builtin_type = Variant::OBJECT;
  691. if (p_allow_objects) {
  692. class_name = str;
  693. } else {
  694. class_name = EncodedObjectAsID::get_class_static();
  695. }
  696. } break;
  697. case HEADER_DATA_FIELD_TYPED_ARRAY_SCRIPT: {
  698. String path;
  699. Error err = _decode_string(buf, len, r_len, path);
  700. if (err) {
  701. return err;
  702. }
  703. builtin_type = Variant::OBJECT;
  704. if (p_allow_objects) {
  705. ERR_FAIL_COND_V_MSG(path.is_empty() || !path.begins_with("res://") || !ResourceLoader::exists(path, "Script"), ERR_INVALID_DATA, "Invalid script path: '" + path + "'.");
  706. script = ResourceLoader::load(path, "Script");
  707. ERR_FAIL_COND_V_MSG(script.is_null(), ERR_INVALID_DATA, "Can't load script at path: '" + path + "'.");
  708. class_name = script->get_instance_base_type();
  709. } else {
  710. class_name = EncodedObjectAsID::get_class_static();
  711. }
  712. } break;
  713. default:
  714. ERR_FAIL_V(ERR_INVALID_DATA); // Future proofing.
  715. }
  716. ERR_FAIL_COND_V(len < 4, ERR_INVALID_DATA);
  717. int32_t count = decode_uint32(buf);
  718. // bool shared = count&0x80000000;
  719. count &= 0x7FFFFFFF;
  720. buf += 4;
  721. len -= 4;
  722. if (r_len) {
  723. (*r_len) += 4; // Size of count number.
  724. }
  725. Array varr;
  726. if (builtin_type != Variant::VARIANT_MAX) {
  727. varr.set_typed(builtin_type, class_name, script);
  728. }
  729. for (int i = 0; i < count; i++) {
  730. int used = 0;
  731. Variant v;
  732. Error err = decode_variant(v, buf, len, &used, p_allow_objects, p_depth + 1);
  733. ERR_FAIL_COND_V_MSG(err != OK, err, "Error when trying to decode Variant.");
  734. buf += used;
  735. len -= used;
  736. varr.push_back(v);
  737. if (r_len) {
  738. (*r_len) += used;
  739. }
  740. }
  741. r_variant = varr;
  742. } break;
  743. // arrays
  744. case Variant::PACKED_BYTE_ARRAY: {
  745. ERR_FAIL_COND_V(len < 4, ERR_INVALID_DATA);
  746. int32_t count = decode_uint32(buf);
  747. buf += 4;
  748. len -= 4;
  749. ERR_FAIL_COND_V(count < 0 || count > len, ERR_INVALID_DATA);
  750. Vector<uint8_t> data;
  751. if (count) {
  752. data.resize(count);
  753. uint8_t *w = data.ptrw();
  754. for (int32_t i = 0; i < count; i++) {
  755. w[i] = buf[i];
  756. }
  757. }
  758. r_variant = data;
  759. if (r_len) {
  760. if (count % 4) {
  761. (*r_len) += 4 - count % 4;
  762. }
  763. (*r_len) += 4 + count;
  764. }
  765. } break;
  766. case Variant::PACKED_INT32_ARRAY: {
  767. ERR_FAIL_COND_V(len < 4, ERR_INVALID_DATA);
  768. int32_t count = decode_uint32(buf);
  769. buf += 4;
  770. len -= 4;
  771. ERR_FAIL_MUL_OF(count, 4, ERR_INVALID_DATA);
  772. ERR_FAIL_COND_V(count < 0 || count * 4 > len, ERR_INVALID_DATA);
  773. Vector<int32_t> data;
  774. if (count) {
  775. //const int*rbuf=(const int*)buf;
  776. data.resize(count);
  777. int32_t *w = data.ptrw();
  778. for (int32_t i = 0; i < count; i++) {
  779. w[i] = decode_uint32(&buf[i * 4]);
  780. }
  781. }
  782. r_variant = Variant(data);
  783. if (r_len) {
  784. (*r_len) += 4 + count * sizeof(int32_t);
  785. }
  786. } break;
  787. case Variant::PACKED_INT64_ARRAY: {
  788. ERR_FAIL_COND_V(len < 4, ERR_INVALID_DATA);
  789. int32_t count = decode_uint32(buf);
  790. buf += 4;
  791. len -= 4;
  792. ERR_FAIL_MUL_OF(count, 8, ERR_INVALID_DATA);
  793. ERR_FAIL_COND_V(count < 0 || count * 8 > len, ERR_INVALID_DATA);
  794. Vector<int64_t> data;
  795. if (count) {
  796. //const int*rbuf=(const int*)buf;
  797. data.resize(count);
  798. int64_t *w = data.ptrw();
  799. for (int64_t i = 0; i < count; i++) {
  800. w[i] = decode_uint64(&buf[i * 8]);
  801. }
  802. }
  803. r_variant = Variant(data);
  804. if (r_len) {
  805. (*r_len) += 4 + count * sizeof(int64_t);
  806. }
  807. } break;
  808. case Variant::PACKED_FLOAT32_ARRAY: {
  809. ERR_FAIL_COND_V(len < 4, ERR_INVALID_DATA);
  810. int32_t count = decode_uint32(buf);
  811. buf += 4;
  812. len -= 4;
  813. ERR_FAIL_MUL_OF(count, 4, ERR_INVALID_DATA);
  814. ERR_FAIL_COND_V(count < 0 || count * 4 > len, ERR_INVALID_DATA);
  815. Vector<float> data;
  816. if (count) {
  817. //const float*rbuf=(const float*)buf;
  818. data.resize(count);
  819. float *w = data.ptrw();
  820. for (int32_t i = 0; i < count; i++) {
  821. w[i] = decode_float(&buf[i * 4]);
  822. }
  823. }
  824. r_variant = data;
  825. if (r_len) {
  826. (*r_len) += 4 + count * sizeof(float);
  827. }
  828. } break;
  829. case Variant::PACKED_FLOAT64_ARRAY: {
  830. ERR_FAIL_COND_V(len < 4, ERR_INVALID_DATA);
  831. int32_t count = decode_uint32(buf);
  832. buf += 4;
  833. len -= 4;
  834. ERR_FAIL_MUL_OF(count, 8, ERR_INVALID_DATA);
  835. ERR_FAIL_COND_V(count < 0 || count * 8 > len, ERR_INVALID_DATA);
  836. Vector<double> data;
  837. if (count) {
  838. data.resize(count);
  839. double *w = data.ptrw();
  840. for (int64_t i = 0; i < count; i++) {
  841. w[i] = decode_double(&buf[i * 8]);
  842. }
  843. }
  844. r_variant = data;
  845. if (r_len) {
  846. (*r_len) += 4 + count * sizeof(double);
  847. }
  848. } break;
  849. case Variant::PACKED_STRING_ARRAY: {
  850. ERR_FAIL_COND_V(len < 4, ERR_INVALID_DATA);
  851. int32_t count = decode_uint32(buf);
  852. Vector<String> strings;
  853. buf += 4;
  854. len -= 4;
  855. if (r_len) {
  856. (*r_len) += 4; // Size of count number.
  857. }
  858. for (int32_t i = 0; i < count; i++) {
  859. String str;
  860. Error err = _decode_string(buf, len, r_len, str);
  861. if (err) {
  862. return err;
  863. }
  864. strings.push_back(str);
  865. }
  866. r_variant = strings;
  867. } break;
  868. case Variant::PACKED_VECTOR2_ARRAY: {
  869. ERR_FAIL_COND_V(len < 4, ERR_INVALID_DATA);
  870. int32_t count = decode_uint32(buf);
  871. buf += 4;
  872. len -= 4;
  873. Vector<Vector2> varray;
  874. if (header & HEADER_DATA_FLAG_64) {
  875. ERR_FAIL_MUL_OF(count, sizeof(double) * 2, ERR_INVALID_DATA);
  876. ERR_FAIL_COND_V(count < 0 || count * sizeof(double) * 2 > (size_t)len, ERR_INVALID_DATA);
  877. if (r_len) {
  878. (*r_len) += 4; // Size of count number.
  879. }
  880. if (count) {
  881. varray.resize(count);
  882. Vector2 *w = varray.ptrw();
  883. for (int32_t i = 0; i < count; i++) {
  884. w[i].x = decode_double(buf + i * sizeof(double) * 2 + sizeof(double) * 0);
  885. w[i].y = decode_double(buf + i * sizeof(double) * 2 + sizeof(double) * 1);
  886. }
  887. int adv = sizeof(double) * 2 * count;
  888. if (r_len) {
  889. (*r_len) += adv;
  890. }
  891. len -= adv;
  892. buf += adv;
  893. }
  894. } else {
  895. ERR_FAIL_MUL_OF(count, sizeof(float) * 2, ERR_INVALID_DATA);
  896. ERR_FAIL_COND_V(count < 0 || count * sizeof(float) * 2 > (size_t)len, ERR_INVALID_DATA);
  897. if (r_len) {
  898. (*r_len) += 4; // Size of count number.
  899. }
  900. if (count) {
  901. varray.resize(count);
  902. Vector2 *w = varray.ptrw();
  903. for (int32_t i = 0; i < count; i++) {
  904. w[i].x = decode_float(buf + i * sizeof(float) * 2 + sizeof(float) * 0);
  905. w[i].y = decode_float(buf + i * sizeof(float) * 2 + sizeof(float) * 1);
  906. }
  907. int adv = sizeof(float) * 2 * count;
  908. if (r_len) {
  909. (*r_len) += adv;
  910. }
  911. }
  912. }
  913. r_variant = varray;
  914. } break;
  915. case Variant::PACKED_VECTOR3_ARRAY: {
  916. ERR_FAIL_COND_V(len < 4, ERR_INVALID_DATA);
  917. int32_t count = decode_uint32(buf);
  918. buf += 4;
  919. len -= 4;
  920. Vector<Vector3> varray;
  921. if (header & HEADER_DATA_FLAG_64) {
  922. ERR_FAIL_MUL_OF(count, sizeof(double) * 3, ERR_INVALID_DATA);
  923. ERR_FAIL_COND_V(count < 0 || count * sizeof(double) * 3 > (size_t)len, ERR_INVALID_DATA);
  924. if (r_len) {
  925. (*r_len) += 4; // Size of count number.
  926. }
  927. if (count) {
  928. varray.resize(count);
  929. Vector3 *w = varray.ptrw();
  930. for (int32_t i = 0; i < count; i++) {
  931. w[i].x = decode_double(buf + i * sizeof(double) * 3 + sizeof(double) * 0);
  932. w[i].y = decode_double(buf + i * sizeof(double) * 3 + sizeof(double) * 1);
  933. w[i].z = decode_double(buf + i * sizeof(double) * 3 + sizeof(double) * 2);
  934. }
  935. int adv = sizeof(double) * 3 * count;
  936. if (r_len) {
  937. (*r_len) += adv;
  938. }
  939. len -= adv;
  940. buf += adv;
  941. }
  942. } else {
  943. ERR_FAIL_MUL_OF(count, sizeof(float) * 3, ERR_INVALID_DATA);
  944. ERR_FAIL_COND_V(count < 0 || count * sizeof(float) * 3 > (size_t)len, ERR_INVALID_DATA);
  945. if (r_len) {
  946. (*r_len) += 4; // Size of count number.
  947. }
  948. if (count) {
  949. varray.resize(count);
  950. Vector3 *w = varray.ptrw();
  951. for (int32_t i = 0; i < count; i++) {
  952. w[i].x = decode_float(buf + i * sizeof(float) * 3 + sizeof(float) * 0);
  953. w[i].y = decode_float(buf + i * sizeof(float) * 3 + sizeof(float) * 1);
  954. w[i].z = decode_float(buf + i * sizeof(float) * 3 + sizeof(float) * 2);
  955. }
  956. int adv = sizeof(float) * 3 * count;
  957. if (r_len) {
  958. (*r_len) += adv;
  959. }
  960. len -= adv;
  961. buf += adv;
  962. }
  963. }
  964. r_variant = varray;
  965. } break;
  966. case Variant::PACKED_COLOR_ARRAY: {
  967. ERR_FAIL_COND_V(len < 4, ERR_INVALID_DATA);
  968. int32_t count = decode_uint32(buf);
  969. buf += 4;
  970. len -= 4;
  971. ERR_FAIL_MUL_OF(count, 4 * 4, ERR_INVALID_DATA);
  972. ERR_FAIL_COND_V(count < 0 || count * 4 * 4 > len, ERR_INVALID_DATA);
  973. Vector<Color> carray;
  974. if (r_len) {
  975. (*r_len) += 4; // Size of count number.
  976. }
  977. if (count) {
  978. carray.resize(count);
  979. Color *w = carray.ptrw();
  980. for (int32_t i = 0; i < count; i++) {
  981. // Colors should always be in single-precision.
  982. w[i].r = decode_float(buf + i * 4 * 4 + 4 * 0);
  983. w[i].g = decode_float(buf + i * 4 * 4 + 4 * 1);
  984. w[i].b = decode_float(buf + i * 4 * 4 + 4 * 2);
  985. w[i].a = decode_float(buf + i * 4 * 4 + 4 * 3);
  986. }
  987. int adv = 4 * 4 * count;
  988. if (r_len) {
  989. (*r_len) += adv;
  990. }
  991. }
  992. r_variant = carray;
  993. } break;
  994. case Variant::PACKED_VECTOR4_ARRAY: {
  995. ERR_FAIL_COND_V(len < 4, ERR_INVALID_DATA);
  996. int32_t count = decode_uint32(buf);
  997. buf += 4;
  998. len -= 4;
  999. Vector<Vector4> varray;
  1000. if (header & HEADER_DATA_FLAG_64) {
  1001. ERR_FAIL_MUL_OF(count, sizeof(double) * 4, ERR_INVALID_DATA);
  1002. ERR_FAIL_COND_V(count < 0 || count * sizeof(double) * 4 > (size_t)len, ERR_INVALID_DATA);
  1003. if (r_len) {
  1004. (*r_len) += 4; // Size of count number.
  1005. }
  1006. if (count) {
  1007. varray.resize(count);
  1008. Vector4 *w = varray.ptrw();
  1009. for (int32_t i = 0; i < count; i++) {
  1010. w[i].x = decode_double(buf + i * sizeof(double) * 4 + sizeof(double) * 0);
  1011. w[i].y = decode_double(buf + i * sizeof(double) * 4 + sizeof(double) * 1);
  1012. w[i].z = decode_double(buf + i * sizeof(double) * 4 + sizeof(double) * 2);
  1013. w[i].w = decode_double(buf + i * sizeof(double) * 4 + sizeof(double) * 3);
  1014. }
  1015. int adv = sizeof(double) * 4 * count;
  1016. if (r_len) {
  1017. (*r_len) += adv;
  1018. }
  1019. len -= adv;
  1020. buf += adv;
  1021. }
  1022. } else {
  1023. ERR_FAIL_MUL_OF(count, sizeof(float) * 4, ERR_INVALID_DATA);
  1024. ERR_FAIL_COND_V(count < 0 || count * sizeof(float) * 4 > (size_t)len, ERR_INVALID_DATA);
  1025. if (r_len) {
  1026. (*r_len) += 4; // Size of count number.
  1027. }
  1028. if (count) {
  1029. varray.resize(count);
  1030. Vector4 *w = varray.ptrw();
  1031. for (int32_t i = 0; i < count; i++) {
  1032. w[i].x = decode_float(buf + i * sizeof(float) * 4 + sizeof(float) * 0);
  1033. w[i].y = decode_float(buf + i * sizeof(float) * 4 + sizeof(float) * 1);
  1034. w[i].z = decode_float(buf + i * sizeof(float) * 4 + sizeof(float) * 2);
  1035. w[i].w = decode_float(buf + i * sizeof(float) * 4 + sizeof(float) * 3);
  1036. }
  1037. int adv = sizeof(float) * 4 * count;
  1038. if (r_len) {
  1039. (*r_len) += adv;
  1040. }
  1041. len -= adv;
  1042. buf += adv;
  1043. }
  1044. }
  1045. r_variant = varray;
  1046. } break;
  1047. default: {
  1048. ERR_FAIL_V(ERR_BUG);
  1049. }
  1050. }
  1051. return OK;
  1052. }
  1053. static void _encode_string(const String &p_string, uint8_t *&buf, int &r_len) {
  1054. CharString utf8 = p_string.utf8();
  1055. if (buf) {
  1056. encode_uint32(utf8.length(), buf);
  1057. buf += 4;
  1058. memcpy(buf, utf8.get_data(), utf8.length());
  1059. buf += utf8.length();
  1060. }
  1061. r_len += 4 + utf8.length();
  1062. while (r_len % 4) {
  1063. r_len++; //pad
  1064. if (buf) {
  1065. *(buf++) = 0;
  1066. }
  1067. }
  1068. }
  1069. Error encode_variant(const Variant &p_variant, uint8_t *r_buffer, int &r_len, bool p_full_objects, int p_depth) {
  1070. ERR_FAIL_COND_V_MSG(p_depth > Variant::MAX_RECURSION_DEPTH, ERR_OUT_OF_MEMORY, "Potential infinite recursion detected. Bailing.");
  1071. uint8_t *buf = r_buffer;
  1072. r_len = 0;
  1073. uint32_t header = p_variant.get_type();
  1074. switch (p_variant.get_type()) {
  1075. case Variant::INT: {
  1076. int64_t val = p_variant;
  1077. if (val > (int64_t)INT_MAX || val < (int64_t)INT_MIN) {
  1078. header |= HEADER_DATA_FLAG_64;
  1079. }
  1080. } break;
  1081. case Variant::FLOAT: {
  1082. double d = p_variant;
  1083. float f = d;
  1084. if (double(f) != d) {
  1085. header |= HEADER_DATA_FLAG_64;
  1086. }
  1087. } break;
  1088. case Variant::OBJECT: {
  1089. // Test for potential wrong values sent by the debugger when it breaks.
  1090. Object *obj = p_variant.get_validated_object();
  1091. if (!obj) {
  1092. // Object is invalid, send a nullptr instead.
  1093. if (buf) {
  1094. encode_uint32(Variant::NIL, buf);
  1095. }
  1096. r_len += 4;
  1097. return OK;
  1098. }
  1099. if (!p_full_objects) {
  1100. header |= HEADER_DATA_FLAG_OBJECT_AS_ID;
  1101. }
  1102. } break;
  1103. case Variant::ARRAY: {
  1104. Array array = p_variant;
  1105. if (array.is_typed()) {
  1106. Ref<Script> script = array.get_typed_script();
  1107. if (script.is_valid()) {
  1108. header |= HEADER_DATA_FIELD_TYPED_ARRAY_SCRIPT;
  1109. } else if (array.get_typed_class_name() != StringName()) {
  1110. header |= HEADER_DATA_FIELD_TYPED_ARRAY_CLASS_NAME;
  1111. } else {
  1112. header |= HEADER_DATA_FIELD_TYPED_ARRAY_BUILTIN;
  1113. }
  1114. }
  1115. } break;
  1116. #ifdef REAL_T_IS_DOUBLE
  1117. case Variant::VECTOR2:
  1118. case Variant::VECTOR3:
  1119. case Variant::VECTOR4:
  1120. case Variant::PACKED_VECTOR2_ARRAY:
  1121. case Variant::PACKED_VECTOR3_ARRAY:
  1122. case Variant::PACKED_VECTOR4_ARRAY:
  1123. case Variant::TRANSFORM2D:
  1124. case Variant::TRANSFORM3D:
  1125. case Variant::PROJECTION:
  1126. case Variant::QUATERNION:
  1127. case Variant::PLANE:
  1128. case Variant::BASIS:
  1129. case Variant::RECT2:
  1130. case Variant::AABB: {
  1131. header |= HEADER_DATA_FLAG_64;
  1132. } break;
  1133. #endif // REAL_T_IS_DOUBLE
  1134. default: {
  1135. } // nothing to do at this stage
  1136. }
  1137. if (buf) {
  1138. encode_uint32(header, buf);
  1139. buf += 4;
  1140. }
  1141. r_len += 4;
  1142. switch (p_variant.get_type()) {
  1143. case Variant::NIL: {
  1144. //nothing to do
  1145. } break;
  1146. case Variant::BOOL: {
  1147. if (buf) {
  1148. encode_uint32(p_variant.operator bool(), buf);
  1149. }
  1150. r_len += 4;
  1151. } break;
  1152. case Variant::INT: {
  1153. if (header & HEADER_DATA_FLAG_64) {
  1154. //64 bits
  1155. if (buf) {
  1156. encode_uint64(p_variant.operator int64_t(), buf);
  1157. }
  1158. r_len += 8;
  1159. } else {
  1160. if (buf) {
  1161. encode_uint32(p_variant.operator int32_t(), buf);
  1162. }
  1163. r_len += 4;
  1164. }
  1165. } break;
  1166. case Variant::FLOAT: {
  1167. if (header & HEADER_DATA_FLAG_64) {
  1168. if (buf) {
  1169. encode_double(p_variant.operator double(), buf);
  1170. }
  1171. r_len += 8;
  1172. } else {
  1173. if (buf) {
  1174. encode_float(p_variant.operator float(), buf);
  1175. }
  1176. r_len += 4;
  1177. }
  1178. } break;
  1179. case Variant::NODE_PATH: {
  1180. NodePath np = p_variant;
  1181. if (buf) {
  1182. encode_uint32(uint32_t(np.get_name_count()) | 0x80000000, buf); //for compatibility with the old format
  1183. encode_uint32(np.get_subname_count(), buf + 4);
  1184. uint32_t np_flags = 0;
  1185. if (np.is_absolute()) {
  1186. np_flags |= 1;
  1187. }
  1188. encode_uint32(np_flags, buf + 8);
  1189. buf += 12;
  1190. }
  1191. r_len += 12;
  1192. int total = np.get_name_count() + np.get_subname_count();
  1193. for (int i = 0; i < total; i++) {
  1194. String str;
  1195. if (i < np.get_name_count()) {
  1196. str = np.get_name(i);
  1197. } else {
  1198. str = np.get_subname(i - np.get_name_count());
  1199. }
  1200. CharString utf8 = str.utf8();
  1201. int pad = 0;
  1202. if (utf8.length() % 4) {
  1203. pad = 4 - utf8.length() % 4;
  1204. }
  1205. if (buf) {
  1206. encode_uint32(utf8.length(), buf);
  1207. buf += 4;
  1208. memcpy(buf, utf8.get_data(), utf8.length());
  1209. buf += pad + utf8.length();
  1210. }
  1211. r_len += 4 + utf8.length() + pad;
  1212. }
  1213. } break;
  1214. case Variant::STRING:
  1215. case Variant::STRING_NAME: {
  1216. _encode_string(p_variant, buf, r_len);
  1217. } break;
  1218. // math types
  1219. case Variant::VECTOR2: {
  1220. if (buf) {
  1221. Vector2 v2 = p_variant;
  1222. encode_real(v2.x, &buf[0]);
  1223. encode_real(v2.y, &buf[sizeof(real_t)]);
  1224. }
  1225. r_len += 2 * sizeof(real_t);
  1226. } break;
  1227. case Variant::VECTOR2I: {
  1228. if (buf) {
  1229. Vector2i v2 = p_variant;
  1230. encode_uint32(v2.x, &buf[0]);
  1231. encode_uint32(v2.y, &buf[4]);
  1232. }
  1233. r_len += 2 * 4;
  1234. } break;
  1235. case Variant::RECT2: {
  1236. if (buf) {
  1237. Rect2 r2 = p_variant;
  1238. encode_real(r2.position.x, &buf[0]);
  1239. encode_real(r2.position.y, &buf[sizeof(real_t)]);
  1240. encode_real(r2.size.x, &buf[sizeof(real_t) * 2]);
  1241. encode_real(r2.size.y, &buf[sizeof(real_t) * 3]);
  1242. }
  1243. r_len += 4 * sizeof(real_t);
  1244. } break;
  1245. case Variant::RECT2I: {
  1246. if (buf) {
  1247. Rect2i r2 = p_variant;
  1248. encode_uint32(r2.position.x, &buf[0]);
  1249. encode_uint32(r2.position.y, &buf[4]);
  1250. encode_uint32(r2.size.x, &buf[8]);
  1251. encode_uint32(r2.size.y, &buf[12]);
  1252. }
  1253. r_len += 4 * 4;
  1254. } break;
  1255. case Variant::VECTOR3: {
  1256. if (buf) {
  1257. Vector3 v3 = p_variant;
  1258. encode_real(v3.x, &buf[0]);
  1259. encode_real(v3.y, &buf[sizeof(real_t)]);
  1260. encode_real(v3.z, &buf[sizeof(real_t) * 2]);
  1261. }
  1262. r_len += 3 * sizeof(real_t);
  1263. } break;
  1264. case Variant::VECTOR3I: {
  1265. if (buf) {
  1266. Vector3i v3 = p_variant;
  1267. encode_uint32(v3.x, &buf[0]);
  1268. encode_uint32(v3.y, &buf[4]);
  1269. encode_uint32(v3.z, &buf[8]);
  1270. }
  1271. r_len += 3 * 4;
  1272. } break;
  1273. case Variant::TRANSFORM2D: {
  1274. if (buf) {
  1275. Transform2D val = p_variant;
  1276. for (int i = 0; i < 3; i++) {
  1277. for (int j = 0; j < 2; j++) {
  1278. memcpy(&buf[(i * 2 + j) * sizeof(real_t)], &val.columns[i][j], sizeof(real_t));
  1279. }
  1280. }
  1281. }
  1282. r_len += 6 * sizeof(real_t);
  1283. } break;
  1284. case Variant::VECTOR4: {
  1285. if (buf) {
  1286. Vector4 v4 = p_variant;
  1287. encode_real(v4.x, &buf[0]);
  1288. encode_real(v4.y, &buf[sizeof(real_t)]);
  1289. encode_real(v4.z, &buf[sizeof(real_t) * 2]);
  1290. encode_real(v4.w, &buf[sizeof(real_t) * 3]);
  1291. }
  1292. r_len += 4 * sizeof(real_t);
  1293. } break;
  1294. case Variant::VECTOR4I: {
  1295. if (buf) {
  1296. Vector4i v4 = p_variant;
  1297. encode_uint32(v4.x, &buf[0]);
  1298. encode_uint32(v4.y, &buf[4]);
  1299. encode_uint32(v4.z, &buf[8]);
  1300. encode_uint32(v4.w, &buf[12]);
  1301. }
  1302. r_len += 4 * 4;
  1303. } break;
  1304. case Variant::PLANE: {
  1305. if (buf) {
  1306. Plane p = p_variant;
  1307. encode_real(p.normal.x, &buf[0]);
  1308. encode_real(p.normal.y, &buf[sizeof(real_t)]);
  1309. encode_real(p.normal.z, &buf[sizeof(real_t) * 2]);
  1310. encode_real(p.d, &buf[sizeof(real_t) * 3]);
  1311. }
  1312. r_len += 4 * sizeof(real_t);
  1313. } break;
  1314. case Variant::QUATERNION: {
  1315. if (buf) {
  1316. Quaternion q = p_variant;
  1317. encode_real(q.x, &buf[0]);
  1318. encode_real(q.y, &buf[sizeof(real_t)]);
  1319. encode_real(q.z, &buf[sizeof(real_t) * 2]);
  1320. encode_real(q.w, &buf[sizeof(real_t) * 3]);
  1321. }
  1322. r_len += 4 * sizeof(real_t);
  1323. } break;
  1324. case Variant::AABB: {
  1325. if (buf) {
  1326. AABB aabb = p_variant;
  1327. encode_real(aabb.position.x, &buf[0]);
  1328. encode_real(aabb.position.y, &buf[sizeof(real_t)]);
  1329. encode_real(aabb.position.z, &buf[sizeof(real_t) * 2]);
  1330. encode_real(aabb.size.x, &buf[sizeof(real_t) * 3]);
  1331. encode_real(aabb.size.y, &buf[sizeof(real_t) * 4]);
  1332. encode_real(aabb.size.z, &buf[sizeof(real_t) * 5]);
  1333. }
  1334. r_len += 6 * sizeof(real_t);
  1335. } break;
  1336. case Variant::BASIS: {
  1337. if (buf) {
  1338. Basis val = p_variant;
  1339. for (int i = 0; i < 3; i++) {
  1340. for (int j = 0; j < 3; j++) {
  1341. memcpy(&buf[(i * 3 + j) * sizeof(real_t)], &val.rows[i][j], sizeof(real_t));
  1342. }
  1343. }
  1344. }
  1345. r_len += 9 * sizeof(real_t);
  1346. } break;
  1347. case Variant::TRANSFORM3D: {
  1348. if (buf) {
  1349. Transform3D val = p_variant;
  1350. for (int i = 0; i < 3; i++) {
  1351. for (int j = 0; j < 3; j++) {
  1352. memcpy(&buf[(i * 3 + j) * sizeof(real_t)], &val.basis.rows[i][j], sizeof(real_t));
  1353. }
  1354. }
  1355. encode_real(val.origin.x, &buf[sizeof(real_t) * 9]);
  1356. encode_real(val.origin.y, &buf[sizeof(real_t) * 10]);
  1357. encode_real(val.origin.z, &buf[sizeof(real_t) * 11]);
  1358. }
  1359. r_len += 12 * sizeof(real_t);
  1360. } break;
  1361. case Variant::PROJECTION: {
  1362. if (buf) {
  1363. Projection val = p_variant;
  1364. for (int i = 0; i < 4; i++) {
  1365. for (int j = 0; j < 4; j++) {
  1366. memcpy(&buf[(i * 4 + j) * sizeof(real_t)], &val.columns[i][j], sizeof(real_t));
  1367. }
  1368. }
  1369. }
  1370. r_len += 16 * sizeof(real_t);
  1371. } break;
  1372. // misc types
  1373. case Variant::COLOR: {
  1374. if (buf) {
  1375. Color c = p_variant;
  1376. encode_float(c.r, &buf[0]);
  1377. encode_float(c.g, &buf[4]);
  1378. encode_float(c.b, &buf[8]);
  1379. encode_float(c.a, &buf[12]);
  1380. }
  1381. r_len += 4 * 4; // Colors should always be in single-precision.
  1382. } break;
  1383. case Variant::RID: {
  1384. RID rid = p_variant;
  1385. if (buf) {
  1386. encode_uint64(rid.get_id(), buf);
  1387. }
  1388. r_len += 8;
  1389. } break;
  1390. case Variant::OBJECT: {
  1391. if (p_full_objects) {
  1392. Object *obj = p_variant;
  1393. if (!obj) {
  1394. if (buf) {
  1395. encode_uint32(0, buf);
  1396. }
  1397. r_len += 4;
  1398. } else {
  1399. ERR_FAIL_COND_V(!ClassDB::can_instantiate(obj->get_class()), ERR_INVALID_PARAMETER);
  1400. _encode_string(obj->get_class(), buf, r_len);
  1401. List<PropertyInfo> props;
  1402. obj->get_property_list(&props);
  1403. int pc = 0;
  1404. for (const PropertyInfo &E : props) {
  1405. if (!(E.usage & PROPERTY_USAGE_STORAGE)) {
  1406. continue;
  1407. }
  1408. pc++;
  1409. }
  1410. if (buf) {
  1411. encode_uint32(pc, buf);
  1412. buf += 4;
  1413. }
  1414. r_len += 4;
  1415. for (const PropertyInfo &E : props) {
  1416. if (!(E.usage & PROPERTY_USAGE_STORAGE)) {
  1417. continue;
  1418. }
  1419. _encode_string(E.name, buf, r_len);
  1420. Variant value;
  1421. if (E.name == CoreStringNames::get_singleton()->_script) {
  1422. Ref<Script> script = obj->get_script();
  1423. if (script.is_valid()) {
  1424. String path = script->get_path();
  1425. ERR_FAIL_COND_V_MSG(path.is_empty() || !path.begins_with("res://"), ERR_UNAVAILABLE, "Failed to encode a path to a custom script.");
  1426. value = path;
  1427. }
  1428. } else {
  1429. value = obj->get(E.name);
  1430. }
  1431. int len;
  1432. Error err = encode_variant(value, buf, len, p_full_objects, p_depth + 1);
  1433. ERR_FAIL_COND_V(err, err);
  1434. ERR_FAIL_COND_V(len % 4, ERR_BUG);
  1435. r_len += len;
  1436. if (buf) {
  1437. buf += len;
  1438. }
  1439. }
  1440. }
  1441. } else {
  1442. if (buf) {
  1443. Object *obj = p_variant.get_validated_object();
  1444. ObjectID id;
  1445. if (obj) {
  1446. id = obj->get_instance_id();
  1447. }
  1448. encode_uint64(id, buf);
  1449. }
  1450. r_len += 8;
  1451. }
  1452. } break;
  1453. case Variant::CALLABLE: {
  1454. } break;
  1455. case Variant::SIGNAL: {
  1456. Signal signal = p_variant;
  1457. _encode_string(signal.get_name(), buf, r_len);
  1458. if (buf) {
  1459. encode_uint64(signal.get_object_id(), buf);
  1460. }
  1461. r_len += 8;
  1462. } break;
  1463. case Variant::DICTIONARY: {
  1464. Dictionary d = p_variant;
  1465. if (buf) {
  1466. encode_uint32(uint32_t(d.size()), buf);
  1467. buf += 4;
  1468. }
  1469. r_len += 4;
  1470. List<Variant> keys;
  1471. d.get_key_list(&keys);
  1472. for (const Variant &E : keys) {
  1473. int len;
  1474. Error err = encode_variant(E, buf, len, p_full_objects, p_depth + 1);
  1475. ERR_FAIL_COND_V(err, err);
  1476. ERR_FAIL_COND_V(len % 4, ERR_BUG);
  1477. r_len += len;
  1478. if (buf) {
  1479. buf += len;
  1480. }
  1481. Variant *v = d.getptr(E);
  1482. ERR_FAIL_NULL_V(v, ERR_BUG);
  1483. err = encode_variant(*v, buf, len, p_full_objects, p_depth + 1);
  1484. ERR_FAIL_COND_V(err, err);
  1485. ERR_FAIL_COND_V(len % 4, ERR_BUG);
  1486. r_len += len;
  1487. if (buf) {
  1488. buf += len;
  1489. }
  1490. }
  1491. } break;
  1492. case Variant::ARRAY: {
  1493. Array array = p_variant;
  1494. if (array.is_typed()) {
  1495. Variant variant = array.get_typed_script();
  1496. Ref<Script> script = variant;
  1497. if (script.is_valid()) {
  1498. String path = script->get_path();
  1499. ERR_FAIL_COND_V_MSG(path.is_empty() || !path.begins_with("res://"), ERR_UNAVAILABLE, "Failed to encode a path to a custom script for an array type.");
  1500. _encode_string(path, buf, r_len);
  1501. } else if (array.get_typed_class_name() != StringName()) {
  1502. _encode_string(array.get_typed_class_name(), buf, r_len);
  1503. } else {
  1504. if (buf) {
  1505. encode_uint32(array.get_typed_builtin(), buf);
  1506. buf += 4;
  1507. }
  1508. r_len += 4;
  1509. }
  1510. }
  1511. if (buf) {
  1512. encode_uint32(uint32_t(array.size()), buf);
  1513. buf += 4;
  1514. }
  1515. r_len += 4;
  1516. for (const Variant &var : array) {
  1517. int len;
  1518. Error err = encode_variant(var, buf, len, p_full_objects, p_depth + 1);
  1519. ERR_FAIL_COND_V(err, err);
  1520. ERR_FAIL_COND_V(len % 4, ERR_BUG);
  1521. if (buf) {
  1522. buf += len;
  1523. }
  1524. r_len += len;
  1525. }
  1526. } break;
  1527. // arrays
  1528. case Variant::PACKED_BYTE_ARRAY: {
  1529. Vector<uint8_t> data = p_variant;
  1530. int datalen = data.size();
  1531. int datasize = sizeof(uint8_t);
  1532. if (buf) {
  1533. encode_uint32(datalen, buf);
  1534. buf += 4;
  1535. const uint8_t *r = data.ptr();
  1536. if (r) {
  1537. memcpy(buf, &r[0], datalen * datasize);
  1538. buf += datalen * datasize;
  1539. }
  1540. }
  1541. r_len += 4 + datalen * datasize;
  1542. while (r_len % 4) {
  1543. r_len++;
  1544. if (buf) {
  1545. *(buf++) = 0;
  1546. }
  1547. }
  1548. } break;
  1549. case Variant::PACKED_INT32_ARRAY: {
  1550. Vector<int32_t> data = p_variant;
  1551. int datalen = data.size();
  1552. int datasize = sizeof(int32_t);
  1553. if (buf) {
  1554. encode_uint32(datalen, buf);
  1555. buf += 4;
  1556. const int32_t *r = data.ptr();
  1557. for (int32_t i = 0; i < datalen; i++) {
  1558. encode_uint32(r[i], &buf[i * datasize]);
  1559. }
  1560. }
  1561. r_len += 4 + datalen * datasize;
  1562. } break;
  1563. case Variant::PACKED_INT64_ARRAY: {
  1564. Vector<int64_t> data = p_variant;
  1565. int datalen = data.size();
  1566. int datasize = sizeof(int64_t);
  1567. if (buf) {
  1568. encode_uint32(datalen, buf);
  1569. buf += 4;
  1570. const int64_t *r = data.ptr();
  1571. for (int64_t i = 0; i < datalen; i++) {
  1572. encode_uint64(r[i], &buf[i * datasize]);
  1573. }
  1574. }
  1575. r_len += 4 + datalen * datasize;
  1576. } break;
  1577. case Variant::PACKED_FLOAT32_ARRAY: {
  1578. Vector<float> data = p_variant;
  1579. int datalen = data.size();
  1580. int datasize = sizeof(float);
  1581. if (buf) {
  1582. encode_uint32(datalen, buf);
  1583. buf += 4;
  1584. const float *r = data.ptr();
  1585. for (int i = 0; i < datalen; i++) {
  1586. encode_float(r[i], &buf[i * datasize]);
  1587. }
  1588. }
  1589. r_len += 4 + datalen * datasize;
  1590. } break;
  1591. case Variant::PACKED_FLOAT64_ARRAY: {
  1592. Vector<double> data = p_variant;
  1593. int datalen = data.size();
  1594. int datasize = sizeof(double);
  1595. if (buf) {
  1596. encode_uint32(datalen, buf);
  1597. buf += 4;
  1598. const double *r = data.ptr();
  1599. for (int i = 0; i < datalen; i++) {
  1600. encode_double(r[i], &buf[i * datasize]);
  1601. }
  1602. }
  1603. r_len += 4 + datalen * datasize;
  1604. } break;
  1605. case Variant::PACKED_STRING_ARRAY: {
  1606. Vector<String> data = p_variant;
  1607. int len = data.size();
  1608. if (buf) {
  1609. encode_uint32(len, buf);
  1610. buf += 4;
  1611. }
  1612. r_len += 4;
  1613. for (int i = 0; i < len; i++) {
  1614. CharString utf8 = data.get(i).utf8();
  1615. if (buf) {
  1616. encode_uint32(utf8.length() + 1, buf);
  1617. buf += 4;
  1618. memcpy(buf, utf8.get_data(), utf8.length() + 1);
  1619. buf += utf8.length() + 1;
  1620. }
  1621. r_len += 4 + utf8.length() + 1;
  1622. while (r_len % 4) {
  1623. r_len++; //pad
  1624. if (buf) {
  1625. *(buf++) = 0;
  1626. }
  1627. }
  1628. }
  1629. } break;
  1630. case Variant::PACKED_VECTOR2_ARRAY: {
  1631. Vector<Vector2> data = p_variant;
  1632. int len = data.size();
  1633. if (buf) {
  1634. encode_uint32(len, buf);
  1635. buf += 4;
  1636. }
  1637. r_len += 4;
  1638. if (buf) {
  1639. for (int i = 0; i < len; i++) {
  1640. Vector2 v = data.get(i);
  1641. encode_real(v.x, &buf[0]);
  1642. encode_real(v.y, &buf[sizeof(real_t)]);
  1643. buf += sizeof(real_t) * 2;
  1644. }
  1645. }
  1646. r_len += sizeof(real_t) * 2 * len;
  1647. } break;
  1648. case Variant::PACKED_VECTOR3_ARRAY: {
  1649. Vector<Vector3> data = p_variant;
  1650. int len = data.size();
  1651. if (buf) {
  1652. encode_uint32(len, buf);
  1653. buf += 4;
  1654. }
  1655. r_len += 4;
  1656. if (buf) {
  1657. for (int i = 0; i < len; i++) {
  1658. Vector3 v = data.get(i);
  1659. encode_real(v.x, &buf[0]);
  1660. encode_real(v.y, &buf[sizeof(real_t)]);
  1661. encode_real(v.z, &buf[sizeof(real_t) * 2]);
  1662. buf += sizeof(real_t) * 3;
  1663. }
  1664. }
  1665. r_len += sizeof(real_t) * 3 * len;
  1666. } break;
  1667. case Variant::PACKED_COLOR_ARRAY: {
  1668. Vector<Color> data = p_variant;
  1669. int len = data.size();
  1670. if (buf) {
  1671. encode_uint32(len, buf);
  1672. buf += 4;
  1673. }
  1674. r_len += 4;
  1675. if (buf) {
  1676. for (int i = 0; i < len; i++) {
  1677. Color c = data.get(i);
  1678. encode_float(c.r, &buf[0]);
  1679. encode_float(c.g, &buf[4]);
  1680. encode_float(c.b, &buf[8]);
  1681. encode_float(c.a, &buf[12]);
  1682. buf += 4 * 4; // Colors should always be in single-precision.
  1683. }
  1684. }
  1685. r_len += 4 * 4 * len;
  1686. } break;
  1687. case Variant::PACKED_VECTOR4_ARRAY: {
  1688. Vector<Vector4> data = p_variant;
  1689. int len = data.size();
  1690. if (buf) {
  1691. encode_uint32(len, buf);
  1692. buf += 4;
  1693. }
  1694. r_len += 4;
  1695. if (buf) {
  1696. for (int i = 0; i < len; i++) {
  1697. Vector4 v = data.get(i);
  1698. encode_real(v.x, &buf[0]);
  1699. encode_real(v.y, &buf[sizeof(real_t)]);
  1700. encode_real(v.z, &buf[sizeof(real_t) * 2]);
  1701. encode_real(v.w, &buf[sizeof(real_t) * 3]);
  1702. buf += sizeof(real_t) * 4;
  1703. }
  1704. }
  1705. r_len += sizeof(real_t) * 4 * len;
  1706. } break;
  1707. default: {
  1708. ERR_FAIL_V(ERR_BUG);
  1709. }
  1710. }
  1711. return OK;
  1712. }
  1713. Vector<float> vector3_to_float32_array(const Vector3 *vecs, size_t count) {
  1714. // We always allocate a new array, and we don't memcpy.
  1715. // We also don't consider returning a pointer to the passed vectors when sizeof(real_t) == 4.
  1716. // One reason is that we could decide to put a 4th component in Vector3 for SIMD/mobile performance,
  1717. // which would cause trouble with these optimizations.
  1718. Vector<float> floats;
  1719. if (count == 0) {
  1720. return floats;
  1721. }
  1722. floats.resize(count * 3);
  1723. float *floats_w = floats.ptrw();
  1724. for (size_t i = 0; i < count; ++i) {
  1725. const Vector3 v = vecs[i];
  1726. floats_w[0] = v.x;
  1727. floats_w[1] = v.y;
  1728. floats_w[2] = v.z;
  1729. floats_w += 3;
  1730. }
  1731. return floats;
  1732. }