gd_functions.cpp 31 KB

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