gd_functions.cpp 36 KB

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