variant_setget.cpp 98 KB

1234567891011121314151617181920212223242526272829303132333435363738394041424344454647484950515253545556575859606162636465666768697071727374757677787980818283848586878889909192939495969798991001011021031041051061071081091101111121131141151161171181191201211221231241251261271281291301311321331341351361371381391401411421431441451461471481491501511521531541551561571581591601611621631641651661671681691701711721731741751761771781791801811821831841851861871881891901911921931941951961971981992002012022032042052062072082092102112122132142152162172182192202212222232242252262272282292302312322332342352362372382392402412422432442452462472482492502512522532542552562572582592602612622632642652662672682692702712722732742752762772782792802812822832842852862872882892902912922932942952962972982993003013023033043053063073083093103113123133143153163173183193203213223233243253263273283293303313323333343353363373383393403413423433443453463473483493503513523533543553563573583593603613623633643653663673683693703713723733743753763773783793803813823833843853863873883893903913923933943953963973983994004014024034044054064074084094104114124134144154164174184194204214224234244254264274284294304314324334344354364374384394404414424434444454464474484494504514524534544554564574584594604614624634644654664674684694704714724734744754764774784794804814824834844854864874884894904914924934944954964974984995005015025035045055065075085095105115125135145155165175185195205215225235245255265275285295305315325335345355365375385395405415425435445455465475485495505515525535545555565575585595605615625635645655665675685695705715725735745755765775785795805815825835845855865875885895905915925935945955965975985996006016026036046056066076086096106116126136146156166176186196206216226236246256266276286296306316326336346356366376386396406416426436446456466476486496506516526536546556566576586596606616626636646656666676686696706716726736746756766776786796806816826836846856866876886896906916926936946956966976986997007017027037047057067077087097107117127137147157167177187197207217227237247257267277287297307317327337347357367377387397407417427437447457467477487497507517527537547557567577587597607617627637647657667677687697707717727737747757767777787797807817827837847857867877887897907917927937947957967977987998008018028038048058068078088098108118128138148158168178188198208218228238248258268278288298308318328338348358368378388398408418428438448458468478488498508518528538548558568578588598608618628638648658668678688698708718728738748758768778788798808818828838848858868878888898908918928938948958968978988999009019029039049059069079089099109119129139149159169179189199209219229239249259269279289299309319329339349359369379389399409419429439449459469479489499509519529539549559569579589599609619629639649659669679689699709719729739749759769779789799809819829839849859869879889899909919929939949959969979989991000100110021003100410051006100710081009101010111012101310141015101610171018101910201021102210231024102510261027102810291030103110321033103410351036103710381039104010411042104310441045104610471048104910501051105210531054105510561057105810591060106110621063106410651066106710681069107010711072107310741075107610771078107910801081108210831084108510861087108810891090109110921093109410951096109710981099110011011102110311041105110611071108110911101111111211131114111511161117111811191120112111221123112411251126112711281129113011311132113311341135113611371138113911401141114211431144114511461147114811491150115111521153115411551156115711581159116011611162116311641165116611671168116911701171117211731174117511761177117811791180118111821183118411851186118711881189119011911192119311941195119611971198119912001201120212031204120512061207120812091210121112121213121412151216121712181219122012211222122312241225122612271228122912301231123212331234123512361237123812391240124112421243124412451246124712481249125012511252125312541255125612571258125912601261126212631264126512661267126812691270127112721273127412751276127712781279128012811282128312841285128612871288128912901291129212931294129512961297129812991300130113021303130413051306130713081309131013111312131313141315131613171318131913201321132213231324132513261327132813291330133113321333133413351336133713381339134013411342134313441345134613471348134913501351135213531354135513561357135813591360136113621363136413651366136713681369137013711372137313741375137613771378137913801381138213831384138513861387138813891390139113921393139413951396139713981399140014011402140314041405140614071408140914101411141214131414141514161417141814191420142114221423142414251426142714281429143014311432143314341435143614371438143914401441144214431444144514461447144814491450145114521453145414551456145714581459146014611462146314641465146614671468146914701471147214731474147514761477147814791480148114821483148414851486148714881489149014911492149314941495149614971498149915001501150215031504150515061507150815091510151115121513151415151516151715181519152015211522152315241525152615271528152915301531153215331534153515361537153815391540154115421543154415451546154715481549155015511552155315541555155615571558155915601561156215631564156515661567156815691570157115721573157415751576157715781579158015811582158315841585158615871588158915901591159215931594159515961597159815991600160116021603160416051606160716081609161016111612161316141615161616171618161916201621162216231624162516261627162816291630163116321633163416351636163716381639164016411642164316441645164616471648164916501651165216531654165516561657165816591660166116621663166416651666166716681669167016711672167316741675167616771678167916801681168216831684168516861687168816891690169116921693169416951696169716981699170017011702170317041705170617071708170917101711171217131714171517161717171817191720172117221723172417251726172717281729173017311732173317341735173617371738173917401741174217431744174517461747174817491750175117521753175417551756175717581759176017611762176317641765176617671768176917701771177217731774177517761777177817791780178117821783178417851786178717881789179017911792179317941795179617971798179918001801180218031804180518061807180818091810181118121813181418151816181718181819182018211822182318241825182618271828182918301831183218331834183518361837183818391840184118421843184418451846184718481849185018511852185318541855185618571858185918601861186218631864186518661867186818691870187118721873187418751876187718781879188018811882188318841885188618871888188918901891189218931894189518961897189818991900190119021903190419051906190719081909191019111912191319141915191619171918191919201921192219231924192519261927192819291930193119321933193419351936193719381939194019411942194319441945194619471948194919501951195219531954195519561957195819591960196119621963196419651966196719681969197019711972197319741975197619771978197919801981198219831984198519861987198819891990199119921993199419951996199719981999200020012002200320042005200620072008200920102011201220132014201520162017201820192020202120222023202420252026202720282029203020312032203320342035203620372038203920402041204220432044204520462047204820492050205120522053205420552056205720582059206020612062206320642065206620672068206920702071207220732074207520762077207820792080208120822083208420852086208720882089209020912092209320942095209620972098209921002101210221032104210521062107210821092110211121122113211421152116211721182119212021212122212321242125212621272128212921302131213221332134213521362137213821392140214121422143214421452146214721482149215021512152215321542155215621572158215921602161216221632164216521662167216821692170217121722173217421752176217721782179218021812182218321842185218621872188218921902191219221932194219521962197219821992200220122022203220422052206220722082209221022112212221322142215221622172218221922202221222222232224222522262227222822292230223122322233223422352236223722382239224022412242224322442245224622472248224922502251225222532254225522562257225822592260226122622263226422652266226722682269227022712272227322742275227622772278227922802281228222832284228522862287228822892290229122922293229422952296229722982299230023012302230323042305230623072308230923102311231223132314231523162317231823192320232123222323232423252326232723282329233023312332233323342335233623372338233923402341234223432344234523462347234823492350235123522353235423552356235723582359236023612362236323642365236623672368236923702371237223732374237523762377237823792380238123822383238423852386238723882389239023912392239323942395239623972398239924002401240224032404240524062407240824092410241124122413241424152416241724182419242024212422242324242425242624272428242924302431243224332434243524362437243824392440244124422443244424452446244724482449245024512452245324542455245624572458
  1. /*************************************************************************/
  2. /* variant_setget.cpp */
  3. /*************************************************************************/
  4. /* This file is part of: */
  5. /* GODOT ENGINE */
  6. /* https://godotengine.org */
  7. /*************************************************************************/
  8. /* Copyright (c) 2007-2022 Juan Linietsky, Ariel Manzur. */
  9. /* Copyright (c) 2014-2022 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 "variant_setget.h"
  31. struct VariantSetterGetterInfo {
  32. void (*setter)(Variant *base, const Variant *value, bool &valid);
  33. void (*getter)(const Variant *base, Variant *value);
  34. Variant::ValidatedSetter validated_setter;
  35. Variant::ValidatedGetter validated_getter;
  36. Variant::PTRSetter ptr_setter;
  37. Variant::PTRGetter ptr_getter;
  38. Variant::Type member_type;
  39. };
  40. static LocalVector<VariantSetterGetterInfo> variant_setters_getters[Variant::VARIANT_MAX];
  41. static LocalVector<StringName> variant_setters_getters_names[Variant::VARIANT_MAX]; //one next to another to make it cache friendly
  42. template <class T>
  43. static void register_member(Variant::Type p_type, const StringName &p_member) {
  44. VariantSetterGetterInfo sgi;
  45. sgi.setter = T::set;
  46. sgi.validated_setter = T::validated_set;
  47. sgi.ptr_setter = T::ptr_set;
  48. sgi.getter = T::get;
  49. sgi.validated_getter = T::validated_get;
  50. sgi.ptr_getter = T::ptr_get;
  51. sgi.member_type = T::get_type();
  52. variant_setters_getters[p_type].push_back(sgi);
  53. variant_setters_getters_names[p_type].push_back(p_member);
  54. }
  55. void register_named_setters_getters() {
  56. #define REGISTER_MEMBER(m_base_type, m_member) register_member<VariantSetGet_##m_base_type##_##m_member>(GetTypeInfo<m_base_type>::VARIANT_TYPE, #m_member)
  57. REGISTER_MEMBER(Vector2, x);
  58. REGISTER_MEMBER(Vector2, y);
  59. REGISTER_MEMBER(Vector2i, x);
  60. REGISTER_MEMBER(Vector2i, y);
  61. REGISTER_MEMBER(Vector3, x);
  62. REGISTER_MEMBER(Vector3, y);
  63. REGISTER_MEMBER(Vector3, z);
  64. REGISTER_MEMBER(Vector3i, x);
  65. REGISTER_MEMBER(Vector3i, y);
  66. REGISTER_MEMBER(Vector3i, z);
  67. REGISTER_MEMBER(Rect2, position);
  68. REGISTER_MEMBER(Rect2, size);
  69. REGISTER_MEMBER(Rect2, end);
  70. REGISTER_MEMBER(Rect2i, position);
  71. REGISTER_MEMBER(Rect2i, size);
  72. REGISTER_MEMBER(Rect2i, end);
  73. REGISTER_MEMBER(AABB, position);
  74. REGISTER_MEMBER(AABB, size);
  75. REGISTER_MEMBER(AABB, end);
  76. REGISTER_MEMBER(Transform2D, x);
  77. REGISTER_MEMBER(Transform2D, y);
  78. REGISTER_MEMBER(Transform2D, origin);
  79. REGISTER_MEMBER(Plane, x);
  80. REGISTER_MEMBER(Plane, y);
  81. REGISTER_MEMBER(Plane, z);
  82. REGISTER_MEMBER(Plane, d);
  83. REGISTER_MEMBER(Plane, normal);
  84. REGISTER_MEMBER(Quaternion, x);
  85. REGISTER_MEMBER(Quaternion, y);
  86. REGISTER_MEMBER(Quaternion, z);
  87. REGISTER_MEMBER(Quaternion, w);
  88. REGISTER_MEMBER(Basis, x);
  89. REGISTER_MEMBER(Basis, y);
  90. REGISTER_MEMBER(Basis, z);
  91. REGISTER_MEMBER(Transform3D, basis);
  92. REGISTER_MEMBER(Transform3D, origin);
  93. REGISTER_MEMBER(Color, r);
  94. REGISTER_MEMBER(Color, g);
  95. REGISTER_MEMBER(Color, b);
  96. REGISTER_MEMBER(Color, a);
  97. REGISTER_MEMBER(Color, r8);
  98. REGISTER_MEMBER(Color, g8);
  99. REGISTER_MEMBER(Color, b8);
  100. REGISTER_MEMBER(Color, a8);
  101. REGISTER_MEMBER(Color, h);
  102. REGISTER_MEMBER(Color, s);
  103. REGISTER_MEMBER(Color, v);
  104. }
  105. void unregister_named_setters_getters() {
  106. for (int i = 0; i < Variant::VARIANT_MAX; i++) {
  107. variant_setters_getters[i].clear();
  108. variant_setters_getters_names[i].clear();
  109. }
  110. }
  111. bool Variant::has_member(Variant::Type p_type, const StringName &p_member) {
  112. ERR_FAIL_INDEX_V(p_type, Variant::VARIANT_MAX, false);
  113. for (uint32_t i = 0; i < variant_setters_getters_names[p_type].size(); i++) {
  114. if (variant_setters_getters_names[p_type][i] == p_member) {
  115. return true;
  116. }
  117. }
  118. return false;
  119. }
  120. Variant::Type Variant::get_member_type(Variant::Type p_type, const StringName &p_member) {
  121. ERR_FAIL_INDEX_V(p_type, Variant::VARIANT_MAX, Variant::VARIANT_MAX);
  122. for (uint32_t i = 0; i < variant_setters_getters_names[p_type].size(); i++) {
  123. if (variant_setters_getters_names[p_type][i] == p_member) {
  124. return variant_setters_getters[p_type][i].member_type;
  125. }
  126. }
  127. return Variant::NIL;
  128. }
  129. void Variant::get_member_list(Variant::Type p_type, List<StringName> *r_members) {
  130. for (uint32_t i = 0; i < variant_setters_getters_names[p_type].size(); i++) {
  131. r_members->push_back(variant_setters_getters_names[p_type][i]);
  132. }
  133. }
  134. int Variant::get_member_count(Type p_type) {
  135. ERR_FAIL_INDEX_V(p_type, Variant::VARIANT_MAX, -1);
  136. return variant_setters_getters_names[p_type].size();
  137. }
  138. Variant::ValidatedSetter Variant::get_member_validated_setter(Variant::Type p_type, const StringName &p_member) {
  139. ERR_FAIL_INDEX_V(p_type, Variant::VARIANT_MAX, nullptr);
  140. for (uint32_t i = 0; i < variant_setters_getters_names[p_type].size(); i++) {
  141. if (variant_setters_getters_names[p_type][i] == p_member) {
  142. return variant_setters_getters[p_type][i].validated_setter;
  143. }
  144. }
  145. return nullptr;
  146. }
  147. Variant::ValidatedGetter Variant::get_member_validated_getter(Variant::Type p_type, const StringName &p_member) {
  148. ERR_FAIL_INDEX_V(p_type, Variant::VARIANT_MAX, nullptr);
  149. for (uint32_t i = 0; i < variant_setters_getters_names[p_type].size(); i++) {
  150. if (variant_setters_getters_names[p_type][i] == p_member) {
  151. return variant_setters_getters[p_type][i].validated_getter;
  152. }
  153. }
  154. return nullptr;
  155. }
  156. Variant::PTRSetter Variant::get_member_ptr_setter(Variant::Type p_type, const StringName &p_member) {
  157. ERR_FAIL_INDEX_V(p_type, Variant::VARIANT_MAX, nullptr);
  158. for (uint32_t i = 0; i < variant_setters_getters_names[p_type].size(); i++) {
  159. if (variant_setters_getters_names[p_type][i] == p_member) {
  160. return variant_setters_getters[p_type][i].ptr_setter;
  161. }
  162. }
  163. return nullptr;
  164. }
  165. Variant::PTRGetter Variant::get_member_ptr_getter(Variant::Type p_type, const StringName &p_member) {
  166. ERR_FAIL_INDEX_V(p_type, Variant::VARIANT_MAX, nullptr);
  167. for (uint32_t i = 0; i < variant_setters_getters_names[p_type].size(); i++) {
  168. if (variant_setters_getters_names[p_type][i] == p_member) {
  169. return variant_setters_getters[p_type][i].ptr_getter;
  170. }
  171. }
  172. return nullptr;
  173. }
  174. void Variant::set_named(const StringName &p_member, const Variant &p_value, bool &r_valid) {
  175. uint32_t s = variant_setters_getters[type].size();
  176. if (s) {
  177. for (uint32_t i = 0; i < s; i++) {
  178. if (variant_setters_getters_names[type][i] == p_member) {
  179. variant_setters_getters[type][i].setter(this, &p_value, r_valid);
  180. return;
  181. }
  182. }
  183. r_valid = false;
  184. } else if (type == Variant::OBJECT) {
  185. Object *obj = get_validated_object();
  186. if (!obj) {
  187. r_valid = false;
  188. } else {
  189. obj->set(p_member, p_value, &r_valid);
  190. return;
  191. }
  192. } else if (type == Variant::DICTIONARY) {
  193. Variant *v = VariantGetInternalPtr<Dictionary>::get_ptr(this)->getptr(p_member);
  194. if (v) {
  195. *v = p_value;
  196. r_valid = true;
  197. } else {
  198. VariantGetInternalPtr<Dictionary>::get_ptr(this)->operator[](p_member) = p_value;
  199. r_valid = true;
  200. }
  201. } else {
  202. r_valid = false;
  203. }
  204. }
  205. Variant Variant::get_named(const StringName &p_member, bool &r_valid) const {
  206. Variant ret;
  207. uint32_t s = variant_setters_getters[type].size();
  208. if (s) {
  209. for (uint32_t i = 0; i < s; i++) {
  210. if (variant_setters_getters_names[type][i] == p_member) {
  211. variant_setters_getters[type][i].getter(this, &ret);
  212. r_valid = true;
  213. return ret;
  214. }
  215. }
  216. r_valid = false;
  217. } else if (type == Variant::OBJECT) {
  218. Object *obj = get_validated_object();
  219. if (!obj) {
  220. r_valid = false;
  221. return "Instance base is null.";
  222. } else {
  223. return obj->get(p_member, &r_valid);
  224. }
  225. } else if (type == Variant::DICTIONARY) {
  226. const Variant *v = VariantGetInternalPtr<Dictionary>::get_ptr(this)->getptr(p_member);
  227. if (v) {
  228. r_valid = true;
  229. return *v;
  230. } else {
  231. r_valid = false;
  232. }
  233. } else {
  234. r_valid = false;
  235. }
  236. return ret;
  237. }
  238. /**** INDEXED SETTERS AND GETTERS ****/
  239. #ifdef DEBUG_ENABLED
  240. #define OOB_TEST(m_idx, m_v) \
  241. ERR_FAIL_INDEX(m_idx, m_v)
  242. #else
  243. #define OOB_TEST(m_idx, m_v)
  244. #endif
  245. #ifdef DEBUG_ENABLED
  246. #define NULL_TEST(m_key) \
  247. ERR_FAIL_COND(!m_key)
  248. #else
  249. #define NULL_TEST(m_key)
  250. #endif
  251. #define INDEXED_SETGET_STRUCT_TYPED(m_base_type, m_elem_type) \
  252. struct VariantIndexedSetGet_##m_base_type { \
  253. static void get(const Variant *base, int64_t index, Variant *value, bool *oob) { \
  254. int64_t size = VariantGetInternalPtr<m_base_type>::get_ptr(base)->size(); \
  255. if (index < 0) { \
  256. index += size; \
  257. } \
  258. if (index < 0 || index >= size) { \
  259. *oob = true; \
  260. return; \
  261. } \
  262. VariantTypeAdjust<m_elem_type>::adjust(value); \
  263. *VariantGetInternalPtr<m_elem_type>::get_ptr(value) = (*VariantGetInternalPtr<m_base_type>::get_ptr(base))[index]; \
  264. *oob = false; \
  265. } \
  266. static void ptr_get(const void *base, int64_t index, void *member) { \
  267. /* avoid ptrconvert for performance*/ \
  268. const m_base_type &v = *reinterpret_cast<const m_base_type *>(base); \
  269. if (index < 0) \
  270. index += v.size(); \
  271. OOB_TEST(index, v.size()); \
  272. PtrToArg<m_elem_type>::encode(v[index], member); \
  273. } \
  274. static void set(Variant *base, int64_t index, const Variant *value, bool *valid, bool *oob) { \
  275. if (value->get_type() != GetTypeInfo<m_elem_type>::VARIANT_TYPE) { \
  276. *oob = false; \
  277. *valid = false; \
  278. return; \
  279. } \
  280. int64_t size = VariantGetInternalPtr<m_base_type>::get_ptr(base)->size(); \
  281. if (index < 0) { \
  282. index += size; \
  283. } \
  284. if (index < 0 || index >= size) { \
  285. *oob = true; \
  286. *valid = false; \
  287. return; \
  288. } \
  289. (*VariantGetInternalPtr<m_base_type>::get_ptr(base)).write[index] = *VariantGetInternalPtr<m_elem_type>::get_ptr(value); \
  290. *oob = false; \
  291. *valid = true; \
  292. } \
  293. static void validated_set(Variant *base, int64_t index, const Variant *value, bool *oob) { \
  294. int64_t size = VariantGetInternalPtr<m_base_type>::get_ptr(base)->size(); \
  295. if (index < 0) { \
  296. index += size; \
  297. } \
  298. if (index < 0 || index >= size) { \
  299. *oob = true; \
  300. return; \
  301. } \
  302. (*VariantGetInternalPtr<m_base_type>::get_ptr(base)).write[index] = *VariantGetInternalPtr<m_elem_type>::get_ptr(value); \
  303. *oob = false; \
  304. } \
  305. static void ptr_set(void *base, int64_t index, const void *member) { \
  306. /* avoid ptrconvert for performance*/ \
  307. m_base_type &v = *reinterpret_cast<m_base_type *>(base); \
  308. if (index < 0) \
  309. index += v.size(); \
  310. OOB_TEST(index, v.size()); \
  311. v.write[index] = PtrToArg<m_elem_type>::convert(member); \
  312. } \
  313. static Variant::Type get_index_type() { return GetTypeInfo<m_elem_type>::VARIANT_TYPE; } \
  314. static uint64_t get_indexed_size(const Variant *base) { return VariantGetInternalPtr<m_base_type>::get_ptr(base)->size(); } \
  315. };
  316. #define INDEXED_SETGET_STRUCT_TYPED_NUMERIC(m_base_type, m_elem_type, m_assign_type) \
  317. struct VariantIndexedSetGet_##m_base_type { \
  318. static void get(const Variant *base, int64_t index, Variant *value, bool *oob) { \
  319. int64_t size = VariantGetInternalPtr<m_base_type>::get_ptr(base)->size(); \
  320. if (index < 0) { \
  321. index += size; \
  322. } \
  323. if (index < 0 || index >= size) { \
  324. *oob = true; \
  325. return; \
  326. } \
  327. VariantTypeAdjust<m_elem_type>::adjust(value); \
  328. *VariantGetInternalPtr<m_elem_type>::get_ptr(value) = (*VariantGetInternalPtr<m_base_type>::get_ptr(base))[index]; \
  329. *oob = false; \
  330. } \
  331. static void ptr_get(const void *base, int64_t index, void *member) { \
  332. /* avoid ptrconvert for performance*/ \
  333. const m_base_type &v = *reinterpret_cast<const m_base_type *>(base); \
  334. if (index < 0) \
  335. index += v.size(); \
  336. OOB_TEST(index, v.size()); \
  337. PtrToArg<m_elem_type>::encode(v[index], member); \
  338. } \
  339. static void set(Variant *base, int64_t index, const Variant *value, bool *valid, bool *oob) { \
  340. int64_t size = VariantGetInternalPtr<m_base_type>::get_ptr(base)->size(); \
  341. if (index < 0) { \
  342. index += size; \
  343. } \
  344. if (index < 0 || index >= size) { \
  345. *oob = true; \
  346. *valid = false; \
  347. return; \
  348. } \
  349. m_assign_type num; \
  350. if (value->get_type() == Variant::INT) { \
  351. num = (m_assign_type)*VariantGetInternalPtr<int64_t>::get_ptr(value); \
  352. } else if (value->get_type() == Variant::FLOAT) { \
  353. num = (m_assign_type)*VariantGetInternalPtr<double>::get_ptr(value); \
  354. } else { \
  355. *oob = false; \
  356. *valid = false; \
  357. return; \
  358. } \
  359. (*VariantGetInternalPtr<m_base_type>::get_ptr(base)).write[index] = num; \
  360. *oob = false; \
  361. *valid = true; \
  362. } \
  363. static void validated_set(Variant *base, int64_t index, const Variant *value, bool *oob) { \
  364. int64_t size = VariantGetInternalPtr<m_base_type>::get_ptr(base)->size(); \
  365. if (index < 0) { \
  366. index += size; \
  367. } \
  368. if (index < 0 || index >= size) { \
  369. *oob = true; \
  370. return; \
  371. } \
  372. (*VariantGetInternalPtr<m_base_type>::get_ptr(base)).write[index] = *VariantGetInternalPtr<m_elem_type>::get_ptr(value); \
  373. *oob = false; \
  374. } \
  375. static void ptr_set(void *base, int64_t index, const void *member) { \
  376. /* avoid ptrconvert for performance*/ \
  377. m_base_type &v = *reinterpret_cast<m_base_type *>(base); \
  378. if (index < 0) \
  379. index += v.size(); \
  380. OOB_TEST(index, v.size()); \
  381. v.write[index] = PtrToArg<m_elem_type>::convert(member); \
  382. } \
  383. static Variant::Type get_index_type() { return GetTypeInfo<m_elem_type>::VARIANT_TYPE; } \
  384. static uint64_t get_indexed_size(const Variant *base) { return VariantGetInternalPtr<m_base_type>::get_ptr(base)->size(); } \
  385. };
  386. #define INDEXED_SETGET_STRUCT_BULTIN_NUMERIC(m_base_type, m_elem_type, m_assign_type, m_max) \
  387. struct VariantIndexedSetGet_##m_base_type { \
  388. static void get(const Variant *base, int64_t index, Variant *value, bool *oob) { \
  389. if (index < 0 || index >= m_max) { \
  390. *oob = true; \
  391. return; \
  392. } \
  393. VariantTypeAdjust<m_elem_type>::adjust(value); \
  394. *VariantGetInternalPtr<m_elem_type>::get_ptr(value) = (*VariantGetInternalPtr<m_base_type>::get_ptr(base))[index]; \
  395. *oob = false; \
  396. } \
  397. static void ptr_get(const void *base, int64_t index, void *member) { \
  398. /* avoid ptrconvert for performance*/ \
  399. const m_base_type &v = *reinterpret_cast<const m_base_type *>(base); \
  400. OOB_TEST(index, m_max); \
  401. PtrToArg<m_elem_type>::encode(v[index], member); \
  402. } \
  403. static void set(Variant *base, int64_t index, const Variant *value, bool *valid, bool *oob) { \
  404. if (index < 0 || index >= m_max) { \
  405. *oob = true; \
  406. *valid = false; \
  407. return; \
  408. } \
  409. m_assign_type num; \
  410. if (value->get_type() == Variant::INT) { \
  411. num = (m_assign_type)*VariantGetInternalPtr<int64_t>::get_ptr(value); \
  412. } else if (value->get_type() == Variant::FLOAT) { \
  413. num = (m_assign_type)*VariantGetInternalPtr<double>::get_ptr(value); \
  414. } else { \
  415. *oob = false; \
  416. *valid = false; \
  417. return; \
  418. } \
  419. (*VariantGetInternalPtr<m_base_type>::get_ptr(base))[index] = num; \
  420. *oob = false; \
  421. *valid = true; \
  422. } \
  423. static void validated_set(Variant *base, int64_t index, const Variant *value, bool *oob) { \
  424. if (index < 0 || index >= m_max) { \
  425. *oob = true; \
  426. return; \
  427. } \
  428. (*VariantGetInternalPtr<m_base_type>::get_ptr(base))[index] = *VariantGetInternalPtr<m_elem_type>::get_ptr(value); \
  429. *oob = false; \
  430. } \
  431. static void ptr_set(void *base, int64_t index, const void *member) { \
  432. /* avoid ptrconvert for performance*/ \
  433. m_base_type &v = *reinterpret_cast<m_base_type *>(base); \
  434. OOB_TEST(index, m_max); \
  435. v[index] = PtrToArg<m_elem_type>::convert(member); \
  436. } \
  437. static Variant::Type get_index_type() { return GetTypeInfo<m_elem_type>::VARIANT_TYPE; } \
  438. static uint64_t get_indexed_size(const Variant *base) { return m_max; } \
  439. };
  440. #define INDEXED_SETGET_STRUCT_BULTIN_ACCESSOR(m_base_type, m_elem_type, m_accessor, m_max) \
  441. struct VariantIndexedSetGet_##m_base_type { \
  442. static void get(const Variant *base, int64_t index, Variant *value, bool *oob) { \
  443. if (index < 0 || index >= m_max) { \
  444. *oob = true; \
  445. return; \
  446. } \
  447. VariantTypeAdjust<m_elem_type>::adjust(value); \
  448. *VariantGetInternalPtr<m_elem_type>::get_ptr(value) = (*VariantGetInternalPtr<m_base_type>::get_ptr(base))m_accessor[index]; \
  449. *oob = false; \
  450. } \
  451. static void ptr_get(const void *base, int64_t index, void *member) { \
  452. /* avoid ptrconvert for performance*/ \
  453. const m_base_type &v = *reinterpret_cast<const m_base_type *>(base); \
  454. OOB_TEST(index, m_max); \
  455. PtrToArg<m_elem_type>::encode(v m_accessor[index], member); \
  456. } \
  457. static void set(Variant *base, int64_t index, const Variant *value, bool *valid, bool *oob) { \
  458. if (value->get_type() != GetTypeInfo<m_elem_type>::VARIANT_TYPE) { \
  459. *oob = false; \
  460. *valid = false; \
  461. } \
  462. if (index < 0 || index >= m_max) { \
  463. *oob = true; \
  464. *valid = false; \
  465. return; \
  466. } \
  467. (*VariantGetInternalPtr<m_base_type>::get_ptr(base)) m_accessor[index] = *VariantGetInternalPtr<m_elem_type>::get_ptr(value); \
  468. *oob = false; \
  469. *valid = true; \
  470. } \
  471. static void validated_set(Variant *base, int64_t index, const Variant *value, bool *oob) { \
  472. if (index < 0 || index >= m_max) { \
  473. *oob = true; \
  474. return; \
  475. } \
  476. (*VariantGetInternalPtr<m_base_type>::get_ptr(base)) m_accessor[index] = *VariantGetInternalPtr<m_elem_type>::get_ptr(value); \
  477. *oob = false; \
  478. } \
  479. static void ptr_set(void *base, int64_t index, const void *member) { \
  480. /* avoid ptrconvert for performance*/ \
  481. m_base_type &v = *reinterpret_cast<m_base_type *>(base); \
  482. OOB_TEST(index, m_max); \
  483. v m_accessor[index] = PtrToArg<m_elem_type>::convert(member); \
  484. } \
  485. static Variant::Type get_index_type() { return GetTypeInfo<m_elem_type>::VARIANT_TYPE; } \
  486. static uint64_t get_indexed_size(const Variant *base) { return m_max; } \
  487. };
  488. #define INDEXED_SETGET_STRUCT_BULTIN_FUNC(m_base_type, m_elem_type, m_set, m_get, m_max) \
  489. struct VariantIndexedSetGet_##m_base_type { \
  490. static void get(const Variant *base, int64_t index, Variant *value, bool *oob) { \
  491. if (index < 0 || index >= m_max) { \
  492. *oob = true; \
  493. return; \
  494. } \
  495. VariantTypeAdjust<m_elem_type>::adjust(value); \
  496. *VariantGetInternalPtr<m_elem_type>::get_ptr(value) = VariantGetInternalPtr<m_base_type>::get_ptr(base)->m_get(index); \
  497. *oob = false; \
  498. } \
  499. static void ptr_get(const void *base, int64_t index, void *member) { \
  500. /* avoid ptrconvert for performance*/ \
  501. const m_base_type &v = *reinterpret_cast<const m_base_type *>(base); \
  502. OOB_TEST(index, m_max); \
  503. PtrToArg<m_elem_type>::encode(v.m_get(index), member); \
  504. } \
  505. static void set(Variant *base, int64_t index, const Variant *value, bool *valid, bool *oob) { \
  506. if (value->get_type() != GetTypeInfo<m_elem_type>::VARIANT_TYPE) { \
  507. *oob = false; \
  508. *valid = false; \
  509. } \
  510. if (index < 0 || index >= m_max) { \
  511. *oob = true; \
  512. *valid = false; \
  513. return; \
  514. } \
  515. VariantGetInternalPtr<m_base_type>::get_ptr(base)->m_set(index, *VariantGetInternalPtr<m_elem_type>::get_ptr(value)); \
  516. *oob = false; \
  517. *valid = true; \
  518. } \
  519. static void validated_set(Variant *base, int64_t index, const Variant *value, bool *oob) { \
  520. if (index < 0 || index >= m_max) { \
  521. *oob = true; \
  522. return; \
  523. } \
  524. VariantGetInternalPtr<m_base_type>::get_ptr(base)->m_set(index, *VariantGetInternalPtr<m_elem_type>::get_ptr(value)); \
  525. *oob = false; \
  526. } \
  527. static void ptr_set(void *base, int64_t index, const void *member) { \
  528. /* avoid ptrconvert for performance*/ \
  529. m_base_type &v = *reinterpret_cast<m_base_type *>(base); \
  530. OOB_TEST(index, m_max); \
  531. v.m_set(index, PtrToArg<m_elem_type>::convert(member)); \
  532. } \
  533. static Variant::Type get_index_type() { return GetTypeInfo<m_elem_type>::VARIANT_TYPE; } \
  534. static uint64_t get_indexed_size(const Variant *base) { return m_max; } \
  535. };
  536. struct VariantIndexedSetGet_Array {
  537. static void get(const Variant *base, int64_t index, Variant *value, bool *oob) {
  538. int64_t size = VariantGetInternalPtr<Array>::get_ptr(base)->size();
  539. if (index < 0) {
  540. index += size;
  541. }
  542. if (index < 0 || index >= size) {
  543. *oob = true;
  544. return;
  545. }
  546. *value = (*VariantGetInternalPtr<Array>::get_ptr(base))[index];
  547. *oob = false;
  548. }
  549. static void ptr_get(const void *base, int64_t index, void *member) {
  550. /* avoid ptrconvert for performance*/
  551. const Array &v = *reinterpret_cast<const Array *>(base);
  552. if (index < 0) {
  553. index += v.size();
  554. }
  555. OOB_TEST(index, v.size());
  556. PtrToArg<Variant>::encode(v[index], member);
  557. }
  558. static void set(Variant *base, int64_t index, const Variant *value, bool *valid, bool *oob) {
  559. int64_t size = VariantGetInternalPtr<Array>::get_ptr(base)->size();
  560. if (index < 0) {
  561. index += size;
  562. }
  563. if (index < 0 || index >= size) {
  564. *oob = true;
  565. *valid = false;
  566. return;
  567. }
  568. VariantGetInternalPtr<Array>::get_ptr(base)->set(index, *value);
  569. *oob = false;
  570. *valid = true;
  571. }
  572. static void validated_set(Variant *base, int64_t index, const Variant *value, bool *oob) {
  573. int64_t size = VariantGetInternalPtr<Array>::get_ptr(base)->size();
  574. if (index < 0) {
  575. index += size;
  576. }
  577. if (index < 0 || index >= size) {
  578. *oob = true;
  579. return;
  580. }
  581. VariantGetInternalPtr<Array>::get_ptr(base)->set(index, *value);
  582. *oob = false;
  583. }
  584. static void ptr_set(void *base, int64_t index, const void *member) {
  585. /* avoid ptrconvert for performance*/
  586. Array &v = *reinterpret_cast<Array *>(base);
  587. if (index < 0) {
  588. index += v.size();
  589. }
  590. OOB_TEST(index, v.size());
  591. v.set(index, PtrToArg<Variant>::convert(member));
  592. }
  593. static Variant::Type get_index_type() { return Variant::NIL; }
  594. static uint64_t get_indexed_size(const Variant *base) { return 0; }
  595. };
  596. struct VariantIndexedSetGet_String {
  597. static void get(const Variant *base, int64_t index, Variant *value, bool *oob) {
  598. int64_t length = VariantGetInternalPtr<String>::get_ptr(base)->length();
  599. if (index < 0) {
  600. index += length;
  601. }
  602. if (index < 0 || index >= length) {
  603. *oob = true;
  604. return;
  605. }
  606. char32_t result = (*VariantGetInternalPtr<String>::get_ptr(base))[index];
  607. *value = String(&result, 1);
  608. *oob = false;
  609. }
  610. static void ptr_get(const void *base, int64_t index, void *member) {
  611. /* avoid ptrconvert for performance*/
  612. const String &v = *reinterpret_cast<const String *>(base);
  613. if (index < 0) {
  614. index += v.length();
  615. }
  616. OOB_TEST(index, v.length());
  617. char32_t c = v[index];
  618. PtrToArg<String>::encode(String(&c, 1), member);
  619. }
  620. static void set(Variant *base, int64_t index, const Variant *value, bool *valid, bool *oob) {
  621. if (value->get_type() != Variant::STRING) {
  622. *oob = false;
  623. *valid = false;
  624. return;
  625. }
  626. int64_t length = VariantGetInternalPtr<String>::get_ptr(base)->length();
  627. if (index < 0) {
  628. index += length;
  629. }
  630. if (index < 0 || index >= length) {
  631. *oob = true;
  632. *valid = false;
  633. return;
  634. }
  635. String *b = VariantGetInternalPtr<String>::get_ptr(base);
  636. const String *v = VariantInternal::get_string(value);
  637. if (v->length() == 0) {
  638. b->remove_at(index);
  639. } else {
  640. b->set(index, v->get(0));
  641. }
  642. *oob = false;
  643. *valid = true;
  644. }
  645. static void validated_set(Variant *base, int64_t index, const Variant *value, bool *oob) {
  646. int64_t length = VariantGetInternalPtr<String>::get_ptr(base)->length();
  647. if (index < 0) {
  648. index += length;
  649. }
  650. if (index < 0 || index >= length) {
  651. *oob = true;
  652. return;
  653. }
  654. String *b = VariantGetInternalPtr<String>::get_ptr(base);
  655. const String *v = VariantInternal::get_string(value);
  656. if (v->length() == 0) {
  657. b->remove_at(index);
  658. } else {
  659. b->set(index, v->get(0));
  660. }
  661. *oob = false;
  662. }
  663. static void ptr_set(void *base, int64_t index, const void *member) {
  664. /* avoid ptrconvert for performance*/
  665. String &v = *reinterpret_cast<String *>(base);
  666. if (index < 0) {
  667. index += v.length();
  668. }
  669. OOB_TEST(index, v.length());
  670. const String &m = *reinterpret_cast<const String *>(member);
  671. if (unlikely(m.length() == 0)) {
  672. v.remove_at(index);
  673. } else {
  674. v.set(index, m.unicode_at(0));
  675. }
  676. }
  677. static Variant::Type get_index_type() { return Variant::STRING; }
  678. static uint64_t get_indexed_size(const Variant *base) { return VariantInternal::get_string(base)->length(); }
  679. };
  680. #define INDEXED_SETGET_STRUCT_DICT(m_base_type) \
  681. struct VariantIndexedSetGet_##m_base_type { \
  682. static void get(const Variant *base, int64_t index, Variant *value, bool *oob) { \
  683. const Variant *ptr = VariantGetInternalPtr<m_base_type>::get_ptr(base)->getptr(index); \
  684. if (!ptr) { \
  685. *oob = true; \
  686. return; \
  687. } \
  688. *value = *ptr; \
  689. *oob = false; \
  690. } \
  691. static void ptr_get(const void *base, int64_t index, void *member) { \
  692. /* avoid ptrconvert for performance*/ \
  693. const m_base_type &v = *reinterpret_cast<const m_base_type *>(base); \
  694. const Variant *ptr = v.getptr(index); \
  695. NULL_TEST(ptr); \
  696. PtrToArg<Variant>::encode(*ptr, member); \
  697. } \
  698. static void set(Variant *base, int64_t index, const Variant *value, bool *valid, bool *oob) { \
  699. if (VariantGetInternalPtr<m_base_type>::get_ptr(base)->is_read_only()) { \
  700. *valid = false; \
  701. *oob = true; \
  702. return; \
  703. } \
  704. (*VariantGetInternalPtr<m_base_type>::get_ptr(base))[index] = *value; \
  705. *oob = false; \
  706. *valid = true; \
  707. } \
  708. static void validated_set(Variant *base, int64_t index, const Variant *value, bool *oob) { \
  709. if (VariantGetInternalPtr<m_base_type>::get_ptr(base)->is_read_only()) { \
  710. *oob = true; \
  711. return; \
  712. } \
  713. (*VariantGetInternalPtr<m_base_type>::get_ptr(base))[index] = *value; \
  714. *oob = false; \
  715. } \
  716. static void ptr_set(void *base, int64_t index, const void *member) { \
  717. m_base_type &v = *reinterpret_cast<m_base_type *>(base); \
  718. v[index] = PtrToArg<Variant>::convert(member); \
  719. } \
  720. static Variant::Type get_index_type() { return Variant::NIL; } \
  721. static uint64_t get_indexed_size(const Variant *base) { return VariantGetInternalPtr<m_base_type>::get_ptr(base)->size(); } \
  722. };
  723. INDEXED_SETGET_STRUCT_BULTIN_NUMERIC(Vector2, double, real_t, 2)
  724. INDEXED_SETGET_STRUCT_BULTIN_NUMERIC(Vector2i, int64_t, int32_t, 2)
  725. INDEXED_SETGET_STRUCT_BULTIN_NUMERIC(Vector3, double, real_t, 3)
  726. INDEXED_SETGET_STRUCT_BULTIN_NUMERIC(Vector3i, int64_t, int32_t, 3)
  727. INDEXED_SETGET_STRUCT_BULTIN_NUMERIC(Quaternion, double, real_t, 4)
  728. INDEXED_SETGET_STRUCT_BULTIN_NUMERIC(Color, double, float, 4)
  729. INDEXED_SETGET_STRUCT_BULTIN_ACCESSOR(Transform2D, Vector2, .columns, 3)
  730. INDEXED_SETGET_STRUCT_BULTIN_FUNC(Basis, Vector3, set_column, get_column, 3)
  731. INDEXED_SETGET_STRUCT_TYPED_NUMERIC(PackedByteArray, int64_t, uint8_t)
  732. INDEXED_SETGET_STRUCT_TYPED_NUMERIC(PackedInt32Array, int64_t, int32_t)
  733. INDEXED_SETGET_STRUCT_TYPED_NUMERIC(PackedInt64Array, int64_t, int64_t)
  734. INDEXED_SETGET_STRUCT_TYPED_NUMERIC(PackedFloat32Array, double, float)
  735. INDEXED_SETGET_STRUCT_TYPED_NUMERIC(PackedFloat64Array, double, double)
  736. INDEXED_SETGET_STRUCT_TYPED(PackedVector2Array, Vector2)
  737. INDEXED_SETGET_STRUCT_TYPED(PackedVector3Array, Vector3)
  738. INDEXED_SETGET_STRUCT_TYPED(PackedStringArray, String)
  739. INDEXED_SETGET_STRUCT_TYPED(PackedColorArray, Color)
  740. INDEXED_SETGET_STRUCT_DICT(Dictionary)
  741. struct VariantIndexedSetterGetterInfo {
  742. void (*setter)(Variant *base, int64_t index, const Variant *value, bool *valid, bool *oob) = nullptr;
  743. void (*getter)(const Variant *base, int64_t index, Variant *value, bool *oob) = nullptr;
  744. Variant::ValidatedIndexedSetter validated_setter = nullptr;
  745. Variant::ValidatedIndexedGetter validated_getter = nullptr;
  746. Variant::PTRIndexedSetter ptr_setter = nullptr;
  747. Variant::PTRIndexedGetter ptr_getter = nullptr;
  748. uint64_t (*get_indexed_size)(const Variant *base) = nullptr;
  749. Variant::Type index_type;
  750. bool valid = false;
  751. };
  752. static VariantIndexedSetterGetterInfo variant_indexed_setters_getters[Variant::VARIANT_MAX];
  753. template <class T>
  754. static void register_indexed_member(Variant::Type p_type) {
  755. VariantIndexedSetterGetterInfo &sgi = variant_indexed_setters_getters[p_type];
  756. sgi.setter = T::set;
  757. sgi.validated_setter = T::validated_set;
  758. sgi.ptr_setter = T::ptr_set;
  759. sgi.getter = T::get;
  760. sgi.validated_getter = T::get;
  761. sgi.ptr_getter = T::ptr_get;
  762. sgi.index_type = T::get_index_type();
  763. sgi.get_indexed_size = T::get_indexed_size;
  764. sgi.valid = true;
  765. }
  766. void register_indexed_setters_getters() {
  767. #define REGISTER_INDEXED_MEMBER(m_base_type) register_indexed_member<VariantIndexedSetGet_##m_base_type>(GetTypeInfo<m_base_type>::VARIANT_TYPE)
  768. REGISTER_INDEXED_MEMBER(String);
  769. REGISTER_INDEXED_MEMBER(Vector2);
  770. REGISTER_INDEXED_MEMBER(Vector2i);
  771. REGISTER_INDEXED_MEMBER(Vector3);
  772. REGISTER_INDEXED_MEMBER(Vector3i);
  773. REGISTER_INDEXED_MEMBER(Quaternion);
  774. REGISTER_INDEXED_MEMBER(Color);
  775. REGISTER_INDEXED_MEMBER(Transform2D);
  776. REGISTER_INDEXED_MEMBER(Basis);
  777. REGISTER_INDEXED_MEMBER(PackedByteArray);
  778. REGISTER_INDEXED_MEMBER(PackedInt32Array);
  779. REGISTER_INDEXED_MEMBER(PackedInt64Array);
  780. REGISTER_INDEXED_MEMBER(PackedFloat32Array);
  781. REGISTER_INDEXED_MEMBER(PackedFloat64Array);
  782. REGISTER_INDEXED_MEMBER(PackedVector2Array);
  783. REGISTER_INDEXED_MEMBER(PackedVector3Array);
  784. REGISTER_INDEXED_MEMBER(PackedStringArray);
  785. REGISTER_INDEXED_MEMBER(PackedColorArray);
  786. REGISTER_INDEXED_MEMBER(Array);
  787. REGISTER_INDEXED_MEMBER(Dictionary);
  788. }
  789. static void unregister_indexed_setters_getters() {
  790. }
  791. bool Variant::has_indexing(Variant::Type p_type) {
  792. ERR_FAIL_INDEX_V(p_type, Variant::VARIANT_MAX, false);
  793. return variant_indexed_setters_getters[p_type].valid;
  794. }
  795. Variant::Type Variant::get_indexed_element_type(Variant::Type p_type) {
  796. ERR_FAIL_INDEX_V(p_type, Variant::VARIANT_MAX, Variant::VARIANT_MAX);
  797. return variant_indexed_setters_getters[p_type].index_type;
  798. }
  799. Variant::ValidatedIndexedSetter Variant::get_member_validated_indexed_setter(Variant::Type p_type) {
  800. ERR_FAIL_INDEX_V(p_type, Variant::VARIANT_MAX, nullptr);
  801. return variant_indexed_setters_getters[p_type].validated_setter;
  802. }
  803. Variant::ValidatedIndexedGetter Variant::get_member_validated_indexed_getter(Variant::Type p_type) {
  804. ERR_FAIL_INDEX_V(p_type, Variant::VARIANT_MAX, nullptr);
  805. return variant_indexed_setters_getters[p_type].validated_getter;
  806. }
  807. Variant::PTRIndexedSetter Variant::get_member_ptr_indexed_setter(Variant::Type p_type) {
  808. ERR_FAIL_INDEX_V(p_type, Variant::VARIANT_MAX, nullptr);
  809. return variant_indexed_setters_getters[p_type].ptr_setter;
  810. }
  811. Variant::PTRIndexedGetter Variant::get_member_ptr_indexed_getter(Variant::Type p_type) {
  812. ERR_FAIL_INDEX_V(p_type, Variant::VARIANT_MAX, nullptr);
  813. return variant_indexed_setters_getters[p_type].ptr_getter;
  814. }
  815. void Variant::set_indexed(int64_t p_index, const Variant &p_value, bool &r_valid, bool &r_oob) {
  816. if (likely(variant_indexed_setters_getters[type].valid)) {
  817. variant_indexed_setters_getters[type].setter(this, p_index, &p_value, &r_valid, &r_oob);
  818. } else {
  819. r_valid = false;
  820. r_oob = false;
  821. }
  822. }
  823. Variant Variant::get_indexed(int64_t p_index, bool &r_valid, bool &r_oob) const {
  824. if (likely(variant_indexed_setters_getters[type].valid)) {
  825. Variant ret;
  826. variant_indexed_setters_getters[type].getter(this, p_index, &ret, &r_oob);
  827. r_valid = !r_oob;
  828. return ret;
  829. } else {
  830. r_valid = false;
  831. r_oob = false;
  832. return Variant();
  833. }
  834. }
  835. uint64_t Variant::get_indexed_size() const {
  836. if (likely(variant_indexed_setters_getters[type].valid && variant_indexed_setters_getters[type].get_indexed_size)) {
  837. return variant_indexed_setters_getters[type].get_indexed_size(this);
  838. } else {
  839. return 0;
  840. }
  841. }
  842. struct VariantKeyedSetGetDictionary {
  843. static void get(const Variant *base, const Variant *key, Variant *value, bool *r_valid) {
  844. const Variant *ptr = VariantGetInternalPtr<Dictionary>::get_ptr(base)->getptr(*key);
  845. if (!ptr) {
  846. *r_valid = false;
  847. return;
  848. }
  849. *value = *ptr;
  850. *r_valid = true;
  851. }
  852. static void ptr_get(const void *base, const void *key, void *value) {
  853. /* avoid ptrconvert for performance*/
  854. const Dictionary &v = *reinterpret_cast<const Dictionary *>(base);
  855. const Variant *ptr = v.getptr(PtrToArg<Variant>::convert(key));
  856. NULL_TEST(ptr);
  857. PtrToArg<Variant>::encode(*ptr, value);
  858. }
  859. static void set(Variant *base, const Variant *key, const Variant *value, bool *r_valid) {
  860. if (VariantGetInternalPtr<Dictionary>::get_ptr(base)->is_read_only()) {
  861. *r_valid = false;
  862. return;
  863. }
  864. (*VariantGetInternalPtr<Dictionary>::get_ptr(base))[*key] = *value;
  865. *r_valid = true;
  866. }
  867. static void ptr_set(void *base, const void *key, const void *value) {
  868. Dictionary &v = *reinterpret_cast<Dictionary *>(base);
  869. v[PtrToArg<Variant>::convert(key)] = PtrToArg<Variant>::convert(value);
  870. }
  871. static bool has(const Variant *base, const Variant *key, bool *r_valid) {
  872. *r_valid = true;
  873. return VariantGetInternalPtr<Dictionary>::get_ptr(base)->has(*key);
  874. }
  875. static uint32_t ptr_has(const void *base, const void *key) {
  876. /* avoid ptrconvert for performance*/
  877. const Dictionary &v = *reinterpret_cast<const Dictionary *>(base);
  878. return v.has(PtrToArg<Variant>::convert(key));
  879. }
  880. };
  881. struct VariantKeyedSetGetObject {
  882. static void get(const Variant *base, const Variant *key, Variant *value, bool *r_valid) {
  883. Object *obj = base->get_validated_object();
  884. if (!obj) {
  885. *r_valid = false;
  886. *value = Variant();
  887. return;
  888. }
  889. *value = obj->getvar(*key, r_valid);
  890. }
  891. static void ptr_get(const void *base, const void *key, void *value) {
  892. const Object *obj = PtrToArg<Object *>::convert(base);
  893. NULL_TEST(obj);
  894. Variant v = obj->getvar(PtrToArg<Variant>::convert(key));
  895. PtrToArg<Variant>::encode(v, value);
  896. }
  897. static void set(Variant *base, const Variant *key, const Variant *value, bool *r_valid) {
  898. Object *obj = base->get_validated_object();
  899. if (!obj) {
  900. *r_valid = false;
  901. return;
  902. }
  903. obj->setvar(*key, *value, r_valid);
  904. }
  905. static void ptr_set(void *base, const void *key, const void *value) {
  906. Object *obj = PtrToArg<Object *>::convert(base);
  907. NULL_TEST(obj);
  908. obj->setvar(PtrToArg<Variant>::convert(key), PtrToArg<Variant>::convert(value));
  909. }
  910. static bool has(const Variant *base, const Variant *key, bool *r_valid) {
  911. Object *obj = base->get_validated_object();
  912. if (!obj) {
  913. *r_valid = false;
  914. return false;
  915. }
  916. *r_valid = true;
  917. bool exists;
  918. obj->getvar(*key, &exists);
  919. return exists;
  920. }
  921. static uint32_t ptr_has(const void *base, const void *key) {
  922. const Object *obj = PtrToArg<Object *>::convert(base);
  923. ERR_FAIL_COND_V(!obj, false);
  924. bool valid;
  925. obj->getvar(PtrToArg<Variant>::convert(key), &valid);
  926. return valid;
  927. }
  928. };
  929. struct VariantKeyedSetterGetterInfo {
  930. Variant::ValidatedKeyedSetter validated_setter = nullptr;
  931. Variant::ValidatedKeyedGetter validated_getter = nullptr;
  932. Variant::ValidatedKeyedChecker validated_checker = nullptr;
  933. Variant::PTRKeyedSetter ptr_setter = nullptr;
  934. Variant::PTRKeyedGetter ptr_getter = nullptr;
  935. Variant::PTRKeyedChecker ptr_checker = nullptr;
  936. bool valid = false;
  937. };
  938. static VariantKeyedSetterGetterInfo variant_keyed_setters_getters[Variant::VARIANT_MAX];
  939. template <class T>
  940. static void register_keyed_member(Variant::Type p_type) {
  941. VariantKeyedSetterGetterInfo &sgi = variant_keyed_setters_getters[p_type];
  942. sgi.validated_setter = T::set;
  943. sgi.ptr_setter = T::ptr_set;
  944. sgi.validated_getter = T::get;
  945. sgi.ptr_getter = T::ptr_get;
  946. sgi.validated_checker = T::has;
  947. sgi.ptr_checker = T::ptr_has;
  948. sgi.valid = true;
  949. }
  950. static void register_keyed_setters_getters() {
  951. register_keyed_member<VariantKeyedSetGetDictionary>(Variant::DICTIONARY);
  952. register_keyed_member<VariantKeyedSetGetObject>(Variant::OBJECT);
  953. }
  954. bool Variant::is_keyed(Variant::Type p_type) {
  955. ERR_FAIL_INDEX_V(p_type, VARIANT_MAX, false);
  956. return variant_keyed_setters_getters[p_type].valid;
  957. }
  958. Variant::ValidatedKeyedSetter Variant::get_member_validated_keyed_setter(Variant::Type p_type) {
  959. ERR_FAIL_INDEX_V(p_type, VARIANT_MAX, nullptr);
  960. return variant_keyed_setters_getters[p_type].validated_setter;
  961. }
  962. Variant::ValidatedKeyedGetter Variant::get_member_validated_keyed_getter(Variant::Type p_type) {
  963. ERR_FAIL_INDEX_V(p_type, VARIANT_MAX, nullptr);
  964. return variant_keyed_setters_getters[p_type].validated_getter;
  965. }
  966. Variant::ValidatedKeyedChecker Variant::get_member_validated_keyed_checker(Variant::Type p_type) {
  967. ERR_FAIL_INDEX_V(p_type, VARIANT_MAX, nullptr);
  968. return variant_keyed_setters_getters[p_type].validated_checker;
  969. }
  970. Variant::PTRKeyedSetter Variant::get_member_ptr_keyed_setter(Variant::Type p_type) {
  971. ERR_FAIL_INDEX_V(p_type, VARIANT_MAX, nullptr);
  972. return variant_keyed_setters_getters[p_type].ptr_setter;
  973. }
  974. Variant::PTRKeyedGetter Variant::get_member_ptr_keyed_getter(Variant::Type p_type) {
  975. ERR_FAIL_INDEX_V(p_type, VARIANT_MAX, nullptr);
  976. return variant_keyed_setters_getters[p_type].ptr_getter;
  977. }
  978. Variant::PTRKeyedChecker Variant::get_member_ptr_keyed_checker(Variant::Type p_type) {
  979. ERR_FAIL_INDEX_V(p_type, VARIANT_MAX, nullptr);
  980. return variant_keyed_setters_getters[p_type].ptr_checker;
  981. }
  982. void Variant::set_keyed(const Variant &p_key, const Variant &p_value, bool &r_valid) {
  983. if (likely(variant_keyed_setters_getters[type].valid)) {
  984. variant_keyed_setters_getters[type].validated_setter(this, &p_key, &p_value, &r_valid);
  985. } else {
  986. r_valid = false;
  987. }
  988. }
  989. Variant Variant::get_keyed(const Variant &p_key, bool &r_valid) const {
  990. if (likely(variant_keyed_setters_getters[type].valid)) {
  991. Variant ret;
  992. variant_keyed_setters_getters[type].validated_getter(this, &p_key, &ret, &r_valid);
  993. return ret;
  994. } else {
  995. r_valid = false;
  996. return Variant();
  997. }
  998. }
  999. bool Variant::has_key(const Variant &p_key, bool &r_valid) const {
  1000. if (likely(variant_keyed_setters_getters[type].valid)) {
  1001. return variant_keyed_setters_getters[type].validated_checker(this, &p_key, &r_valid);
  1002. } else {
  1003. r_valid = false;
  1004. return false;
  1005. }
  1006. }
  1007. void Variant::set(const Variant &p_index, const Variant &p_value, bool *r_valid) {
  1008. if (type == DICTIONARY || type == OBJECT) {
  1009. bool valid;
  1010. set_keyed(p_index, p_value, valid);
  1011. if (r_valid) {
  1012. *r_valid = valid;
  1013. }
  1014. } else {
  1015. bool valid = false;
  1016. if (p_index.get_type() == STRING_NAME) {
  1017. set_named(*VariantGetInternalPtr<StringName>::get_ptr(&p_index), p_value, valid);
  1018. } else if (p_index.get_type() == INT) {
  1019. bool obb;
  1020. set_indexed(*VariantGetInternalPtr<int64_t>::get_ptr(&p_index), p_value, valid, obb);
  1021. if (obb) {
  1022. valid = false;
  1023. }
  1024. } else if (p_index.get_type() == STRING) { // less efficient version of named
  1025. set_named(*VariantGetInternalPtr<String>::get_ptr(&p_index), p_value, valid);
  1026. } else if (p_index.get_type() == FLOAT) { // less efficient version of indexed
  1027. bool obb;
  1028. set_indexed(*VariantGetInternalPtr<double>::get_ptr(&p_index), p_value, valid, obb);
  1029. if (obb) {
  1030. valid = false;
  1031. }
  1032. }
  1033. if (r_valid) {
  1034. *r_valid = valid;
  1035. }
  1036. }
  1037. }
  1038. Variant Variant::get(const Variant &p_index, bool *r_valid) const {
  1039. Variant ret;
  1040. if (type == DICTIONARY || type == OBJECT) {
  1041. bool valid;
  1042. ret = get_keyed(p_index, valid);
  1043. if (r_valid) {
  1044. *r_valid = valid;
  1045. }
  1046. } else {
  1047. bool valid = false;
  1048. if (p_index.get_type() == STRING_NAME) {
  1049. ret = get_named(*VariantGetInternalPtr<StringName>::get_ptr(&p_index), valid);
  1050. } else if (p_index.get_type() == INT) {
  1051. bool obb;
  1052. ret = get_indexed(*VariantGetInternalPtr<int64_t>::get_ptr(&p_index), valid, obb);
  1053. if (obb) {
  1054. valid = false;
  1055. }
  1056. } else if (p_index.get_type() == STRING) { // less efficient version of named
  1057. ret = get_named(*VariantGetInternalPtr<String>::get_ptr(&p_index), valid);
  1058. } else if (p_index.get_type() == FLOAT) { // less efficient version of indexed
  1059. bool obb;
  1060. ret = get_indexed(*VariantGetInternalPtr<double>::get_ptr(&p_index), valid, obb);
  1061. if (obb) {
  1062. valid = false;
  1063. }
  1064. }
  1065. if (r_valid) {
  1066. *r_valid = valid;
  1067. }
  1068. }
  1069. return ret;
  1070. }
  1071. void Variant::get_property_list(List<PropertyInfo> *p_list) const {
  1072. if (type == DICTIONARY) {
  1073. const Dictionary *dic = reinterpret_cast<const Dictionary *>(_data._mem);
  1074. List<Variant> keys;
  1075. dic->get_key_list(&keys);
  1076. for (const Variant &E : keys) {
  1077. if (E.get_type() == Variant::STRING) {
  1078. p_list->push_back(PropertyInfo(Variant::STRING, E));
  1079. }
  1080. }
  1081. } else if (type == OBJECT) {
  1082. Object *obj = get_validated_object();
  1083. ERR_FAIL_COND(!obj);
  1084. obj->get_property_list(p_list);
  1085. } else {
  1086. List<StringName> members;
  1087. get_member_list(type, &members);
  1088. for (const StringName &E : members) {
  1089. PropertyInfo pi;
  1090. pi.name = E;
  1091. pi.type = get_member_type(type, E);
  1092. p_list->push_back(pi);
  1093. }
  1094. }
  1095. }
  1096. bool Variant::iter_init(Variant &r_iter, bool &valid) const {
  1097. valid = true;
  1098. switch (type) {
  1099. case INT: {
  1100. r_iter = 0;
  1101. return _data._int > 0;
  1102. } break;
  1103. case FLOAT: {
  1104. r_iter = 0;
  1105. return _data._float > 0.0;
  1106. } break;
  1107. case VECTOR2: {
  1108. double from = reinterpret_cast<const Vector2 *>(_data._mem)->x;
  1109. double to = reinterpret_cast<const Vector2 *>(_data._mem)->y;
  1110. r_iter = from;
  1111. return from < to;
  1112. } break;
  1113. case VECTOR2I: {
  1114. int64_t from = reinterpret_cast<const Vector2i *>(_data._mem)->x;
  1115. int64_t to = reinterpret_cast<const Vector2i *>(_data._mem)->y;
  1116. r_iter = from;
  1117. return from < to;
  1118. } break;
  1119. case VECTOR3: {
  1120. double from = reinterpret_cast<const Vector3 *>(_data._mem)->x;
  1121. double to = reinterpret_cast<const Vector3 *>(_data._mem)->y;
  1122. double step = reinterpret_cast<const Vector3 *>(_data._mem)->z;
  1123. r_iter = from;
  1124. if (from == to) {
  1125. return false;
  1126. } else if (from < to) {
  1127. return step > 0;
  1128. }
  1129. return step < 0;
  1130. } break;
  1131. case VECTOR3I: {
  1132. int64_t from = reinterpret_cast<const Vector3i *>(_data._mem)->x;
  1133. int64_t to = reinterpret_cast<const Vector3i *>(_data._mem)->y;
  1134. int64_t step = reinterpret_cast<const Vector3i *>(_data._mem)->z;
  1135. r_iter = from;
  1136. if (from == to) {
  1137. return false;
  1138. } else if (from < to) {
  1139. return step > 0;
  1140. }
  1141. return step < 0;
  1142. } break;
  1143. case OBJECT: {
  1144. if (!_get_obj().obj) {
  1145. valid = false;
  1146. return false;
  1147. }
  1148. #ifdef DEBUG_ENABLED
  1149. if (EngineDebugger::is_active() && !_get_obj().id.is_ref_counted() && ObjectDB::get_instance(_get_obj().id) == nullptr) {
  1150. valid = false;
  1151. return false;
  1152. }
  1153. #endif
  1154. Callable::CallError ce;
  1155. ce.error = Callable::CallError::CALL_OK;
  1156. Array ref;
  1157. ref.push_back(r_iter);
  1158. Variant vref = ref;
  1159. const Variant *refp[] = { &vref };
  1160. Variant ret = _get_obj().obj->callp(CoreStringNames::get_singleton()->_iter_init, refp, 1, ce);
  1161. if (ref.size() != 1 || ce.error != Callable::CallError::CALL_OK) {
  1162. valid = false;
  1163. return false;
  1164. }
  1165. r_iter = ref[0];
  1166. return ret;
  1167. } break;
  1168. case STRING: {
  1169. const String *str = reinterpret_cast<const String *>(_data._mem);
  1170. if (str->is_empty()) {
  1171. return false;
  1172. }
  1173. r_iter = 0;
  1174. return true;
  1175. } break;
  1176. case DICTIONARY: {
  1177. const Dictionary *dic = reinterpret_cast<const Dictionary *>(_data._mem);
  1178. if (dic->is_empty()) {
  1179. return false;
  1180. }
  1181. const Variant *next = dic->next(nullptr);
  1182. r_iter = *next;
  1183. return true;
  1184. } break;
  1185. case ARRAY: {
  1186. const Array *arr = reinterpret_cast<const Array *>(_data._mem);
  1187. if (arr->is_empty()) {
  1188. return false;
  1189. }
  1190. r_iter = 0;
  1191. return true;
  1192. } break;
  1193. case PACKED_BYTE_ARRAY: {
  1194. const Vector<uint8_t> *arr = &PackedArrayRef<uint8_t>::get_array(_data.packed_array);
  1195. if (arr->size() == 0) {
  1196. return false;
  1197. }
  1198. r_iter = 0;
  1199. return true;
  1200. } break;
  1201. case PACKED_INT32_ARRAY: {
  1202. const Vector<int32_t> *arr = &PackedArrayRef<int32_t>::get_array(_data.packed_array);
  1203. if (arr->size() == 0) {
  1204. return false;
  1205. }
  1206. r_iter = 0;
  1207. return true;
  1208. } break;
  1209. case PACKED_INT64_ARRAY: {
  1210. const Vector<int64_t> *arr = &PackedArrayRef<int64_t>::get_array(_data.packed_array);
  1211. if (arr->size() == 0) {
  1212. return false;
  1213. }
  1214. r_iter = 0;
  1215. return true;
  1216. } break;
  1217. case PACKED_FLOAT32_ARRAY: {
  1218. const Vector<float> *arr = &PackedArrayRef<float>::get_array(_data.packed_array);
  1219. if (arr->size() == 0) {
  1220. return false;
  1221. }
  1222. r_iter = 0;
  1223. return true;
  1224. } break;
  1225. case PACKED_FLOAT64_ARRAY: {
  1226. const Vector<double> *arr = &PackedArrayRef<double>::get_array(_data.packed_array);
  1227. if (arr->size() == 0) {
  1228. return false;
  1229. }
  1230. r_iter = 0;
  1231. return true;
  1232. } break;
  1233. case PACKED_STRING_ARRAY: {
  1234. const Vector<String> *arr = &PackedArrayRef<String>::get_array(_data.packed_array);
  1235. if (arr->size() == 0) {
  1236. return false;
  1237. }
  1238. r_iter = 0;
  1239. return true;
  1240. } break;
  1241. case PACKED_VECTOR2_ARRAY: {
  1242. const Vector<Vector2> *arr = &PackedArrayRef<Vector2>::get_array(_data.packed_array);
  1243. if (arr->size() == 0) {
  1244. return false;
  1245. }
  1246. r_iter = 0;
  1247. return true;
  1248. } break;
  1249. case PACKED_VECTOR3_ARRAY: {
  1250. const Vector<Vector3> *arr = &PackedArrayRef<Vector3>::get_array(_data.packed_array);
  1251. if (arr->size() == 0) {
  1252. return false;
  1253. }
  1254. r_iter = 0;
  1255. return true;
  1256. } break;
  1257. case PACKED_COLOR_ARRAY: {
  1258. const Vector<Color> *arr = &PackedArrayRef<Color>::get_array(_data.packed_array);
  1259. if (arr->size() == 0) {
  1260. return false;
  1261. }
  1262. r_iter = 0;
  1263. return true;
  1264. } break;
  1265. default: {
  1266. }
  1267. }
  1268. valid = false;
  1269. return false;
  1270. }
  1271. bool Variant::iter_next(Variant &r_iter, bool &valid) const {
  1272. valid = true;
  1273. switch (type) {
  1274. case INT: {
  1275. int64_t idx = r_iter;
  1276. idx++;
  1277. if (idx >= _data._int) {
  1278. return false;
  1279. }
  1280. r_iter = idx;
  1281. return true;
  1282. } break;
  1283. case FLOAT: {
  1284. int64_t idx = r_iter;
  1285. idx++;
  1286. if (idx >= _data._float) {
  1287. return false;
  1288. }
  1289. r_iter = idx;
  1290. return true;
  1291. } break;
  1292. case VECTOR2: {
  1293. double to = reinterpret_cast<const Vector2 *>(_data._mem)->y;
  1294. double idx = r_iter;
  1295. idx++;
  1296. if (idx >= to) {
  1297. return false;
  1298. }
  1299. r_iter = idx;
  1300. return true;
  1301. } break;
  1302. case VECTOR2I: {
  1303. int64_t to = reinterpret_cast<const Vector2i *>(_data._mem)->y;
  1304. int64_t idx = r_iter;
  1305. idx++;
  1306. if (idx >= to) {
  1307. return false;
  1308. }
  1309. r_iter = idx;
  1310. return true;
  1311. } break;
  1312. case VECTOR3: {
  1313. double to = reinterpret_cast<const Vector3 *>(_data._mem)->y;
  1314. double step = reinterpret_cast<const Vector3 *>(_data._mem)->z;
  1315. double idx = r_iter;
  1316. idx += step;
  1317. if (step < 0 && idx <= to) {
  1318. return false;
  1319. }
  1320. if (step > 0 && idx >= to) {
  1321. return false;
  1322. }
  1323. r_iter = idx;
  1324. return true;
  1325. } break;
  1326. case VECTOR3I: {
  1327. int64_t to = reinterpret_cast<const Vector3i *>(_data._mem)->y;
  1328. int64_t step = reinterpret_cast<const Vector3i *>(_data._mem)->z;
  1329. int64_t idx = r_iter;
  1330. idx += step;
  1331. if (step < 0 && idx <= to) {
  1332. return false;
  1333. }
  1334. if (step > 0 && idx >= to) {
  1335. return false;
  1336. }
  1337. r_iter = idx;
  1338. return true;
  1339. } break;
  1340. case OBJECT: {
  1341. if (!_get_obj().obj) {
  1342. valid = false;
  1343. return false;
  1344. }
  1345. #ifdef DEBUG_ENABLED
  1346. if (EngineDebugger::is_active() && !_get_obj().id.is_ref_counted() && ObjectDB::get_instance(_get_obj().id) == nullptr) {
  1347. valid = false;
  1348. return false;
  1349. }
  1350. #endif
  1351. Callable::CallError ce;
  1352. ce.error = Callable::CallError::CALL_OK;
  1353. Array ref;
  1354. ref.push_back(r_iter);
  1355. Variant vref = ref;
  1356. const Variant *refp[] = { &vref };
  1357. Variant ret = _get_obj().obj->callp(CoreStringNames::get_singleton()->_iter_next, refp, 1, ce);
  1358. if (ref.size() != 1 || ce.error != Callable::CallError::CALL_OK) {
  1359. valid = false;
  1360. return false;
  1361. }
  1362. r_iter = ref[0];
  1363. return ret;
  1364. } break;
  1365. case STRING: {
  1366. const String *str = reinterpret_cast<const String *>(_data._mem);
  1367. int idx = r_iter;
  1368. idx++;
  1369. if (idx >= str->length()) {
  1370. return false;
  1371. }
  1372. r_iter = idx;
  1373. return true;
  1374. } break;
  1375. case DICTIONARY: {
  1376. const Dictionary *dic = reinterpret_cast<const Dictionary *>(_data._mem);
  1377. const Variant *next = dic->next(&r_iter);
  1378. if (!next) {
  1379. return false;
  1380. }
  1381. r_iter = *next;
  1382. return true;
  1383. } break;
  1384. case ARRAY: {
  1385. const Array *arr = reinterpret_cast<const Array *>(_data._mem);
  1386. int idx = r_iter;
  1387. idx++;
  1388. if (idx >= arr->size()) {
  1389. return false;
  1390. }
  1391. r_iter = idx;
  1392. return true;
  1393. } break;
  1394. case PACKED_BYTE_ARRAY: {
  1395. const Vector<uint8_t> *arr = &PackedArrayRef<uint8_t>::get_array(_data.packed_array);
  1396. int idx = r_iter;
  1397. idx++;
  1398. if (idx >= arr->size()) {
  1399. return false;
  1400. }
  1401. r_iter = idx;
  1402. return true;
  1403. } break;
  1404. case PACKED_INT32_ARRAY: {
  1405. const Vector<int32_t> *arr = &PackedArrayRef<int32_t>::get_array(_data.packed_array);
  1406. int32_t idx = r_iter;
  1407. idx++;
  1408. if (idx >= arr->size()) {
  1409. return false;
  1410. }
  1411. r_iter = idx;
  1412. return true;
  1413. } break;
  1414. case PACKED_INT64_ARRAY: {
  1415. const Vector<int64_t> *arr = &PackedArrayRef<int64_t>::get_array(_data.packed_array);
  1416. int64_t idx = r_iter;
  1417. idx++;
  1418. if (idx >= arr->size()) {
  1419. return false;
  1420. }
  1421. r_iter = idx;
  1422. return true;
  1423. } break;
  1424. case PACKED_FLOAT32_ARRAY: {
  1425. const Vector<float> *arr = &PackedArrayRef<float>::get_array(_data.packed_array);
  1426. int idx = r_iter;
  1427. idx++;
  1428. if (idx >= arr->size()) {
  1429. return false;
  1430. }
  1431. r_iter = idx;
  1432. return true;
  1433. } break;
  1434. case PACKED_FLOAT64_ARRAY: {
  1435. const Vector<double> *arr = &PackedArrayRef<double>::get_array(_data.packed_array);
  1436. int idx = r_iter;
  1437. idx++;
  1438. if (idx >= arr->size()) {
  1439. return false;
  1440. }
  1441. r_iter = idx;
  1442. return true;
  1443. } break;
  1444. case PACKED_STRING_ARRAY: {
  1445. const Vector<String> *arr = &PackedArrayRef<String>::get_array(_data.packed_array);
  1446. int idx = r_iter;
  1447. idx++;
  1448. if (idx >= arr->size()) {
  1449. return false;
  1450. }
  1451. r_iter = idx;
  1452. return true;
  1453. } break;
  1454. case PACKED_VECTOR2_ARRAY: {
  1455. const Vector<Vector2> *arr = &PackedArrayRef<Vector2>::get_array(_data.packed_array);
  1456. int idx = r_iter;
  1457. idx++;
  1458. if (idx >= arr->size()) {
  1459. return false;
  1460. }
  1461. r_iter = idx;
  1462. return true;
  1463. } break;
  1464. case PACKED_VECTOR3_ARRAY: {
  1465. const Vector<Vector3> *arr = &PackedArrayRef<Vector3>::get_array(_data.packed_array);
  1466. int idx = r_iter;
  1467. idx++;
  1468. if (idx >= arr->size()) {
  1469. return false;
  1470. }
  1471. r_iter = idx;
  1472. return true;
  1473. } break;
  1474. case PACKED_COLOR_ARRAY: {
  1475. const Vector<Color> *arr = &PackedArrayRef<Color>::get_array(_data.packed_array);
  1476. int idx = r_iter;
  1477. idx++;
  1478. if (idx >= arr->size()) {
  1479. return false;
  1480. }
  1481. r_iter = idx;
  1482. return true;
  1483. } break;
  1484. default: {
  1485. }
  1486. }
  1487. valid = false;
  1488. return false;
  1489. }
  1490. Variant Variant::iter_get(const Variant &r_iter, bool &r_valid) const {
  1491. r_valid = true;
  1492. switch (type) {
  1493. case INT: {
  1494. return r_iter;
  1495. } break;
  1496. case FLOAT: {
  1497. return r_iter;
  1498. } break;
  1499. case VECTOR2: {
  1500. return r_iter;
  1501. } break;
  1502. case VECTOR2I: {
  1503. return r_iter;
  1504. } break;
  1505. case VECTOR3: {
  1506. return r_iter;
  1507. } break;
  1508. case VECTOR3I: {
  1509. return r_iter;
  1510. } break;
  1511. case OBJECT: {
  1512. if (!_get_obj().obj) {
  1513. r_valid = false;
  1514. return Variant();
  1515. }
  1516. #ifdef DEBUG_ENABLED
  1517. if (EngineDebugger::is_active() && !_get_obj().id.is_ref_counted() && ObjectDB::get_instance(_get_obj().id) == nullptr) {
  1518. r_valid = false;
  1519. return Variant();
  1520. }
  1521. #endif
  1522. Callable::CallError ce;
  1523. ce.error = Callable::CallError::CALL_OK;
  1524. const Variant *refp[] = { &r_iter };
  1525. Variant ret = _get_obj().obj->callp(CoreStringNames::get_singleton()->_iter_get, refp, 1, ce);
  1526. if (ce.error != Callable::CallError::CALL_OK) {
  1527. r_valid = false;
  1528. return Variant();
  1529. }
  1530. //r_iter=ref[0];
  1531. return ret;
  1532. } break;
  1533. case STRING: {
  1534. const String *str = reinterpret_cast<const String *>(_data._mem);
  1535. return str->substr(r_iter, 1);
  1536. } break;
  1537. case DICTIONARY: {
  1538. return r_iter; //iterator is the same as the key
  1539. } break;
  1540. case ARRAY: {
  1541. const Array *arr = reinterpret_cast<const Array *>(_data._mem);
  1542. int idx = r_iter;
  1543. #ifdef DEBUG_ENABLED
  1544. if (idx < 0 || idx >= arr->size()) {
  1545. r_valid = false;
  1546. return Variant();
  1547. }
  1548. #endif
  1549. return arr->get(idx);
  1550. } break;
  1551. case PACKED_BYTE_ARRAY: {
  1552. const Vector<uint8_t> *arr = &PackedArrayRef<uint8_t>::get_array(_data.packed_array);
  1553. int idx = r_iter;
  1554. #ifdef DEBUG_ENABLED
  1555. if (idx < 0 || idx >= arr->size()) {
  1556. r_valid = false;
  1557. return Variant();
  1558. }
  1559. #endif
  1560. return arr->get(idx);
  1561. } break;
  1562. case PACKED_INT32_ARRAY: {
  1563. const Vector<int32_t> *arr = &PackedArrayRef<int32_t>::get_array(_data.packed_array);
  1564. int32_t idx = r_iter;
  1565. #ifdef DEBUG_ENABLED
  1566. if (idx < 0 || idx >= arr->size()) {
  1567. r_valid = false;
  1568. return Variant();
  1569. }
  1570. #endif
  1571. return arr->get(idx);
  1572. } break;
  1573. case PACKED_INT64_ARRAY: {
  1574. const Vector<int64_t> *arr = &PackedArrayRef<int64_t>::get_array(_data.packed_array);
  1575. int64_t idx = r_iter;
  1576. #ifdef DEBUG_ENABLED
  1577. if (idx < 0 || idx >= arr->size()) {
  1578. r_valid = false;
  1579. return Variant();
  1580. }
  1581. #endif
  1582. return arr->get(idx);
  1583. } break;
  1584. case PACKED_FLOAT32_ARRAY: {
  1585. const Vector<float> *arr = &PackedArrayRef<float>::get_array(_data.packed_array);
  1586. int idx = r_iter;
  1587. #ifdef DEBUG_ENABLED
  1588. if (idx < 0 || idx >= arr->size()) {
  1589. r_valid = false;
  1590. return Variant();
  1591. }
  1592. #endif
  1593. return arr->get(idx);
  1594. } break;
  1595. case PACKED_FLOAT64_ARRAY: {
  1596. const Vector<double> *arr = &PackedArrayRef<double>::get_array(_data.packed_array);
  1597. int idx = r_iter;
  1598. #ifdef DEBUG_ENABLED
  1599. if (idx < 0 || idx >= arr->size()) {
  1600. r_valid = false;
  1601. return Variant();
  1602. }
  1603. #endif
  1604. return arr->get(idx);
  1605. } break;
  1606. case PACKED_STRING_ARRAY: {
  1607. const Vector<String> *arr = &PackedArrayRef<String>::get_array(_data.packed_array);
  1608. int idx = r_iter;
  1609. #ifdef DEBUG_ENABLED
  1610. if (idx < 0 || idx >= arr->size()) {
  1611. r_valid = false;
  1612. return Variant();
  1613. }
  1614. #endif
  1615. return arr->get(idx);
  1616. } break;
  1617. case PACKED_VECTOR2_ARRAY: {
  1618. const Vector<Vector2> *arr = &PackedArrayRef<Vector2>::get_array(_data.packed_array);
  1619. int idx = r_iter;
  1620. #ifdef DEBUG_ENABLED
  1621. if (idx < 0 || idx >= arr->size()) {
  1622. r_valid = false;
  1623. return Variant();
  1624. }
  1625. #endif
  1626. return arr->get(idx);
  1627. } break;
  1628. case PACKED_VECTOR3_ARRAY: {
  1629. const Vector<Vector3> *arr = &PackedArrayRef<Vector3>::get_array(_data.packed_array);
  1630. int idx = r_iter;
  1631. #ifdef DEBUG_ENABLED
  1632. if (idx < 0 || idx >= arr->size()) {
  1633. r_valid = false;
  1634. return Variant();
  1635. }
  1636. #endif
  1637. return arr->get(idx);
  1638. } break;
  1639. case PACKED_COLOR_ARRAY: {
  1640. const Vector<Color> *arr = &PackedArrayRef<Color>::get_array(_data.packed_array);
  1641. int idx = r_iter;
  1642. #ifdef DEBUG_ENABLED
  1643. if (idx < 0 || idx >= arr->size()) {
  1644. r_valid = false;
  1645. return Variant();
  1646. }
  1647. #endif
  1648. return arr->get(idx);
  1649. } break;
  1650. default: {
  1651. }
  1652. }
  1653. r_valid = false;
  1654. return Variant();
  1655. }
  1656. Variant Variant::duplicate(bool p_deep) const {
  1657. return recursive_duplicate(p_deep, 0);
  1658. }
  1659. Variant Variant::recursive_duplicate(bool p_deep, int recursion_count) const {
  1660. switch (type) {
  1661. case OBJECT: {
  1662. /* breaks stuff :(
  1663. if (p_deep && !_get_obj().ref.is_null()) {
  1664. Ref<Resource> resource = _get_obj().ref;
  1665. if (resource.is_valid()) {
  1666. return resource->duplicate(true);
  1667. }
  1668. }
  1669. */
  1670. return *this;
  1671. } break;
  1672. case DICTIONARY:
  1673. return operator Dictionary().recursive_duplicate(p_deep, recursion_count);
  1674. case ARRAY:
  1675. return operator Array().recursive_duplicate(p_deep, recursion_count);
  1676. case PACKED_BYTE_ARRAY:
  1677. return operator Vector<uint8_t>().duplicate();
  1678. case PACKED_INT32_ARRAY:
  1679. return operator Vector<int32_t>().duplicate();
  1680. case PACKED_INT64_ARRAY:
  1681. return operator Vector<int64_t>().duplicate();
  1682. case PACKED_FLOAT32_ARRAY:
  1683. return operator Vector<float>().duplicate();
  1684. case PACKED_FLOAT64_ARRAY:
  1685. return operator Vector<double>().duplicate();
  1686. case PACKED_STRING_ARRAY:
  1687. return operator Vector<String>().duplicate();
  1688. case PACKED_VECTOR2_ARRAY:
  1689. return operator Vector<Vector2>().duplicate();
  1690. case PACKED_VECTOR3_ARRAY:
  1691. return operator Vector<Vector3>().duplicate();
  1692. case PACKED_COLOR_ARRAY:
  1693. return operator Vector<Color>().duplicate();
  1694. default:
  1695. return *this;
  1696. }
  1697. }
  1698. void Variant::sub(const Variant &a, const Variant &b, Variant &r_dst) {
  1699. if (a.type != b.type) {
  1700. return;
  1701. }
  1702. switch (a.type) {
  1703. case NIL: {
  1704. r_dst = Variant();
  1705. }
  1706. return;
  1707. case INT: {
  1708. int64_t va = a._data._int;
  1709. int64_t vb = b._data._int;
  1710. r_dst = int(va - vb);
  1711. }
  1712. return;
  1713. case FLOAT: {
  1714. double ra = a._data._float;
  1715. double rb = b._data._float;
  1716. r_dst = ra - rb;
  1717. }
  1718. return;
  1719. case VECTOR2: {
  1720. r_dst = *reinterpret_cast<const Vector2 *>(a._data._mem) - *reinterpret_cast<const Vector2 *>(b._data._mem);
  1721. }
  1722. return;
  1723. case VECTOR2I: {
  1724. int32_t vax = reinterpret_cast<const Vector2i *>(a._data._mem)->x;
  1725. int32_t vbx = reinterpret_cast<const Vector2i *>(b._data._mem)->x;
  1726. int32_t vay = reinterpret_cast<const Vector2i *>(a._data._mem)->y;
  1727. int32_t vby = reinterpret_cast<const Vector2i *>(b._data._mem)->y;
  1728. r_dst = Vector2i(int32_t(vax - vbx), int32_t(vay - vby));
  1729. }
  1730. return;
  1731. case RECT2: {
  1732. const Rect2 *ra = reinterpret_cast<const Rect2 *>(a._data._mem);
  1733. const Rect2 *rb = reinterpret_cast<const Rect2 *>(b._data._mem);
  1734. r_dst = Rect2(ra->position - rb->position, ra->size - rb->size);
  1735. }
  1736. return;
  1737. case RECT2I: {
  1738. const Rect2i *ra = reinterpret_cast<const Rect2i *>(a._data._mem);
  1739. const Rect2i *rb = reinterpret_cast<const Rect2i *>(b._data._mem);
  1740. int32_t vax = ra->position.x;
  1741. int32_t vay = ra->position.y;
  1742. int32_t vbx = ra->size.x;
  1743. int32_t vby = ra->size.y;
  1744. int32_t vcx = rb->position.x;
  1745. int32_t vcy = rb->position.y;
  1746. int32_t vdx = rb->size.x;
  1747. int32_t vdy = rb->size.y;
  1748. r_dst = Rect2i(int32_t(vax - vbx), int32_t(vay - vby), int32_t(vcx - vdx), int32_t(vcy - vdy));
  1749. }
  1750. return;
  1751. case VECTOR3: {
  1752. r_dst = *reinterpret_cast<const Vector3 *>(a._data._mem) - *reinterpret_cast<const Vector3 *>(b._data._mem);
  1753. }
  1754. return;
  1755. case VECTOR3I: {
  1756. int32_t vax = reinterpret_cast<const Vector3i *>(a._data._mem)->x;
  1757. int32_t vbx = reinterpret_cast<const Vector3i *>(b._data._mem)->x;
  1758. int32_t vay = reinterpret_cast<const Vector3i *>(a._data._mem)->y;
  1759. int32_t vby = reinterpret_cast<const Vector3i *>(b._data._mem)->y;
  1760. int32_t vaz = reinterpret_cast<const Vector3i *>(a._data._mem)->z;
  1761. int32_t vbz = reinterpret_cast<const Vector3i *>(b._data._mem)->z;
  1762. r_dst = Vector3i(int32_t(vax - vbx), int32_t(vay - vby), int32_t(vaz - vbz));
  1763. }
  1764. return;
  1765. case AABB: {
  1766. const ::AABB *ra = reinterpret_cast<const ::AABB *>(a._data._mem);
  1767. const ::AABB *rb = reinterpret_cast<const ::AABB *>(b._data._mem);
  1768. r_dst = ::AABB(ra->position - rb->position, ra->size - rb->size);
  1769. }
  1770. return;
  1771. case QUATERNION: {
  1772. Quaternion empty_rot;
  1773. const Quaternion *qa = reinterpret_cast<const Quaternion *>(a._data._mem);
  1774. const Quaternion *qb = reinterpret_cast<const Quaternion *>(b._data._mem);
  1775. r_dst = (*qb).inverse() * *qa;
  1776. }
  1777. return;
  1778. case COLOR: {
  1779. const Color *ca = reinterpret_cast<const Color *>(a._data._mem);
  1780. const Color *cb = reinterpret_cast<const Color *>(b._data._mem);
  1781. float new_r = ca->r - cb->r;
  1782. float new_g = ca->g - cb->g;
  1783. float new_b = ca->b - cb->b;
  1784. float new_a = ca->a - cb->a;
  1785. new_r = new_r > 1.0 ? 1.0 : new_r;
  1786. new_g = new_g > 1.0 ? 1.0 : new_g;
  1787. new_b = new_b > 1.0 ? 1.0 : new_b;
  1788. new_a = new_a > 1.0 ? 1.0 : new_a;
  1789. r_dst = Color(new_r, new_g, new_b, new_a);
  1790. }
  1791. return;
  1792. default: {
  1793. r_dst = a;
  1794. }
  1795. return;
  1796. }
  1797. }
  1798. void Variant::blend(const Variant &a, const Variant &b, float c, Variant &r_dst) {
  1799. if (a.type != b.type) {
  1800. if (a.is_num() && b.is_num()) {
  1801. real_t va = a;
  1802. real_t vb = b;
  1803. r_dst = va + vb * c;
  1804. } else {
  1805. r_dst = a;
  1806. }
  1807. return;
  1808. }
  1809. switch (a.type) {
  1810. case NIL: {
  1811. r_dst = Variant();
  1812. }
  1813. return;
  1814. case INT: {
  1815. int64_t va = a._data._int;
  1816. int64_t vb = b._data._int;
  1817. r_dst = int(va + vb * c + 0.5);
  1818. }
  1819. return;
  1820. case FLOAT: {
  1821. double ra = a._data._float;
  1822. double rb = b._data._float;
  1823. r_dst = ra + rb * c;
  1824. }
  1825. return;
  1826. case VECTOR2: {
  1827. r_dst = *reinterpret_cast<const Vector2 *>(a._data._mem) + *reinterpret_cast<const Vector2 *>(b._data._mem) * c;
  1828. }
  1829. return;
  1830. case VECTOR2I: {
  1831. int32_t vax = reinterpret_cast<const Vector2i *>(a._data._mem)->x;
  1832. int32_t vbx = reinterpret_cast<const Vector2i *>(b._data._mem)->x;
  1833. int32_t vay = reinterpret_cast<const Vector2i *>(a._data._mem)->y;
  1834. int32_t vby = reinterpret_cast<const Vector2i *>(b._data._mem)->y;
  1835. r_dst = Vector2i(int32_t(vax + vbx * c + 0.5), int32_t(vay + vby * c + 0.5));
  1836. }
  1837. return;
  1838. case RECT2: {
  1839. const Rect2 *ra = reinterpret_cast<const Rect2 *>(a._data._mem);
  1840. const Rect2 *rb = reinterpret_cast<const Rect2 *>(b._data._mem);
  1841. r_dst = Rect2(ra->position + rb->position * c, ra->size + rb->size * c);
  1842. }
  1843. return;
  1844. case RECT2I: {
  1845. const Rect2i *ra = reinterpret_cast<const Rect2i *>(a._data._mem);
  1846. const Rect2i *rb = reinterpret_cast<const Rect2i *>(b._data._mem);
  1847. int32_t vax = ra->position.x;
  1848. int32_t vay = ra->position.y;
  1849. int32_t vbx = ra->size.x;
  1850. int32_t vby = ra->size.y;
  1851. int32_t vcx = rb->position.x;
  1852. int32_t vcy = rb->position.y;
  1853. int32_t vdx = rb->size.x;
  1854. int32_t vdy = rb->size.y;
  1855. r_dst = Rect2i(int32_t(vax + vbx * c + 0.5), int32_t(vay + vby * c + 0.5), int32_t(vcx + vdx * c + 0.5), int32_t(vcy + vdy * c + 0.5));
  1856. }
  1857. return;
  1858. case VECTOR3: {
  1859. r_dst = *reinterpret_cast<const Vector3 *>(a._data._mem) + *reinterpret_cast<const Vector3 *>(b._data._mem) * c;
  1860. }
  1861. return;
  1862. case VECTOR3I: {
  1863. int32_t vax = reinterpret_cast<const Vector3i *>(a._data._mem)->x;
  1864. int32_t vbx = reinterpret_cast<const Vector3i *>(b._data._mem)->x;
  1865. int32_t vay = reinterpret_cast<const Vector3i *>(a._data._mem)->y;
  1866. int32_t vby = reinterpret_cast<const Vector3i *>(b._data._mem)->y;
  1867. int32_t vaz = reinterpret_cast<const Vector3i *>(a._data._mem)->z;
  1868. int32_t vbz = reinterpret_cast<const Vector3i *>(b._data._mem)->z;
  1869. r_dst = Vector3i(int32_t(vax + vbx * c + 0.5), int32_t(vay + vby * c + 0.5), int32_t(vaz + vbz * c + 0.5));
  1870. }
  1871. return;
  1872. case AABB: {
  1873. const ::AABB *ra = reinterpret_cast<const ::AABB *>(a._data._mem);
  1874. const ::AABB *rb = reinterpret_cast<const ::AABB *>(b._data._mem);
  1875. r_dst = ::AABB(ra->position + rb->position * c, ra->size + rb->size * c);
  1876. }
  1877. return;
  1878. case QUATERNION: {
  1879. Quaternion empty_rot;
  1880. const Quaternion *qa = reinterpret_cast<const Quaternion *>(a._data._mem);
  1881. const Quaternion *qb = reinterpret_cast<const Quaternion *>(b._data._mem);
  1882. r_dst = *qa * empty_rot.slerp(*qb, c);
  1883. }
  1884. return;
  1885. case COLOR: {
  1886. const Color *ca = reinterpret_cast<const Color *>(a._data._mem);
  1887. const Color *cb = reinterpret_cast<const Color *>(b._data._mem);
  1888. float new_r = ca->r + cb->r * c;
  1889. float new_g = ca->g + cb->g * c;
  1890. float new_b = ca->b + cb->b * c;
  1891. float new_a = ca->a + cb->a * c;
  1892. new_r = new_r > 1.0 ? 1.0 : new_r;
  1893. new_g = new_g > 1.0 ? 1.0 : new_g;
  1894. new_b = new_b > 1.0 ? 1.0 : new_b;
  1895. new_a = new_a > 1.0 ? 1.0 : new_a;
  1896. r_dst = Color(new_r, new_g, new_b, new_a);
  1897. }
  1898. return;
  1899. default: {
  1900. r_dst = c < 0.5 ? a : b;
  1901. }
  1902. return;
  1903. }
  1904. }
  1905. void Variant::interpolate(const Variant &a, const Variant &b, float c, Variant &r_dst) {
  1906. if (a.type != b.type) {
  1907. if (a.is_num() && b.is_num()) {
  1908. //not as efficient but..
  1909. real_t va = a;
  1910. real_t vb = b;
  1911. r_dst = va + (vb - va) * c;
  1912. } else {
  1913. r_dst = a;
  1914. }
  1915. return;
  1916. }
  1917. switch (a.type) {
  1918. case NIL: {
  1919. r_dst = Variant();
  1920. }
  1921. return;
  1922. case BOOL: {
  1923. r_dst = a;
  1924. }
  1925. return;
  1926. case INT: {
  1927. int64_t va = a._data._int;
  1928. int64_t vb = b._data._int;
  1929. r_dst = int(va + (vb - va) * c);
  1930. }
  1931. return;
  1932. case FLOAT: {
  1933. real_t va = a._data._float;
  1934. real_t vb = b._data._float;
  1935. r_dst = va + (vb - va) * c;
  1936. }
  1937. return;
  1938. case STRING: {
  1939. //this is pretty funny and bizarre, but artists like to use it for typewriter effects
  1940. String sa = *reinterpret_cast<const String *>(a._data._mem);
  1941. String sb = *reinterpret_cast<const String *>(b._data._mem);
  1942. String dst;
  1943. int sa_len = sa.length();
  1944. int sb_len = sb.length();
  1945. int csize = sa_len + (sb_len - sa_len) * c;
  1946. if (csize == 0) {
  1947. r_dst = "";
  1948. return;
  1949. }
  1950. dst.resize(csize + 1);
  1951. dst[csize] = 0;
  1952. int split = csize / 2;
  1953. for (int i = 0; i < csize; i++) {
  1954. char32_t chr = ' ';
  1955. if (i < split) {
  1956. if (i < sa.length()) {
  1957. chr = sa[i];
  1958. } else if (i < sb.length()) {
  1959. chr = sb[i];
  1960. }
  1961. } else {
  1962. if (i < sb.length()) {
  1963. chr = sb[i];
  1964. } else if (i < sa.length()) {
  1965. chr = sa[i];
  1966. }
  1967. }
  1968. dst[i] = chr;
  1969. }
  1970. r_dst = dst;
  1971. }
  1972. return;
  1973. case VECTOR2: {
  1974. r_dst = reinterpret_cast<const Vector2 *>(a._data._mem)->lerp(*reinterpret_cast<const Vector2 *>(b._data._mem), c);
  1975. }
  1976. return;
  1977. case VECTOR2I: {
  1978. int32_t vax = reinterpret_cast<const Vector2i *>(a._data._mem)->x;
  1979. int32_t vbx = reinterpret_cast<const Vector2i *>(b._data._mem)->x;
  1980. int32_t vay = reinterpret_cast<const Vector2i *>(a._data._mem)->y;
  1981. int32_t vby = reinterpret_cast<const Vector2i *>(b._data._mem)->y;
  1982. r_dst = Vector2i(int32_t(vax + vbx * c + 0.5), int32_t(vay + vby * c + 0.5));
  1983. }
  1984. return;
  1985. case RECT2: {
  1986. r_dst = Rect2(reinterpret_cast<const Rect2 *>(a._data._mem)->position.lerp(reinterpret_cast<const Rect2 *>(b._data._mem)->position, c), reinterpret_cast<const Rect2 *>(a._data._mem)->size.lerp(reinterpret_cast<const Rect2 *>(b._data._mem)->size, c));
  1987. }
  1988. return;
  1989. case RECT2I: {
  1990. const Rect2i *ra = reinterpret_cast<const Rect2i *>(a._data._mem);
  1991. const Rect2i *rb = reinterpret_cast<const Rect2i *>(b._data._mem);
  1992. int32_t vax = ra->position.x;
  1993. int32_t vay = ra->position.y;
  1994. int32_t vbx = ra->size.x;
  1995. int32_t vby = ra->size.y;
  1996. int32_t vcx = rb->position.x;
  1997. int32_t vcy = rb->position.y;
  1998. int32_t vdx = rb->size.x;
  1999. int32_t vdy = rb->size.y;
  2000. r_dst = Rect2i(int32_t(vax + vbx * c + 0.5), int32_t(vay + vby * c + 0.5), int32_t(vcx + vdx * c + 0.5), int32_t(vcy + vdy * c + 0.5));
  2001. }
  2002. return;
  2003. case VECTOR3: {
  2004. r_dst = reinterpret_cast<const Vector3 *>(a._data._mem)->lerp(*reinterpret_cast<const Vector3 *>(b._data._mem), c);
  2005. }
  2006. return;
  2007. case VECTOR3I: {
  2008. int32_t vax = reinterpret_cast<const Vector3i *>(a._data._mem)->x;
  2009. int32_t vbx = reinterpret_cast<const Vector3i *>(b._data._mem)->x;
  2010. int32_t vay = reinterpret_cast<const Vector3i *>(a._data._mem)->y;
  2011. int32_t vby = reinterpret_cast<const Vector3i *>(b._data._mem)->y;
  2012. int32_t vaz = reinterpret_cast<const Vector3i *>(a._data._mem)->z;
  2013. int32_t vbz = reinterpret_cast<const Vector3i *>(b._data._mem)->z;
  2014. r_dst = Vector3i(int32_t(vax + vbx * c + 0.5), int32_t(vay + vby * c + 0.5), int32_t(vaz + vbz * c + 0.5));
  2015. }
  2016. return;
  2017. case TRANSFORM2D: {
  2018. r_dst = a._data._transform2d->interpolate_with(*b._data._transform2d, c);
  2019. }
  2020. return;
  2021. case PLANE: {
  2022. r_dst = a;
  2023. }
  2024. return;
  2025. case QUATERNION: {
  2026. r_dst = reinterpret_cast<const Quaternion *>(a._data._mem)->slerp(*reinterpret_cast<const Quaternion *>(b._data._mem), c);
  2027. }
  2028. return;
  2029. case AABB: {
  2030. r_dst = ::AABB(a._data._aabb->position.lerp(b._data._aabb->position, c), a._data._aabb->size.lerp(b._data._aabb->size, c));
  2031. }
  2032. return;
  2033. case BASIS: {
  2034. r_dst = a._data._basis->lerp(*b._data._basis, c);
  2035. }
  2036. return;
  2037. case TRANSFORM3D: {
  2038. r_dst = a._data._transform3d->interpolate_with(*b._data._transform3d, c);
  2039. }
  2040. return;
  2041. case COLOR: {
  2042. r_dst = reinterpret_cast<const Color *>(a._data._mem)->lerp(*reinterpret_cast<const Color *>(b._data._mem), c);
  2043. }
  2044. return;
  2045. case STRING_NAME: {
  2046. r_dst = a;
  2047. }
  2048. return;
  2049. case NODE_PATH: {
  2050. r_dst = a;
  2051. }
  2052. return;
  2053. case RID: {
  2054. r_dst = a;
  2055. }
  2056. return;
  2057. case OBJECT: {
  2058. r_dst = a;
  2059. }
  2060. return;
  2061. case DICTIONARY: {
  2062. }
  2063. return;
  2064. case ARRAY: {
  2065. r_dst = a;
  2066. }
  2067. return;
  2068. case PACKED_BYTE_ARRAY: {
  2069. r_dst = a;
  2070. }
  2071. return;
  2072. case PACKED_INT32_ARRAY: {
  2073. const Vector<int32_t> *arr_a = &PackedArrayRef<int32_t>::get_array(a._data.packed_array);
  2074. const Vector<int32_t> *arr_b = &PackedArrayRef<int32_t>::get_array(b._data.packed_array);
  2075. int32_t sz = arr_a->size();
  2076. if (sz == 0 || arr_b->size() != sz) {
  2077. r_dst = a;
  2078. } else {
  2079. Vector<int32_t> v;
  2080. v.resize(sz);
  2081. {
  2082. int32_t *vw = v.ptrw();
  2083. const int32_t *ar = arr_a->ptr();
  2084. const int32_t *br = arr_b->ptr();
  2085. Variant va;
  2086. for (int32_t i = 0; i < sz; i++) {
  2087. Variant::interpolate(ar[i], br[i], c, va);
  2088. vw[i] = va;
  2089. }
  2090. }
  2091. r_dst = v;
  2092. }
  2093. }
  2094. return;
  2095. case PACKED_INT64_ARRAY: {
  2096. const Vector<int64_t> *arr_a = &PackedArrayRef<int64_t>::get_array(a._data.packed_array);
  2097. const Vector<int64_t> *arr_b = &PackedArrayRef<int64_t>::get_array(b._data.packed_array);
  2098. int64_t sz = arr_a->size();
  2099. if (sz == 0 || arr_b->size() != sz) {
  2100. r_dst = a;
  2101. } else {
  2102. Vector<int64_t> v;
  2103. v.resize(sz);
  2104. {
  2105. int64_t *vw = v.ptrw();
  2106. const int64_t *ar = arr_a->ptr();
  2107. const int64_t *br = arr_b->ptr();
  2108. Variant va;
  2109. for (int64_t i = 0; i < sz; i++) {
  2110. Variant::interpolate(ar[i], br[i], c, va);
  2111. vw[i] = va;
  2112. }
  2113. }
  2114. r_dst = v;
  2115. }
  2116. }
  2117. return;
  2118. case PACKED_FLOAT32_ARRAY: {
  2119. const Vector<float> *arr_a = &PackedArrayRef<float>::get_array(a._data.packed_array);
  2120. const Vector<float> *arr_b = &PackedArrayRef<float>::get_array(b._data.packed_array);
  2121. int sz = arr_a->size();
  2122. if (sz == 0 || arr_b->size() != sz) {
  2123. r_dst = a;
  2124. } else {
  2125. Vector<float> v;
  2126. v.resize(sz);
  2127. {
  2128. float *vw = v.ptrw();
  2129. const float *ar = arr_a->ptr();
  2130. const float *br = arr_b->ptr();
  2131. Variant va;
  2132. for (int i = 0; i < sz; i++) {
  2133. Variant::interpolate(ar[i], br[i], c, va);
  2134. vw[i] = va;
  2135. }
  2136. }
  2137. r_dst = v;
  2138. }
  2139. }
  2140. return;
  2141. case PACKED_FLOAT64_ARRAY: {
  2142. const Vector<double> *arr_a = &PackedArrayRef<double>::get_array(a._data.packed_array);
  2143. const Vector<double> *arr_b = &PackedArrayRef<double>::get_array(b._data.packed_array);
  2144. int sz = arr_a->size();
  2145. if (sz == 0 || arr_b->size() != sz) {
  2146. r_dst = a;
  2147. } else {
  2148. Vector<double> v;
  2149. v.resize(sz);
  2150. {
  2151. double *vw = v.ptrw();
  2152. const double *ar = arr_a->ptr();
  2153. const double *br = arr_b->ptr();
  2154. Variant va;
  2155. for (int i = 0; i < sz; i++) {
  2156. Variant::interpolate(ar[i], br[i], c, va);
  2157. vw[i] = va;
  2158. }
  2159. }
  2160. r_dst = v;
  2161. }
  2162. }
  2163. return;
  2164. case PACKED_STRING_ARRAY: {
  2165. r_dst = a;
  2166. }
  2167. return;
  2168. case PACKED_VECTOR2_ARRAY: {
  2169. const Vector<Vector2> *arr_a = &PackedArrayRef<Vector2>::get_array(a._data.packed_array);
  2170. const Vector<Vector2> *arr_b = &PackedArrayRef<Vector2>::get_array(b._data.packed_array);
  2171. int sz = arr_a->size();
  2172. if (sz == 0 || arr_b->size() != sz) {
  2173. r_dst = a;
  2174. } else {
  2175. Vector<Vector2> v;
  2176. v.resize(sz);
  2177. {
  2178. Vector2 *vw = v.ptrw();
  2179. const Vector2 *ar = arr_a->ptr();
  2180. const Vector2 *br = arr_b->ptr();
  2181. for (int i = 0; i < sz; i++) {
  2182. vw[i] = ar[i].lerp(br[i], c);
  2183. }
  2184. }
  2185. r_dst = v;
  2186. }
  2187. }
  2188. return;
  2189. case PACKED_VECTOR3_ARRAY: {
  2190. const Vector<Vector3> *arr_a = &PackedArrayRef<Vector3>::get_array(a._data.packed_array);
  2191. const Vector<Vector3> *arr_b = &PackedArrayRef<Vector3>::get_array(b._data.packed_array);
  2192. int sz = arr_a->size();
  2193. if (sz == 0 || arr_b->size() != sz) {
  2194. r_dst = a;
  2195. } else {
  2196. Vector<Vector3> v;
  2197. v.resize(sz);
  2198. {
  2199. Vector3 *vw = v.ptrw();
  2200. const Vector3 *ar = arr_a->ptr();
  2201. const Vector3 *br = arr_b->ptr();
  2202. for (int i = 0; i < sz; i++) {
  2203. vw[i] = ar[i].lerp(br[i], c);
  2204. }
  2205. }
  2206. r_dst = v;
  2207. }
  2208. }
  2209. return;
  2210. case PACKED_COLOR_ARRAY: {
  2211. const Vector<Color> *arr_a = &PackedArrayRef<Color>::get_array(a._data.packed_array);
  2212. const Vector<Color> *arr_b = &PackedArrayRef<Color>::get_array(b._data.packed_array);
  2213. int sz = arr_a->size();
  2214. if (sz == 0 || arr_b->size() != sz) {
  2215. r_dst = a;
  2216. } else {
  2217. Vector<Color> v;
  2218. v.resize(sz);
  2219. {
  2220. Color *vw = v.ptrw();
  2221. const Color *ar = arr_a->ptr();
  2222. const Color *br = arr_b->ptr();
  2223. for (int i = 0; i < sz; i++) {
  2224. vw[i] = ar[i].lerp(br[i], c);
  2225. }
  2226. }
  2227. r_dst = v;
  2228. }
  2229. }
  2230. return;
  2231. default: {
  2232. r_dst = a;
  2233. }
  2234. }
  2235. }
  2236. void Variant::_register_variant_setters_getters() {
  2237. register_named_setters_getters();
  2238. register_indexed_setters_getters();
  2239. register_keyed_setters_getters();
  2240. }
  2241. void Variant::_unregister_variant_setters_getters() {
  2242. unregister_named_setters_getters();
  2243. unregister_indexed_setters_getters();
  2244. }