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 ASTIR_COMMON_H__
24 #define ASTIR_COMMON_H__
26 #define MEM_VECTOR_PROTO(Towner, Tmem, mem) \
27 void Towner##_##mem##_add(Towner*, Tmem); \
28 void Towner##_##mem##_remove(Towner*, size_t);
30 #define MEM_VECTOR_PROTO_ALL(Towner, Tmem, mem) \
31 MEM_VECTOR_PROTO(Towner, Tmem, mem) \
32 qbool 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 void Tself##_##mem##_add(Tself *self, Twhat f) \
43 if (self->mem##_count == self->mem##_alloc) { \
44 if (!self->mem##_alloc) \
45 self->mem##_alloc = 16; \
47 self->mem##_alloc *= 2; \
48 self->mem = (Twhat*)realloc(self->mem, \
49 sizeof(Twhat) * self->mem##_alloc); \
51 self->mem[self->mem##_count++] = f; \
54 #define _MEM_VEC_FUN_REMOVE(Tself, Twhat, mem) \
55 void Tself##_##mem##_remove(Tself *self, size_t idx) \
58 if (idx >= self->mem##_count) \
60 for (i = idx; i < self->mem##_count-1; ++i) \
61 self->mem[i] = self->mem[i+1]; \
62 self->mem##_count--; \
63 if (self->mem##_count < self->mem##_count/2) \
65 self->mem##_alloc /= 2; \
66 self->mem = (Twhat*)realloc(self->mem, \
67 self->mem##_alloc * sizeof(Twhat)); \
71 #define _MEM_VEC_FUN_FIND(Tself, Twhat, mem) \
72 qbool Tself##_##mem##_find(Tself *self, Twhat obj, size_t *idx) \
75 for (i = 0; i < self->mem##_count; ++i) { \
76 if (self->mem[i] == obj) { \
85 #define _MEM_VEC_FUN_CLEAR(Tself, mem) \
86 void Tself##_##mem##_clear(Tself *self) \
90 free((void*) self->mem); \
92 self->mem##_count = 0; \
93 self->mem##_alloc = 0; \
96 #define MEM_VECTOR_CLEAR(owner, mem) \
98 free((void*)((owner)->mem)); \
99 (owner)->mem = NULL; \
100 (owner)->mem##_count = 0; \
101 (owner)->mem##_alloc = 0
103 #define MEM_VECTOR_INIT(owner, mem) \
105 (owner)->mem = NULL; \
106 (owner)->mem##_count = 0; \
107 (owner)->mem##_alloc = 0; \
110 #define MEM_VEC_FUNCTIONS(Tself, Twhat, mem) \
111 _MEM_VEC_FUN_REMOVE(Tself, Twhat, mem) \
112 _MEM_VEC_FUN_ADD(Tself, Twhat, mem)
114 #define MEM_VEC_FUNCTIONS_ALL(Tself, Twhat, mem) \
115 MEM_VEC_FUNCTIONS(Tself, Twhat, mem) \
116 _MEM_VEC_FUN_CLEAR(Tself, mem) \
117 _MEM_VEC_FUN_FIND(Tself, Twhat, mem)
119 typedef enum { false, true } qbool;
131 /* "virtual" and internal types */
133 qc_variant, /* eg. OFS_RETURN/PARAM... */
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