variant_setget.cpp 99 KB

1234567891011121314151617181920212223242526272829303132333435363738394041424344454647484950515253545556575859606162636465666768697071727374757677787980818283848586878889909192939495969798991001011021031041051061071081091101111121131141151161171181191201211221231241251261271281291301311321331341351361371381391401411421431441451461471481491501511521531541551561571581591601611621631641651661671681691701711721731741751761771781791801811821831841851861871881891901911921931941951961971981992002012022032042052062072082092102112122132142152162172182192202212222232242252262272282292302312322332342352362372382392402412422432442452462472482492502512522532542552562572582592602612622632642652662672682692702712722732742752762772782792802812822832842852862872882892902912922932942952962972982993003013023033043053063073083093103113123133143153163173183193203213223233243253263273283293303313323333343353363373383393403413423433443453463473483493503513523533543553563573583593603613623633643653663673683693703713723733743753763773783793803813823833843853863873883893903913923933943953963973983994004014024034044054064074084094104114124134144154164174184194204214224234244254264274284294304314324334344354364374384394404414424434444454464474484494504514524534544554564574584594604614624634644654664674684694704714724734744754764774784794804814824834844854864874884894904914924934944954964974984995005015025035045055065075085095105115125135145155165175185195205215225235245255265275285295305315325335345355365375385395405415425435445455465475485495505515525535545555565575585595605615625635645655665675685695705715725735745755765775785795805815825835845855865875885895905915925935945955965975985996006016026036046056066076086096106116126136146156166176186196206216226236246256266276286296306316326336346356366376386396406416426436446456466476486496506516526536546556566576586596606616626636646656666676686696706716726736746756766776786796806816826836846856866876886896906916926936946956966976986997007017027037047057067077087097107117127137147157167177187197207217227237247257267277287297307317327337347357367377387397407417427437447457467477487497507517527537547557567577587597607617627637647657667677687697707717727737747757767777787797807817827837847857867877887897907917927937947957967977987998008018028038048058068078088098108118128138148158168178188198208218228238248258268278288298308318328338348358368378388398408418428438448458468478488498508518528538548558568578588598608618628638648658668678688698708718728738748758768778788798808818828838848858868878888898908918928938948958968978988999009019029039049059069079089099109119129139149159169179189199209219229239249259269279289299309319329339349359369379389399409419429439449459469479489499509519529539549559569579589599609619629639649659669679689699709719729739749759769779789799809819829839849859869879889899909919929939949959969979989991000100110021003100410051006100710081009101010111012101310141015101610171018101910201021102210231024102510261027102810291030103110321033103410351036103710381039104010411042104310441045104610471048104910501051105210531054105510561057105810591060106110621063106410651066106710681069107010711072107310741075107610771078107910801081108210831084108510861087108810891090109110921093109410951096109710981099110011011102110311041105110611071108110911101111111211131114111511161117111811191120112111221123112411251126112711281129113011311132113311341135113611371138113911401141114211431144114511461147114811491150115111521153115411551156115711581159116011611162116311641165116611671168116911701171117211731174117511761177117811791180118111821183118411851186118711881189119011911192119311941195119611971198119912001201120212031204120512061207120812091210121112121213121412151216121712181219122012211222122312241225122612271228122912301231123212331234123512361237123812391240124112421243124412451246124712481249125012511252125312541255125612571258125912601261126212631264126512661267126812691270127112721273127412751276127712781279128012811282128312841285128612871288128912901291129212931294129512961297129812991300130113021303130413051306130713081309131013111312131313141315131613171318131913201321132213231324132513261327132813291330133113321333133413351336133713381339134013411342134313441345134613471348134913501351135213531354135513561357135813591360136113621363136413651366136713681369137013711372137313741375137613771378137913801381138213831384138513861387138813891390139113921393139413951396139713981399140014011402140314041405140614071408140914101411141214131414141514161417141814191420142114221423142414251426142714281429143014311432143314341435143614371438143914401441144214431444144514461447144814491450145114521453145414551456145714581459146014611462146314641465146614671468146914701471147214731474147514761477147814791480148114821483148414851486148714881489149014911492149314941495149614971498149915001501150215031504150515061507150815091510151115121513151415151516151715181519152015211522152315241525152615271528152915301531153215331534153515361537153815391540154115421543154415451546154715481549155015511552155315541555155615571558155915601561156215631564156515661567156815691570157115721573157415751576157715781579158015811582158315841585158615871588158915901591159215931594159515961597159815991600160116021603160416051606160716081609161016111612161316141615161616171618161916201621162216231624162516261627162816291630163116321633163416351636163716381639164016411642164316441645164616471648164916501651165216531654165516561657165816591660166116621663166416651666166716681669167016711672167316741675167616771678167916801681168216831684168516861687168816891690169116921693169416951696169716981699170017011702170317041705170617071708170917101711171217131714171517161717171817191720172117221723172417251726172717281729173017311732173317341735173617371738173917401741174217431744174517461747174817491750175117521753175417551756175717581759176017611762176317641765176617671768176917701771177217731774177517761777177817791780178117821783178417851786178717881789179017911792179317941795179617971798179918001801180218031804180518061807180818091810181118121813181418151816181718181819182018211822182318241825182618271828182918301831183218331834183518361837183818391840184118421843184418451846184718481849185018511852185318541855185618571858185918601861186218631864186518661867186818691870187118721873187418751876187718781879188018811882188318841885188618871888188918901891189218931894189518961897189818991900190119021903190419051906190719081909191019111912191319141915191619171918191919201921192219231924192519261927192819291930193119321933193419351936193719381939194019411942194319441945194619471948194919501951195219531954195519561957195819591960196119621963196419651966196719681969197019711972197319741975197619771978197919801981198219831984198519861987198819891990199119921993199419951996199719981999200020012002200320042005200620072008200920102011201220132014201520162017201820192020202120222023202420252026202720282029203020312032203320342035203620372038203920402041204220432044204520462047204820492050205120522053205420552056205720582059206020612062206320642065206620672068206920702071207220732074207520762077207820792080208120822083208420852086208720882089209020912092209320942095209620972098209921002101210221032104210521062107210821092110211121122113211421152116211721182119212021212122212321242125212621272128212921302131213221332134213521362137213821392140214121422143214421452146214721482149215021512152215321542155215621572158215921602161216221632164216521662167216821692170217121722173217421752176217721782179218021812182218321842185218621872188218921902191219221932194219521962197219821992200220122022203220422052206220722082209221022112212221322142215221622172218221922202221222222232224222522262227222822292230223122322233223422352236223722382239224022412242224322442245224622472248224922502251225222532254225522562257225822592260226122622263226422652266226722682269227022712272227322742275227622772278227922802281228222832284228522862287228822892290229122922293229422952296229722982299230023012302230323042305230623072308230923102311231223132314231523162317231823192320232123222323232423252326232723282329233023312332233323342335233623372338233923402341234223432344234523462347234823492350235123522353235423552356235723582359236023612362236323642365236623672368236923702371237223732374237523762377237823792380238123822383238423852386238723882389239023912392239323942395239623972398239924002401240224032404240524062407240824092410241124122413241424152416241724182419242024212422242324242425242624272428242924302431243224332434243524362437243824392440244124422443244424452446244724482449245024512452245324542455245624572458245924602461246224632464246524662467
  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. if (VariantGetInternalPtr<Array>::get_ptr(base)->is_read_only()) {
  560. *valid = false;
  561. *oob = true;
  562. return;
  563. }
  564. int64_t size = VariantGetInternalPtr<Array>::get_ptr(base)->size();
  565. if (index < 0) {
  566. index += size;
  567. }
  568. if (index < 0 || index >= size) {
  569. *oob = true;
  570. *valid = false;
  571. return;
  572. }
  573. VariantGetInternalPtr<Array>::get_ptr(base)->set(index, *value);
  574. *oob = false;
  575. *valid = true;
  576. }
  577. static void validated_set(Variant *base, int64_t index, const Variant *value, bool *oob) {
  578. if (VariantGetInternalPtr<Array>::get_ptr(base)->is_read_only()) {
  579. *oob = true;
  580. return;
  581. }
  582. int64_t size = VariantGetInternalPtr<Array>::get_ptr(base)->size();
  583. if (index < 0) {
  584. index += size;
  585. }
  586. if (index < 0 || index >= size) {
  587. *oob = true;
  588. return;
  589. }
  590. VariantGetInternalPtr<Array>::get_ptr(base)->set(index, *value);
  591. *oob = false;
  592. }
  593. static void ptr_set(void *base, int64_t index, const void *member) {
  594. /* avoid ptrconvert for performance*/
  595. Array &v = *reinterpret_cast<Array *>(base);
  596. if (index < 0) {
  597. index += v.size();
  598. }
  599. OOB_TEST(index, v.size());
  600. v.set(index, PtrToArg<Variant>::convert(member));
  601. }
  602. static Variant::Type get_index_type() { return Variant::NIL; }
  603. static uint64_t get_indexed_size(const Variant *base) { return 0; }
  604. };
  605. struct VariantIndexedSetGet_String {
  606. static void get(const Variant *base, int64_t index, Variant *value, bool *oob) {
  607. int64_t length = VariantGetInternalPtr<String>::get_ptr(base)->length();
  608. if (index < 0) {
  609. index += length;
  610. }
  611. if (index < 0 || index >= length) {
  612. *oob = true;
  613. return;
  614. }
  615. char32_t result = (*VariantGetInternalPtr<String>::get_ptr(base))[index];
  616. *value = String(&result, 1);
  617. *oob = false;
  618. }
  619. static void ptr_get(const void *base, int64_t index, void *member) {
  620. /* avoid ptrconvert for performance*/
  621. const String &v = *reinterpret_cast<const String *>(base);
  622. if (index < 0) {
  623. index += v.length();
  624. }
  625. OOB_TEST(index, v.length());
  626. char32_t c = v[index];
  627. PtrToArg<String>::encode(String(&c, 1), member);
  628. }
  629. static void set(Variant *base, int64_t index, const Variant *value, bool *valid, bool *oob) {
  630. if (value->get_type() != Variant::STRING) {
  631. *oob = false;
  632. *valid = false;
  633. return;
  634. }
  635. int64_t length = VariantGetInternalPtr<String>::get_ptr(base)->length();
  636. if (index < 0) {
  637. index += length;
  638. }
  639. if (index < 0 || index >= length) {
  640. *oob = true;
  641. *valid = false;
  642. return;
  643. }
  644. String *b = VariantGetInternalPtr<String>::get_ptr(base);
  645. const String *v = VariantInternal::get_string(value);
  646. if (v->length() == 0) {
  647. b->remove_at(index);
  648. } else {
  649. b->set(index, v->get(0));
  650. }
  651. *oob = false;
  652. *valid = true;
  653. }
  654. static void validated_set(Variant *base, int64_t index, const Variant *value, bool *oob) {
  655. int64_t length = VariantGetInternalPtr<String>::get_ptr(base)->length();
  656. if (index < 0) {
  657. index += length;
  658. }
  659. if (index < 0 || index >= length) {
  660. *oob = true;
  661. return;
  662. }
  663. String *b = VariantGetInternalPtr<String>::get_ptr(base);
  664. const String *v = VariantInternal::get_string(value);
  665. if (v->length() == 0) {
  666. b->remove_at(index);
  667. } else {
  668. b->set(index, v->get(0));
  669. }
  670. *oob = false;
  671. }
  672. static void ptr_set(void *base, int64_t index, const void *member) {
  673. /* avoid ptrconvert for performance*/
  674. String &v = *reinterpret_cast<String *>(base);
  675. if (index < 0) {
  676. index += v.length();
  677. }
  678. OOB_TEST(index, v.length());
  679. const String &m = *reinterpret_cast<const String *>(member);
  680. if (unlikely(m.length() == 0)) {
  681. v.remove_at(index);
  682. } else {
  683. v.set(index, m.unicode_at(0));
  684. }
  685. }
  686. static Variant::Type get_index_type() { return Variant::STRING; }
  687. static uint64_t get_indexed_size(const Variant *base) { return VariantInternal::get_string(base)->length(); }
  688. };
  689. #define INDEXED_SETGET_STRUCT_DICT(m_base_type) \
  690. struct VariantIndexedSetGet_##m_base_type { \
  691. static void get(const Variant *base, int64_t index, Variant *value, bool *oob) { \
  692. const Variant *ptr = VariantGetInternalPtr<m_base_type>::get_ptr(base)->getptr(index); \
  693. if (!ptr) { \
  694. *oob = true; \
  695. return; \
  696. } \
  697. *value = *ptr; \
  698. *oob = false; \
  699. } \
  700. static void ptr_get(const void *base, int64_t index, void *member) { \
  701. /* avoid ptrconvert for performance*/ \
  702. const m_base_type &v = *reinterpret_cast<const m_base_type *>(base); \
  703. const Variant *ptr = v.getptr(index); \
  704. NULL_TEST(ptr); \
  705. PtrToArg<Variant>::encode(*ptr, member); \
  706. } \
  707. static void set(Variant *base, int64_t index, const Variant *value, bool *valid, bool *oob) { \
  708. if (VariantGetInternalPtr<m_base_type>::get_ptr(base)->is_read_only()) { \
  709. *valid = false; \
  710. *oob = true; \
  711. return; \
  712. } \
  713. (*VariantGetInternalPtr<m_base_type>::get_ptr(base))[index] = *value; \
  714. *oob = false; \
  715. *valid = true; \
  716. } \
  717. static void validated_set(Variant *base, int64_t index, const Variant *value, bool *oob) { \
  718. if (VariantGetInternalPtr<m_base_type>::get_ptr(base)->is_read_only()) { \
  719. *oob = true; \
  720. return; \
  721. } \
  722. (*VariantGetInternalPtr<m_base_type>::get_ptr(base))[index] = *value; \
  723. *oob = false; \
  724. } \
  725. static void ptr_set(void *base, int64_t index, const void *member) { \
  726. m_base_type &v = *reinterpret_cast<m_base_type *>(base); \
  727. v[index] = PtrToArg<Variant>::convert(member); \
  728. } \
  729. static Variant::Type get_index_type() { return Variant::NIL; } \
  730. static uint64_t get_indexed_size(const Variant *base) { return VariantGetInternalPtr<m_base_type>::get_ptr(base)->size(); } \
  731. };
  732. INDEXED_SETGET_STRUCT_BULTIN_NUMERIC(Vector2, double, real_t, 2)
  733. INDEXED_SETGET_STRUCT_BULTIN_NUMERIC(Vector2i, int64_t, int32_t, 2)
  734. INDEXED_SETGET_STRUCT_BULTIN_NUMERIC(Vector3, double, real_t, 3)
  735. INDEXED_SETGET_STRUCT_BULTIN_NUMERIC(Vector3i, int64_t, int32_t, 3)
  736. INDEXED_SETGET_STRUCT_BULTIN_NUMERIC(Quaternion, double, real_t, 4)
  737. INDEXED_SETGET_STRUCT_BULTIN_NUMERIC(Color, double, float, 4)
  738. INDEXED_SETGET_STRUCT_BULTIN_ACCESSOR(Transform2D, Vector2, .columns, 3)
  739. INDEXED_SETGET_STRUCT_BULTIN_FUNC(Basis, Vector3, set_column, get_column, 3)
  740. INDEXED_SETGET_STRUCT_TYPED_NUMERIC(PackedByteArray, int64_t, uint8_t)
  741. INDEXED_SETGET_STRUCT_TYPED_NUMERIC(PackedInt32Array, int64_t, int32_t)
  742. INDEXED_SETGET_STRUCT_TYPED_NUMERIC(PackedInt64Array, int64_t, int64_t)
  743. INDEXED_SETGET_STRUCT_TYPED_NUMERIC(PackedFloat32Array, double, float)
  744. INDEXED_SETGET_STRUCT_TYPED_NUMERIC(PackedFloat64Array, double, double)
  745. INDEXED_SETGET_STRUCT_TYPED(PackedVector2Array, Vector2)
  746. INDEXED_SETGET_STRUCT_TYPED(PackedVector3Array, Vector3)
  747. INDEXED_SETGET_STRUCT_TYPED(PackedStringArray, String)
  748. INDEXED_SETGET_STRUCT_TYPED(PackedColorArray, Color)
  749. INDEXED_SETGET_STRUCT_DICT(Dictionary)
  750. struct VariantIndexedSetterGetterInfo {
  751. void (*setter)(Variant *base, int64_t index, const Variant *value, bool *valid, bool *oob) = nullptr;
  752. void (*getter)(const Variant *base, int64_t index, Variant *value, bool *oob) = nullptr;
  753. Variant::ValidatedIndexedSetter validated_setter = nullptr;
  754. Variant::ValidatedIndexedGetter validated_getter = nullptr;
  755. Variant::PTRIndexedSetter ptr_setter = nullptr;
  756. Variant::PTRIndexedGetter ptr_getter = nullptr;
  757. uint64_t (*get_indexed_size)(const Variant *base) = nullptr;
  758. Variant::Type index_type;
  759. bool valid = false;
  760. };
  761. static VariantIndexedSetterGetterInfo variant_indexed_setters_getters[Variant::VARIANT_MAX];
  762. template <class T>
  763. static void register_indexed_member(Variant::Type p_type) {
  764. VariantIndexedSetterGetterInfo &sgi = variant_indexed_setters_getters[p_type];
  765. sgi.setter = T::set;
  766. sgi.validated_setter = T::validated_set;
  767. sgi.ptr_setter = T::ptr_set;
  768. sgi.getter = T::get;
  769. sgi.validated_getter = T::get;
  770. sgi.ptr_getter = T::ptr_get;
  771. sgi.index_type = T::get_index_type();
  772. sgi.get_indexed_size = T::get_indexed_size;
  773. sgi.valid = true;
  774. }
  775. void register_indexed_setters_getters() {
  776. #define REGISTER_INDEXED_MEMBER(m_base_type) register_indexed_member<VariantIndexedSetGet_##m_base_type>(GetTypeInfo<m_base_type>::VARIANT_TYPE)
  777. REGISTER_INDEXED_MEMBER(String);
  778. REGISTER_INDEXED_MEMBER(Vector2);
  779. REGISTER_INDEXED_MEMBER(Vector2i);
  780. REGISTER_INDEXED_MEMBER(Vector3);
  781. REGISTER_INDEXED_MEMBER(Vector3i);
  782. REGISTER_INDEXED_MEMBER(Quaternion);
  783. REGISTER_INDEXED_MEMBER(Color);
  784. REGISTER_INDEXED_MEMBER(Transform2D);
  785. REGISTER_INDEXED_MEMBER(Basis);
  786. REGISTER_INDEXED_MEMBER(PackedByteArray);
  787. REGISTER_INDEXED_MEMBER(PackedInt32Array);
  788. REGISTER_INDEXED_MEMBER(PackedInt64Array);
  789. REGISTER_INDEXED_MEMBER(PackedFloat32Array);
  790. REGISTER_INDEXED_MEMBER(PackedFloat64Array);
  791. REGISTER_INDEXED_MEMBER(PackedVector2Array);
  792. REGISTER_INDEXED_MEMBER(PackedVector3Array);
  793. REGISTER_INDEXED_MEMBER(PackedStringArray);
  794. REGISTER_INDEXED_MEMBER(PackedColorArray);
  795. REGISTER_INDEXED_MEMBER(Array);
  796. REGISTER_INDEXED_MEMBER(Dictionary);
  797. }
  798. static void unregister_indexed_setters_getters() {
  799. }
  800. bool Variant::has_indexing(Variant::Type p_type) {
  801. ERR_FAIL_INDEX_V(p_type, Variant::VARIANT_MAX, false);
  802. return variant_indexed_setters_getters[p_type].valid;
  803. }
  804. Variant::Type Variant::get_indexed_element_type(Variant::Type p_type) {
  805. ERR_FAIL_INDEX_V(p_type, Variant::VARIANT_MAX, Variant::VARIANT_MAX);
  806. return variant_indexed_setters_getters[p_type].index_type;
  807. }
  808. Variant::ValidatedIndexedSetter Variant::get_member_validated_indexed_setter(Variant::Type p_type) {
  809. ERR_FAIL_INDEX_V(p_type, Variant::VARIANT_MAX, nullptr);
  810. return variant_indexed_setters_getters[p_type].validated_setter;
  811. }
  812. Variant::ValidatedIndexedGetter Variant::get_member_validated_indexed_getter(Variant::Type p_type) {
  813. ERR_FAIL_INDEX_V(p_type, Variant::VARIANT_MAX, nullptr);
  814. return variant_indexed_setters_getters[p_type].validated_getter;
  815. }
  816. Variant::PTRIndexedSetter Variant::get_member_ptr_indexed_setter(Variant::Type p_type) {
  817. ERR_FAIL_INDEX_V(p_type, Variant::VARIANT_MAX, nullptr);
  818. return variant_indexed_setters_getters[p_type].ptr_setter;
  819. }
  820. Variant::PTRIndexedGetter Variant::get_member_ptr_indexed_getter(Variant::Type p_type) {
  821. ERR_FAIL_INDEX_V(p_type, Variant::VARIANT_MAX, nullptr);
  822. return variant_indexed_setters_getters[p_type].ptr_getter;
  823. }
  824. void Variant::set_indexed(int64_t p_index, const Variant &p_value, bool &r_valid, bool &r_oob) {
  825. if (likely(variant_indexed_setters_getters[type].valid)) {
  826. variant_indexed_setters_getters[type].setter(this, p_index, &p_value, &r_valid, &r_oob);
  827. } else {
  828. r_valid = false;
  829. r_oob = false;
  830. }
  831. }
  832. Variant Variant::get_indexed(int64_t p_index, bool &r_valid, bool &r_oob) const {
  833. if (likely(variant_indexed_setters_getters[type].valid)) {
  834. Variant ret;
  835. variant_indexed_setters_getters[type].getter(this, p_index, &ret, &r_oob);
  836. r_valid = !r_oob;
  837. return ret;
  838. } else {
  839. r_valid = false;
  840. r_oob = false;
  841. return Variant();
  842. }
  843. }
  844. uint64_t Variant::get_indexed_size() const {
  845. if (likely(variant_indexed_setters_getters[type].valid && variant_indexed_setters_getters[type].get_indexed_size)) {
  846. return variant_indexed_setters_getters[type].get_indexed_size(this);
  847. } else {
  848. return 0;
  849. }
  850. }
  851. struct VariantKeyedSetGetDictionary {
  852. static void get(const Variant *base, const Variant *key, Variant *value, bool *r_valid) {
  853. const Variant *ptr = VariantGetInternalPtr<Dictionary>::get_ptr(base)->getptr(*key);
  854. if (!ptr) {
  855. *r_valid = false;
  856. return;
  857. }
  858. *value = *ptr;
  859. *r_valid = true;
  860. }
  861. static void ptr_get(const void *base, const void *key, void *value) {
  862. /* avoid ptrconvert for performance*/
  863. const Dictionary &v = *reinterpret_cast<const Dictionary *>(base);
  864. const Variant *ptr = v.getptr(PtrToArg<Variant>::convert(key));
  865. NULL_TEST(ptr);
  866. PtrToArg<Variant>::encode(*ptr, value);
  867. }
  868. static void set(Variant *base, const Variant *key, const Variant *value, bool *r_valid) {
  869. if (VariantGetInternalPtr<Dictionary>::get_ptr(base)->is_read_only()) {
  870. *r_valid = false;
  871. return;
  872. }
  873. (*VariantGetInternalPtr<Dictionary>::get_ptr(base))[*key] = *value;
  874. *r_valid = true;
  875. }
  876. static void ptr_set(void *base, const void *key, const void *value) {
  877. Dictionary &v = *reinterpret_cast<Dictionary *>(base);
  878. v[PtrToArg<Variant>::convert(key)] = PtrToArg<Variant>::convert(value);
  879. }
  880. static bool has(const Variant *base, const Variant *key, bool *r_valid) {
  881. *r_valid = true;
  882. return VariantGetInternalPtr<Dictionary>::get_ptr(base)->has(*key);
  883. }
  884. static uint32_t ptr_has(const void *base, const void *key) {
  885. /* avoid ptrconvert for performance*/
  886. const Dictionary &v = *reinterpret_cast<const Dictionary *>(base);
  887. return v.has(PtrToArg<Variant>::convert(key));
  888. }
  889. };
  890. struct VariantKeyedSetGetObject {
  891. static void get(const Variant *base, const Variant *key, Variant *value, bool *r_valid) {
  892. Object *obj = base->get_validated_object();
  893. if (!obj) {
  894. *r_valid = false;
  895. *value = Variant();
  896. return;
  897. }
  898. *value = obj->getvar(*key, r_valid);
  899. }
  900. static void ptr_get(const void *base, const void *key, void *value) {
  901. const Object *obj = PtrToArg<Object *>::convert(base);
  902. NULL_TEST(obj);
  903. Variant v = obj->getvar(PtrToArg<Variant>::convert(key));
  904. PtrToArg<Variant>::encode(v, value);
  905. }
  906. static void set(Variant *base, const Variant *key, const Variant *value, bool *r_valid) {
  907. Object *obj = base->get_validated_object();
  908. if (!obj) {
  909. *r_valid = false;
  910. return;
  911. }
  912. obj->setvar(*key, *value, r_valid);
  913. }
  914. static void ptr_set(void *base, const void *key, const void *value) {
  915. Object *obj = PtrToArg<Object *>::convert(base);
  916. NULL_TEST(obj);
  917. obj->setvar(PtrToArg<Variant>::convert(key), PtrToArg<Variant>::convert(value));
  918. }
  919. static bool has(const Variant *base, const Variant *key, bool *r_valid) {
  920. Object *obj = base->get_validated_object();
  921. if (!obj) {
  922. *r_valid = false;
  923. return false;
  924. }
  925. *r_valid = true;
  926. bool exists;
  927. obj->getvar(*key, &exists);
  928. return exists;
  929. }
  930. static uint32_t ptr_has(const void *base, const void *key) {
  931. const Object *obj = PtrToArg<Object *>::convert(base);
  932. ERR_FAIL_COND_V(!obj, false);
  933. bool valid;
  934. obj->getvar(PtrToArg<Variant>::convert(key), &valid);
  935. return valid;
  936. }
  937. };
  938. struct VariantKeyedSetterGetterInfo {
  939. Variant::ValidatedKeyedSetter validated_setter = nullptr;
  940. Variant::ValidatedKeyedGetter validated_getter = nullptr;
  941. Variant::ValidatedKeyedChecker validated_checker = nullptr;
  942. Variant::PTRKeyedSetter ptr_setter = nullptr;
  943. Variant::PTRKeyedGetter ptr_getter = nullptr;
  944. Variant::PTRKeyedChecker ptr_checker = nullptr;
  945. bool valid = false;
  946. };
  947. static VariantKeyedSetterGetterInfo variant_keyed_setters_getters[Variant::VARIANT_MAX];
  948. template <class T>
  949. static void register_keyed_member(Variant::Type p_type) {
  950. VariantKeyedSetterGetterInfo &sgi = variant_keyed_setters_getters[p_type];
  951. sgi.validated_setter = T::set;
  952. sgi.ptr_setter = T::ptr_set;
  953. sgi.validated_getter = T::get;
  954. sgi.ptr_getter = T::ptr_get;
  955. sgi.validated_checker = T::has;
  956. sgi.ptr_checker = T::ptr_has;
  957. sgi.valid = true;
  958. }
  959. static void register_keyed_setters_getters() {
  960. register_keyed_member<VariantKeyedSetGetDictionary>(Variant::DICTIONARY);
  961. register_keyed_member<VariantKeyedSetGetObject>(Variant::OBJECT);
  962. }
  963. bool Variant::is_keyed(Variant::Type p_type) {
  964. ERR_FAIL_INDEX_V(p_type, VARIANT_MAX, false);
  965. return variant_keyed_setters_getters[p_type].valid;
  966. }
  967. Variant::ValidatedKeyedSetter Variant::get_member_validated_keyed_setter(Variant::Type p_type) {
  968. ERR_FAIL_INDEX_V(p_type, VARIANT_MAX, nullptr);
  969. return variant_keyed_setters_getters[p_type].validated_setter;
  970. }
  971. Variant::ValidatedKeyedGetter Variant::get_member_validated_keyed_getter(Variant::Type p_type) {
  972. ERR_FAIL_INDEX_V(p_type, VARIANT_MAX, nullptr);
  973. return variant_keyed_setters_getters[p_type].validated_getter;
  974. }
  975. Variant::ValidatedKeyedChecker Variant::get_member_validated_keyed_checker(Variant::Type p_type) {
  976. ERR_FAIL_INDEX_V(p_type, VARIANT_MAX, nullptr);
  977. return variant_keyed_setters_getters[p_type].validated_checker;
  978. }
  979. Variant::PTRKeyedSetter Variant::get_member_ptr_keyed_setter(Variant::Type p_type) {
  980. ERR_FAIL_INDEX_V(p_type, VARIANT_MAX, nullptr);
  981. return variant_keyed_setters_getters[p_type].ptr_setter;
  982. }
  983. Variant::PTRKeyedGetter Variant::get_member_ptr_keyed_getter(Variant::Type p_type) {
  984. ERR_FAIL_INDEX_V(p_type, VARIANT_MAX, nullptr);
  985. return variant_keyed_setters_getters[p_type].ptr_getter;
  986. }
  987. Variant::PTRKeyedChecker Variant::get_member_ptr_keyed_checker(Variant::Type p_type) {
  988. ERR_FAIL_INDEX_V(p_type, VARIANT_MAX, nullptr);
  989. return variant_keyed_setters_getters[p_type].ptr_checker;
  990. }
  991. void Variant::set_keyed(const Variant &p_key, const Variant &p_value, bool &r_valid) {
  992. if (likely(variant_keyed_setters_getters[type].valid)) {
  993. variant_keyed_setters_getters[type].validated_setter(this, &p_key, &p_value, &r_valid);
  994. } else {
  995. r_valid = false;
  996. }
  997. }
  998. Variant Variant::get_keyed(const Variant &p_key, bool &r_valid) const {
  999. if (likely(variant_keyed_setters_getters[type].valid)) {
  1000. Variant ret;
  1001. variant_keyed_setters_getters[type].validated_getter(this, &p_key, &ret, &r_valid);
  1002. return ret;
  1003. } else {
  1004. r_valid = false;
  1005. return Variant();
  1006. }
  1007. }
  1008. bool Variant::has_key(const Variant &p_key, bool &r_valid) const {
  1009. if (likely(variant_keyed_setters_getters[type].valid)) {
  1010. return variant_keyed_setters_getters[type].validated_checker(this, &p_key, &r_valid);
  1011. } else {
  1012. r_valid = false;
  1013. return false;
  1014. }
  1015. }
  1016. void Variant::set(const Variant &p_index, const Variant &p_value, bool *r_valid) {
  1017. if (type == DICTIONARY || type == OBJECT) {
  1018. bool valid;
  1019. set_keyed(p_index, p_value, valid);
  1020. if (r_valid) {
  1021. *r_valid = valid;
  1022. }
  1023. } else {
  1024. bool valid = false;
  1025. if (p_index.get_type() == STRING_NAME) {
  1026. set_named(*VariantGetInternalPtr<StringName>::get_ptr(&p_index), p_value, valid);
  1027. } else if (p_index.get_type() == INT) {
  1028. bool obb;
  1029. set_indexed(*VariantGetInternalPtr<int64_t>::get_ptr(&p_index), p_value, valid, obb);
  1030. if (obb) {
  1031. valid = false;
  1032. }
  1033. } else if (p_index.get_type() == STRING) { // less efficient version of named
  1034. set_named(*VariantGetInternalPtr<String>::get_ptr(&p_index), p_value, valid);
  1035. } else if (p_index.get_type() == FLOAT) { // less efficient version of indexed
  1036. bool obb;
  1037. set_indexed(*VariantGetInternalPtr<double>::get_ptr(&p_index), p_value, valid, obb);
  1038. if (obb) {
  1039. valid = false;
  1040. }
  1041. }
  1042. if (r_valid) {
  1043. *r_valid = valid;
  1044. }
  1045. }
  1046. }
  1047. Variant Variant::get(const Variant &p_index, bool *r_valid) const {
  1048. Variant ret;
  1049. if (type == DICTIONARY || type == OBJECT) {
  1050. bool valid;
  1051. ret = get_keyed(p_index, valid);
  1052. if (r_valid) {
  1053. *r_valid = valid;
  1054. }
  1055. } else {
  1056. bool valid = false;
  1057. if (p_index.get_type() == STRING_NAME) {
  1058. ret = get_named(*VariantGetInternalPtr<StringName>::get_ptr(&p_index), valid);
  1059. } else if (p_index.get_type() == INT) {
  1060. bool obb;
  1061. ret = get_indexed(*VariantGetInternalPtr<int64_t>::get_ptr(&p_index), valid, obb);
  1062. if (obb) {
  1063. valid = false;
  1064. }
  1065. } else if (p_index.get_type() == STRING) { // less efficient version of named
  1066. ret = get_named(*VariantGetInternalPtr<String>::get_ptr(&p_index), valid);
  1067. } else if (p_index.get_type() == FLOAT) { // less efficient version of indexed
  1068. bool obb;
  1069. ret = get_indexed(*VariantGetInternalPtr<double>::get_ptr(&p_index), valid, obb);
  1070. if (obb) {
  1071. valid = false;
  1072. }
  1073. }
  1074. if (r_valid) {
  1075. *r_valid = valid;
  1076. }
  1077. }
  1078. return ret;
  1079. }
  1080. void Variant::get_property_list(List<PropertyInfo> *p_list) const {
  1081. if (type == DICTIONARY) {
  1082. const Dictionary *dic = reinterpret_cast<const Dictionary *>(_data._mem);
  1083. List<Variant> keys;
  1084. dic->get_key_list(&keys);
  1085. for (const Variant &E : keys) {
  1086. if (E.get_type() == Variant::STRING) {
  1087. p_list->push_back(PropertyInfo(Variant::STRING, E));
  1088. }
  1089. }
  1090. } else if (type == OBJECT) {
  1091. Object *obj = get_validated_object();
  1092. ERR_FAIL_COND(!obj);
  1093. obj->get_property_list(p_list);
  1094. } else {
  1095. List<StringName> members;
  1096. get_member_list(type, &members);
  1097. for (const StringName &E : members) {
  1098. PropertyInfo pi;
  1099. pi.name = E;
  1100. pi.type = get_member_type(type, E);
  1101. p_list->push_back(pi);
  1102. }
  1103. }
  1104. }
  1105. bool Variant::iter_init(Variant &r_iter, bool &valid) const {
  1106. valid = true;
  1107. switch (type) {
  1108. case INT: {
  1109. r_iter = 0;
  1110. return _data._int > 0;
  1111. } break;
  1112. case FLOAT: {
  1113. r_iter = 0;
  1114. return _data._float > 0.0;
  1115. } break;
  1116. case VECTOR2: {
  1117. double from = reinterpret_cast<const Vector2 *>(_data._mem)->x;
  1118. double to = reinterpret_cast<const Vector2 *>(_data._mem)->y;
  1119. r_iter = from;
  1120. return from < to;
  1121. } break;
  1122. case VECTOR2I: {
  1123. int64_t from = reinterpret_cast<const Vector2i *>(_data._mem)->x;
  1124. int64_t to = reinterpret_cast<const Vector2i *>(_data._mem)->y;
  1125. r_iter = from;
  1126. return from < to;
  1127. } break;
  1128. case VECTOR3: {
  1129. double from = reinterpret_cast<const Vector3 *>(_data._mem)->x;
  1130. double to = reinterpret_cast<const Vector3 *>(_data._mem)->y;
  1131. double step = reinterpret_cast<const Vector3 *>(_data._mem)->z;
  1132. r_iter = from;
  1133. if (from == to) {
  1134. return false;
  1135. } else if (from < to) {
  1136. return step > 0;
  1137. }
  1138. return step < 0;
  1139. } break;
  1140. case VECTOR3I: {
  1141. int64_t from = reinterpret_cast<const Vector3i *>(_data._mem)->x;
  1142. int64_t to = reinterpret_cast<const Vector3i *>(_data._mem)->y;
  1143. int64_t step = reinterpret_cast<const Vector3i *>(_data._mem)->z;
  1144. r_iter = from;
  1145. if (from == to) {
  1146. return false;
  1147. } else if (from < to) {
  1148. return step > 0;
  1149. }
  1150. return step < 0;
  1151. } break;
  1152. case OBJECT: {
  1153. if (!_get_obj().obj) {
  1154. valid = false;
  1155. return false;
  1156. }
  1157. #ifdef DEBUG_ENABLED
  1158. if (EngineDebugger::is_active() && !_get_obj().id.is_ref_counted() && ObjectDB::get_instance(_get_obj().id) == nullptr) {
  1159. valid = false;
  1160. return false;
  1161. }
  1162. #endif
  1163. Callable::CallError ce;
  1164. ce.error = Callable::CallError::CALL_OK;
  1165. Array ref;
  1166. ref.push_back(r_iter);
  1167. Variant vref = ref;
  1168. const Variant *refp[] = { &vref };
  1169. Variant ret = _get_obj().obj->callp(CoreStringNames::get_singleton()->_iter_init, refp, 1, ce);
  1170. if (ref.size() != 1 || ce.error != Callable::CallError::CALL_OK) {
  1171. valid = false;
  1172. return false;
  1173. }
  1174. r_iter = ref[0];
  1175. return ret;
  1176. } break;
  1177. case STRING: {
  1178. const String *str = reinterpret_cast<const String *>(_data._mem);
  1179. if (str->is_empty()) {
  1180. return false;
  1181. }
  1182. r_iter = 0;
  1183. return true;
  1184. } break;
  1185. case DICTIONARY: {
  1186. const Dictionary *dic = reinterpret_cast<const Dictionary *>(_data._mem);
  1187. if (dic->is_empty()) {
  1188. return false;
  1189. }
  1190. const Variant *next = dic->next(nullptr);
  1191. r_iter = *next;
  1192. return true;
  1193. } break;
  1194. case ARRAY: {
  1195. const Array *arr = reinterpret_cast<const Array *>(_data._mem);
  1196. if (arr->is_empty()) {
  1197. return false;
  1198. }
  1199. r_iter = 0;
  1200. return true;
  1201. } break;
  1202. case PACKED_BYTE_ARRAY: {
  1203. const Vector<uint8_t> *arr = &PackedArrayRef<uint8_t>::get_array(_data.packed_array);
  1204. if (arr->size() == 0) {
  1205. return false;
  1206. }
  1207. r_iter = 0;
  1208. return true;
  1209. } break;
  1210. case PACKED_INT32_ARRAY: {
  1211. const Vector<int32_t> *arr = &PackedArrayRef<int32_t>::get_array(_data.packed_array);
  1212. if (arr->size() == 0) {
  1213. return false;
  1214. }
  1215. r_iter = 0;
  1216. return true;
  1217. } break;
  1218. case PACKED_INT64_ARRAY: {
  1219. const Vector<int64_t> *arr = &PackedArrayRef<int64_t>::get_array(_data.packed_array);
  1220. if (arr->size() == 0) {
  1221. return false;
  1222. }
  1223. r_iter = 0;
  1224. return true;
  1225. } break;
  1226. case PACKED_FLOAT32_ARRAY: {
  1227. const Vector<float> *arr = &PackedArrayRef<float>::get_array(_data.packed_array);
  1228. if (arr->size() == 0) {
  1229. return false;
  1230. }
  1231. r_iter = 0;
  1232. return true;
  1233. } break;
  1234. case PACKED_FLOAT64_ARRAY: {
  1235. const Vector<double> *arr = &PackedArrayRef<double>::get_array(_data.packed_array);
  1236. if (arr->size() == 0) {
  1237. return false;
  1238. }
  1239. r_iter = 0;
  1240. return true;
  1241. } break;
  1242. case PACKED_STRING_ARRAY: {
  1243. const Vector<String> *arr = &PackedArrayRef<String>::get_array(_data.packed_array);
  1244. if (arr->size() == 0) {
  1245. return false;
  1246. }
  1247. r_iter = 0;
  1248. return true;
  1249. } break;
  1250. case PACKED_VECTOR2_ARRAY: {
  1251. const Vector<Vector2> *arr = &PackedArrayRef<Vector2>::get_array(_data.packed_array);
  1252. if (arr->size() == 0) {
  1253. return false;
  1254. }
  1255. r_iter = 0;
  1256. return true;
  1257. } break;
  1258. case PACKED_VECTOR3_ARRAY: {
  1259. const Vector<Vector3> *arr = &PackedArrayRef<Vector3>::get_array(_data.packed_array);
  1260. if (arr->size() == 0) {
  1261. return false;
  1262. }
  1263. r_iter = 0;
  1264. return true;
  1265. } break;
  1266. case PACKED_COLOR_ARRAY: {
  1267. const Vector<Color> *arr = &PackedArrayRef<Color>::get_array(_data.packed_array);
  1268. if (arr->size() == 0) {
  1269. return false;
  1270. }
  1271. r_iter = 0;
  1272. return true;
  1273. } break;
  1274. default: {
  1275. }
  1276. }
  1277. valid = false;
  1278. return false;
  1279. }
  1280. bool Variant::iter_next(Variant &r_iter, bool &valid) const {
  1281. valid = true;
  1282. switch (type) {
  1283. case INT: {
  1284. int64_t idx = r_iter;
  1285. idx++;
  1286. if (idx >= _data._int) {
  1287. return false;
  1288. }
  1289. r_iter = idx;
  1290. return true;
  1291. } break;
  1292. case FLOAT: {
  1293. int64_t idx = r_iter;
  1294. idx++;
  1295. if (idx >= _data._float) {
  1296. return false;
  1297. }
  1298. r_iter = idx;
  1299. return true;
  1300. } break;
  1301. case VECTOR2: {
  1302. double to = reinterpret_cast<const Vector2 *>(_data._mem)->y;
  1303. double idx = r_iter;
  1304. idx++;
  1305. if (idx >= to) {
  1306. return false;
  1307. }
  1308. r_iter = idx;
  1309. return true;
  1310. } break;
  1311. case VECTOR2I: {
  1312. int64_t to = reinterpret_cast<const Vector2i *>(_data._mem)->y;
  1313. int64_t idx = r_iter;
  1314. idx++;
  1315. if (idx >= to) {
  1316. return false;
  1317. }
  1318. r_iter = idx;
  1319. return true;
  1320. } break;
  1321. case VECTOR3: {
  1322. double to = reinterpret_cast<const Vector3 *>(_data._mem)->y;
  1323. double step = reinterpret_cast<const Vector3 *>(_data._mem)->z;
  1324. double idx = r_iter;
  1325. idx += step;
  1326. if (step < 0 && idx <= to) {
  1327. return false;
  1328. }
  1329. if (step > 0 && idx >= to) {
  1330. return false;
  1331. }
  1332. r_iter = idx;
  1333. return true;
  1334. } break;
  1335. case VECTOR3I: {
  1336. int64_t to = reinterpret_cast<const Vector3i *>(_data._mem)->y;
  1337. int64_t step = reinterpret_cast<const Vector3i *>(_data._mem)->z;
  1338. int64_t idx = r_iter;
  1339. idx += step;
  1340. if (step < 0 && idx <= to) {
  1341. return false;
  1342. }
  1343. if (step > 0 && idx >= to) {
  1344. return false;
  1345. }
  1346. r_iter = idx;
  1347. return true;
  1348. } break;
  1349. case OBJECT: {
  1350. if (!_get_obj().obj) {
  1351. valid = false;
  1352. return false;
  1353. }
  1354. #ifdef DEBUG_ENABLED
  1355. if (EngineDebugger::is_active() && !_get_obj().id.is_ref_counted() && ObjectDB::get_instance(_get_obj().id) == nullptr) {
  1356. valid = false;
  1357. return false;
  1358. }
  1359. #endif
  1360. Callable::CallError ce;
  1361. ce.error = Callable::CallError::CALL_OK;
  1362. Array ref;
  1363. ref.push_back(r_iter);
  1364. Variant vref = ref;
  1365. const Variant *refp[] = { &vref };
  1366. Variant ret = _get_obj().obj->callp(CoreStringNames::get_singleton()->_iter_next, refp, 1, ce);
  1367. if (ref.size() != 1 || ce.error != Callable::CallError::CALL_OK) {
  1368. valid = false;
  1369. return false;
  1370. }
  1371. r_iter = ref[0];
  1372. return ret;
  1373. } break;
  1374. case STRING: {
  1375. const String *str = reinterpret_cast<const String *>(_data._mem);
  1376. int idx = r_iter;
  1377. idx++;
  1378. if (idx >= str->length()) {
  1379. return false;
  1380. }
  1381. r_iter = idx;
  1382. return true;
  1383. } break;
  1384. case DICTIONARY: {
  1385. const Dictionary *dic = reinterpret_cast<const Dictionary *>(_data._mem);
  1386. const Variant *next = dic->next(&r_iter);
  1387. if (!next) {
  1388. return false;
  1389. }
  1390. r_iter = *next;
  1391. return true;
  1392. } break;
  1393. case ARRAY: {
  1394. const Array *arr = reinterpret_cast<const Array *>(_data._mem);
  1395. int idx = r_iter;
  1396. idx++;
  1397. if (idx >= arr->size()) {
  1398. return false;
  1399. }
  1400. r_iter = idx;
  1401. return true;
  1402. } break;
  1403. case PACKED_BYTE_ARRAY: {
  1404. const Vector<uint8_t> *arr = &PackedArrayRef<uint8_t>::get_array(_data.packed_array);
  1405. int idx = r_iter;
  1406. idx++;
  1407. if (idx >= arr->size()) {
  1408. return false;
  1409. }
  1410. r_iter = idx;
  1411. return true;
  1412. } break;
  1413. case PACKED_INT32_ARRAY: {
  1414. const Vector<int32_t> *arr = &PackedArrayRef<int32_t>::get_array(_data.packed_array);
  1415. int32_t idx = r_iter;
  1416. idx++;
  1417. if (idx >= arr->size()) {
  1418. return false;
  1419. }
  1420. r_iter = idx;
  1421. return true;
  1422. } break;
  1423. case PACKED_INT64_ARRAY: {
  1424. const Vector<int64_t> *arr = &PackedArrayRef<int64_t>::get_array(_data.packed_array);
  1425. int64_t idx = r_iter;
  1426. idx++;
  1427. if (idx >= arr->size()) {
  1428. return false;
  1429. }
  1430. r_iter = idx;
  1431. return true;
  1432. } break;
  1433. case PACKED_FLOAT32_ARRAY: {
  1434. const Vector<float> *arr = &PackedArrayRef<float>::get_array(_data.packed_array);
  1435. int idx = r_iter;
  1436. idx++;
  1437. if (idx >= arr->size()) {
  1438. return false;
  1439. }
  1440. r_iter = idx;
  1441. return true;
  1442. } break;
  1443. case PACKED_FLOAT64_ARRAY: {
  1444. const Vector<double> *arr = &PackedArrayRef<double>::get_array(_data.packed_array);
  1445. int idx = r_iter;
  1446. idx++;
  1447. if (idx >= arr->size()) {
  1448. return false;
  1449. }
  1450. r_iter = idx;
  1451. return true;
  1452. } break;
  1453. case PACKED_STRING_ARRAY: {
  1454. const Vector<String> *arr = &PackedArrayRef<String>::get_array(_data.packed_array);
  1455. int idx = r_iter;
  1456. idx++;
  1457. if (idx >= arr->size()) {
  1458. return false;
  1459. }
  1460. r_iter = idx;
  1461. return true;
  1462. } break;
  1463. case PACKED_VECTOR2_ARRAY: {
  1464. const Vector<Vector2> *arr = &PackedArrayRef<Vector2>::get_array(_data.packed_array);
  1465. int idx = r_iter;
  1466. idx++;
  1467. if (idx >= arr->size()) {
  1468. return false;
  1469. }
  1470. r_iter = idx;
  1471. return true;
  1472. } break;
  1473. case PACKED_VECTOR3_ARRAY: {
  1474. const Vector<Vector3> *arr = &PackedArrayRef<Vector3>::get_array(_data.packed_array);
  1475. int idx = r_iter;
  1476. idx++;
  1477. if (idx >= arr->size()) {
  1478. return false;
  1479. }
  1480. r_iter = idx;
  1481. return true;
  1482. } break;
  1483. case PACKED_COLOR_ARRAY: {
  1484. const Vector<Color> *arr = &PackedArrayRef<Color>::get_array(_data.packed_array);
  1485. int idx = r_iter;
  1486. idx++;
  1487. if (idx >= arr->size()) {
  1488. return false;
  1489. }
  1490. r_iter = idx;
  1491. return true;
  1492. } break;
  1493. default: {
  1494. }
  1495. }
  1496. valid = false;
  1497. return false;
  1498. }
  1499. Variant Variant::iter_get(const Variant &r_iter, bool &r_valid) const {
  1500. r_valid = true;
  1501. switch (type) {
  1502. case INT: {
  1503. return r_iter;
  1504. } break;
  1505. case FLOAT: {
  1506. return r_iter;
  1507. } break;
  1508. case VECTOR2: {
  1509. return r_iter;
  1510. } break;
  1511. case VECTOR2I: {
  1512. return r_iter;
  1513. } break;
  1514. case VECTOR3: {
  1515. return r_iter;
  1516. } break;
  1517. case VECTOR3I: {
  1518. return r_iter;
  1519. } break;
  1520. case OBJECT: {
  1521. if (!_get_obj().obj) {
  1522. r_valid = false;
  1523. return Variant();
  1524. }
  1525. #ifdef DEBUG_ENABLED
  1526. if (EngineDebugger::is_active() && !_get_obj().id.is_ref_counted() && ObjectDB::get_instance(_get_obj().id) == nullptr) {
  1527. r_valid = false;
  1528. return Variant();
  1529. }
  1530. #endif
  1531. Callable::CallError ce;
  1532. ce.error = Callable::CallError::CALL_OK;
  1533. const Variant *refp[] = { &r_iter };
  1534. Variant ret = _get_obj().obj->callp(CoreStringNames::get_singleton()->_iter_get, refp, 1, ce);
  1535. if (ce.error != Callable::CallError::CALL_OK) {
  1536. r_valid = false;
  1537. return Variant();
  1538. }
  1539. //r_iter=ref[0];
  1540. return ret;
  1541. } break;
  1542. case STRING: {
  1543. const String *str = reinterpret_cast<const String *>(_data._mem);
  1544. return str->substr(r_iter, 1);
  1545. } break;
  1546. case DICTIONARY: {
  1547. return r_iter; //iterator is the same as the key
  1548. } break;
  1549. case ARRAY: {
  1550. const Array *arr = reinterpret_cast<const Array *>(_data._mem);
  1551. int idx = r_iter;
  1552. #ifdef DEBUG_ENABLED
  1553. if (idx < 0 || idx >= arr->size()) {
  1554. r_valid = false;
  1555. return Variant();
  1556. }
  1557. #endif
  1558. return arr->get(idx);
  1559. } break;
  1560. case PACKED_BYTE_ARRAY: {
  1561. const Vector<uint8_t> *arr = &PackedArrayRef<uint8_t>::get_array(_data.packed_array);
  1562. int idx = r_iter;
  1563. #ifdef DEBUG_ENABLED
  1564. if (idx < 0 || idx >= arr->size()) {
  1565. r_valid = false;
  1566. return Variant();
  1567. }
  1568. #endif
  1569. return arr->get(idx);
  1570. } break;
  1571. case PACKED_INT32_ARRAY: {
  1572. const Vector<int32_t> *arr = &PackedArrayRef<int32_t>::get_array(_data.packed_array);
  1573. int32_t idx = r_iter;
  1574. #ifdef DEBUG_ENABLED
  1575. if (idx < 0 || idx >= arr->size()) {
  1576. r_valid = false;
  1577. return Variant();
  1578. }
  1579. #endif
  1580. return arr->get(idx);
  1581. } break;
  1582. case PACKED_INT64_ARRAY: {
  1583. const Vector<int64_t> *arr = &PackedArrayRef<int64_t>::get_array(_data.packed_array);
  1584. int64_t idx = r_iter;
  1585. #ifdef DEBUG_ENABLED
  1586. if (idx < 0 || idx >= arr->size()) {
  1587. r_valid = false;
  1588. return Variant();
  1589. }
  1590. #endif
  1591. return arr->get(idx);
  1592. } break;
  1593. case PACKED_FLOAT32_ARRAY: {
  1594. const Vector<float> *arr = &PackedArrayRef<float>::get_array(_data.packed_array);
  1595. int idx = r_iter;
  1596. #ifdef DEBUG_ENABLED
  1597. if (idx < 0 || idx >= arr->size()) {
  1598. r_valid = false;
  1599. return Variant();
  1600. }
  1601. #endif
  1602. return arr->get(idx);
  1603. } break;
  1604. case PACKED_FLOAT64_ARRAY: {
  1605. const Vector<double> *arr = &PackedArrayRef<double>::get_array(_data.packed_array);
  1606. int idx = r_iter;
  1607. #ifdef DEBUG_ENABLED
  1608. if (idx < 0 || idx >= arr->size()) {
  1609. r_valid = false;
  1610. return Variant();
  1611. }
  1612. #endif
  1613. return arr->get(idx);
  1614. } break;
  1615. case PACKED_STRING_ARRAY: {
  1616. const Vector<String> *arr = &PackedArrayRef<String>::get_array(_data.packed_array);
  1617. int idx = r_iter;
  1618. #ifdef DEBUG_ENABLED
  1619. if (idx < 0 || idx >= arr->size()) {
  1620. r_valid = false;
  1621. return Variant();
  1622. }
  1623. #endif
  1624. return arr->get(idx);
  1625. } break;
  1626. case PACKED_VECTOR2_ARRAY: {
  1627. const Vector<Vector2> *arr = &PackedArrayRef<Vector2>::get_array(_data.packed_array);
  1628. int idx = r_iter;
  1629. #ifdef DEBUG_ENABLED
  1630. if (idx < 0 || idx >= arr->size()) {
  1631. r_valid = false;
  1632. return Variant();
  1633. }
  1634. #endif
  1635. return arr->get(idx);
  1636. } break;
  1637. case PACKED_VECTOR3_ARRAY: {
  1638. const Vector<Vector3> *arr = &PackedArrayRef<Vector3>::get_array(_data.packed_array);
  1639. int idx = r_iter;
  1640. #ifdef DEBUG_ENABLED
  1641. if (idx < 0 || idx >= arr->size()) {
  1642. r_valid = false;
  1643. return Variant();
  1644. }
  1645. #endif
  1646. return arr->get(idx);
  1647. } break;
  1648. case PACKED_COLOR_ARRAY: {
  1649. const Vector<Color> *arr = &PackedArrayRef<Color>::get_array(_data.packed_array);
  1650. int idx = r_iter;
  1651. #ifdef DEBUG_ENABLED
  1652. if (idx < 0 || idx >= arr->size()) {
  1653. r_valid = false;
  1654. return Variant();
  1655. }
  1656. #endif
  1657. return arr->get(idx);
  1658. } break;
  1659. default: {
  1660. }
  1661. }
  1662. r_valid = false;
  1663. return Variant();
  1664. }
  1665. Variant Variant::duplicate(bool p_deep) const {
  1666. return recursive_duplicate(p_deep, 0);
  1667. }
  1668. Variant Variant::recursive_duplicate(bool p_deep, int recursion_count) const {
  1669. switch (type) {
  1670. case OBJECT: {
  1671. /* breaks stuff :(
  1672. if (p_deep && !_get_obj().ref.is_null()) {
  1673. Ref<Resource> resource = _get_obj().ref;
  1674. if (resource.is_valid()) {
  1675. return resource->duplicate(true);
  1676. }
  1677. }
  1678. */
  1679. return *this;
  1680. } break;
  1681. case DICTIONARY:
  1682. return operator Dictionary().recursive_duplicate(p_deep, recursion_count);
  1683. case ARRAY:
  1684. return operator Array().recursive_duplicate(p_deep, recursion_count);
  1685. case PACKED_BYTE_ARRAY:
  1686. return operator Vector<uint8_t>().duplicate();
  1687. case PACKED_INT32_ARRAY:
  1688. return operator Vector<int32_t>().duplicate();
  1689. case PACKED_INT64_ARRAY:
  1690. return operator Vector<int64_t>().duplicate();
  1691. case PACKED_FLOAT32_ARRAY:
  1692. return operator Vector<float>().duplicate();
  1693. case PACKED_FLOAT64_ARRAY:
  1694. return operator Vector<double>().duplicate();
  1695. case PACKED_STRING_ARRAY:
  1696. return operator Vector<String>().duplicate();
  1697. case PACKED_VECTOR2_ARRAY:
  1698. return operator Vector<Vector2>().duplicate();
  1699. case PACKED_VECTOR3_ARRAY:
  1700. return operator Vector<Vector3>().duplicate();
  1701. case PACKED_COLOR_ARRAY:
  1702. return operator Vector<Color>().duplicate();
  1703. default:
  1704. return *this;
  1705. }
  1706. }
  1707. void Variant::sub(const Variant &a, const Variant &b, Variant &r_dst) {
  1708. if (a.type != b.type) {
  1709. return;
  1710. }
  1711. switch (a.type) {
  1712. case NIL: {
  1713. r_dst = Variant();
  1714. }
  1715. return;
  1716. case INT: {
  1717. int64_t va = a._data._int;
  1718. int64_t vb = b._data._int;
  1719. r_dst = int(va - vb);
  1720. }
  1721. return;
  1722. case FLOAT: {
  1723. double ra = a._data._float;
  1724. double rb = b._data._float;
  1725. r_dst = ra - rb;
  1726. }
  1727. return;
  1728. case VECTOR2: {
  1729. r_dst = *reinterpret_cast<const Vector2 *>(a._data._mem) - *reinterpret_cast<const Vector2 *>(b._data._mem);
  1730. }
  1731. return;
  1732. case VECTOR2I: {
  1733. int32_t vax = reinterpret_cast<const Vector2i *>(a._data._mem)->x;
  1734. int32_t vbx = reinterpret_cast<const Vector2i *>(b._data._mem)->x;
  1735. int32_t vay = reinterpret_cast<const Vector2i *>(a._data._mem)->y;
  1736. int32_t vby = reinterpret_cast<const Vector2i *>(b._data._mem)->y;
  1737. r_dst = Vector2i(int32_t(vax - vbx), int32_t(vay - vby));
  1738. }
  1739. return;
  1740. case RECT2: {
  1741. const Rect2 *ra = reinterpret_cast<const Rect2 *>(a._data._mem);
  1742. const Rect2 *rb = reinterpret_cast<const Rect2 *>(b._data._mem);
  1743. r_dst = Rect2(ra->position - rb->position, ra->size - rb->size);
  1744. }
  1745. return;
  1746. case RECT2I: {
  1747. const Rect2i *ra = reinterpret_cast<const Rect2i *>(a._data._mem);
  1748. const Rect2i *rb = reinterpret_cast<const Rect2i *>(b._data._mem);
  1749. int32_t vax = ra->position.x;
  1750. int32_t vay = ra->position.y;
  1751. int32_t vbx = ra->size.x;
  1752. int32_t vby = ra->size.y;
  1753. int32_t vcx = rb->position.x;
  1754. int32_t vcy = rb->position.y;
  1755. int32_t vdx = rb->size.x;
  1756. int32_t vdy = rb->size.y;
  1757. r_dst = Rect2i(int32_t(vax - vbx), int32_t(vay - vby), int32_t(vcx - vdx), int32_t(vcy - vdy));
  1758. }
  1759. return;
  1760. case VECTOR3: {
  1761. r_dst = *reinterpret_cast<const Vector3 *>(a._data._mem) - *reinterpret_cast<const Vector3 *>(b._data._mem);
  1762. }
  1763. return;
  1764. case VECTOR3I: {
  1765. int32_t vax = reinterpret_cast<const Vector3i *>(a._data._mem)->x;
  1766. int32_t vbx = reinterpret_cast<const Vector3i *>(b._data._mem)->x;
  1767. int32_t vay = reinterpret_cast<const Vector3i *>(a._data._mem)->y;
  1768. int32_t vby = reinterpret_cast<const Vector3i *>(b._data._mem)->y;
  1769. int32_t vaz = reinterpret_cast<const Vector3i *>(a._data._mem)->z;
  1770. int32_t vbz = reinterpret_cast<const Vector3i *>(b._data._mem)->z;
  1771. r_dst = Vector3i(int32_t(vax - vbx), int32_t(vay - vby), int32_t(vaz - vbz));
  1772. }
  1773. return;
  1774. case AABB: {
  1775. const ::AABB *ra = reinterpret_cast<const ::AABB *>(a._data._mem);
  1776. const ::AABB *rb = reinterpret_cast<const ::AABB *>(b._data._mem);
  1777. r_dst = ::AABB(ra->position - rb->position, ra->size - rb->size);
  1778. }
  1779. return;
  1780. case QUATERNION: {
  1781. Quaternion empty_rot;
  1782. const Quaternion *qa = reinterpret_cast<const Quaternion *>(a._data._mem);
  1783. const Quaternion *qb = reinterpret_cast<const Quaternion *>(b._data._mem);
  1784. r_dst = (*qb).inverse() * *qa;
  1785. }
  1786. return;
  1787. case COLOR: {
  1788. const Color *ca = reinterpret_cast<const Color *>(a._data._mem);
  1789. const Color *cb = reinterpret_cast<const Color *>(b._data._mem);
  1790. float new_r = ca->r - cb->r;
  1791. float new_g = ca->g - cb->g;
  1792. float new_b = ca->b - cb->b;
  1793. float new_a = ca->a - cb->a;
  1794. new_r = new_r > 1.0 ? 1.0 : new_r;
  1795. new_g = new_g > 1.0 ? 1.0 : new_g;
  1796. new_b = new_b > 1.0 ? 1.0 : new_b;
  1797. new_a = new_a > 1.0 ? 1.0 : new_a;
  1798. r_dst = Color(new_r, new_g, new_b, new_a);
  1799. }
  1800. return;
  1801. default: {
  1802. r_dst = a;
  1803. }
  1804. return;
  1805. }
  1806. }
  1807. void Variant::blend(const Variant &a, const Variant &b, float c, Variant &r_dst) {
  1808. if (a.type != b.type) {
  1809. if (a.is_num() && b.is_num()) {
  1810. real_t va = a;
  1811. real_t vb = b;
  1812. r_dst = va + vb * c;
  1813. } else {
  1814. r_dst = a;
  1815. }
  1816. return;
  1817. }
  1818. switch (a.type) {
  1819. case NIL: {
  1820. r_dst = Variant();
  1821. }
  1822. return;
  1823. case INT: {
  1824. int64_t va = a._data._int;
  1825. int64_t vb = b._data._int;
  1826. r_dst = int(va + vb * c + 0.5);
  1827. }
  1828. return;
  1829. case FLOAT: {
  1830. double ra = a._data._float;
  1831. double rb = b._data._float;
  1832. r_dst = ra + rb * c;
  1833. }
  1834. return;
  1835. case VECTOR2: {
  1836. r_dst = *reinterpret_cast<const Vector2 *>(a._data._mem) + *reinterpret_cast<const Vector2 *>(b._data._mem) * c;
  1837. }
  1838. return;
  1839. case VECTOR2I: {
  1840. int32_t vax = reinterpret_cast<const Vector2i *>(a._data._mem)->x;
  1841. int32_t vbx = reinterpret_cast<const Vector2i *>(b._data._mem)->x;
  1842. int32_t vay = reinterpret_cast<const Vector2i *>(a._data._mem)->y;
  1843. int32_t vby = reinterpret_cast<const Vector2i *>(b._data._mem)->y;
  1844. r_dst = Vector2i(int32_t(vax + vbx * c + 0.5), int32_t(vay + vby * c + 0.5));
  1845. }
  1846. return;
  1847. case RECT2: {
  1848. const Rect2 *ra = reinterpret_cast<const Rect2 *>(a._data._mem);
  1849. const Rect2 *rb = reinterpret_cast<const Rect2 *>(b._data._mem);
  1850. r_dst = Rect2(ra->position + rb->position * c, ra->size + rb->size * c);
  1851. }
  1852. return;
  1853. case RECT2I: {
  1854. const Rect2i *ra = reinterpret_cast<const Rect2i *>(a._data._mem);
  1855. const Rect2i *rb = reinterpret_cast<const Rect2i *>(b._data._mem);
  1856. int32_t vax = ra->position.x;
  1857. int32_t vay = ra->position.y;
  1858. int32_t vbx = ra->size.x;
  1859. int32_t vby = ra->size.y;
  1860. int32_t vcx = rb->position.x;
  1861. int32_t vcy = rb->position.y;
  1862. int32_t vdx = rb->size.x;
  1863. int32_t vdy = rb->size.y;
  1864. 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));
  1865. }
  1866. return;
  1867. case VECTOR3: {
  1868. r_dst = *reinterpret_cast<const Vector3 *>(a._data._mem) + *reinterpret_cast<const Vector3 *>(b._data._mem) * c;
  1869. }
  1870. return;
  1871. case VECTOR3I: {
  1872. int32_t vax = reinterpret_cast<const Vector3i *>(a._data._mem)->x;
  1873. int32_t vbx = reinterpret_cast<const Vector3i *>(b._data._mem)->x;
  1874. int32_t vay = reinterpret_cast<const Vector3i *>(a._data._mem)->y;
  1875. int32_t vby = reinterpret_cast<const Vector3i *>(b._data._mem)->y;
  1876. int32_t vaz = reinterpret_cast<const Vector3i *>(a._data._mem)->z;
  1877. int32_t vbz = reinterpret_cast<const Vector3i *>(b._data._mem)->z;
  1878. r_dst = Vector3i(int32_t(vax + vbx * c + 0.5), int32_t(vay + vby * c + 0.5), int32_t(vaz + vbz * c + 0.5));
  1879. }
  1880. return;
  1881. case AABB: {
  1882. const ::AABB *ra = reinterpret_cast<const ::AABB *>(a._data._mem);
  1883. const ::AABB *rb = reinterpret_cast<const ::AABB *>(b._data._mem);
  1884. r_dst = ::AABB(ra->position + rb->position * c, ra->size + rb->size * c);
  1885. }
  1886. return;
  1887. case QUATERNION: {
  1888. Quaternion empty_rot;
  1889. const Quaternion *qa = reinterpret_cast<const Quaternion *>(a._data._mem);
  1890. const Quaternion *qb = reinterpret_cast<const Quaternion *>(b._data._mem);
  1891. r_dst = *qa * empty_rot.slerp(*qb, c);
  1892. }
  1893. return;
  1894. case COLOR: {
  1895. const Color *ca = reinterpret_cast<const Color *>(a._data._mem);
  1896. const Color *cb = reinterpret_cast<const Color *>(b._data._mem);
  1897. float new_r = ca->r + cb->r * c;
  1898. float new_g = ca->g + cb->g * c;
  1899. float new_b = ca->b + cb->b * c;
  1900. float new_a = ca->a + cb->a * c;
  1901. new_r = new_r > 1.0 ? 1.0 : new_r;
  1902. new_g = new_g > 1.0 ? 1.0 : new_g;
  1903. new_b = new_b > 1.0 ? 1.0 : new_b;
  1904. new_a = new_a > 1.0 ? 1.0 : new_a;
  1905. r_dst = Color(new_r, new_g, new_b, new_a);
  1906. }
  1907. return;
  1908. default: {
  1909. r_dst = c < 0.5 ? a : b;
  1910. }
  1911. return;
  1912. }
  1913. }
  1914. void Variant::interpolate(const Variant &a, const Variant &b, float c, Variant &r_dst) {
  1915. if (a.type != b.type) {
  1916. if (a.is_num() && b.is_num()) {
  1917. //not as efficient but..
  1918. real_t va = a;
  1919. real_t vb = b;
  1920. r_dst = va + (vb - va) * c;
  1921. } else {
  1922. r_dst = a;
  1923. }
  1924. return;
  1925. }
  1926. switch (a.type) {
  1927. case NIL: {
  1928. r_dst = Variant();
  1929. }
  1930. return;
  1931. case BOOL: {
  1932. r_dst = a;
  1933. }
  1934. return;
  1935. case INT: {
  1936. int64_t va = a._data._int;
  1937. int64_t vb = b._data._int;
  1938. r_dst = int(va + (vb - va) * c);
  1939. }
  1940. return;
  1941. case FLOAT: {
  1942. real_t va = a._data._float;
  1943. real_t vb = b._data._float;
  1944. r_dst = va + (vb - va) * c;
  1945. }
  1946. return;
  1947. case STRING: {
  1948. //this is pretty funny and bizarre, but artists like to use it for typewriter effects
  1949. String sa = *reinterpret_cast<const String *>(a._data._mem);
  1950. String sb = *reinterpret_cast<const String *>(b._data._mem);
  1951. String dst;
  1952. int sa_len = sa.length();
  1953. int sb_len = sb.length();
  1954. int csize = sa_len + (sb_len - sa_len) * c;
  1955. if (csize == 0) {
  1956. r_dst = "";
  1957. return;
  1958. }
  1959. dst.resize(csize + 1);
  1960. dst[csize] = 0;
  1961. int split = csize / 2;
  1962. for (int i = 0; i < csize; i++) {
  1963. char32_t chr = ' ';
  1964. if (i < split) {
  1965. if (i < sa.length()) {
  1966. chr = sa[i];
  1967. } else if (i < sb.length()) {
  1968. chr = sb[i];
  1969. }
  1970. } else {
  1971. if (i < sb.length()) {
  1972. chr = sb[i];
  1973. } else if (i < sa.length()) {
  1974. chr = sa[i];
  1975. }
  1976. }
  1977. dst[i] = chr;
  1978. }
  1979. r_dst = dst;
  1980. }
  1981. return;
  1982. case VECTOR2: {
  1983. r_dst = reinterpret_cast<const Vector2 *>(a._data._mem)->lerp(*reinterpret_cast<const Vector2 *>(b._data._mem), c);
  1984. }
  1985. return;
  1986. case VECTOR2I: {
  1987. int32_t vax = reinterpret_cast<const Vector2i *>(a._data._mem)->x;
  1988. int32_t vbx = reinterpret_cast<const Vector2i *>(b._data._mem)->x;
  1989. int32_t vay = reinterpret_cast<const Vector2i *>(a._data._mem)->y;
  1990. int32_t vby = reinterpret_cast<const Vector2i *>(b._data._mem)->y;
  1991. r_dst = Vector2i(int32_t(vax + vbx * c + 0.5), int32_t(vay + vby * c + 0.5));
  1992. }
  1993. return;
  1994. case RECT2: {
  1995. 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));
  1996. }
  1997. return;
  1998. case RECT2I: {
  1999. const Rect2i *ra = reinterpret_cast<const Rect2i *>(a._data._mem);
  2000. const Rect2i *rb = reinterpret_cast<const Rect2i *>(b._data._mem);
  2001. int32_t vax = ra->position.x;
  2002. int32_t vay = ra->position.y;
  2003. int32_t vbx = ra->size.x;
  2004. int32_t vby = ra->size.y;
  2005. int32_t vcx = rb->position.x;
  2006. int32_t vcy = rb->position.y;
  2007. int32_t vdx = rb->size.x;
  2008. int32_t vdy = rb->size.y;
  2009. 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));
  2010. }
  2011. return;
  2012. case VECTOR3: {
  2013. r_dst = reinterpret_cast<const Vector3 *>(a._data._mem)->lerp(*reinterpret_cast<const Vector3 *>(b._data._mem), c);
  2014. }
  2015. return;
  2016. case VECTOR3I: {
  2017. int32_t vax = reinterpret_cast<const Vector3i *>(a._data._mem)->x;
  2018. int32_t vbx = reinterpret_cast<const Vector3i *>(b._data._mem)->x;
  2019. int32_t vay = reinterpret_cast<const Vector3i *>(a._data._mem)->y;
  2020. int32_t vby = reinterpret_cast<const Vector3i *>(b._data._mem)->y;
  2021. int32_t vaz = reinterpret_cast<const Vector3i *>(a._data._mem)->z;
  2022. int32_t vbz = reinterpret_cast<const Vector3i *>(b._data._mem)->z;
  2023. r_dst = Vector3i(int32_t(vax + vbx * c + 0.5), int32_t(vay + vby * c + 0.5), int32_t(vaz + vbz * c + 0.5));
  2024. }
  2025. return;
  2026. case TRANSFORM2D: {
  2027. r_dst = a._data._transform2d->interpolate_with(*b._data._transform2d, c);
  2028. }
  2029. return;
  2030. case PLANE: {
  2031. r_dst = a;
  2032. }
  2033. return;
  2034. case QUATERNION: {
  2035. r_dst = reinterpret_cast<const Quaternion *>(a._data._mem)->slerp(*reinterpret_cast<const Quaternion *>(b._data._mem), c);
  2036. }
  2037. return;
  2038. case AABB: {
  2039. r_dst = ::AABB(a._data._aabb->position.lerp(b._data._aabb->position, c), a._data._aabb->size.lerp(b._data._aabb->size, c));
  2040. }
  2041. return;
  2042. case BASIS: {
  2043. r_dst = a._data._basis->lerp(*b._data._basis, c);
  2044. }
  2045. return;
  2046. case TRANSFORM3D: {
  2047. r_dst = a._data._transform3d->interpolate_with(*b._data._transform3d, c);
  2048. }
  2049. return;
  2050. case COLOR: {
  2051. r_dst = reinterpret_cast<const Color *>(a._data._mem)->lerp(*reinterpret_cast<const Color *>(b._data._mem), c);
  2052. }
  2053. return;
  2054. case STRING_NAME: {
  2055. r_dst = a;
  2056. }
  2057. return;
  2058. case NODE_PATH: {
  2059. r_dst = a;
  2060. }
  2061. return;
  2062. case RID: {
  2063. r_dst = a;
  2064. }
  2065. return;
  2066. case OBJECT: {
  2067. r_dst = a;
  2068. }
  2069. return;
  2070. case DICTIONARY: {
  2071. }
  2072. return;
  2073. case ARRAY: {
  2074. r_dst = a;
  2075. }
  2076. return;
  2077. case PACKED_BYTE_ARRAY: {
  2078. r_dst = a;
  2079. }
  2080. return;
  2081. case PACKED_INT32_ARRAY: {
  2082. const Vector<int32_t> *arr_a = &PackedArrayRef<int32_t>::get_array(a._data.packed_array);
  2083. const Vector<int32_t> *arr_b = &PackedArrayRef<int32_t>::get_array(b._data.packed_array);
  2084. int32_t sz = arr_a->size();
  2085. if (sz == 0 || arr_b->size() != sz) {
  2086. r_dst = a;
  2087. } else {
  2088. Vector<int32_t> v;
  2089. v.resize(sz);
  2090. {
  2091. int32_t *vw = v.ptrw();
  2092. const int32_t *ar = arr_a->ptr();
  2093. const int32_t *br = arr_b->ptr();
  2094. Variant va;
  2095. for (int32_t i = 0; i < sz; i++) {
  2096. Variant::interpolate(ar[i], br[i], c, va);
  2097. vw[i] = va;
  2098. }
  2099. }
  2100. r_dst = v;
  2101. }
  2102. }
  2103. return;
  2104. case PACKED_INT64_ARRAY: {
  2105. const Vector<int64_t> *arr_a = &PackedArrayRef<int64_t>::get_array(a._data.packed_array);
  2106. const Vector<int64_t> *arr_b = &PackedArrayRef<int64_t>::get_array(b._data.packed_array);
  2107. int64_t sz = arr_a->size();
  2108. if (sz == 0 || arr_b->size() != sz) {
  2109. r_dst = a;
  2110. } else {
  2111. Vector<int64_t> v;
  2112. v.resize(sz);
  2113. {
  2114. int64_t *vw = v.ptrw();
  2115. const int64_t *ar = arr_a->ptr();
  2116. const int64_t *br = arr_b->ptr();
  2117. Variant va;
  2118. for (int64_t i = 0; i < sz; i++) {
  2119. Variant::interpolate(ar[i], br[i], c, va);
  2120. vw[i] = va;
  2121. }
  2122. }
  2123. r_dst = v;
  2124. }
  2125. }
  2126. return;
  2127. case PACKED_FLOAT32_ARRAY: {
  2128. const Vector<float> *arr_a = &PackedArrayRef<float>::get_array(a._data.packed_array);
  2129. const Vector<float> *arr_b = &PackedArrayRef<float>::get_array(b._data.packed_array);
  2130. int sz = arr_a->size();
  2131. if (sz == 0 || arr_b->size() != sz) {
  2132. r_dst = a;
  2133. } else {
  2134. Vector<float> v;
  2135. v.resize(sz);
  2136. {
  2137. float *vw = v.ptrw();
  2138. const float *ar = arr_a->ptr();
  2139. const float *br = arr_b->ptr();
  2140. Variant va;
  2141. for (int i = 0; i < sz; i++) {
  2142. Variant::interpolate(ar[i], br[i], c, va);
  2143. vw[i] = va;
  2144. }
  2145. }
  2146. r_dst = v;
  2147. }
  2148. }
  2149. return;
  2150. case PACKED_FLOAT64_ARRAY: {
  2151. const Vector<double> *arr_a = &PackedArrayRef<double>::get_array(a._data.packed_array);
  2152. const Vector<double> *arr_b = &PackedArrayRef<double>::get_array(b._data.packed_array);
  2153. int sz = arr_a->size();
  2154. if (sz == 0 || arr_b->size() != sz) {
  2155. r_dst = a;
  2156. } else {
  2157. Vector<double> v;
  2158. v.resize(sz);
  2159. {
  2160. double *vw = v.ptrw();
  2161. const double *ar = arr_a->ptr();
  2162. const double *br = arr_b->ptr();
  2163. Variant va;
  2164. for (int i = 0; i < sz; i++) {
  2165. Variant::interpolate(ar[i], br[i], c, va);
  2166. vw[i] = va;
  2167. }
  2168. }
  2169. r_dst = v;
  2170. }
  2171. }
  2172. return;
  2173. case PACKED_STRING_ARRAY: {
  2174. r_dst = a;
  2175. }
  2176. return;
  2177. case PACKED_VECTOR2_ARRAY: {
  2178. const Vector<Vector2> *arr_a = &PackedArrayRef<Vector2>::get_array(a._data.packed_array);
  2179. const Vector<Vector2> *arr_b = &PackedArrayRef<Vector2>::get_array(b._data.packed_array);
  2180. int sz = arr_a->size();
  2181. if (sz == 0 || arr_b->size() != sz) {
  2182. r_dst = a;
  2183. } else {
  2184. Vector<Vector2> v;
  2185. v.resize(sz);
  2186. {
  2187. Vector2 *vw = v.ptrw();
  2188. const Vector2 *ar = arr_a->ptr();
  2189. const Vector2 *br = arr_b->ptr();
  2190. for (int i = 0; i < sz; i++) {
  2191. vw[i] = ar[i].lerp(br[i], c);
  2192. }
  2193. }
  2194. r_dst = v;
  2195. }
  2196. }
  2197. return;
  2198. case PACKED_VECTOR3_ARRAY: {
  2199. const Vector<Vector3> *arr_a = &PackedArrayRef<Vector3>::get_array(a._data.packed_array);
  2200. const Vector<Vector3> *arr_b = &PackedArrayRef<Vector3>::get_array(b._data.packed_array);
  2201. int sz = arr_a->size();
  2202. if (sz == 0 || arr_b->size() != sz) {
  2203. r_dst = a;
  2204. } else {
  2205. Vector<Vector3> v;
  2206. v.resize(sz);
  2207. {
  2208. Vector3 *vw = v.ptrw();
  2209. const Vector3 *ar = arr_a->ptr();
  2210. const Vector3 *br = arr_b->ptr();
  2211. for (int i = 0; i < sz; i++) {
  2212. vw[i] = ar[i].lerp(br[i], c);
  2213. }
  2214. }
  2215. r_dst = v;
  2216. }
  2217. }
  2218. return;
  2219. case PACKED_COLOR_ARRAY: {
  2220. const Vector<Color> *arr_a = &PackedArrayRef<Color>::get_array(a._data.packed_array);
  2221. const Vector<Color> *arr_b = &PackedArrayRef<Color>::get_array(b._data.packed_array);
  2222. int sz = arr_a->size();
  2223. if (sz == 0 || arr_b->size() != sz) {
  2224. r_dst = a;
  2225. } else {
  2226. Vector<Color> v;
  2227. v.resize(sz);
  2228. {
  2229. Color *vw = v.ptrw();
  2230. const Color *ar = arr_a->ptr();
  2231. const Color *br = arr_b->ptr();
  2232. for (int i = 0; i < sz; i++) {
  2233. vw[i] = ar[i].lerp(br[i], c);
  2234. }
  2235. }
  2236. r_dst = v;
  2237. }
  2238. }
  2239. return;
  2240. default: {
  2241. r_dst = a;
  2242. }
  2243. }
  2244. }
  2245. void Variant::_register_variant_setters_getters() {
  2246. register_named_setters_getters();
  2247. register_indexed_setters_getters();
  2248. register_keyed_setters_getters();
  2249. }
  2250. void Variant::_unregister_variant_setters_getters() {
  2251. unregister_named_setters_getters();
  2252. unregister_indexed_setters_getters();
  2253. }