gmqcc/typedef.c

86 lines
3.1 KiB
C
Raw Normal View History

2012-04-09 23:47:20 +00:00
/*
* Copyright (C) 2012
2012-04-17 20:24:22 +00:00
* Dale Weiler
2012-04-09 23:47:20 +00:00
*
* Permission is hereby granted, free of charge, to any person obtaining a copy of
* this software and associated documentation files (the "Software"), to deal in
* the Software without restriction, including without limitation the rights to
* use, copy, modify, merge, publish, distribute, sublicense, and/or sell copies
* of the Software, and to permit persons to whom the Software is furnished to do
* so, subject to the following conditions:
*
* The above copyright notice and this permission notice shall be included in all
* copies or substantial portions of the Software.
*
* THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR
* IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY,
* FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL THE
* AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER
* LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM,
* OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN THE
* SOFTWARE.
*/
#include "gmqcc.h"
static typedef_node *typedef_table[1024];
2012-04-10 09:09:55 +00:00
2012-04-09 23:47:20 +00:00
void typedef_init() {
2012-04-17 20:24:22 +00:00
int i;
for(i = 0; i < sizeof(typedef_table)/sizeof(*typedef_table); i++)
typedef_table[i] = NULL;
2012-04-09 23:47:20 +00:00
}
uint32_t typedef_hash(const char *s) {
return util_crc32(s, strlen(s), 1024);
2012-04-09 23:47:20 +00:00
}
typedef_node *typedef_find(const char *s) {
2012-04-17 20:24:22 +00:00
unsigned int hash = typedef_hash(s);
typedef_node *find = typedef_table[hash];
return find;
2012-04-09 23:47:20 +00:00
}
void typedef_clear() {
2012-04-17 20:24:22 +00:00
int i;
for(i = 1024; i > 0; i--) {
if(typedef_table[i]) {
mem_d(typedef_table[i]->name);
mem_d(typedef_table[i]);
}
}
}
2012-04-28 09:25:19 +00:00
int typedef_add(lex_file *file, const char *from, const char *to) {
2012-04-17 20:24:22 +00:00
unsigned int hash = typedef_hash(to);
typedef_node *find = typedef_table[hash];
if (find)
return error(file, ERROR_PARSE, "typedef for %s already exists or conflicts\n", to);
/* check if the type exists first */
if (strncmp(from, "float", sizeof("float")) == 0 ||
strncmp(from, "vector", sizeof("vector")) == 0 ||
strncmp(from, "string", sizeof("string")) == 0 ||
strncmp(from, "entity", sizeof("entity")) == 0 ||
strncmp(from, "void", sizeof("void")) == 0) {
2012-04-27 09:33:02 +00:00
typedef_table[hash] = mem_a(sizeof(typedef_node));
if (typedef_table[hash])
typedef_table[hash]->name = util_strdup(from);
else
return error(file, ERROR_PARSE, "ran out of resources for typedef %s\n", to);
2012-04-17 20:24:22 +00:00
return -100;
} else {
/* search the typedefs for it (typedef-a-typedef?) */
typedef_node *find = typedef_table[typedef_hash(from)];
if (find) {
2012-04-27 09:33:22 +00:00
typedef_table[hash] = mem_a(sizeof(typedef_node));
2012-04-27 09:33:02 +00:00
if (typedef_table[hash])
typedef_table[hash]->name = util_strdup(find->name);
else
return error(file, ERROR_PARSE, "ran out of resources for typedef %s\n", to);
2012-04-17 20:24:22 +00:00
return -100;
}
}
return error(file, ERROR_PARSE, "cannot typedef `%s` (not a type)\n", from);
}