struct memblock_t {
const char *file;
unsigned int line;
- unsigned int byte;
+ size_t byte;
struct memblock_t *next;
struct memblock_t *prev;
};
static struct memblock_t *mem_start = NULL;
-void *util_memory_a(unsigned int byte, unsigned int line, const char *file) {
+void *util_memory_a(size_t byte, unsigned int line, const char *file) {
struct memblock_t *info = malloc(sizeof(struct memblock_t) + byte);
void *data = (void*)(info+1);
if (!info) return NULL;
free(info);
}
-void *util_memory_r(void *ptrn, unsigned int byte, unsigned int line, const char *file) {
+void *util_memory_r(void *ptrn, size_t byte, unsigned int line, const char *file) {
struct memblock_t *oldinfo = NULL;
struct memblock_t *newinfo;
}
oldinfo = ((struct memblock_t*)ptrn - 1);
- newinfo = malloc(sizeof(struct memblock_t) + byte);
+ newinfo = ((struct memblock_t*)malloc(sizeof(struct memblock_t) + byte));
util_debug("MEM", "reallocation: % 8u -> %u (bytes) address 0x%08X -> 0x%08X @ %s:%u\n", oldinfo->byte, byte, ptrn, (void*)(newinfo+1), file, line);
util_memory_d(oldinfo+1, line, file);
return NULL;
}
+
+ /* copy old */
+ memcpy(newinfo+1, oldinfo+1, oldinfo->byte);
+
+ /* free old */
+ if (oldinfo->prev)
+ oldinfo->prev->next = oldinfo->next;
+ if (oldinfo->next)
+ oldinfo->next->prev = oldinfo->prev;
+ if (oldinfo == mem_start)
+ mem_start = oldinfo->next;
+
+ /* fill info */
newinfo->line = line;
newinfo->byte = byte;
newinfo->file = file;
- newinfo->next = oldinfo->next;
- newinfo->prev = oldinfo->prev;
- if (mem_start == oldinfo)
- mem_start = newinfo;
+ newinfo->prev = NULL;
+ newinfo->next = mem_start;
+ if (mem_start)
+ mem_start->prev = newinfo;
+ mem_start = newinfo;
- /* copy old */
- memcpy(newinfo+1, oldinfo+1, oldinfo->byte);
+ mem_ab -= oldinfo->byte;
+ mem_ab += newinfo->byte;
- /* drop old */
- mem_db += newinfo->byte;
- mem_db -= oldinfo->byte;
free(oldinfo);
- /* update */
return newinfo+1;
}
if(*((char *)&s))
return;
- for(; w < l; w++) {
- for(; i < s << 1; i++) {
+ for(; w < (size_t)l; w++) {
+ for(; i < (size_t)(s << 1); i++) {
unsigned char *p = (unsigned char *)m+w*s;
unsigned char t = p[i];
p[i] = p[s-i-1];
int c = getc(stream);
if (chr < 2) {
- char *tmp = (char*)mem_a((*n+=(*n>16)?*n:64));
- if (!tmp)
- return -1;
-
- memcpy(tmp, *lineptr, pos - *lineptr);
+ *n += (*n > 16) ? *n : 64;
chr = *n + *lineptr - pos;
- if (!(*lineptr = tmp)) {
- mem_d (tmp);
+ if (!(*lineptr = (char*)mem_r(*lineptr,*n)))
return -1;
- }
pos = *n - chr + *lineptr;
}
*out = *in + 'a' - 'A';
else
*out = *in;
+
+ *out = (isalpha(*in) && isupper(*in)) ? *in + 'a' - 'A' : *in;
}
*out = 0;
return sz-1;
}
+
+bool util_filexists(const char *file) {
+ FILE *fp = fopen(file, "rb");
+ if (!fp) return false;
+
+ /* it exists */
+ fclose(fp);
+ return true;
+}
+
FILE *util_fopen(const char *filename, const char *mode)
{
#ifdef WIN32
#endif
}
+void _util_vec_grow(void **a, size_t i, size_t s) {
+ size_t m = *a ? 2*_vec_beg(*a)+i : i+1;
+ void *p = mem_r((*a ? _vec_raw(*a) : NULL), s * m + sizeof(size_t)*2);
+ if (!*a)
+ ((size_t*)p)[1] = 0;
+ *a = (void*)((size_t*)p + 2);
+ _vec_beg(*a) = m;
+}
+
+/*
+ * Hash table for generic data, based on dynamic memory allocations
+ * all around. This is the internal interface, please look for
+ * EXPOSED INTERFACE comment below
+ */
+typedef struct hash_node_t {
+ char *key; /* the key for this node in table */
+ void *value; /* allocated memory storing data */
+ size_t size; /* size of data */
+ struct hash_node_t *next; /* next node (linked list) */
+} hash_node_t;
+
+
+size_t _util_hthash(hash_table_t *ht, const char *key) {
+ uint64_t val;
+ size_t len = strlen(key);
+ size_t itr = 0;
+
+
+ while (val < ((uint64_t)~1) /* MAX SIZE OF UINT64 */ && itr < len) {
+ val = val << 8;
+ val += key[itr];
+
+ itr++;
+ }
+
+ return val % ht->size;
+}
+
+hash_node_t *_util_htnewpair(const char *key, void *value, size_t size) {
+ hash_node_t *node;
+ if (!(node = mem_a(sizeof(hash_node_t))))
+ return NULL;
+
+ if (!(node->key = util_strdup(key))) {
+ mem_d(node);
+ return NULL;
+ }
+
+ if (!(node->value = mem_a(size))) {
+ mem_d(node->key);
+ mem_d(node);
+ return NULL;
+ }
+
+ memcpy(node->value, value, size);
+ node->size = size;
+ node->next = NULL;
+
+ return node;
+}
+
+/*
+ * EXPOSED INTERFACE for the hashtable implementation
+ * util_htnew(size) -- to make a new hashtable
+ * util_htset(table, key, value, sizeof(value)) -- to set something in the table
+ * util_htget(table, key) -- to get something from the table
+ * util_htdel(table) -- to delete the table
+ */
+hash_table_t *util_htnew(size_t size) {
+ hash_table_t *hashtable = NULL;
+ if (size < 1)
+ return NULL;
+
+ if (!(hashtable = mem_a(sizeof(hash_table_t))))
+ return NULL;
+
+ if (!(hashtable->table = mem_a(sizeof(hash_node_t*) * size))) {
+ mem_d(hashtable);
+ return NULL;
+ }
+
+ hashtable->size = size;
+ memset(hashtable->table, 0, sizeof(hash_node_t*) * size);
+
+ return hashtable;
+}
+
+void util_htset(hash_table_t *ht, const char *key, void *value, size_t size) {
+ size_t bin = 0;
+ hash_node_t *newnode = NULL;
+ hash_node_t *next = NULL;
+ hash_node_t *last = NULL;
+
+ bin = _util_hthash(ht, key);
+ next = ht->table[bin];
+
+ while (next && next->key && strcmp(key, next->key))
+ last = next, next = next->next;
+
+ /* already in table, do a replace */
+ if (next && next->key && !strcmp(key, next->key)) {
+ mem_d(next->value);
+ next->value = mem_a(size);
+ next->size = size;
+ memcpy(next->value, value, size);
+ } else {
+ /* not found, grow a pair man :P */
+ newnode = _util_htnewpair(key, value, size);
+ if (next == ht->table[bin]) {
+ newnode->next = next;
+ ht->table[bin] = newnode;
+ } else if (!next) {
+ last->next = newnode;
+ } else {
+ newnode->next = next;
+ last->next = newnode;
+ }
+ }
+}
+
+void *util_htget(hash_table_t *ht, const char *key) {
+ size_t bin = _util_hthash(ht, key);
+ hash_node_t *pair = ht->table[bin];
+
+ while (pair && pair->key && strcmp(key, pair->key) > 0)
+ pair = pair->next;
+
+ if (!pair || !pair->key || strcmp(key, pair->key) != 0)
+ return NULL;
+
+ return pair->value;
+}
+
+/*
+ * Free all allocated data in a hashtable, this is quite the amount
+ * of work.
+ */
+void util_htdel(hash_table_t *ht) {
+ size_t i = 0;
+ for (; i < ht->size; i++) {
+ hash_node_t *n = ht->table[i];
+
+ /* free in list */
+ while (n) {
+ if (n->key) mem_d(n->key);
+ if (n->value) mem_d(n->value);
+ n = n->next;
+ }
+
+ }
+ /* free table */
+ mem_d(ht->table);
+ mem_d(ht);
+}
projects / xonotic / gmqcc.git / blobdiff