6 #define REGISTER_INIT(ns, id) [[accumulate]] void Register_##ns##_##id##_init(entity this)
7 #define REGISTER_INIT_POST(ns, id) [[accumulate]] void Register_##ns##_##id##_init_post(entity this)
9 #define REGISTRY(id, max) \
10 void Register##id() {} \
11 const int id##_MAX = max; \
12 noref entity id[id##_MAX], id##_first, id##_last; \
16 * Register a new entity with a global constructor.
17 * Must be followed by a semicolon or a function body with a `this` parameter.
18 * Wrapper macros may perform actions after user initialization like so:
19 * #define REGISTER_FOO(id) \
20 * REGISTER(RegisterFoos, FOO, FOOS, id, m_id, NEW(Foo)); \
21 * REGISTER_INIT_POST(FOO, id) { \
22 * print("Registering foo #", this.m_id + 1, "\n"); \
24 * REGISTER_INIT(FOO, id)
26 * Don't forget to forward declare `initfunc` and call `REGISTER_REGISTRY`:
27 * void RegisterFoos();
28 * REGISTER_REGISTRY(RegisterFoos)
30 * @param initfunc The global constructor to accumulate into
31 * @param ns Short for namespace, prefix for each global (ns##_##id)
32 * @param array The array to add each entity to. Also requires `array##_first` and `array##_last` to be defined
33 * @param id The identifier of the current entity being registered
34 * @param fld The field to store the current count into
35 * @param inst An expression to create a new instance, invoked for every registration
37 #define REGISTER(initfunc, ns, array, id, fld, inst) \
39 REGISTER_INIT(ns, id) {} \
40 REGISTER_INIT_POST(ns, id) {} \
41 void Register_##ns##_##id() \
43 if (array##_COUNT >= array##_MAX) LOG_FATALF("Registry capacity exceeded (%s)", ftos(array##_MAX)); \
46 this.fld = array##_COUNT; \
47 array[array##_COUNT++] = this; \
48 if (!array##_first) array##_first = this; \
49 if (array##_last) array##_last.REGISTRY_NEXT = this; \
50 array##_last = this; \
51 Register_##ns##_##id##_init(this); \
52 Register_##ns##_##id##_init_post(this); \
54 ACCUMULATE_FUNCTION(initfunc, Register_##ns##_##id) \
57 /** internal next pointer */
58 #define REGISTRY_NEXT enemy
59 .entity REGISTRY_NEXT;
61 #define REGISTRY_SORT(id, field, skip) \
62 void _REGISTRY_SWAP_##id(int i, int j, entity pass) \
64 i += skip; j += skip; \
66 entity a = id[i], b = id[j]; \
70 entity a_next = a.REGISTRY_NEXT, b_next = b.REGISTRY_NEXT; \
71 a.REGISTRY_NEXT = b_next; \
72 b.REGISTRY_NEXT = a_next; \
74 if (i == 0) id##_first = b; \
75 else id[i - 1].REGISTRY_NEXT = b; \
77 if (j == 0) id##_first = a; \
78 else id[j - 1].REGISTRY_NEXT = a; \
80 float _REGISTRY_CMP_##id(int i, int j, entity pass) \
82 i += skip; j += skip; \
83 string a = id[i].field; \
84 string b = id[j].field; \
85 return strcasecmp(a, b); \
87 STATIC_INIT(Registry_sort_##id) \
89 heapsort(id##_COUNT - (skip), _REGISTRY_SWAP_##id, _REGISTRY_CMP_##id, NULL); \