2
0

gdscript_functions.cpp 46 KB

1234567891011121314151617181920212223242526272829303132333435363738394041424344454647484950515253545556575859606162636465666768697071727374757677787980818283848586878889909192939495969798991001011021031041051061071081091101111121131141151161171181191201211221231241251261271281291301311321331341351361371381391401411421431441451461471481491501511521531541551561571581591601611621631641651661671681691701711721731741751761771781791801811821831841851861871881891901911921931941951961971981992002012022032042052062072082092102112122132142152162172182192202212222232242252262272282292302312322332342352362372382392402412422432442452462472482492502512522532542552562572582592602612622632642652662672682692702712722732742752762772782792802812822832842852862872882892902912922932942952962972982993003013023033043053063073083093103113123133143153163173183193203213223233243253263273283293303313323333343353363373383393403413423433443453463473483493503513523533543553563573583593603613623633643653663673683693703713723733743753763773783793803813823833843853863873883893903913923933943953963973983994004014024034044054064074084094104114124134144154164174184194204214224234244254264274284294304314324334344354364374384394404414424434444454464474484494504514524534544554564574584594604614624634644654664674684694704714724734744754764774784794804814824834844854864874884894904914924934944954964974984995005015025035045055065075085095105115125135145155165175185195205215225235245255265275285295305315325335345355365375385395405415425435445455465475485495505515525535545555565575585595605615625635645655665675685695705715725735745755765775785795805815825835845855865875885895905915925935945955965975985996006016026036046056066076086096106116126136146156166176186196206216226236246256266276286296306316326336346356366376386396406416426436446456466476486496506516526536546556566576586596606616626636646656666676686696706716726736746756766776786796806816826836846856866876886896906916926936946956966976986997007017027037047057067077087097107117127137147157167177187197207217227237247257267277287297307317327337347357367377387397407417427437447457467477487497507517527537547557567577587597607617627637647657667677687697707717727737747757767777787797807817827837847857867877887897907917927937947957967977987998008018028038048058068078088098108118128138148158168178188198208218228238248258268278288298308318328338348358368378388398408418428438448458468478488498508518528538548558568578588598608618628638648658668678688698708718728738748758768778788798808818828838848858868878888898908918928938948958968978988999009019029039049059069079089099109119129139149159169179189199209219229239249259269279289299309319329339349359369379389399409419429439449459469479489499509519529539549559569579589599609619629639649659669679689699709719729739749759769779789799809819829839849859869879889899909919929939949959969979989991000100110021003100410051006100710081009101010111012101310141015101610171018101910201021102210231024102510261027102810291030103110321033103410351036103710381039104010411042104310441045104610471048104910501051105210531054105510561057105810591060106110621063106410651066106710681069107010711072107310741075107610771078107910801081108210831084108510861087108810891090109110921093109410951096109710981099110011011102110311041105110611071108110911101111111211131114111511161117111811191120112111221123112411251126112711281129113011311132113311341135113611371138113911401141114211431144114511461147114811491150115111521153115411551156115711581159116011611162116311641165116611671168116911701171117211731174117511761177117811791180118111821183118411851186118711881189119011911192119311941195119611971198119912001201120212031204120512061207120812091210121112121213121412151216121712181219122012211222122312241225122612271228122912301231123212331234123512361237123812391240124112421243124412451246124712481249125012511252125312541255125612571258125912601261126212631264126512661267126812691270127112721273127412751276127712781279128012811282128312841285128612871288128912901291129212931294129512961297129812991300130113021303130413051306130713081309131013111312131313141315131613171318131913201321132213231324132513261327132813291330133113321333133413351336133713381339134013411342134313441345134613471348134913501351135213531354135513561357135813591360136113621363136413651366136713681369137013711372137313741375137613771378137913801381138213831384138513861387138813891390139113921393139413951396139713981399140014011402140314041405140614071408140914101411141214131414141514161417141814191420142114221423142414251426142714281429143014311432143314341435143614371438143914401441144214431444144514461447144814491450145114521453145414551456145714581459146014611462146314641465146614671468146914701471147214731474147514761477147814791480148114821483148414851486148714881489149014911492149314941495149614971498149915001501150215031504150515061507150815091510151115121513151415151516151715181519152015211522152315241525152615271528152915301531153215331534153515361537153815391540154115421543154415451546154715481549155015511552155315541555155615571558155915601561156215631564156515661567156815691570157115721573157415751576157715781579158015811582158315841585158615871588158915901591159215931594159515961597159815991600160116021603160416051606160716081609161016111612161316141615161616171618161916201621162216231624162516261627162816291630163116321633163416351636163716381639164016411642164316441645164616471648164916501651165216531654165516561657165816591660166116621663166416651666166716681669167016711672167316741675167616771678167916801681168216831684168516861687168816891690169116921693169416951696169716981699170017011702170317041705170617071708170917101711171217131714171517161717171817191720172117221723172417251726172717281729173017311732173317341735173617371738173917401741174217431744174517461747174817491750175117521753175417551756175717581759176017611762176317641765176617671768176917701771177217731774177517761777177817791780178117821783178417851786178717881789179017911792179317941795179617971798179918001801180218031804180518061807180818091810181118121813181418151816181718181819182018211822182318241825182618271828182918301831183218331834183518361837183818391840
  1. /*************************************************************************/
  2. /* gdscript_functions.cpp */
  3. /*************************************************************************/
  4. /* This file is part of: */
  5. /* GODOT ENGINE */
  6. /* https://godotengine.org */
  7. /*************************************************************************/
  8. /* Copyright (c) 2007-2018 Juan Linietsky, Ariel Manzur. */
  9. /* Copyright (c) 2014-2018 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 "gdscript_functions.h"
  31. #include "class_db.h"
  32. #include "func_ref.h"
  33. #include "gdscript.h"
  34. #include "io/json.h"
  35. #include "io/marshalls.h"
  36. #include "math_funcs.h"
  37. #include "os/os.h"
  38. #include "reference.h"
  39. #include "variant_parser.h"
  40. const char *GDScriptFunctions::get_func_name(Function p_func) {
  41. ERR_FAIL_INDEX_V(p_func, FUNC_MAX, "");
  42. static const char *_names[FUNC_MAX] = {
  43. "sin",
  44. "cos",
  45. "tan",
  46. "sinh",
  47. "cosh",
  48. "tanh",
  49. "asin",
  50. "acos",
  51. "atan",
  52. "atan2",
  53. "sqrt",
  54. "fmod",
  55. "fposmod",
  56. "floor",
  57. "ceil",
  58. "round",
  59. "abs",
  60. "sign",
  61. "pow",
  62. "log",
  63. "exp",
  64. "is_nan",
  65. "is_inf",
  66. "ease",
  67. "decimals",
  68. "stepify",
  69. "lerp",
  70. "inverse_lerp",
  71. "range_lerp",
  72. "dectime",
  73. "randomize",
  74. "randi",
  75. "randf",
  76. "rand_range",
  77. "seed",
  78. "rand_seed",
  79. "deg2rad",
  80. "rad2deg",
  81. "linear2db",
  82. "db2linear",
  83. "polar2cartesian",
  84. "cartesian2polar",
  85. "wrapi",
  86. "wrapf",
  87. "max",
  88. "min",
  89. "clamp",
  90. "nearest_po2",
  91. "weakref",
  92. "funcref",
  93. "convert",
  94. "typeof",
  95. "type_exists",
  96. "char",
  97. "str",
  98. "print",
  99. "printt",
  100. "prints",
  101. "printerr",
  102. "printraw",
  103. "var2str",
  104. "str2var",
  105. "var2bytes",
  106. "bytes2var",
  107. "range",
  108. "load",
  109. "inst2dict",
  110. "dict2inst",
  111. "validate_json",
  112. "parse_json",
  113. "to_json",
  114. "hash",
  115. "Color8",
  116. "ColorN",
  117. "print_stack",
  118. "instance_from_id",
  119. "len",
  120. "is_instance_valid",
  121. };
  122. return _names[p_func];
  123. }
  124. void GDScriptFunctions::call(Function p_func, const Variant **p_args, int p_arg_count, Variant &r_ret, Variant::CallError &r_error) {
  125. r_error.error = Variant::CallError::CALL_OK;
  126. #ifdef DEBUG_ENABLED
  127. #define VALIDATE_ARG_COUNT(m_count) \
  128. if (p_arg_count < m_count) { \
  129. r_error.error = Variant::CallError::CALL_ERROR_TOO_FEW_ARGUMENTS; \
  130. r_error.argument = m_count; \
  131. r_ret = Variant(); \
  132. return; \
  133. } \
  134. if (p_arg_count > m_count) { \
  135. r_error.error = Variant::CallError::CALL_ERROR_TOO_MANY_ARGUMENTS; \
  136. r_error.argument = m_count; \
  137. r_ret = Variant(); \
  138. return; \
  139. }
  140. #define VALIDATE_ARG_NUM(m_arg) \
  141. if (!p_args[m_arg]->is_num()) { \
  142. r_error.error = Variant::CallError::CALL_ERROR_INVALID_ARGUMENT; \
  143. r_error.argument = m_arg; \
  144. r_error.expected = Variant::REAL; \
  145. r_ret = Variant(); \
  146. return; \
  147. }
  148. #else
  149. #define VALIDATE_ARG_COUNT(m_count)
  150. #define VALIDATE_ARG_NUM(m_arg)
  151. #endif
  152. //using a switch, so the compiler generates a jumptable
  153. switch (p_func) {
  154. case MATH_SIN: {
  155. VALIDATE_ARG_COUNT(1);
  156. VALIDATE_ARG_NUM(0);
  157. r_ret = Math::sin((double)*p_args[0]);
  158. } break;
  159. case MATH_COS: {
  160. VALIDATE_ARG_COUNT(1);
  161. VALIDATE_ARG_NUM(0);
  162. r_ret = Math::cos((double)*p_args[0]);
  163. } break;
  164. case MATH_TAN: {
  165. VALIDATE_ARG_COUNT(1);
  166. VALIDATE_ARG_NUM(0);
  167. r_ret = Math::tan((double)*p_args[0]);
  168. } break;
  169. case MATH_SINH: {
  170. VALIDATE_ARG_COUNT(1);
  171. VALIDATE_ARG_NUM(0);
  172. r_ret = Math::sinh((double)*p_args[0]);
  173. } break;
  174. case MATH_COSH: {
  175. VALIDATE_ARG_COUNT(1);
  176. VALIDATE_ARG_NUM(0);
  177. r_ret = Math::cosh((double)*p_args[0]);
  178. } break;
  179. case MATH_TANH: {
  180. VALIDATE_ARG_COUNT(1);
  181. VALIDATE_ARG_NUM(0);
  182. r_ret = Math::tanh((double)*p_args[0]);
  183. } break;
  184. case MATH_ASIN: {
  185. VALIDATE_ARG_COUNT(1);
  186. VALIDATE_ARG_NUM(0);
  187. r_ret = Math::asin((double)*p_args[0]);
  188. } break;
  189. case MATH_ACOS: {
  190. VALIDATE_ARG_COUNT(1);
  191. VALIDATE_ARG_NUM(0);
  192. r_ret = Math::acos((double)*p_args[0]);
  193. } break;
  194. case MATH_ATAN: {
  195. VALIDATE_ARG_COUNT(1);
  196. VALIDATE_ARG_NUM(0);
  197. r_ret = Math::atan((double)*p_args[0]);
  198. } break;
  199. case MATH_ATAN2: {
  200. VALIDATE_ARG_COUNT(2);
  201. VALIDATE_ARG_NUM(0);
  202. VALIDATE_ARG_NUM(1);
  203. r_ret = Math::atan2((double)*p_args[0], (double)*p_args[1]);
  204. } break;
  205. case MATH_SQRT: {
  206. VALIDATE_ARG_COUNT(1);
  207. VALIDATE_ARG_NUM(0);
  208. r_ret = Math::sqrt((double)*p_args[0]);
  209. } break;
  210. case MATH_FMOD: {
  211. VALIDATE_ARG_COUNT(2);
  212. VALIDATE_ARG_NUM(0);
  213. VALIDATE_ARG_NUM(1);
  214. r_ret = Math::fmod((double)*p_args[0], (double)*p_args[1]);
  215. } break;
  216. case MATH_FPOSMOD: {
  217. VALIDATE_ARG_COUNT(2);
  218. VALIDATE_ARG_NUM(0);
  219. VALIDATE_ARG_NUM(1);
  220. r_ret = Math::fposmod((double)*p_args[0], (double)*p_args[1]);
  221. } break;
  222. case MATH_FLOOR: {
  223. VALIDATE_ARG_COUNT(1);
  224. VALIDATE_ARG_NUM(0);
  225. r_ret = Math::floor((double)*p_args[0]);
  226. } break;
  227. case MATH_CEIL: {
  228. VALIDATE_ARG_COUNT(1);
  229. VALIDATE_ARG_NUM(0);
  230. r_ret = Math::ceil((double)*p_args[0]);
  231. } break;
  232. case MATH_ROUND: {
  233. VALIDATE_ARG_COUNT(1);
  234. VALIDATE_ARG_NUM(0);
  235. r_ret = Math::round((double)*p_args[0]);
  236. } break;
  237. case MATH_ABS: {
  238. VALIDATE_ARG_COUNT(1);
  239. if (p_args[0]->get_type() == Variant::INT) {
  240. int64_t i = *p_args[0];
  241. r_ret = ABS(i);
  242. } else if (p_args[0]->get_type() == Variant::REAL) {
  243. double r = *p_args[0];
  244. r_ret = Math::abs(r);
  245. } else {
  246. r_error.error = Variant::CallError::CALL_ERROR_INVALID_ARGUMENT;
  247. r_error.argument = 0;
  248. r_error.expected = Variant::REAL;
  249. r_ret = Variant();
  250. }
  251. } break;
  252. case MATH_SIGN: {
  253. VALIDATE_ARG_COUNT(1);
  254. if (p_args[0]->get_type() == Variant::INT) {
  255. int64_t i = *p_args[0];
  256. r_ret = i < 0 ? -1 : (i > 0 ? +1 : 0);
  257. } else if (p_args[0]->get_type() == Variant::REAL) {
  258. real_t r = *p_args[0];
  259. r_ret = r < 0.0 ? -1.0 : (r > 0.0 ? +1.0 : 0.0);
  260. } else {
  261. r_error.error = Variant::CallError::CALL_ERROR_INVALID_ARGUMENT;
  262. r_error.argument = 0;
  263. r_error.expected = Variant::REAL;
  264. r_ret = Variant();
  265. }
  266. } break;
  267. case MATH_POW: {
  268. VALIDATE_ARG_COUNT(2);
  269. VALIDATE_ARG_NUM(0);
  270. VALIDATE_ARG_NUM(1);
  271. r_ret = Math::pow((double)*p_args[0], (double)*p_args[1]);
  272. } break;
  273. case MATH_LOG: {
  274. VALIDATE_ARG_COUNT(1);
  275. VALIDATE_ARG_NUM(0);
  276. r_ret = Math::log((double)*p_args[0]);
  277. } break;
  278. case MATH_EXP: {
  279. VALIDATE_ARG_COUNT(1);
  280. VALIDATE_ARG_NUM(0);
  281. r_ret = Math::exp((double)*p_args[0]);
  282. } break;
  283. case MATH_ISNAN: {
  284. VALIDATE_ARG_COUNT(1);
  285. VALIDATE_ARG_NUM(0);
  286. r_ret = Math::is_nan((double)*p_args[0]);
  287. } break;
  288. case MATH_ISINF: {
  289. VALIDATE_ARG_COUNT(1);
  290. VALIDATE_ARG_NUM(0);
  291. r_ret = Math::is_inf((double)*p_args[0]);
  292. } break;
  293. case MATH_EASE: {
  294. VALIDATE_ARG_COUNT(2);
  295. VALIDATE_ARG_NUM(0);
  296. VALIDATE_ARG_NUM(1);
  297. r_ret = Math::ease((double)*p_args[0], (double)*p_args[1]);
  298. } break;
  299. case MATH_DECIMALS: {
  300. VALIDATE_ARG_COUNT(1);
  301. VALIDATE_ARG_NUM(0);
  302. r_ret = Math::step_decimals((double)*p_args[0]);
  303. } break;
  304. case MATH_STEPIFY: {
  305. VALIDATE_ARG_COUNT(2);
  306. VALIDATE_ARG_NUM(0);
  307. VALIDATE_ARG_NUM(1);
  308. r_ret = Math::stepify((double)*p_args[0], (double)*p_args[1]);
  309. } break;
  310. case MATH_LERP: {
  311. VALIDATE_ARG_COUNT(3);
  312. VALIDATE_ARG_NUM(2);
  313. const double t = (double)*p_args[2];
  314. switch (p_args[0]->get_type() == p_args[1]->get_type() ? p_args[0]->get_type() : Variant::REAL) {
  315. case Variant::VECTOR2: {
  316. r_ret = ((Vector2)*p_args[0]).linear_interpolate((Vector2)*p_args[1], t);
  317. } break;
  318. case Variant::VECTOR3: {
  319. r_ret = ((Vector3)*p_args[0]).linear_interpolate((Vector3)*p_args[1], t);
  320. } break;
  321. case Variant::COLOR: {
  322. r_ret = ((Color)*p_args[0]).linear_interpolate((Color)*p_args[1], t);
  323. } break;
  324. default: {
  325. VALIDATE_ARG_NUM(0);
  326. VALIDATE_ARG_NUM(1);
  327. r_ret = Math::lerp((double)*p_args[0], (double)*p_args[1], t);
  328. } break;
  329. }
  330. } break;
  331. case MATH_INVERSE_LERP: {
  332. VALIDATE_ARG_COUNT(3);
  333. VALIDATE_ARG_NUM(0);
  334. VALIDATE_ARG_NUM(1);
  335. VALIDATE_ARG_NUM(2);
  336. r_ret = Math::inverse_lerp((double)*p_args[0], (double)*p_args[1], (double)*p_args[2]);
  337. } break;
  338. case MATH_RANGE_LERP: {
  339. VALIDATE_ARG_COUNT(5);
  340. VALIDATE_ARG_NUM(0);
  341. VALIDATE_ARG_NUM(1);
  342. VALIDATE_ARG_NUM(2);
  343. VALIDATE_ARG_NUM(3);
  344. VALIDATE_ARG_NUM(4);
  345. r_ret = Math::range_lerp((double)*p_args[0], (double)*p_args[1], (double)*p_args[2], (double)*p_args[3], (double)*p_args[4]);
  346. } break;
  347. case MATH_DECTIME: {
  348. VALIDATE_ARG_COUNT(3);
  349. VALIDATE_ARG_NUM(0);
  350. VALIDATE_ARG_NUM(1);
  351. VALIDATE_ARG_NUM(2);
  352. r_ret = Math::dectime((double)*p_args[0], (double)*p_args[1], (double)*p_args[2]);
  353. } break;
  354. case MATH_RANDOMIZE: {
  355. VALIDATE_ARG_COUNT(0);
  356. Math::randomize();
  357. r_ret = Variant();
  358. } break;
  359. case MATH_RAND: {
  360. VALIDATE_ARG_COUNT(0);
  361. r_ret = Math::rand();
  362. } break;
  363. case MATH_RANDF: {
  364. VALIDATE_ARG_COUNT(0);
  365. r_ret = Math::randf();
  366. } break;
  367. case MATH_RANDOM: {
  368. VALIDATE_ARG_COUNT(2);
  369. VALIDATE_ARG_NUM(0);
  370. VALIDATE_ARG_NUM(1);
  371. r_ret = Math::random((double)*p_args[0], (double)*p_args[1]);
  372. } break;
  373. case MATH_SEED: {
  374. VALIDATE_ARG_COUNT(1);
  375. VALIDATE_ARG_NUM(0);
  376. uint64_t seed = *p_args[0];
  377. Math::seed(seed);
  378. r_ret = Variant();
  379. } break;
  380. case MATH_RANDSEED: {
  381. VALIDATE_ARG_COUNT(1);
  382. VALIDATE_ARG_NUM(0);
  383. uint64_t seed = *p_args[0];
  384. int ret = Math::rand_from_seed(&seed);
  385. Array reta;
  386. reta.push_back(ret);
  387. reta.push_back(seed);
  388. r_ret = reta;
  389. } break;
  390. case MATH_DEG2RAD: {
  391. VALIDATE_ARG_COUNT(1);
  392. VALIDATE_ARG_NUM(0);
  393. r_ret = Math::deg2rad((double)*p_args[0]);
  394. } break;
  395. case MATH_RAD2DEG: {
  396. VALIDATE_ARG_COUNT(1);
  397. VALIDATE_ARG_NUM(0);
  398. r_ret = Math::rad2deg((double)*p_args[0]);
  399. } break;
  400. case MATH_LINEAR2DB: {
  401. VALIDATE_ARG_COUNT(1);
  402. VALIDATE_ARG_NUM(0);
  403. r_ret = Math::linear2db((double)*p_args[0]);
  404. } break;
  405. case MATH_DB2LINEAR: {
  406. VALIDATE_ARG_COUNT(1);
  407. VALIDATE_ARG_NUM(0);
  408. r_ret = Math::db2linear((double)*p_args[0]);
  409. } break;
  410. case MATH_POLAR2CARTESIAN: {
  411. VALIDATE_ARG_COUNT(2);
  412. VALIDATE_ARG_NUM(0);
  413. VALIDATE_ARG_NUM(1);
  414. double r = *p_args[0];
  415. double th = *p_args[1];
  416. r_ret = Vector2(r * Math::cos(th), r * Math::sin(th));
  417. } break;
  418. case MATH_CARTESIAN2POLAR: {
  419. VALIDATE_ARG_COUNT(2);
  420. VALIDATE_ARG_NUM(0);
  421. VALIDATE_ARG_NUM(1);
  422. double x = *p_args[0];
  423. double y = *p_args[1];
  424. r_ret = Vector2(Math::sqrt(x * x + y * y), Math::atan2(y, x));
  425. } break;
  426. case MATH_WRAP: {
  427. VALIDATE_ARG_COUNT(3);
  428. r_ret = Math::wrapi((int64_t)*p_args[0], (int64_t)*p_args[1], (int64_t)*p_args[2]);
  429. } break;
  430. case MATH_WRAPF: {
  431. VALIDATE_ARG_COUNT(3);
  432. r_ret = Math::wrapf((double)*p_args[0], (double)*p_args[1], (double)*p_args[2]);
  433. } break;
  434. case LOGIC_MAX: {
  435. VALIDATE_ARG_COUNT(2);
  436. if (p_args[0]->get_type() == Variant::INT && p_args[1]->get_type() == Variant::INT) {
  437. int64_t a = *p_args[0];
  438. int64_t b = *p_args[1];
  439. r_ret = MAX(a, b);
  440. } else {
  441. VALIDATE_ARG_NUM(0);
  442. VALIDATE_ARG_NUM(1);
  443. real_t a = *p_args[0];
  444. real_t b = *p_args[1];
  445. r_ret = MAX(a, b);
  446. }
  447. } break;
  448. case LOGIC_MIN: {
  449. VALIDATE_ARG_COUNT(2);
  450. if (p_args[0]->get_type() == Variant::INT && p_args[1]->get_type() == Variant::INT) {
  451. int64_t a = *p_args[0];
  452. int64_t b = *p_args[1];
  453. r_ret = MIN(a, b);
  454. } else {
  455. VALIDATE_ARG_NUM(0);
  456. VALIDATE_ARG_NUM(1);
  457. real_t a = *p_args[0];
  458. real_t b = *p_args[1];
  459. r_ret = MIN(a, b);
  460. }
  461. } break;
  462. case LOGIC_CLAMP: {
  463. VALIDATE_ARG_COUNT(3);
  464. if (p_args[0]->get_type() == Variant::INT && p_args[1]->get_type() == Variant::INT && p_args[2]->get_type() == Variant::INT) {
  465. int64_t a = *p_args[0];
  466. int64_t b = *p_args[1];
  467. int64_t c = *p_args[2];
  468. r_ret = CLAMP(a, b, c);
  469. } else {
  470. VALIDATE_ARG_NUM(0);
  471. VALIDATE_ARG_NUM(1);
  472. VALIDATE_ARG_NUM(2);
  473. real_t a = *p_args[0];
  474. real_t b = *p_args[1];
  475. real_t c = *p_args[2];
  476. r_ret = CLAMP(a, b, c);
  477. }
  478. } break;
  479. case LOGIC_NEAREST_PO2: {
  480. VALIDATE_ARG_COUNT(1);
  481. VALIDATE_ARG_NUM(0);
  482. int64_t num = *p_args[0];
  483. r_ret = next_power_of_2(num);
  484. } break;
  485. case OBJ_WEAKREF: {
  486. VALIDATE_ARG_COUNT(1);
  487. if (p_args[0]->get_type() != Variant::OBJECT) {
  488. r_error.error = Variant::CallError::CALL_ERROR_INVALID_ARGUMENT;
  489. r_error.argument = 0;
  490. r_error.expected = Variant::OBJECT;
  491. r_ret = Variant();
  492. return;
  493. }
  494. if (p_args[0]->is_ref()) {
  495. REF r = *p_args[0];
  496. if (!r.is_valid()) {
  497. r_ret = Variant();
  498. return;
  499. }
  500. Ref<WeakRef> wref = memnew(WeakRef);
  501. wref->set_ref(r);
  502. r_ret = wref;
  503. } else {
  504. Object *obj = *p_args[0];
  505. if (!obj) {
  506. r_ret = Variant();
  507. return;
  508. }
  509. Ref<WeakRef> wref = memnew(WeakRef);
  510. wref->set_obj(obj);
  511. r_ret = wref;
  512. }
  513. } break;
  514. case FUNC_FUNCREF: {
  515. VALIDATE_ARG_COUNT(2);
  516. if (p_args[0]->get_type() != Variant::OBJECT) {
  517. r_error.error = Variant::CallError::CALL_ERROR_INVALID_ARGUMENT;
  518. r_error.argument = 0;
  519. r_error.expected = Variant::OBJECT;
  520. r_ret = Variant();
  521. return;
  522. }
  523. if (p_args[1]->get_type() != Variant::STRING && p_args[1]->get_type() != Variant::NODE_PATH) {
  524. r_error.error = Variant::CallError::CALL_ERROR_INVALID_ARGUMENT;
  525. r_error.argument = 1;
  526. r_error.expected = Variant::STRING;
  527. r_ret = Variant();
  528. return;
  529. }
  530. Ref<FuncRef> fr = memnew(FuncRef);
  531. fr->set_instance(*p_args[0]);
  532. fr->set_function(*p_args[1]);
  533. r_ret = fr;
  534. } break;
  535. case TYPE_CONVERT: {
  536. VALIDATE_ARG_COUNT(2);
  537. VALIDATE_ARG_NUM(1);
  538. int type = *p_args[1];
  539. if (type < 0 || type >= Variant::VARIANT_MAX) {
  540. r_ret = RTR("Invalid type argument to convert(), use TYPE_* constants.");
  541. r_error.error = Variant::CallError::CALL_ERROR_INVALID_ARGUMENT;
  542. r_error.argument = 0;
  543. r_error.expected = Variant::INT;
  544. return;
  545. } else {
  546. r_ret = Variant::construct(Variant::Type(type), p_args, 1, r_error);
  547. }
  548. } break;
  549. case TYPE_OF: {
  550. VALIDATE_ARG_COUNT(1);
  551. r_ret = p_args[0]->get_type();
  552. } break;
  553. case TYPE_EXISTS: {
  554. VALIDATE_ARG_COUNT(1);
  555. r_ret = ClassDB::class_exists(*p_args[0]);
  556. } break;
  557. case TEXT_CHAR: {
  558. VALIDATE_ARG_COUNT(1);
  559. VALIDATE_ARG_NUM(0);
  560. CharType result[2] = { *p_args[0], 0 };
  561. r_ret = String(result);
  562. } break;
  563. case TEXT_STR: {
  564. if (p_arg_count < 1) {
  565. r_error.error = Variant::CallError::CALL_ERROR_TOO_FEW_ARGUMENTS;
  566. r_error.argument = 1;
  567. r_ret = Variant();
  568. return;
  569. }
  570. String str;
  571. for (int i = 0; i < p_arg_count; i++) {
  572. String os = p_args[i]->operator String();
  573. if (i == 0)
  574. str = os;
  575. else
  576. str += os;
  577. }
  578. r_ret = str;
  579. } break;
  580. case TEXT_PRINT: {
  581. String str;
  582. for (int i = 0; i < p_arg_count; i++) {
  583. str += p_args[i]->operator String();
  584. }
  585. //str+="\n";
  586. print_line(str);
  587. r_ret = Variant();
  588. } break;
  589. case TEXT_PRINT_TABBED: {
  590. String str;
  591. for (int i = 0; i < p_arg_count; i++) {
  592. if (i)
  593. str += "\t";
  594. str += p_args[i]->operator String();
  595. }
  596. //str+="\n";
  597. print_line(str);
  598. r_ret = Variant();
  599. } break;
  600. case TEXT_PRINT_SPACED: {
  601. String str;
  602. for (int i = 0; i < p_arg_count; i++) {
  603. if (i)
  604. str += " ";
  605. str += p_args[i]->operator String();
  606. }
  607. //str+="\n";
  608. print_line(str);
  609. r_ret = Variant();
  610. } break;
  611. case TEXT_PRINTERR: {
  612. String str;
  613. for (int i = 0; i < p_arg_count; i++) {
  614. str += p_args[i]->operator String();
  615. }
  616. //str+="\n";
  617. print_error(str);
  618. r_ret = Variant();
  619. } break;
  620. case TEXT_PRINTRAW: {
  621. String str;
  622. for (int i = 0; i < p_arg_count; i++) {
  623. str += p_args[i]->operator String();
  624. }
  625. //str+="\n";
  626. OS::get_singleton()->print("%s", str.utf8().get_data());
  627. r_ret = Variant();
  628. } break;
  629. case VAR_TO_STR: {
  630. VALIDATE_ARG_COUNT(1);
  631. String vars;
  632. VariantWriter::write_to_string(*p_args[0], vars);
  633. r_ret = vars;
  634. } break;
  635. case STR_TO_VAR: {
  636. VALIDATE_ARG_COUNT(1);
  637. if (p_args[0]->get_type() != Variant::STRING) {
  638. r_error.error = Variant::CallError::CALL_ERROR_INVALID_ARGUMENT;
  639. r_error.argument = 0;
  640. r_error.expected = Variant::STRING;
  641. r_ret = Variant();
  642. return;
  643. }
  644. VariantParser::StreamString ss;
  645. ss.s = *p_args[0];
  646. String errs;
  647. int line;
  648. Error err = VariantParser::parse(&ss, r_ret, errs, line);
  649. if (err != OK) {
  650. r_error.error = Variant::CallError::CALL_ERROR_INVALID_ARGUMENT;
  651. r_error.argument = 0;
  652. r_error.expected = Variant::STRING;
  653. r_ret = "Parse error at line " + itos(line) + ": " + errs;
  654. return;
  655. }
  656. } break;
  657. case VAR_TO_BYTES: {
  658. VALIDATE_ARG_COUNT(1);
  659. PoolByteArray barr;
  660. int len;
  661. Error err = encode_variant(*p_args[0], NULL, len);
  662. if (err) {
  663. r_error.error = Variant::CallError::CALL_ERROR_INVALID_ARGUMENT;
  664. r_error.argument = 0;
  665. r_error.expected = Variant::NIL;
  666. r_ret = "Unexpected error encoding variable to bytes, likely unserializable type found (Object or RID).";
  667. return;
  668. }
  669. barr.resize(len);
  670. {
  671. PoolByteArray::Write w = barr.write();
  672. encode_variant(*p_args[0], w.ptr(), len);
  673. }
  674. r_ret = barr;
  675. } break;
  676. case BYTES_TO_VAR: {
  677. VALIDATE_ARG_COUNT(1);
  678. if (p_args[0]->get_type() != Variant::POOL_BYTE_ARRAY) {
  679. r_error.error = Variant::CallError::CALL_ERROR_INVALID_ARGUMENT;
  680. r_error.argument = 0;
  681. r_error.expected = Variant::POOL_BYTE_ARRAY;
  682. r_ret = Variant();
  683. return;
  684. }
  685. PoolByteArray varr = *p_args[0];
  686. Variant ret;
  687. {
  688. PoolByteArray::Read r = varr.read();
  689. Error err = decode_variant(ret, r.ptr(), varr.size(), NULL);
  690. if (err != OK) {
  691. r_ret = RTR("Not enough bytes for decoding bytes, or invalid format.");
  692. r_error.error = Variant::CallError::CALL_ERROR_INVALID_ARGUMENT;
  693. r_error.argument = 0;
  694. r_error.expected = Variant::POOL_BYTE_ARRAY;
  695. return;
  696. }
  697. }
  698. r_ret = ret;
  699. } break;
  700. case GEN_RANGE: {
  701. switch (p_arg_count) {
  702. case 0: {
  703. r_error.error = Variant::CallError::CALL_ERROR_TOO_FEW_ARGUMENTS;
  704. r_error.argument = 1;
  705. r_ret = Variant();
  706. } break;
  707. case 1: {
  708. VALIDATE_ARG_NUM(0);
  709. int count = *p_args[0];
  710. Array arr;
  711. if (count <= 0) {
  712. r_ret = arr;
  713. return;
  714. }
  715. Error err = arr.resize(count);
  716. if (err != OK) {
  717. r_error.error = Variant::CallError::CALL_ERROR_INVALID_METHOD;
  718. r_ret = Variant();
  719. return;
  720. }
  721. for (int i = 0; i < count; i++) {
  722. arr[i] = i;
  723. }
  724. r_ret = arr;
  725. } break;
  726. case 2: {
  727. VALIDATE_ARG_NUM(0);
  728. VALIDATE_ARG_NUM(1);
  729. int from = *p_args[0];
  730. int to = *p_args[1];
  731. Array arr;
  732. if (from >= to) {
  733. r_ret = arr;
  734. return;
  735. }
  736. Error err = arr.resize(to - from);
  737. if (err != OK) {
  738. r_error.error = Variant::CallError::CALL_ERROR_INVALID_METHOD;
  739. r_ret = Variant();
  740. return;
  741. }
  742. for (int i = from; i < to; i++)
  743. arr[i - from] = i;
  744. r_ret = arr;
  745. } break;
  746. case 3: {
  747. VALIDATE_ARG_NUM(0);
  748. VALIDATE_ARG_NUM(1);
  749. VALIDATE_ARG_NUM(2);
  750. int from = *p_args[0];
  751. int to = *p_args[1];
  752. int incr = *p_args[2];
  753. if (incr == 0) {
  754. r_ret = RTR("step argument is zero!");
  755. r_error.error = Variant::CallError::CALL_ERROR_INVALID_METHOD;
  756. return;
  757. }
  758. Array arr;
  759. if (from >= to && incr > 0) {
  760. r_ret = arr;
  761. return;
  762. }
  763. if (from <= to && incr < 0) {
  764. r_ret = arr;
  765. return;
  766. }
  767. //calculate how many
  768. int count = 0;
  769. if (incr > 0) {
  770. count = ((to - from - 1) / incr) + 1;
  771. } else {
  772. count = ((from - to - 1) / -incr) + 1;
  773. }
  774. Error err = arr.resize(count);
  775. if (err != OK) {
  776. r_error.error = Variant::CallError::CALL_ERROR_INVALID_METHOD;
  777. r_ret = Variant();
  778. return;
  779. }
  780. if (incr > 0) {
  781. int idx = 0;
  782. for (int i = from; i < to; i += incr) {
  783. arr[idx++] = i;
  784. }
  785. } else {
  786. int idx = 0;
  787. for (int i = from; i > to; i += incr) {
  788. arr[idx++] = i;
  789. }
  790. }
  791. r_ret = arr;
  792. } break;
  793. default: {
  794. r_error.error = Variant::CallError::CALL_ERROR_TOO_MANY_ARGUMENTS;
  795. r_error.argument = 3;
  796. r_ret = Variant();
  797. } break;
  798. }
  799. } break;
  800. case RESOURCE_LOAD: {
  801. VALIDATE_ARG_COUNT(1);
  802. if (p_args[0]->get_type() != Variant::STRING) {
  803. r_error.error = Variant::CallError::CALL_ERROR_INVALID_ARGUMENT;
  804. r_error.argument = 0;
  805. r_error.expected = Variant::STRING;
  806. r_ret = Variant();
  807. } else {
  808. r_ret = ResourceLoader::load(*p_args[0]);
  809. }
  810. } break;
  811. case INST2DICT: {
  812. VALIDATE_ARG_COUNT(1);
  813. if (p_args[0]->get_type() == Variant::NIL) {
  814. r_ret = Variant();
  815. } else if (p_args[0]->get_type() != Variant::OBJECT) {
  816. r_error.error = Variant::CallError::CALL_ERROR_INVALID_ARGUMENT;
  817. r_error.argument = 0;
  818. r_ret = Variant();
  819. } else {
  820. Object *obj = *p_args[0];
  821. if (!obj) {
  822. r_ret = Variant();
  823. } else if (!obj->get_script_instance() || obj->get_script_instance()->get_language() != GDScriptLanguage::get_singleton()) {
  824. r_error.error = Variant::CallError::CALL_ERROR_INVALID_ARGUMENT;
  825. r_error.argument = 0;
  826. r_error.expected = Variant::DICTIONARY;
  827. r_ret = RTR("Not a script with an instance");
  828. return;
  829. } else {
  830. GDScriptInstance *ins = static_cast<GDScriptInstance *>(obj->get_script_instance());
  831. Ref<GDScript> base = ins->get_script();
  832. if (base.is_null()) {
  833. r_error.error = Variant::CallError::CALL_ERROR_INVALID_ARGUMENT;
  834. r_error.argument = 0;
  835. r_error.expected = Variant::DICTIONARY;
  836. r_ret = RTR("Not based on a script");
  837. return;
  838. }
  839. GDScript *p = base.ptr();
  840. Vector<StringName> sname;
  841. while (p->_owner) {
  842. sname.push_back(p->name);
  843. p = p->_owner;
  844. }
  845. sname.invert();
  846. if (!p->path.is_resource_file()) {
  847. r_error.error = Variant::CallError::CALL_ERROR_INVALID_ARGUMENT;
  848. r_error.argument = 0;
  849. r_error.expected = Variant::DICTIONARY;
  850. r_ret = Variant();
  851. r_ret = RTR("Not based on a resource file");
  852. return;
  853. }
  854. NodePath cp(sname, Vector<StringName>(), false);
  855. Dictionary d;
  856. d["@subpath"] = cp;
  857. d["@path"] = p->path;
  858. p = base.ptr();
  859. while (p) {
  860. for (Set<StringName>::Element *E = p->members.front(); E; E = E->next()) {
  861. Variant value;
  862. if (ins->get(E->get(), value)) {
  863. String k = E->get();
  864. if (!d.has(k)) {
  865. d[k] = value;
  866. }
  867. }
  868. }
  869. p = p->_base;
  870. }
  871. r_ret = d;
  872. }
  873. }
  874. } break;
  875. case DICT2INST: {
  876. VALIDATE_ARG_COUNT(1);
  877. if (p_args[0]->get_type() != Variant::DICTIONARY) {
  878. r_error.error = Variant::CallError::CALL_ERROR_INVALID_ARGUMENT;
  879. r_error.argument = 0;
  880. r_error.expected = Variant::DICTIONARY;
  881. r_ret = Variant();
  882. return;
  883. }
  884. Dictionary d = *p_args[0];
  885. if (!d.has("@path")) {
  886. r_error.error = Variant::CallError::CALL_ERROR_INVALID_ARGUMENT;
  887. r_error.argument = 0;
  888. r_error.expected = Variant::OBJECT;
  889. r_ret = RTR("Invalid instance dictionary format (missing @path)");
  890. return;
  891. }
  892. Ref<Script> scr = ResourceLoader::load(d["@path"]);
  893. if (!scr.is_valid()) {
  894. r_error.error = Variant::CallError::CALL_ERROR_INVALID_ARGUMENT;
  895. r_error.argument = 0;
  896. r_error.expected = Variant::OBJECT;
  897. r_ret = RTR("Invalid instance dictionary format (can't load script at @path)");
  898. return;
  899. }
  900. Ref<GDScript> gdscr = scr;
  901. if (!gdscr.is_valid()) {
  902. r_error.error = Variant::CallError::CALL_ERROR_INVALID_ARGUMENT;
  903. r_error.argument = 0;
  904. r_error.expected = Variant::OBJECT;
  905. r_ret = Variant();
  906. r_ret = RTR("Invalid instance dictionary format (invalid script at @path)");
  907. return;
  908. }
  909. NodePath sub;
  910. if (d.has("@subpath")) {
  911. sub = d["@subpath"];
  912. }
  913. for (int i = 0; i < sub.get_name_count(); i++) {
  914. gdscr = gdscr->subclasses[sub.get_name(i)];
  915. if (!gdscr.is_valid()) {
  916. r_error.error = Variant::CallError::CALL_ERROR_INVALID_ARGUMENT;
  917. r_error.argument = 0;
  918. r_error.expected = Variant::OBJECT;
  919. r_ret = Variant();
  920. r_ret = RTR("Invalid instance dictionary (invalid subclasses)");
  921. return;
  922. }
  923. }
  924. r_ret = gdscr->_new(NULL, 0, r_error);
  925. GDScriptInstance *ins = static_cast<GDScriptInstance *>(static_cast<Object *>(r_ret)->get_script_instance());
  926. Ref<GDScript> gd_ref = ins->get_script();
  927. for (Map<StringName, GDScript::MemberInfo>::Element *E = gd_ref->member_indices.front(); E; E = E->next()) {
  928. if (d.has(E->key())) {
  929. ins->members[E->get().index] = d[E->key()];
  930. }
  931. }
  932. } break;
  933. case VALIDATE_JSON: {
  934. VALIDATE_ARG_COUNT(1);
  935. if (p_args[0]->get_type() != Variant::STRING) {
  936. r_error.error = Variant::CallError::CALL_ERROR_INVALID_ARGUMENT;
  937. r_error.argument = 0;
  938. r_error.expected = Variant::STRING;
  939. r_ret = Variant();
  940. return;
  941. }
  942. String errs;
  943. int errl;
  944. Error err = JSON::parse(*p_args[0], r_ret, errs, errl);
  945. if (err != OK) {
  946. r_ret = itos(errl) + ":" + errs;
  947. } else {
  948. r_ret = "";
  949. }
  950. } break;
  951. case PARSE_JSON: {
  952. VALIDATE_ARG_COUNT(1);
  953. if (p_args[0]->get_type() != Variant::STRING) {
  954. r_error.error = Variant::CallError::CALL_ERROR_INVALID_ARGUMENT;
  955. r_error.argument = 0;
  956. r_error.expected = Variant::STRING;
  957. r_ret = Variant();
  958. return;
  959. }
  960. String errs;
  961. int errl;
  962. Error err = JSON::parse(*p_args[0], r_ret, errs, errl);
  963. if (err != OK) {
  964. r_ret = Variant();
  965. }
  966. } break;
  967. case TO_JSON: {
  968. VALIDATE_ARG_COUNT(1);
  969. r_ret = JSON::print(*p_args[0]);
  970. } break;
  971. case HASH: {
  972. VALIDATE_ARG_COUNT(1);
  973. r_ret = p_args[0]->hash();
  974. } break;
  975. case COLOR8: {
  976. if (p_arg_count < 3) {
  977. r_error.error = Variant::CallError::CALL_ERROR_TOO_FEW_ARGUMENTS;
  978. r_error.argument = 3;
  979. r_ret = Variant();
  980. return;
  981. }
  982. if (p_arg_count > 4) {
  983. r_error.error = Variant::CallError::CALL_ERROR_TOO_MANY_ARGUMENTS;
  984. r_error.argument = 4;
  985. r_ret = Variant();
  986. return;
  987. }
  988. VALIDATE_ARG_NUM(0);
  989. VALIDATE_ARG_NUM(1);
  990. VALIDATE_ARG_NUM(2);
  991. Color color((float)*p_args[0] / 255.0f, (float)*p_args[1] / 255.0f, (float)*p_args[2] / 255.0f);
  992. if (p_arg_count == 4) {
  993. VALIDATE_ARG_NUM(3);
  994. color.a = (float)*p_args[3] / 255.0f;
  995. }
  996. r_ret = color;
  997. } break;
  998. case COLORN: {
  999. if (p_arg_count < 1) {
  1000. r_error.error = Variant::CallError::CALL_ERROR_TOO_FEW_ARGUMENTS;
  1001. r_error.argument = 1;
  1002. r_ret = Variant();
  1003. return;
  1004. }
  1005. if (p_arg_count > 2) {
  1006. r_error.error = Variant::CallError::CALL_ERROR_TOO_MANY_ARGUMENTS;
  1007. r_error.argument = 2;
  1008. r_ret = Variant();
  1009. return;
  1010. }
  1011. if (p_args[0]->get_type() != Variant::STRING) {
  1012. r_error.error = Variant::CallError::CALL_ERROR_INVALID_ARGUMENT;
  1013. r_error.argument = 0;
  1014. r_ret = Variant();
  1015. } else {
  1016. Color color = Color::named(*p_args[0]);
  1017. if (p_arg_count == 2) {
  1018. VALIDATE_ARG_NUM(1);
  1019. color.a = *p_args[1];
  1020. }
  1021. r_ret = color;
  1022. }
  1023. } break;
  1024. case PRINT_STACK: {
  1025. VALIDATE_ARG_COUNT(0);
  1026. ScriptLanguage *script = GDScriptLanguage::get_singleton();
  1027. for (int i = 0; i < script->debug_get_stack_level_count(); i++) {
  1028. print_line("Frame " + itos(i) + " - " + script->debug_get_stack_level_source(i) + ":" + itos(script->debug_get_stack_level_line(i)) + " in function '" + script->debug_get_stack_level_function(i) + "'");
  1029. };
  1030. } break;
  1031. case INSTANCE_FROM_ID: {
  1032. VALIDATE_ARG_COUNT(1);
  1033. if (p_args[0]->get_type() != Variant::INT && p_args[0]->get_type() != Variant::REAL) {
  1034. r_error.error = Variant::CallError::CALL_ERROR_INVALID_ARGUMENT;
  1035. r_error.argument = 0;
  1036. r_error.expected = Variant::INT;
  1037. r_ret = Variant();
  1038. break;
  1039. }
  1040. uint32_t id = *p_args[0];
  1041. r_ret = ObjectDB::get_instance(id);
  1042. } break;
  1043. case LEN: {
  1044. VALIDATE_ARG_COUNT(1);
  1045. switch (p_args[0]->get_type()) {
  1046. case Variant::STRING: {
  1047. String d = *p_args[0];
  1048. r_ret = d.length();
  1049. } break;
  1050. case Variant::DICTIONARY: {
  1051. Dictionary d = *p_args[0];
  1052. r_ret = d.size();
  1053. } break;
  1054. case Variant::ARRAY: {
  1055. Array d = *p_args[0];
  1056. r_ret = d.size();
  1057. } break;
  1058. case Variant::POOL_BYTE_ARRAY: {
  1059. PoolVector<uint8_t> d = *p_args[0];
  1060. r_ret = d.size();
  1061. } break;
  1062. case Variant::POOL_INT_ARRAY: {
  1063. PoolVector<int> d = *p_args[0];
  1064. r_ret = d.size();
  1065. } break;
  1066. case Variant::POOL_REAL_ARRAY: {
  1067. PoolVector<real_t> d = *p_args[0];
  1068. r_ret = d.size();
  1069. } break;
  1070. case Variant::POOL_STRING_ARRAY: {
  1071. PoolVector<String> d = *p_args[0];
  1072. r_ret = d.size();
  1073. } break;
  1074. case Variant::POOL_VECTOR2_ARRAY: {
  1075. PoolVector<Vector2> d = *p_args[0];
  1076. r_ret = d.size();
  1077. } break;
  1078. case Variant::POOL_VECTOR3_ARRAY: {
  1079. PoolVector<Vector3> d = *p_args[0];
  1080. r_ret = d.size();
  1081. } break;
  1082. case Variant::POOL_COLOR_ARRAY: {
  1083. PoolVector<Color> d = *p_args[0];
  1084. r_ret = d.size();
  1085. } break;
  1086. default: {
  1087. r_error.error = Variant::CallError::CALL_ERROR_INVALID_ARGUMENT;
  1088. r_error.argument = 0;
  1089. r_error.expected = Variant::OBJECT;
  1090. r_ret = Variant();
  1091. r_ret = RTR("Object can't provide a length.");
  1092. }
  1093. }
  1094. } break;
  1095. case IS_INSTANCE_VALID: {
  1096. VALIDATE_ARG_COUNT(1);
  1097. if (p_args[0]->get_type() != Variant::OBJECT) {
  1098. r_ret = false;
  1099. } else {
  1100. Object *obj = *p_args[0];
  1101. r_ret = ObjectDB::instance_validate(obj);
  1102. }
  1103. } break;
  1104. case FUNC_MAX: {
  1105. ERR_FAIL();
  1106. } break;
  1107. }
  1108. }
  1109. bool GDScriptFunctions::is_deterministic(Function p_func) {
  1110. //man i couldn't have chosen a worse function name,
  1111. //way too controversial..
  1112. switch (p_func) {
  1113. case MATH_SIN:
  1114. case MATH_COS:
  1115. case MATH_TAN:
  1116. case MATH_SINH:
  1117. case MATH_COSH:
  1118. case MATH_TANH:
  1119. case MATH_ASIN:
  1120. case MATH_ACOS:
  1121. case MATH_ATAN:
  1122. case MATH_ATAN2:
  1123. case MATH_SQRT:
  1124. case MATH_FMOD:
  1125. case MATH_FPOSMOD:
  1126. case MATH_FLOOR:
  1127. case MATH_CEIL:
  1128. case MATH_ROUND:
  1129. case MATH_ABS:
  1130. case MATH_SIGN:
  1131. case MATH_POW:
  1132. case MATH_LOG:
  1133. case MATH_EXP:
  1134. case MATH_ISNAN:
  1135. case MATH_ISINF:
  1136. case MATH_EASE:
  1137. case MATH_DECIMALS:
  1138. case MATH_STEPIFY:
  1139. case MATH_LERP:
  1140. case MATH_INVERSE_LERP:
  1141. case MATH_RANGE_LERP:
  1142. case MATH_DECTIME:
  1143. case MATH_DEG2RAD:
  1144. case MATH_RAD2DEG:
  1145. case MATH_LINEAR2DB:
  1146. case MATH_DB2LINEAR:
  1147. case MATH_POLAR2CARTESIAN:
  1148. case MATH_CARTESIAN2POLAR:
  1149. case MATH_WRAP:
  1150. case MATH_WRAPF:
  1151. case LOGIC_MAX:
  1152. case LOGIC_MIN:
  1153. case LOGIC_CLAMP:
  1154. case LOGIC_NEAREST_PO2:
  1155. case TYPE_CONVERT:
  1156. case TYPE_OF:
  1157. case TYPE_EXISTS:
  1158. case TEXT_CHAR:
  1159. case TEXT_STR:
  1160. case COLOR8:
  1161. case LEN:
  1162. // enable for debug only, otherwise not desirable - case GEN_RANGE:
  1163. return true;
  1164. default:
  1165. return false;
  1166. }
  1167. return false;
  1168. }
  1169. MethodInfo GDScriptFunctions::get_info(Function p_func) {
  1170. #ifdef TOOLS_ENABLED
  1171. //using a switch, so the compiler generates a jumptable
  1172. switch (p_func) {
  1173. case MATH_SIN: {
  1174. MethodInfo mi("sin", PropertyInfo(Variant::REAL, "s"));
  1175. mi.return_val.type = Variant::REAL;
  1176. return mi;
  1177. } break;
  1178. case MATH_COS: {
  1179. MethodInfo mi("cos", PropertyInfo(Variant::REAL, "s"));
  1180. mi.return_val.type = Variant::REAL;
  1181. return mi;
  1182. } break;
  1183. case MATH_TAN: {
  1184. MethodInfo mi("tan", PropertyInfo(Variant::REAL, "s"));
  1185. mi.return_val.type = Variant::REAL;
  1186. return mi;
  1187. } break;
  1188. case MATH_SINH: {
  1189. MethodInfo mi("sinh", PropertyInfo(Variant::REAL, "s"));
  1190. mi.return_val.type = Variant::REAL;
  1191. return mi;
  1192. } break;
  1193. case MATH_COSH: {
  1194. MethodInfo mi("cosh", PropertyInfo(Variant::REAL, "s"));
  1195. mi.return_val.type = Variant::REAL;
  1196. return mi;
  1197. } break;
  1198. case MATH_TANH: {
  1199. MethodInfo mi("tanh", PropertyInfo(Variant::REAL, "s"));
  1200. mi.return_val.type = Variant::REAL;
  1201. return mi;
  1202. } break;
  1203. case MATH_ASIN: {
  1204. MethodInfo mi("asin", PropertyInfo(Variant::REAL, "s"));
  1205. mi.return_val.type = Variant::REAL;
  1206. return mi;
  1207. } break;
  1208. case MATH_ACOS: {
  1209. MethodInfo mi("acos", PropertyInfo(Variant::REAL, "s"));
  1210. mi.return_val.type = Variant::REAL;
  1211. return mi;
  1212. } break;
  1213. case MATH_ATAN: {
  1214. MethodInfo mi("atan", PropertyInfo(Variant::REAL, "s"));
  1215. mi.return_val.type = Variant::REAL;
  1216. return mi;
  1217. } break;
  1218. case MATH_ATAN2: {
  1219. MethodInfo mi("atan2", PropertyInfo(Variant::REAL, "x"), PropertyInfo(Variant::REAL, "y"));
  1220. mi.return_val.type = Variant::REAL;
  1221. return mi;
  1222. } break;
  1223. case MATH_SQRT: {
  1224. MethodInfo mi("sqrt", PropertyInfo(Variant::REAL, "s"));
  1225. mi.return_val.type = Variant::REAL;
  1226. return mi;
  1227. } break;
  1228. case MATH_FMOD: {
  1229. MethodInfo mi("fmod", PropertyInfo(Variant::REAL, "x"), PropertyInfo(Variant::REAL, "y"));
  1230. mi.return_val.type = Variant::REAL;
  1231. return mi;
  1232. } break;
  1233. case MATH_FPOSMOD: {
  1234. MethodInfo mi("fposmod", PropertyInfo(Variant::REAL, "x"), PropertyInfo(Variant::REAL, "y"));
  1235. mi.return_val.type = Variant::REAL;
  1236. return mi;
  1237. } break;
  1238. case MATH_FLOOR: {
  1239. MethodInfo mi("floor", PropertyInfo(Variant::REAL, "s"));
  1240. mi.return_val.type = Variant::REAL;
  1241. return mi;
  1242. } break;
  1243. case MATH_CEIL: {
  1244. MethodInfo mi("ceil", PropertyInfo(Variant::REAL, "s"));
  1245. mi.return_val.type = Variant::REAL;
  1246. return mi;
  1247. } break;
  1248. case MATH_ROUND: {
  1249. MethodInfo mi("round", PropertyInfo(Variant::REAL, "s"));
  1250. mi.return_val.type = Variant::REAL;
  1251. return mi;
  1252. } break;
  1253. case MATH_ABS: {
  1254. MethodInfo mi("abs", PropertyInfo(Variant::REAL, "s"));
  1255. mi.return_val.type = Variant::REAL;
  1256. return mi;
  1257. } break;
  1258. case MATH_SIGN: {
  1259. MethodInfo mi("sign", PropertyInfo(Variant::REAL, "s"));
  1260. mi.return_val.type = Variant::REAL;
  1261. return mi;
  1262. } break;
  1263. case MATH_POW: {
  1264. MethodInfo mi("pow", PropertyInfo(Variant::REAL, "x"), PropertyInfo(Variant::REAL, "y"));
  1265. mi.return_val.type = Variant::REAL;
  1266. return mi;
  1267. } break;
  1268. case MATH_LOG: {
  1269. MethodInfo mi("log", PropertyInfo(Variant::REAL, "s"));
  1270. mi.return_val.type = Variant::REAL;
  1271. return mi;
  1272. } break;
  1273. case MATH_EXP: {
  1274. MethodInfo mi("exp", PropertyInfo(Variant::REAL, "s"));
  1275. mi.return_val.type = Variant::REAL;
  1276. return mi;
  1277. } break;
  1278. case MATH_ISNAN: {
  1279. MethodInfo mi("is_nan", PropertyInfo(Variant::REAL, "s"));
  1280. mi.return_val.type = Variant::BOOL;
  1281. return mi;
  1282. } break;
  1283. case MATH_ISINF: {
  1284. MethodInfo mi("is_inf", PropertyInfo(Variant::REAL, "s"));
  1285. mi.return_val.type = Variant::BOOL;
  1286. return mi;
  1287. } break;
  1288. case MATH_EASE: {
  1289. MethodInfo mi("ease", PropertyInfo(Variant::REAL, "s"), PropertyInfo(Variant::REAL, "curve"));
  1290. mi.return_val.type = Variant::REAL;
  1291. return mi;
  1292. } break;
  1293. case MATH_DECIMALS: {
  1294. MethodInfo mi("decimals", PropertyInfo(Variant::REAL, "step"));
  1295. mi.return_val.type = Variant::REAL;
  1296. return mi;
  1297. } break;
  1298. case MATH_STEPIFY: {
  1299. MethodInfo mi("stepify", PropertyInfo(Variant::REAL, "s"), PropertyInfo(Variant::REAL, "step"));
  1300. mi.return_val.type = Variant::REAL;
  1301. return mi;
  1302. } break;
  1303. case MATH_LERP: {
  1304. MethodInfo mi("lerp", PropertyInfo(Variant::NIL, "from"), PropertyInfo(Variant::NIL, "to"), PropertyInfo(Variant::REAL, "weight"));
  1305. mi.return_val.type = Variant::REAL;
  1306. return mi;
  1307. } break;
  1308. case MATH_INVERSE_LERP: {
  1309. MethodInfo mi("inverse_lerp", PropertyInfo(Variant::REAL, "from"), PropertyInfo(Variant::REAL, "to"), PropertyInfo(Variant::REAL, "weight"));
  1310. mi.return_val.type = Variant::REAL;
  1311. return mi;
  1312. } break;
  1313. case MATH_RANGE_LERP: {
  1314. MethodInfo mi("range_lerp", PropertyInfo(Variant::REAL, "value"), PropertyInfo(Variant::REAL, "istart"), PropertyInfo(Variant::REAL, "istop"), PropertyInfo(Variant::REAL, "ostart"), PropertyInfo(Variant::REAL, "ostop"));
  1315. mi.return_val.type = Variant::REAL;
  1316. return mi;
  1317. } break;
  1318. case MATH_DECTIME: {
  1319. MethodInfo mi("dectime", PropertyInfo(Variant::REAL, "value"), PropertyInfo(Variant::REAL, "amount"), PropertyInfo(Variant::REAL, "step"));
  1320. mi.return_val.type = Variant::REAL;
  1321. return mi;
  1322. } break;
  1323. case MATH_RANDOMIZE: {
  1324. MethodInfo mi("randomize");
  1325. mi.return_val.type = Variant::NIL;
  1326. return mi;
  1327. } break;
  1328. case MATH_RAND: {
  1329. MethodInfo mi("randi");
  1330. mi.return_val.type = Variant::INT;
  1331. return mi;
  1332. } break;
  1333. case MATH_RANDF: {
  1334. MethodInfo mi("randf");
  1335. mi.return_val.type = Variant::REAL;
  1336. return mi;
  1337. } break;
  1338. case MATH_RANDOM: {
  1339. MethodInfo mi("rand_range", PropertyInfo(Variant::REAL, "from"), PropertyInfo(Variant::REAL, "to"));
  1340. mi.return_val.type = Variant::REAL;
  1341. return mi;
  1342. } break;
  1343. case MATH_SEED: {
  1344. MethodInfo mi("seed", PropertyInfo(Variant::INT, "seed"));
  1345. mi.return_val.type = Variant::NIL;
  1346. return mi;
  1347. } break;
  1348. case MATH_RANDSEED: {
  1349. MethodInfo mi("rand_seed", PropertyInfo(Variant::INT, "seed"));
  1350. mi.return_val.type = Variant::ARRAY;
  1351. return mi;
  1352. } break;
  1353. case MATH_DEG2RAD: {
  1354. MethodInfo mi("deg2rad", PropertyInfo(Variant::REAL, "deg"));
  1355. mi.return_val.type = Variant::REAL;
  1356. return mi;
  1357. } break;
  1358. case MATH_RAD2DEG: {
  1359. MethodInfo mi("rad2deg", PropertyInfo(Variant::REAL, "rad"));
  1360. mi.return_val.type = Variant::REAL;
  1361. return mi;
  1362. } break;
  1363. case MATH_LINEAR2DB: {
  1364. MethodInfo mi("linear2db", PropertyInfo(Variant::REAL, "nrg"));
  1365. mi.return_val.type = Variant::REAL;
  1366. return mi;
  1367. } break;
  1368. case MATH_DB2LINEAR: {
  1369. MethodInfo mi("db2linear", PropertyInfo(Variant::REAL, "db"));
  1370. mi.return_val.type = Variant::REAL;
  1371. return mi;
  1372. } break;
  1373. case MATH_POLAR2CARTESIAN: {
  1374. MethodInfo mi("polar2cartesian", PropertyInfo(Variant::REAL, "r"), PropertyInfo(Variant::REAL, "th"));
  1375. mi.return_val.type = Variant::VECTOR2;
  1376. return mi;
  1377. } break;
  1378. case MATH_CARTESIAN2POLAR: {
  1379. MethodInfo mi("cartesian2polar", PropertyInfo(Variant::REAL, "x"), PropertyInfo(Variant::REAL, "y"));
  1380. mi.return_val.type = Variant::VECTOR2;
  1381. return mi;
  1382. } break;
  1383. case MATH_WRAP: {
  1384. MethodInfo mi("wrapi", PropertyInfo(Variant::INT, "value"), PropertyInfo(Variant::INT, "min"), PropertyInfo(Variant::INT, "max"));
  1385. mi.return_val.type = Variant::INT;
  1386. return mi;
  1387. } break;
  1388. case MATH_WRAPF: {
  1389. MethodInfo mi("wrapf", PropertyInfo(Variant::REAL, "value"), PropertyInfo(Variant::REAL, "min"), PropertyInfo(Variant::REAL, "max"));
  1390. mi.return_val.type = Variant::REAL;
  1391. return mi;
  1392. } break;
  1393. case LOGIC_MAX: {
  1394. MethodInfo mi("max", PropertyInfo(Variant::REAL, "a"), PropertyInfo(Variant::REAL, "b"));
  1395. mi.return_val.type = Variant::REAL;
  1396. return mi;
  1397. } break;
  1398. case LOGIC_MIN: {
  1399. MethodInfo mi("min", PropertyInfo(Variant::REAL, "a"), PropertyInfo(Variant::REAL, "b"));
  1400. mi.return_val.type = Variant::REAL;
  1401. return mi;
  1402. } break;
  1403. case LOGIC_CLAMP: {
  1404. MethodInfo mi("clamp", PropertyInfo(Variant::REAL, "value"), PropertyInfo(Variant::REAL, "min"), PropertyInfo(Variant::REAL, "max"));
  1405. mi.return_val.type = Variant::REAL;
  1406. return mi;
  1407. } break;
  1408. case LOGIC_NEAREST_PO2: {
  1409. MethodInfo mi("nearest_po2", PropertyInfo(Variant::INT, "value"));
  1410. mi.return_val.type = Variant::INT;
  1411. return mi;
  1412. } break;
  1413. case OBJ_WEAKREF: {
  1414. MethodInfo mi("weakref", PropertyInfo(Variant::OBJECT, "obj"));
  1415. mi.return_val.type = Variant::OBJECT;
  1416. mi.return_val.name = "WeakRef";
  1417. return mi;
  1418. } break;
  1419. case FUNC_FUNCREF: {
  1420. MethodInfo mi("funcref", PropertyInfo(Variant::OBJECT, "instance"), PropertyInfo(Variant::STRING, "funcname"));
  1421. mi.return_val.type = Variant::OBJECT;
  1422. mi.return_val.name = "FuncRef";
  1423. return mi;
  1424. } break;
  1425. case TYPE_CONVERT: {
  1426. MethodInfo mi("convert", PropertyInfo(Variant::NIL, "what"), PropertyInfo(Variant::INT, "type"));
  1427. mi.return_val.type = Variant::OBJECT;
  1428. return mi;
  1429. } break;
  1430. case TYPE_OF: {
  1431. MethodInfo mi("typeof", PropertyInfo(Variant::NIL, "what"));
  1432. mi.return_val.type = Variant::INT;
  1433. return mi;
  1434. } break;
  1435. case TYPE_EXISTS: {
  1436. MethodInfo mi("type_exists", PropertyInfo(Variant::STRING, "type"));
  1437. mi.return_val.type = Variant::BOOL;
  1438. return mi;
  1439. } break;
  1440. case TEXT_CHAR: {
  1441. MethodInfo mi("char", PropertyInfo(Variant::INT, "ascii"));
  1442. mi.return_val.type = Variant::STRING;
  1443. return mi;
  1444. } break;
  1445. case TEXT_STR: {
  1446. MethodInfo mi("str");
  1447. mi.return_val.type = Variant::STRING;
  1448. mi.flags |= METHOD_FLAG_VARARG;
  1449. return mi;
  1450. } break;
  1451. case TEXT_PRINT: {
  1452. MethodInfo mi("print");
  1453. mi.return_val.type = Variant::NIL;
  1454. mi.flags |= METHOD_FLAG_VARARG;
  1455. return mi;
  1456. } break;
  1457. case TEXT_PRINT_TABBED: {
  1458. MethodInfo mi("printt");
  1459. mi.return_val.type = Variant::NIL;
  1460. mi.flags |= METHOD_FLAG_VARARG;
  1461. return mi;
  1462. } break;
  1463. case TEXT_PRINT_SPACED: {
  1464. MethodInfo mi("prints");
  1465. mi.return_val.type = Variant::NIL;
  1466. mi.flags |= METHOD_FLAG_VARARG;
  1467. return mi;
  1468. } break;
  1469. case TEXT_PRINTERR: {
  1470. MethodInfo mi("printerr");
  1471. mi.return_val.type = Variant::NIL;
  1472. mi.flags |= METHOD_FLAG_VARARG;
  1473. return mi;
  1474. } break;
  1475. case TEXT_PRINTRAW: {
  1476. MethodInfo mi("printraw");
  1477. mi.return_val.type = Variant::NIL;
  1478. mi.flags |= METHOD_FLAG_VARARG;
  1479. return mi;
  1480. } break;
  1481. case VAR_TO_STR: {
  1482. MethodInfo mi("var2str", PropertyInfo(Variant::NIL, "var"));
  1483. mi.return_val.type = Variant::STRING;
  1484. return mi;
  1485. } break;
  1486. case STR_TO_VAR: {
  1487. MethodInfo mi(Variant::NIL, "str2var", PropertyInfo(Variant::STRING, "string"));
  1488. mi.return_val.type = Variant::NIL;
  1489. mi.return_val.usage |= PROPERTY_USAGE_NIL_IS_VARIANT;
  1490. return mi;
  1491. } break;
  1492. case VAR_TO_BYTES: {
  1493. MethodInfo mi("var2bytes", PropertyInfo(Variant::NIL, "var"));
  1494. mi.return_val.type = Variant::POOL_BYTE_ARRAY;
  1495. return mi;
  1496. } break;
  1497. case BYTES_TO_VAR: {
  1498. MethodInfo mi(Variant::NIL, "bytes2var", PropertyInfo(Variant::POOL_BYTE_ARRAY, "bytes"));
  1499. mi.return_val.type = Variant::NIL;
  1500. mi.return_val.usage |= PROPERTY_USAGE_NIL_IS_VARIANT;
  1501. return mi;
  1502. } break;
  1503. case GEN_RANGE: {
  1504. MethodInfo mi("range");
  1505. mi.return_val.type = Variant::ARRAY;
  1506. mi.flags |= METHOD_FLAG_VARARG;
  1507. return mi;
  1508. } break;
  1509. case RESOURCE_LOAD: {
  1510. MethodInfo mi("load", PropertyInfo(Variant::STRING, "path"));
  1511. mi.return_val.type = Variant::OBJECT;
  1512. mi.return_val.name = "Resource";
  1513. return mi;
  1514. } break;
  1515. case INST2DICT: {
  1516. MethodInfo mi("inst2dict", PropertyInfo(Variant::OBJECT, "inst"));
  1517. mi.return_val.type = Variant::DICTIONARY;
  1518. return mi;
  1519. } break;
  1520. case DICT2INST: {
  1521. MethodInfo mi("dict2inst", PropertyInfo(Variant::DICTIONARY, "dict"));
  1522. mi.return_val.type = Variant::OBJECT;
  1523. return mi;
  1524. } break;
  1525. case VALIDATE_JSON: {
  1526. MethodInfo mi("validate_json", PropertyInfo(Variant::STRING, "json"));
  1527. mi.return_val.type = Variant::STRING;
  1528. return mi;
  1529. } break;
  1530. case PARSE_JSON: {
  1531. MethodInfo mi(Variant::NIL, "parse_json", PropertyInfo(Variant::STRING, "json"));
  1532. mi.return_val.type = Variant::NIL;
  1533. mi.return_val.usage |= PROPERTY_USAGE_NIL_IS_VARIANT;
  1534. return mi;
  1535. } break;
  1536. case TO_JSON: {
  1537. MethodInfo mi("to_json", PropertyInfo(Variant::NIL, "var"));
  1538. mi.return_val.type = Variant::STRING;
  1539. return mi;
  1540. } break;
  1541. case HASH: {
  1542. MethodInfo mi("hash", PropertyInfo(Variant::NIL, "var"));
  1543. mi.return_val.type = Variant::INT;
  1544. return mi;
  1545. } break;
  1546. case COLOR8: {
  1547. MethodInfo mi("Color8", PropertyInfo(Variant::INT, "r8"), PropertyInfo(Variant::INT, "g8"), PropertyInfo(Variant::INT, "b8"), PropertyInfo(Variant::INT, "a8"));
  1548. mi.default_arguments.push_back(255);
  1549. mi.return_val.type = Variant::COLOR;
  1550. return mi;
  1551. } break;
  1552. case COLORN: {
  1553. MethodInfo mi("ColorN", PropertyInfo(Variant::STRING, "name"), PropertyInfo(Variant::REAL, "alpha"));
  1554. mi.default_arguments.push_back(1.0f);
  1555. mi.return_val.type = Variant::COLOR;
  1556. return mi;
  1557. } break;
  1558. case PRINT_STACK: {
  1559. MethodInfo mi("print_stack");
  1560. mi.return_val.type = Variant::NIL;
  1561. return mi;
  1562. } break;
  1563. case INSTANCE_FROM_ID: {
  1564. MethodInfo mi("instance_from_id", PropertyInfo(Variant::INT, "instance_id"));
  1565. mi.return_val.type = Variant::OBJECT;
  1566. return mi;
  1567. } break;
  1568. case LEN: {
  1569. MethodInfo mi("len", PropertyInfo(Variant::NIL, "var"));
  1570. mi.return_val.type = Variant::INT;
  1571. return mi;
  1572. } break;
  1573. case IS_INSTANCE_VALID: {
  1574. MethodInfo mi("is_instance_valid", PropertyInfo(Variant::OBJECT, "instance"));
  1575. mi.return_val.type = Variant::BOOL;
  1576. return mi;
  1577. } break;
  1578. case FUNC_MAX: {
  1579. ERR_FAIL_V(MethodInfo());
  1580. } break;
  1581. }
  1582. #endif
  1583. return MethodInfo();
  1584. }