state_machine_resource.cpp 14 KB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130131132133134135136137138139140141142143144145146147148149150151152153154155156157158159160161162163164165166167168169170171172173174175176177178179180181182183184185186187188189190191192193194195196197198199200201202203204205206207208209210211212213214215216217218219220221222223224225226227228229230231232233234235236237238239240241242243244245246247248249250251252253254255256257258259260261262263264265266267268269270271272273274275276277278279280281282283284285286287288289290291292293294295296297298299300301302303304305306307308309310311312313314315316317318319320321322323324325326327328329330331332333334335336337338339340341342343344345346347348349350351352353354355356357358359360361362363364365366367368369370371372373374375376377378379380381382383384385386387388389390391392393394395396397398399400401402403404405406407408409410411412413414415416417418419420421422423424425426427428429430431432433434435436437438439440441442443444445446447448449450451452453454455456457458459460461462463464465466467468469470471472473474475476477478479480481482483484485486487488489490491492493494495496497498499500501502503504505506507508509510511512513514515516517518519520521522523524525526527528529530531532533534535536537538539540541542543544545546547
  1. /*
  2. * Copyright (c) 2012-2022 Daniele Bartolini et al.
  3. * License: https://github.com/crownengine/crown/blob/master/LICENSE
  4. */
  5. #include "config.h"
  6. #include "core/containers/array.inl"
  7. #include "core/containers/hash_map.inl"
  8. #include "core/containers/vector.inl"
  9. #include "core/error/error.h"
  10. #include "core/filesystem/file.h"
  11. #include "core/guid.inl"
  12. #include "core/json/json_object.inl"
  13. #include "core/json/sjson.h"
  14. #include "core/math/math.h"
  15. #include "core/memory/temp_allocator.inl"
  16. #include "core/strings/dynamic_string.inl"
  17. #include "core/strings/string_id.inl"
  18. #include "resource/compile_options.inl"
  19. #include "resource/expression_language.h"
  20. #include "resource/state_machine_resource.h"
  21. #include "resource/types.h"
  22. namespace crown
  23. {
  24. namespace state_machine
  25. {
  26. const State *initial_state(const StateMachineResource *smr)
  27. {
  28. return (State *)((char *)smr + smr->initial_state_offset);
  29. }
  30. const State *state(const StateMachineResource *smr, const Transition *t)
  31. {
  32. return (State *)((char *)smr + t->state_offset);
  33. }
  34. const State *trigger(const StateMachineResource *smr, const State *s, StringId32 event, const Transition **transition_out)
  35. {
  36. const TransitionArray *ta = state_transitions(s);
  37. for (u32 i = 0; i < ta->num; ++i) {
  38. const Transition *transition_i = transition(ta, i);
  39. if (transition_i->event == event) {
  40. *transition_out = transition_i;
  41. return state(smr, transition_i);
  42. }
  43. }
  44. *transition_out = NULL;
  45. return s;
  46. }
  47. const TransitionArray *state_transitions(const State *s)
  48. {
  49. return &s->ta;
  50. }
  51. const Transition *transition(const TransitionArray *ta, u32 index)
  52. {
  53. CE_ASSERT(index < ta->num, "Index out of bounds");
  54. const Transition *first = (Transition *)(&ta[1]);
  55. return &first[index];
  56. }
  57. const AnimationArray *state_animations(const State *s)
  58. {
  59. const TransitionArray *ta = state_transitions(s);
  60. const Transition *first = (Transition *)(&ta[1]);
  61. return (AnimationArray *)(first + ta->num);
  62. }
  63. const Animation *animation(const AnimationArray *aa, u32 index)
  64. {
  65. CE_ASSERT(index < aa->num, "Index out of bounds");
  66. Animation *first = (Animation *)(memory::align_top((void *)&aa[1], alignof(Animation)));
  67. return &first[index];
  68. }
  69. static inline const StringId32 *variables_names(const StateMachineResource *smr)
  70. {
  71. return (StringId32 *)((char *)smr + smr->variables_offset);
  72. }
  73. const f32 *variables(const StateMachineResource *smr)
  74. {
  75. const StringId32 *names = variables_names(smr);
  76. return (f32 *)(names + smr->num_variables);
  77. }
  78. u32 variable_index(const StateMachineResource *smr, StringId32 name)
  79. {
  80. const StringId32 *names = variables_names(smr);
  81. for (u32 i = 0; i < smr->num_variables; ++i) {
  82. if (names[i] == name)
  83. return i;
  84. }
  85. return UINT32_MAX;
  86. }
  87. const u32 *byte_code(const StateMachineResource *smr)
  88. {
  89. return (u32 *)((char *)smr + smr->bytecode_offset);
  90. }
  91. } // namespace state_machine
  92. #if CROWN_CAN_COMPILE
  93. namespace state_machine_internal
  94. {
  95. struct TransitionModeInfo
  96. {
  97. const char *name;
  98. TransitionMode::Enum mode;
  99. };
  100. static TransitionModeInfo _transition_mode_map[] =
  101. {
  102. { "immediate", TransitionMode::IMMEDIATE },
  103. { "wait_until_end", TransitionMode::WAIT_UNTIL_END },
  104. };
  105. CE_STATIC_ASSERT(countof(_transition_mode_map) == TransitionMode::COUNT);
  106. static TransitionMode::Enum name_to_transition_mode(const char *name)
  107. {
  108. for (u32 i = 0; i < countof(_transition_mode_map); ++i) {
  109. if (strcmp(name, _transition_mode_map[i].name) == 0)
  110. return _transition_mode_map[i].mode;
  111. }
  112. return TransitionMode::COUNT;
  113. }
  114. struct OffsetAccumulator
  115. {
  116. u32 _offset;
  117. OffsetAccumulator()
  118. : _offset(sizeof(StateMachineResource))
  119. {
  120. }
  121. void align(u32 align)
  122. {
  123. _offset = (u32)(uintptr_t)memory::align_top((void *)(uintptr_t)_offset, align);
  124. }
  125. // Returns the offset of
  126. u32 offset(u32 num_animations, u32 num_transitions)
  127. {
  128. const u32 offt = _offset;
  129. align(alignof(State));
  130. _offset += sizeof(State);
  131. align(alignof(Transition));
  132. _offset += sizeof(Transition) * num_transitions;
  133. align(alignof(AnimationArray));
  134. _offset += sizeof(AnimationArray);
  135. align(alignof(Animation));
  136. _offset += sizeof(Animation) * num_animations;
  137. return offt;
  138. }
  139. };
  140. struct AnimationInfo
  141. {
  142. ALLOCATOR_AWARE;
  143. StringId64 name;
  144. DynamicString weight;
  145. u32 bytecode_entry;
  146. explicit AnimationInfo(Allocator &a)
  147. : weight(a)
  148. {
  149. }
  150. };
  151. struct TransitionInfo
  152. {
  153. Transition transition;
  154. Guid state;
  155. };
  156. struct StateInfo
  157. {
  158. ALLOCATOR_AWARE;
  159. Vector<AnimationInfo> animations;
  160. Vector<TransitionInfo> transitions;
  161. DynamicString speed;
  162. u32 speed_bytecode;
  163. u32 loop;
  164. explicit StateInfo(Allocator &a)
  165. : animations(a)
  166. , transitions(a)
  167. , speed(a)
  168. , speed_bytecode(UINT32_MAX)
  169. , loop(0)
  170. {
  171. }
  172. };
  173. struct VariableInfo
  174. {
  175. ALLOCATOR_AWARE;
  176. DynamicString name_string;
  177. StringId32 name;
  178. float value;
  179. explicit VariableInfo(Allocator &a)
  180. : name_string(a)
  181. , value(0.0f)
  182. {
  183. }
  184. };
  185. struct StateMachineCompiler
  186. {
  187. CompileOptions &_opts;
  188. Guid _initial_state;
  189. HashMap<Guid, StateInfo> _states;
  190. OffsetAccumulator _offset_accumulator;
  191. HashMap<Guid, u32> _offsets;
  192. Vector<VariableInfo> _variables;
  193. Array<u32> _byte_code;
  194. explicit StateMachineCompiler(CompileOptions &opts)
  195. : _opts(opts)
  196. , _states(default_allocator())
  197. , _offsets(default_allocator())
  198. , _variables(default_allocator())
  199. , _byte_code(default_allocator())
  200. {
  201. }
  202. s32 parse_animations(StateInfo &si, const JsonArray &animations)
  203. {
  204. for (u32 i = 0; i < array::size(animations); ++i) {
  205. TempAllocator4096 ta;
  206. JsonObject animation(ta);
  207. sjson::parse_object(animation, animations[i]);
  208. DynamicString animation_resource(ta);
  209. sjson::parse_string(animation_resource, animation["name"]);
  210. DATA_COMPILER_ASSERT_RESOURCE_EXISTS("sprite_animation"
  211. , animation_resource.c_str()
  212. , _opts
  213. );
  214. _opts.add_requirement("sprite_animation", animation_resource.c_str());
  215. AnimationInfo ai(ta);
  216. ai.name = sjson::parse_resource_name(animation["name"]);
  217. sjson::parse_string(ai.weight, animation["weight"]);
  218. vector::push_back(si.animations, ai);
  219. }
  220. DATA_COMPILER_ASSERT(vector::size(si.animations) > 0
  221. , _opts
  222. , "State must contain one animation at least"
  223. );
  224. return 0;
  225. }
  226. s32 parse_transitions(StateInfo &si, const JsonArray &transitions)
  227. {
  228. for (u32 i = 0; i < array::size(transitions); ++i) {
  229. TempAllocator4096 ta;
  230. JsonObject transition(ta);
  231. sjson::parse_object(transition, transitions[i]);
  232. DynamicString mode_str(ta);
  233. sjson::parse_string(mode_str, transition["mode"]);
  234. const u32 mode = name_to_transition_mode(mode_str.c_str());
  235. DATA_COMPILER_ASSERT(mode != TransitionMode::COUNT
  236. , _opts
  237. , "Unknown transition mode: '%s'"
  238. , mode_str.c_str()
  239. );
  240. TransitionInfo ti;
  241. ti.transition.event = sjson::parse_string_id(transition["event"]);
  242. ti.transition.state_offset = UINT32_MAX;
  243. ti.transition.mode = mode;
  244. ti.state = sjson::parse_guid(transition["to"]);
  245. vector::push_back(si.transitions, ti);
  246. }
  247. return 0;
  248. }
  249. s32 parse_states(const JsonArray &states)
  250. {
  251. for (u32 i = 0; i < array::size(states); ++i) {
  252. TempAllocator4096 ta;
  253. JsonObject state(ta);
  254. JsonArray animations(ta);
  255. JsonArray transitions(ta);
  256. sjson::parse_object(state, states[i]);
  257. sjson::parse_array(animations, state["animations"]);
  258. sjson::parse_array(transitions, state["transitions"]);
  259. StateInfo si(ta);
  260. sjson::parse_string(si.speed, state["speed"]);
  261. si.loop = sjson::parse_bool(state["loop"]);
  262. s32 err = 0;
  263. err = parse_transitions(si, transitions);
  264. DATA_COMPILER_ENSURE(err == 0, _opts);
  265. err = parse_animations(si, animations);
  266. DATA_COMPILER_ENSURE(err == 0, _opts);
  267. Guid guid;
  268. if (json_object::has(state, "id")) {
  269. guid = sjson::parse_guid(state["id"]);
  270. } else {
  271. guid = sjson::parse_guid(state["_guid"]);
  272. }
  273. DATA_COMPILER_ASSERT(!hash_map::has(_states, guid)
  274. , _opts
  275. , "State GUID duplicated"
  276. );
  277. hash_map::set(_states, guid, si);
  278. }
  279. return 0;
  280. }
  281. s32 parse_variables(const JsonArray &variables)
  282. {
  283. for (u32 i = 0; i < array::size(variables); ++i) {
  284. TempAllocator4096 ta;
  285. JsonObject variable(ta);
  286. sjson::parse_object(variable, variables[i]);
  287. VariableInfo vi(ta);
  288. vi.name = sjson::parse_string_id(variable["name"]);
  289. vi.value = sjson::parse_float(variable["value"]);
  290. sjson::parse_string(vi.name_string, variable["name"]);
  291. vector::push_back(_variables, vi);
  292. }
  293. return 0;
  294. }
  295. s32 compute_state_offsets()
  296. {
  297. // Limit byte code to 4K
  298. array::resize(_byte_code, 1024);
  299. u32 written = 0;
  300. const u32 num_variables = vector::size(_variables);
  301. const char **variables = (const char **)default_allocator().allocate(num_variables*sizeof(char *));
  302. for (u32 i = 0; i < num_variables; ++i)
  303. variables[i] = _variables[i].name_string.c_str();
  304. const u32 num_constants = 1;
  305. const char *constants[] =
  306. {
  307. "PI"
  308. };
  309. const f32 constant_values[] =
  310. {
  311. PI
  312. };
  313. auto cur = hash_map::begin(_states);
  314. auto end = hash_map::end(_states);
  315. for (; cur != end; ++cur) {
  316. HASH_MAP_SKIP_HOLE(_states, cur);
  317. const Guid &guid = cur->first;
  318. const StateInfo &si = cur->second;
  319. const u32 offset = _offset_accumulator.offset(vector::size(si.animations), vector::size(si.transitions));
  320. hash_map::set(_offsets, guid, offset);
  321. for (u32 i = 0; i < vector::size(si.animations); ++i) {
  322. const u32 num = expression_language::compile(si.animations[i].weight.c_str()
  323. , num_variables
  324. , variables
  325. , num_constants
  326. , constants
  327. , constant_values
  328. , array::begin(_byte_code) + written
  329. , array::size(_byte_code)
  330. );
  331. const_cast<AnimationInfo &>(si.animations[i]).bytecode_entry = num > 0 ? written : UINT32_MAX;
  332. written += num;
  333. }
  334. const u32 num = expression_language::compile(si.speed.c_str()
  335. , num_variables
  336. , variables
  337. , num_constants
  338. , constants
  339. , constant_values
  340. , array::begin(_byte_code) + written
  341. , array::size(_byte_code)
  342. );
  343. const_cast<StateInfo &>(si).speed_bytecode = num > 0 ? written : UINT32_MAX;
  344. written += num;
  345. }
  346. // Resize to total amount of written bytecode
  347. array::resize(_byte_code, written);
  348. default_allocator().deallocate(variables);
  349. return 0;
  350. }
  351. s32 parse(Buffer &buf)
  352. {
  353. TempAllocator4096 ta;
  354. JsonObject obj(ta);
  355. JsonArray states(ta);
  356. JsonArray variables(ta);
  357. sjson::parse(obj, buf);
  358. sjson::parse_array(states, obj["states"]);
  359. sjson::parse_array(variables, obj["variables"]);
  360. s32 err = 0;
  361. err = parse_states(states);
  362. DATA_COMPILER_ENSURE(err == 0, _opts);
  363. DATA_COMPILER_ASSERT(hash_map::size(_states) > 0
  364. , _opts
  365. , "State machine must contain one state at least"
  366. );
  367. _initial_state = sjson::parse_guid(obj["initial_state"]);
  368. DATA_COMPILER_ASSERT(hash_map::has(_states, _initial_state)
  369. , _opts
  370. , "Initial state references non-existing state"
  371. );
  372. err = parse_variables(variables);
  373. DATA_COMPILER_ENSURE(err == 0, _opts);
  374. err = compute_state_offsets();
  375. DATA_COMPILER_ENSURE(err == 0, _opts);
  376. return 0;
  377. }
  378. s32 write()
  379. {
  380. StateMachineResource smr;
  381. smr.version = RESOURCE_HEADER(RESOURCE_VERSION_STATE_MACHINE);
  382. smr.initial_state_offset = hash_map::get(_offsets, _initial_state, UINT32_MAX);
  383. smr.num_variables = vector::size(_variables);
  384. smr.variables_offset = _offset_accumulator._offset; // Offset of last state + 1
  385. smr.bytecode_size = array::size(_byte_code)*4;
  386. smr.bytecode_offset = smr.variables_offset + smr.num_variables*4*2;
  387. _opts.write(smr.version);
  388. _opts.write(smr.initial_state_offset);
  389. _opts.write(smr.num_variables);
  390. _opts.write(smr.variables_offset);
  391. _opts.write(smr.bytecode_size);
  392. _opts.write(smr.bytecode_offset);
  393. // Write states
  394. auto cur = hash_map::begin(_states);
  395. auto end = hash_map::end(_states);
  396. for (; cur != end; ++cur) {
  397. HASH_MAP_SKIP_HOLE(_states, cur);
  398. const StateInfo &si = cur->second;
  399. const u32 num_animations = vector::size(si.animations);
  400. const u32 num_transitions = vector::size(si.transitions);
  401. // Write speed
  402. _opts.write(si.speed_bytecode);
  403. // Write loop
  404. _opts.write(si.loop);
  405. // Write transitions
  406. TransitionArray ta;
  407. ta.num = num_transitions;
  408. _opts.write(ta.num);
  409. for (u32 i = 0; i < num_transitions; ++i) {
  410. Transition t = si.transitions[i].transition;
  411. t.state_offset = hash_map::get(_offsets, si.transitions[i].state, UINT32_MAX);
  412. _opts.write(t.event);
  413. _opts.write(t.state_offset);
  414. _opts.write(t.mode);
  415. }
  416. // Write animations
  417. AnimationArray aa;
  418. aa.num = num_animations;
  419. _opts.write(aa.num);
  420. for (u32 i = 0; i < num_animations; ++i) {
  421. Animation a;
  422. a.name = si.animations[i].name;
  423. a.bytecode_entry = si.animations[i].bytecode_entry;
  424. a.pad = 0;
  425. _opts.write(a.name);
  426. _opts.write(a.bytecode_entry);
  427. _opts.write(a.pad);
  428. }
  429. }
  430. // Write variables
  431. for (u32 i = 0; i < vector::size(_variables); ++i)
  432. _opts.write(_variables[i].name);
  433. for (u32 i = 0; i < vector::size(_variables); ++i)
  434. _opts.write(_variables[i].value);
  435. // Write bytecode
  436. for (u32 i = 0; i < array::size(_byte_code); ++i)
  437. _opts.write(_byte_code[i]);
  438. return 0;
  439. }
  440. };
  441. s32 compile(CompileOptions &opts)
  442. {
  443. Buffer buf = opts.read();
  444. StateMachineCompiler smc(opts);
  445. s32 err = 0;
  446. err = smc.parse(buf);
  447. DATA_COMPILER_ENSURE(err == 0, opts);
  448. return smc.write();
  449. }
  450. } // namespace state_machine_internal
  451. #endif // if CROWN_CAN_COMPILE
  452. } // namespace crown