JSAPI.cpp 13 KB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130131132133134135136137138139140141142143144145146147148149150151152153154155156157158159160161162163164165166167168169170171172173174175176177178179180181182183184185186187188189190191192193194195196197198199200201202203204205206207208209210211212213214215216217218219220221222223224225226227228229230231232233234235236237238239240241242243244245246247248249250251252253254255256257258259260261262263264265266267268269270271272273274275276277278279280281282283284285286287288289290291292293294295296297298299300301302303304305306307308309310311312313314315316317318319320321322323324325326327328329330331332333334335336337338339340341342343344345346347348349350351352353354355356357358359360361362363364365366367368369370371372373374375376377378379380381382383384385386387388389390391392393394395396397398399400401402403404405406407408409410411412413414415416417418419420421422423424425426427428429430431432433434435436437438439440441442443444445446447448449450451452453454455456457458459460461462463464465466467468469470471472473474475476477478479480481482483484485486487488489490491492493494495496497498499500501502503504505506507508509510511512513514515516517518519520
  1. // Copyright (c) 2014-2015, THUNDERBEAST GAMES LLC All rights reserved
  2. // Please see LICENSE.md in repository root for license information
  3. // https://github.com/AtomicGameEngine/AtomicGameEngine
  4. #include <Atomic/Core/Context.h>
  5. #include <Atomic/Resource/ResourceCache.h>
  6. #include "JSAPI.h"
  7. #include "JSVM.h"
  8. /*
  9. // script can new an instance
  10. // script can get an engine ptr back (which may be to a previously script new'd instance)
  11. // script should always get the same JS Object back which means a lookup table (strong ref)
  12. // we can look directly at the tval (exposed from duktape internals) to see if the reference count is 1
  13. // script owned
  14. // new'd script side, script holds a RefCounted reference
  15. // native owned
  16. // native script classes not derived from refcounted
  17. // if not inherited from RefCounted can script access?
  18. // if so, script side will always need to delete?
  19. */
  20. namespace Atomic
  21. {
  22. void js_class_get_prototype(duk_context* ctx, const char* package, const char *classname)
  23. {
  24. duk_get_global_string(ctx, package);
  25. duk_get_prop_string(ctx, -1, classname);
  26. duk_get_prop_string(ctx, -1, "prototype");
  27. duk_remove(ctx, -2); // remove class object
  28. duk_remove(ctx, -2); // remove Atomic object
  29. }
  30. void js_class_get_constructor(duk_context* ctx, const char* package, const char *classname)
  31. {
  32. duk_get_global_string(ctx, package);
  33. duk_get_prop_string(ctx, -1, classname);
  34. duk_remove(ctx, -2); // remove package
  35. }
  36. void js_constructor_basecall(duk_context* ctx, const char* package, const char* baseclass)
  37. {
  38. int top = duk_get_top(ctx);
  39. duk_get_global_string(ctx, package);
  40. duk_get_prop_string(ctx, -1, baseclass);
  41. assert(duk_is_function(ctx, -1));
  42. duk_push_this(ctx);
  43. duk_call_method(ctx, 0);
  44. duk_pop_n(ctx, 2);
  45. assert (top == duk_get_top(ctx));
  46. }
  47. void js_class_declare_internal(JSVM* vm, void* uniqueClassID, const char* package, const char* classname, duk_c_function constructor)
  48. {
  49. duk_context* ctx = vm->GetJSContext();
  50. // uniqueClassID must be non-null
  51. assert(uniqueClassID);
  52. // stash a lookup from the uniqueID to the package and class name
  53. duk_push_heap_stash(ctx);
  54. duk_push_pointer(ctx, uniqueClassID);
  55. duk_push_object(ctx);
  56. duk_push_string(ctx, package);
  57. duk_put_prop_index(ctx, -2, 0);
  58. duk_push_string(ctx, classname);
  59. duk_put_prop_index(ctx, -2, 1);
  60. // store class object into uniqueClassID key
  61. duk_put_prop(ctx, -3);
  62. // pop heap stash
  63. duk_pop(ctx);
  64. // store the constructor
  65. duk_get_global_string(ctx, package);
  66. duk_push_c_function(ctx, constructor, DUK_VARARGS);
  67. duk_put_prop_string(ctx, -2, classname);
  68. duk_pop(ctx);
  69. }
  70. void js_class_push_propertyobject(JSVM* vm, const char* package, const char* classname)
  71. {
  72. duk_context* ctx = vm->GetJSContext();
  73. String pname;
  74. pname.AppendWithFormat("__%s__Properties", classname);
  75. duk_get_global_string(ctx, package);
  76. duk_push_object(ctx);
  77. duk_dup(ctx, -1);
  78. duk_put_prop_string(ctx, -3, pname.CString());
  79. duk_remove(ctx, -2); // remove Atomic object
  80. }
  81. void js_setup_prototype(JSVM* vm, const char* package, const char* classname, const char* basePackage, const char* basename, bool hasProperties)
  82. {
  83. duk_context* ctx = vm->GetJSContext();
  84. String pname;
  85. pname.AppendWithFormat("__%s__Properties", classname);
  86. int top = duk_get_top(ctx);
  87. duk_get_global_string(ctx,package);
  88. duk_get_prop_string(ctx, -1, classname);
  89. assert(duk_is_c_function(ctx, -1));
  90. if (!strlen(basename))
  91. {
  92. // prototype
  93. duk_push_object(ctx);
  94. duk_dup(ctx, -2); // AObject constructor function
  95. duk_put_prop_string(ctx, -2, "constructor");
  96. duk_put_prop_string(ctx, -2, "prototype");
  97. duk_pop_n(ctx, 2);
  98. assert (top == duk_get_top(ctx));
  99. return;
  100. }
  101. // prototype
  102. duk_get_global_string(ctx, "Object");
  103. duk_get_prop_string(ctx, -1, "create");
  104. assert(duk_is_function(ctx, -1));
  105. duk_remove(ctx, -2); // remove Object
  106. duk_get_global_string(ctx, basePackage);
  107. duk_get_prop_string(ctx, -1, basename);
  108. assert(duk_is_function(ctx, -1));
  109. duk_get_prop_string(ctx, -1, "prototype");
  110. assert(duk_is_object(ctx, -1));
  111. duk_remove(ctx, -2); // remove basename
  112. int numargs = 1;
  113. if (hasProperties)
  114. {
  115. duk_get_global_string(ctx, package);
  116. duk_get_prop_string(ctx, -1, pname.CString());
  117. assert(duk_is_object(ctx, -1));
  118. duk_remove(ctx, -2);
  119. duk_remove(ctx, -3); // remove package
  120. numargs++;
  121. }
  122. else
  123. duk_remove(ctx, -2); // remove package
  124. duk_call(ctx, numargs);
  125. assert(duk_is_object(ctx, -1));
  126. duk_dup(ctx, -2);
  127. duk_put_prop_string(ctx, -2, "constructor");
  128. //duk_dup(ctx, -1);
  129. duk_put_prop_string(ctx, -2, "prototype");
  130. // pop the classname object
  131. duk_pop(ctx);
  132. // pop the Atomic Object
  133. duk_pop(ctx);
  134. assert (top == duk_get_top(ctx));
  135. }
  136. void js_object_to_variantmap(duk_context* ctx, int objIdx, VariantMap &v)
  137. {
  138. v.Clear();
  139. duk_enum(ctx, objIdx, DUK_ENUM_OWN_PROPERTIES_ONLY);
  140. while (duk_next(ctx, -1 /*enum_index*/, 1 /*get_value*/)) {
  141. /* [ ... enum key ] */
  142. const char* key = duk_to_string(ctx, -2);
  143. if (duk_is_number(ctx, -1)) {
  144. v[key] = (float) duk_to_number(ctx, -1);
  145. } else if (duk_is_boolean(ctx, -1)) {
  146. v[key] = duk_to_boolean(ctx, -1) ? true : false;
  147. }
  148. else if (duk_is_string(ctx, -1)) {
  149. v[key] = duk_to_string(ctx, -1);
  150. } else if (duk_get_heapptr(ctx, -1)) {
  151. v[key] = js_to_class_instance<Object>(ctx, -1, 0);
  152. }
  153. duk_pop_2(ctx); /* pop_key & value*/
  154. }
  155. duk_pop(ctx); /* pop enum object */
  156. }
  157. void js_to_variant(duk_context* ctx, int variantIdx, Variant &v)
  158. {
  159. v.Clear();
  160. // convert to abs index
  161. if (variantIdx < 0)
  162. variantIdx = duk_get_top(ctx) + variantIdx;
  163. if (duk_is_boolean(ctx, variantIdx))
  164. {
  165. v = duk_to_boolean(ctx, variantIdx) ? true : false;
  166. return;
  167. }
  168. if (duk_is_string(ctx, variantIdx))
  169. {
  170. v = duk_to_string(ctx, variantIdx);
  171. return;
  172. }
  173. if (duk_is_number(ctx, variantIdx))
  174. {
  175. v = (float) duk_to_number(ctx, variantIdx);
  176. return;
  177. }
  178. if (duk_is_pointer(ctx, variantIdx))
  179. {
  180. v = (RefCounted*) duk_get_pointer(ctx, variantIdx);
  181. return;
  182. }
  183. if (duk_is_array(ctx, variantIdx))
  184. {
  185. if (duk_get_length(ctx, variantIdx) == 2)
  186. {
  187. Vector2 v2;
  188. duk_get_prop_index(ctx, variantIdx, 0);
  189. v2.x_ = duk_to_number(ctx, -1);
  190. duk_get_prop_index(ctx, variantIdx, 1);
  191. v2.y_ = duk_to_number(ctx, -1);
  192. duk_pop_n(ctx, 2);
  193. v = v2;
  194. return;
  195. }
  196. else if (duk_get_length(ctx, variantIdx) == 3)
  197. {
  198. Vector3 v3;
  199. duk_get_prop_index(ctx, variantIdx, 0);
  200. v3.x_ = duk_to_number(ctx, -1);
  201. duk_get_prop_index(ctx, variantIdx, 1);
  202. v3.y_ = duk_to_number(ctx, -1);
  203. duk_get_prop_index(ctx, variantIdx, 2);
  204. v3.z_ = duk_to_number(ctx, -1);
  205. duk_pop_n(ctx, 3);
  206. v = v3;
  207. return;
  208. }
  209. else if (duk_get_length(ctx, variantIdx) == 4)
  210. {
  211. Vector4 v4;
  212. duk_get_prop_index(ctx, variantIdx, 0);
  213. v4.x_ = duk_to_number(ctx, -1);
  214. duk_get_prop_index(ctx, variantIdx, 1);
  215. v4.y_ = duk_to_number(ctx, -1);
  216. duk_get_prop_index(ctx, variantIdx, 2);
  217. v4.z_ = duk_to_number(ctx, -1);
  218. duk_get_prop_index(ctx, variantIdx, 3);
  219. v4.w_ = duk_to_number(ctx, -1);
  220. duk_pop_n(ctx, 4);
  221. v = v4;
  222. return;
  223. }
  224. return;
  225. }
  226. // object check after array
  227. if (duk_is_object(ctx, variantIdx))
  228. {
  229. RefCounted* o = js_to_class_instance<RefCounted>(ctx, variantIdx, 0);
  230. if (o)
  231. v = o;
  232. return;
  233. }
  234. }
  235. // variant map Proxy getter, so we can convert access to string based
  236. // member lookup, to string hash on the fly
  237. static int variantmap_property_get(duk_context* ctx)
  238. {
  239. // targ, key, recv
  240. if (duk_is_string(ctx, 1))
  241. {
  242. StringHash key = duk_to_string(ctx, 1);
  243. duk_get_prop_index(ctx, 0, (unsigned) key.Value());
  244. return 1;
  245. }
  246. duk_push_undefined(ctx);
  247. return 1;
  248. }
  249. // removes all keys from the variant map proxy target, REGARDLESS of key given for delete
  250. // see (lengthy) note in JSEventDispatcher::EndSendEvent
  251. static int variantmap_property_deleteproperty(duk_context* ctx)
  252. {
  253. // deleteProperty: function (targ, key)
  254. duk_enum(ctx, 0, DUK_ENUM_OWN_PROPERTIES_ONLY);
  255. while (duk_next(ctx, -1, 0)) {
  256. duk_del_prop(ctx, 0);
  257. }
  258. duk_push_boolean(ctx, 1);
  259. return 1;
  260. }
  261. void js_push_variantmap(duk_context* ctx, const VariantMap &vmap)
  262. {
  263. // setup proxy so we can map string
  264. duk_get_global_string(ctx, "Proxy");
  265. duk_push_object(ctx);
  266. VariantMap::ConstIterator itr = vmap.Begin();
  267. while (itr != vmap.End()) {
  268. js_push_variant(ctx, itr->second_);
  269. if (duk_is_undefined(ctx, -1)) {
  270. duk_pop(ctx);
  271. }
  272. else
  273. {
  274. duk_put_prop_index(ctx, -2, (unsigned) itr->first_.Value());
  275. }
  276. itr++;
  277. }
  278. // setup property handler
  279. duk_push_object(ctx);
  280. duk_push_c_function(ctx, variantmap_property_get, 3);
  281. duk_put_prop_string(ctx, -2, "get");
  282. duk_push_c_function(ctx, variantmap_property_deleteproperty, 2);
  283. duk_put_prop_string(ctx, -2, "deleteProperty");
  284. duk_new(ctx, 2);
  285. }
  286. void js_push_variant(duk_context *ctx, const Variant& v)
  287. {
  288. VariantType type = v.GetType();
  289. RefCounted* ref;
  290. Vector2 vector2 = Vector2::ZERO;
  291. Vector3 vector3 = Vector3::ZERO;
  292. Vector4 vector4 = Vector4::ZERO;
  293. Color color = Color::BLACK;
  294. Resource* resource = NULL;
  295. ResourceCache* cache = NULL;
  296. ResourceRef resourceRef;
  297. switch (type)
  298. {
  299. case VAR_NONE:
  300. duk_push_undefined(ctx);
  301. break;
  302. case VAR_VOIDPTR:
  303. duk_push_null(ctx);
  304. break;
  305. case VAR_PTR:
  306. ref = v.GetPtr();
  307. // if we're null or don't have any refs, return null
  308. if (!ref || !ref->Refs())
  309. {
  310. duk_push_null(ctx);
  311. break;
  312. }
  313. // check that class is supported
  314. duk_push_heap_stash(ctx);
  315. duk_push_pointer(ctx, (void*) ref->GetClassID());
  316. duk_get_prop(ctx, -2);
  317. if (!duk_is_object(ctx, -1))
  318. {
  319. duk_pop_2(ctx);
  320. duk_push_undefined(ctx);
  321. }
  322. else
  323. {
  324. duk_pop_2(ctx);
  325. js_push_class_object_instance(ctx, ref);
  326. }
  327. break;
  328. case VAR_RESOURCEREF:
  329. resourceRef = v.GetResourceRef();
  330. cache = JSVM::GetJSVM(ctx)->GetContext()->GetSubsystem<ResourceCache>();
  331. resource = cache->GetResource(resourceRef.type_, resourceRef.name_);
  332. js_push_class_object_instance(ctx, resource);
  333. break;
  334. case VAR_BOOL:
  335. duk_push_boolean(ctx, v.GetBool() ? 1 : 0);
  336. break;
  337. case VAR_INT:
  338. duk_push_number(ctx, v.GetInt());
  339. break;
  340. case VAR_FLOAT:
  341. duk_push_number(ctx, v.GetFloat());
  342. break;
  343. case VAR_STRING:
  344. duk_push_string(ctx, v.GetString().CString());
  345. break;
  346. case VAR_VECTOR2:
  347. vector2 = v.GetVector2();
  348. duk_push_array(ctx);
  349. duk_push_number(ctx, vector2.x_);
  350. duk_put_prop_index(ctx, -2, 0);
  351. duk_push_number(ctx, vector2.y_);
  352. duk_put_prop_index(ctx, -2, 1);
  353. break;
  354. case VAR_VECTOR3:
  355. vector3 = v.GetVector3();
  356. duk_push_array(ctx);
  357. duk_push_number(ctx, vector3.x_);
  358. duk_put_prop_index(ctx, -2, 0);
  359. duk_push_number(ctx, vector3.y_);
  360. duk_put_prop_index(ctx, -2, 1);
  361. duk_push_number(ctx, vector3.z_);
  362. duk_put_prop_index(ctx, -2, 2);
  363. break;
  364. case VAR_QUATERNION:
  365. vector3 = v.GetQuaternion().EulerAngles();
  366. duk_push_array(ctx);
  367. duk_push_number(ctx, vector3.x_);
  368. duk_put_prop_index(ctx, -2, 0);
  369. duk_push_number(ctx, vector3.y_);
  370. duk_put_prop_index(ctx, -2, 1);
  371. duk_push_number(ctx, vector3.z_);
  372. duk_put_prop_index(ctx, -2, 2);
  373. break;
  374. case VAR_COLOR:
  375. color = v.GetColor();
  376. duk_push_array(ctx);
  377. duk_push_number(ctx, color.r_);
  378. duk_put_prop_index(ctx, -2, 0);
  379. duk_push_number(ctx, color.g_);
  380. duk_put_prop_index(ctx, -2, 1);
  381. duk_push_number(ctx, color.b_);
  382. duk_put_prop_index(ctx, -2, 2);
  383. duk_push_number(ctx, color.a_);
  384. duk_put_prop_index(ctx, -2, 3);
  385. break;
  386. case VAR_VECTOR4:
  387. vector4 = v.GetVector4();
  388. duk_push_array(ctx);
  389. duk_push_number(ctx, vector4.x_);
  390. duk_put_prop_index(ctx, -2, 0);
  391. duk_push_number(ctx, vector4.y_);
  392. duk_put_prop_index(ctx, -2, 1);
  393. duk_push_number(ctx, vector4.z_);
  394. duk_put_prop_index(ctx, -2, 2);
  395. duk_push_number(ctx, vector4.w_);
  396. duk_put_prop_index(ctx, -2, 3);
  397. break;
  398. default:
  399. duk_push_undefined(ctx);
  400. break;
  401. }
  402. }
  403. }