version 1.1.1.1, 1999/12/03 07:39:07 |
version 1.6, 2006/08/09 10:08:46 |
|
|
/* $OpenXM: OpenXM/src/asir99/builtin/var.c,v 1.1.1.1 1999/11/10 08:12:26 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/var.c,v 1.5 2005/10/26 07:33:03 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 14 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; |
|
|
vl = vl2; |
vl = vl2; |
} |
} |
break; |
break; |
|
case O_NBP: |
|
n = BDY((NBP)t); |
|
for ( vl = 0; n; n = NEXT(n) ) { |
|
get_vars((Obj)(((NBM)BDY(n))->c),&vl1); |
|
mergev(CO,vl,vl1,&vl2); |
|
vl = vl2; |
|
} |
|
break; |
default: |
default: |
vl = 0; break; |
vl = 0; break; |
} |
} |
*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; |
} |
} |