=================================================================== RCS file: /home/cvs/OpenXM_contrib2/asir2000/builtin/miscf.c,v retrieving revision 1.2 retrieving revision 1.21 diff -u -p -r1.2 -r1.21 --- OpenXM_contrib2/asir2000/builtin/miscf.c 2000/01/18 05:55:05 1.2 +++ OpenXM_contrib2/asir2000/builtin/miscf.c 2004/02/25 06:43:52 1.21 @@ -1,23 +1,85 @@ -/* $OpenXM: OpenXM_contrib2/asir2000/builtin/miscf.c,v 1.1.1.1 1999/12/03 07:39:07 noro Exp $ */ +/* + * Copyright (c) 1994-2000 FUJITSU LABORATORIES LIMITED + * All rights reserved. + * + * FUJITSU LABORATORIES LIMITED ("FLL") hereby grants you a limited, + * non-exclusive and royalty-free license to use, copy, modify and + * redistribute, solely for non-commercial and non-profit purposes, the + * computer program, "Risa/Asir" ("SOFTWARE"), subject to the terms and + * conditions of this Agreement. For the avoidance of doubt, you acquire + * only a limited right to use the SOFTWARE hereunder, and FLL or any + * third party developer retains all rights, including but not limited to + * copyrights, in and to the SOFTWARE. + * + * (1) FLL does not grant you a license in any way for commercial + * purposes. You may use the SOFTWARE only for non-commercial and + * non-profit purposes only, such as academic, research and internal + * business use. + * (2) The SOFTWARE is protected by the Copyright Law of Japan and + * international copyright treaties. If you make copies of the SOFTWARE, + * with or without modification, as permitted hereunder, you shall affix + * to all such copies of the SOFTWARE the above copyright notice. + * (3) An explicit reference to this SOFTWARE and its copyright owner + * shall be made on your publication or presentation in any form of the + * results obtained by use of the SOFTWARE. + * (4) In the event that you modify the SOFTWARE, you shall notify FLL by + * e-mail at risa-admin@sec.flab.fujitsu.co.jp of the detailed specification + * for such modification or the source code of the modified part of the + * SOFTWARE. + * + * THE SOFTWARE IS PROVIDED AS IS WITHOUT ANY WARRANTY OF ANY KIND. FLL + * MAKES ABSOLUTELY NO WARRANTIES, EXPRESSED, IMPLIED OR STATUTORY, AND + * EXPRESSLY DISCLAIMS ANY IMPLIED WARRANTY OF MERCHANTABILITY, FITNESS + * FOR A PARTICULAR PURPOSE OR NONINFRINGEMENT OF THIRD PARTIES' + * RIGHTS. NO FLL DEALER, AGENT, EMPLOYEES IS AUTHORIZED TO MAKE ANY + * MODIFICATIONS, EXTENSIONS, OR ADDITIONS TO THIS WARRANTY. + * UNDER NO CIRCUMSTANCES AND UNDER NO LEGAL THEORY, TORT, CONTRACT, + * OR OTHERWISE, SHALL FLL BE LIABLE TO YOU OR ANY OTHER PERSON FOR ANY + * DIRECT, INDIRECT, SPECIAL, INCIDENTAL, PUNITIVE OR CONSEQUENTIAL + * DAMAGES OF ANY CHARACTER, INCLUDING, WITHOUT LIMITATION, DAMAGES + * ARISING OUT OF OR RELATING TO THE SOFTWARE OR THIS AGREEMENT, DAMAGES + * FOR LOSS OF GOODWILL, WORK STOPPAGE, OR LOSS OF DATA, OR FOR ANY + * DAMAGES, EVEN IF FLL SHALL HAVE BEEN INFORMED OF THE POSSIBILITY OF + * SUCH DAMAGES, OR FOR ANY CLAIM BY ANY OTHER PARTY. EVEN IF A PART + * OF THE SOFTWARE HAS BEEN DEVELOPED BY A THIRD PARTY, THE THIRD PARTY + * DEVELOPER SHALL HAVE NO LIABILITY IN CONNECTION WITH THE USE, + * PERFORMANCE OR NON-PERFORMANCE OF THE SOFTWARE. + * + * $OpenXM: OpenXM_contrib2/asir2000/builtin/miscf.c,v 1.20 2003/11/11 06:14:08 noro Exp $ +*/ #include "ca.h" #include "parse.h" -#if INET && !defined(VISUAL) +#if !defined(VISUAL) && defined(DO_PLOT) #include #include #endif +#if defined(VISUAL) +#include +#include +#endif + void Pquit(), Pdebug(), Pnmono(), Pnez(), Popt(), Pshell(), Pheap(); -void Perror(), Perror3(), Pversion(), Pflist(), Pdelete_history(), Ppause(), Pxpause(); +void Ptoplevel(); +void Perror(), Perror3(), Pversion(), Pcopyright(), Pflist(), Pdelete_history(), Ppause(), Pxpause(); void Pr2g(), Pread_cmo(), Pwrite_cmo(); void Pgc(),Pbatch(),Psend_progress(); void Pnull_command(); void Pgetenv(); -void Plib_ox_push_cmo(),Plib_ox_pop_cmo(),Plib_ox_push_cmd(); -void Plib_ox_execute_string(); +void Pget_addr(),Phex_dump(); +void Ppeek(),Ppoke(); +void Psleep(); +void Premove_module(); +void Pmodule_list(); +void Pmodule_definedp(); void delete_history(int,int); struct ftab misc_tab[] = { + {"module_list",Pmodule_list,0}, + {"remove_module",Premove_module,1}, + {"module_definedp",Pmodule_definedp,1}, + {"sleep",Psleep,1}, {"null_command",Pnull_command,-99999}, {"getenv",Pgetenv,1}, {"end",Pquit,0}, @@ -25,78 +87,100 @@ struct ftab misc_tab[] = { {"debug",Pdebug,0}, {"shell",Pshell,-2}, {"heap",Pheap,-1}, - {"version",Pversion,0}, + {"version",Pversion,-99999}, + {"copyright",Pcopyright,0}, {"nmono",Pnmono,1}, + {"toplevel",Ptoplevel,-1}, {"error",Perror,1}, {"error3",Perror3,3}, {"nez",Pnez,1}, - {"flist",Pflist,0}, + {"flist",Pflist,-1}, {"delete_history",Pdelete_history,-2}, {"pause",Ppause,0}, {"gc",Pgc,0}, {"batch",Pbatch,2}, {"send_progress",Psend_progress,-2}, -#if INET && !defined(VISUAL) + {"get_addr",Pget_addr,1}, + {"hex_dump",Phex_dump,2}, + {"peek",Ppeek,1}, + {"poke",Ppoke,2}, +#if !defined(VISUAL) && defined(DO_PLOT) {"xpause",Pxpause,0}, #endif #if 0 {"opt",Popt,1}, #endif -/* test functions for library mode ox operations */ - {"lib_ox_push_cmo",Plib_ox_push_cmo,1}, - {"lib_ox_pop_cmo",Plib_ox_pop_cmo,0}, - {"lib_ox_push_cmd",Plib_ox_push_cmd,1}, - {"lib_ox_execute_string",Plib_ox_execute_string,1}, {0,0,0}, }; -extern int little_endian; - -int lib_ox_initialized; - -void Plib_ox_push_cmo(arg,rp) +void Psleep(arg,rp) NODE arg; Q *rp; { - void *cmo; + int ms; - if ( !lib_ox_initialized ) asir_ox_io_init(little_endian); - risa_to_cmo(ARG0(arg),&cmo); - asir_ox_push_cmo(cmo); + ms = QTOS((Q)ARG0(arg)); +#if defined(VISUAL) + Sleep(ms); +#else + usleep(ms*1000); +#endif *rp = ONE; } -void Plib_ox_pop_cmo(rp) -Obj *rp; +void Pmodule_list(rp) +LIST *rp; { - void *buf; - int ret,len; + char *name; + NODE r,r1,m; + STRING s; - if ( !lib_ox_initialized ) asir_ox_io_init(little_endian); - len = asir_ox_peek_cmo_size(); - buf = (void *)MALLOC_ATOMIC(len); - ret = asir_ox_pop_cmo(buf,len); - if ( ret < 0 ) - error("lib_ox_pop_cmo : buffer too small (cannot happen!)"); - cmo_to_risa(buf,rp); + 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 Plib_ox_push_cmd(arg,rp) +void Premove_module(arg,rp) NODE arg; Q *rp; { - if ( !lib_ox_initialized ) asir_ox_io_init(little_endian); - asir_ox_push_cmd((unsigned int)QTOS((Q)ARG0(arg))); - *rp = ONE; + 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 Plib_ox_execute_string(arg,rp) +void Pmodule_definedp(arg,rp) NODE arg; Q *rp; { - if ( !lib_ox_initialized ) asir_ox_io_init(little_endian); - asir_ox_execute_string(BDY((STRING)ARG0(arg))); - *rp = ONE; + 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) @@ -130,7 +214,7 @@ pointer *rp; asir_terminate(2); else { closecurrentinput(); - if ( !asir_infile->fp ) + if ( !asir_infile->fp && strcmp(asir_infile->name,"string") ) asir_terminate(2); } *rp = 0; @@ -198,16 +282,40 @@ Q *rp; } unsigned int get_asir_version(); +char *get_asir_distribution(); -void Pversion(rp) -Q *rp; +void Pversion(arg,rp) +NODE arg; +Obj *rp; { unsigned int version; + char *distribution; + Q q; + STRING str; + NODE n; + LIST l; version = get_asir_version(); - STOQ(version,*rp); + distribution = get_asir_distribution(); + UTOQ(version,q); + if ( !argc(arg) ) + *rp = (Obj)q; + else { + MKSTR(str,distribution); + n = mknode(2,q,str); + MKLIST(l,n); + *rp = (Obj)l; + } } +char *scopyright(); + +void Pcopyright(rp) +STRING *rp; +{ + MKSTR(*rp,scopyright()); +} + extern int nez; void Pnez(arg,rp) @@ -231,11 +339,24 @@ Q *rp; *rp = 0; } +void Ptoplevel(arg,rp) +NODE arg; +Q *rp; +{ + char *s; + + if ( !arg || !ARG0(arg) || (OID((Obj)ARG0(arg)) != O_STR) ) + s = ""; + else + s = BDY((STRING)ARG0(arg)); + toplevel(s); + *rp = 0; +} + void Perror3(arg,rp) NODE arg; Q *rp; { - char s[BUFSIZ]; int code; char *reason,*action; @@ -245,34 +366,55 @@ Q *rp; code = QTOS((Q)ARG0(arg)); reason = BDY((STRING)ARG1(arg)); action = BDY((STRING)ARG2(arg)); +#if defined(VISUAL) set_error(code,reason,action); +#endif error(""); *rp = 0; } -void Pflist(rp) +void Pflist(arg,rp) +NODE arg; LIST *rp; { char *n; STRING name; - NODE t,r,r0; + char *mname; + NODE t,r,r0,m; LIST l; - for ( t = usrf, 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; + if ( argc(arg) ) { + /* module name is specified */ + asir_assert(ARG0(arg),O_STR,"flist"); + 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) ) - if ( ((FUNC)BDY(t))->id != A_UNDEF ) { - 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; - } + } else { + for ( t = usrf, 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) ) + if ( ((FUNC)BDY(t))->id != A_UNDEF ) { + 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; } @@ -333,7 +475,7 @@ Q *rp; STOQ(ret,*rp); } -#if INET && !defined(VISUAL) +#if !defined(VISUAL) && defined(DO_PLOT) void Pxpause(rp) Q *rp; { @@ -401,6 +543,95 @@ void Psend_progress(NODE arg,Q *rp) msg = ""; send_progress(per,msg); #endif + *rp = 0; +} + +void Pget_addr(arg,rp) +NODE arg; +Q *rp; +{ + pointer obj; + unsigned int u,l; + N n; + + obj = ARG0(arg); + if ( sizeof(pointer) == sizeof(unsigned int) ) { + UTOQ((unsigned int)obj,*rp); + } else { + /* a pointer must fit in long */ + u = ((unsigned long)obj)>>32; + l = ((unsigned long)obj)&(unsigned long)0xffffffff; + if ( u ) { + n = NALLOC(2); PL(n) = 2; BD(n)[0] = l; BD(n)[1] = u; + NTOQ(n,1,*rp); + } else { + UTOQ(l,*rp); + } + } +} + +unsigned char *qtoaddr(q) +Q q; +{ + unsigned char *addr; + N n; + + if ( !q ) + return 0; + n = NM(q); + if ( (sizeof(pointer) == sizeof(unsigned int)) || (PL(n) == 1) ) + addr = (char *)BD(n)[0]; + else { + /* a pointer must fit in long */ + addr = (char *)((((unsigned long)BD(n)[1])<<32) + | ((unsigned long)BD(n)[0])); + } + return addr; +} + +void Phex_dump(arg,rp) +NODE arg; +Q *rp; +{ + unsigned char *start; + int len,i; + + *rp = 0; + start = qtoaddr((Q)ARG0(arg)); + len = QTOS((Q)ARG1(arg)); + for ( i = 0; i < len; i++ ) { + if ( !(i%16) ) + fprintf(asir_out,"%08x: ",start+i); + fprintf(asir_out,"%02x",start[i]); + if ( !((i+1)%16) ) + fprintf(asir_out,"\n"); + else if ( !((i+1)%4) ) + fprintf(asir_out," "); + } + if ( i%16 ) + fprintf(asir_out,"\n"); +} + +void Ppeek(arg,rp) +NODE arg; +Q *rp; +{ + unsigned int b; + unsigned char *a; + + a = qtoaddr((Q)ARG0(arg)); + b = (unsigned int) (*a); + UTOQ(b,*rp); +} + +void Ppoke(arg,rp) +NODE arg; +Q *rp; +{ + unsigned char *addr; + + addr = qtoaddr((Q)ARG0(arg)); + *addr = (unsigned char)QTOS((Q)ARG1(arg)); *rp = 0; }