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*)((unsigned char*)info+sizeof(struct memblock_t));
- if (!data) return NULL;
+ void *data = (void*)(info+1);
+ if (!info) return NULL;
info->line = line;
info->byte = byte;
info->file = file;
mem_start->prev = info;
mem_start = info;
- util_debug("MEM", "allocation: % 8u (bytes) address 0x%08X @ %s:%u\n", byte, data, file, line);
+ util_debug("MEM", "allocation: % 8u (bytes) address 0x%08X @ %s:%u\n", byte, data, file, line);
mem_at++;
mem_ab += info->byte;
}
void util_memory_d(void *ptrn, unsigned int line, const char *file) {
- void *data = NULL;
struct memblock_t *info = NULL;
if (!ptrn) return;
- data = (void*)((unsigned char *)ptrn-sizeof(struct memblock_t));
- info = (struct memblock_t*)data;
+ info = ((struct memblock_t*)ptrn - 1);
- util_debug("MEM", "released: % 8u (bytes) address 0x%08X @ %s:%u\n", info->byte, ptrn, file, line);
+ util_debug("MEM", "released: % 8u (bytes) address 0x%08X @ %s:%u\n", info->byte, ptrn, file, line);
mem_db += info->byte;
mem_dt++;
if (info == mem_start)
mem_start = info->next;
- free(data);
+ free(info);
+}
+
+void *util_memory_r(void *ptrn, size_t byte, unsigned int line, const char *file) {
+ struct memblock_t *oldinfo = NULL;
+
+ struct memblock_t *newinfo;
+
+ if (!ptrn)
+ return util_memory_a(byte, line, file);
+ if (!byte) {
+ util_memory_d(ptrn, line, file);
+ return NULL;
+ }
+
+ oldinfo = ((struct memblock_t*)ptrn - 1);
+ 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);
+
+ /* new data */
+ if (!newinfo) {
+ 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->prev = NULL;
+ newinfo->next = mem_start;
+ if (mem_start)
+ mem_start->prev = newinfo;
+ mem_start = newinfo;
+
+ mem_ab -= oldinfo->byte;
+ mem_ab += newinfo->byte;
+
+ free(oldinfo);
+
+ return newinfo+1;
}
void util_meminfo() {
return;
va_start(va, ms);
- fprintf (stdout, "DEBUG: ");
- fputc ('[', stdout);
- fprintf(stdout, "%s", area);
- fputs ("] ", stdout);
- vfprintf(stdout, ms, va);
+ con_out ("[%s] ", area);
+ con_vout(ms, va);
va_end (va);
}
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];
}
}
+/*
+ * CRC algorithms vary in the width of the polynomial, the value of said polynomial,
+ * the initial value used for the register, weather the bits of each byte are reflected
+ * before being processed, weather the algorithm itself feeds input bytes through the
+ * register or XORs them with a byte from one end and then straight into the table, as
+ * well as (but not limited to the idea of reflected versions) where the final register
+ * value becomes reversed, and finally weather the value itself is used to XOR the final
+ * register value. AS such you can already imagine how painfully annoying CRCs are,
+ * of course we stand to target Quake, which expects it's certian set of rules for proper
+ * calculation of a CRC.
+ *
+ * In most traditional CRC algorithms on uses a reflected table driven method where a value
+ * or register is reflected if it's bits are swapped around it's center. For example:
+ * take the bits 0101 is the 4-bit reflection of 1010, and respectfully 0011 would be the
+ * reflection of 1100. Quakle however expects a NON-Reflected CRC on the output, but still
+ * requires a final XOR on the values (0xFFFF and 0x0000) this is a standard CCITT CRC-16
+ * which I respectfully as a programmer don't agree with.
+ *
+ * So now you know what we target, and why we target it, despite how unsettling it may seem
+ * but those are what Quake seems to request.
+ */
+
/*
* This is an implementation of CRC32 & CRC16. The polynomials have been
* offline computed for faster generation at the cost of larger code size.
/*
* Implements a CRC function for X worth bits using (uint[X]_t)
* as type. and util_crc[X]_table.
- * Streamable QCC compatible CRC functions.
+
+ * Quake expects a non-reflective CRC.
*/
#define CRC(X) \
uint##X##_t util_crc##X(uint##X##_t current, const char *k, size_t len) { \
CRC(32)
CRC(16)
#undef CRC
+/*
+#define CRC(X) \
+uint##X##_t util_crc##X(const char *k, int len, const short clamp) { \
+ register uint##X##_t h= (uint##X##_t)0xFFFFFFFF; \
+ for (; len; --len, ++k) \
+ h = util_crc##X##_table[(h^((unsigned char)*k))&0xFF]^(h>>8); \
+ return (~h)%clamp; \
+}
+*/
+
/*
* Implements libc getline for systems that don't have it, which is
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