version 1.14, 2003/02/14 22:29:07 |
version 1.19, 2003/10/20 00:21:09 |
|
|
* DEVELOPER SHALL HAVE NO LIABILITY IN CONNECTION WITH THE USE, |
* DEVELOPER SHALL HAVE NO LIABILITY IN CONNECTION WITH THE USE, |
* PERFORMANCE OR NON-PERFORMANCE OF THE SOFTWARE. |
* PERFORMANCE OR NON-PERFORMANCE OF THE SOFTWARE. |
* |
* |
* $OpenXM: OpenXM_contrib2/asir2000/builtin/miscf.c,v 1.13 2001/10/09 01:36:06 noro Exp $ |
* $OpenXM: OpenXM_contrib2/asir2000/builtin/miscf.c,v 1.18 2003/05/16 07:56:14 noro Exp $ |
*/ |
*/ |
#include "ca.h" |
#include "ca.h" |
#include "parse.h" |
#include "parse.h" |
#if !defined(VISUAL) |
#if !defined(VISUAL) && defined(DO_PLOT) |
#include <X11/Xlib.h> |
#include <X11/Xlib.h> |
#include <X11/cursorfont.h> |
#include <X11/cursorfont.h> |
#endif |
#endif |
|
|
void Pget_addr(),Phex_dump(); |
void Pget_addr(),Phex_dump(); |
void Ppeek(),Ppoke(); |
void Ppeek(),Ppoke(); |
void Psleep(); |
void Psleep(); |
|
void Premove_module(); |
|
void Pmodule_list(); |
|
void Pmodule_definedp(); |
|
|
void delete_history(int,int); |
void delete_history(int,int); |
|
|
struct ftab misc_tab[] = { |
struct ftab misc_tab[] = { |
|
{"module_list",Pmodule_list,0}, |
|
{"remove_module",Premove_module,1}, |
|
{"module_definedp",Pmodule_definedp,1}, |
{"sleep",Psleep,1}, |
{"sleep",Psleep,1}, |
{"null_command",Pnull_command,-99999}, |
{"null_command",Pnull_command,-99999}, |
{"getenv",Pgetenv,1}, |
{"getenv",Pgetenv,1}, |
Line 85 struct ftab misc_tab[] = { |
|
Line 91 struct ftab misc_tab[] = { |
|
{"error",Perror,1}, |
{"error",Perror,1}, |
{"error3",Perror3,3}, |
{"error3",Perror3,3}, |
{"nez",Pnez,1}, |
{"nez",Pnez,1}, |
{"flist",Pflist,0}, |
{"flist",Pflist,-1}, |
{"delete_history",Pdelete_history,-2}, |
{"delete_history",Pdelete_history,-2}, |
{"pause",Ppause,0}, |
{"pause",Ppause,0}, |
{"gc",Pgc,0}, |
{"gc",Pgc,0}, |
|
|
*rp = ONE; |
*rp = ONE; |
} |
} |
|
|
|
void Pmodule_list(rp) |
|
LIST *rp; |
|
{ |
|
char *name; |
|
NODE r,r1,m; |
|
STRING s; |
|
|
|
r = 0; |
|
for ( m = MODULE_LIST; m; m = NEXT(m) ) { |
|
MKSTR(s,((MODULE)BDY(m))->name); |
|
MKNODE(r1,s,r); r = r1; |
|
} |
|
MKLIST(*rp,r); |
|
} |
|
|
|
void Premove_module(arg,rp) |
|
NODE arg; |
|
Q *rp; |
|
{ |
|
NODE pm,m; |
|
char *name; |
|
|
|
asir_assert(ARG0(arg),O_STR,"remove_module"); |
|
name = BDY((STRING)ARG0(arg)); |
|
for ( pm = 0, m = MODULE_LIST; m; pm = m, m = NEXT(m) ) |
|
if ( !strcmp(name,((MODULE)BDY(m))->name) ) { |
|
if ( !pm ) |
|
MODULE_LIST = NEXT(MODULE_LIST); |
|
else |
|
NEXT(pm) = NEXT(m); |
|
*rp = ONE; |
|
return; |
|
} |
|
*rp = 0; |
|
} |
|
|
|
void Pmodule_definedp(arg,rp) |
|
NODE arg; |
|
Q *rp; |
|
{ |
|
NODE m; |
|
char *name; |
|
|
|
asir_assert(ARG0(arg),O_STR,"module_definedp"); |
|
name = BDY((STRING)ARG0(arg)); |
|
/* bug: the linear search is used here. The list of module shoud be sorted |
|
and cashed, and binary search should be used. */ |
|
for (m = MODULE_LIST; m; m = NEXT(m) ) |
|
if ( !strcmp(name,((MODULE)BDY(m))->name) ) { |
|
*rp = ONE; |
|
return ; |
|
} |
|
*rp = 0; |
|
} |
|
|
void Pgetenv(arg,rp) |
void Pgetenv(arg,rp) |
NODE arg; |
NODE arg; |
STRING *rp; |
STRING *rp; |
|
|
*rp = 0; |
*rp = 0; |
} |
} |
|
|
void Pflist(rp) |
void Pflist(arg,rp) |
|
NODE arg; |
LIST *rp; |
LIST *rp; |
{ |
{ |
char *n; |
char *n; |
STRING name; |
STRING name; |
NODE t,r,r0; |
char *mname; |
|
NODE t,r,r0,m; |
LIST l; |
LIST l; |
|
|
for ( t = usrf, r0 = 0; t; t = NEXT(t) ) |
if ( argc(arg) ) { |
if ( ((FUNC)BDY(t))->id != A_UNDEF ) { |
/* module name is specified */ |
n = NAME((FUNC)BDY(t)); MKSTR(name,n); |
asir_assert(ARG0(arg),O_STR,"flist"); |
MKNODE(r,name,r0); r0 = r; |
mname = BDY((STRING)ARG0(arg)); |
|
r0 = 0; |
|
for ( m = MODULE_LIST; m; m = NEXT(m) ) { |
|
if ( !strcmp(mname,((MODULE)BDY(m))->name) ) { |
|
t = ((MODULE)BDY(m))->usrf_list; |
|
for ( r0 = 0; t; t = NEXT(t) ) |
|
if ( ((FUNC)BDY(t))->id != A_UNDEF ) { |
|
n = NAME((FUNC)BDY(t)); MKSTR(name,n); |
|
MKNODE(r,name,r0); r0 = r; |
|
} |
|
} |
} |
} |
for ( t = ubinf; t; t = NEXT(t) ) |
} else { |
if ( ((FUNC)BDY(t))->id != A_UNDEF ) { |
for ( t = usrf, r0 = 0; t; t = NEXT(t) ) |
n = NAME((FUNC)BDY(t)); MKSTR(name,n); |
if ( ((FUNC)BDY(t))->id != A_UNDEF ) { |
MKNODE(r,name,r0); r0 = r; |
n = NAME((FUNC)BDY(t)); MKSTR(name,n); |
} |
MKNODE(r,name,r0); r0 = r; |
for ( t = sysf; t; t = NEXT(t) ) |
} |
if ( ((FUNC)BDY(t))->id != A_UNDEF ) { |
for ( t = ubinf; t; t = NEXT(t) ) |
n = NAME((FUNC)BDY(t)); MKSTR(name,n); |
if ( ((FUNC)BDY(t))->id != A_UNDEF ) { |
MKNODE(r,name,r0); r0 = r; |
n = NAME((FUNC)BDY(t)); MKSTR(name,n); |
} |
MKNODE(r,name,r0); r0 = r; |
|
} |
|
for ( t = sysf; t; t = NEXT(t) ) |
|
if ( ((FUNC)BDY(t))->id != A_UNDEF ) { |
|
n = NAME((FUNC)BDY(t)); MKSTR(name,n); |
|
MKNODE(r,name,r0); r0 = r; |
|
} |
|
} |
MKLIST(l,r0); *rp = l; |
MKLIST(l,r0); *rp = l; |
} |
} |
|
|