2
0

gd_functions.cpp 30 KB

1234567891011121314151617181920212223242526272829303132333435363738394041424344454647484950515253545556575859606162636465666768697071727374757677787980818283848586878889909192939495969798991001011021031041051061071081091101111121131141151161171181191201211221231241251261271281291301311321331341351361371381391401411421431441451461471481491501511521531541551561571581591601611621631641651661671681691701711721731741751761771781791801811821831841851861871881891901911921931941951961971981992002012022032042052062072082092102112122132142152162172182192202212222232242252262272282292302312322332342352362372382392402412422432442452462472482492502512522532542552562572582592602612622632642652662672682692702712722732742752762772782792802812822832842852862872882892902912922932942952962972982993003013023033043053063073083093103113123133143153163173183193203213223233243253263273283293303313323333343353363373383393403413423433443453463473483493503513523533543553563573583593603613623633643653663673683693703713723733743753763773783793803813823833843853863873883893903913923933943953963973983994004014024034044054064074084094104114124134144154164174184194204214224234244254264274284294304314324334344354364374384394404414424434444454464474484494504514524534544554564574584594604614624634644654664674684694704714724734744754764774784794804814824834844854864874884894904914924934944954964974984995005015025035045055065075085095105115125135145155165175185195205215225235245255265275285295305315325335345355365375385395405415425435445455465475485495505515525535545555565575585595605615625635645655665675685695705715725735745755765775785795805815825835845855865875885895905915925935945955965975985996006016026036046056066076086096106116126136146156166176186196206216226236246256266276286296306316326336346356366376386396406416426436446456466476486496506516526536546556566576586596606616626636646656666676686696706716726736746756766776786796806816826836846856866876886896906916926936946956966976986997007017027037047057067077087097107117127137147157167177187197207217227237247257267277287297307317327337347357367377387397407417427437447457467477487497507517527537547557567577587597607617627637647657667677687697707717727737747757767777787797807817827837847857867877887897907917927937947957967977987998008018028038048058068078088098108118128138148158168178188198208218228238248258268278288298308318328338348358368378388398408418428438448458468478488498508518528538548558568578588598608618628638648658668678688698708718728738748758768778788798808818828838848858868878888898908918928938948958968978988999009019029039049059069079089099109119129139149159169179189199209219229239249259269279289299309319329339349359369379389399409419429439449459469479489499509519529539549559569579589599609619629639649659669679689699709719729739749759769779789799809819829839849859869879889899909919929939949959969979989991000100110021003100410051006100710081009101010111012101310141015101610171018101910201021102210231024102510261027102810291030103110321033103410351036103710381039104010411042104310441045104610471048104910501051105210531054105510561057105810591060106110621063106410651066106710681069107010711072107310741075107610771078107910801081108210831084108510861087108810891090109110921093109410951096109710981099110011011102110311041105110611071108110911101111111211131114111511161117111811191120112111221123112411251126112711281129113011311132113311341135113611371138113911401141114211431144114511461147114811491150115111521153115411551156115711581159116011611162116311641165116611671168116911701171117211731174117511761177117811791180118111821183118411851186118711881189119011911192119311941195119611971198119912001201120212031204120512061207120812091210121112121213121412151216121712181219122012211222122312241225122612271228122912301231123212331234123512361237123812391240124112421243124412451246124712481249125012511252125312541255125612571258125912601261126212631264126512661267126812691270127112721273127412751276127712781279128012811282128312841285128612871288128912901291129212931294129512961297129812991300
  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-2014 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. const char *GDFunctions::get_func_name(Function p_func) {
  37. ERR_FAIL_INDEX_V(p_func,FUNC_MAX,"");
  38. static const char *_names[FUNC_MAX]={
  39. "sin",
  40. "cos",
  41. "tan",
  42. "sinh",
  43. "cosh",
  44. "tanh",
  45. "asin",
  46. "acos",
  47. "atan",
  48. "atan2",
  49. "sqrt",
  50. "fmod",
  51. "fposmod",
  52. "floor",
  53. "ceil",
  54. "round",
  55. "abs",
  56. "sign",
  57. "pow",
  58. "log",
  59. "exp",
  60. "is_nan",
  61. "is_inf",
  62. "ease",
  63. "decimals",
  64. "stepify",
  65. "lerp",
  66. "dectime",
  67. "randomize",
  68. "randi",
  69. "randf",
  70. "rand_range",
  71. "rand_seed",
  72. "deg2rad",
  73. "rad2deg",
  74. "linear2db",
  75. "db2linear",
  76. "max",
  77. "min",
  78. "clamp",
  79. "nearest_po2",
  80. "weakref",
  81. "funcref",
  82. "convert",
  83. "typeof",
  84. "str",
  85. "print",
  86. "printt",
  87. "printerr",
  88. "printraw",
  89. "var2str",
  90. "str2var",
  91. "range",
  92. "load",
  93. "inst2dict",
  94. "dict2inst",
  95. "hash",
  96. "print_stack",
  97. };
  98. return _names[p_func];
  99. }
  100. void GDFunctions::call(Function p_func,const Variant **p_args,int p_arg_count,Variant &r_ret,Variant::CallError &r_error) {
  101. r_error.error=Variant::CallError::CALL_OK;
  102. #ifdef DEBUG_ENABLED
  103. #define VALIDATE_ARG_COUNT(m_count) \
  104. if (p_arg_count<m_count) {\
  105. r_error.error=Variant::CallError::CALL_ERROR_TOO_FEW_ARGUMENTS;\
  106. r_error.argument=m_count;\
  107. return;\
  108. }\
  109. if (p_arg_count>m_count) {\
  110. r_error.error=Variant::CallError::CALL_ERROR_TOO_MANY_ARGUMENTS;\
  111. r_error.argument=m_count;\
  112. return;\
  113. }
  114. #define VALIDATE_ARG_NUM(m_arg) \
  115. if (!p_args[m_arg]->is_num()) {\
  116. r_error.error=Variant::CallError::CALL_ERROR_INVALID_ARGUMENT;\
  117. r_error.argument=m_arg;\
  118. r_error.expected=Variant::REAL;\
  119. return;\
  120. }
  121. #else
  122. #define VALIDATE_ARG_COUNT(m_count)
  123. #define VALIDATE_ARG_NUM(m_arg)
  124. #endif
  125. //using a switch, so the compiler generates a jumptable
  126. switch(p_func) {
  127. case MATH_SIN: {
  128. VALIDATE_ARG_COUNT(1);
  129. VALIDATE_ARG_NUM(0);
  130. r_ret=Math::sin(*p_args[0]);
  131. } break;
  132. case MATH_COS: {
  133. VALIDATE_ARG_COUNT(1);
  134. VALIDATE_ARG_NUM(0);
  135. r_ret=Math::cos(*p_args[0]);
  136. } break;
  137. case MATH_TAN: {
  138. VALIDATE_ARG_COUNT(1);
  139. VALIDATE_ARG_NUM(0);
  140. r_ret=Math::tan(*p_args[0]);
  141. } break;
  142. case MATH_SINH: {
  143. VALIDATE_ARG_COUNT(1);
  144. VALIDATE_ARG_NUM(0);
  145. r_ret=Math::sinh(*p_args[0]);
  146. } break;
  147. case MATH_COSH: {
  148. VALIDATE_ARG_COUNT(1);
  149. VALIDATE_ARG_NUM(0);
  150. r_ret=Math::cosh(*p_args[0]);
  151. } break;
  152. case MATH_TANH: {
  153. VALIDATE_ARG_COUNT(1);
  154. VALIDATE_ARG_NUM(0);
  155. r_ret=Math::tanh(*p_args[0]);
  156. } break;
  157. case MATH_ASIN: {
  158. VALIDATE_ARG_COUNT(1);
  159. VALIDATE_ARG_NUM(0);
  160. r_ret=Math::asin(*p_args[0]);
  161. } break;
  162. case MATH_ACOS: {
  163. VALIDATE_ARG_COUNT(1);
  164. VALIDATE_ARG_NUM(0);
  165. r_ret=Math::acos(*p_args[0]);
  166. } break;
  167. case MATH_ATAN: {
  168. VALIDATE_ARG_COUNT(1);
  169. VALIDATE_ARG_NUM(0);
  170. r_ret=Math::atan(*p_args[0]);
  171. } break;
  172. case MATH_ATAN2: {
  173. VALIDATE_ARG_COUNT(2);
  174. VALIDATE_ARG_NUM(0);
  175. VALIDATE_ARG_NUM(1);
  176. r_ret=Math::atan2(*p_args[0],*p_args[1]);
  177. } break;
  178. case MATH_SQRT: {
  179. VALIDATE_ARG_COUNT(1);
  180. VALIDATE_ARG_NUM(0);
  181. r_ret=Math::sqrt(*p_args[0]);
  182. } break;
  183. case MATH_FMOD: {
  184. VALIDATE_ARG_COUNT(2);
  185. VALIDATE_ARG_NUM(0);
  186. VALIDATE_ARG_NUM(1);
  187. r_ret=Math::fmod(*p_args[0],*p_args[1]);
  188. } break;
  189. case MATH_FPOSMOD: {
  190. VALIDATE_ARG_COUNT(2);
  191. VALIDATE_ARG_NUM(0);
  192. VALIDATE_ARG_NUM(1);
  193. r_ret=Math::fposmod(*p_args[0],*p_args[1]);
  194. } break;
  195. case MATH_FLOOR: {
  196. VALIDATE_ARG_COUNT(1);
  197. VALIDATE_ARG_NUM(0);
  198. r_ret=Math::floor(*p_args[0]);
  199. } break;
  200. case MATH_CEIL: {
  201. VALIDATE_ARG_COUNT(1);
  202. VALIDATE_ARG_NUM(0);
  203. r_ret=Math::ceil(*p_args[0]);
  204. } break;
  205. case MATH_ROUND: {
  206. VALIDATE_ARG_COUNT(1);
  207. VALIDATE_ARG_NUM(0);
  208. r_ret=Math::round(*p_args[0]);
  209. } break;
  210. case MATH_ABS: {
  211. VALIDATE_ARG_COUNT(1);
  212. if (p_args[0]->get_type()==Variant::INT) {
  213. int64_t i = *p_args[0];
  214. r_ret=ABS(i);
  215. } else if (p_args[0]->get_type()==Variant::REAL) {
  216. real_t r = *p_args[0];
  217. r_ret=Math::abs(r);
  218. } else {
  219. r_error.error=Variant::CallError::CALL_ERROR_INVALID_ARGUMENT;
  220. r_error.argument=0;
  221. r_error.expected=Variant::REAL;
  222. }
  223. } break;
  224. case MATH_SIGN: {
  225. VALIDATE_ARG_COUNT(1);
  226. if (p_args[0]->get_type()==Variant::INT) {
  227. int64_t i = *p_args[0];
  228. r_ret= i < 0 ? -1 : ( i > 0 ? +1 : 0);
  229. } else if (p_args[0]->get_type()==Variant::REAL) {
  230. real_t r = *p_args[0];
  231. r_ret= r < 0.0 ? -1.0 : ( r > 0.0 ? +1.0 : 0.0);
  232. } else {
  233. r_error.error=Variant::CallError::CALL_ERROR_INVALID_ARGUMENT;
  234. r_error.argument=0;
  235. r_error.expected=Variant::REAL;
  236. }
  237. } break;
  238. case MATH_POW: {
  239. VALIDATE_ARG_COUNT(2);
  240. VALIDATE_ARG_NUM(0);
  241. VALIDATE_ARG_NUM(1);
  242. r_ret=Math::pow(*p_args[0],*p_args[1]);
  243. } break;
  244. case MATH_LOG: {
  245. VALIDATE_ARG_COUNT(1);
  246. VALIDATE_ARG_NUM(0);
  247. r_ret=Math::log(*p_args[0]);
  248. } break;
  249. case MATH_EXP: {
  250. VALIDATE_ARG_COUNT(1);
  251. VALIDATE_ARG_NUM(0);
  252. r_ret=Math::exp(*p_args[0]);
  253. } break;
  254. case MATH_ISNAN: {
  255. VALIDATE_ARG_COUNT(1);
  256. VALIDATE_ARG_NUM(0);
  257. r_ret=Math::is_nan(*p_args[0]);
  258. } break;
  259. case MATH_ISINF: {
  260. VALIDATE_ARG_COUNT(1);
  261. VALIDATE_ARG_NUM(0);
  262. r_ret=Math::is_inf(*p_args[0]);
  263. } break;
  264. case MATH_EASE: {
  265. VALIDATE_ARG_COUNT(2);
  266. VALIDATE_ARG_NUM(0);
  267. VALIDATE_ARG_NUM(1);
  268. r_ret=Math::ease(*p_args[0],*p_args[1]);
  269. } break;
  270. case MATH_DECIMALS: {
  271. VALIDATE_ARG_COUNT(1);
  272. VALIDATE_ARG_NUM(0);
  273. r_ret=Math::decimals(*p_args[0]);
  274. } break;
  275. case MATH_STEPIFY: {
  276. VALIDATE_ARG_COUNT(2);
  277. VALIDATE_ARG_NUM(0);
  278. VALIDATE_ARG_NUM(1);
  279. r_ret=Math::stepify(*p_args[0],*p_args[1]);
  280. } break;
  281. case MATH_LERP: {
  282. VALIDATE_ARG_COUNT(3);
  283. VALIDATE_ARG_NUM(0);
  284. VALIDATE_ARG_NUM(1);
  285. VALIDATE_ARG_NUM(2);
  286. r_ret=Math::lerp(*p_args[0],*p_args[1],*p_args[2]);
  287. } break;
  288. case MATH_DECTIME: {
  289. VALIDATE_ARG_COUNT(3);
  290. VALIDATE_ARG_NUM(0);
  291. VALIDATE_ARG_NUM(1);
  292. VALIDATE_ARG_NUM(2);
  293. r_ret=Math::dectime(*p_args[0],*p_args[1],*p_args[2]);
  294. } break;
  295. case MATH_RANDOMIZE: {
  296. Math::randomize();
  297. r_ret=Variant();
  298. } break;
  299. case MATH_RAND: {
  300. r_ret=Math::rand();
  301. } break;
  302. case MATH_RANDF: {
  303. r_ret=Math::randf();
  304. } break;
  305. case MATH_RANDOM: {
  306. VALIDATE_ARG_COUNT(2);
  307. VALIDATE_ARG_NUM(0);
  308. VALIDATE_ARG_NUM(1);
  309. r_ret=Math::random(*p_args[0],*p_args[1]);
  310. } break;
  311. case MATH_RANDSEED: {
  312. VALIDATE_ARG_COUNT(1);
  313. VALIDATE_ARG_NUM(0);
  314. uint32_t seed=*p_args[0];
  315. int ret = Math::rand_from_seed(&seed);
  316. Array reta;
  317. reta.push_back(ret);
  318. reta.push_back(seed);
  319. r_ret=reta;
  320. } break;
  321. case MATH_DEG2RAD: {
  322. VALIDATE_ARG_COUNT(1);
  323. VALIDATE_ARG_NUM(0);
  324. r_ret=Math::deg2rad(*p_args[0]);
  325. } break;
  326. case MATH_RAD2DEG: {
  327. VALIDATE_ARG_COUNT(1);
  328. VALIDATE_ARG_NUM(0);
  329. r_ret=Math::rad2deg(*p_args[0]);
  330. } break;
  331. case MATH_LINEAR2DB: {
  332. VALIDATE_ARG_COUNT(1);
  333. VALIDATE_ARG_NUM(0);
  334. r_ret=Math::linear2db(*p_args[0]);
  335. } break;
  336. case MATH_DB2LINEAR: {
  337. VALIDATE_ARG_COUNT(1);
  338. VALIDATE_ARG_NUM(0);
  339. r_ret=Math::db2linear(*p_args[0]);
  340. } break;
  341. case LOGIC_MAX: {
  342. VALIDATE_ARG_COUNT(2);
  343. if (p_args[0]->get_type()==Variant::INT && p_args[1]->get_type()==Variant::INT) {
  344. int64_t a = *p_args[0];
  345. int64_t b = *p_args[1];
  346. r_ret=MAX(a,b);
  347. } else {
  348. VALIDATE_ARG_NUM(0);
  349. VALIDATE_ARG_NUM(1);
  350. real_t a = *p_args[0];
  351. real_t b = *p_args[1];
  352. r_ret=MAX(a,b);
  353. }
  354. } break;
  355. case LOGIC_MIN: {
  356. VALIDATE_ARG_COUNT(2);
  357. if (p_args[0]->get_type()==Variant::INT && p_args[1]->get_type()==Variant::INT) {
  358. int64_t a = *p_args[0];
  359. int64_t b = *p_args[1];
  360. r_ret=MIN(a,b);
  361. } else {
  362. VALIDATE_ARG_NUM(0);
  363. VALIDATE_ARG_NUM(1);
  364. real_t a = *p_args[0];
  365. real_t b = *p_args[1];
  366. r_ret=MIN(a,b);
  367. }
  368. } break;
  369. case LOGIC_CLAMP: {
  370. VALIDATE_ARG_COUNT(3);
  371. if (p_args[0]->get_type()==Variant::INT && p_args[1]->get_type()==Variant::INT && p_args[2]->get_type()==Variant::INT) {
  372. int64_t a = *p_args[0];
  373. int64_t b = *p_args[1];
  374. int64_t c = *p_args[2];
  375. r_ret=CLAMP(a,b,c);
  376. } else {
  377. VALIDATE_ARG_NUM(0);
  378. VALIDATE_ARG_NUM(1);
  379. VALIDATE_ARG_NUM(2);
  380. real_t a = *p_args[0];
  381. real_t b = *p_args[1];
  382. real_t c = *p_args[2];
  383. r_ret=CLAMP(a,b,c);
  384. }
  385. } break;
  386. case LOGIC_NEAREST_PO2: {
  387. VALIDATE_ARG_COUNT(1);
  388. VALIDATE_ARG_NUM(0);
  389. int64_t num = *p_args[0];
  390. r_ret = nearest_power_of_2(num);
  391. } break;
  392. case OBJ_WEAKREF: {
  393. VALIDATE_ARG_COUNT(1);
  394. if (p_args[0]->get_type()!=Variant::OBJECT) {
  395. r_error.error=Variant::CallError::CALL_ERROR_INVALID_ARGUMENT;
  396. r_error.argument=0;
  397. r_error.expected=Variant::OBJECT;
  398. return;
  399. }
  400. if (p_args[0]->is_ref()) {
  401. REF r = *p_args[0];
  402. if (!r.is_valid()) {
  403. r_ret=Variant();
  404. return;
  405. }
  406. Ref<WeakRef> wref = memnew( WeakRef );
  407. wref->set_ref(r);
  408. r_ret=wref;
  409. } else {
  410. Object *obj = *p_args[0];
  411. if (!obj) {
  412. r_ret=Variant();
  413. return;
  414. }
  415. Ref<WeakRef> wref = memnew( WeakRef );
  416. wref->set_obj(obj);
  417. r_ret=wref;
  418. }
  419. } break;
  420. case FUNC_FUNCREF: {
  421. VALIDATE_ARG_COUNT(2);
  422. if (p_args[0]->get_type()!=Variant::OBJECT) {
  423. r_error.error=Variant::CallError::CALL_ERROR_INVALID_ARGUMENT;
  424. r_error.argument=0;
  425. r_error.expected=Variant::OBJECT;
  426. r_ret=Variant();
  427. return;
  428. }
  429. if (p_args[1]->get_type()!=Variant::STRING && p_args[1]->get_type()!=Variant::NODE_PATH) {
  430. r_error.error=Variant::CallError::CALL_ERROR_INVALID_ARGUMENT;
  431. r_error.argument=1;
  432. r_error.expected=Variant::STRING;
  433. r_ret=Variant();
  434. return;
  435. }
  436. Ref<FuncRef> fr = memnew( FuncRef);
  437. Object *obj = *p_args[0];
  438. fr->set_instance(*p_args[0]);
  439. fr->set_function(*p_args[1]);
  440. r_ret=fr;
  441. } break;
  442. case TYPE_CONVERT: {
  443. VALIDATE_ARG_COUNT(2);
  444. VALIDATE_ARG_NUM(1);
  445. int type=*p_args[1];
  446. if (type<0 || type>=Variant::VARIANT_MAX) {
  447. ERR_PRINT("Invalid type argument to convert()");
  448. r_ret=Variant::NIL;
  449. } else {
  450. r_ret=Variant::construct(Variant::Type(type),p_args,1,r_error);
  451. }
  452. } break;
  453. case TYPE_OF: {
  454. VALIDATE_ARG_COUNT(1);
  455. r_ret = p_args[0]->get_type();
  456. } break;
  457. case TEXT_STR: {
  458. String str;
  459. for(int i=0;i<p_arg_count;i++) {
  460. String os = p_args[i]->operator String();;
  461. if (i==0)
  462. str=os;
  463. else
  464. str+=os;
  465. }
  466. r_ret=str;
  467. } break;
  468. case TEXT_PRINT: {
  469. String str;
  470. for(int i=0;i<p_arg_count;i++) {
  471. str+=p_args[i]->operator String();
  472. }
  473. //str+="\n";
  474. print_line(str);
  475. r_ret=Variant();
  476. } break;
  477. case TEXT_PRINT_TABBED: {
  478. String str;
  479. for(int i=0;i<p_arg_count;i++) {
  480. if (i)
  481. str+="\t";
  482. str+=p_args[i]->operator String();
  483. }
  484. //str+="\n";
  485. print_line(str);
  486. r_ret=Variant();
  487. } break;
  488. case TEXT_PRINTERR: {
  489. String str;
  490. for(int i=0;i<p_arg_count;i++) {
  491. str+=p_args[i]->operator String();
  492. }
  493. //str+="\n";
  494. OS::get_singleton()->printerr("%s\n",str.utf8().get_data());
  495. r_ret=Variant();
  496. } break;
  497. case TEXT_PRINTRAW: {
  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. OS::get_singleton()->print("%s\n",str.utf8().get_data());
  504. r_ret=Variant();
  505. } break;
  506. case VAR_TO_STR: {
  507. VALIDATE_ARG_COUNT(1);
  508. r_ret=p_args[0]->get_construct_string();
  509. } break;
  510. case STR_TO_VAR: {
  511. VALIDATE_ARG_COUNT(1);
  512. if (p_args[0]->get_type()!=Variant::STRING) {
  513. r_error.error=Variant::CallError::CALL_ERROR_INVALID_ARGUMENT;
  514. r_error.argument=0;
  515. r_error.expected=Variant::STRING;
  516. r_ret=Variant();
  517. return;
  518. }
  519. Variant::construct_from_string(*p_args[0],r_ret);
  520. } break;
  521. case GEN_RANGE: {
  522. switch(p_arg_count) {
  523. case 0: {
  524. r_error.error=Variant::CallError::CALL_ERROR_TOO_FEW_ARGUMENTS;
  525. r_error.argument=1;
  526. } break;
  527. case 1: {
  528. VALIDATE_ARG_NUM(0);
  529. int count=*p_args[0];
  530. Array arr(true);
  531. if (count<=0) {
  532. r_ret=arr;
  533. return;
  534. }
  535. Error err = arr.resize(count);
  536. if (err!=OK) {
  537. r_error.error=Variant::CallError::CALL_ERROR_INVALID_METHOD;
  538. r_ret=Variant();
  539. return;
  540. }
  541. for(int i=0;i<count;i++) {
  542. arr[i]=i;
  543. }
  544. r_ret=arr;
  545. } break;
  546. case 2: {
  547. VALIDATE_ARG_NUM(0);
  548. VALIDATE_ARG_NUM(1);
  549. int from=*p_args[0];
  550. int to=*p_args[1];
  551. Array arr(true);
  552. if (from>=to) {
  553. r_ret=arr;
  554. return;
  555. }
  556. Error err = arr.resize(to-from);
  557. if (err!=OK) {
  558. r_error.error=Variant::CallError::CALL_ERROR_INVALID_METHOD;
  559. r_ret=Variant();
  560. return;
  561. }
  562. for(int i=from;i<to;i++)
  563. arr[i-from]=i;
  564. r_ret=arr;
  565. } break;
  566. case 3: {
  567. VALIDATE_ARG_NUM(0);
  568. VALIDATE_ARG_NUM(1);
  569. VALIDATE_ARG_NUM(2);
  570. int from=*p_args[0];
  571. int to=*p_args[1];
  572. int incr=*p_args[2];
  573. if (incr==0) {
  574. ERR_EXPLAIN("step argument is zero!");
  575. r_error.error=Variant::CallError::CALL_ERROR_INVALID_METHOD;
  576. ERR_FAIL();
  577. }
  578. Array arr(true);
  579. if (from>=to && incr>0) {
  580. r_ret=arr;
  581. return;
  582. }
  583. if (from<=to && incr<0) {
  584. r_ret=arr;
  585. return;
  586. }
  587. //calculate how many
  588. int count=0;
  589. if (incr>0) {
  590. count=((to-from-1)/incr)+1;
  591. } else {
  592. count=((from-to-1)/-incr)+1;
  593. }
  594. Error err = arr.resize(count);
  595. if (err!=OK) {
  596. r_error.error=Variant::CallError::CALL_ERROR_INVALID_METHOD;
  597. r_ret=Variant();
  598. return;
  599. }
  600. if (incr>0) {
  601. int idx=0;
  602. for(int i=from;i<to;i+=incr) {
  603. arr[idx++]=i;
  604. }
  605. } else {
  606. int idx=0;
  607. for(int i=from;i>to;i+=incr) {
  608. arr[idx++]=i;
  609. }
  610. }
  611. r_ret=arr;
  612. } break;
  613. default: {
  614. r_error.error=Variant::CallError::CALL_ERROR_TOO_MANY_ARGUMENTS;
  615. r_error.argument=3;
  616. } break;
  617. }
  618. } break;
  619. case RESOURCE_LOAD: {
  620. VALIDATE_ARG_COUNT(1);
  621. if (p_args[0]->get_type()!=Variant::STRING) {
  622. r_error.error=Variant::CallError::CALL_ERROR_INVALID_ARGUMENT;
  623. r_error.argument=0;
  624. r_ret=Variant();
  625. }
  626. r_ret=ResourceLoader::load(*p_args[0]);
  627. } break;
  628. case INST2DICT: {
  629. VALIDATE_ARG_COUNT(1);
  630. if (p_args[0]->get_type()==Variant::NIL) {
  631. r_ret=Variant();
  632. } else if (p_args[0]->get_type()!=Variant::OBJECT) {
  633. r_error.error=Variant::CallError::CALL_ERROR_INVALID_ARGUMENT;
  634. r_error.argument=0;
  635. r_ret=Variant();
  636. } else {
  637. Object *obj = *p_args[0];
  638. if (!obj) {
  639. r_ret=Variant();
  640. } else if (!obj->get_script_instance() || obj->get_script_instance()->get_language()!=GDScriptLanguage::get_singleton()) {
  641. r_error.error=Variant::CallError::CALL_ERROR_INVALID_ARGUMENT;
  642. r_error.argument=0;
  643. r_error.expected=Variant::DICTIONARY;
  644. ERR_PRINT("Not a script with an instance");
  645. } else {
  646. GDInstance *ins = static_cast<GDInstance*>(obj->get_script_instance());
  647. Ref<GDScript> base = ins->get_script();
  648. if (base.is_null()) {
  649. r_error.error=Variant::CallError::CALL_ERROR_INVALID_ARGUMENT;
  650. r_error.argument=0;
  651. r_error.expected=Variant::DICTIONARY;
  652. ERR_PRINT("Not based on a script");
  653. return;
  654. }
  655. GDScript *p = base.ptr();
  656. Vector<StringName> sname;
  657. while(p->_owner) {
  658. sname.push_back(p->name);
  659. p=p->_owner;
  660. }
  661. sname.invert();
  662. if (!p->path.is_resource_file()) {
  663. r_error.error=Variant::CallError::CALL_ERROR_INVALID_ARGUMENT;
  664. r_error.argument=0;
  665. r_error.expected=Variant::DICTIONARY;
  666. print_line("PATH: "+p->path);
  667. ERR_PRINT("Not based on a resource file");
  668. return;
  669. }
  670. NodePath cp(sname,Vector<StringName>(),false);
  671. Dictionary d(true);
  672. d["@subpath"]=cp;
  673. d["@path"]=p->path;
  674. p = base.ptr();
  675. while(p) {
  676. for(Set<StringName>::Element *E=p->members.front();E;E=E->next()) {
  677. Variant value;
  678. if (ins->get(E->get(),value)) {
  679. String k = E->get();
  680. if (!d.has(k)) {
  681. d[k]=value;
  682. }
  683. }
  684. }
  685. p=p->_base;
  686. }
  687. r_ret=d;
  688. }
  689. }
  690. } break;
  691. case DICT2INST: {
  692. VALIDATE_ARG_COUNT(1);
  693. if (p_args[0]->get_type()!=Variant::DICTIONARY) {
  694. r_error.error=Variant::CallError::CALL_ERROR_INVALID_ARGUMENT;
  695. r_error.argument=0;
  696. r_error.expected=Variant::DICTIONARY;
  697. return;
  698. }
  699. Dictionary d = *p_args[0];
  700. if (!d.has("@path")) {
  701. r_error.error=Variant::CallError::CALL_ERROR_INVALID_ARGUMENT;
  702. r_error.argument=0;
  703. r_error.expected=Variant::OBJECT;
  704. return;
  705. }
  706. Ref<Script> scr = ResourceLoader::load(d["@path"]);
  707. if (!scr.is_valid()) {
  708. r_error.error=Variant::CallError::CALL_ERROR_INVALID_ARGUMENT;
  709. r_error.argument=0;
  710. r_error.expected=Variant::OBJECT;
  711. return;
  712. }
  713. Ref<GDScript> gdscr = scr;
  714. if (!gdscr.is_valid()) {
  715. r_error.error=Variant::CallError::CALL_ERROR_INVALID_ARGUMENT;
  716. r_error.argument=0;
  717. r_error.expected=Variant::OBJECT;
  718. return;
  719. }
  720. NodePath sub;
  721. if (d.has("@subpath")) {
  722. sub=d["@subpath"];
  723. }
  724. for(int i=0;i<sub.get_name_count();i++) {
  725. gdscr = gdscr->subclasses[ sub.get_name(i)];
  726. if (!gdscr.is_valid()) {
  727. r_error.error=Variant::CallError::CALL_ERROR_INVALID_ARGUMENT;
  728. r_error.argument=0;
  729. r_error.expected=Variant::OBJECT;
  730. return;
  731. }
  732. }
  733. r_ret = gdscr->_new(NULL,0,r_error);
  734. } break;
  735. case HASH: {
  736. VALIDATE_ARG_COUNT(1);
  737. r_ret=p_args[0]->hash();
  738. } break;
  739. case PRINT_STACK: {
  740. ScriptLanguage* script = GDScriptLanguage::get_singleton();
  741. for (int i=0; i < script->debug_get_stack_level_count(); i++) {
  742. 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)+"'");
  743. };
  744. } break;
  745. case FUNC_MAX: {
  746. ERR_FAIL_V();
  747. } break;
  748. }
  749. }
  750. bool GDFunctions::is_deterministic(Function p_func) {
  751. //man i couldn't have chosen a worse function name,
  752. //way too controversial..
  753. switch(p_func) {
  754. case MATH_SIN:
  755. case MATH_COS:
  756. case MATH_TAN:
  757. case MATH_SINH:
  758. case MATH_COSH:
  759. case MATH_TANH:
  760. case MATH_ASIN:
  761. case MATH_ACOS:
  762. case MATH_ATAN:
  763. case MATH_ATAN2:
  764. case MATH_SQRT:
  765. case MATH_FMOD:
  766. case MATH_FPOSMOD:
  767. case MATH_FLOOR:
  768. case MATH_CEIL:
  769. case MATH_ROUND:
  770. case MATH_ABS:
  771. case MATH_SIGN:
  772. case MATH_POW:
  773. case MATH_LOG:
  774. case MATH_EXP:
  775. case MATH_ISNAN:
  776. case MATH_ISINF:
  777. case MATH_EASE:
  778. case MATH_DECIMALS:
  779. case MATH_STEPIFY:
  780. case MATH_LERP:
  781. case MATH_DECTIME:
  782. case MATH_DEG2RAD:
  783. case MATH_RAD2DEG:
  784. case MATH_LINEAR2DB:
  785. case MATH_DB2LINEAR:
  786. case LOGIC_MAX:
  787. case LOGIC_MIN:
  788. case LOGIC_CLAMP:
  789. case LOGIC_NEAREST_PO2:
  790. case TYPE_CONVERT:
  791. case TYPE_OF:
  792. case TEXT_STR:
  793. // enable for debug only, otherwise not desirable - case GEN_RANGE:
  794. return true;
  795. default:
  796. return false;
  797. }
  798. return false;
  799. }
  800. MethodInfo GDFunctions::get_info(Function p_func) {
  801. #ifdef TOOLS_ENABLED
  802. //using a switch, so the compiler generates a jumptable
  803. switch(p_func) {
  804. case MATH_SIN: {
  805. MethodInfo mi("sin",PropertyInfo(Variant::REAL,"s"));
  806. mi.return_val.type=Variant::REAL;
  807. return mi;
  808. } break;
  809. case MATH_COS: {
  810. MethodInfo mi("cos",PropertyInfo(Variant::REAL,"s"));
  811. mi.return_val.type=Variant::REAL;
  812. return mi;
  813. } break;
  814. case MATH_TAN: {
  815. MethodInfo mi("tan",PropertyInfo(Variant::REAL,"s"));
  816. mi.return_val.type=Variant::REAL;
  817. return mi;
  818. } break;
  819. case MATH_SINH: {
  820. MethodInfo mi("sinh",PropertyInfo(Variant::REAL,"s"));
  821. mi.return_val.type=Variant::REAL;
  822. return mi;
  823. } break;
  824. case MATH_COSH: {
  825. MethodInfo mi("cosh",PropertyInfo(Variant::REAL,"s"));
  826. mi.return_val.type=Variant::REAL;
  827. return mi;
  828. } break;
  829. case MATH_TANH: {
  830. MethodInfo mi("tanh",PropertyInfo(Variant::REAL,"s"));
  831. mi.return_val.type=Variant::REAL;
  832. return mi;
  833. } break;
  834. case MATH_ASIN: {
  835. MethodInfo mi("asin",PropertyInfo(Variant::REAL,"s"));
  836. mi.return_val.type=Variant::REAL;
  837. return mi;
  838. } break;
  839. case MATH_ACOS: {
  840. MethodInfo mi("acos",PropertyInfo(Variant::REAL,"s"));
  841. mi.return_val.type=Variant::REAL;
  842. return mi;
  843. } break;
  844. case MATH_ATAN: {
  845. MethodInfo mi("atan",PropertyInfo(Variant::REAL,"s"));
  846. mi.return_val.type=Variant::REAL;
  847. return mi;
  848. } break;
  849. case MATH_ATAN2: {
  850. MethodInfo mi("atan2",PropertyInfo(Variant::REAL,"x"),PropertyInfo(Variant::REAL,"y"));
  851. mi.return_val.type=Variant::REAL;
  852. return mi;
  853. } break;
  854. case MATH_SQRT: {
  855. MethodInfo mi("sqrt",PropertyInfo(Variant::REAL,"s"));
  856. mi.return_val.type=Variant::REAL;
  857. return mi;
  858. } break;
  859. case MATH_FMOD: {
  860. MethodInfo mi("fmod",PropertyInfo(Variant::REAL,"x"),PropertyInfo(Variant::REAL,"y"));
  861. mi.return_val.type=Variant::REAL;
  862. return mi;
  863. } break;
  864. case MATH_FPOSMOD: {
  865. MethodInfo mi("fposmod",PropertyInfo(Variant::REAL,"x"),PropertyInfo(Variant::REAL,"y"));
  866. mi.return_val.type=Variant::REAL;
  867. return mi;
  868. } break;
  869. case MATH_FLOOR: {
  870. MethodInfo mi("floor",PropertyInfo(Variant::REAL,"s"));
  871. mi.return_val.type=Variant::REAL;
  872. return mi;
  873. } break;
  874. case MATH_CEIL: {
  875. MethodInfo mi("ceil",PropertyInfo(Variant::REAL,"s"));
  876. mi.return_val.type=Variant::REAL;
  877. return mi;
  878. } break;
  879. case MATH_ROUND: {
  880. MethodInfo mi("round",PropertyInfo(Variant::REAL,"s"));
  881. mi.return_val.type=Variant::REAL;
  882. return mi;
  883. } break;
  884. case MATH_ABS: {
  885. MethodInfo mi("abs",PropertyInfo(Variant::REAL,"s"));
  886. mi.return_val.type=Variant::REAL;
  887. return mi;
  888. } break;
  889. case MATH_SIGN: {
  890. MethodInfo mi("sign",PropertyInfo(Variant::REAL,"s"));
  891. mi.return_val.type=Variant::REAL;
  892. return mi;
  893. } break;
  894. case MATH_POW: {
  895. MethodInfo mi("pow",PropertyInfo(Variant::REAL,"x"),PropertyInfo(Variant::REAL,"y"));
  896. mi.return_val.type=Variant::REAL;
  897. return mi;
  898. } break;
  899. case MATH_LOG: {
  900. MethodInfo mi("log",PropertyInfo(Variant::REAL,"s"));
  901. mi.return_val.type=Variant::REAL;
  902. return mi;
  903. } break;
  904. case MATH_EXP: {
  905. MethodInfo mi("exp",PropertyInfo(Variant::REAL,"s"));
  906. mi.return_val.type=Variant::REAL;
  907. return mi;
  908. } break;
  909. case MATH_ISNAN: {
  910. MethodInfo mi("isnan",PropertyInfo(Variant::REAL,"s"));
  911. mi.return_val.type=Variant::REAL;
  912. return mi;
  913. } break;
  914. case MATH_ISINF: {
  915. MethodInfo mi("isinf",PropertyInfo(Variant::REAL,"s"));
  916. mi.return_val.type=Variant::REAL;
  917. return mi;
  918. } break;
  919. case MATH_EASE: {
  920. MethodInfo mi("ease",PropertyInfo(Variant::REAL,"s"),PropertyInfo(Variant::REAL,"curve"));
  921. mi.return_val.type=Variant::REAL;
  922. return mi;
  923. } break;
  924. case MATH_DECIMALS: {
  925. MethodInfo mi("decimals",PropertyInfo(Variant::REAL,"step"));
  926. mi.return_val.type=Variant::REAL;
  927. return mi;
  928. } break;
  929. case MATH_STEPIFY: {
  930. MethodInfo mi("stepify",PropertyInfo(Variant::REAL,"s"),PropertyInfo(Variant::REAL,"step"));
  931. mi.return_val.type=Variant::REAL;
  932. return mi;
  933. } break;
  934. case MATH_LERP: {
  935. MethodInfo mi("lerp",PropertyInfo(Variant::REAL,"a"),PropertyInfo(Variant::REAL,"b"), PropertyInfo(Variant::REAL,"c"));
  936. mi.return_val.type=Variant::REAL;
  937. return mi;
  938. } break;
  939. case MATH_DECTIME: {
  940. MethodInfo mi("dectime",PropertyInfo(Variant::REAL,"value"),PropertyInfo(Variant::REAL,"amount"),PropertyInfo(Variant::REAL,"step"));
  941. mi.return_val.type=Variant::REAL;
  942. return mi;
  943. } break;
  944. case MATH_RANDOMIZE: {
  945. MethodInfo mi("randomize");
  946. mi.return_val.type=Variant::NIL;
  947. return mi;
  948. } break;
  949. case MATH_RAND: {
  950. MethodInfo mi("randi");
  951. mi.return_val.type=Variant::INT;
  952. return mi;
  953. } break;
  954. case MATH_RANDF: {
  955. MethodInfo mi("randf");
  956. mi.return_val.type=Variant::REAL;
  957. return mi;
  958. } break;
  959. case MATH_RANDOM: {
  960. MethodInfo mi("rand_range",PropertyInfo(Variant::REAL,"from"),PropertyInfo(Variant::REAL,"to"));
  961. mi.return_val.type=Variant::REAL;
  962. return mi;
  963. } break;
  964. case MATH_RANDSEED: {
  965. MethodInfo mi("rand_seed",PropertyInfo(Variant::REAL,"seed"));
  966. mi.return_val.type=Variant::ARRAY;
  967. return mi;
  968. } break;
  969. case MATH_DEG2RAD: {
  970. MethodInfo mi("deg2rad",PropertyInfo(Variant::REAL,"deg"));
  971. mi.return_val.type=Variant::REAL;
  972. return mi;
  973. } break;
  974. case MATH_RAD2DEG: {
  975. MethodInfo mi("rad2deg",PropertyInfo(Variant::REAL,"rad"));
  976. mi.return_val.type=Variant::REAL;
  977. return mi;
  978. } break;
  979. case MATH_LINEAR2DB: {
  980. MethodInfo mi("linear2db",PropertyInfo(Variant::REAL,"nrg"));
  981. mi.return_val.type=Variant::REAL;
  982. return mi;
  983. } break;
  984. case MATH_DB2LINEAR: {
  985. MethodInfo mi("db2linear",PropertyInfo(Variant::REAL,"db"));
  986. mi.return_val.type=Variant::REAL;
  987. return mi;
  988. } break;
  989. case LOGIC_MAX: {
  990. MethodInfo mi("max",PropertyInfo(Variant::REAL,"a"),PropertyInfo(Variant::REAL,"b"));
  991. mi.return_val.type=Variant::REAL;
  992. return mi;
  993. } break;
  994. case LOGIC_MIN: {
  995. MethodInfo mi("min",PropertyInfo(Variant::REAL,"a"),PropertyInfo(Variant::REAL,"b"));
  996. mi.return_val.type=Variant::REAL;
  997. return mi;
  998. } break;
  999. case LOGIC_CLAMP: {
  1000. MethodInfo mi("clamp",PropertyInfo(Variant::REAL,"val"),PropertyInfo(Variant::REAL,"min"),PropertyInfo(Variant::REAL,"max"));
  1001. mi.return_val.type=Variant::REAL;
  1002. return mi;
  1003. } break;
  1004. case LOGIC_NEAREST_PO2: {
  1005. MethodInfo mi("nearest_po2",PropertyInfo(Variant::INT,"val"));
  1006. mi.return_val.type=Variant::INT;
  1007. return mi;
  1008. } break;
  1009. case OBJ_WEAKREF: {
  1010. MethodInfo mi("weakref",PropertyInfo(Variant::OBJECT,"obj"));
  1011. mi.return_val.type=Variant::OBJECT;
  1012. mi.return_val.name="WeakRef";
  1013. return mi;
  1014. } break;
  1015. case FUNC_FUNCREF: {
  1016. MethodInfo mi("funcref",PropertyInfo(Variant::OBJECT,"instance"),PropertyInfo(Variant::STRING,"funcname"));
  1017. mi.return_val.type=Variant::OBJECT;
  1018. mi.return_val.name="FuncRef";
  1019. return mi;
  1020. } break;
  1021. case TYPE_CONVERT: {
  1022. MethodInfo mi("convert",PropertyInfo(Variant::NIL,"what"),PropertyInfo(Variant::INT,"type"));
  1023. mi.return_val.type=Variant::OBJECT;
  1024. return mi;
  1025. } break;
  1026. case TYPE_OF: {
  1027. MethodInfo mi("typeof",PropertyInfo(Variant::NIL,"what"));
  1028. mi.return_val.type=Variant::INT;
  1029. };
  1030. case TEXT_STR: {
  1031. MethodInfo mi("str",PropertyInfo(Variant::NIL,"what"),PropertyInfo(Variant::NIL,"..."));
  1032. mi.return_val.type=Variant::STRING;
  1033. return mi;
  1034. } break;
  1035. case TEXT_PRINT: {
  1036. MethodInfo mi("print",PropertyInfo(Variant::NIL,"what"),PropertyInfo(Variant::NIL,"..."));
  1037. mi.return_val.type=Variant::NIL;
  1038. return mi;
  1039. } break;
  1040. case TEXT_PRINT_TABBED: {
  1041. MethodInfo mi("printt",PropertyInfo(Variant::NIL,"what"),PropertyInfo(Variant::NIL,"..."));
  1042. mi.return_val.type=Variant::NIL;
  1043. return mi;
  1044. } break;
  1045. case TEXT_PRINTERR: {
  1046. MethodInfo mi("printerr",PropertyInfo(Variant::NIL,"what"),PropertyInfo(Variant::NIL,"..."));
  1047. mi.return_val.type=Variant::NIL;
  1048. return mi;
  1049. } break;
  1050. case TEXT_PRINTRAW: {
  1051. MethodInfo mi("printraw",PropertyInfo(Variant::NIL,"what"),PropertyInfo(Variant::NIL,"..."));
  1052. mi.return_val.type=Variant::NIL;
  1053. return mi;
  1054. } break;
  1055. case VAR_TO_STR: {
  1056. MethodInfo mi("var2str",PropertyInfo(Variant::NIL,"var"));
  1057. mi.return_val.type=Variant::STRING;
  1058. return mi;
  1059. } break;
  1060. case STR_TO_VAR: {
  1061. MethodInfo mi("str2var:var",PropertyInfo(Variant::STRING,"string"));
  1062. mi.return_val.type=Variant::NIL;
  1063. return mi;
  1064. } break;
  1065. case GEN_RANGE: {
  1066. MethodInfo mi("range",PropertyInfo(Variant::NIL,"..."));
  1067. mi.return_val.type=Variant::ARRAY;
  1068. return mi;
  1069. } break;
  1070. case RESOURCE_LOAD: {
  1071. MethodInfo mi("load",PropertyInfo(Variant::STRING,"path"));
  1072. mi.return_val.type=Variant::OBJECT;
  1073. mi.return_val.name="Resource";
  1074. return mi;
  1075. } break;
  1076. case INST2DICT: {
  1077. MethodInfo mi("inst2dict",PropertyInfo(Variant::OBJECT,"inst"));
  1078. mi.return_val.type=Variant::DICTIONARY;
  1079. return mi;
  1080. } break;
  1081. case DICT2INST: {
  1082. MethodInfo mi("dict2inst",PropertyInfo(Variant::DICTIONARY,"dict"));
  1083. mi.return_val.type=Variant::OBJECT;
  1084. return mi;
  1085. } break;
  1086. case HASH: {
  1087. MethodInfo mi("hash",PropertyInfo(Variant::NIL,"var:var"));
  1088. mi.return_val.type=Variant::INT;
  1089. return mi;
  1090. } break;
  1091. case PRINT_STACK: {
  1092. MethodInfo mi("print_stack");
  1093. mi.return_val.type=Variant::NIL;
  1094. return mi;
  1095. } break;
  1096. case FUNC_MAX: {
  1097. ERR_FAIL_V(MethodInfo());
  1098. } break;
  1099. }
  1100. #endif
  1101. return MethodInfo();
  1102. }