nuq/source/gib_instructions.c

225 lines
4.2 KiB
C
Raw Normal View History

#ifdef HAVE_CONFIG_H
# include <config.h>
#endif
#include <string.h>
#include <ctype.h>
#include <stdlib.h>
#include "cvar.h"
#include "console.h"
#include "qargs.h"
#include "cmd.h"
#include "zone.h"
#include "quakefs.h"
#include "gib.h"
#include "gib_instructions.h"
#include "gib_interpret.h"
#include "gib_modules.h"
#include "gib_parse.h"
#include "gib_vars.h"
#include "gib_error.h"
#include "gib_stack.h"
static gib_inst_t *gibinstructions;
char *gib_subret;
void GIB_AddInstruction (char *name, gib_func_t func)
{
gib_inst_t *new;
new = malloc(sizeof(gib_inst_t));
new->name = malloc(strlen(name) + 1);
new->func = func;
strcpy(new->name, name);
new->next = gibinstructions;
gibinstructions = new;
}
gib_inst_t *GIB_Find_Instruction (char *name)
{
gib_inst_t *inst;
if (!(gibinstructions))
return 0;
for (inst = gibinstructions; strcmp(inst->name, name); inst = inst->next)
if (!(inst->next))
return 0;
return inst;
}
void GIB_Init_Instructions (void)
{
GIB_AddInstruction("echo", GIB_Echo_f);
GIB_AddInstruction("call", GIB_Call_f);
GIB_AddInstruction("return", GIB_Return_f);
GIB_AddInstruction("con", GIB_Con_f);
GIB_AddInstruction("listfetch", GIB_ListFetch_f);
}
int GIB_Echo_f (void)
{
Con_Printf(GIB_Argv(1));
return 0;
}
int GIB_Call_f (void)
{
gib_module_t *mod;
gib_sub_t *sub;
int i, ret;
mod = GIB_Get_ModSub_Mod (GIB_Argv(1));
if (!mod)
return GIB_E_NOSUB;
sub = GIB_Get_ModSub_Sub (GIB_Argv(1));
if (!sub)
return GIB_E_NOSUB;
gib_subargc = GIB_Argc() - 1;
gib_subargv[0] = sub->name;
for (i = 1; i <= gib_subargc; i++)
gib_subargv[i] = GIB_Argv(i + 1);
ret = GIB_Run_Sub (mod, sub);
if (gib_subret)
{
GIB_Var_Set("retval", gib_subret);
free (gib_subret);
}
gib_subret = 0;
return ret;
}
int GIB_VarPrint_f (void)
{
gib_var_t *var;
int i;
for (i = 1; i <= GIB_Argc(); i++)
{
var = GIB_Var_FindLocal(GIB_Argv(i));
if (!var)
return GIB_E_NOVAR;
Con_Printf("%s", var->value);
}
Con_Printf ("\n");
return 0;
}
int GIB_Return_f (void)
{
if (GIB_Argc() != 1)
return GIB_E_NUMARGS;
gib_subret = malloc(strlen(GIB_Argv(1)) + 1);
strcpy(gib_subret, GIB_Argv(1));
return GIB_E_RETURN; // Signal to block executor to return immediately
}
int GIB_ListFetch_f (void)
{
char *element;
gib_var_t *var;
int i, n, m;
if (GIB_Argc() != 2)
return GIB_E_NUMARGS;
if (!(var = GIB_Var_FindLocal(GIB_Argv(1))))
return GIB_E_NOVAR;
for (i = 0; isspace(var->value[i]); i++);
for (n = 1; n < atoi(GIB_Argv(2)); n++)
{
if ((m = GIB_Get_Arg (var->value + i)) < 1)
return GIB_E_ULIMIT;
i += m;
for (; isspace(var->value[i]); i++);
}
if ((m = GIB_Get_Arg (var->value + i)) < 1)
return GIB_E_ULIMIT;
element = malloc(m + 1);
strncpy(element, var->value + i, m);
element[m] = 0;
GIB_Var_Set ("retval", element);
return 0;
}
int GIB_Con_f (void)
{
if (GIB_Argc() != 1)
return GIB_E_NUMARGS;
Cmd_ExecuteString (GIB_Argv(1), src_command);
return 0;
}
int GIB_ExpandVars (char *source, char *buffer, int buffersize)
{
int i, n, m;
char varname[256];
gib_var_t *var;
for (i = 0, n = 0; i <= strlen(source); i++)
{
if (source[i] == '$')
{
m = 0;
while(isalnum(source[++i]))
varname[m++] = source[i];
varname[m++] = 0;
if (!(var = GIB_Var_FindLocal (varname)))
return GIB_E_NOVAR;
if (n + strlen(var->value) >= buffersize)
return GIB_E_BUFFER;
memcpy(buffer + n, var->value, strlen(var->value));
n += strlen(var->value);
i--;
}
else
{
if (n >= buffersize + 1)
return GIB_E_BUFFER;
buffer[n++] = source[i];
}
}
return 0;
}
int GIB_ExpandBackticks (char *source, char *buffer, int buffersize)
{
int i, n, m, ret;
char tick[256];
gib_var_t *var;
for (i = 0, n = 0; i <= strlen(source); i++)
{
if (source[i] == '`')
{
m = 0;
while(source[++i] != '`')
tick[m++] = source[i];
tick[m++] = 0;
ret = GIB_Run_Inst (tick);
if (ret)
{
return ret;
}
if (!(var = GIB_Var_FindLocal ("retval")))
return GIB_E_NOVAR;
if (n + strlen(var->value) >= buffersize)
return GIB_E_BUFFER;
memcpy(buffer + n, var->value, strlen(var->value));
n += strlen(var->value);
}
else
{
if (n >= buffersize + 1)
return GIB_E_BUFFER;
buffer[n++] = source[i];
}
}
return 0;
}