gdscript_functions.cpp 53 KB

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