5 * Permission is hereby granted, free of charge, to any person obtaining a copy of
6 * this software and associated documentation files (the "Software"), to deal in
7 * the Software without restriction, including without limitation the rights to
8 * use, copy, modify, merge, publish, distribute, sublicense, and/or sell copies
9 * of the Software, and to permit persons to whom the Software is furnished to do
10 * so, subject to the following conditions:
12 * The above copyright notice and this permission notice shall be included in all
13 * copies or substantial portions of the Software.
15 * THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR
16 * IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY,
17 * FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL THE
18 * AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER
19 * LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM,
20 * OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN THE
23 #ifndef GMQCC_ASTIR_HDR
24 #define GMQCC_ASTIR_HDR
26 #define MEM_VECTOR_PROTO(Towner, Tmem, mem) \
27 bool GMQCC_WARN Towner##_##mem##_add(Towner*, Tmem); \
28 bool GMQCC_WARN Towner##_##mem##_remove(Towner*, size_t);
30 #define MEM_VECTOR_PROTO_ALL(Towner, Tmem, mem) \
31 MEM_VECTOR_PROTO(Towner, Tmem, mem) \
32 bool GMQCC_WARN Towner##_##mem##_find(Towner*, Tmem, size_t*); \
33 void Towner##_##mem##_clear(Towner*);
35 #define MEM_VECTOR_MAKE(Twhat, name) \
37 size_t name##_count; \
40 #define _MEM_VEC_FUN_ADD(Tself, Twhat, mem) \
41 bool GMQCC_WARN Tself##_##mem##_add(Tself *self, Twhat f) \
44 if (self->mem##_count == self->mem##_alloc) { \
45 if (!self->mem##_alloc) { \
46 self->mem##_alloc = 16; \
48 self->mem##_alloc *= 2; \
50 reall = (Twhat*)mem_a(sizeof(Twhat) * self->mem##_alloc); \
54 memcpy(reall, self->mem, sizeof(Twhat) * self->mem##_count); \
58 self->mem[self->mem##_count++] = f; \
62 #define _MEM_VEC_FUN_REMOVE(Tself, Twhat, mem) \
63 bool GMQCC_WARN Tself##_##mem##_remove(Tself *self, size_t idx) \
67 if (idx >= self->mem##_count) { \
68 return true; /* huh... */ \
70 for (i = idx; i < self->mem##_count-1; ++i) { \
71 self->mem[i] = self->mem[i+1]; \
73 self->mem##_count--; \
74 if (self->mem##_count < self->mem##_count/2) \
76 self->mem##_alloc /= 2; \
77 reall = (Twhat*)mem_a(sizeof(Twhat) * self->mem##_count); \
81 memcpy(reall, self->mem, sizeof(Twhat) * self->mem##_count); \
88 #define _MEM_VEC_FUN_FIND(Tself, Twhat, mem) \
89 bool GMQCC_WARN Tself##_##mem##_find(Tself *self, Twhat obj, size_t *idx) \
92 for (i = 0; i < self->mem##_count; ++i) { \
93 if (self->mem[i] == obj) { \
103 #define _MEM_VEC_FUN_CLEAR(Tself, mem) \
104 void Tself##_##mem##_clear(Tself *self) \
108 free((void*) self->mem); \
110 self->mem##_count = 0; \
111 self->mem##_alloc = 0; \
114 #define MEM_VECTOR_CLEAR(owner, mem) \
116 free((void*)((owner)->mem)); \
117 (owner)->mem = NULL; \
118 (owner)->mem##_count = 0; \
119 (owner)->mem##_alloc = 0
121 #define MEM_VECTOR_INIT(owner, mem) \
123 (owner)->mem = NULL; \
124 (owner)->mem##_count = 0; \
125 (owner)->mem##_alloc = 0; \
128 #define MEM_VEC_FUNCTIONS(Tself, Twhat, mem) \
129 _MEM_VEC_FUN_REMOVE(Tself, Twhat, mem) \
130 _MEM_VEC_FUN_ADD(Tself, Twhat, mem)
132 #define MEM_VEC_FUNCTIONS_ALL(Tself, Twhat, mem) \
133 MEM_VEC_FUNCTIONS(Tself, Twhat, mem) \
134 _MEM_VEC_FUN_CLEAR(Tself, mem) \
135 _MEM_VEC_FUN_FIND(Tself, Twhat, mem)
139 store_local, /* local, assignable for now, should get promoted later */
140 store_value, /* unassignable */
147 /* A shallow copy of a lex_file to remember where which ast node
150 typedef struct lex_ctx