gdscript_functions.cpp 54 KB

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