variant_setget.cpp 97 KB

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