| version 1.2, 2000/02/08 04:47:12 |
version 1.16, 2006/02/08 02:11:19 |
|
|
| /* $OpenXM: OpenXM_contrib2/asir2000/parse/debug.c,v 1.1.1.1 1999/12/03 07:39:12 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/parse/debug.c,v 1.15 2003/05/14 07:08:48 noro Exp $ |
| |
*/ |
| #include "ca.h" |
#include "ca.h" |
| #include "parse.h" |
#include "parse.h" |
| #include <ctype.h> |
#include <ctype.h> |
| #if PARI |
#if defined(PARI) |
| #include "genpari.h" |
#include "genpari.h" |
| #endif |
#endif |
| |
|
| void show_stack(VS); |
|
| void change_stack(int,NODE *); |
|
| void showpos(void); |
|
| void printvars(char *,VS); |
|
| void println(int,char **,int); |
|
| void bp(SNODE); |
|
| void searchsn(SNODE *,int,SNODE **); |
|
| void showbp(int); |
|
| void showbps(void); |
|
| void delbp(int,char **); |
|
| int searchbp(void); |
|
| void clearbp(FUNC); |
|
| void settp(char *); |
|
| void setbp(char *); |
|
| void setf(int,char **); |
|
| void show_alias(char *); |
|
| void add_alias(char *,char *); |
|
| |
|
| extern do_server_in_X11,do_file; |
extern do_server_in_X11,do_file; |
| |
|
| typedef enum { |
typedef enum { |
| Line 48 static int curline = 1; |
|
| Line 78 static int curline = 1; |
|
| extern NODE PVSS; |
extern NODE PVSS; |
| extern unsigned int evalstatline; |
extern unsigned int evalstatline; |
| extern int debug_mode; |
extern int debug_mode; |
| extern jmp_buf debug_env; |
extern JMP_BUF debug_env; |
| |
|
| char *debcom[] = { |
char *debcom[] = { |
| "next", |
"next", |
| Line 105 void debug_init() { |
|
| Line 135 void debug_init() { |
|
| for ( n = 0; dckwd[n].id != D_UNKNOWN; n++ ); |
for ( n = 0; dckwd[n].id != D_UNKNOWN; n++ ); |
| for ( i = 0; i < n; i++ ) |
for ( i = 0; i < n; i++ ) |
| MKNODE(dckwd[i].names,debcom[i],0); |
MKNODE(dckwd[i].names,debcom[i],0); |
| #if defined(THINK_C) |
|
| strcpy(buf,"dbxinit"); |
|
| #else |
|
| home = (char *)getenv("HOME"); |
home = (char *)getenv("HOME"); |
| if ( home ) |
if ( home ) |
| strcpy(buf,home); |
strcpy(buf,home); |
| else |
else |
| buf[0] = 0; |
buf[0] = 0; |
| strcat(buf,"/.dbxinit"); |
strcat(buf,"/.dbxinit"); |
| #endif |
|
| if ( (fp = fopen(".dbxinit","r")) || (fp = fopen(buf,"r")) ) { |
if ( (fp = fopen(".dbxinit","r")) || (fp = fopen(buf,"r")) ) { |
| while ( fgets(buf,BUFSIZ,fp) ) { |
while ( fgets(buf,BUFSIZ,fp) ) { |
| stoarg(buf,&ac,av); |
stoarg(buf,&ac,av); |
| Line 123 void debug_init() { |
|
| Line 149 void debug_init() { |
|
| } |
} |
| fclose(fp); |
fclose(fp); |
| } |
} |
| |
#if 0 |
| #if !defined(VISUAL) |
#if !defined(VISUAL) |
| if ( do_server_in_X11 ) |
if ( do_server_in_X11 ) |
| init_cmdwin(); |
init_cmdwin(); |
| #endif |
#endif |
| |
#endif |
| } |
} |
| |
|
| void add_alias(com,alias) |
void add_alias(char *com,char *alias) |
| char *com,*alias; |
|
| { |
{ |
| int i; |
int i; |
| NODE tn; |
NODE tn; |
| Line 145 char *com,*alias; |
|
| Line 172 char *com,*alias; |
|
| } |
} |
| } |
} |
| |
|
| void show_alias(alias) |
void show_alias(char *alias) |
| char *alias; |
|
| { |
{ |
| int i; |
int i; |
| NODE tn; |
NODE tn; |
|
|
| } |
} |
| } |
} |
| |
|
| void debug(f) |
void debug(SNODE f) |
| SNODE f; |
|
| { |
{ |
| int ac,i,n; |
int ac,i,n; |
| did id; |
did id; |
|
|
| char buf[BUFSIZ]; |
char buf[BUFSIZ]; |
| char prompt[BUFSIZ]; |
char prompt[BUFSIZ]; |
| char *p,*pe; |
char *p,*pe; |
| |
#if !defined(VISUAL) |
| |
char *line; |
| |
#endif |
| NODE tn; |
NODE tn; |
| extern int kernelmode,do_fep; |
extern int do_fep; |
| NODE pvss; |
NODE pvss; |
| |
|
| #if !defined(VISUAL) |
#if !defined(MPI) && !defined(VISUAL) |
| if ( !isatty(fileno(stdin)) && !do_server_in_X11 ) |
if ( !isatty(fileno(stdin)) && !do_server_in_X11 ) |
| if ( do_file ) |
if ( do_file ) |
| ExitAsir(); |
ExitAsir(); |
| else |
else |
| return; |
return; |
| #endif |
#endif |
| #if defined(VISUAL) || defined(THINK_C) |
#if defined(VISUAL) |
| suspend_timer(); |
suspend_timer(); |
| #endif |
#endif |
| pvss = PVSS; debug_mode = 1; |
pvss = PVSS; debug_mode = 1; |
|
|
| if ( do_server_in_X11 ) |
if ( do_server_in_X11 ) |
| #endif |
#endif |
| show_debug_window(1); |
show_debug_window(1); |
| sprintf(prompt,"(debug)%c",kernelmode?0xfe:' '); |
sprintf(prompt,"(debug) "); |
| if ( kernelmode ) |
SETJMP(debug_env); |
| fputc('\0',stderr); |
|
| setjmp(debug_env); |
|
| while ( 1 ) { |
while ( 1 ) { |
| if ( !do_server_in_X11 ) |
#if FEP |
| fputs(prompt,stderr); |
if ( !do_fep ) |
| |
#endif |
| |
if ( !do_server_in_X11 ) |
| |
fputs(prompt,stderr); |
| bzero(buf,BUFSIZ); |
bzero(buf,BUFSIZ); |
| while ( 1 ) { |
while ( 1 ) { |
| |
#if FEP |
| |
if ( do_fep ) { |
| |
line = (char *)readline_console(prompt); |
| |
strcpy(buf,line); free(line); |
| |
} else |
| |
#endif |
| { |
{ |
| int len; |
int len; |
| |
|
|
|
| } |
} |
| } |
} |
| LAST: |
LAST: |
| if ( kernelmode ) |
|
| fputc('\0',stderr); |
|
| debug_mode = 0; |
debug_mode = 0; |
| #if defined(THINK_C) |
#if !defined(VISUAL) |
| show_debug_window(0); |
|
| resume_timer(); |
|
| #elif !defined(VISUAL) |
|
| if ( do_server_in_X11 ) |
if ( do_server_in_X11 ) |
| #endif |
#endif |
| show_debug_window(0); |
show_debug_window(0); |
| } |
} |
| |
|
| void setf(ac,av) |
void setf(int ac,char **av) |
| int ac; |
|
| char **av; |
|
| { |
{ |
| FUNC r; |
FUNC r; |
| |
|
| if ( !ac ) |
if ( !ac ) |
| return; |
return; |
| searchf(usrf,av[0],&r); |
searchuf(av[0],&r); |
| if ( r ) { |
if ( r ) { |
| targetf = r; |
targetf = r; |
| curline = targetf->f.usrf->startl; |
curline = targetf->f.usrf->startl; |
|
|
| |
|
| static int bpindex = 0; |
static int bpindex = 0; |
| |
|
| void setbp(p) |
void setbp(char *p) |
| char *p; |
|
| { |
{ |
| int ac; |
int ac; |
| char *av[BUFSIZ]; |
char *av[BUFSIZ]; |
| char *buf,*savp; |
char *buf,*savp; |
| char *fname; |
char *fname; |
| FUNC r; |
FUNC r; |
| USRF t; |
USRF uf,t; |
| SNODE *snp = 0; |
SNODE *snp = 0; |
| FNODE cond; |
FNODE cond; |
| NODE tn; |
NODE tn; |
|
|
| if ( !strcmp(av[0],"at") ) { |
if ( !strcmp(av[0],"at") ) { |
| if ( !targetf ) |
if ( !targetf ) |
| return; |
return; |
| n = atoi(av[1]); fname = targetf->f.usrf->fname; |
n = atoi(av[1]); |
| for ( tn = usrf; tn; tn = NEXT(tn) ) { |
uf = targetf->f.usrf; |
| |
fname = uf->fname; |
| |
tn = uf->module?uf->module->usrf_list:usrf; |
| |
for ( ; tn; tn = NEXT(tn) ) { |
| r = (FUNC)BDY(tn); t = r->f.usrf; |
r = (FUNC)BDY(tn); t = r->f.usrf; |
| if ( t && t->fname && !strcmp(t->fname,fname) |
if ( t && t->fname && !strcmp(t->fname,fname) |
| && ( t->startl <= n ) && ( n <= t->endl ) ) |
&& ( t->startl <= n ) && ( n <= t->endl ) ) |
|
|
| } |
} |
| at = 1; searchsn(&BDY(t),n,&snp); |
at = 1; searchsn(&BDY(t),n,&snp); |
| } else if ( !strcmp(av[0],"in") ) { |
} else if ( !strcmp(av[0],"in") ) { |
| searchf(usrf,av[1],&r); |
searchuf(av[1],&r); |
| if ( !r ) { |
if ( !r ) { |
| fprintf(stderr,"%s() : no such function\n",av[1]); |
fprintf(stderr,"%s() : no such function\n",av[1]); |
| return; |
return; |
|
|
| } |
} |
| } |
} |
| |
|
| void settp(p) |
void settp(char *p) |
| char *p; |
|
| { |
{ |
| int ac; |
int ac; |
| char *_av[BUFSIZ]; |
char *_av[BUFSIZ]; |
|
|
| } |
} |
| at = 1; searchsn(&BDY(t),n,&snp); |
at = 1; searchsn(&BDY(t),n,&snp); |
| } else if ( !strcmp(av[0],"in") ) { |
} else if ( !strcmp(av[0],"in") ) { |
| searchf(usrf,av[1],&r); |
searchuf(av[1],&r); |
| if ( !r ) { |
if ( !r ) { |
| fprintf(stderr,"%s() : no such function\n",av[1]); |
fprintf(stderr,"%s() : no such function\n",av[1]); |
| return; |
return; |
|
|
| } |
} |
| } |
} |
| |
|
| void clearbp(f) |
void clearbp(FUNC f) |
| FUNC f; |
|
| { |
{ |
| int i; |
int i; |
| |
|
|
|
| return bpindex++; |
return bpindex++; |
| } |
} |
| |
|
| void delbp(ac,av) |
void delbp(int ac,char **av) |
| int ac; |
|
| char **av; |
|
| { |
{ |
| int n; |
int n; |
| |
|
| Line 564 void showbps() { |
|
| Line 590 void showbps() { |
|
| showbp(i); |
showbp(i); |
| } |
} |
| |
|
| void showbp(n) |
void showbp(int n) |
| int n; |
|
| { |
{ |
| if ( bpt[n].snp ) |
if ( bpt[n].snp ) |
| if ( bpt[n].texpr ) |
if ( bpt[n].texpr ) |
|
|
| } |
} |
| } |
} |
| |
|
| void searchsn(fp,n,fpp) |
void searchsn(SNODE *fp,int n,SNODE **fpp) |
| SNODE *fp; |
|
| int n; |
|
| SNODE **fpp; |
|
| { |
{ |
| NODE tn; |
NODE tn; |
| SNODE sn; |
SNODE sn; |
|
|
| } |
} |
| } |
} |
| |
|
| void bp(f) |
void bp(SNODE f) |
| SNODE f; |
|
| { |
{ |
| int ln; |
int ln; |
| |
|
|
|
| CPVS->usrf->name,ln,CPVS->usrf->f.usrf->fname); |
CPVS->usrf->name,ln,CPVS->usrf->f.usrf->fname); |
| targetf = CPVS->usrf; curline = ln; |
targetf = CPVS->usrf; curline = ln; |
| println(0,0,1); |
println(0,0,1); |
| #if !defined(VISUAL) |
#if !defined(MPI) && !defined(VISUAL) |
| if ( do_server_in_X11 || isatty(0) ) |
if ( do_server_in_X11 || isatty(0) ) |
| #endif |
#endif |
| debug(f); |
debug(f); |
| } |
} |
| |
|
| void println(ac,av,l) |
void println(int ac,char **av,int l) |
| int ac; |
|
| char **av; |
|
| int l; |
|
| { |
{ |
| FILE *fp; |
FILE *fp; |
| char buf[BUFSIZ+1]; |
char buf[BUFSIZ+1]; |
| int i; |
int i; |
| int ln; |
int ln; |
| FUNC r; |
FUNC r; |
| #if defined(THINK_C) |
|
| void setDir(short); |
|
| #endif |
|
| |
|
| if ( !ac ) |
if ( !ac ) |
| ln = curline; |
ln = curline; |
| else if ( isdigit(av[0][0]) ) |
else if ( isdigit(av[0][0]) ) |
| ln = atoi(av[0]); |
ln = atoi(av[0]); |
| else { |
else { |
| searchf(usrf,av[0],&r); |
searchuf(av[0],&r); |
| if ( r && r->id != A_UNDEF ) { |
if ( r && r->id != A_UNDEF ) { |
| targetf = r; |
targetf = r; |
| ln = r->f.usrf->startl; |
ln = r->f.usrf->startl; |
|
|
| } |
} |
| if ( !targetf ) |
if ( !targetf ) |
| return; |
return; |
| #if defined(THINK_C) |
|
| setDir(targetf->f.usrf->vol); |
|
| #endif |
|
| fp = fopen(targetf->f.usrf->fname,"r"); |
fp = fopen(targetf->f.usrf->fname,"r"); |
| #if defined(THINK_C) |
|
| resetDir(); |
|
| #endif |
|
| if ( !fp ) { |
if ( !fp ) { |
| fprintf(stderr,"\"%s\" not found\n",targetf->name); |
fprintf(stderr,"\"%s\" not found\n",targetf->name); |
| return; |
return; |
|
|
| fclose(fp); |
fclose(fp); |
| } |
} |
| |
|
| void printvars(s,vs) |
void printvars(char *s,VS vs) |
| char *s; |
|
| VS vs; |
|
| { |
{ |
| FNODE expr; |
FNODE expr; |
| char *p; |
char *p; |
|
|
| } |
} |
| if ( exprparse(vs==GPVS?0:vs->usrf,s,&expr) ) { |
if ( exprparse(vs==GPVS?0:vs->usrf,s,&expr) ) { |
| cpvs = CPVS; CPVS = vs; |
cpvs = CPVS; CPVS = vs; |
| if ( !(err = setjmp(debug_env)) ) |
if ( !(err = SETJMP(debug_env)) ) |
| val = eval(expr); |
val = eval(expr); |
| CPVS = cpvs; |
CPVS = cpvs; |
| if ( !err ) { |
if ( !err ) { |
| #if PARI |
#if defined(PARI) |
| #if PARI1 |
#if defined(PARI1) |
| outfile = stderr; |
outfile = stderr; |
| #else |
#else |
| pari_outfile = stderr; |
pari_outfile = stderr; |
|
|
| #if defined(VISUAL_LIB) |
#if defined(VISUAL_LIB) |
| w_noflush_stderr(0); |
w_noflush_stderr(0); |
| #endif |
#endif |
| #if PARI |
#if defined(PARI) |
| #if PARI1 |
#if defined(PARI1) |
| outfile = stdout; |
outfile = stdout; |
| #else |
#else |
| pari_outfile = stdout; |
pari_outfile = stdout; |
|
|
| } |
} |
| } |
} |
| |
|
| void showpos_to_string(buf) |
void showpos_to_string(char *buf) |
| char *buf; |
|
| { |
{ |
| NODE n; |
NODE n; |
| VS vs; |
VS vs; |
|
|
| } |
} |
| } |
} |
| |
|
| void change_stack(level,pvss) |
/* [[file,line,name],...] */ |
| int level; |
|
| NODE *pvss; |
void showpos_to_list(LIST *r) |
| { |
{ |
| |
NODE n,u,u1,t; |
| |
VS vs; |
| |
STRING null,name,fname; |
| |
LIST l; |
| |
Q q; |
| |
|
| |
u = 0; |
| |
if ( PVSS ) { |
| |
if ( cur_binf ) { |
| |
/* builtin : [0,0,name] */ |
| |
MKSTR(null,""); |
| |
MKSTR(name,cur_binf->name); |
| |
t = mknode(3,null,name,0); |
| |
MKLIST(l,t); |
| |
MKNODE(u1,l,0); u = u1; |
| |
} |
| |
((VS)BDY(PVSS))->at = evalstatline; |
| |
for ( n = PVSS; n; n = NEXT(n) ) { |
| |
vs = (VS)BDY(n); |
| |
MKSTR(fname,vs->usrf->f.usrf->fname); |
| |
STOQ(vs->at,q); |
| |
MKSTR(name,vs->usrf->name); |
| |
t = mknode(3,fname,name,q); |
| |
MKLIST(l,t); |
| |
MKNODE(u1,l,u); u = u1; |
| |
} |
| |
} |
| |
MKLIST(*r,u); |
| |
} |
| |
|
| |
void change_stack(int level,NODE *pvss) |
| |
{ |
| extern NODE PVSS; |
extern NODE PVSS; |
| NODE n; |
NODE n; |
| int i; |
int i; |
|
|
| targetf = vs->usrf; curline = vs->at; |
targetf = vs->usrf; curline = vs->at; |
| } |
} |
| |
|
| void show_stack(vs) |
void show_stack(VS vs) |
| VS vs; |
|
| { |
{ |
| fprintf(stderr,"#%d %s(), line %d in \"%s\"\n", |
fprintf(stderr,"#%d %s(), line %d in \"%s\"\n", |
| ((VS)BDY(PVSS))->level-vs->level,vs->usrf->name,vs->at,vs->usrf->f.usrf->fname); |
((VS)BDY(PVSS))->level-vs->level,vs->usrf->name,vs->at,vs->usrf->f.usrf->fname); |