2
0

gdscript_functions.cpp 51 KB

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