mirror of
https://git.code.sf.net/p/quake/quakeforge
synced 2025-03-01 15:01:00 +00:00
59fbd48a81
changes. There still remains some bugs to be squashed, a feature or two to add, and some polishing to be done. However, it seems to be in a workable state.
168 lines
4 KiB
C
168 lines
4 KiB
C
/*
|
|
#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__ ((unused)) 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/gib_parse.h"
|
|
#include "QF/gib_buffer.h"
|
|
#include "QF/gib_function.h"
|
|
#include "QF/gib_vars.h"
|
|
#include "QF/gib_tree.h"
|
|
#include "QF/va.h"
|
|
|
|
hashtab_t *gib_functions = 0;
|
|
|
|
/*
|
|
GIB_Function_New
|
|
|
|
Builds a new function struct and returns
|
|
a pointer to it.
|
|
*/
|
|
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);
|
|
return new;
|
|
}
|
|
|
|
/*
|
|
Hashtable callbacks
|
|
*/
|
|
static const char *
|
|
GIB_Function_Get_Key (void *ele, void *ptr)
|
|
{
|
|
return ((gib_function_t *)ele)->name;
|
|
}
|
|
static void
|
|
GIB_Function_Free (void *ele, void *ptr)
|
|
{
|
|
gib_function_t *func = (gib_function_t *)ele;
|
|
dstring_delete (func->text);
|
|
free ((void *)func->name);
|
|
if (func->program)
|
|
GIB_Tree_Free_Recursive (func->program, true);
|
|
free (func);
|
|
}
|
|
|
|
/*
|
|
GIB_Function_Define
|
|
|
|
Sets the program and text of a GIB function,
|
|
allocating one and adding it to the functions
|
|
hash if needed.
|
|
*/
|
|
void
|
|
GIB_Function_Define (const char *name, const char *text, gib_tree_t *program, hashtab_t *globals)
|
|
{
|
|
gib_function_t *func;
|
|
|
|
if (!gib_functions)
|
|
gib_functions = Hash_NewTable (1024, GIB_Function_Get_Key, GIB_Function_Free, 0);
|
|
func = Hash_Find(gib_functions, name);
|
|
if (func) {
|
|
dstring_clearstr (func->text);
|
|
GIB_Tree_Free_Recursive (func->program, true);
|
|
} else {
|
|
func = GIB_Function_New (name);
|
|
Hash_Add (gib_functions, func);
|
|
}
|
|
dstring_appendstr (func->text, text);
|
|
func->program = program;
|
|
func->globals = globals;
|
|
GIB_Tree_Add_Flag_Recursive (program, TREE_PERM); // Don't free this, we are using it now
|
|
program->flags |= TREE_FUNC; // Even when forcing a recursive free, don't free this
|
|
}
|
|
|
|
/*
|
|
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);
|
|
}
|
|
|
|
void
|
|
GIB_Function_Prepare_Args (cbuf_t *cbuf, cbuf_args_t *args)
|
|
{
|
|
static hashtab_t *zero = 0;
|
|
unsigned int i;
|
|
gib_var_t *var;
|
|
static char argss[] = "args", argcs[] = "argc";
|
|
|
|
var = GIB_Var_Get_Complex (&GIB_DATA(cbuf)->locals, &zero, argss, &i, true);
|
|
var->array = realloc (var->array, sizeof (dstring_t *) * args->argc);
|
|
memset (var->array+1, 0, (args->argc-1) * sizeof (dstring_t *));
|
|
var->size = args->argc;
|
|
for (i = 0; i < args->argc; i++) {
|
|
if (var->array[i])
|
|
dstring_clearstr(var->array[i]);
|
|
else
|
|
var->array[i] = dstring_newstr();
|
|
dstring_appendstr (var->array[i], args->argv[i]->str);
|
|
}
|
|
var = GIB_Var_Get_Complex (&GIB_DATA(cbuf)->locals, &zero, argcs, &i, true);
|
|
dsprintf(var->array[0], "%u", args->argc);
|
|
}
|
|
|
|
/*
|
|
GIB_Function_Execute
|
|
|
|
Prepares a buffer to execute
|
|
a GIB function with certain arguments
|
|
*/
|
|
|
|
void
|
|
GIB_Function_Execute (cbuf_t *cbuf, gib_function_t *func, cbuf_args_t *args)
|
|
{
|
|
GIB_DATA(cbuf)->program = func->program;
|
|
GIB_DATA(cbuf)->globals = func->globals;
|
|
GIB_Function_Prepare_Args (cbuf, args);
|
|
}
|