gd_functions.cpp 36 KB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130131132133134135136137138139140141142143144145146147148149150151152153154155156157158159160161162163164165166167168169170171172173174175176177178179180181182183184185186187188189190191192193194195196197198199200201202203204205206207208209210211212213214215216217218219220221222223224225226227228229230231232233234235236237238239240241242243244245246247248249250251252253254255256257258259260261262263264265266267268269270271272273274275276277278279280281282283284285286287288289290291292293294295296297298299300301302303304305306307308309310311312313314315316317318319320321322323324325326327328329330331332333334335336337338339340341342343344345346347348349350351352353354355356357358359360361362363364365366367368369370371372373374375376377378379380381382383384385386387388389390391392393394395396397398399400401402403404405406407408409410411412413414415416417418419420421422423424425426427428429430431432433434435436437438439440441442443444445446447448449450451452453454455456457458459460461462463464465466467468469470471472473474475476477478479480481482483484485486487488489490491492493494495496497498499500501502503504505506507508509510511512513514515516517518519520521522523524525526527528529530531532533534535536537538539540541542543544545546547548549550551552553554555556557558559560561562563564565566567568569570571572573574575576577578579580581582583584585586587588589590591592593594595596597598599600601602603604605606607608609610611612613614615616617618619620621622623624625626627628629630631632633634635636637638639640641642643644645646647648649650651652653654655656657658659660661662663664665666667668669670671672673674675676677678679680681682683684685686687688689690691692693694695696697698699700701702703704705706707708709710711712713714715716717718719720721722723724725726727728729730731732733734735736737738739740741742743744745746747748749750751752753754755756757758759760761762763764765766767768769770771772773774775776777778779780781782783784785786787788789790791792793794795796797798799800801802803804805806807808809810811812813814815816817818819820821822823824825826827828829830831832833834835836837838839840841842843844845846847848849850851852853854855856857858859860861862863864865866867868869870871872873874875876877878879880881882883884885886887888889890891892893894895896897898899900901902903904905906907908909910911912913914915916917918919920921922923924925926927928929930931932933934935936937938939940941942943944945946947948949950951952953954955956957958959960961962963964965966967968969970971972973974975976977978979980981982983984985986987988989990991992993994995996997998999100010011002100310041005100610071008100910101011101210131014101510161017101810191020102110221023102410251026102710281029103010311032103310341035103610371038103910401041104210431044104510461047104810491050105110521053105410551056105710581059106010611062106310641065106610671068106910701071107210731074107510761077107810791080108110821083108410851086108710881089109010911092109310941095109610971098109911001101110211031104110511061107110811091110111111121113111411151116111711181119112011211122112311241125112611271128112911301131113211331134113511361137113811391140114111421143114411451146114711481149115011511152115311541155115611571158115911601161116211631164116511661167116811691170117111721173117411751176117711781179118011811182118311841185118611871188118911901191119211931194119511961197119811991200120112021203120412051206120712081209121012111212121312141215121612171218121912201221122212231224122512261227122812291230123112321233123412351236123712381239124012411242124312441245124612471248124912501251125212531254125512561257125812591260126112621263126412651266126712681269127012711272127312741275127612771278127912801281128212831284128512861287128812891290129112921293129412951296129712981299130013011302130313041305130613071308130913101311131213131314131513161317131813191320132113221323132413251326132713281329133013311332133313341335133613371338133913401341134213431344134513461347134813491350135113521353135413551356135713581359136013611362136313641365136613671368136913701371137213731374137513761377137813791380138113821383138413851386138713881389139013911392139313941395139613971398139914001401140214031404140514061407140814091410141114121413141414151416141714181419142014211422142314241425142614271428142914301431143214331434143514361437143814391440144114421443144414451446144714481449145014511452145314541455145614571458145914601461146214631464146514661467146814691470147114721473147414751476147714781479148014811482148314841485148614871488148914901491149214931494149514961497149814991500150115021503150415051506150715081509151015111512151315141515151615171518151915201521152215231524152515261527152815291530153115321533153415351536153715381539154015411542154315441545154615471548154915501551155215531554155515561557155815591560156115621563156415651566156715681569
  1. /*************************************************************************/
  2. /* gd_functions.cpp */
  3. /*************************************************************************/
  4. /* This file is part of: */
  5. /* GODOT ENGINE */
  6. /* http://www.godotengine.org */
  7. /*************************************************************************/
  8. /* Copyright (c) 2007-2016 Juan Linietsky, Ariel Manzur. */
  9. /* */
  10. /* Permission is hereby granted, free of charge, to any person obtaining */
  11. /* a copy of this software and associated documentation files (the */
  12. /* "Software"), to deal in the Software without restriction, including */
  13. /* without limitation the rights to use, copy, modify, merge, publish, */
  14. /* distribute, sublicense, and/or sell copies of the Software, and to */
  15. /* permit persons to whom the Software is furnished to do so, subject to */
  16. /* the following conditions: */
  17. /* */
  18. /* The above copyright notice and this permission notice shall be */
  19. /* included in all copies or substantial portions of the Software. */
  20. /* */
  21. /* THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, */
  22. /* EXPRESS OR IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF */
  23. /* MERCHANTABILITY, FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT.*/
  24. /* IN NO EVENT SHALL THE AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY */
  25. /* CLAIM, DAMAGES OR OTHER LIABILITY, WHETHER IN AN ACTION OF CONTRACT, */
  26. /* TORT OR OTHERWISE, ARISING FROM, OUT OF OR IN CONNECTION WITH THE */
  27. /* SOFTWARE OR THE USE OR OTHER DEALINGS IN THE SOFTWARE. */
  28. /*************************************************************************/
  29. #include "gd_functions.h"
  30. #include "math_funcs.h"
  31. #include "object_type_db.h"
  32. #include "reference.h"
  33. #include "gd_script.h"
  34. #include "func_ref.h"
  35. #include "os/os.h"
  36. #include "variant_parser.h"
  37. #include "io/marshalls.h"
  38. const char *GDFunctions::get_func_name(Function p_func) {
  39. ERR_FAIL_INDEX_V(p_func,FUNC_MAX,"");
  40. static const char *_names[FUNC_MAX]={
  41. "sin",
  42. "cos",
  43. "tan",
  44. "sinh",
  45. "cosh",
  46. "tanh",
  47. "asin",
  48. "acos",
  49. "atan",
  50. "atan2",
  51. "sqrt",
  52. "fmod",
  53. "fposmod",
  54. "floor",
  55. "ceil",
  56. "round",
  57. "abs",
  58. "sign",
  59. "pow",
  60. "log",
  61. "exp",
  62. "is_nan",
  63. "is_inf",
  64. "ease",
  65. "decimals",
  66. "stepify",
  67. "lerp",
  68. "dectime",
  69. "randomize",
  70. "randi",
  71. "randf",
  72. "rand_range",
  73. "seed",
  74. "rand_seed",
  75. "deg2rad",
  76. "rad2deg",
  77. "linear2db",
  78. "db2linear",
  79. "max",
  80. "min",
  81. "clamp",
  82. "nearest_po2",
  83. "weakref",
  84. "funcref",
  85. "convert",
  86. "typeof",
  87. "type_exists",
  88. "str",
  89. "print",
  90. "printt",
  91. "prints",
  92. "printerr",
  93. "printraw",
  94. "var2str",
  95. "str2var",
  96. "var2bytes",
  97. "bytes2var",
  98. "range",
  99. "load",
  100. "inst2dict",
  101. "dict2inst",
  102. "hash",
  103. "Color8",
  104. "ColorN",
  105. "print_stack",
  106. "instance_from_id",
  107. };
  108. return _names[p_func];
  109. }
  110. void GDFunctions::call(Function p_func,const Variant **p_args,int p_arg_count,Variant &r_ret,Variant::CallError &r_error) {
  111. r_error.error=Variant::CallError::CALL_OK;
  112. #ifdef DEBUG_ENABLED
  113. #define VALIDATE_ARG_COUNT(m_count) \
  114. if (p_arg_count<m_count) {\
  115. r_error.error=Variant::CallError::CALL_ERROR_TOO_FEW_ARGUMENTS;\
  116. r_error.argument=m_count;\
  117. r_ret=Variant();\
  118. return;\
  119. }\
  120. if (p_arg_count>m_count) {\
  121. r_error.error=Variant::CallError::CALL_ERROR_TOO_MANY_ARGUMENTS;\
  122. r_error.argument=m_count;\
  123. r_ret=Variant();\
  124. return;\
  125. }
  126. #define VALIDATE_ARG_NUM(m_arg) \
  127. if (!p_args[m_arg]->is_num()) {\
  128. r_error.error=Variant::CallError::CALL_ERROR_INVALID_ARGUMENT;\
  129. r_error.argument=m_arg;\
  130. r_error.expected=Variant::REAL;\
  131. r_ret=Variant();\
  132. return;\
  133. }
  134. #else
  135. #define VALIDATE_ARG_COUNT(m_count)
  136. #define VALIDATE_ARG_NUM(m_arg)
  137. #endif
  138. //using a switch, so the compiler generates a jumptable
  139. switch(p_func) {
  140. case MATH_SIN: {
  141. VALIDATE_ARG_COUNT(1);
  142. VALIDATE_ARG_NUM(0);
  143. r_ret=Math::sin(*p_args[0]);
  144. } break;
  145. case MATH_COS: {
  146. VALIDATE_ARG_COUNT(1);
  147. VALIDATE_ARG_NUM(0);
  148. r_ret=Math::cos(*p_args[0]);
  149. } break;
  150. case MATH_TAN: {
  151. VALIDATE_ARG_COUNT(1);
  152. VALIDATE_ARG_NUM(0);
  153. r_ret=Math::tan(*p_args[0]);
  154. } break;
  155. case MATH_SINH: {
  156. VALIDATE_ARG_COUNT(1);
  157. VALIDATE_ARG_NUM(0);
  158. r_ret=Math::sinh(*p_args[0]);
  159. } break;
  160. case MATH_COSH: {
  161. VALIDATE_ARG_COUNT(1);
  162. VALIDATE_ARG_NUM(0);
  163. r_ret=Math::cosh(*p_args[0]);
  164. } break;
  165. case MATH_TANH: {
  166. VALIDATE_ARG_COUNT(1);
  167. VALIDATE_ARG_NUM(0);
  168. r_ret=Math::tanh(*p_args[0]);
  169. } break;
  170. case MATH_ASIN: {
  171. VALIDATE_ARG_COUNT(1);
  172. VALIDATE_ARG_NUM(0);
  173. r_ret=Math::asin(*p_args[0]);
  174. } break;
  175. case MATH_ACOS: {
  176. VALIDATE_ARG_COUNT(1);
  177. VALIDATE_ARG_NUM(0);
  178. r_ret=Math::acos(*p_args[0]);
  179. } break;
  180. case MATH_ATAN: {
  181. VALIDATE_ARG_COUNT(1);
  182. VALIDATE_ARG_NUM(0);
  183. r_ret=Math::atan(*p_args[0]);
  184. } break;
  185. case MATH_ATAN2: {
  186. VALIDATE_ARG_COUNT(2);
  187. VALIDATE_ARG_NUM(0);
  188. VALIDATE_ARG_NUM(1);
  189. r_ret=Math::atan2(*p_args[0],*p_args[1]);
  190. } break;
  191. case MATH_SQRT: {
  192. VALIDATE_ARG_COUNT(1);
  193. VALIDATE_ARG_NUM(0);
  194. r_ret=Math::sqrt(*p_args[0]);
  195. } break;
  196. case MATH_FMOD: {
  197. VALIDATE_ARG_COUNT(2);
  198. VALIDATE_ARG_NUM(0);
  199. VALIDATE_ARG_NUM(1);
  200. r_ret=Math::fmod(*p_args[0],*p_args[1]);
  201. } break;
  202. case MATH_FPOSMOD: {
  203. VALIDATE_ARG_COUNT(2);
  204. VALIDATE_ARG_NUM(0);
  205. VALIDATE_ARG_NUM(1);
  206. r_ret=Math::fposmod(*p_args[0],*p_args[1]);
  207. } break;
  208. case MATH_FLOOR: {
  209. VALIDATE_ARG_COUNT(1);
  210. VALIDATE_ARG_NUM(0);
  211. r_ret=Math::floor(*p_args[0]);
  212. } break;
  213. case MATH_CEIL: {
  214. VALIDATE_ARG_COUNT(1);
  215. VALIDATE_ARG_NUM(0);
  216. r_ret=Math::ceil(*p_args[0]);
  217. } break;
  218. case MATH_ROUND: {
  219. VALIDATE_ARG_COUNT(1);
  220. VALIDATE_ARG_NUM(0);
  221. r_ret=Math::round(*p_args[0]);
  222. } break;
  223. case MATH_ABS: {
  224. VALIDATE_ARG_COUNT(1);
  225. if (p_args[0]->get_type()==Variant::INT) {
  226. int64_t i = *p_args[0];
  227. r_ret=ABS(i);
  228. } else if (p_args[0]->get_type()==Variant::REAL) {
  229. real_t r = *p_args[0];
  230. r_ret=Math::abs(r);
  231. } else {
  232. r_error.error=Variant::CallError::CALL_ERROR_INVALID_ARGUMENT;
  233. r_error.argument=0;
  234. r_error.expected=Variant::REAL;
  235. r_ret=Variant();
  236. }
  237. } break;
  238. case MATH_SIGN: {
  239. VALIDATE_ARG_COUNT(1);
  240. if (p_args[0]->get_type()==Variant::INT) {
  241. int64_t i = *p_args[0];
  242. r_ret= i < 0 ? -1 : ( i > 0 ? +1 : 0);
  243. } else if (p_args[0]->get_type()==Variant::REAL) {
  244. real_t r = *p_args[0];
  245. r_ret= r < 0.0 ? -1.0 : ( r > 0.0 ? +1.0 : 0.0);
  246. } else {
  247. r_error.error=Variant::CallError::CALL_ERROR_INVALID_ARGUMENT;
  248. r_error.argument=0;
  249. r_error.expected=Variant::REAL;
  250. r_ret=Variant();
  251. }
  252. } break;
  253. case MATH_POW: {
  254. VALIDATE_ARG_COUNT(2);
  255. VALIDATE_ARG_NUM(0);
  256. VALIDATE_ARG_NUM(1);
  257. r_ret=Math::pow(*p_args[0],*p_args[1]);
  258. } break;
  259. case MATH_LOG: {
  260. VALIDATE_ARG_COUNT(1);
  261. VALIDATE_ARG_NUM(0);
  262. r_ret=Math::log(*p_args[0]);
  263. } break;
  264. case MATH_EXP: {
  265. VALIDATE_ARG_COUNT(1);
  266. VALIDATE_ARG_NUM(0);
  267. r_ret=Math::exp(*p_args[0]);
  268. } break;
  269. case MATH_ISNAN: {
  270. VALIDATE_ARG_COUNT(1);
  271. VALIDATE_ARG_NUM(0);
  272. r_ret=Math::is_nan(*p_args[0]);
  273. } break;
  274. case MATH_ISINF: {
  275. VALIDATE_ARG_COUNT(1);
  276. VALIDATE_ARG_NUM(0);
  277. r_ret=Math::is_inf(*p_args[0]);
  278. } break;
  279. case MATH_EASE: {
  280. VALIDATE_ARG_COUNT(2);
  281. VALIDATE_ARG_NUM(0);
  282. VALIDATE_ARG_NUM(1);
  283. r_ret=Math::ease(*p_args[0],*p_args[1]);
  284. } break;
  285. case MATH_DECIMALS: {
  286. VALIDATE_ARG_COUNT(1);
  287. VALIDATE_ARG_NUM(0);
  288. r_ret=Math::step_decimals(*p_args[0]);
  289. } break;
  290. case MATH_STEPIFY: {
  291. VALIDATE_ARG_COUNT(2);
  292. VALIDATE_ARG_NUM(0);
  293. VALIDATE_ARG_NUM(1);
  294. r_ret=Math::stepify(*p_args[0],*p_args[1]);
  295. } break;
  296. case MATH_LERP: {
  297. VALIDATE_ARG_COUNT(3);
  298. VALIDATE_ARG_NUM(0);
  299. VALIDATE_ARG_NUM(1);
  300. VALIDATE_ARG_NUM(2);
  301. r_ret=Math::lerp(*p_args[0],*p_args[1],*p_args[2]);
  302. } break;
  303. case MATH_DECTIME: {
  304. VALIDATE_ARG_COUNT(3);
  305. VALIDATE_ARG_NUM(0);
  306. VALIDATE_ARG_NUM(1);
  307. VALIDATE_ARG_NUM(2);
  308. r_ret=Math::dectime(*p_args[0],*p_args[1],*p_args[2]);
  309. } break;
  310. case MATH_RANDOMIZE: {
  311. Math::randomize();
  312. r_ret=Variant();
  313. } break;
  314. case MATH_RAND: {
  315. r_ret=Math::rand();
  316. } break;
  317. case MATH_RANDF: {
  318. r_ret=Math::randf();
  319. } break;
  320. case MATH_RANDOM: {
  321. VALIDATE_ARG_COUNT(2);
  322. VALIDATE_ARG_NUM(0);
  323. VALIDATE_ARG_NUM(1);
  324. r_ret=Math::random(*p_args[0],*p_args[1]);
  325. } break;
  326. case MATH_SEED: {
  327. VALIDATE_ARG_COUNT(1);
  328. VALIDATE_ARG_NUM(0);
  329. uint32_t seed=*p_args[0];
  330. Math::seed(seed);
  331. r_ret=Variant();
  332. } break;
  333. case MATH_RANDSEED: {
  334. VALIDATE_ARG_COUNT(1);
  335. VALIDATE_ARG_NUM(0);
  336. uint32_t seed=*p_args[0];
  337. int ret = Math::rand_from_seed(&seed);
  338. Array reta;
  339. reta.push_back(ret);
  340. reta.push_back(seed);
  341. r_ret=reta;
  342. } break;
  343. case MATH_DEG2RAD: {
  344. VALIDATE_ARG_COUNT(1);
  345. VALIDATE_ARG_NUM(0);
  346. r_ret=Math::deg2rad(*p_args[0]);
  347. } break;
  348. case MATH_RAD2DEG: {
  349. VALIDATE_ARG_COUNT(1);
  350. VALIDATE_ARG_NUM(0);
  351. r_ret=Math::rad2deg(*p_args[0]);
  352. } break;
  353. case MATH_LINEAR2DB: {
  354. VALIDATE_ARG_COUNT(1);
  355. VALIDATE_ARG_NUM(0);
  356. r_ret=Math::linear2db(*p_args[0]);
  357. } break;
  358. case MATH_DB2LINEAR: {
  359. VALIDATE_ARG_COUNT(1);
  360. VALIDATE_ARG_NUM(0);
  361. r_ret=Math::db2linear(*p_args[0]);
  362. } break;
  363. case LOGIC_MAX: {
  364. VALIDATE_ARG_COUNT(2);
  365. if (p_args[0]->get_type()==Variant::INT && p_args[1]->get_type()==Variant::INT) {
  366. int64_t a = *p_args[0];
  367. int64_t b = *p_args[1];
  368. r_ret=MAX(a,b);
  369. } else {
  370. VALIDATE_ARG_NUM(0);
  371. VALIDATE_ARG_NUM(1);
  372. real_t a = *p_args[0];
  373. real_t b = *p_args[1];
  374. r_ret=MAX(a,b);
  375. }
  376. } break;
  377. case LOGIC_MIN: {
  378. VALIDATE_ARG_COUNT(2);
  379. if (p_args[0]->get_type()==Variant::INT && p_args[1]->get_type()==Variant::INT) {
  380. int64_t a = *p_args[0];
  381. int64_t b = *p_args[1];
  382. r_ret=MIN(a,b);
  383. } else {
  384. VALIDATE_ARG_NUM(0);
  385. VALIDATE_ARG_NUM(1);
  386. real_t a = *p_args[0];
  387. real_t b = *p_args[1];
  388. r_ret=MIN(a,b);
  389. }
  390. } break;
  391. case LOGIC_CLAMP: {
  392. VALIDATE_ARG_COUNT(3);
  393. if (p_args[0]->get_type()==Variant::INT && p_args[1]->get_type()==Variant::INT && p_args[2]->get_type()==Variant::INT) {
  394. int64_t a = *p_args[0];
  395. int64_t b = *p_args[1];
  396. int64_t c = *p_args[2];
  397. r_ret=CLAMP(a,b,c);
  398. } else {
  399. VALIDATE_ARG_NUM(0);
  400. VALIDATE_ARG_NUM(1);
  401. VALIDATE_ARG_NUM(2);
  402. real_t a = *p_args[0];
  403. real_t b = *p_args[1];
  404. real_t c = *p_args[2];
  405. r_ret=CLAMP(a,b,c);
  406. }
  407. } break;
  408. case LOGIC_NEAREST_PO2: {
  409. VALIDATE_ARG_COUNT(1);
  410. VALIDATE_ARG_NUM(0);
  411. int64_t num = *p_args[0];
  412. r_ret = nearest_power_of_2(num);
  413. } break;
  414. case OBJ_WEAKREF: {
  415. VALIDATE_ARG_COUNT(1);
  416. if (p_args[0]->get_type()!=Variant::OBJECT) {
  417. r_error.error=Variant::CallError::CALL_ERROR_INVALID_ARGUMENT;
  418. r_error.argument=0;
  419. r_error.expected=Variant::OBJECT;
  420. r_ret=Variant();
  421. return;
  422. }
  423. if (p_args[0]->is_ref()) {
  424. REF r = *p_args[0];
  425. if (!r.is_valid()) {
  426. r_ret=Variant();
  427. return;
  428. }
  429. Ref<WeakRef> wref = memnew( WeakRef );
  430. wref->set_ref(r);
  431. r_ret=wref;
  432. } else {
  433. Object *obj = *p_args[0];
  434. if (!obj) {
  435. r_ret=Variant();
  436. return;
  437. }
  438. Ref<WeakRef> wref = memnew( WeakRef );
  439. wref->set_obj(obj);
  440. r_ret=wref;
  441. }
  442. } break;
  443. case FUNC_FUNCREF: {
  444. VALIDATE_ARG_COUNT(2);
  445. if (p_args[0]->get_type()!=Variant::OBJECT) {
  446. r_error.error=Variant::CallError::CALL_ERROR_INVALID_ARGUMENT;
  447. r_error.argument=0;
  448. r_error.expected=Variant::OBJECT;
  449. r_ret=Variant();
  450. return;
  451. }
  452. if (p_args[1]->get_type()!=Variant::STRING && p_args[1]->get_type()!=Variant::NODE_PATH) {
  453. r_error.error=Variant::CallError::CALL_ERROR_INVALID_ARGUMENT;
  454. r_error.argument=1;
  455. r_error.expected=Variant::STRING;
  456. r_ret=Variant();
  457. return;
  458. }
  459. Ref<FuncRef> fr = memnew( FuncRef);
  460. fr->set_instance(*p_args[0]);
  461. fr->set_function(*p_args[1]);
  462. r_ret=fr;
  463. } break;
  464. case TYPE_CONVERT: {
  465. VALIDATE_ARG_COUNT(2);
  466. VALIDATE_ARG_NUM(1);
  467. int type=*p_args[1];
  468. if (type<0 || type>=Variant::VARIANT_MAX) {
  469. r_ret=RTR("Invalid type argument to convert(), use TYPE_* constants.");
  470. r_error.error=Variant::CallError::CALL_ERROR_INVALID_ARGUMENT;
  471. r_error.argument=0;
  472. r_error.expected=Variant::INT;
  473. return;
  474. } else {
  475. r_ret=Variant::construct(Variant::Type(type),p_args,1,r_error);
  476. }
  477. } break;
  478. case TYPE_OF: {
  479. VALIDATE_ARG_COUNT(1);
  480. r_ret = p_args[0]->get_type();
  481. } break;
  482. case TYPE_EXISTS: {
  483. VALIDATE_ARG_COUNT(1);
  484. r_ret = ObjectTypeDB::type_exists(*p_args[0]);
  485. } break;
  486. case TEXT_STR: {
  487. String str;
  488. for(int i=0;i<p_arg_count;i++) {
  489. String os = p_args[i]->operator String();;
  490. if (i==0)
  491. str=os;
  492. else
  493. str+=os;
  494. }
  495. r_ret=str;
  496. } break;
  497. case TEXT_PRINT: {
  498. String str;
  499. for(int i=0;i<p_arg_count;i++) {
  500. str+=p_args[i]->operator String();
  501. }
  502. //str+="\n";
  503. print_line(str);
  504. r_ret=Variant();
  505. } break;
  506. case TEXT_PRINT_TABBED: {
  507. String str;
  508. for(int i=0;i<p_arg_count;i++) {
  509. if (i)
  510. str+="\t";
  511. str+=p_args[i]->operator String();
  512. }
  513. //str+="\n";
  514. print_line(str);
  515. r_ret=Variant();
  516. } break;
  517. case TEXT_PRINT_SPACED: {
  518. String str;
  519. for(int i=0;i<p_arg_count;i++) {
  520. if (i)
  521. str+=" ";
  522. str+=p_args[i]->operator String();
  523. }
  524. //str+="\n";
  525. print_line(str);
  526. r_ret=Variant();
  527. } break;
  528. case TEXT_PRINTERR: {
  529. String str;
  530. for(int i=0;i<p_arg_count;i++) {
  531. str+=p_args[i]->operator String();
  532. }
  533. //str+="\n";
  534. OS::get_singleton()->printerr("%s\n",str.utf8().get_data());
  535. r_ret=Variant();
  536. } break;
  537. case TEXT_PRINTRAW: {
  538. String str;
  539. for(int i=0;i<p_arg_count;i++) {
  540. str+=p_args[i]->operator String();
  541. }
  542. //str+="\n";
  543. OS::get_singleton()->print("%s",str.utf8().get_data());
  544. r_ret=Variant();
  545. } break;
  546. case VAR_TO_STR: {
  547. VALIDATE_ARG_COUNT(1);
  548. String vars;
  549. VariantWriter::write_to_string(*p_args[0],vars);
  550. r_ret=vars;
  551. } break;
  552. case STR_TO_VAR: {
  553. VALIDATE_ARG_COUNT(1);
  554. if (p_args[0]->get_type()!=Variant::STRING) {
  555. r_error.error=Variant::CallError::CALL_ERROR_INVALID_ARGUMENT;
  556. r_error.argument=0;
  557. r_error.expected=Variant::STRING;
  558. r_ret=Variant();
  559. return;
  560. }
  561. VariantParser::StreamString ss;
  562. ss.s=*p_args[0];
  563. String errs;
  564. int line;
  565. Error err = VariantParser::parse(&ss,r_ret,errs,line);
  566. if (err!=OK) {
  567. r_error.error=Variant::CallError::CALL_ERROR_INVALID_ARGUMENT;
  568. r_error.argument=0;
  569. r_error.expected=Variant::STRING;
  570. r_ret="Parse error at line "+itos(line)+": "+errs;
  571. return;
  572. }
  573. } break;
  574. case VAR_TO_BYTES: {
  575. VALIDATE_ARG_COUNT(1);
  576. ByteArray barr;
  577. int len;
  578. Error err = encode_variant(*p_args[0],NULL,len);
  579. if (err) {
  580. r_error.error=Variant::CallError::CALL_ERROR_INVALID_ARGUMENT;
  581. r_error.argument=0;
  582. r_error.expected=Variant::NIL;
  583. r_ret="Unexpected error encoding variable to bytes, likely unserializable type found (Object or RID).";
  584. return;
  585. }
  586. barr.resize(len);
  587. {
  588. ByteArray::Write w = barr.write();
  589. encode_variant(*p_args[0],w.ptr(),len);
  590. }
  591. r_ret=barr;
  592. } break;
  593. case BYTES_TO_VAR: {
  594. VALIDATE_ARG_COUNT(1);
  595. if (p_args[0]->get_type()!=Variant::RAW_ARRAY) {
  596. r_error.error=Variant::CallError::CALL_ERROR_INVALID_ARGUMENT;
  597. r_error.argument=0;
  598. r_error.expected=Variant::RAW_ARRAY;
  599. r_ret=Variant();
  600. return;
  601. }
  602. ByteArray varr=*p_args[0];
  603. Variant ret;
  604. {
  605. ByteArray::Read r=varr.read();
  606. Error err = decode_variant(ret,r.ptr(),varr.size(),NULL);
  607. if (err!=OK) {
  608. r_ret=RTR("Not enough bytes for decoding bytes, or invalid format.");
  609. r_error.error=Variant::CallError::CALL_ERROR_INVALID_ARGUMENT;
  610. r_error.argument=0;
  611. r_error.expected=Variant::RAW_ARRAY;
  612. return;
  613. }
  614. }
  615. r_ret=ret;
  616. } break;
  617. case GEN_RANGE: {
  618. switch(p_arg_count) {
  619. case 0: {
  620. r_error.error=Variant::CallError::CALL_ERROR_TOO_FEW_ARGUMENTS;
  621. r_error.argument=1;
  622. r_ret=Variant();
  623. } break;
  624. case 1: {
  625. VALIDATE_ARG_NUM(0);
  626. int count=*p_args[0];
  627. Array arr(true);
  628. if (count<=0) {
  629. r_ret=arr;
  630. return;
  631. }
  632. Error err = arr.resize(count);
  633. if (err!=OK) {
  634. r_error.error=Variant::CallError::CALL_ERROR_INVALID_METHOD;
  635. r_ret=Variant();
  636. return;
  637. }
  638. for(int i=0;i<count;i++) {
  639. arr[i]=i;
  640. }
  641. r_ret=arr;
  642. } break;
  643. case 2: {
  644. VALIDATE_ARG_NUM(0);
  645. VALIDATE_ARG_NUM(1);
  646. int from=*p_args[0];
  647. int to=*p_args[1];
  648. Array arr(true);
  649. if (from>=to) {
  650. r_ret=arr;
  651. return;
  652. }
  653. Error err = arr.resize(to-from);
  654. if (err!=OK) {
  655. r_error.error=Variant::CallError::CALL_ERROR_INVALID_METHOD;
  656. r_ret=Variant();
  657. return;
  658. }
  659. for(int i=from;i<to;i++)
  660. arr[i-from]=i;
  661. r_ret=arr;
  662. } break;
  663. case 3: {
  664. VALIDATE_ARG_NUM(0);
  665. VALIDATE_ARG_NUM(1);
  666. VALIDATE_ARG_NUM(2);
  667. int from=*p_args[0];
  668. int to=*p_args[1];
  669. int incr=*p_args[2];
  670. if (incr==0) {
  671. r_ret=RTR("step argument is zero!");
  672. r_error.error=Variant::CallError::CALL_ERROR_INVALID_METHOD;
  673. return;
  674. }
  675. Array arr(true);
  676. if (from>=to && incr>0) {
  677. r_ret=arr;
  678. return;
  679. }
  680. if (from<=to && incr<0) {
  681. r_ret=arr;
  682. return;
  683. }
  684. //calculate how many
  685. int count=0;
  686. if (incr>0) {
  687. count=((to-from-1)/incr)+1;
  688. } else {
  689. count=((from-to-1)/-incr)+1;
  690. }
  691. Error err = arr.resize(count);
  692. if (err!=OK) {
  693. r_error.error=Variant::CallError::CALL_ERROR_INVALID_METHOD;
  694. r_ret=Variant();
  695. return;
  696. }
  697. if (incr>0) {
  698. int idx=0;
  699. for(int i=from;i<to;i+=incr) {
  700. arr[idx++]=i;
  701. }
  702. } else {
  703. int idx=0;
  704. for(int i=from;i>to;i+=incr) {
  705. arr[idx++]=i;
  706. }
  707. }
  708. r_ret=arr;
  709. } break;
  710. default: {
  711. r_error.error=Variant::CallError::CALL_ERROR_TOO_MANY_ARGUMENTS;
  712. r_error.argument=3;
  713. r_ret=Variant();
  714. } break;
  715. }
  716. } break;
  717. case RESOURCE_LOAD: {
  718. VALIDATE_ARG_COUNT(1);
  719. if (p_args[0]->get_type()!=Variant::STRING) {
  720. r_error.error=Variant::CallError::CALL_ERROR_INVALID_ARGUMENT;
  721. r_error.argument=0;
  722. r_ret=Variant();
  723. } else {
  724. r_ret=ResourceLoader::load(*p_args[0]);
  725. }
  726. } break;
  727. case INST2DICT: {
  728. VALIDATE_ARG_COUNT(1);
  729. if (p_args[0]->get_type()==Variant::NIL) {
  730. r_ret=Variant();
  731. } else if (p_args[0]->get_type()!=Variant::OBJECT) {
  732. r_error.error=Variant::CallError::CALL_ERROR_INVALID_ARGUMENT;
  733. r_error.argument=0;
  734. r_ret=Variant();
  735. } else {
  736. Object *obj = *p_args[0];
  737. if (!obj) {
  738. r_ret=Variant();
  739. } else if (!obj->get_script_instance() || obj->get_script_instance()->get_language()!=GDScriptLanguage::get_singleton()) {
  740. r_error.error=Variant::CallError::CALL_ERROR_INVALID_ARGUMENT;
  741. r_error.argument=0;
  742. r_error.expected=Variant::DICTIONARY;
  743. r_ret=RTR("Not a script with an instance");
  744. return;
  745. } else {
  746. GDInstance *ins = static_cast<GDInstance*>(obj->get_script_instance());
  747. Ref<GDScript> base = ins->get_script();
  748. if (base.is_null()) {
  749. r_error.error=Variant::CallError::CALL_ERROR_INVALID_ARGUMENT;
  750. r_error.argument=0;
  751. r_error.expected=Variant::DICTIONARY;
  752. r_ret=RTR("Not based on a script");
  753. return;
  754. }
  755. GDScript *p = base.ptr();
  756. Vector<StringName> sname;
  757. while(p->_owner) {
  758. sname.push_back(p->name);
  759. p=p->_owner;
  760. }
  761. sname.invert();
  762. if (!p->path.is_resource_file()) {
  763. r_error.error=Variant::CallError::CALL_ERROR_INVALID_ARGUMENT;
  764. r_error.argument=0;
  765. r_error.expected=Variant::DICTIONARY;
  766. r_ret=Variant();
  767. r_ret=RTR("Not based on a resource file");
  768. return;
  769. }
  770. NodePath cp(sname,Vector<StringName>(),false);
  771. Dictionary d(true);
  772. d["@subpath"]=cp;
  773. d["@path"]=p->path;
  774. p = base.ptr();
  775. while(p) {
  776. for(Set<StringName>::Element *E=p->members.front();E;E=E->next()) {
  777. Variant value;
  778. if (ins->get(E->get(),value)) {
  779. String k = E->get();
  780. if (!d.has(k)) {
  781. d[k]=value;
  782. }
  783. }
  784. }
  785. p=p->_base;
  786. }
  787. r_ret=d;
  788. }
  789. }
  790. } break;
  791. case DICT2INST: {
  792. VALIDATE_ARG_COUNT(1);
  793. if (p_args[0]->get_type()!=Variant::DICTIONARY) {
  794. r_error.error=Variant::CallError::CALL_ERROR_INVALID_ARGUMENT;
  795. r_error.argument=0;
  796. r_error.expected=Variant::DICTIONARY;
  797. r_ret=Variant();
  798. return;
  799. }
  800. Dictionary d = *p_args[0];
  801. if (!d.has("@path")) {
  802. r_error.error=Variant::CallError::CALL_ERROR_INVALID_ARGUMENT;
  803. r_error.argument=0;
  804. r_error.expected=Variant::OBJECT;
  805. r_ret=RTR("Invalid instance dictionary format (missing @path)");
  806. return;
  807. }
  808. Ref<Script> scr = ResourceLoader::load(d["@path"]);
  809. if (!scr.is_valid()) {
  810. r_error.error=Variant::CallError::CALL_ERROR_INVALID_ARGUMENT;
  811. r_error.argument=0;
  812. r_error.expected=Variant::OBJECT;
  813. r_ret=RTR("Invalid instance dictionary format (can't load script at @path)");
  814. return;
  815. }
  816. Ref<GDScript> gdscr = scr;
  817. if (!gdscr.is_valid()) {
  818. r_error.error=Variant::CallError::CALL_ERROR_INVALID_ARGUMENT;
  819. r_error.argument=0;
  820. r_error.expected=Variant::OBJECT;
  821. r_ret=Variant();
  822. r_ret=RTR("Invalid instance dictionary format (invalid script at @path)");
  823. return;
  824. }
  825. NodePath sub;
  826. if (d.has("@subpath")) {
  827. sub=d["@subpath"];
  828. }
  829. for(int i=0;i<sub.get_name_count();i++) {
  830. gdscr = gdscr->subclasses[ sub.get_name(i)];
  831. if (!gdscr.is_valid()) {
  832. r_error.error=Variant::CallError::CALL_ERROR_INVALID_ARGUMENT;
  833. r_error.argument=0;
  834. r_error.expected=Variant::OBJECT;
  835. r_ret=Variant();
  836. r_ret=RTR("Invalid instance dictionary (invalid subclasses)");
  837. return;
  838. }
  839. }
  840. r_ret = gdscr->_new(NULL,0,r_error);
  841. GDInstance *ins = static_cast<GDInstance*>(static_cast<Object*>(r_ret)->get_script_instance());
  842. Ref<GDScript> gd_ref = ins->get_script();
  843. for(Map<StringName,GDScript::MemberInfo>::Element *E = gd_ref->member_indices.front(); E; E = E->next()) {
  844. if(d.has(E->key())) {
  845. ins->members[E->get().index] = d[E->key()];
  846. }
  847. }
  848. } break;
  849. case HASH: {
  850. VALIDATE_ARG_COUNT(1);
  851. r_ret=p_args[0]->hash();
  852. } break;
  853. case COLOR8: {
  854. if (p_arg_count<3) {
  855. r_error.error=Variant::CallError::CALL_ERROR_TOO_FEW_ARGUMENTS;
  856. r_error.argument=3;
  857. r_ret=Variant();
  858. return;
  859. }
  860. if (p_arg_count>4) {
  861. r_error.error=Variant::CallError::CALL_ERROR_TOO_MANY_ARGUMENTS;
  862. r_error.argument=4;
  863. r_ret=Variant();
  864. return;
  865. }
  866. VALIDATE_ARG_NUM(0);
  867. VALIDATE_ARG_NUM(1);
  868. VALIDATE_ARG_NUM(2);
  869. Color color((float)*p_args[0]/255.0f,(float)*p_args[1]/255.0f,(float)*p_args[2]/255.0f);
  870. if (p_arg_count==4) {
  871. VALIDATE_ARG_NUM(3);
  872. color.a=(float)*p_args[3]/255.0f;
  873. }
  874. r_ret=color;
  875. } break;
  876. case COLORN: {
  877. if (p_arg_count<1) {
  878. r_error.error=Variant::CallError::CALL_ERROR_TOO_FEW_ARGUMENTS;
  879. r_error.argument=1;
  880. r_ret=Variant();
  881. return;
  882. }
  883. if (p_arg_count>2) {
  884. r_error.error=Variant::CallError::CALL_ERROR_TOO_MANY_ARGUMENTS;
  885. r_error.argument=2;
  886. r_ret=Variant();
  887. return;
  888. }
  889. if (p_args[0]->get_type()!=Variant::STRING) {
  890. r_error.error=Variant::CallError::CALL_ERROR_INVALID_ARGUMENT;
  891. r_error.argument=0;
  892. r_ret=Variant();
  893. } else {
  894. Color color = Color::named(*p_args[0]);
  895. if (p_arg_count==2) {
  896. VALIDATE_ARG_NUM(1);
  897. color.a=*p_args[1];
  898. }
  899. r_ret=color;
  900. }
  901. } break;
  902. case PRINT_STACK: {
  903. ScriptLanguage* script = GDScriptLanguage::get_singleton();
  904. for (int i=0; i < script->debug_get_stack_level_count(); i++) {
  905. 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)+"'");
  906. };
  907. } break;
  908. case INSTANCE_FROM_ID: {
  909. VALIDATE_ARG_COUNT(1);
  910. if (p_args[0]->get_type()!=Variant::INT && p_args[0]->get_type()!=Variant::REAL) {
  911. r_error.error=Variant::CallError::CALL_ERROR_INVALID_ARGUMENT;
  912. r_error.argument=0;
  913. r_error.expected=Variant::INT;
  914. r_ret=Variant();
  915. break;
  916. }
  917. uint32_t id=*p_args[0];
  918. r_ret=ObjectDB::get_instance(id);
  919. } break;
  920. case FUNC_MAX: {
  921. ERR_FAIL();
  922. } break;
  923. }
  924. }
  925. bool GDFunctions::is_deterministic(Function p_func) {
  926. //man i couldn't have chosen a worse function name,
  927. //way too controversial..
  928. switch(p_func) {
  929. case MATH_SIN:
  930. case MATH_COS:
  931. case MATH_TAN:
  932. case MATH_SINH:
  933. case MATH_COSH:
  934. case MATH_TANH:
  935. case MATH_ASIN:
  936. case MATH_ACOS:
  937. case MATH_ATAN:
  938. case MATH_ATAN2:
  939. case MATH_SQRT:
  940. case MATH_FMOD:
  941. case MATH_FPOSMOD:
  942. case MATH_FLOOR:
  943. case MATH_CEIL:
  944. case MATH_ROUND:
  945. case MATH_ABS:
  946. case MATH_SIGN:
  947. case MATH_POW:
  948. case MATH_LOG:
  949. case MATH_EXP:
  950. case MATH_ISNAN:
  951. case MATH_ISINF:
  952. case MATH_EASE:
  953. case MATH_DECIMALS:
  954. case MATH_STEPIFY:
  955. case MATH_LERP:
  956. case MATH_DECTIME:
  957. case MATH_DEG2RAD:
  958. case MATH_RAD2DEG:
  959. case MATH_LINEAR2DB:
  960. case MATH_DB2LINEAR:
  961. case LOGIC_MAX:
  962. case LOGIC_MIN:
  963. case LOGIC_CLAMP:
  964. case LOGIC_NEAREST_PO2:
  965. case TYPE_CONVERT:
  966. case TYPE_OF:
  967. case TYPE_EXISTS:
  968. case TEXT_STR:
  969. case COLOR8:
  970. // enable for debug only, otherwise not desirable - case GEN_RANGE:
  971. return true;
  972. default:
  973. return false;
  974. }
  975. return false;
  976. }
  977. MethodInfo GDFunctions::get_info(Function p_func) {
  978. #ifdef TOOLS_ENABLED
  979. //using a switch, so the compiler generates a jumptable
  980. switch(p_func) {
  981. case MATH_SIN: {
  982. MethodInfo mi("sin",PropertyInfo(Variant::REAL,"s"));
  983. mi.return_val.type=Variant::REAL;
  984. return mi;
  985. } break;
  986. case MATH_COS: {
  987. MethodInfo mi("cos",PropertyInfo(Variant::REAL,"s"));
  988. mi.return_val.type=Variant::REAL;
  989. return mi;
  990. } break;
  991. case MATH_TAN: {
  992. MethodInfo mi("tan",PropertyInfo(Variant::REAL,"s"));
  993. mi.return_val.type=Variant::REAL;
  994. return mi;
  995. } break;
  996. case MATH_SINH: {
  997. MethodInfo mi("sinh",PropertyInfo(Variant::REAL,"s"));
  998. mi.return_val.type=Variant::REAL;
  999. return mi;
  1000. } break;
  1001. case MATH_COSH: {
  1002. MethodInfo mi("cosh",PropertyInfo(Variant::REAL,"s"));
  1003. mi.return_val.type=Variant::REAL;
  1004. return mi;
  1005. } break;
  1006. case MATH_TANH: {
  1007. MethodInfo mi("tanh",PropertyInfo(Variant::REAL,"s"));
  1008. mi.return_val.type=Variant::REAL;
  1009. return mi;
  1010. } break;
  1011. case MATH_ASIN: {
  1012. MethodInfo mi("asin",PropertyInfo(Variant::REAL,"s"));
  1013. mi.return_val.type=Variant::REAL;
  1014. return mi;
  1015. } break;
  1016. case MATH_ACOS: {
  1017. MethodInfo mi("acos",PropertyInfo(Variant::REAL,"s"));
  1018. mi.return_val.type=Variant::REAL;
  1019. return mi;
  1020. } break;
  1021. case MATH_ATAN: {
  1022. MethodInfo mi("atan",PropertyInfo(Variant::REAL,"s"));
  1023. mi.return_val.type=Variant::REAL;
  1024. return mi;
  1025. } break;
  1026. case MATH_ATAN2: {
  1027. MethodInfo mi("atan2",PropertyInfo(Variant::REAL,"x"),PropertyInfo(Variant::REAL,"y"));
  1028. mi.return_val.type=Variant::REAL;
  1029. return mi;
  1030. } break;
  1031. case MATH_SQRT: {
  1032. MethodInfo mi("sqrt",PropertyInfo(Variant::REAL,"s"));
  1033. mi.return_val.type=Variant::REAL;
  1034. return mi;
  1035. } break;
  1036. case MATH_FMOD: {
  1037. MethodInfo mi("fmod",PropertyInfo(Variant::REAL,"x"),PropertyInfo(Variant::REAL,"y"));
  1038. mi.return_val.type=Variant::REAL;
  1039. return mi;
  1040. } break;
  1041. case MATH_FPOSMOD: {
  1042. MethodInfo mi("fposmod",PropertyInfo(Variant::REAL,"x"),PropertyInfo(Variant::REAL,"y"));
  1043. mi.return_val.type=Variant::REAL;
  1044. return mi;
  1045. } break;
  1046. case MATH_FLOOR: {
  1047. MethodInfo mi("floor",PropertyInfo(Variant::REAL,"s"));
  1048. mi.return_val.type=Variant::REAL;
  1049. return mi;
  1050. } break;
  1051. case MATH_CEIL: {
  1052. MethodInfo mi("ceil",PropertyInfo(Variant::REAL,"s"));
  1053. mi.return_val.type=Variant::REAL;
  1054. return mi;
  1055. } break;
  1056. case MATH_ROUND: {
  1057. MethodInfo mi("round",PropertyInfo(Variant::REAL,"s"));
  1058. mi.return_val.type=Variant::REAL;
  1059. return mi;
  1060. } break;
  1061. case MATH_ABS: {
  1062. MethodInfo mi("abs",PropertyInfo(Variant::REAL,"s"));
  1063. mi.return_val.type=Variant::REAL;
  1064. return mi;
  1065. } break;
  1066. case MATH_SIGN: {
  1067. MethodInfo mi("sign",PropertyInfo(Variant::REAL,"s"));
  1068. mi.return_val.type=Variant::REAL;
  1069. return mi;
  1070. } break;
  1071. case MATH_POW: {
  1072. MethodInfo mi("pow",PropertyInfo(Variant::REAL,"x"),PropertyInfo(Variant::REAL,"y"));
  1073. mi.return_val.type=Variant::REAL;
  1074. return mi;
  1075. } break;
  1076. case MATH_LOG: {
  1077. MethodInfo mi("log",PropertyInfo(Variant::REAL,"s"));
  1078. mi.return_val.type=Variant::REAL;
  1079. return mi;
  1080. } break;
  1081. case MATH_EXP: {
  1082. MethodInfo mi("exp",PropertyInfo(Variant::REAL,"s"));
  1083. mi.return_val.type=Variant::REAL;
  1084. return mi;
  1085. } break;
  1086. case MATH_ISNAN: {
  1087. MethodInfo mi("is_nan",PropertyInfo(Variant::REAL,"s"));
  1088. mi.return_val.type=Variant::REAL;
  1089. return mi;
  1090. } break;
  1091. case MATH_ISINF: {
  1092. MethodInfo mi("is_inf",PropertyInfo(Variant::REAL,"s"));
  1093. mi.return_val.type=Variant::REAL;
  1094. return mi;
  1095. } break;
  1096. case MATH_EASE: {
  1097. MethodInfo mi("ease",PropertyInfo(Variant::REAL,"s"),PropertyInfo(Variant::REAL,"curve"));
  1098. mi.return_val.type=Variant::REAL;
  1099. return mi;
  1100. } break;
  1101. case MATH_DECIMALS: {
  1102. MethodInfo mi("decimals",PropertyInfo(Variant::REAL,"step"));
  1103. mi.return_val.type=Variant::REAL;
  1104. return mi;
  1105. } break;
  1106. case MATH_STEPIFY: {
  1107. MethodInfo mi("stepify",PropertyInfo(Variant::REAL,"s"),PropertyInfo(Variant::REAL,"step"));
  1108. mi.return_val.type=Variant::REAL;
  1109. return mi;
  1110. } break;
  1111. case MATH_LERP: {
  1112. MethodInfo mi("lerp",PropertyInfo(Variant::REAL,"from"),PropertyInfo(Variant::REAL,"to"), PropertyInfo(Variant::REAL,"weight"));
  1113. mi.return_val.type=Variant::REAL;
  1114. return mi;
  1115. } break;
  1116. case MATH_DECTIME: {
  1117. MethodInfo mi("dectime",PropertyInfo(Variant::REAL,"value"),PropertyInfo(Variant::REAL,"amount"),PropertyInfo(Variant::REAL,"step"));
  1118. mi.return_val.type=Variant::REAL;
  1119. return mi;
  1120. } break;
  1121. case MATH_RANDOMIZE: {
  1122. MethodInfo mi("randomize");
  1123. mi.return_val.type=Variant::NIL;
  1124. return mi;
  1125. } break;
  1126. case MATH_RAND: {
  1127. MethodInfo mi("randi");
  1128. mi.return_val.type=Variant::INT;
  1129. return mi;
  1130. } break;
  1131. case MATH_RANDF: {
  1132. MethodInfo mi("randf");
  1133. mi.return_val.type=Variant::REAL;
  1134. return mi;
  1135. } break;
  1136. case MATH_RANDOM: {
  1137. MethodInfo mi("rand_range",PropertyInfo(Variant::REAL,"from"),PropertyInfo(Variant::REAL,"to"));
  1138. mi.return_val.type=Variant::REAL;
  1139. return mi;
  1140. } break;
  1141. case MATH_SEED: {
  1142. MethodInfo mi("seed",PropertyInfo(Variant::INT,"seed"));
  1143. mi.return_val.type=Variant::NIL;
  1144. return mi;
  1145. } break;
  1146. case MATH_RANDSEED: {
  1147. MethodInfo mi("rand_seed",PropertyInfo(Variant::INT,"seed"));
  1148. mi.return_val.type=Variant::ARRAY;
  1149. return mi;
  1150. } break;
  1151. case MATH_DEG2RAD: {
  1152. MethodInfo mi("deg2rad",PropertyInfo(Variant::REAL,"deg"));
  1153. mi.return_val.type=Variant::REAL;
  1154. return mi;
  1155. } break;
  1156. case MATH_RAD2DEG: {
  1157. MethodInfo mi("rad2deg",PropertyInfo(Variant::REAL,"rad"));
  1158. mi.return_val.type=Variant::REAL;
  1159. return mi;
  1160. } break;
  1161. case MATH_LINEAR2DB: {
  1162. MethodInfo mi("linear2db",PropertyInfo(Variant::REAL,"nrg"));
  1163. mi.return_val.type=Variant::REAL;
  1164. return mi;
  1165. } break;
  1166. case MATH_DB2LINEAR: {
  1167. MethodInfo mi("db2linear",PropertyInfo(Variant::REAL,"db"));
  1168. mi.return_val.type=Variant::REAL;
  1169. return mi;
  1170. } break;
  1171. case LOGIC_MAX: {
  1172. MethodInfo mi("max",PropertyInfo(Variant::REAL,"a"),PropertyInfo(Variant::REAL,"b"));
  1173. mi.return_val.type=Variant::REAL;
  1174. return mi;
  1175. } break;
  1176. case LOGIC_MIN: {
  1177. MethodInfo mi("min",PropertyInfo(Variant::REAL,"a"),PropertyInfo(Variant::REAL,"b"));
  1178. mi.return_val.type=Variant::REAL;
  1179. return mi;
  1180. } break;
  1181. case LOGIC_CLAMP: {
  1182. MethodInfo mi("clamp",PropertyInfo(Variant::REAL,"val"),PropertyInfo(Variant::REAL,"min"),PropertyInfo(Variant::REAL,"max"));
  1183. mi.return_val.type=Variant::REAL;
  1184. return mi;
  1185. } break;
  1186. case LOGIC_NEAREST_PO2: {
  1187. MethodInfo mi("nearest_po2",PropertyInfo(Variant::INT,"val"));
  1188. mi.return_val.type=Variant::INT;
  1189. return mi;
  1190. } break;
  1191. case OBJ_WEAKREF: {
  1192. MethodInfo mi("weakref",PropertyInfo(Variant::OBJECT,"obj"));
  1193. mi.return_val.type=Variant::OBJECT;
  1194. mi.return_val.name="WeakRef";
  1195. return mi;
  1196. } break;
  1197. case FUNC_FUNCREF: {
  1198. MethodInfo mi("funcref",PropertyInfo(Variant::OBJECT,"instance"),PropertyInfo(Variant::STRING,"funcname"));
  1199. mi.return_val.type=Variant::OBJECT;
  1200. mi.return_val.name="FuncRef";
  1201. return mi;
  1202. } break;
  1203. case TYPE_CONVERT: {
  1204. MethodInfo mi("convert",PropertyInfo(Variant::NIL,"what"),PropertyInfo(Variant::INT,"type"));
  1205. mi.return_val.type=Variant::OBJECT;
  1206. return mi;
  1207. } break;
  1208. case TYPE_OF: {
  1209. MethodInfo mi("typeof",PropertyInfo(Variant::NIL,"what"));
  1210. mi.return_val.type=Variant::INT;
  1211. return mi;
  1212. } break;
  1213. case TYPE_EXISTS: {
  1214. MethodInfo mi("type_exists",PropertyInfo(Variant::STRING,"type"));
  1215. mi.return_val.type=Variant::BOOL;
  1216. return mi;
  1217. } break;
  1218. case TEXT_STR: {
  1219. MethodInfo mi("str",PropertyInfo(Variant::NIL,"what"),PropertyInfo(Variant::NIL,"..."));
  1220. mi.return_val.type=Variant::STRING;
  1221. return mi;
  1222. } break;
  1223. case TEXT_PRINT: {
  1224. MethodInfo mi("print",PropertyInfo(Variant::NIL,"what"),PropertyInfo(Variant::NIL,"..."));
  1225. mi.return_val.type=Variant::NIL;
  1226. return mi;
  1227. } break;
  1228. case TEXT_PRINT_TABBED: {
  1229. MethodInfo mi("printt",PropertyInfo(Variant::NIL,"what"),PropertyInfo(Variant::NIL,"..."));
  1230. mi.return_val.type=Variant::NIL;
  1231. return mi;
  1232. } break;
  1233. case TEXT_PRINT_SPACED: {
  1234. MethodInfo mi("prints",PropertyInfo(Variant::NIL,"what"),PropertyInfo(Variant::NIL,"..."));
  1235. mi.return_val.type=Variant::NIL;
  1236. return mi;
  1237. } break;
  1238. case TEXT_PRINTERR: {
  1239. MethodInfo mi("printerr",PropertyInfo(Variant::NIL,"what"),PropertyInfo(Variant::NIL,"..."));
  1240. mi.return_val.type=Variant::NIL;
  1241. return mi;
  1242. } break;
  1243. case TEXT_PRINTRAW: {
  1244. MethodInfo mi("printraw",PropertyInfo(Variant::NIL,"what"),PropertyInfo(Variant::NIL,"..."));
  1245. mi.return_val.type=Variant::NIL;
  1246. return mi;
  1247. } break;
  1248. case VAR_TO_STR: {
  1249. MethodInfo mi("var2str",PropertyInfo(Variant::NIL,"var"));
  1250. mi.return_val.type=Variant::STRING;
  1251. return mi;
  1252. } break;
  1253. case STR_TO_VAR: {
  1254. MethodInfo mi("str2var:Variant",PropertyInfo(Variant::STRING,"string"));
  1255. mi.return_val.type=Variant::NIL;
  1256. return mi;
  1257. } break;
  1258. case VAR_TO_BYTES: {
  1259. MethodInfo mi("var2bytes",PropertyInfo(Variant::NIL,"var"));
  1260. mi.return_val.type=Variant::RAW_ARRAY;
  1261. return mi;
  1262. } break;
  1263. case BYTES_TO_VAR: {
  1264. MethodInfo mi("bytes2var:Variant",PropertyInfo(Variant::RAW_ARRAY,"bytes"));
  1265. mi.return_val.type=Variant::NIL;
  1266. return mi;
  1267. } break;
  1268. case GEN_RANGE: {
  1269. MethodInfo mi("range",PropertyInfo(Variant::NIL,"..."));
  1270. mi.return_val.type=Variant::ARRAY;
  1271. return mi;
  1272. } break;
  1273. case RESOURCE_LOAD: {
  1274. MethodInfo mi("load",PropertyInfo(Variant::STRING,"path"));
  1275. mi.return_val.type=Variant::OBJECT;
  1276. mi.return_val.name="Resource";
  1277. return mi;
  1278. } break;
  1279. case INST2DICT: {
  1280. MethodInfo mi("inst2dict",PropertyInfo(Variant::OBJECT,"inst"));
  1281. mi.return_val.type=Variant::DICTIONARY;
  1282. return mi;
  1283. } break;
  1284. case DICT2INST: {
  1285. MethodInfo mi("dict2inst",PropertyInfo(Variant::DICTIONARY,"dict"));
  1286. mi.return_val.type=Variant::OBJECT;
  1287. return mi;
  1288. } break;
  1289. case HASH: {
  1290. MethodInfo mi("hash",PropertyInfo(Variant::NIL,"var:Variant"));
  1291. mi.return_val.type=Variant::INT;
  1292. return mi;
  1293. } break;
  1294. case COLOR8: {
  1295. MethodInfo mi("Color8",PropertyInfo(Variant::INT,"r8"),PropertyInfo(Variant::INT,"g8"),PropertyInfo(Variant::INT,"b8"),PropertyInfo(Variant::INT,"a8"));
  1296. mi.return_val.type=Variant::COLOR;
  1297. return mi;
  1298. } break;
  1299. case COLORN: {
  1300. MethodInfo mi("ColorN",PropertyInfo(Variant::STRING,"name"),PropertyInfo(Variant::REAL,"alpha"));
  1301. mi.return_val.type=Variant::COLOR;
  1302. return mi;
  1303. } break;
  1304. case PRINT_STACK: {
  1305. MethodInfo mi("print_stack");
  1306. mi.return_val.type=Variant::NIL;
  1307. return mi;
  1308. } break;
  1309. case INSTANCE_FROM_ID: {
  1310. MethodInfo mi("instance_from_id",PropertyInfo(Variant::INT,"instance_id"));
  1311. mi.return_val.type=Variant::OBJECT;
  1312. return mi;
  1313. } break;
  1314. case FUNC_MAX: {
  1315. ERR_FAIL_V(MethodInfo());
  1316. } break;
  1317. }
  1318. #endif
  1319. return MethodInfo();
  1320. }