gd_functions.cpp 32 KB

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