2 * FML interpreter. Europagate, 1995
5 * Revision 1.4 1995/03/02 08:06:09 adam
6 * Fml function strsub implemented. New test files marc[45].fml.
7 * New test options in fmltest.
9 * Revision 1.3 1995/02/23 08:32:06 adam
12 * Revision 1.1.1.1 1995/02/06 13:48:10 adam
13 * First version of the FML interpreter. It's slow and memory isn't
14 * freed properly. In particular, the FML nodes aren't released yet.
26 struct fml_sym_info info;
30 struct fml_sym *level_link;
36 struct fml_sym **array;
37 struct fml_sym *level_link_0;
38 struct fml_sym *level_link_n;
39 struct fml_sym *free_list;
42 static struct fml_sym *sym_alloc (struct fml_sym_tab *tab)
44 struct fml_sym *p = tab->free_list;
49 tab->free_list = p = malloc (sizeof(*p) * SYM_CHUNK);
51 for (i = 0; i<SYM_CHUNK-1; i++)
55 tab->free_list = p->next;
59 static void sym_release (struct fml_sym_tab *tab, struct fml_sym *p)
61 p->next = tab->free_list;
65 struct fml_sym_tab *fml_sym_open (void)
67 struct fml_sym_tab *tab;
70 tab = malloc (sizeof (*tab));
74 tab->level_link_0 = NULL;
75 tab->level_link_n = NULL;
76 tab->free_list = NULL;
78 tab->array = malloc (sizeof(*tab->array) * tab->hash);
84 for (i = 0; i<tab->hash; i++)
89 void fml_sym_close (struct fml_sym_tab **tabp)
91 struct fml_sym *sym, *sym1;
93 for (i = (*tabp)->hash; --i >= 0; )
94 for (sym = (*tabp)->array[i]; sym; sym = sym1)
104 void fml_sym_push (struct fml_sym_tab *tab)
109 void fml_sym_pop (struct fml_sym_tab *tab, void (*ph)(struct fml_sym_info *i))
111 struct fml_sym **fsp;
114 assert (tab->level > 0);
115 for (i = tab->hash; --i >= 0; )
117 fsp = tab->array + i;
120 if ((*fsp)->level == tab->level)
129 sym_release (tab, fs);
138 static unsigned fml_sym_hash (const char *s, unsigned hash)
147 static struct fml_sym_info *sym_add (struct fml_sym_tab *tab,
148 const char *s, int level)
152 struct fml_sym **sym_entry;
154 cp = malloc (strlen(s)+1);
159 sym = sym_alloc (tab);
161 sym_entry = tab->array + fml_sym_hash (s, tab->hash);
163 sym->next = *sym_entry;
168 sym->level_link = tab->level_link_n;
169 tab->level_link_n = sym;
173 sym->level_link = tab->level_link_0;
174 tab->level_link_0 = sym;
179 struct fml_sym_info *fml_sym_add (struct fml_sym_tab *tab, const char *s)
181 return sym_add (tab, s, 0);
184 struct fml_sym_info *fml_sym_add_local (struct fml_sym_tab *tab, const char *s)
186 return sym_add (tab, s, tab->level);
189 static struct fml_sym_info *sym_lookup (struct fml_sym_tab *tab,
190 const char *s, int level)
193 struct fml_sym *sym0 = NULL;
194 struct fml_sym **sym_entry;
196 sym_entry = tab->array + fml_sym_hash (s, tab->hash);
197 for (sym = *sym_entry; sym; sym = sym->next)
198 if (!strcmp (sym->name, s))
199 if (!sym0 || sym->level > sym0->level)
203 assert (sym0->level <= tab->level);
204 if (level && sym0->level != level)
212 struct fml_sym_info *fml_sym_lookup (struct fml_sym_tab *tab, const char *s)
214 return sym_lookup (tab, s, 0);
217 struct fml_sym_info *fml_sym_lookup_local (struct fml_sym_tab *tab,
220 return sym_lookup (tab, s, tab->level);