struct memblock_t {
const char *file;
unsigned int line;
- unsigned int byte;
+ size_t byte;
+ struct memblock_t *next;
+ struct memblock_t *prev;
};
-void *util_memory_a(unsigned int byte, unsigned int line, const char *file) {
+static struct memblock_t *mem_start = NULL;
+
+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*)((uintptr_t)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;
+ info->prev = NULL;
+ info->next = mem_start;
+ if (mem_start)
+ 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*)((uintptr_t)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, data, 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++;
- free(data);
+ if (info->prev)
+ info->prev->next = info->next;
+ if (info->next)
+ info->next->prev = info->prev;
+ if (info == mem_start)
+ mem_start = info->next;
+
+ 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() {
+ struct memblock_t *info;
+
if (!opts_memchk)
return;
+ for (info = mem_start; info; info = info->next) {
+ util_debug("MEM", "lost: % 8u (bytes) at %s:%u\n",
+ info->byte,
+ info->file,
+ info->line);
+ }
+
util_debug("MEM", "Memory information:\n\
Total allocations: %llu\n\
Total deallocations: %llu\n\
if (!opts_debug)
return;
+ if (!strcmp(area, "MEM") && !opts_memchk)
+ 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);
}
}
}
+/*
+ * 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.
+
+ * 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) { \
+ register uint##X##_t h= current; \
+ for (; len; --len, ++k) \
+ h = util_crc##X##_table[(h>>8)^((unsigned char)*k)]^(h<<8); \
+ return h; \
+}
+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; \
}
-CRC(32)
-CRC(16)
-#undef CRC
+*/
+
/*
* Implements libc getline for systems that don't have it, which is
if (!lineptr || !n || !stream)
return -1;
if (!*lineptr) {
- if (!(*lineptr = mem_a((*n=64))))
+ if (!(*lineptr = (char*)mem_a((*n=64))))
return -1;
}
int c = getc(stream);
if (chr < 2) {
- char *tmp = mem_a((*n+=(*n>16)?*n:64));
+ char *tmp = (char*)mem_a((*n+=(*n>16)?*n:64));
if (!tmp)
return -1;
+ memcpy(tmp, *lineptr, pos - *lineptr);
chr = *n + *lineptr - pos;
- strcpy(tmp,*lineptr);
if (!(*lineptr = tmp)) {
mem_d (tmp);
return -1;
*out = 0;
return sz-1;
}
+
+FILE *util_fopen(const char *filename, const char *mode)
+{
+#ifdef WIN32
+ FILE *out;
+ if (fopen_s(&out, filename, mode) != 0)
+ return NULL;
+ return out;
+#else
+ return fopen(filename, mode);
+#endif
+}
+
+bool util_filexists(const char *file) {
+ FILE *fp = fopen(file, "rb");
+ if (!fp) return false;
+
+ /* it exists */
+ fclose(fp);
+ return true;
+}
+
+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;
+}
projects / xonotic / gmqcc.git / blobdiff