quakeforge/tools/qfcc/source/struct.c

316 lines
6.8 KiB
C
Raw Normal View History

2001-12-08 20:40:50 +00:00
/*
2002-10-22 14:53:18 +00:00
struct.c
2001-12-08 20:40:50 +00:00
2002-10-22 14:53:18 +00:00
structure support
2001-12-08 20:40:50 +00:00
2002-10-22 14:53:18 +00:00
Copyright (C) 2001 Bill Currie <bill@taniwha.org>
2001-12-08 20:40:50 +00:00
2002-10-22 14:53:18 +00:00
Author: Bill Currie <bill@taniwha.org>
Date: 2001/12/08
2001-12-08 20:40:50 +00:00
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
*/
2002-06-01 04:41:25 +00:00
#ifdef HAVE_CONFIG_H
# include "config.h"
#endif
static __attribute__ ((unused)) const char rcsid[] =
"$Id$";
2002-06-01 04:41:25 +00:00
#ifdef HAVE_STRING_H
# include <string.h>
#endif
#ifdef HAVE_STRINGS_H
# include <strings.h>
#endif
#include <stdlib.h>
#include <QF/dstring.h>
#include <QF/hash.h>
#include <QF/pr_obj.h>
2002-01-21 19:03:29 +00:00
#include <QF/sys.h>
#include <QF/va.h>
2002-06-04 21:23:39 +00:00
#include "def.h"
#include "emit.h"
2002-06-01 05:30:16 +00:00
#include "expr.h"
2002-06-04 18:44:03 +00:00
#include "immediate.h"
#include "qfcc.h"
#include "reloc.h"
#include "struct.h"
#include "type.h"
static hashtab_t *structs;
2002-01-21 19:03:29 +00:00
static hashtab_t *enums;
static const char *
structs_get_key (void *s, void *unused)
{
return ((struct_t *) s)->name;
}
static const char *
struct_field_get_key (void *f, void *unused)
{
return ((struct_field_t *) f)->name;
}
2002-01-21 19:03:29 +00:00
static const char *
enums_get_key (void *e, void *unused)
{
return ((enum_t *) e)->name;
}
struct_field_t *
2002-05-10 00:00:23 +00:00
new_struct_field (type_t *strct, type_t *type, const char *name,
visibility_t visibility)
{
struct_field_t *field;
if (!strct)
return 0;
field = malloc (sizeof (struct_field_t));
2002-05-10 00:00:23 +00:00
field->visibility = visibility;
field->name = name;
field->type = type;
2002-06-20 20:28:01 +00:00
if (((struct_t *) strct->class)->is_union) {
int size = type_size (type);
field->offset = 0;
strct->num_parms = strct->num_parms > size ? strct->num_parms : size;
} else {
field->offset = strct->num_parms;
strct->num_parms += type_size (type);
}
field->next = 0;
*strct->struct_tail = field;
strct->struct_tail = &field->next;
if (name)
Hash_Add (strct->struct_fields, field);
return field;
}
struct_field_t *
struct_find_field (type_t *strct, const char *name)
{
2002-05-17 19:34:40 +00:00
if (!structs || !strct)
return 0;
return Hash_Find (strct->struct_fields, name);
}
type_t *
init_struct (struct_t *strct, type_t *type, const char *name)
{
strct->name = name ? save_string (name) : 0;
strct->type = type;
strct->type->type = ev_struct;
strct->type->struct_tail = &strct->type->struct_head;
strct->type->struct_fields = Hash_NewTable (61, struct_field_get_key, 0, 0);
strct->type->class = (struct class_s *)strct;
strct->is_union = 0;
if (name) {
strct->type->name = save_string (name);
Hash_Add (structs, strct);
}
return strct->type;
}
type_t *
new_struct (const char *name)
{
struct_t *strct;
if (!structs) {
structs = Hash_NewTable (16381, structs_get_key, 0, 0);
}
2002-05-10 00:00:23 +00:00
if (name) {
strct = (struct_t *) Hash_Find (structs, name);
if (strct) {
2002-07-13 03:20:17 +00:00
error (0, "duplicate struct definition: `%s'", name);
2002-05-10 00:00:23 +00:00
return 0;
}
}
strct = malloc (sizeof (struct_t));
return init_struct (strct, new_type (), name);
}
2002-06-20 20:28:01 +00:00
type_t *
new_union (const char *name)
{
type_t *un = new_struct (name);
if (un)
((struct_t *) un->class)->is_union = 1;
return un;
}
type_t *
find_struct (const char *name)
{
struct_t *strct;
if (!structs)
return 0;
strct = (struct_t *) Hash_Find (structs, name);
if (strct)
return strct->type;
return 0;
}
2002-01-21 19:03:29 +00:00
2002-05-10 00:00:23 +00:00
void
copy_struct_fields (type_t *dst, type_t *src)
{
struct_field_t *s;
if (!src)
return;
for (s = src->struct_head; s; s = s->next)
new_struct_field (dst, s->type, s->name, s->visibility);
}
2002-05-15 19:10:23 +00:00
int
struct_compare_fields (struct type_s *s1, struct type_s *s2)
{
struct_field_t *f1 = s1->struct_head;
struct_field_t *f2 = s2->struct_head;
while (f1 && f2) {
if (strcmp (f1->name, f2->name)
|| f1->type != f2->type)
return 0;
f1 = f1->next;
f2 = f2->next;
}
return !((!f1) ^ !(f2));
}
def_t *
emit_struct(type_t *strct, const char *name)
{
struct_field_t *field;
int i, count;
def_t *ivars_def;
pr_ivar_list_t *ivars;
type_t *ivar_list;
dstring_t *encoding = dstring_newstr ();
dstring_t *ivars_name = dstring_newstr ();
if (!strct)
return 0;
for (count = 0, field = strct->struct_head; field; field = field->next)
if (field->name)
count++;
ivar_list = new_struct (0);
new_struct_field (ivar_list, &type_integer, "ivar_count", vis_public);
for (i = 0; i < count; i++)
new_struct_field (ivar_list, type_ivar, 0, vis_public);
dsprintf (ivars_name, "_OBJ_INSTANCE_VARIABLES_%s", name);
ivars_def = get_def (ivar_list, ivars_name->str, pr.scope, st_none);
if (ivars_def)
goto done;
ivars_def = get_def (ivar_list, ivars_name->str, pr.scope, st_static);
ivars_def->initialized = ivars_def->constant = 1;
ivars = &G_STRUCT (pr_ivar_list_t, ivars_def->ofs);
ivars->ivar_count = count;
for (i = 0, field = strct->struct_head; field; field = field->next) {
if (!field->name)
continue;
encode_type (encoding, field->type);
EMIT_STRING (ivars->ivar_list[i].ivar_name, field->name);
EMIT_STRING (ivars->ivar_list[i].ivar_type, encoding->str);
ivars->ivar_list[i].ivar_offset = field->offset;
dstring_clearstr (encoding);
i++;
}
done:
dstring_delete (encoding);
dstring_delete (ivars_name);
return ivars_def;
}
void
clear_structs (void)
{
if (structs)
Hash_FlushTable (structs);
}
2002-01-21 19:03:29 +00:00
void
process_enum (expr_t *enm)
{
expr_t *e = enm;
expr_t *c_enum = 0;
int enum_val = 0;
if (!enums) {
enums = Hash_NewTable (16381, enums_get_key, 0, 0);
}
while (e) {
expr_t *t = e->next;
e->next = c_enum;
c_enum = e;
e = t;
}
for (e = c_enum; e; e = e->next) {
expr_t *name = e;
expr_t *val = 0;
enum_t *new_enum;
if (name->type == ex_expr) {
val = name->e.expr.e2;
name = name->e.expr.e1;
}
if ((structs && find_struct (name->e.string_val))
|| get_enum (name->e.string_val)
|| get_def (NULL, name->e.string_val, pr.scope, st_none)) {
2002-01-21 19:03:29 +00:00
error (name, "%s redeclared", name->e.string_val);
continue;
}
if (val)
enum_val = val->e.integer_val;
new_enum = malloc (sizeof (enum_t));
if (!new_enum)
Sys_Error ("out of memory");
new_enum->name = name->e.string_val;
new_enum->value = enum_val++;
2002-01-21 19:03:29 +00:00
Hash_Add (enums, new_enum);
//printf ("%s = %d\n", new_enum->name, new_enum->value.e.integer_val);
}
}
expr_t *
get_enum (const char *name)
{
enum_t *e;
if (!enums)
return 0;
e = (enum_t *) Hash_Find (enums, name);
if (!e)
return 0;
return new_integer_expr (e->value);
2002-01-21 19:03:29 +00:00
}
void
clear_enums (void)
{
if (enums)
Hash_FlushTable (enums);
}