-/*
- * Copyright (C) 2012, 2013, 2014
- * Dale Weiler
- * Wolfgang Bumiller
- *
- * 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.
- */
#ifndef GMQCC_HDR
#define GMQCC_HDR
#include <stdarg.h>
#include <stddef.h>
+#include <stdlib.h>
+#include <stdio.h>
#include <time.h>
#define GMQCC_VERSION_MAJOR 0
#define GMQCC_ARRAY_COUNT(X) (sizeof(X) / sizeof((X)[0]))
/* stat.c */
-void stat_info (void);
-char *stat_mem_strdup (const char *, size_t, const char *, bool);
-void stat_mem_deallocate(void *, size_t, const char *);
-void *stat_mem_reallocate(void *, size_t, size_t, const char *, const char *);
-void *stat_mem_allocate (size_t, size_t, const char *, const char *);
-
-#define mem_a(SIZE) stat_mem_allocate ((SIZE), __LINE__, __FILE__, #SIZE)
-#define mem_d(PTRN) stat_mem_deallocate((void*)(PTRN), __LINE__, __FILE__)
-#define mem_r(PTRN, SIZE) stat_mem_reallocate((void*)(PTRN), (SIZE), __LINE__, __FILE__, #SIZE)
-#define mem_af(SIZE, FILE, LINE) stat_mem_allocate ((SIZE), (LINE), (FILE), #SIZE)
+char *stat_mem_strdup(const char *, bool);
-/* TODO: rename to mem variations */
-#define util_strdup(SRC) stat_mem_strdup((char*)(SRC), __LINE__, __FILE__, false)
-#define util_strdupe(SRC) stat_mem_strdup((char*)(SRC), __LINE__, __FILE__, true)
+#define mem_a(SIZE) malloc(SIZE)
+#define mem_d(PTRN) free((void*)PTRN)
+#define mem_r(PTRN, SIZE) realloc((void*)PTRN, SIZE)
-/* util.c */
+#define util_strdup(SRC) stat_mem_strdup((char*)(SRC), false)
+#define util_strdupe(SRC) stat_mem_strdup((char*)(SRC), true)
-/*
- * Microsoft implements against the spec versions of ctype.h. Which
- * means what ever the current set locale is will render the actual
- * results of say isalpha('A') wrong for what ever retarded locale
- * is used. Simalerly these are also implemented inefficently on
- * some toolchains and end up becoming actual library calls. Perhaps
- * this is why tools like yacc provide their own? Regardless implementing
- * these as functions is equally as silly, the call overhead is not
- * justified when this could happen on every character from an input
- * stream. We provide our own as macros for absolute inlinability.
- */
#define util_isalpha(a) ((((unsigned)(a)|32)-'a') < 26)
#define util_isdigit(a) (((unsigned)(a)-'0') < 10)
#define util_islower(a) (((unsigned)(a)-'a') < 26)
const struct tm *util_localtime(const time_t *timer);
const char *util_ctime (const time_t *timer);
-typedef struct fs_file_s fs_file_t;
-
-bool util_isatty(fs_file_t *);
+bool util_isatty(FILE *);
size_t hash(const char *key);
/*
/* hidden interface */
void _util_vec_grow(void **a, size_t i, size_t s);
-void _util_vec_delete(void *vec, size_t line, const char *file);
+void _util_vec_delete(void *vec);
-#define GMQCC_VEC_WILLGROW(X,Y) ( \
+#define GMQCC_VEC_WILLGROW(X, Y) ( \
((!(X) || vec_meta(X)->used + Y >= vec_meta(X)->allocated)) ? \
(void)_util_vec_grow(((void**)&(X)), (Y), sizeof(*(X))) : \
(void)0 \
)
/* exposed interface */
-#define vec_meta(A) ((vector_t*)(((char *)(A)) - (sizeof(vector_t) + 4)))
-#define vec_free(A) ((void)((A) ? (_util_vec_delete((void *)(A), __LINE__, __FILE__), (A) = NULL) : 0))
+#define vec_meta(A) ((vector_t*)(((char *)(A)) - sizeof(vector_t)))
+#define vec_free(A) ((void)((A) ? (_util_vec_delete((void *)(A)), (A) = NULL) : 0))
#define vec_push(A,V) (GMQCC_VEC_WILLGROW((A),1), (A)[vec_meta(A)->used++] = (V))
#define vec_size(A) ((A) ? vec_meta(A)->used : 0)
#define vec_add(A,N) (GMQCC_VEC_WILLGROW((A),(N)), vec_meta(A)->used += (N), &(A)[vec_meta(A)->used-(N)])
struct hash_node_t **table;
} hash_table_t, *ht;
-/*
- * hashtable implementation:
- *
- * Note:
- * This was designed for pointers: you manage the life of the object yourself
- * if you do use this for non-pointers please be warned that the object may not
- * be valid if the duration of it exceeds (i.e on stack). So you need to allocate
- * yourself, or put those in global scope to ensure duration is for the whole
- * runtime.
- *
- * 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
- *
- * example of use:
- *
- * ht foo = util_htnew(1024);
- * int data = 100;
- * char *test = "hello world\n";
- * util_htset(foo, "foo", (void*)&data);
- * util_gtset(foo, "bar", (void*)test);
- *
- * printf("foo: %d, bar %s",
- * *((int *)util_htget(foo, "foo")),
- * ((char*)util_htget(foo, "bar"))
- * );
- *
- * util_htdel(foo);
- */
hash_table_t *util_htnew (size_t size);
-void util_htrem (hash_table_t *ht, void (*callback)(void *data));
-void util_htset (hash_table_t *ht, const char *key, void *value);
-void util_htdel (hash_table_t *ht);
-size_t util_hthash(hash_table_t *ht, const char *key);
-void util_htseth(hash_table_t *ht, const char *key, size_t hash, void *value);
-void util_htrmh (hash_table_t *ht, const char *key, size_t bin, void (*cb)(void*));
-void util_htrm (hash_table_t *ht, const char *key, void (*cb)(void*));
-
-void *util_htget (hash_table_t *ht, const char *key);
-void *util_htgeth(hash_table_t *ht, const char *key, size_t hash);
-
-int util_snprintf(char *str, size_t, const char *fmt, ...);
-
-
-/* fs.c */
-#define FS_FILE_SEEK_SET 0
-#define FS_FILE_SEEK_CUR 1
-#define FS_FILE_SEEK_END 2
-#define FS_FILE_EOF -1
-
-typedef struct fs_dir_s fs_dir_t;
-/*typedef struct fs_file_s fs_file_t;*/
-typedef struct dirent fs_dirent_t;
-
-void fs_file_close (fs_file_t *);
-int fs_file_error (fs_file_t *);
-int fs_file_getc (fs_file_t *);
-int fs_file_printf (fs_file_t *, const char *, ...);
-int fs_file_puts (fs_file_t *, const char *);
-int fs_file_seek (fs_file_t *, long int, int);
-long fs_file_tell (fs_file_t *);
-int fs_file_flush (fs_file_t *);
-
-size_t fs_file_read (void *, size_t, size_t, fs_file_t *);
-size_t fs_file_write (const void *, size_t, size_t, fs_file_t *);
-
-fs_file_t *fs_file_open (const char *, const char *);
-int fs_file_getline(char **, size_t *, fs_file_t *);
-
-int fs_dir_make (const char *);
-fs_dir_t *fs_dir_open (const char *);
-int fs_dir_close (fs_dir_t *);
-fs_dirent_t *fs_dir_read (fs_dir_t *);
-
-
-/* correct.c */
-typedef struct correct_trie_s {
- void *value;
- struct correct_trie_s *entries;
-} correct_trie_t;
-
-correct_trie_t* correct_trie_new(void);
-
-typedef struct {
- char ***edits;
- size_t **lens;
-} correction_t;
-
-void correct_del (correct_trie_t*, size_t **);
-void correct_add (correct_trie_t*, size_t ***, const char *);
-char *correct_str (correction_t *, correct_trie_t*, const char *);
-void correct_init(correction_t *);
-void correct_free(correction_t *);
-
+void util_htrem(hash_table_t *ht, void (*callback)(void *data));
+void util_htset(hash_table_t *ht, const char *key, void *value);
+void util_htdel(hash_table_t *ht);
+size_t util_hthash(hash_table_t *ht, const char *key);
+void util_htseth(hash_table_t *ht, const char *key, size_t hash, void *value);
+void util_htrmh(hash_table_t *ht, const char *key, size_t bin, void (*cb)(void*));
+void util_htrm(hash_table_t *ht, const char *key, void (*cb)(void*));
+void *util_htget(hash_table_t *ht, const char *key);
+void *util_htgeth(hash_table_t *ht, const char *key, size_t hash);
+int util_snprintf(char *str, size_t, const char *fmt, ...);
+int util_getline(char **, size_t *, FILE *);
/* code.c */
#define OFS_PARM6 (OFS_PARM5 +3)
#define OFS_PARM7 (OFS_PARM6 +3)
+typedef union {
+ int16_t s1;
+ uint16_t u1;
+} operand_t;
+
typedef struct {
uint16_t opcode;
-
- /* operand 1 */
- union {
- int16_t s1; /* signed */
- uint16_t u1; /* unsigned */
- } o1;
- /* operand 2 */
- union {
- int16_t s1; /* signed */
- uint16_t u1; /* unsigned */
- } o2;
- /* operand 3 */
- union {
- int16_t s1; /* signed */
- uint16_t u1; /* unsigned */
- } o3;
-
- /*
- * This is the same as the structure in darkplaces
- * {
- * unsigned short op;
- * short a,b,c;
- * }
- * But this one is more sane to work with, and the
- * type sizes are guranteed.
- */
+ operand_t o1;
+ operand_t o2;
+ operand_t o3;
} prog_section_statement_t;
typedef struct {
LVL_ERROR
};
-fs_file_t *con_default_out(void);
-fs_file_t *con_default_err(void);
+FILE *con_default_out(void);
+FILE *con_default_err(void);
void con_vprintmsg (int level, const char *name, size_t line, size_t column, const char *msgtype, const char *msg, va_list ap);
void con_printmsg (int level, const char *name, size_t line, size_t column, const char *msgtype, const char *msg, ...);
void con_init (void);
void con_reset (void);
void con_color (int);
-int con_change(const char *, const char *);
int con_verr (const char *, va_list);
int con_vout (const char *, va_list);
int con_err (const char *, ...);
extern opts_cmd_t opts;
-#define OPTS_GENERIC(f,i) (!! (((f)[(i)/32]) & (1<< (unsigned)((i)%32))))
+#define OPTS_GENERIC(f,i) (!! (((f)[(i)/32]) & (1U << (unsigned)((i)%32))))
#define OPTS_FLAG(i) OPTS_GENERIC(opts.flags, (i))
#define OPTS_WARN(i) OPTS_GENERIC(opts.warn, (i))