marshalls.cpp 29 KB

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