gd_functions.cpp 29 KB

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