version 1.2, 2000/08/21 08:31:21 |
version 1.5, 2005/10/26 07:33:03 |
|
|
* shall be made on your publication or presentation in any form of the |
* shall be made on your publication or presentation in any form of the |
* results obtained by use of the SOFTWARE. |
* results obtained by use of the SOFTWARE. |
* (4) In the event that you modify the SOFTWARE, you shall notify FLL by |
* (4) In the event that you modify the SOFTWARE, you shall notify FLL by |
* e-mail at risa-admin@flab.fujitsu.co.jp of the detailed specification |
* 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 |
* for such modification or the source code of the modified part of the |
* SOFTWARE. |
* SOFTWARE. |
* |
* |
|
|
* 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/var.c,v 1.1.1.1 1999/12/03 07:39:07 noro Exp $ |
* $OpenXM: OpenXM_contrib2/asir2000/builtin/var.c,v 1.4 2001/10/09 01:36:07 noro Exp $ |
*/ |
*/ |
#include "ca.h" |
#include "ca.h" |
#include "parse.h" |
#include "parse.h" |
|
|
void Pvar(), Pvars(), Puc(), Pvars_recursive(); |
void Pvar(), Pvars(), Puc(), Pvars_recursive(); |
void get_vars(Obj,VL *); |
|
void get_vars_recursive(Obj,VL *); |
|
|
|
struct ftab var_tab[] = { |
struct ftab var_tab[] = { |
{"var",Pvar,1}, |
{"var",Pvar,1}, |
Line 62 struct ftab var_tab[] = { |
|
Line 60 struct ftab var_tab[] = { |
|
{0,0,0}, |
{0,0,0}, |
}; |
}; |
|
|
void Pvar(arg,rp) |
void Pvar(NODE arg,Obj *rp) |
NODE arg; |
|
Obj *rp; |
|
{ |
{ |
Obj t; |
Obj t; |
P p; |
P p; |
|
|
*rp = 0; |
*rp = 0; |
} |
} |
|
|
void Pvars(arg,rp) |
void Pvars(NODE arg,LIST *rp) |
NODE arg; |
|
LIST *rp; |
|
{ |
{ |
VL vl; |
VL vl; |
NODE n,n0; |
NODE n,n0; |
|
|
MKLIST(*rp,n0); |
MKLIST(*rp,n0); |
} |
} |
|
|
void Pvars_recursive(arg,rp) |
void Pvars_recursive(NODE arg,LIST *rp) |
NODE arg; |
|
LIST *rp; |
|
{ |
{ |
VL vl; |
VL vl; |
NODE n,n0; |
NODE n,n0; |
|
|
MKLIST(*rp,n0); |
MKLIST(*rp,n0); |
} |
} |
|
|
void get_vars_recursive(obj,vlp) |
void get_vars_recursive(Obj obj,VL *vlp) |
Obj obj; |
|
VL *vlp; |
|
{ |
{ |
VL vl,vl0,vl1,vl2,t; |
VL vl,vl0,vl1,vl2,t; |
PFINS ins; |
PFINS ins; |
|
|
mergev(CO,vl,vl0,vlp); |
mergev(CO,vl,vl0,vlp); |
} |
} |
|
|
void get_vars(t,vlp) |
void get_vars(Obj t,VL *vlp) |
Obj t; |
|
VL *vlp; |
|
{ |
{ |
pointer *vb; |
pointer *vb; |
pointer **mb; |
pointer **mb; |
|
|
*vlp = vl; |
*vlp = vl; |
} |
} |
|
|
void Puc(p) |
void Puc(Obj *p) |
Obj *p; |
|
{ |
{ |
VL vl; |
VL vl; |
V v; |
V v; |
P t; |
P t; |
char buf[BUFSIZ]; |
char buf[BUFSIZ]; |
|
char *n,*nv; |
static int UCN; |
static int UCN; |
|
|
NEWV(v); v->attr = (pointer)V_UC; |
NEWV(v); v->attr = (pointer)V_UC; |
sprintf(buf,"_%d",UCN++); |
sprintf(buf,"_%d",UCN++); |
NAME(v) = (char *)CALLOC(strlen(buf)+1,sizeof(char)); |
nv = NAME(v) = (char *)CALLOC(strlen(buf)+1,sizeof(char)); |
strcpy(NAME(v),buf); |
strcpy(NAME(v),buf); |
for ( vl = CO; NEXT(vl); vl = NEXT(vl) ); |
for ( vl = CO; vl; vl = NEXT(vl) ) |
NEWVL(NEXT(vl)); VR(NEXT(vl)) = v; NEXT(NEXT(vl)) = 0; |
if ( (n=NAME(VR(vl))) && !strcmp(n,nv) ) break; |
|
else if ( !NEXT(vl) ) { |
|
NEWVL(NEXT(vl)); VR(NEXT(vl)) = v; NEXT(NEXT(vl)) = 0; |
|
break; |
|
} |
MKV(v,t); *p = (Obj)t; |
MKV(v,t); *p = (Obj)t; |
} |
} |