version 1.2, 2000/08/21 08:31:47 |
version 1.15, 2005/10/19 04:51:15 |
|
|
* 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/parse/util.c,v 1.1.1.1 1999/12/03 07:39:12 noro Exp $ |
* $OpenXM: OpenXM_contrib2/asir2000/parse/util.c,v 1.14 2005/09/14 02:48:38 noro Exp $ |
*/ |
*/ |
#include "ca.h" |
#include "ca.h" |
#include "base.h" |
#include "base.h" |
#include "parse.h" |
#include "parse.h" |
#if defined(THINK_C) || defined(VISUAL) |
#if defined(__GNUC__) || defined(VISUAL) || (defined(__MACH__) && defined(__ppc__)) || defined(__FreeBSD__) |
#include <stdarg.h> |
#include <stdarg.h> |
#else |
#else |
#include <varargs.h> |
#include <varargs.h> |
#endif |
#endif |
#include <ctype.h> |
#include <ctype.h> |
|
|
int length(n) |
int length(NODE n) |
NODE n; |
|
{ |
{ |
int i; |
int i; |
|
|
|
|
return i; |
return i; |
} |
} |
|
|
int argc(a) |
int argc(NODE a) |
NODE a; |
|
{ |
{ |
int i; |
int i; |
|
|
|
|
return ( i ); |
return ( i ); |
} |
} |
|
|
void stoarg(s,acp,av) |
void stoarg(char *s,int *acp,char **av) |
char *s; |
|
int *acp; |
|
char **av; |
|
{ |
{ |
int i; |
int i; |
|
|
for ( i = 0; ; i++ ) { |
for ( i = 0; ; i++ ) { |
for ( ; *s && isspace(*s); s++ ); |
for ( ; *s && isspace((unsigned char)*s); s++ ); |
if ( *s ) { |
if ( *s ) { |
for ( av[i] = s; *s && !isspace(*s); s++ ); |
for ( av[i] = s; *s && |
|
!isspace((unsigned char)*s); s++ ); |
if ( *s ) |
if ( *s ) |
*s++ = 0; |
*s++ = 0; |
} else { |
} else { |
|
|
} |
} |
|
|
#if 0 |
#if 0 |
unsigned int ator(addr,r) |
unsigned int ator(unsigned int addr,Obj *r) |
unsigned int addr; |
|
Obj *r; |
|
{ |
{ |
N n; |
N n; |
Q q; |
Q q; |
|
|
} |
} |
#endif |
#endif |
|
|
void getarray(a,ind,vp) |
void getarray(pointer a,NODE ind,pointer *vp) |
pointer a; |
|
NODE ind; |
|
pointer *vp; |
|
{ |
{ |
Obj len,row,col; |
Obj len,row,col,trg; |
int i,l; |
int i; |
NODE n,n0; |
NODE n,n0; |
VECT v; |
VECT v; |
|
Q q; |
|
|
|
if ( a && OID(a) == O_BYTEARRAY ) { |
|
len = (Obj)BDY(ind); |
|
if ( !rangecheck(len,((BYTEARRAY)a)->len) ) |
|
error("getarray : Out of range"); |
|
else if ( NEXT(ind) ) |
|
error("getarray : invalid index"); |
|
else { |
|
i = (int)BDY((BYTEARRAY)a)[QTOS((Q)len)]; |
|
STOQ(i,q); |
|
*vp = (pointer)q; |
|
} |
|
return; |
|
} |
for ( ; ind; ind = NEXT(ind) ) { |
for ( ; ind; ind = NEXT(ind) ) { |
if ( !a ) |
if ( !a ) |
error("getarray : array or list expected"); |
error("getarray : array or list expected"); |
|
|
a = (pointer)v; |
a = (pointer)v; |
} |
} |
break; |
break; |
|
case O_IMAT: |
|
row = (Obj)BDY(ind); |
|
ind = NEXT(ind); |
|
col = (Obj)BDY(ind); |
|
if ( ((IMAT)a)->row < QTOS((Q)row) || |
|
((IMAT)a)->col < QTOS((Q)col) || |
|
(QTOS((Q)row) < 0) || (QTOS((Q)col) < 0)) |
|
error("putarray : Out of range"); |
|
GetIbody((IMAT)a, QTOS((Q)row), QTOS((Q)col), (Obj*)&trg); |
|
a = (pointer)trg; |
|
break; |
case O_LIST: |
case O_LIST: |
n0 = BDY((LIST)a); i = QTOS((Q)BDY(ind)); |
n0 = BDY((LIST)a); i = QTOS((Q)BDY(ind)); |
for ( l = 0, n = n0; n; n = NEXT(n), l++ ); |
if ( i < 0 ) |
if ( i < 0 || i >= l ) |
|
error("getarray : Out of range"); |
error("getarray : Out of range"); |
else { |
for ( n = n0; i > 0 && n; n = NEXT(n), i-- ); |
for ( n = n0, l = 0; l < i; l++, n = NEXT(n) ); |
if ( i || !n ) |
|
error("getarray : Out of range"); |
|
else |
a = (pointer)BDY(n); |
a = (pointer)BDY(n); |
} |
|
break; |
break; |
default: |
default: |
error("getarray : array or list expected"); |
error("getarray : array or list expected"); |
|
|
*vp = a; |
*vp = a; |
} |
} |
|
|
void putarray(a,ind,b) |
void putarray(pointer a,NODE ind,pointer b) |
pointer a; |
|
NODE ind; |
|
pointer b; |
|
{ |
{ |
Obj len,row,col; |
Obj len,row,col; |
int i,l; |
int i; |
NODE n,n0; |
NODE n,n0; |
|
|
|
if ( a && OID(a) == O_BYTEARRAY ) { |
|
len = (Obj)BDY(ind); |
|
if ( !rangecheck(len,((BYTEARRAY)a)->len) ) |
|
error("putarray : Out of range"); |
|
else if ( NEXT(ind) ) |
|
error("putarray : invalid index"); |
|
else |
|
BDY((BYTEARRAY)a)[QTOS((Q)len)] = (unsigned char)QTOS((Q)b); |
|
return; |
|
} |
for ( ; ind; ind = NEXT(ind) ) { |
for ( ; ind; ind = NEXT(ind) ) { |
if ( !a ) |
if ( !a ) |
error("putarray : array expected"); |
error("putarray : array expected"); |
|
|
} else |
} else |
error("putarray : invalid assignment"); |
error("putarray : invalid assignment"); |
break; |
break; |
|
case O_IMAT: |
|
row = (Obj)BDY(ind); |
|
ind = NEXT(ind); |
|
col = (Obj)BDY(ind); |
|
if ( ((IMAT)a)->row < QTOS((Q)row) || |
|
((IMAT)a)->col < QTOS((Q)col) || |
|
(QTOS((Q)row) < 0) || (QTOS((Q)col) < 0)) |
|
error("putarray : Out of range"); |
|
PutIent((IMAT)a, QTOS((Q)row), QTOS((Q)col), (Obj)b); |
|
break; |
case O_LIST: |
case O_LIST: |
if ( NEXT(ind) ) { |
if ( NEXT(ind) ) { |
n0 = BDY((LIST)a); i = QTOS((Q)BDY(ind)); |
n0 = BDY((LIST)a); i = QTOS((Q)BDY(ind)); |
for ( l = 0, n = n0; n; n = NEXT(n), l++ ); |
if ( i < 0 ) |
if ( i < 0 || i >= l ) |
|
error("putarray : Out of range"); |
error("putarray : Out of range"); |
else { |
for ( n = n0; i > 0 && n; n = NEXT(n), i-- ); |
for ( n = n0, l = 0; l < i; l++, n = NEXT(n) ); |
if ( i || !n ) |
|
error("puarray : Out of range"); |
|
else |
a = (pointer)BDY(n); |
a = (pointer)BDY(n); |
} |
|
} else |
} else |
error("putarray : invalid assignment"); |
error("putarray : invalid assignment"); |
break; |
break; |
|
|
} |
} |
} |
} |
|
|
int rangecheck(a,n) |
int rangecheck(Obj a,int n) |
Obj a; |
|
int n; |
|
{ |
{ |
N m; |
N m; |
|
|
|
|
return 1; |
return 1; |
} |
} |
|
|
int zp(p) |
int zp(P p) |
P p; |
|
{ |
{ |
int r; |
int r; |
DCP dc; |
DCP dc; |
|
|
return ( r ); |
return ( r ); |
} |
} |
|
|
#if defined(THINK_C) || defined(VISUAL) |
#if defined(__GNUC__) || defined(VISUAL) || (defined(__MACH__) && defined(__ppc__)) || defined(__FreeBSD__) |
NODE mknode(int ac,...) |
NODE mknode(int ac,...) |
{ |
{ |
va_list ap; |
va_list ap; |
|
|
} |
} |
#endif |
#endif |
|
|
void makevar(str,p) |
V searchvar(char *str) |
char *str; |
|
P *p; |
|
{ |
{ |
VL vl; |
VL vl; |
|
|
|
for ( vl = CO; ;vl = NEXT(vl) ) |
|
if ( NAME(VR(vl)) && !strcmp(NAME(VR(vl)),str) ) |
|
return VR(vl); |
|
return 0; |
|
} |
|
|
|
void makevar(char *str,P *p) |
|
{ |
|
VL vl; |
V v; |
V v; |
P t; |
P t; |
|
|
|
|
vl = NEXT(vl); |
vl = NEXT(vl); |
} |
} |
|
|
void makesrvar(f,p) |
void makesrvar(FUNC f,P *p) |
FUNC f; |
|
P *p; |
|
{ |
{ |
VL vl; |
VL vl; |
V v; |
V v; |
P t; |
P t; |
char *str; |
char *str; |
|
|
for ( vl = CO, str = NAME(f); ; ) |
for ( vl = CO, str = f->fullname; ; ) |
if ( NAME(VR(vl)) && !strcmp(NAME(VR(vl)),str) ) { |
if ( NAME(VR(vl)) && !strcmp(NAME(VR(vl)),str) ) { |
VR(vl)->attr = (pointer)V_SR; VR(vl)->priv = (pointer)f; |
VR(vl)->attr = (pointer)V_SR; VR(vl)->priv = (pointer)f; |
MKV(VR(vl),t); *p = t; |
MKV(VR(vl),t); *p = t; |
|
|
vl = NEXT(vl); |
vl = NEXT(vl); |
} |
} |
|
|
void appendtonode(n,a,nrp) |
void appendtonode(NODE n,pointer a,NODE *nrp) |
NODE n; |
|
pointer a; |
|
NODE *nrp; |
|
{ |
{ |
NODE tn; |
NODE tn; |
|
|
|
|
} |
} |
} |
} |
|
|
void appendtonode2(n,a,b,nrp) |
void appendtonode2(NODE2 n,pointer a,pointer b,NODE2 *nrp) |
NODE2 n; |
|
pointer a,b; |
|
NODE2 *nrp; |
|
{ |
{ |
NODE2 tn; |
NODE2 tn; |
|
|
|
|
} |
} |
} |
} |
|
|
void appendvar(vl,v) |
void appendvar(VL vl,V v) |
VL vl; |
|
V v; |
|
{ |
{ |
while (1) |
while (1) |
if ( vl->v == v ) |
if ( vl->v == v ) |
|
|
vl = NEXT(vl); |
vl = NEXT(vl); |
} |
} |
|
|
void reallocarray(arrayp,sizep,indexp,esize) |
void reallocarray(char **arrayp,int *sizep,int *indexp,int esize) |
char **arrayp; |
|
int *sizep,*indexp; |
|
int esize; |
|
{ |
{ |
char *new; |
char *new; |
|
|
|
|
*arrayp = new; |
*arrayp = new; |
} |
} |
} |
} |
|
|
#if defined(THINK_C) |
|
void bzero(p,len) |
|
register char *p; |
|
register int len; |
|
{ |
|
for ( ; len; len-- ) |
|
*p++ = 0; |
|
} |
|
|
|
void bcopy(s,d,len) |
|
register char *s; |
|
register char *d; |
|
int len; |
|
{ |
|
for ( ; len; len-- ) |
|
*d++ = *s++; |
|
} |
|
|
|
char *index(char *s,char c) |
|
{ |
|
for ( ; *s && *s != c; s++ ); |
|
if ( *s ) |
|
return s; |
|
else |
|
return 0; |
|
} |
|
|
|
void printap(p) |
|
P p; |
|
{ |
|
DCP dc; |
|
|
|
for ( dc = DC(p); dc; dc = NEXT(dc) ) { |
|
printf("(c=0x%lx c->nm=0x%lx c->nm->p=%ld) ", |
|
(int *)dc->c,(int *)((Q)dc->c)->nm,(int)((Q)dc->c)->nm->p); |
|
} |
|
printf("\n"); |
|
} |
|
#endif |
|