mirror of
https://git.code.sf.net/p/quake/quakeforge
synced 2024-11-13 08:27:39 +00:00
ea3895805b
That which isn't rewritten is horribly broken. However, this does include a nice mechanism for building QC structs for emitting data. emit.c has been gutted in the spirit of "throw one away". There is much work to be done to get even variables emitted, let alone code. Things should be a little more fun from here on.
178 lines
4.5 KiB
C
178 lines
4.5 KiB
C
/*
|
|
qfcc.h
|
|
|
|
QuakeForge Code Compiler (main program)
|
|
|
|
Copyright (C) 1996-1997 id Software, Inc.
|
|
Copyright (C) 2001 Jeff Teunissen <deek@quakeforge.net>
|
|
Copyright (C) 2001 Bill Currie <bill@taniwha.org>
|
|
|
|
This program is free software; you can redistribute it and/or
|
|
modify it under the terms of the GNU General Public License
|
|
as published by the Free Software Foundation; either version 2
|
|
of the License, or (at your option) any later version.
|
|
|
|
This program is distributed in the hope that it will be useful,
|
|
but WITHOUT ANY WARRANTY; without even the implied warranty of
|
|
MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.
|
|
|
|
See the GNU General Public License for more details.
|
|
|
|
You should have received a copy of the GNU General Public License
|
|
along with this program; if not, write to:
|
|
|
|
Free Software Foundation, Inc.
|
|
59 Temple Place - Suite 330
|
|
Boston, MA 02111-1307, USA
|
|
|
|
$Id$
|
|
*/
|
|
|
|
#ifndef __qfcc_h
|
|
#define __qfcc_h
|
|
|
|
/** \defgroup qfcc QuakeC compiler
|
|
*/
|
|
|
|
#include <stdio.h>
|
|
#include "QF/pr_comp.h"
|
|
|
|
/** \defgroup qfcc_general General functions
|
|
\ingroup qfcc
|
|
*/
|
|
//@{
|
|
|
|
typedef struct srcline_s srcline_t;
|
|
struct srcline_s {
|
|
srcline_t *next;
|
|
string_t source_file;
|
|
int source_line;
|
|
};
|
|
|
|
/** Output generated by prog parsing.
|
|
*/
|
|
typedef struct pr_info_s {
|
|
struct type_s *types;
|
|
struct ex_label_s *labels;
|
|
|
|
struct strpool_s *strings;
|
|
|
|
struct codespace_s *code;
|
|
|
|
struct function_s *func_head;
|
|
struct function_s **func_tail;
|
|
dfunction_t *functions;
|
|
int num_functions;
|
|
|
|
struct defspace_s *near_data;
|
|
struct defspace_s *far_data;
|
|
struct defspace_s *entity_data;
|
|
struct scope_s *scope;
|
|
|
|
srcline_t *srcline_stack;
|
|
string_t source_file;
|
|
int source_line;
|
|
int error_count;
|
|
|
|
struct reloc_s *relocs;
|
|
|
|
struct pr_auxfunction_s *auxfunctions;
|
|
int auxfunctions_size;
|
|
int num_auxfunctions;
|
|
|
|
struct pr_lineno_s *linenos;
|
|
int linenos_size;
|
|
int num_linenos;
|
|
|
|
ddef_t *locals;
|
|
int locals_size;
|
|
int num_locals;
|
|
} pr_info_t;
|
|
|
|
extern pr_info_t pr;
|
|
|
|
|
|
extern char destfile[];
|
|
|
|
extern struct symtab_s *current_symtab;
|
|
|
|
#define G_GETSTR(s) (pr.strings->strings + (s))
|
|
#define G_var(t, o) (pr.near_data->data[o].t##_var)
|
|
#define G_FLOAT(o) G_var (float, o)
|
|
#define G_INT(o) G_var (integer, o)
|
|
#define G_VECTOR(o) G_var (vector, o)
|
|
#define G_STRING(o) G_GETSTR (G_var (string, o))
|
|
#define G_FUNCTION(o) G_var (func, o)
|
|
#define G_POINTER(t,o) ((t *)(pr.near_data->data + o))
|
|
#define G_STRUCT(t,o) (*G_POINTER (t, o))
|
|
|
|
#define POINTER_OFS(p) ((pr_type_t *) (p) - pr.near_data->data)
|
|
|
|
const char *strip_path (const char *filename);
|
|
|
|
/** Smart strdup.
|
|
|
|
Create a unique copy of a string. If the same string has been seen
|
|
before, does not create a new copy but rather returns the previously
|
|
seen string.
|
|
\param str The string to copy.
|
|
\return The unique copy of the string.
|
|
*/
|
|
const char *save_string (const char *str);
|
|
|
|
const char *make_string (char *token, char **end);
|
|
|
|
void clear_frame_macros (void);
|
|
extern FILE *yyin;
|
|
int yyparse (void);
|
|
extern int yydebug;
|
|
|
|
#ifdef _WIN32
|
|
char *fix_backslash (char *path);
|
|
#define NORMALIZE(x) fix_backslash (x)
|
|
#else
|
|
#define NORMALIZE(x) x
|
|
#endif
|
|
|
|
/** High-tide structure allocator for use in linked lists.
|
|
|
|
Using a free-list with the name of \c free_NAME, return a single element.
|
|
The type of the element must be a structure with a field named \c next.
|
|
When the free-list is empty, memory is claimed from the system in blocks.
|
|
elements may be returned to the pool by linking them into the free-list.
|
|
|
|
\param s The number of structures in the block.
|
|
\param t The structure type.
|
|
\param n The \c NAME portion of the \c free_NAME free-list.
|
|
\param v The destination of the pointer to the allocated
|
|
element. The contents of the allocated element will be
|
|
memset to 0.
|
|
|
|
\hideinitializer
|
|
*/
|
|
#define ALLOC(s, t, n, v) \
|
|
do { \
|
|
if (!free_##n) { \
|
|
int i; \
|
|
free_##n = malloc ((s) * sizeof (t)); \
|
|
for (i = 0; i < (s) - 1; i++) \
|
|
free_##n[i].next = &free_##n[i + 1];\
|
|
free_##n[i].next = 0; \
|
|
} \
|
|
v = free_##n; \
|
|
free_##n = free_##n->next; \
|
|
memset (v, 0, sizeof (*v)); \
|
|
} while (0)
|
|
|
|
/** Round \a x up to the next multiple of \a a.
|
|
\note \a a must be a power of two or this will break.
|
|
\note There are no side effects on \a x.
|
|
\param x The value to be rounded up.
|
|
\param a The rounding factor.
|
|
\return The rounded value.
|
|
*/
|
|
#define RUP(x,a) (((x) + ((a) - 1)) & ~((a) - 1))
|
|
|
|
//@}
|
|
|
|
#endif//__qfcc_h
|