home
***
CD-ROM
|
disk
|
FTP
|
other
***
search
/
ftp.cs.arizona.edu
/
ftp.cs.arizona.edu.tar
/
ftp.cs.arizona.edu
/
icon
/
historic
/
v92.tgz
/
v92.tar
/
v92
/
src
/
runtime
/
rmisc.r
< prev
next >
Wrap
Text File
|
1996-03-22
|
52KB
|
2,048 lines
/*
* File: rmisc.r
* Contents: deref, eq, [gcvt], getvar, hash, outimage,
* qtos, pushact, popact, topact, [dumpact],
* findline, findipc, findfile, doimage, getimage
* printable, sig_rsm, cmd_line, varargs.
*
* Integer overflow checking.
*/
/*
* Prototypes.
*/
hidden novalue listimage
Params((FILE *f,struct b_list *lp, int restrict));
hidden novalue printimage Params((FILE *f,int c,int q));
hidden char * csname Params((dptr dp));
/*
* eq - compare two Icon strings for equality
*/
int eq(d1, d2)
dptr d1, d2;
{
char *s1, *s2;
int i;
if (StrLen(*d1) != StrLen(*d2))
return 0;
s1 = StrLoc(*d1);
s2 = StrLoc(*d2);
for (i = 0; i < StrLen(*d1); i++)
if (*s1++ != *s2++)
return 0;
return 1;
}
#ifdef IconEcvt
/*
* Convert floating-point number to a string.
*/
char *ecvt(double number, int ndigit, int *decpt, int *sign)
{
int n = 0;
static char buf[30];
/* Sort out the sign */
if (number >= 0)
*sign = 0;
else
{
*sign = 1;
number = -number;
}
/* Normalize the number to 0.1 <= number < 1, setting decpt */
if (number >= 1)
{
while (number >= 1)
{
++n;
number /= 10.0;
}
}
else if (number != 0.0 && number < 0.1)
{
while (number < 0.1)
{
--n;
number *= 10.0;
}
}
*decpt = n;
sprintf(buf, "%#.*f", ndigit, number);
/* Skip the leading "0." */
return (buf+2);
}
#endif /* IconEcvt */
#ifdef IconGcvt
/*
* gcvt - Convert number to a string in buf. If possible, ndigit
* significant digits are produced, otherwise a form with an exponent is used.
*
*/
char *gcvt(number, ndigit, buf)
double number;
#ifndef Linux
int ndigit;
#else /* Linux */
unsigned int ndigit;
#endif /* Linux */
char *buf;
{
int sign, decpt;
register char *p1, *p2;
register i;
#if AMIGA
#if AZTEC_C
/* shameless kludge around C library deficiency */
#define ecvt(w,x,y,z) 0
ftoa(number,buf,ndigit,2); /* 2 is MANX for "G" format */
for(i=strlen(buf); i>1 && buf[i-1]=='0' && buf[i-2]!='.'; i--)
buf[i-1] = '\0';
return buf;
#endif /* AZTEC_C */
#endif /* AMIGA */
#ifdef OS2EMX
/* shameless kludge around C library deficiency */
#define ecvt(w,x,y,z) 0
sprintf(buf, "%f", number);
for(i=strlen(buf); i>1 && buf[i-1]=='0' && buf[i-2]!='.'; i--)
buf[i-1] = '\0';
return buf;
#endif /* OS2EMX */
#if FreeBSD
#define ecvt(w,x,y,z) 0
sprintf(buf, "%f", number);
for(i=strlen(buf); i>1 && buf[i-1]=='0' && buf[i-2]!='.'; i--)
buf[i-1] = '\0';
return buf;
#endif /* FreeBSD */
p1 = ecvt(number, ndigit, &decpt, &sign);
p2 = buf;
if (sign)
*p2++ = '-';
for (i=ndigit-1; i>0 && p1[i]=='0'; i--)
ndigit--;
if (decpt >= 0 && decpt-(int)ndigit > 4
|| decpt < 0 && decpt < -3) { /* use E-style */
decpt--;
*p2++ = *p1++;
*p2++ = '.';
for (i=1; i<ndigit; i++)
*p2++ = *p1++;
*p2++ = 'e';
if (decpt<0) {
decpt = -decpt;
*p2++ = '-';
}
else
*p2++ = '+';
if (decpt/100 > 0)
*p2++ = decpt/100 + '0';
if (decpt/10 > 0)
*p2++ = (decpt%100)/10 + '0';
*p2++ = decpt%10 + '0';
} else {
if (decpt<=0) {
/* if (*p1!='0') */
*p2++ = '0';
*p2++ = '.';
while (decpt<0) {
decpt++;
*p2++ = '0';
}
}
for (i=1; i<=ndigit; i++) {
*p2++ = *p1++;
if (i==decpt)
*p2++ = '.';
}
if (ndigit<decpt) {
while (ndigit++<decpt)
*p2++ = '0';
*p2++ = '.';
}
}
if (p2[-1]=='.')
*p2++ = '0';
*p2 = '\0';
return(buf);
}
#endif /* IconGcvt */
/*
* Get variable descriptor from name. Returns the (integer-encoded) scope
* of the variable (Succeeded for keywords), or Failed if the variable
* does not exist.
*/
int getvar(s,vp)
char *s;
dptr vp;
{
register dptr dp;
register dptr np;
register int i;
struct b_proc *bp;
#if COMPILER
struct descrip sdp;
if (!debug_info)
fatalerr(402,NULL);
StrLoc(sdp) = s;
StrLen(sdp) = strlen(s);
#else /* COMPILER */
struct pf_marker *fp = pfp;
#endif /* COMPILER */
/*
* Is it a keyword that's a variable?
*/
if (*s == '&') {
if (strcmp(s,"&error") == 0) { /* must put basic one first */
vp->dword = D_Kywdint;
VarLoc(*vp) = &kywd_err;
return Succeeded;
}
else if (strcmp(s,"&pos") == 0) {
vp->dword = D_Kywdpos;
VarLoc(*vp) = &kywd_pos;
return Succeeded;
}
else if (strcmp(s,"&progname") == 0) {
vp->dword = D_Kywdstr;
VarLoc(*vp) = &kywd_prog;
return Succeeded;
}
else if (strcmp(s,"&random") == 0) {
vp->dword = D_Kywdint;
VarLoc(*vp) = &kywd_ran;
return Succeeded;
}
else if (strcmp(s,"&subject") == 0) {
vp->dword = D_Kywdsubj;
VarLoc(*vp) = &k_subject;
return Succeeded;
}
else if (strcmp(s,"&trace") == 0) {
vp->dword = D_Kywdint;
VarLoc(*vp) = &kywd_trc;
return Succeeded;
}
#ifdef FncTrace
else if (strcmp(s,"&ftrace") == 0) {
vp->dword = D_Kywdint;
VarLoc(*vp) = &kywd_ftrc;
return Succeeded;
}
#endif /* FncTrace */
else if (strcmp(s,"&dump") == 0) {
vp->dword = D_Kywdint;
VarLoc(*vp) = &kywd_dmp;
return Succeeded;
}
#ifdef Graphics
else if (strcmp(s,"&window") == 0) {
vp->dword = D_Kywdwin;
VarLoc(*vp) = &(kywd_xwin[XKey_Window]);
return Succeeded;
}
#endif /* Graphics */
#ifdef MultiThread
else if (strcmp(s,"&eventvalue") == 0) {
vp->dword = D_Var;
VarLoc(*vp) = (dptr)&(curpstate->eventval);
return Succeeded;
}
else if (strcmp(s,"&eventsource") == 0) {
vp->dword = D_Var;
VarLoc(*vp) = (dptr)&(curpstate->eventsource);
return Succeeded;
}
else if (strcmp(s,"&eventcode") == 0) {
vp->dword = D_Var;
VarLoc(*vp) = (dptr)&(curpstate->eventcode);
return Succeeded;
}
#endif /* MultiThread */
else return Failed;
}
/*
* Look for the variable the name with the local identifiers,
* parameters, and static names in each Icon procedure frame on the
* stack. If not found among the locals, check the global variables.
* If a variable with name is found, variable() returns a variable
* descriptor that points to the corresponding value descriptor.
* If no such variable exits, it fails.
*/
#if !COMPILER
/*
* If no procedure has been called (as can happen with icon_call(),
* dont' try to find local identifier.
*/
if (pfp == NULL)
goto glbvars;
#endif /* !COMPILER */
dp = argp;
#if COMPILER
bp = PFDebug(*pfp)->proc; /* get address of procedure block */
#else /* COMPILER */
bp = (struct b_proc *)BlkLoc(*dp); /* get address of procedure block */
#endif /* COMPILER */
np = bp->lnames; /* Check the formal parameter names. */
for (i = abs((int)bp->nparam); i > 0; i--) {
#if COMPILER
if (eq(&sdp, np) == 1) {
#else /* COMPILER */
dp++;
if (strcmp(s,StrLoc(*np)) == 0) {
#endif /* COMPILER */
vp->dword = D_Var;
VarLoc(*vp) = (dptr)dp;
return ParamName;
}
np++;
#if COMPILER
dp++;
#endif /* COMPILER */
}
#if COMPILER
dp = &pfp->tend.d[0];
#else /* COMPILER */
dp = &fp->pf_locals[0];
#endif /* COMPILER */
for (i = (int)bp->ndynam; i > 0; i--) { /* Check the local dynamic names. */
#if COMPILER
if (eq(&sdp, np)) {
#else /* COMPILER */
if (strcmp(s,StrLoc(*np)) == 0) {
#endif /* COMPILER */
vp->dword = D_Var;
VarLoc(*vp) = (dptr)dp;
return LocalName;
}
np++;
dp++;
}
dp = &statics[bp->fstatic]; /* Check the local static names. */
for (i = (int)bp->nstatic; i > 0; i--) {
#if COMPILER
if (eq(&sdp, np)) {
#else /* COMPILER */
if (strcmp(s,StrLoc(*np)) == 0) {
#endif /* COMPILER */
vp->dword = D_Var;
VarLoc(*vp) = (dptr)dp;
return StaticName;
}
np++;
dp++;
}
#if COMPILER
for (i = 0; i < n_globals; ++i) {
if (eq(&sdp, &gnames[i])) {
vp->dword = D_Var;
VarLoc(*vp) = (dptr)&globals[i];
return GlobalName;
}
}
#else /* COMPILER */
glbvars:
dp = globals; /* Check the global variable names. */
np = gnames;
while (dp < eglobals) {
if (strcmp(s,StrLoc(*np)) == 0) {
vp->dword = D_Var;
VarLoc(*vp) = (dptr)(dp);
return GlobalName;
}
np++;
dp++;
}
#endif /* COMPILER */
return Failed;
}
/*
* hash - compute hash value of arbitrary object for table and set accessing.
*/
uword hash(dp)
dptr dp;
{
register char *s;
register uword i;
register word j, n;
register unsigned int *bitarr;
double r;
if (Qual(*dp)) {
hashstring:
/*
* Compute the hash value for the string based on a scaled sum
* of its first ten characters, plus its length.
*/
i = 0;
s = StrLoc(*dp);
j = n = StrLen(*dp);
if (j > 10) /* limit scan to first ten characters */
j = 10;
while (j-- > 0) {
i += *s++ & 0xFF; /* add unsigned version of next char */
i *= 37; /* scale total by a nice prime number */
}
i += n; /* add the (untruncated) string length */
}
else {
switch (Type(*dp)) {
/*
* The hash value of an integer is itself times eight times the golden
* ratio. We do this calculation in fixed point. We don't just use
* the integer itself, for that would give bad results with sets
* having entries that are multiples of a power of two.
*/
case T_Integer:
i = (13255 * (uword)IntVal(*dp)) >> 10;
break;
#ifdef LargeInts
/*
* The hash value of a bignum is based on its length and its
* most and least significant digits.
*/
case T_Lrgint:
{
struct b_bignum *b = &BlkLoc(*dp)->bignumblk;
i = ((b->lsd - b->msd) << 16) ^
(b->digits[b->msd] << 8) ^ b->digits[b->lsd];
}
break;
#endif /* LargeInts */
/*
* The hash value of a real number is itself times a constant,
* converted to an unsigned integer. The intent is to scramble
* the bits well, in the case of integral values, and to scale up
* fractional values so they don't all land in the same bin.
* The constant below is 32749 / 29, the quotient of two primes,
* and was observed to work well in empirical testing.
*/
case T_Real:
GetReal(dp,r);
i = r * 1129.27586206896558;
break;
/*
* The hash value of a cset is based on a convoluted combination
* of all its bits.
*/
case T_Cset:
i = 0;
bitarr = BlkLoc(*dp)->cset.bits + CsetSize - 1;
for (j = 0; j < CsetSize; j++) {
i += *bitarr--;
i *= 37; /* better distribution */
}
i %= 1048583; /* scramble the bits */
break;
/*
* The hash value of a list, set, table, or record is its id,
* hashed like an integer.
*/
case T_List:
i = (13255 * BlkLoc(*dp)->list.id) >> 10;
break;
case T_Set:
i = (13255 * BlkLoc(*dp)->set.id) >> 10;
break;
case T_Table:
i = (13255 * BlkLoc(*dp)->table.id) >> 10;
break;
case T_Record:
i = (13255 * BlkLoc(*dp)->record.id) >> 10;
break;
case T_Proc:
dp = &(BlkLoc(*dp)->proc.pname);
goto hashstring;
break;
default:
/*
* For other types, use the type code as the hash
* value.
*/
i = Type(*dp);
break;
}
}
return i;
}
#define StringLimit 16 /* limit on length of imaged string */
#define ListLimit 6 /* limit on list items in image */
/*
* outimage - print image of *dp on file f. If restrict is nonzero,
* fields of records will not be imaged.
*/
novalue outimage(f, dp, restrict)
FILE *f;
dptr dp;
int restrict;
{
register word i, j;
register char *s;
register union block *bp;
char *type, *csn;
FILE *fd;
struct descrip q;
double rresult;
tended struct descrip tdp;
type_case *dp of {
string: {
/*
* *dp is a string qualifier. Print StringLimit characters of it
* using printimage and denote the presence of additional characters
* by terminating the string with "...".
*/
i = StrLen(*dp);
s = StrLoc(*dp);
j = Min(i, StringLimit);
putc('"', f);
while (j-- > 0)
printimage(f, *s++, '"');
if (i > StringLimit)
fprintf(f, "...");
putc('"', f);
}
null:
fprintf(f, "&null");
integer:
#ifdef LargeInts
if (Type(*dp) == T_Lrgint)
bigprint(f, dp);
else
fprintf(f, "%ld", (long)IntVal(*dp));
#else /* LargeInts */
fprintf(f, "%ld", (long)IntVal(*dp));
#endif /* LargeInts */
real: {
char s[30];
struct descrip rd;
GetReal(dp,rresult);
rtos(rresult, &rd, s);
fprintf(f, "%s", StrLoc(rd));
}
cset: {
/*
* Check for a predefined cset; use keyword name if found.
*/
if ((csn = csname(dp)) != NULL) {
fprintf(f, csn);
return;
}
/*
* Use printimage to print each character in the cset. Follow
* with "..." if the cset contains more than StringLimit
* characters.
*/
putc('\'', f);
j = StringLimit;
for (i = 0; i < 256; i++) {
if (Testb(i, *dp)) {
if (j-- <= 0) {
fprintf(f, "...");
break;
}
printimage(f, (int)i, '\'');
}
}
putc('\'', f);
}
file: {
/*
* Check for distinguished files by looking at the address of
* of the object to image. If one is found, print its name.
*/
if ((fd = BlkLoc(*dp)->file.fd) == stdin)
fprintf(f, "&input");
else if (fd == stdout)
fprintf(f, "&output");
else if (fd == stderr)
fprintf(f, "&errout");
else {
/*
* The file isn't a special one, just print "file(name)".
*/
i = StrLen(BlkLoc(*dp)->file.fname);
s = StrLoc(BlkLoc(*dp)->file.fname);
#ifdef Graphics
if (BlkLoc(*dp)->file.status & Fs_Window) {
s = ((wbp)(BlkLoc(*dp)->file.fd))->window->windowlabel;
i = strlen(s);
fprintf(f, "window_%d,%d(",
((wbp)BlkLoc(*dp)->file.fd)->window->serial,
((wbp)BlkLoc(*dp)->file.fd)->context->serial
);
}
else
#endif /* Graphics */
fprintf(f, "file(");
while (i-- > 0)
printimage(f, *s++, '\0');
putc(')', f);
}
}
proc: {
/*
* Produce one of:
* "procedure name"
* "function name"
* "record constructor name"
*
* Note that the number of dynamic locals is used to determine
* what type of "procedure" is at hand.
*/
i = StrLen(BlkLoc(*dp)->proc.pname);
s = StrLoc(BlkLoc(*dp)->proc.pname);
switch ((int)BlkLoc(*dp)->proc.ndynam) {
default: type = "procedure"; break;
case -1: type = "function"; break;
case -2: type = "record constructor"; break;
}
fprintf(f, "%s ", type);
while (i-- > 0)
printimage(f, *s++, '\0');
}
list: {
/*
* listimage does the work for lists.
*/
listimage(f, (struct b_list *)BlkLoc(*dp), restrict);
}
table: {
/*
* Print "table_m(n)" where n is the size of the table.
*/
fprintf(f, "table_%ld(%ld)", (long)BlkLoc(*dp)->table.id,
(long)BlkLoc(*dp)->table.size);
}
set: {
/*
* print "set_m(n)" where n is the cardinality of the set
*/
fprintf(f,"set_%ld(%ld)",(long)BlkLoc(*dp)->set.id,
(long)BlkLoc(*dp)->set.size);
}
record: {
/*
* If restrict is nonzero, print "record(n)" where n is the
* number of fields in the record. If restrict is zero, print
* the image of each field instead of the number of fields.
*/
bp = BlkLoc(*dp);
i = StrLen(bp->record.recdesc->proc.recname);
s = StrLoc(bp->record.recdesc->proc.recname);
fprintf(f, "record ");
while (i-- > 0)
printimage(f, *s++, '\0');
fprintf(f, "_%ld", bp->record.id);
j = bp->record.recdesc->proc.nfields;
if (j <= 0)
fprintf(f, "()");
else if (restrict > 0)
fprintf(f, "(%ld)", (long)j);
else {
putc('(', f);
i = 0;
for (;;) {
outimage(f, &bp->record.fields[i], restrict+1);
if (++i >= j)
break;
putc(',', f);
}
putc(')', f);
}
}
coexpr: {
fprintf(f, "co-expression_%ld(%ld)",
(long)((struct b_coexpr *)BlkLoc(*dp))->id,
(long)((struct b_coexpr *)BlkLoc(*dp))->size);
}
tvsubs: {
/*
* Produce "v[i+:j] = value" where v is the image of the variable
* containing the substring, i is starting position of the substring
* j is the length, and value is the string v[i+:j]. If the length
* (j) is one, just produce "v[i] = value".
*/
bp = BlkLoc(*dp);
dp = VarLoc(bp->tvsubs.ssvar);
if (is:kywdsubj(bp->tvsubs.ssvar)) {
fprintf(f, "&subject");
fflush(f);
}
else {
dp = (dptr)((word *)dp + Offset(bp->tvsubs.ssvar));
outimage(f, dp, restrict);
}
if (bp->tvsubs.sslen == 1)
#if EBCDIC != 1
fprintf(f, "[%ld]", (long)bp->tvsubs.sspos);
#else /* EBCDIC != 1 */
fprintf(f, "$<%ld$>", (long)bp->tvsubs.sspos);
#endif /* EBCDIC != 1 */
else
#if EBCDIC != 1
fprintf(f, "[%ld+:%ld]", (long)bp->tvsubs.sspos,
#else /* EBCDIC != 1 */
fprintf(f, "$<%ld+:%ld$>", (long)bp->tvsubs.sspos,
#endif /* EBCDIC != 1 */
(long)bp->tvsubs.sslen);
if (Qual(*dp)) {
if (bp->tvsubs.sspos + bp->tvsubs.sslen - 1 > StrLen(*dp))
return;
StrLen(q) = bp->tvsubs.sslen;
StrLoc(q) = StrLoc(*dp) + bp->tvsubs.sspos - 1;
fprintf(f, " = ");
outimage(f, &q, restrict);
}
}
tvtbl: {
/*
* produce "t[s]" where t is the image of the table containing
* the element and s is the image of the subscript.
*/
bp = BlkLoc(*dp);
tdp.dword = D_Table;
BlkLoc(tdp) = bp->tvtbl.clink;
outimage(f, &tdp, restrict);
#if EBCDIC != 1
putc('[', f);
#else /* EBCDIC != 1 */
putc('$', f);
putc('<', f);
#endif /* EBCDIC != 1 */
outimage(f, &bp->tvtbl.tref, restrict);
#if EBCDIC != 1
putc(']', f);
#else /* EBCDIC != 1 */
putc('$', f);
putc('>', f);
#endif /* EBCDIC != 1 */
}
kywdint: {
if (VarLoc(*dp) == &kywd_ran)
fprintf(f, "&random = ");
else if (VarLoc(*dp) == &kywd_trc)
fprintf(f, "&trace = ");
#ifdef FncTrace
else if (VarLoc(*dp) == &kywd_ftrc)
fprintf(f, "&ftrace = ");
#endif /* FncTrace */
else if (VarLoc(*dp) == &kywd_dmp)
fprintf(f, "&dump = ");
else if (VarLoc(*dp) == &kywd_err)
fprintf(f, "&error = ");
outimage(f, VarLoc(*dp), restrict);
}
kywdevent: {
#ifdef MultiThread
if (VarLoc(*dp) == &curpstate->eventsource)
fprintf(f, "&eventsource = ");
else if (VarLoc(*dp) == &curpstate->eventcode)
fprintf(f, "&eventcode = ");
else if (VarLoc(*dp) == &curpstate->eventval)
fprintf(f, "&eventval = ");
#endif /* MultiThread */
outimage(f, VarLoc(*dp), restrict);
}
kywdstr: {
outimage(f, VarLoc(*dp), restrict);
}
kywdpos: {
fprintf(f, "&pos = ");
outimage(f, VarLoc(*dp), restrict);
}
kywdsubj: {
fprintf(f, "&subject = ");
outimage(f, VarLoc(*dp), restrict);
}
kywdwin: {
fprintf(f, "&window = ");
outimage(f, VarLoc(*dp), restrict);
}
default: {
if (is:variable(*dp)) {
/*
* *d is a variable. Print "variable =", dereference it, and
* call outimage to handle the value.
*/
fprintf(f, "(variable = ");
dp = (dptr)((word *)VarLoc(*dp) + Offset(*dp));
outimage(f, dp, restrict);
putc(')', f);
}
else if (Type(*dp) == T_External)
fprintf(f, "external(%d)",((struct b_external *)BlkLoc(*dp))->blksize);
else if (Type(*dp) <= MaxType)
fprintf(f, "%s", blkname[Type(*dp)]);
else
syserr("outimage: unknown type");
}
}
}
/*
* printimage - print character c on file f using escape conventions
* if c is unprintable, '\', or equal to q.
*/
static novalue printimage(f, c, q)
FILE *f;
int c, q;
{
if (printable(c)) {
/*
* c is printable, but special case ", ', and \.
*/
switch (c) {
case '"':
if (c != q) goto deflt;
fprintf(f, "\\\"");
return;
case '\'':
if (c != q) goto deflt;
fprintf(f, "\\'");
return;
case '\\':
fprintf(f, "\\\\");
return;
default:
deflt:
putc(c, f);
return;
}
}
/*
* c is some sort of unprintable character. If it one of the common
* ones, produce a special representation for it, otherwise, produce
* its hex value.
*/
switch (c) {
case '\b': /* backspace */
fprintf(f, "\\b");
return;
#if !EBCDIC
case '\177': /* delete */
#else /* !EBCDIC */
case '\x07':
#endif /* !EBCDIC */
fprintf(f, "\\d");
return;
#if !EBCDIC
case '\33': /* escape */
#else /* !EBCDIC */
case '\x27':
#endif /* !EBCDIC */
fprintf(f, "\\e");
return;
case '\f': /* form feed */
fprintf(f, "\\f");
return;
case LineFeed: /* new line */
fprintf(f, "\\n");
return;
#if EBCDIC == 1
case '\x25': /* EBCDIC line feed */
fprintf(f, "\\l");
return;
#endif /* EBCDIC == 1 */
case CarriageReturn: /* carriage return */
fprintf(f, "\\r");
return;
case '\t': /* horizontal tab */
fprintf(f, "\\t");
return;
case '\13': /* vertical tab */
fprintf(f, "\\v");
return;
default: /* hex escape sequence */
fprintf(f, "\\x%02x", ToAscii(c & 0xff));
return;
}
}
/*
* listimage - print an image of a list.
*/
static novalue listimage(f, lp, restrict)
FILE *f;
struct b_list *lp;
int restrict;
{
register word i, j;
register struct b_lelem *bp;
word size, count;
bp = (struct b_lelem *) lp->listhead;
size = lp->size;
if (restrict > 0 && size > 0) {
/*
* Just give indication of size if the list isn't empty.
*/
fprintf(f, "list_%ld(%ld)", (long)lp->id, (long)size);
return;
}
/*
* Print [e1,...,en] on f. If more than ListLimit elements are in the
* list, produce the first ListLimit/2 elements, an ellipsis, and the
* last ListLimit elements.
*/
#if EBCDIC != 1
fprintf(f, "list_%ld = [", (long)lp->id);
#else /* EBCDIC != 1 */
fprintf(f, "list_%ld = $<", (long)lp->id);
#endif /* EBCDIC != 1 */
count = 1;
i = 0;
if (size > 0) {
for (;;) {
if (++i > bp->nused) {
i = 1;
bp = (struct b_lelem *) bp->listnext;
}
if (count <= ListLimit/2 || count > size - ListLimit/2) {
j = bp->first + i - 1;
if (j >= bp->nslots)
j -= bp->nslots;
outimage(f, &bp->lslots[j], restrict+1);
if (count >= size)
break;
putc(',', f);
}
else if (count == ListLimit/2 + 1)
fprintf(f, "...,");
count++;
}
}
#if EBCDIC != 1
putc(']', f);
#else /* EBCDIC != 1 */
putc('$', f);
putc('>', f);
#endif /* EBCDIC != 1 */
}
/*
* qsearch(key,base,nel,width,compar) - binary search
*
* A binary search routine with arguments similar to qsort(3).
* Returns a pointer to the item matching "key", or NULL if none.
* Based on Bentley, CACM 28,7 (July, 1985), p. 676.
*/
char * qsearch (key, base, nel, width, compar)
char * key;
char * base;
int nel, width;
int (*compar)();
{
int l, u, m, r;
char * a;
l = 0;
u = nel - 1;
while (l <= u) {
m = (l + u) / 2;
a = (char *) ((char *) base + width * m);
r = compar (a, key);
if (r < 0)
l = m + 1;
else if (r > 0)
u = m - 1;
else
return a;
}
return 0;
}
#if !COMPILER
/*
* qtos - convert a qualified string named by *dp to a C-style string.
* Put the C-style string in sbuf if it will fit, otherwise put it
* in the string region.
*/
int qtos(dp, sbuf)
dptr dp;
char *sbuf;
{
register word slen;
register char *c, *s;
c = StrLoc(*dp);
slen = StrLen(*dp)++;
if (slen >= MaxCvtLen) {
Protect(reserve(Strings, slen+1), return Error);
c = StrLoc(*dp);
if (c + slen != strfree) {
Protect(s = alcstr(c, slen), return Error);
}
else
s = c;
StrLoc(*dp) = s;
Protect(alcstr("",(word)1), return Error);
}
else {
StrLoc(*dp) = sbuf;
for ( ; slen > 0; slen--)
*sbuf++ = *c++;
*sbuf = '\0';
}
return Succeeded;
}
#endif /* !COMPILER */
#ifdef Coexpr
/*
* pushact - push actvtr on the activator stack of ce
*/
int pushact(ce, actvtr)
struct b_coexpr *ce, *actvtr;
{
struct astkblk *abp = ce->es_actstk, *nabp;
struct actrec *arp;
#ifdef MultiThread
abp->arec[0].activator = actvtr;
#else /* MultiThread */
/*
* If the last activator is the same as this one, just increment
* its count.
*/
if (abp->nactivators > 0) {
arp = &abp->arec[abp->nactivators - 1];
if (arp->activator == actvtr) {
arp->acount++;
return Succeeded;
}
}
/*
* This activator is different from the last one. Push this activator
* on the stack, possibly adding another block.
*/
if (abp->nactivators + 1 > ActStkBlkEnts) {
Protect(nabp = alcactiv(), fatalerr(0,NULL));
nabp->astk_nxt = abp;
abp = nabp;
}
abp->nactivators++;
arp = &abp->arec[abp->nactivators - 1];
arp->acount = 1;
arp->activator = actvtr;
ce->es_actstk = abp;
#endif /* MultiThread */
return Succeeded;
}
#endif /* Coexpr */
/*
* popact - pop the most recent activator from the activator stack of ce
* and return it.
*/
struct b_coexpr *popact(ce)
struct b_coexpr *ce;
{
#ifdef Coexpr
struct astkblk *abp = ce->es_actstk, *oabp;
struct actrec *arp;
struct b_coexpr *actvtr;
#ifdef MultiThread
return abp->arec[0].activator;
#else /* MultiThread */
/*
* If the current stack block is empty, pop it.
*/
if (abp->nactivators == 0) {
oabp = abp;
abp = abp->astk_nxt;
free((pointer)oabp);
}
if (abp == NULL || abp->nactivators == 0)
syserr("empty activator stack\n");
/*
* Find the activation record for the most recent co-expression.
* Decrement the activation count and if it is zero, pop that
* activation record and decrement the count of activators.
*/
arp = &abp->arec[abp->nactivators - 1];
actvtr = arp->activator;
if (--arp->acount == 0)
abp->nactivators--;
ce->es_actstk = abp;
return actvtr;
#endif /* MultiThread */
#else /* Coexpr */
syserr("popact() called, but co-expressions not implemented");
#endif /* Coexpr */
}
#ifdef Coexpr
/*
* topact - return the most recent activator of ce.
*/
struct b_coexpr *topact(ce)
struct b_coexpr *ce;
{
struct astkblk *abp = ce->es_actstk;
#ifdef MultiThread
return abp->arec[0].activator;
#else /* MultiThread */
if (abp->nactivators == 0)
abp = abp->astk_nxt;
return abp->arec[abp->nactivators-1].activator;
#endif /* MultiThread */
}
#ifdef DeBugIconx
/*
* dumpact - dump an activator stack
*/
novalue dumpact(ce)
struct b_coexpr *ce;
{
struct astkblk *abp = ce->es_actstk;
struct actrec *arp;
int i;
if (abp)
fprintf(stderr, "Ce %ld ", (long)ce->id);
while (abp) {
fprintf(stderr, "--- Activation stack block (%x) --- nact = %d\n",
abp, abp->nactivators);
for (i = abp->nactivators; i >= 1; i--) {
arp = &abp->arec[i-1];
/*for (j = 1; j <= arp->acount; j++)*/
fprintf(stderr, "co-expression_%ld(%d)\n", (long)(arp->activator->id),
arp->acount);
}
abp = abp->astk_nxt;
}
}
#endif /* DeBugIconx */
#endif /* Coexpr */
#if !COMPILER
/*
* findline - find the source line number associated with the ipc
*/
#ifdef SrcColumnInfo
int findline(ipc)
word *ipc;
{
return findloc(ipc) & 65535;
}
int findcol(ipc)
word *ipc;
{
return findloc(ipc) >> 16;
}
int findloc(ipc)
#else /* SrcColumnInfo */
int findline(ipc)
#endif /* SrcColumnInfo */
word *ipc;
{
uword ipc_offset;
uword size;
struct ipc_line *base;
#ifndef MultiThread
extern struct ipc_line *ilines, *elines;
extern word *records;
#endif /* MultiThread */
static two = 2; /* some compilers generate bad code for division
by a constant that is a power of two ... */
if (!InRange(code,ipc,records))
return 0;
ipc_offset = DiffPtrs((char *)ipc,(char *)code);
base = ilines;
size = DiffPtrs((char *)elines,(char *)ilines) / sizeof(struct ipc_line *);
while (size > 1) {
if (ipc_offset >= base[size / two].ipc) {
base = &base[size / two];
size -= size / two;
}
else
size = size / two;
}
/*
* return the line component of the location (column is top 16 bits)
*/
return (int)(base->line);
}
/*
* findipc - find the first ipc associated with a source-code line number.
*/
int findipc(line)
int line;
{
uword size;
struct ipc_line *base;
#ifndef MultiThread
extern struct ipc_line *ilines, *elines;
#endif /* MultiThread */
static two = 2; /* some compilers generate bad code for division
by a constant that is a power of two ... */
base = ilines;
size = DiffPtrs((char *)elines,(char *)ilines) / sizeof(struct ipc_line *);
while (size > 1) {
if (line >= base[size / two].line) {
base = &base[size / two];
size -= size / two;
}
else
size = size / two;
}
return base->ipc;
}
/*
* findfile - find source file name associated with the ipc
*/
char *findfile(ipc)
word *ipc;
{
uword ipc_offset;
struct ipc_fname *p;
#ifndef MultiThread
extern struct ipc_fname *filenms, *efilenms;
extern word *records;
#endif /* MultiThread */
if (!InRange(code,ipc,records))
return "?";
ipc_offset = DiffPtrs((char *)ipc,(char *)code);
for (p = efilenms - 1; p >= filenms; p--)
if (ipc_offset >= p->ipc)
return strcons + p->fname;
fprintf(stderr,"bad ipc/file name table\n");
fflush(stderr);
c_exit(ErrorExit);
}
#endif /* !COMPILER */
/*
* doimage(c,q) - allocate character c in string space, with escape
* conventions if c is unprintable, '\', or equal to q.
* Returns number of characters allocated.
*/
doimage(c, q)
int c, q;
{
static char cbuf[5];
if (printable(c)) {
/*
* c is printable, but special case ", ', and \.
*/
switch (c) {
case '"':
if (c != q) goto deflt;
Protect(alcstr("\\\"", (word)(2)), return Error);
return 2;
case '\'':
if (c != q) goto deflt;
Protect(alcstr("\\'", (word)(2)), return Error);
return 2;
case '\\':
Protect(alcstr("\\\\", (word)(2)), return Error);
return 2;
default:
deflt:
cbuf[0] = c;
Protect(alcstr(cbuf, (word)(1)), return Error);
return 1;
}
}
/*
* c is some sort of unprintable character. If it is one of the common
* ones, produce a special representation for it, otherwise, produce
* its hex value.
*/
switch (c) {
case '\b': /* backspace */
Protect(alcstr("\\b", (word)(2)), return Error);
return 2;
#if !EBCDIC
case '\177': /* delete */
#else /* !EBCDIC */
case '\x07': /* delete */
#endif /* !EBCDIC */
Protect(alcstr("\\d", (word)(2)), return Error);
return 2;
#if !EBCDIC
case '\33': /* escape */
#else /* !EBCDIC */
case '\x27': /* escape */
#endif /* !EBCDIC */
Protect(alcstr("\\e", (word)(2)), return Error);
return 2;
case '\f': /* form feed */
Protect(alcstr("\\f", (word)(2)), return Error);
return 2;
#if EBCDIC == 1
case '\x25': /* EBCDIC line feed */
Protect(alcstr("\\l", (word)(2)), return Error);
return 2;
#endif /* EBCDIC */
case LineFeed: /* new line */
Protect(alcstr("\\n", (word)(2)), return Error);
return 2;
case CarriageReturn: /* return */
Protect(alcstr("\\r", (word)(2)), return Error);
return 2;
case '\t': /* horizontal tab */
Protect(alcstr("\\t", (word)(2)), return Error);
return 2;
case '\13': /* vertical tab */
Protect(alcstr("\\v", (word)(2)), return Error);
return 2;
default: /* hex escape sequence */
sprintf(cbuf, "\\x%02x", ToAscii(c & 0xff));
Protect(alcstr(cbuf, (word)(4)), return Error);
return 4;
}
}
/*
* getimage(dp1,dp2) - return string image of object dp1 in dp2.
*/
int getimage(dp1,dp2)
dptr dp1, dp2;
{
register word len, outlen, rnlen;
int i;
tended char *s;
tended struct descrip source = *dp1; /* the source may move during gc */
register union block *bp;
char *type, *t, *csn;
char sbuf[MaxCvtLen];
FILE *fd;
type_case source of {
string: {
/*
* Form the image by putting a quote in the string space, calling
* doimage with each character in the string, and then putting
* a quote at then end. Note that doimage directly writes into the
* string space. (Hence the indentation.) This technique is used
* several times in this routine.
*/
s = StrLoc(source);
len = StrLen(source);
Protect (reserve(Strings, (len << 2) + 2), return Error);
Protect(t = alcstr("\"", (word)(1)), return Error);
StrLoc(*dp2) = t;
StrLen(*dp2) = 1;
while (len-- > 0)
StrLen(*dp2) += doimage(*s++, '"');
Protect(alcstr("\"", (word)(1)), return Error);
++StrLen(*dp2);
}
null: {
StrLoc(*dp2) = "&null";
StrLen(*dp2) = 5;
}
integer: {
#ifdef LargeInts
if (Type(source) == T_Lrgint) {
word slen;
word dlen;
struct b_bignum *blk = &BlkLoc(source)->bignumblk;
slen = blk->lsd - blk->msd;
dlen = slen * NB * 0.3010299956639812 /* 1 / log2(10) */
+ log((double)blk->digits[blk->msd]) * 0.4342944819032518 + 0.5;
/* 1 / ln(10) */
if (dlen >= MaxDigits) {
sprintf(sbuf,"integer(~10^%ld)",dlen);
len = strlen(sbuf);
Protect(StrLoc(*dp2) = alcstr(sbuf,len), return Error);
StrLen(*dp2) = len;
}
else bigtos(&source,dp2);
}
else
cnv: string(source, *dp2);
#else /* LargeInts */
cnv:string(source, *dp2);
#endif /* LargeInts */
}
real: {
cnv:string(source, *dp2);
}
cset: {
/*
* Check for the value of a predefined cset; use keyword name if found.
*/
if ((csn = csname(dp1)) != NULL) {
StrLoc(*dp2) = csn;
StrLen(*dp2) = strlen(csn);
return Succeeded;
}
/*
* Otherwise, describe it in terms of the character membership.
*/
i = BlkLoc(source)->cset.size;
if (i < 0)
i = cssize(&source);
i = (i << 2) + 2;
if (i > 730) i = 730;
Protect (reserve(Strings, i), return Error);
Protect(t = alcstr("'", (word)(1)), return Error);
StrLoc(*dp2) = t;
StrLen(*dp2) = 1;
for (i = 0; i < 256; ++i)
if (Testb(i, source))
StrLen(*dp2) += doimage((char)i, '\'');
Protect(alcstr("'", (word)(1)), return Error);
++StrLen(*dp2);
}
file: {
/*
* Check for distinguished files by looking at the address of
* of the object to image. If one is found, make a string
* naming it and return.
*/
if ((fd = BlkLoc(source)->file.fd) == stdin) {
StrLen(*dp2) = 6;
StrLoc(*dp2) = "&input";
}
else if (fd == stdout) {
StrLen(*dp2) = 7;
StrLoc(*dp2) = "&output";
}
else if (fd == stderr) {
StrLen(*dp2) = 7;
StrLoc(*dp2) = "&errout";
}
else {
/*
* The file is not a standard one; form a string of the form
* file(nm) where nm is the argument originally given to
* open.
*/
#ifdef Graphics
if (BlkLoc(source)->file.status & Fs_Window) {
s = ((wbp)(BlkLoc(source)->file.fd))->window->windowlabel;
len = strlen(s);
Protect (reserve(Strings, (len << 2) + 16), return Error);
sprintf(sbuf, "window_%d,%d(",
((wbp)BlkLoc(source)->file.fd)->window->serial,
((wbp)BlkLoc(source)->file.fd)->context->serial
);
Protect(t = alcstr(sbuf, (word)(strlen(sbuf))), return Error);
StrLoc(*dp2) = t;
StrLen(*dp2) = strlen(sbuf);
}
else {
#endif /* Graphics */
s = StrLoc(BlkLoc(source)->file.fname);
len = StrLen(BlkLoc(source)->file.fname);
Protect (reserve(Strings, (len << 2) + 12), return Error);
Protect(t = alcstr("file(", (word)(5)), return Error);
StrLoc(*dp2) = t;
StrLen(*dp2) = 5;
#ifdef Graphics
}
#endif /* Graphics */
while (len-- > 0)
StrLen(*dp2) += doimage(*s++, '\0');
Protect(alcstr(")", (word)(1)), return Error);
++StrLen(*dp2);
}
}
proc: {
/*
* Produce one of:
* "procedure name"
* "function name"
* "record constructor name"
*
* Note that the number of dynamic locals is used to determine
* what type of "procedure" is at hand.
*/
len = StrLen(BlkLoc(source)->proc.pname);
s = StrLoc(BlkLoc(source)->proc.pname);
Protect (reserve(Strings, len + 22), return Error);
switch ((int)BlkLoc(source)->proc.ndynam) {
default: type = "procedure "; outlen = 10; break;
case -1: type = "function "; outlen = 9; break;
case -2: type = "record constructor "; outlen = 19; break;
}
Protect(t = alcstr(type, outlen), return Error);
StrLoc(*dp2) = t;
Protect(alcstr(s, len), return Error);
StrLen(*dp2) = len + outlen;
}
list: {
/*
* Produce:
* "list_m(n)"
* where n is the current size of the list.
*/
bp = BlkLoc(*dp1);
sprintf(sbuf, "list_%ld(%ld)", (long)bp->list.id, (long)bp->list.size);
len = strlen(sbuf);
Protect(t = alcstr(sbuf, len), return Error);
StrLoc(*dp2) = t;
StrLen(*dp2) = len;
}
table: {
/*
* Produce:
* "table_m(n)"
* where n is the size of the table.
*/
bp = BlkLoc(*dp1);
sprintf(sbuf, "table_%ld(%ld)", (long)bp->table.id,
(long)bp->table.size);
len = strlen(sbuf);
Protect(t = alcstr(sbuf, len), return Error);
StrLoc(*dp2) = t;
StrLen(*dp2) = len;
}
set: {
/*
* Produce "set_m(n)" where n is size of the set.
*/
bp = BlkLoc(*dp1);
sprintf(sbuf, "set_%ld(%ld)", (long)bp->set.id, (long)bp->set.size);
len = strlen(sbuf);
Protect(t = alcstr(sbuf,len), return Error);
StrLoc(*dp2) = t;
StrLen(*dp2) = len;
}
record: {
/*
* Produce:
* "record name_m(n)" -- under construction
* where n is the number of fields.
*/
bp = BlkLoc(*dp1);
rnlen = StrLen(bp->record.recdesc->proc.recname);
sprintf(sbuf, "_%ld(%ld)", (long)bp->record.id,
(long)bp->record.recdesc->proc.nfields);
len = strlen(sbuf);
Protect (reserve(Strings, 7 + len + rnlen), return Error);
Protect(t = alcstr("record ", (word)(7)), return Error);
bp = BlkLoc(*dp1); /* refresh pointer */
StrLoc(*dp2) = t;
StrLen(*dp2) = 7;
Protect(alcstr(StrLoc(bp->record.recdesc->proc.recname),rnlen),
return Error);
StrLen(*dp2) += rnlen;
Protect(alcstr(sbuf, len), return Error);
StrLen(*dp2) += len;
}
coexpr: {
/*
* Produce:
* "co-expression_m (n)"
* where m is the number of the co-expressions and n is the
* number of results that have been produced.
*/
sprintf(sbuf, "_%ld(%ld)", (long)BlkLoc(source)->coexpr.id,
(long)BlkLoc(source)->coexpr.size);
len = strlen(sbuf);
Protect (reserve(Strings, len + 13), return Error);
Protect(t = alcstr("co-expression", (word)(13)), return Error);
StrLoc(*dp2) = t;
Protect(alcstr(sbuf, len), return Error);
StrLen(*dp2) = 13 + len;
}
default:
if (Type(*dp1) == T_External) {
/*
* For now, just produce "external(n)".
*/
sprintf(sbuf, "external(%ld)", (long)BlkLoc(*dp1)->externl.blksize);
len = strlen(sbuf);
Protect(t = alcstr(sbuf, len), return Error);
StrLoc(*dp2) = t;
StrLen(*dp2) = len;
}
else {
ReturnErrVal(123, source, Error);
}
}
return Succeeded;
}
/*
* csname(dp) -- return the name of a predefined cset matching dp.
*/
static char *csname(dp)
dptr dp;
{
register int j, n;
register unsigned int w;
n = BlkLoc(*dp)->cset.size;
if (n < 0)
n = cssize(dp);
#if EBCDIC != 1
/*
* Check for a cset we recognize using a hardwired decision tree.
* In ASCII, each of &lcase/&ucase/&digits are complete within 32 bits.
*/
if (n == 52) {
if ((Cset32('a',*dp) & Cset32('A',*dp)) == (0377777777l << CsetOff('a')))
return ("&letters");
}
else if (n < 52) {
if (n == 26) {
if (Cset32('a',*dp) == (0377777777l << CsetOff('a')))
return ("&lcase");
else if (Cset32('A',*dp) == (0377777777l << CsetOff('A')))
return ("&ucase");
}
else if (n == 10 && *CsetPtr('0',*dp) == (01777 << CsetOff('0')))
return ("&digits");
}
else /* n > 52 */ {
if (n == 256)
return "&cset";
else if (n == 128 && ~0 ==
(Cset32(0,*dp) & Cset32(32,*dp) & Cset32(64,*dp) & Cset32(96,*dp)))
return "&ascii";
}
return NULL;
#else /* EBCDIC != 1 */
/*
* Check for a cset we recognize using a hardwired decision tree.
* In EBCDIC, the neither &lcase nor &ucase is contiguous.
* #%#% THIS CODE HAS NOT YET BEEN TESTED.
*/
if (n == 52) {
if ((Cset32(0x80,*dp) & Cset32(0xC0,*dp)) == 0x03FE03FE
&& Cset32(0xA0,*dp) & Cset32(0xE0,*dp)) == 0x03FC)
return ("&letters");
}
else if (n < 52) {
if (n == 26) {
if (Cset32(0x80,*dp) == 0x03FE03FE && Cset32(0xA0,*dp) == 0x03FC)
return ("&lcase");
else if (Cset32(0xC0,*dp) == 0x03FE03FE && Cset32(0xE0,*dp) == 0x03FC)
return ("&ucase");
}
else if (n == 10 && *CsetPtr('0',*dp) == (01777 << CsetOff('0')))
return ("&digits");
}
else /* n > 52 */ {
if (n == 256)
return "&cset";
else if (n == 128) {
int i;
for (i = 0; i < CsetSize; i++)
if (k_ascii.bits[i] != BlkLoc(*dp)->cset.bits[i])
break;
if (i >= CsetSize) return "&ascii";
}
}
return NULL;
#endif /* EBCDIC != 1 */
}
/*
* cssize(dp) - calculate cset size, store it, and return it
*/
int cssize(dp)
dptr dp;
{
register int i, n;
register unsigned int w, *wp;
register struct b_cset *cs;
cs = &BlkLoc(*dp)->cset;
wp = (unsigned int *)cs->bits;
n = 0;
for (i = CsetSize; --i >= 0; )
for (w = *wp++; w != 0; w >>= 1)
n += (w & 1);
cs->size = n;
return n;
}
/*
* printable(c) -- is c a "printable" character?
*/
int printable(c)
int c;
{
/*
* The following code is operating-system dependent [@rmisc.01].
* Determine if a character is "printable".
*/
#if PORT
return isprint(c);
Deliberate Syntax Error
#endif /* PORT */
#if AMIGA || ATARI_ST || MSDOS || OS2 || UNIX || VMS
return (isascii(c) && isprint(c));
#endif /* AMIGA || ATARI_ST ... */
#if ARM
return (c >= 0x00 && c <= 0x7F && isprint(c));
#endif /* ARM */
#if MACINTOSH
#if MPW
return (isascii(c) && isprint(c));
#else /* MPW */
return isprint(c);
#endif /* MPW */
#endif /* MACINTOSH */
#if MVS || VM
#if SASC
return isascii(c) && !iscntrl(c);
#else /* SASC */
return isprint(c);
#endif /* SASC */
#endif /* MVS || VM */
/*
* End of operating-system specific code.
*/
}
#ifndef AsmOver
/*
* add, sub, mul, neg with overflow check
* all return 1 if ok, 0 if would overflow
*/
/*
* Note: on some systems an improvement in performance can be obtained by
* replacing the C functions that follow by checks written in assembly
* language. To do so, add #define AsmOver to ../h/define.h. If your
* C compiler supports the asm directive, put the new code at the end
* of this section under control of #else. Otherwise put it a separate
* file.
*/
extern int over_flow;
word add(a, b)
word a, b;
{
if ((a ^ b) >= 0 && (a >= 0 ? b > MaxLong - a : b < MinLong - a)) {
over_flow = 1;
return 0;
}
else {
over_flow = 0;
return a + b;
}
}
word sub(a, b)
word a, b;
{
if ((a ^ b) < 0 && (a >= 0 ? b < a - MaxLong : b > a - MinLong)) {
over_flow = 1;
return 0;
}
else {
over_flow = 0;
return a - b;
}
}
word mul(a, b)
word a, b;
{
if (b != 0) {
if ((a ^ b) >= 0) {
if (a >= 0 ? a > MaxLong / b : a < MaxLong / b) {
over_flow = 1;
return 0;
}
}
else if (b != -1 && (a >= 0 ? a > MinLong / b : a < MinLong / b)) {
over_flow = 1;
return 0;
}
}
over_flow = 0;
return a * b;
}
/* MinLong / -1 overflows; need div3 too */
word neg(a)
word a;
{
if (a == MinLong) {
over_flow = 1;
return 0;
}
over_flow = 0;
return -a;
}
#endif /* AsmOver */
#if COMPILER
/*
* sig_rsm - standard success continuation that just signals resumption.
*/
int sig_rsm()
{
return A_Resume;
}
/*
* cmd_line - convert command line arguments into a list of strings.
*/
novalue cmd_line(argc, argv, rslt)
int argc;
char **argv;
dptr rslt;
{
tended struct b_list *hp;
register word i;
register struct b_lelem *bp; /* need not be tended */
/*
* Skip the program name.
*/
--argc;
++argv;
/*
* Allocate the list and a list block.
*/
Protect(hp = alclist(argc), fatalerr(0,NULL));
Protect(bp = alclstb(argc, (word)0, argc), fatalerr(0,NULL));
/*
* Make the list block just allocated into the first and last blocks
* for the list.
*/
hp->listhead = hp->listtail = (union block *)bp;
/*
* Copy the arguments into the list
*/
for (i = 0; i < argc; ++i) {
StrLen(bp->lslots[i]) = strlen(argv[i]);
StrLoc(bp->lslots[i]) = argv[i];
}
rslt->dword = D_List;
rslt->vword.bptr = (union block *) hp;
}
/*
* varargs - construct list for use in procedures with variable length
* argument list.
*/
novalue varargs(argp, nargs, rslt)
dptr argp;
int nargs;
dptr rslt;
{
tended struct b_list *hp;
register word i;
register struct b_lelem *bp; /* need not be tended */
/*
* Allocate the list and a list block.
*/
Protect(hp = alclist(nargs), fatalerr(0,NULL));
Protect(bp = alclstb(nargs, (word)0, nargs), fatalerr(0,NULL));
/*
* Make the list block just allocated into the first and last blocks
* for the list.
*/
hp->listhead = hp->listtail = (union block *)bp;
/*
* Copy the arguments into the list
*/
for (i = 0; i < nargs; i++)
deref(&argp[i], &bp->lslots[i]);
rslt->dword = D_List;
rslt->vword.bptr = (union block *) hp;
}
#endif /* COMPILER */
/*
* retderef - Dereference local variables and substrings of local
* string-valued variables. This is used for return, suspend, and
* transmitting values across co-expression context switches.
*/
novalue retderef(valp, low, high)
dptr valp;
word *low;
word *high;
{
struct b_tvsubs *tvb;
word *loc;
if (Type(*valp) == T_Tvsubs) {
tvb = (struct b_tvsubs *)BlkLoc(*valp);
loc = (word *)VarLoc(tvb->ssvar);
}
else
loc = (word *)VarLoc(*valp) + Offset(*valp);
if (InRange(low, loc, high))
deref(valp, valp);
}