unit_resource.cpp 15 KB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130131132133134135136137138139140141142143144145146147148149150151152153154155156157158159160161162163164165166167168169170171172173174175176177178179180181182183184185186187188189190191192193194195196197198199200201202203204205206207208209210211212213214215216217218219220221222223224225226227228229230231232233234235236237238239240241242243244245246247248249250251252253254255256257258259260261262263264265266267268269270271272273274275276277278279280281282283284285286287288289290291292293294295296297298299300301302303304305306307308309310311312313314315316317318319320321322323324325326327328329330331332333334335336337338339340341342343344345346347348349350351352353354355356357358359360361362363364365366367368369370371372373374375376377378379380381382383384385386387388389390391392393394395396397398399400401402403404405406407408409410411412413414415416417418419420421422423424425426427428429430431432433434435436437438439440441442443444445446447448449450451452453454455456457458459460461462463464465466467468469470471472473474475476477478479480481482483484485486487488489490491492493494495496497498499500501502503504505506507508509510511512513514515516517518519520521522523524525526527528529530531532533534535536537538539540541542543544545546547548549550551552553554555556557558559560561562563564565566567568569570571572573574575576577578579580581582
  1. /*
  2. * Copyright (c) 2012-2014 Daniele Bartolini and individual contributors.
  3. * License: https://github.com/taylor001/crown/blob/master/LICENSE
  4. */
  5. #include "allocator.h"
  6. #include "file.h"
  7. #include "filesystem.h"
  8. #include "string_utils.h"
  9. #include "json_parser.h"
  10. #include "vector.h"
  11. #include "log.h"
  12. #include "matrix4x4.h"
  13. #include "physics_types.h"
  14. #include "quaternion.h"
  15. #include "compile_options.h"
  16. #include "temp_allocator.h"
  17. #include "types.h"
  18. #include "vector3.h"
  19. #include "camera.h"
  20. #include "unit_resource.h"
  21. namespace crown
  22. {
  23. namespace unit_resource
  24. {
  25. struct Projection
  26. {
  27. const char* name;
  28. ProjectionType::Enum type;
  29. };
  30. static const Projection s_projection[] =
  31. {
  32. { "perspective", ProjectionType::PERSPECTIVE },
  33. { "orthographic", ProjectionType::ORTHOGRAPHIC }
  34. };
  35. static ProjectionType::Enum projection_name_to_enum(const char* name)
  36. {
  37. for (uint32_t i = 0; i < ProjectionType::COUNT; i++)
  38. {
  39. if (strcmp(name, s_projection[i].name) == 0)
  40. return s_projection[i].type;
  41. }
  42. CE_FATAL("Bad projection type");
  43. return (ProjectionType::Enum)0;
  44. }
  45. const StringId32 NO_PARENT = 0xFFFFFFFF;
  46. struct GraphNode
  47. {
  48. StringId32 name;
  49. StringId32 parent;
  50. Vector3 position;
  51. Quaternion rotation;
  52. };
  53. struct GraphNodeDepth
  54. {
  55. StringId32 name;
  56. uint32_t index;
  57. uint32_t depth;
  58. bool operator()(const GraphNodeDepth& a, const GraphNodeDepth& b)
  59. {
  60. return a.depth < b.depth;
  61. }
  62. };
  63. uint32_t compute_link_depth(const GraphNode& node, const Array<GraphNode>& nodes)
  64. {
  65. if (node.parent == NO_PARENT) return 0;
  66. else
  67. {
  68. for (uint32_t i = 0; i < array::size(nodes); i++)
  69. {
  70. if (nodes[i].name == node.parent)
  71. {
  72. return 1 + compute_link_depth(nodes[i], nodes);
  73. }
  74. }
  75. }
  76. CE_FATAL("Node not found");
  77. return 0;
  78. }
  79. uint32_t find_node_index(StringId32 name, const Array<GraphNodeDepth>& node_depths)
  80. {
  81. for (uint32_t i = 0; i < array::size(node_depths); i++)
  82. {
  83. if (node_depths[i].name == name)
  84. {
  85. return i;
  86. }
  87. }
  88. CE_FATAL("Node not found");
  89. return 0;
  90. }
  91. int32_t find_node_parent_index(uint32_t node, const Array<GraphNode>& nodes, const Array<GraphNodeDepth>& node_depths)
  92. {
  93. StringId32 parent_name = nodes[node_depths[node].index].parent;
  94. if (parent_name == NO_PARENT) return -1;
  95. for (uint32_t i = 0; i < array::size(node_depths); i++)
  96. {
  97. if (parent_name == node_depths[i].name)
  98. {
  99. return i;
  100. }
  101. }
  102. CE_FATAL("Node not found");
  103. return 0;
  104. }
  105. void parse_nodes(JSONElement e, Array<GraphNode>& nodes, Array<GraphNodeDepth>& node_depths)
  106. {
  107. Vector<DynamicString> keys(default_allocator());
  108. e.to_keys(keys);
  109. for (uint32_t k = 0; k < vector::size(keys); k++)
  110. {
  111. const char* node_name = keys[k].c_str();
  112. JSONElement node = e.key(node_name);
  113. GraphNode gn;
  114. gn.name = murmur2_32(node_name, strlen(node_name));
  115. gn.parent = NO_PARENT;
  116. if (!node.key("parent").is_nil())
  117. {
  118. DynamicString parent_name;
  119. node.key("parent").to_string(parent_name);
  120. gn.parent = murmur2_32(parent_name.c_str(), parent_name.length(), 0);
  121. }
  122. JSONElement pos = node.key("position");
  123. JSONElement rot = node.key("rotation");
  124. gn.position = Vector3(pos[0].to_float(), pos[1].to_float(), pos[2].to_float());
  125. gn.rotation = Quaternion(Vector3(rot[0].to_float(), rot[1].to_float(), rot[2].to_float()), rot[3].to_float());
  126. GraphNodeDepth gnd;
  127. gnd.name = gn.name;
  128. gnd.index = array::size(nodes);
  129. gnd.depth = 0;
  130. array::push_back(nodes, gn);
  131. array::push_back(node_depths, gnd);
  132. }
  133. }
  134. void parse_cameras(JSONElement e, Array<UnitCamera>& cameras, const Array<GraphNodeDepth>& node_depths)
  135. {
  136. Vector<DynamicString> keys(default_allocator());
  137. e.to_keys(keys);
  138. for (uint32_t k = 0; k < vector::size(keys); k++)
  139. {
  140. const char* camera_name = keys[k].c_str();
  141. JSONElement camera = e.key(camera_name);
  142. JSONElement node = camera.key("node");
  143. JSONElement type = camera.key("type");
  144. DynamicString node_name;
  145. node.to_string(node_name);
  146. DynamicString camera_type;
  147. type.to_string(camera_type);
  148. StringId32 node_name_hash = murmur2_32(node_name.c_str(), node_name.length());
  149. UnitCamera cn;
  150. cn.name = murmur2_32(camera_name, strlen(camera_name));
  151. cn.node = find_node_index(node_name_hash, node_depths);
  152. cn.type = projection_name_to_enum(camera_type.c_str());
  153. cn.fov = camera.key_or_nil("fov").to_float(16.0f / 9.0f);
  154. cn.near = camera.key_or_nil("near_clip_distance").to_float(0.01f);
  155. cn.far = camera.key_or_nil("far_clip_distance").to_float(1000.0f);
  156. array::push_back(cameras, cn);
  157. }
  158. }
  159. void parse_renderables(JSONElement e, Array<UnitRenderable>& renderables, const Array<GraphNodeDepth>& node_depths)
  160. {
  161. Vector<DynamicString> keys(default_allocator());
  162. e.to_keys(keys);
  163. for (uint32_t k = 0; k < vector::size(keys); k++)
  164. {
  165. const char* renderable_name = keys[k].c_str();
  166. JSONElement renderable = e.key(renderable_name);
  167. DynamicString node_name; renderable.key("node").to_string(node_name);
  168. StringId32 node_name_hash = murmur2_32(node_name.c_str(), node_name.length(), 0);
  169. UnitRenderable rn;
  170. rn.name = murmur2_32(renderable_name, strlen(renderable_name), 0);
  171. rn.node = find_node_index(node_name_hash, node_depths);
  172. rn.visible = renderable.key("visible").to_bool();
  173. DynamicString res_type;
  174. renderable.key("type").to_string(res_type);
  175. if (res_type == "mesh")
  176. {
  177. rn.type = UnitRenderable::MESH;
  178. rn.resource = renderable.key("resource").to_resource_id("mesh").name;
  179. }
  180. else if (res_type == "sprite")
  181. {
  182. rn.type = UnitRenderable::SPRITE;
  183. rn.resource = renderable.key("resource").to_resource_id("sprite").name;
  184. }
  185. else
  186. {
  187. CE_ASSERT(false, "Oops, unknown renderable type: '%s'", res_type.c_str());
  188. }
  189. array::push_back(renderables, rn);
  190. }
  191. }
  192. void parse_keys(JSONElement e, Array<Key>& generic_keys, Array<char>& values)
  193. {
  194. Vector<DynamicString> keys(default_allocator());
  195. e.to_keys(keys);
  196. for (uint32_t k = 0; k < vector::size(keys); k++)
  197. {
  198. const char* key = keys[k].c_str();
  199. JSONElement value = e.key(key);
  200. Key out_key;
  201. out_key.name = murmur2_32(key, strlen(key));
  202. out_key.offset = array::size(values);
  203. if (value.is_bool()) out_key.type = ValueType::BOOL;
  204. else if (value.is_number()) out_key.type = ValueType::FLOAT;
  205. else if (value.is_string()) out_key.type = ValueType::STRING;
  206. else if (value.is_array() && value.size() == 3) out_key.type = ValueType::VECTOR3;
  207. else CE_FATAL("Value type not supported");
  208. array::push_back(generic_keys, out_key);
  209. switch (out_key.type)
  210. {
  211. case ValueType::BOOL:
  212. {
  213. uint32_t val = value.to_bool();
  214. array::push(values, (char*) &val, sizeof(uint32_t));
  215. break;
  216. }
  217. case ValueType::FLOAT:
  218. {
  219. float val = value.to_float();
  220. array::push(values, (char*) &val, sizeof(float));
  221. break;
  222. }
  223. case ValueType::STRING:
  224. {
  225. DynamicString val;
  226. value.to_string(val);
  227. StringId32 val_hash = murmur2_32(val.c_str(), val.length());
  228. array::push(values, (char*) &val_hash, sizeof(StringId32));
  229. break;
  230. }
  231. case ValueType::VECTOR3:
  232. {
  233. float val[3];
  234. val[0] = value[0].to_float();
  235. val[1] = value[1].to_float();
  236. val[2] = value[2].to_float();
  237. array::push(values, (char*) val, sizeof(float) * 3);
  238. break;
  239. }
  240. default:
  241. {
  242. CE_FATAL("Oops, you should not be here");
  243. return;
  244. }
  245. }
  246. }
  247. }
  248. void parse_materials(JSONElement e, Array<UnitMaterial>& materials)
  249. {
  250. for (uint32_t i = 0; i < e.size(); i++)
  251. {
  252. ResourceId mat_id = e[i].to_resource_id("material");
  253. UnitMaterial um;
  254. um.id = mat_id.name;
  255. array::push_back(materials, um);
  256. }
  257. }
  258. void compile(const char* path, CompileOptions& opts)
  259. {
  260. static const uint32_t VERSION = 1;
  261. Buffer buf = opts.read(path);
  262. JSONParser json(array::begin(buf));
  263. JSONElement root = json.root();
  264. ResourceId m_physics_resource;
  265. Array<GraphNode> m_nodes(default_allocator());
  266. Array<GraphNodeDepth> m_node_depths(default_allocator());
  267. Array<UnitCamera> m_cameras(default_allocator());
  268. Array<UnitRenderable> m_renderables(default_allocator());
  269. Array<Key> m_keys(default_allocator());
  270. Array<char> m_values(default_allocator());
  271. Array<UnitMaterial> m_materials(default_allocator());
  272. // Check for nodes
  273. if (root.has_key("nodes")) parse_nodes(root.key("nodes"), m_nodes, m_node_depths);
  274. for (uint32_t i = 0; i < array::size(m_nodes); i++)
  275. {
  276. m_node_depths[i].depth = compute_link_depth(m_nodes[i], m_nodes);
  277. }
  278. std::sort(array::begin(m_node_depths), array::end(m_node_depths), GraphNodeDepth());
  279. if (root.has_key("renderables")) parse_renderables(root.key("renderables"), m_renderables, m_node_depths);
  280. if (root.has_key("cameras")) parse_cameras(root.key("cameras"), m_cameras, m_node_depths);
  281. if (root.has_key("keys")) parse_keys(root.key("keys"), m_keys, m_values);
  282. if (root.has_key("materials")) parse_materials(root.key("materials"), m_materials);
  283. // Check if the unit has a .physics resource
  284. DynamicString unit_name(path);
  285. unit_name.strip_trailing(".unit");
  286. DynamicString physics_name = unit_name;
  287. physics_name += ".physics";
  288. if (opts._fs.exists(physics_name.c_str()))
  289. {
  290. m_physics_resource = ResourceId("physics", unit_name.c_str());
  291. }
  292. else
  293. {
  294. m_physics_resource = ResourceId();
  295. }
  296. ResourceId sprite_anim;
  297. sprite_anim.type = 0;
  298. sprite_anim.name = 0;
  299. if (root.has_key("sprite_animation"))
  300. sprite_anim = root.key("sprite_animation").to_resource_id("sprite_animation");
  301. UnitResource ur;
  302. ur.version = VERSION;
  303. ur.physics_resource = m_physics_resource.name;
  304. ur.sprite_animation = sprite_anim.name;
  305. ur.num_renderables = array::size(m_renderables);
  306. ur.num_materials = array::size(m_materials);
  307. ur.num_cameras = array::size(m_cameras);
  308. ur.num_scene_graph_nodes = array::size(m_nodes);
  309. ur.num_keys = array::size(m_keys);
  310. ur.values_size = array::size(m_values);
  311. uint32_t offt = sizeof(UnitResource);
  312. ur.renderables_offset = offt; offt += sizeof(UnitRenderable) * ur.num_renderables;
  313. ur.materials_offset = offt; offt += sizeof(UnitMaterial) * ur.num_materials;
  314. ur.cameras_offset = offt; offt += sizeof(UnitCamera) * ur.num_cameras;
  315. ur.scene_graph_nodes_offset = offt; offt += sizeof(UnitNode) * ur.num_scene_graph_nodes;
  316. ur.keys_offset = offt; offt += sizeof(Key) * ur.num_keys;
  317. ur.values_offset = offt;
  318. opts.write(ur.version);
  319. opts.write(ur._pad);
  320. opts.write(ur.physics_resource);
  321. opts.write(ur.sprite_animation);
  322. opts.write(ur.num_renderables);
  323. opts.write(ur.renderables_offset);
  324. opts.write(ur.num_materials);
  325. opts.write(ur.materials_offset);
  326. opts.write(ur.num_cameras);
  327. opts.write(ur.cameras_offset);
  328. opts.write(ur.num_scene_graph_nodes);
  329. opts.write(ur.scene_graph_nodes_offset);
  330. opts.write(ur.num_keys);
  331. opts.write(ur.keys_offset);
  332. opts.write(ur.values_size);
  333. opts.write(ur.values_offset);
  334. // Renderables
  335. for (uint32_t i = 0; i < array::size(m_renderables); i++)
  336. {
  337. opts.write(m_renderables[i].type);
  338. opts.write(m_renderables[i]._pad);
  339. opts.write(m_renderables[i].resource);
  340. opts.write(m_renderables[i].name);
  341. opts.write(m_renderables[i].node);
  342. opts.write(m_renderables[i].visible);
  343. opts.write(m_renderables[i]._pad1[0]);
  344. opts.write(m_renderables[i]._pad1[1]);
  345. opts.write(m_renderables[i]._pad1[2]);
  346. opts.write(m_renderables[i]._pad2[0]);
  347. opts.write(m_renderables[i]._pad2[1]);
  348. opts.write(m_renderables[i]._pad2[2]);
  349. opts.write(m_renderables[i]._pad2[3]);
  350. }
  351. // Materials
  352. for (uint32_t i = 0; i < array::size(m_materials); i++)
  353. {
  354. opts.write(m_materials[i]);
  355. }
  356. // Cameras
  357. for (uint32_t i = 0; i < array::size(m_cameras); i++)
  358. {
  359. opts.write(m_cameras[i].name);
  360. opts.write(m_cameras[i].node);
  361. opts.write(m_cameras[i].type);
  362. opts.write(m_cameras[i].fov);
  363. opts.write(m_cameras[i].near);
  364. opts.write(m_cameras[i].far);
  365. }
  366. // Write node poses
  367. for (uint32_t i = 0; i < ur.num_scene_graph_nodes; i++)
  368. {
  369. uint32_t node_index = m_node_depths[i].index;
  370. GraphNode& node = m_nodes[node_index];
  371. UnitNode un;
  372. un.name = node.name;
  373. un.parent = find_node_parent_index(i, m_nodes, m_node_depths);
  374. un.pose = Matrix4x4(node.rotation, node.position);
  375. opts.write(un.name);
  376. opts.write(un.pose);
  377. opts.write(un.parent);
  378. }
  379. // Key/values
  380. for (uint32_t i = 0; i < array::size(m_keys); i++)
  381. {
  382. opts.write(m_keys[i].name);
  383. opts.write(m_keys[i].type);
  384. opts.write(m_keys[i].offset);
  385. }
  386. for (uint32_t i = 0; i < array::size(m_values); i++)
  387. {
  388. opts.write(m_values[i]);
  389. }
  390. }
  391. void* load(File& file, Allocator& a)
  392. {
  393. const size_t file_size = file.size();
  394. void* res = a.allocate(file_size);
  395. file.read(res, file_size);
  396. return res;
  397. }
  398. void online(StringId64 /*id*/, ResourceManager& /*rm*/)
  399. {
  400. }
  401. void offline(StringId64 /*id*/, ResourceManager& /*rm*/)
  402. {
  403. }
  404. void unload(Allocator& allocator, void* resource)
  405. {
  406. allocator.deallocate(resource);
  407. }
  408. StringId64 sprite_animation(const UnitResource* ur)
  409. {
  410. return ur->sprite_animation;
  411. }
  412. StringId64 physics_resource(const UnitResource* ur)
  413. {
  414. return ur->physics_resource;
  415. }
  416. uint32_t num_renderables(const UnitResource* ur)
  417. {
  418. return ur->num_renderables;
  419. }
  420. const UnitRenderable* get_renderable(const UnitResource* ur, uint32_t i)
  421. {
  422. CE_ASSERT(i < num_renderables(ur), "Index out of bounds");
  423. UnitRenderable* begin = (UnitRenderable*) ((char*)ur + ur->renderables_offset);
  424. return &begin[i];
  425. }
  426. uint32_t num_materials(const UnitResource* ur)
  427. {
  428. return ur->num_materials;
  429. }
  430. const UnitMaterial* get_material(const UnitResource* ur, uint32_t i)
  431. {
  432. CE_ASSERT(i < num_materials(ur), "Index out of bounds");
  433. UnitMaterial* begin = (UnitMaterial*) ((char*)ur + ur->materials_offset);
  434. return &begin[i];
  435. }
  436. uint32_t num_cameras(const UnitResource* ur)
  437. {
  438. return ur->num_cameras;
  439. }
  440. const UnitCamera* get_camera(const UnitResource* ur, uint32_t i)
  441. {
  442. CE_ASSERT(i < num_cameras(ur), "Index out of bounds");
  443. UnitCamera* begin = (UnitCamera*) ((char*)ur + ur->cameras_offset);
  444. return &begin[i];
  445. }
  446. uint32_t num_scene_graph_nodes(const UnitResource* ur)
  447. {
  448. return ur->num_scene_graph_nodes;
  449. }
  450. const UnitNode* scene_graph_nodes(const UnitResource* ur)
  451. {
  452. return (UnitNode*) ((char*)ur + ur->scene_graph_nodes_offset);
  453. }
  454. uint32_t num_keys(const UnitResource* ur)
  455. {
  456. return ur->num_keys;
  457. }
  458. bool has_key(const UnitResource* ur, const char* k)
  459. {
  460. const uint32_t nk = num_keys(ur);
  461. Key* begin = (Key*) ((char*)ur + ur->keys_offset);
  462. for (uint32_t i = 0; i < nk; i++)
  463. {
  464. if (begin[i].name == murmur2_32(k, strlen(k)))
  465. {
  466. return true;
  467. }
  468. }
  469. return false;
  470. }
  471. bool get_key(const UnitResource* ur, const char* k, Key& out_k)
  472. {
  473. const uint32_t nk = num_keys(ur);
  474. Key* begin = (Key*) ((char*)ur + ur->keys_offset);
  475. for (uint32_t i = 0; i < nk; i++)
  476. {
  477. if (begin[i].name == murmur2_32(k, strlen(k)))
  478. {
  479. out_k = begin[i];
  480. return true;
  481. }
  482. }
  483. return false;
  484. }
  485. uint32_t values_size(const UnitResource* ur)
  486. {
  487. return ur->values_size;
  488. }
  489. const char* values(const UnitResource* ur)
  490. {
  491. return ((char*)ur + ur->values_offset);
  492. }
  493. } // namespace unit_resource
  494. } // namespace crown