gdscript_functions.cpp 52 KB

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