version 1.4, 2000/11/08 08:02:52 |
version 1.8, 2001/10/09 01:36:25 |
|
|
* 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.3 2000/08/22 05:04:28 noro Exp $ |
* $OpenXM: OpenXM_contrib2/asir2000/parse/util.c,v 1.7 2001/06/04 02:49:48 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(VISUAL) || (defined(__MACH__) && defined(__ppc__)) |
#include <stdarg.h> |
#include <stdarg.h> |
#else |
#else |
#include <varargs.h> |
#include <varargs.h> |
|
|
pointer *vp; |
pointer *vp; |
{ |
{ |
Obj len,row,col; |
Obj len,row,col; |
int i,l; |
int i; |
NODE n,n0; |
NODE n,n0; |
VECT v; |
VECT v; |
Q q; |
Q q; |
|
|
break; |
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"); |
|
|
pointer b; |
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 ) { |
if ( a && OID(a) == O_BYTEARRAY ) { |
|
|
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; |
|
|
return ( r ); |
return ( r ); |
} |
} |
|
|
#if defined(THINK_C) || defined(VISUAL) |
#if defined(VISUAL) || (defined(__MACH__) && defined(__ppc__)) |
NODE mknode(int ac,...) |
NODE mknode(int ac,...) |
{ |
{ |
va_list ap; |
va_list ap; |
|
|
*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 |
|