quakeforge/libs/gib/gib_function.c

279 lines
6.4 KiB
C
Raw Normal View History

/*
#FILENAME#
#DESCRIPTION#
Copyright (C) 2002 #AUTHOR#
Author: #AUTHOR#
Date: #DATE#
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
*/
#ifdef HAVE_CONFIG_H
# include "config.h"
#endif
static __attribute__ ((used))
2003-02-14 22:42:11 +00:00
const char rcsid[] =
"$Id$";
#include <stdlib.h>
#include <string.h>
#include "QF/sys.h"
#include "QF/dstring.h"
#include "QF/hash.h"
#include "QF/cbuf.h"
#include "QF/va.h"
#include "QF/gib.h"
#include "gib_buffer.h"
#include "gib_tree.h"
#include "gib_function.h"
#include "gib_vars.h"
2003-02-14 22:42:11 +00:00
hashtab_t *gib_functions = 0;
/*
Hashtable callbacks
*/
static const char *
GIB_Function_Get_Key (void *ele, void *ptr)
{
2003-02-14 22:42:11 +00:00
return ((gib_function_t *) ele)->name;
}
static void
GIB_Function_Free (void *ele, void *ptr)
{
2003-02-14 22:42:11 +00:00
gib_function_t *func = (gib_function_t *) ele;
dstring_delete (func->text);
2003-02-14 22:42:11 +00:00
free ((void *) func->name);
if (func->program)
GIB_Tree_Free_Recursive (func->program);
if (func->script && !(--func->script->refs)) {
2003-02-14 22:42:11 +00:00
free ((void *) func->script->text);
free ((void *) func->script->file);
free (func->script);
}
2003-01-03 04:15:32 +00:00
free (func);
}
/*
GIB_Function_New
Builds a new function struct and returns
a pointer to it.
*/
static void
afree (void *data, void *unused)
{
free (data);
};
static gib_function_t *
GIB_Function_New (const char *name)
{
gib_function_t *new = calloc (1, sizeof (gib_function_t));
new->text = dstring_newstr ();
new->name = strdup (name);
new->arglist = llist_new (afree, NULL, NULL);
return new;
}
/*
GIB_Function_Define
Sets the program and text of a GIB function,
allocating one and adding it to the functions
hash if needed.
*/
gib_function_t *
2003-02-14 22:42:11 +00:00
GIB_Function_Define (const char *name, const char *text, gib_tree_t * program,
gib_script_t * script, hashtab_t * globals)
{
gib_function_t *func;
2003-02-14 22:42:11 +00:00
GIB_Tree_Ref (&program);
if (script)
script->refs++;
if (!gib_functions)
2003-02-14 22:42:11 +00:00
gib_functions =
Hash_NewTable (1024, GIB_Function_Get_Key, GIB_Function_Free, 0);
2003-02-14 22:42:11 +00:00
func = Hash_Find (gib_functions, name);
if (func) {
dstring_clearstr (func->text);
GIB_Tree_Unref (&func->program);
if (func->script && !(--func->script->refs)) {
2003-02-14 22:42:11 +00:00
free ((void *) func->script->text);
free ((void *) func->script->file);
free (func->script);
}
} else {
func = GIB_Function_New (name);
Hash_Add (gib_functions, func);
}
dstring_appendstr (func->text, text);
func->program = program;
func->globals = globals;
func->script = script;
return func;
}
/*
GIB_Function_Find
Looks up a function in the function hash
and returns a pointer to it on success,
0 otherwise
*/
gib_function_t *
GIB_Function_Find (const char *name)
{
if (!gib_functions)
return 0;
return (gib_function_t *) Hash_Find (gib_functions, name);
}
static void
GIB_Function_Prepare_Args (cbuf_t * cbuf, const char **args, unsigned int
argc, llist_t *arglist)
{
static hashtab_t *zero = 0;
unsigned int i, ind;
gib_var_t *var;
static char argss[] = "args";
auto qboolean iterate (char *arg, llist_node_t *node);
qboolean
iterate (char *arg, llist_node_t *node)
{
var = GIB_Var_Get_Complex (&GIB_DATA(cbuf)->locals, &zero,
arg, &ind, true);
if (!var->array[0].value)
var->array[0].value = dstring_newstr ();
dstring_copystr (var->array[0].value, args[i]);
i++;
return i < argc;
}
i = 1; llist_iterate (arglist, LLIST_ICAST (iterate));
var =
GIB_Var_Get_Complex (&GIB_DATA (cbuf)->locals, &zero, argss,
&ind, true);
var->array = realloc (var->array, sizeof (struct gib_varray_s) * argc);
memset (var->array + 1, 0, (argc - 1) * sizeof (struct gib_varray_s));
var->size = argc;
for (i = 0; i < argc; i++) {
if (var->array[i].value)
dstring_clearstr (var->array[i].value);
else
var->array[i].value = dstring_newstr ();
dstring_appendstr (var->array[i].value, args[i]);
}
}
static void
GIB_Function_Prepare_Args_D (cbuf_t * cbuf, dstring_t **args, unsigned int
argc, llist_t *arglist)
{
static hashtab_t *zero = 0;
unsigned int i, ind;
2003-02-14 22:42:11 +00:00
gib_var_t *var;
static char argss[] = "args";
auto qboolean iterate (char *arg, llist_node_t *node);
qboolean
iterate (char *arg, llist_node_t *node)
{
var = GIB_Var_Get_Complex (&GIB_DATA(cbuf)->locals, &zero,
arg, &ind, true);
if (!var->array[0].value)
var->array[0].value = dstring_newstr ();
dstring_copystr (var->array[0].value, args[i]->str);
i++;
return i < argc;
}
i = 1; llist_iterate (arglist, LLIST_ICAST (iterate));
2003-02-14 22:42:11 +00:00
var =
GIB_Var_Get_Complex (&GIB_DATA (cbuf)->locals, &zero, argss,
&ind, true);
var->array = realloc (var->array, sizeof (struct gib_varray_s) * argc);
memset (var->array + 1, 0, (argc - 1) * sizeof (struct gib_varray_s));
var->size = argc;
for (i = 0; i < argc; i++) {
if (var->array[i].value)
dstring_clearstr (var->array[i].value);
else
var->array[i].value = dstring_newstr ();
dstring_appendstr (var->array[i].value, args[i]->str);
}
}
/*
GIB_Function_Execute
Prepares a buffer to execute
a GIB function with certain arguments
*/
int
GIB_Function_Execute (cbuf_t * cbuf, gib_function_t * func, const char ** args,
2003-02-14 22:42:11 +00:00
unsigned int argc)
{
if (argc < func->minargs)
return -1;
GIB_Tree_Ref (&func->program);
if (func->script)
func->script->refs++;
GIB_Buffer_Set_Program (cbuf, func->program);
2003-02-14 22:42:11 +00:00
GIB_DATA (cbuf)->script = func->script;
GIB_DATA (cbuf)->globals = func->globals;
GIB_Function_Prepare_Args (cbuf, args, argc, func->arglist);
return 0;
}
int
GIB_Function_Execute_D (cbuf_t * cbuf, gib_function_t * func, dstring_t ** args,
unsigned int argc)
{
if (argc < func->minargs)
return -1;
GIB_Tree_Ref (&func->program);
if (func->script)
func->script->refs++;
GIB_Buffer_Set_Program (cbuf, func->program);
GIB_DATA (cbuf)->script = func->script;
GIB_DATA (cbuf)->globals = func->globals;
GIB_Function_Prepare_Args_D (cbuf, args, argc, func->arglist);
return 0;
}