mirror of
https://github.com/DarkPlacesEngine/gmqcc.git
synced 2024-11-27 22:22:17 +00:00
90 lines
2.9 KiB
C
90 lines
2.9 KiB
C
/*
|
|
* Copyright (C) 2012
|
|
* Dale Weiler
|
|
*
|
|
* 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 <string.h>
|
|
#include <stdint.h> /* replace if stdint.h doesn't exist! */
|
|
#include <limits.h>
|
|
#include "gmqcc.h"
|
|
static typedef_node *typedef_table[1024];
|
|
void typedef_init() {
|
|
int i;
|
|
for(i = 0; i < sizeof(typedef_table)/sizeof(*typedef_table); i++)
|
|
typedef_table[i] = NULL;
|
|
}
|
|
|
|
unsigned int typedef_hash(const char *s) {
|
|
unsigned int hash = 0;
|
|
unsigned int size = strlen(s);
|
|
unsigned int iter;
|
|
|
|
for (iter = 0; iter < size; iter++) {
|
|
hash += s[iter];
|
|
hash += (hash << 10);
|
|
hash ^= (hash >> 6);
|
|
}
|
|
hash += (hash << 3);
|
|
hash ^= (hash >> 11);
|
|
hash += (hash << 15);
|
|
|
|
return hash % 1024;
|
|
}
|
|
|
|
typedef_node *typedef_find(const char *s) {
|
|
unsigned int hash = typedef_hash(s);
|
|
typedef_node *find = typedef_table[hash];
|
|
return find;
|
|
}
|
|
|
|
void typedef_clear() {
|
|
int i;
|
|
for(i = 1024; i > 0; i--)
|
|
if(typedef_table[i])
|
|
mem_d(typedef_table[i]);
|
|
}
|
|
|
|
int typedef_add(const char *from, const char *to) {
|
|
unsigned int hash = typedef_hash(to);
|
|
typedef_node *find = typedef_table[hash];
|
|
if (find)
|
|
return error(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) {
|
|
|
|
typedef_table[hash] = mem_a(sizeof(typedef_node));
|
|
typedef_table[hash]->name = strdup(from);
|
|
return -100;
|
|
} else {
|
|
/* search the typedefs for it (typedef-a-typedef?) */
|
|
typedef_node *find = typedef_table[typedef_hash(from)];
|
|
if (find) {
|
|
typedef_table[hash] = mem_a(sizeof(typedef_node));
|
|
typedef_table[hash]->name = strdup(find->name);
|
|
return -100;
|
|
}
|
|
}
|
|
return error(ERROR_PARSE, "cannot typedef `%s` (not a type)\n", from);
|
|
}
|