packed_data_container.cpp 12 KB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130131132133134135136137138139140141142143144145146147148149150151152153154155156157158159160161162163164165166167168169170171172173174175176177178179180181182183184185186187188189190191192193194195196197198199200201202203204205206207208209210211212213214215216217218219220221222223224225226227228229230231232233234235236237238239240241242243244245246247248249250251252253254255256257258259260261262263264265266267268269270271272273274275276277278279280281282283284285286287288289290291292293294295296297298299300301302303304305306307308309310311312313314315316317318319320321322323324325326327328329330331332333334335336337338339340341342343344345346347348349350351352353354355356357358359360361362363364365366367368369370371372373374375376377378379380381382383384385386387388389390391392393394395396397398399
  1. /*************************************************************************/
  2. /* packed_data_container.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 "packed_data_container.h"
  31. #include "core/core_string_names.h"
  32. #include "core/io/marshalls.h"
  33. Variant PackedDataContainer::getvar(const Variant &p_key, bool *r_valid) const {
  34. bool err = false;
  35. Variant ret = _key_at_ofs(0, p_key, err);
  36. if (r_valid) {
  37. *r_valid = !err;
  38. }
  39. return ret;
  40. }
  41. int PackedDataContainer::size() const {
  42. return _size(0);
  43. };
  44. Variant PackedDataContainer::_iter_init_ofs(const Array &p_iter, uint32_t p_offset) {
  45. Array ref = p_iter;
  46. uint32_t size = _size(p_offset);
  47. if (size == 0 || ref.size() != 1) {
  48. return false;
  49. } else {
  50. ref[0] = 0;
  51. return true;
  52. }
  53. }
  54. Variant PackedDataContainer::_iter_next_ofs(const Array &p_iter, uint32_t p_offset) {
  55. Array ref = p_iter;
  56. int size = _size(p_offset);
  57. if (ref.size() != 1) {
  58. return false;
  59. }
  60. int pos = ref[0];
  61. if (pos < 0 || pos >= size) {
  62. return false;
  63. }
  64. pos += 1;
  65. ref[0] = pos;
  66. return pos != size;
  67. }
  68. Variant PackedDataContainer::_iter_get_ofs(const Variant &p_iter, uint32_t p_offset) {
  69. int size = _size(p_offset);
  70. int pos = p_iter;
  71. if (pos < 0 || pos >= size) {
  72. return Variant();
  73. }
  74. PoolVector<uint8_t>::Read rd = data.read();
  75. const uint8_t *r = &rd[p_offset];
  76. uint32_t type = decode_uint32(r);
  77. bool err = false;
  78. if (type == TYPE_ARRAY) {
  79. uint32_t vpos = decode_uint32(rd.ptr() + p_offset + 8 + pos * 4);
  80. return _get_at_ofs(vpos, rd.ptr(), err);
  81. } else if (type == TYPE_DICT) {
  82. uint32_t vpos = decode_uint32(rd.ptr() + p_offset + 8 + pos * 12 + 4);
  83. return _get_at_ofs(vpos, rd.ptr(), err);
  84. } else {
  85. ERR_FAIL_V(Variant());
  86. }
  87. }
  88. Variant PackedDataContainer::_get_at_ofs(uint32_t p_ofs, const uint8_t *p_buf, bool &err) const {
  89. uint32_t type = decode_uint32(p_buf + p_ofs);
  90. if (type == TYPE_ARRAY || type == TYPE_DICT) {
  91. Ref<PackedDataContainerRef> pdcr = memnew(PackedDataContainerRef);
  92. Ref<PackedDataContainer> pdc = Ref<PackedDataContainer>((PackedDataContainer *)this);
  93. pdcr->from = pdc;
  94. pdcr->offset = p_ofs;
  95. return pdcr;
  96. } else {
  97. Variant v;
  98. Error rerr = decode_variant(v, p_buf + p_ofs, datalen - p_ofs, nullptr, false);
  99. if (rerr != OK) {
  100. err = true;
  101. ERR_FAIL_COND_V_MSG(err != OK, Variant(), "Error when trying to decode Variant.");
  102. }
  103. return v;
  104. }
  105. }
  106. uint32_t PackedDataContainer::_type_at_ofs(uint32_t p_ofs) const {
  107. PoolVector<uint8_t>::Read rd = data.read();
  108. ERR_FAIL_COND_V(!rd.ptr(), 0);
  109. const uint8_t *r = &rd[p_ofs];
  110. uint32_t type = decode_uint32(r);
  111. return type;
  112. };
  113. int PackedDataContainer::_size(uint32_t p_ofs) const {
  114. PoolVector<uint8_t>::Read rd = data.read();
  115. ERR_FAIL_COND_V(!rd.ptr(), 0);
  116. const uint8_t *r = &rd[p_ofs];
  117. uint32_t type = decode_uint32(r);
  118. if (type == TYPE_ARRAY) {
  119. uint32_t len = decode_uint32(r + 4);
  120. return len;
  121. } else if (type == TYPE_DICT) {
  122. uint32_t len = decode_uint32(r + 4);
  123. return len;
  124. };
  125. return -1;
  126. };
  127. Variant PackedDataContainer::_key_at_ofs(uint32_t p_ofs, const Variant &p_key, bool &err) const {
  128. PoolVector<uint8_t>::Read rd = data.read();
  129. if (!rd.ptr()) {
  130. err = true;
  131. ERR_FAIL_COND_V(!rd.ptr(), Variant());
  132. }
  133. const uint8_t *r = &rd[p_ofs];
  134. uint32_t type = decode_uint32(r);
  135. if (type == TYPE_ARRAY) {
  136. if (p_key.is_num()) {
  137. int idx = p_key;
  138. int len = decode_uint32(r + 4);
  139. if (idx < 0 || idx >= len) {
  140. err = true;
  141. return Variant();
  142. }
  143. uint32_t ofs = decode_uint32(r + 8 + 4 * idx);
  144. return _get_at_ofs(ofs, rd.ptr(), err);
  145. } else {
  146. err = true;
  147. return Variant();
  148. }
  149. } else if (type == TYPE_DICT) {
  150. uint32_t hash = p_key.hash();
  151. uint32_t len = decode_uint32(r + 4);
  152. bool found = false;
  153. for (uint32_t i = 0; i < len; i++) {
  154. uint32_t khash = decode_uint32(r + 8 + i * 12 + 0);
  155. if (khash == hash) {
  156. Variant key = _get_at_ofs(decode_uint32(r + 8 + i * 12 + 4), rd.ptr(), err);
  157. if (err) {
  158. return Variant();
  159. }
  160. if (key == p_key) {
  161. //key matches, return value
  162. return _get_at_ofs(decode_uint32(r + 8 + i * 12 + 8), rd.ptr(), err);
  163. }
  164. found = true;
  165. } else {
  166. if (found) {
  167. break;
  168. }
  169. }
  170. }
  171. err = true;
  172. return Variant();
  173. } else {
  174. err = true;
  175. return Variant();
  176. }
  177. }
  178. uint32_t PackedDataContainer::_pack(const Variant &p_data, Vector<uint8_t> &tmpdata, Map<String, uint32_t> &string_cache) {
  179. switch (p_data.get_type()) {
  180. case Variant::STRING: {
  181. String s = p_data;
  182. if (string_cache.has(s)) {
  183. return string_cache[s];
  184. }
  185. string_cache[s] = tmpdata.size();
  186. FALLTHROUGH;
  187. };
  188. case Variant::NIL:
  189. case Variant::BOOL:
  190. case Variant::INT:
  191. case Variant::REAL:
  192. case Variant::VECTOR2:
  193. case Variant::RECT2:
  194. case Variant::VECTOR3:
  195. case Variant::TRANSFORM2D:
  196. case Variant::PLANE:
  197. case Variant::QUAT:
  198. case Variant::AABB:
  199. case Variant::BASIS:
  200. case Variant::TRANSFORM:
  201. case Variant::POOL_BYTE_ARRAY:
  202. case Variant::POOL_INT_ARRAY:
  203. case Variant::POOL_REAL_ARRAY:
  204. case Variant::POOL_STRING_ARRAY:
  205. case Variant::POOL_VECTOR2_ARRAY:
  206. case Variant::POOL_VECTOR3_ARRAY:
  207. case Variant::POOL_COLOR_ARRAY:
  208. case Variant::NODE_PATH: {
  209. uint32_t pos = tmpdata.size();
  210. int len;
  211. encode_variant(p_data, nullptr, len, false);
  212. tmpdata.resize(tmpdata.size() + len);
  213. encode_variant(p_data, &tmpdata.write[pos], len, false);
  214. return pos;
  215. } break;
  216. // misc types
  217. case Variant::_RID:
  218. case Variant::OBJECT: {
  219. return _pack(Variant(), tmpdata, string_cache);
  220. } break;
  221. case Variant::DICTIONARY: {
  222. Dictionary d = p_data;
  223. //size is known, use sort
  224. uint32_t pos = tmpdata.size();
  225. int len = d.size();
  226. tmpdata.resize(tmpdata.size() + len * 12 + 8);
  227. encode_uint32(TYPE_DICT, &tmpdata.write[pos + 0]);
  228. encode_uint32(len, &tmpdata.write[pos + 4]);
  229. List<Variant> keys;
  230. d.get_key_list(&keys);
  231. List<DictKey> sortk;
  232. for (List<Variant>::Element *E = keys.front(); E; E = E->next()) {
  233. DictKey dk;
  234. dk.hash = E->get().hash();
  235. dk.key = E->get();
  236. sortk.push_back(dk);
  237. }
  238. sortk.sort();
  239. int idx = 0;
  240. for (List<DictKey>::Element *E = sortk.front(); E; E = E->next()) {
  241. encode_uint32(E->get().hash, &tmpdata.write[pos + 8 + idx * 12 + 0]);
  242. uint32_t ofs = _pack(E->get().key, tmpdata, string_cache);
  243. encode_uint32(ofs, &tmpdata.write[pos + 8 + idx * 12 + 4]);
  244. ofs = _pack(d[E->get().key], tmpdata, string_cache);
  245. encode_uint32(ofs, &tmpdata.write[pos + 8 + idx * 12 + 8]);
  246. idx++;
  247. }
  248. return pos;
  249. } break;
  250. case Variant::ARRAY: {
  251. Array a = p_data;
  252. //size is known, use sort
  253. uint32_t pos = tmpdata.size();
  254. int len = a.size();
  255. tmpdata.resize(tmpdata.size() + len * 4 + 8);
  256. encode_uint32(TYPE_ARRAY, &tmpdata.write[pos + 0]);
  257. encode_uint32(len, &tmpdata.write[pos + 4]);
  258. for (int i = 0; i < len; i++) {
  259. uint32_t ofs = _pack(a[i], tmpdata, string_cache);
  260. encode_uint32(ofs, &tmpdata.write[pos + 8 + i * 4]);
  261. }
  262. return pos;
  263. } break;
  264. default: {
  265. }
  266. }
  267. return OK;
  268. }
  269. Error PackedDataContainer::pack(const Variant &p_data) {
  270. Vector<uint8_t> tmpdata;
  271. Map<String, uint32_t> string_cache;
  272. _pack(p_data, tmpdata, string_cache);
  273. datalen = tmpdata.size();
  274. data.resize(tmpdata.size());
  275. PoolVector<uint8_t>::Write w = data.write();
  276. memcpy(w.ptr(), tmpdata.ptr(), tmpdata.size());
  277. return OK;
  278. }
  279. void PackedDataContainer::_set_data(const PoolVector<uint8_t> &p_data) {
  280. data = p_data;
  281. datalen = data.size();
  282. }
  283. PoolVector<uint8_t> PackedDataContainer::_get_data() const {
  284. return data;
  285. }
  286. Variant PackedDataContainer::_iter_init(const Array &p_iter) {
  287. return _iter_init_ofs(p_iter, 0);
  288. }
  289. Variant PackedDataContainer::_iter_next(const Array &p_iter) {
  290. return _iter_next_ofs(p_iter, 0);
  291. }
  292. Variant PackedDataContainer::_iter_get(const Variant &p_iter) {
  293. return _iter_get_ofs(p_iter, 0);
  294. }
  295. void PackedDataContainer::_bind_methods() {
  296. ClassDB::bind_method(D_METHOD("_set_data"), &PackedDataContainer::_set_data);
  297. ClassDB::bind_method(D_METHOD("_get_data"), &PackedDataContainer::_get_data);
  298. ClassDB::bind_method(D_METHOD("_iter_init"), &PackedDataContainer::_iter_init);
  299. ClassDB::bind_method(D_METHOD("_iter_get"), &PackedDataContainer::_iter_get);
  300. ClassDB::bind_method(D_METHOD("_iter_next"), &PackedDataContainer::_iter_next);
  301. ClassDB::bind_method(D_METHOD("pack", "value"), &PackedDataContainer::pack);
  302. ClassDB::bind_method(D_METHOD("size"), &PackedDataContainer::size);
  303. ADD_PROPERTY(PropertyInfo(Variant::POOL_BYTE_ARRAY, "__data__"), "_set_data", "_get_data");
  304. }
  305. PackedDataContainer::PackedDataContainer() {
  306. datalen = 0;
  307. }
  308. //////////////////
  309. Variant PackedDataContainerRef::_iter_init(const Array &p_iter) {
  310. return from->_iter_init_ofs(p_iter, offset);
  311. }
  312. Variant PackedDataContainerRef::_iter_next(const Array &p_iter) {
  313. return from->_iter_next_ofs(p_iter, offset);
  314. }
  315. Variant PackedDataContainerRef::_iter_get(const Variant &p_iter) {
  316. return from->_iter_get_ofs(p_iter, offset);
  317. }
  318. bool PackedDataContainerRef::_is_dictionary() const {
  319. return from->_type_at_ofs(offset) == PackedDataContainer::TYPE_DICT;
  320. };
  321. void PackedDataContainerRef::_bind_methods() {
  322. ClassDB::bind_method(D_METHOD("size"), &PackedDataContainerRef::size);
  323. ClassDB::bind_method(D_METHOD("_iter_init"), &PackedDataContainerRef::_iter_init);
  324. ClassDB::bind_method(D_METHOD("_iter_get"), &PackedDataContainerRef::_iter_get);
  325. ClassDB::bind_method(D_METHOD("_iter_next"), &PackedDataContainerRef::_iter_next);
  326. ClassDB::bind_method(D_METHOD("_is_dictionary"), &PackedDataContainerRef::_is_dictionary);
  327. }
  328. Variant PackedDataContainerRef::getvar(const Variant &p_key, bool *r_valid) const {
  329. bool err = false;
  330. Variant ret = from->_key_at_ofs(offset, p_key, err);
  331. if (r_valid) {
  332. *r_valid = !err;
  333. }
  334. return ret;
  335. }
  336. int PackedDataContainerRef::size() const {
  337. return from->_size(offset);
  338. };
  339. PackedDataContainerRef::PackedDataContainerRef() {
  340. }