mirror of
https://github.com/freebsd/freebsd-src.git
synced 2024-11-29 17:32:43 +00:00
308 lines
6.5 KiB
C
308 lines
6.5 KiB
C
/*-
|
|
* Copyright (c) 2000 Daniel Capo Sobral
|
|
* All rights reserved.
|
|
*
|
|
* Redistribution and use in source and binary forms, with or without
|
|
* modification, are permitted provided that the following conditions
|
|
* are met:
|
|
* 1. Redistributions of source code must retain the above copyright
|
|
* notice, this list of conditions and the following disclaimer.
|
|
* 2. Redistributions in binary form must reproduce the above copyright
|
|
* notice, this list of conditions and the following disclaimer in the
|
|
* documentation and/or other materials provided with the distribution.
|
|
*
|
|
* THIS SOFTWARE IS PROVIDED BY THE AUTHOR AND CONTRIBUTORS ``AS IS'' AND
|
|
* ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
|
|
* IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
|
|
* ARE DISCLAIMED. IN NO EVENT SHALL THE AUTHOR OR CONTRIBUTORS BE LIABLE
|
|
* FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
|
|
* DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS
|
|
* OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION)
|
|
* HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT
|
|
* LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY
|
|
* OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF
|
|
* SUCH DAMAGE.
|
|
*
|
|
* $FreeBSD$
|
|
*/
|
|
|
|
/*******************************************************************
|
|
** l o a d e r . c
|
|
** Additional FICL words designed for FreeBSD's loader
|
|
**
|
|
*******************************************************************/
|
|
|
|
#include <stand.h>
|
|
#include "bootstrap.h"
|
|
#include <string.h>
|
|
#include "ficl.h"
|
|
|
|
/* FreeBSD's loader interaction words
|
|
*
|
|
* setenv ( value n name n' -- )
|
|
* setenv? ( value n name n' flag -- )
|
|
* getenv ( addr n -- addr' n' | -1 )
|
|
* unsetenv ( addr n -- )
|
|
* copyin ( addr addr' len -- )
|
|
* copyout ( addr addr' len -- )
|
|
* findfile ( name len type len' -- addr )
|
|
* pnpdevices ( -- addr )
|
|
* pnphandlers ( -- addr )
|
|
* ccall ( [[...[p10] p9] ... p1] n addr -- result )
|
|
*/
|
|
|
|
void
|
|
ficlSetenv(FICL_VM *pVM)
|
|
{
|
|
char *namep, *valuep, *name, *value;
|
|
int names, values;
|
|
|
|
#if FICL_ROBUST > 1
|
|
vmCheckStack(pVM, 4, 0);
|
|
#endif
|
|
names = stackPopINT(pVM->pStack);
|
|
namep = (char*) stackPopPtr(pVM->pStack);
|
|
values = stackPopINT(pVM->pStack);
|
|
valuep = (char*) stackPopPtr(pVM->pStack);
|
|
|
|
name = (char*) ficlMalloc(names+1);
|
|
if (!name)
|
|
vmThrowErr(pVM, "Error: out of memory");
|
|
strncpy(name, namep, names);
|
|
name[names] = '\0';
|
|
value = (char*) ficlMalloc(values+1);
|
|
if (!value)
|
|
vmThrowErr(pVM, "Error: out of memory");
|
|
strncpy(value, valuep, values);
|
|
value[values] = '\0';
|
|
|
|
setenv(name, value, 1);
|
|
ficlFree(name);
|
|
ficlFree(value);
|
|
|
|
return;
|
|
}
|
|
|
|
void
|
|
ficlSetenvq(FICL_VM *pVM)
|
|
{
|
|
char *namep, *valuep, *name, *value;
|
|
int names, values, overwrite;
|
|
|
|
#if FICL_ROBUST > 1
|
|
vmCheckStack(pVM, 5, 0);
|
|
#endif
|
|
overwrite = stackPopINT(pVM->pStack);
|
|
names = stackPopINT(pVM->pStack);
|
|
namep = (char*) stackPopPtr(pVM->pStack);
|
|
values = stackPopINT(pVM->pStack);
|
|
valuep = (char*) stackPopPtr(pVM->pStack);
|
|
|
|
name = (char*) ficlMalloc(names+1);
|
|
if (!name)
|
|
vmThrowErr(pVM, "Error: out of memory");
|
|
strncpy(name, namep, names);
|
|
name[names] = '\0';
|
|
value = (char*) ficlMalloc(values+1);
|
|
if (!value)
|
|
vmThrowErr(pVM, "Error: out of memory");
|
|
strncpy(value, valuep, values);
|
|
value[values] = '\0';
|
|
|
|
setenv(name, value, overwrite);
|
|
ficlFree(name);
|
|
ficlFree(value);
|
|
|
|
return;
|
|
}
|
|
|
|
void
|
|
ficlGetenv(FICL_VM *pVM)
|
|
{
|
|
char *namep, *name, *value;
|
|
int names;
|
|
|
|
#if FICL_ROBUST > 1
|
|
vmCheckStack(pVM, 2, 2);
|
|
#endif
|
|
names = stackPopINT(pVM->pStack);
|
|
namep = (char*) stackPopPtr(pVM->pStack);
|
|
|
|
name = (char*) ficlMalloc(names+1);
|
|
if (!name)
|
|
vmThrowErr(pVM, "Error: out of memory");
|
|
strncpy(name, namep, names);
|
|
name[names] = '\0';
|
|
|
|
value = getenv(name);
|
|
ficlFree(name);
|
|
|
|
if(value != NULL) {
|
|
stackPushPtr(pVM->pStack, value);
|
|
stackPushINT(pVM->pStack, strlen(value));
|
|
} else
|
|
stackPushINT(pVM->pStack, -1);
|
|
|
|
return;
|
|
}
|
|
|
|
void
|
|
ficlUnsetenv(FICL_VM *pVM)
|
|
{
|
|
char *namep, *name;
|
|
int names;
|
|
|
|
#if FICL_ROBUST > 1
|
|
vmCheckStack(pVM, 2, 0);
|
|
#endif
|
|
names = stackPopINT(pVM->pStack);
|
|
namep = (char*) stackPopPtr(pVM->pStack);
|
|
|
|
name = (char*) ficlMalloc(names+1);
|
|
if (!name)
|
|
vmThrowErr(pVM, "Error: out of memory");
|
|
strncpy(name, namep, names);
|
|
name[names] = '\0';
|
|
|
|
unsetenv(name);
|
|
ficlFree(name);
|
|
|
|
return;
|
|
}
|
|
|
|
void
|
|
ficlCopyin(FICL_VM *pVM)
|
|
{
|
|
void* src;
|
|
vm_offset_t dest;
|
|
size_t len;
|
|
|
|
#if FICL_ROBUST > 1
|
|
vmCheckStack(pVM, 3, 0);
|
|
#endif
|
|
|
|
len = stackPopINT(pVM->pStack);
|
|
dest = stackPopINT(pVM->pStack);
|
|
src = stackPopPtr(pVM->pStack);
|
|
|
|
archsw.arch_copyin(src, dest, len);
|
|
|
|
return;
|
|
}
|
|
|
|
void
|
|
ficlCopyout(FICL_VM *pVM)
|
|
{
|
|
void* dest;
|
|
vm_offset_t src;
|
|
size_t len;
|
|
|
|
#if FICL_ROBUST > 1
|
|
vmCheckStack(pVM, 3, 0);
|
|
#endif
|
|
|
|
len = stackPopINT(pVM->pStack);
|
|
dest = stackPopPtr(pVM->pStack);
|
|
src = stackPopINT(pVM->pStack);
|
|
|
|
archsw.arch_copyout(src, dest, len);
|
|
|
|
return;
|
|
}
|
|
|
|
void
|
|
ficlFindfile(FICL_VM *pVM)
|
|
{
|
|
char *name, *type, *namep, *typep;
|
|
struct preloaded_file* fp;
|
|
int names, types;
|
|
|
|
#if FICL_ROBUST > 1
|
|
vmCheckStack(pVM, 4, 1);
|
|
#endif
|
|
|
|
types = stackPopINT(pVM->pStack);
|
|
typep = (char*) stackPopPtr(pVM->pStack);
|
|
names = stackPopINT(pVM->pStack);
|
|
namep = (char*) stackPopPtr(pVM->pStack);
|
|
name = (char*) ficlMalloc(names+1);
|
|
if (!name)
|
|
vmThrowErr(pVM, "Error: out of memory");
|
|
strncpy(name, namep, names);
|
|
name[names] = '\0';
|
|
type = (char*) ficlMalloc(types+1);
|
|
if (!type)
|
|
vmThrowErr(pVM, "Error: out of memory");
|
|
strncpy(type, typep, types);
|
|
type[types] = '\0';
|
|
|
|
fp = file_findfile(name, type);
|
|
stackPushPtr(pVM->pStack, fp);
|
|
|
|
return;
|
|
}
|
|
|
|
#ifdef HAVE_PNP
|
|
|
|
void
|
|
ficlPnpdevices(FICL_VM *pVM)
|
|
{
|
|
static int pnp_devices_initted = 0;
|
|
#if FICL_ROBUST > 1
|
|
vmCheckStack(pVM, 0, 1);
|
|
#endif
|
|
|
|
if(!pnp_devices_initted) {
|
|
STAILQ_INIT(&pnp_devices);
|
|
pnp_devices_initted = 1;
|
|
}
|
|
|
|
stackPushPtr(pVM->pStack, &pnp_devices);
|
|
|
|
return;
|
|
}
|
|
|
|
void
|
|
ficlPnphandlers(FICL_VM *pVM)
|
|
{
|
|
#if FICL_ROBUST > 1
|
|
vmCheckStack(pVM, 0, 1);
|
|
#endif
|
|
|
|
stackPushPtr(pVM->pStack, pnphandlers);
|
|
|
|
return;
|
|
}
|
|
|
|
#endif
|
|
|
|
void
|
|
ficlCcall(FICL_VM *pVM)
|
|
{
|
|
int (*func)(int, ...);
|
|
int result, p[10];
|
|
int nparam, i;
|
|
|
|
#if FICL_ROBUST > 1
|
|
vmCheckStack(pVM, 2, 0);
|
|
#endif
|
|
|
|
func = stackPopPtr(pVM->pStack);
|
|
nparam = stackPopINT(pVM->pStack);
|
|
|
|
#if FICL_ROBUST > 1
|
|
vmCheckStack(pVM, nparam, 1);
|
|
#endif
|
|
|
|
for (i = 0; i < nparam; i++)
|
|
p[i] = stackPopINT(pVM->pStack);
|
|
|
|
result = func(p[0], p[1], p[2], p[3], p[4], p[5], p[6], p[7], p[8],
|
|
p[9]);
|
|
|
|
stackPushINT(pVM->pStack, result);
|
|
|
|
return;
|
|
}
|
|
|