[unix-history] / usr / src / old / pcc / ccom.tahoe / local.c

#ifndef lint
static char sccsid[] = "@(#)local.c	1.7 (Berkeley) %G%";
#endif

# include "pass1.h"

/*	this file contains code which is dependent on the target machine */

NODE *
clocal(p) register NODE *p; {

	/* this is called to do local transformations on
	   an expression tree preparitory to its being
	   written out in intermediate code.
	*/

	/* the major essential job is rewriting the
	   automatic variables and arguments in terms of
	   REG and OREG nodes */
	/* conversion ops which are not necessary are also clobbered here */
	/* in addition, any special features (such as rewriting
	   exclusive or) are easily handled here as well */

	register struct symtab *q;
	register NODE *r;
	register int o;
	register int m, ml;

	switch( o = p->in.op ){

	case NAME:
		if( p->tn.rval < 0 ) { /* already processed; ignore... */
			return(p);
			}
		q = &stab[p->tn.rval];
		switch( q->sclass ){

		case AUTO:
		case PARAM:
			/* fake up a structure reference */
			r = block( REG, NIL, NIL, PTR+STRTY, 0, 0 );
			r->tn.lval = 0;
			r->tn.rval = STKREG;
			p = stref( block( STREF, r, p, 0, 0, 0 ) );
			break;

		case ULABEL:
		case LABEL:
		case STATIC:
			if( q->slevel == 0 ) break;
			p->tn.lval = 0;
			p->tn.rval = -q->offset;
			break;

		case REGISTER:
			p->in.op = REG;
			p->tn.lval = 0;
			p->tn.rval = q->offset;
#ifdef REG_CHAR
			m = p->in.type;
			if( m==CHAR || m==SHORT )
				p->in.type = INT;
			else if( m==UCHAR || m==USHORT )
				p->in.type = UNSIGNED;
#endif
			break;

			}
		break;

	case LT:
	case LE:
	case GT:
	case GE:
		if( ISPTR( p->in.left->in.type ) || ISPTR( p->in.right->in.type ) ){
			p->in.op += (ULT-LT);
			}
		break;

	case PCONV:
		/* do pointer conversions for char and longs */
		ml = p->in.left->in.type;
		if( ( ml==CHAR || ml==UCHAR || ml==SHORT || ml==USHORT ) && p->in.left->in.op != ICON ) break;

		/* pointers all have the same representation; the type is inherited */

	inherit:
		p->in.left->in.type = p->in.type;
		p->in.left->fn.cdim = p->fn.cdim;
		p->in.left->fn.csiz = p->fn.csiz;
		p->in.op = FREE;
		return( p->in.left );

	case SCONV:
		m = p->in.type;
		ml = p->in.left->in.type;
		if(m == FLOAT || m == DOUBLE) {
			if(p->in.left->in.op==SCONV &&
			 ml == DOUBLE &&
			 p->in.left->in.left->in.type==m) {
				p->in.op = p->in.left->in.op = FREE;
				return(p->in.left->in.left);
			}
			if(p->in.left->in.op==FCON)
				goto inherit;
			break;
		}
		if(ml == FLOAT || ml == DOUBLE){
			if (p->in.left->in.op == FCON){
				p->in.left->in.op = FREE;
				p->in.op = ICON;
				p->tn.lval = p->in.left->fpn.fval;
				p->tn.rval = NONAME;
				return(p);
			}
			break;
		}
		/* now, look for conversions downwards */

		if( p->in.left->in.op == ICON ){	/* simulate the conversion here */
			CONSZ val;
			val = p->in.left->tn.lval;
			switch( m ){
			case CHAR:
				p->in.left->tn.lval = (char) val;
				break;
			case UCHAR:
				p->in.left->tn.lval = val & 0XFF;
				break;
			case USHORT:
				p->in.left->tn.lval = val & 0XFFFFL;
				break;
			case SHORT:
				p->in.left->tn.lval = (short)val;
				break;
			case UNSIGNED:
				p->in.left->tn.lval = val & 0xFFFFFFFFL;
				break;
			case INT:
				p->in.left->tn.lval = (int)val;
				break;
				}
			p->in.left->in.type = m;
		}
#ifdef notdef
		else if (tlen(p) == tlen(p->in.left))
			goto inherit;
#else
		else break;
#endif
		/* clobber conversion */
		p->in.op = FREE;
		return( p->in.left );  /* conversion gets clobbered */
		break;

	case QUEST:	/* the right side should be COLON */
		if((r = p->in.right)->in.op == SCONV) {
			p->in.right = r->in.left;
			p->in.type = r->in.left->in.type;
			r->in.left = p;
			return(r);
		}
		return(p);

	case PVCONV:
	case PMCONV:
		if( p->in.right->in.op != ICON ) cerror( "bad conversion", 0);
		p->in.op = FREE;
		return( buildtree( o==PMCONV?MUL:DIV, p->in.left, p->in.right ) );

	case FLD:
		/* make sure that the second pass does not make the
		   descendant of a FLD operator into a doubly indexed OREG */

		if( p->in.left->in.op == UNARY MUL
				&& (r=p->in.left->in.left)->in.op == PCONV)
			if( r->in.left->in.op == PLUS || r->in.left->in.op == MINUS ) 
				if( ISPTR(r->in.type) ) {
					if( ISUNSIGNED(p->in.left->in.type) )
						p->in.left->in.type = UNSIGNED;
					else
						p->in.left->in.type = INT;
				}
		break;
	case FORTCALL: /* arg must be FLOAT */
		if((r = p->in.right)->in.type != FLOAT)
			p->in.right = clocal(makety(r, FLOAT, 0, FLOAT));
		return(p);
	}

	/* if both sides are FLOAT, so is the op */
	if(optype(o)!=LTYPE && p->in.left->in.type==DOUBLE &&
	 (o==UNARY MINUS || optype(o)==BITYPE && p->in.right->in.type==DOUBLE)) {
		r = p->in.left;
		if(r->in.op==SCONV && r->in.left->in.type==FLOAT) {
			if(optype(o)==BITYPE) {
				r = p->in.right;
				if(r->in.op==SCONV && r->in.left->in.type==FLOAT) {
					r->in.op = FREE;
					p->in.right = r->in.left;
				} else if(r->in.op==FCON)
					r->in.type = FLOAT;
				else
					return(p);
			}
			r = p->in.left;
			p->in.left = r->in.left;
		} else if(optype(o)==BITYPE && r->in.op==FCON) {
			r = p->in.right;
			if(!(r->in.op==SCONV && r->in.left->in.type==FLOAT))
				return(p);
			p->in.right = r->in.left;
			p->in.left->in.type = FLOAT;
		} else
			return(p);
		if(p->in.type==DOUBLE) {
			p->in.type = FLOAT;
			r->in.left = p;
			return(r);
		} else {	/* usually logop */
			r->in.op = FREE;
			return(p);
		}
	}
	return(p);
}

andable( p ) NODE *p; {
	return(1);  /* all names can have & taken on them */
	}

cendarg(){ /* at the end of the arguments of a ftn, set the automatic offset */
	autooff = AUTOINIT;
	}

cisreg( t ) TWORD t; { /* is an automatic variable of type t OK for a register variable */

	if( t==INT || t==UNSIGNED || t==LONG || t==ULONG	/* tbl */
#ifdef REG_CHAR
		|| t==CHAR || t==UCHAR || t==SHORT || t==USHORT		/* tbl */
#endif
		|| ISPTR(t) || t == FLOAT) return (1);		/* wnj */
	return(0);
	}

NODE *
offcon( off, t, d, s ) OFFSZ off; TWORD t; {

	/* return a node, for structure references, which is suitable for
	   being added to a pointer of type t, in order to be off bits offset
	   into a structure */

	register NODE *p;

	/* t, d, and s are the type, dimension offset, and sizeoffset */
	/* in general they  are necessary for offcon, but not on H'well */

	p = bcon(0);
	p->tn.lval = off/SZCHAR;
	return(p);

	}


static inwd	/* current bit offsed in word */;
static CONSZ word	/* word being built from fields */;

incode( p, sz ) register NODE *p; {

	/* generate initialization code for assigning a constant c
		to a field of width sz */
	/* we assume that the proper alignment has been obtained */
	/* inoff is updated to have the proper final value */
	/* we also assume sz  < SZINT */

	inwd += sz;
	if(inwd > SZINT) cerror("incode: field > int");
	word |= (p->tn.lval&((1L<<sz)-1)) << (SZINT-inwd);
	inoff += sz;
	if(inoff%SZINT == 0) {
		printf( "	.long	0x%X\n", word);
		word = inwd = 0;
		}
	}

fincode( d, sz ) double d; register int sz; {
	/*
	 * output code to initialize space of size sz to the value d
	 * the proper alignment has been obtained
	 * inoff is updated to have the proper final value.
	 */

	register struct sh4 {
		unsigned short sh[4];
	} *x;
	float f;

	if(sz == SZFLOAT) {	/* force rounding */
		f = d;
		d = f;
	}

	x = (struct sh4 *)&d;
	printf("	.long	0x%04x%04x", x->sh[0], x->sh[1]);
	if(sz == SZDOUBLE) {
		printf(", 0x%04x%04x", x->sh[2], x->sh[3]);
		printf(" # .double %.17g\n", d);
	} else
		printf(" # .float %.8g\n", d);
	inoff += sz;
	}

cinit( p, sz ) NODE *p; {
	NODE *l;

	/*
	 * as a favor (?) to people who want to write
	 *     int i = 9600/134.5;
	 * we will, under the proper circumstances, do
	 * a coersion here.
	 */
	switch (p->in.type) {
	case INT:
	case UNSIGNED:
		l = p->in.left;
		if (l->in.op != SCONV ||
		    (l->in.left->tn.op != DCON && l->in.left->tn.op != FCON))
			break;
		l->in.op = FREE;
		l = l->in.left;
		l->tn.lval = l->tn.op == DCON ? (long)(l->dpn.dval) :
			(long)(l->fpn.fval);
		l->tn.rval = NONAME;
		l->tn.op = ICON;
		l->tn.type = INT;
		p->in.left = l;
		break;
	}
	/* arrange for the initialization of p into a space of
	size sz */
	/* the proper alignment has been opbtained */
	/* inoff is updated to have the proper final value */
	ecode( p );
	inoff += sz;
	}

vfdzero( n ){ /* define n bits of zeros in a vfd */

	if( n <= 0 ) return;

	inwd += n;
	inoff += n;
	if( inoff%ALINT ==0 ) {
		printf( "	.long	0x%X\n", word );
		word = inwd = 0;
		}
	}

char *
exname( p ) char *p; {
	/* make a name look like an external name in the local machine */

#ifndef FLEXNAMES
	static char text[NCHNAM+1];
#else
	static char text[BUFSIZ+1];
#endif

	register int i;

	text[0] = '_';
#ifndef FLEXNAMES
	for( i=1; *p&&i<NCHNAM; ++i )
#else
	for( i=1; *p; ++i )
#endif
		text[i] = *p++;

	text[i] = '\0';
#ifndef FLEXNAMES
	text[NCHNAM] = '\0';  /* truncate */
#endif

	return( text );
	}

ctype( type )TWORD type;{ /* map types which are not defined on the local machine */
	switch( BTYPE(type) ){

	case LONG:
		MODTYPE(type,INT);
		break;

	case ULONG:
		MODTYPE(type,UNSIGNED);
		}
	return( type );
	}

noinit() { /* curid is a variable which is defined but
	is not initialized (and not a function );
	This routine returns the stroage class for an uninitialized declaration */

	return(EXTERN);

	}

commdec( id ){ /* make a common declaration for id, if reasonable */
	register struct symtab *q;
	OFFSZ off, tsize();

	q = &stab[id];
	printf( "	.comm	%s,", exname( q->sname ) );
	off = tsize( q->stype, q->dimoff, q->sizoff );
	printf( "%d\n" /*CONFMT*/, off/SZCHAR );
	}

prtdcon(p)
	register NODE *p;
{
	register int o = p->in.op;
	int i;

	if (o != DCON && o != FCON)
		return;
	/*
	 * Clobber constants of value zero so
	 * we can generate more efficient code.
	 */
	if ((o == DCON && p->dpn.dval == 0) ||
	    (o == FCON && p->fpn.fval == 0)) {
		p->in.op = ICON;
		p->tn.rval = NONAME;
		return;
	}
	locctr(DATA);
	defalign(o == DCON ? ALDOUBLE : ALFLOAT);
	deflab(i = getlab());
	if (o == FCON)
		fincode(p->fpn.fval, SZFLOAT);
	else
		fincode(p->dpn.dval, SZDOUBLE);
	p->tn.lval = 0;
	p->tn.rval = -i;
	p->in.type = (o == DCON ? DOUBLE : FLOAT);
	p->in.op = NAME;
}

isitfloat( s ) char *s; {
	union cvt {
		double	d;
		int	n[2];
	} cvt;
	double atof();

	/* avoid floating point exception for double -> float conversions */
	dcon = cvt.d = atof(s);
	if( cvt.n[1] == 0 ){
		fcon = dcon;
		return( FCON );
		}
	return( DCON );
	}

ecode( p ) NODE *p; {

	/* walk the tree and write out the nodes.. */

	if( nerrors ) return;
	p2tree( p );
	p2compile( p );
	}

#ifndef ONEPASS
tlen(p) NODE *p; 
{
	switch(p->in.type) {
		case CHAR:
		case UCHAR:
			return(1);
			
		case SHORT:
		case USHORT:
			return(2);
			
		case DOUBLE:
			return(8);
			
		default:
			return(4);
		}
	}
#endif
Commit	Line	Data
b4204852	1	#ifndef lint
8b1d4f4a	2	static char sccsid[] = "@(#)local.c 1.7 (Berkeley) %G%";
b4204852 SL	3	#endif
b4204852 SL	4
7b1562c4	5	# include "pass1.h"
b4204852 SL	6
	7	/* this file contains code which is dependent on the target machine */
	8
	9	NODE *
	10	clocal(p) register NODE *p; {
	11
	12	/* this is called to do local transformations on
	13	an expression tree preparitory to its being
	14	written out in intermediate code.
	15	*/
	16
	17	/* the major essential job is rewriting the
	18	automatic variables and arguments in terms of
	19	REG and OREG nodes */
	20	/* conversion ops which are not necessary are also clobbered here */
	21	/* in addition, any special features (such as rewriting
	22	exclusive or) are easily handled here as well */
	23
	24	register struct symtab *q;
	25	register NODE *r;
	26	register int o;
	27	register int m, ml;
	28
	29	switch( o = p->in.op ){
	30
	31	case NAME:
	32	if( p->tn.rval < 0 ) { /* already processed; ignore... */
	33	return(p);
	34	}
	35	q = &stab[p->tn.rval];
	36	switch( q->sclass ){
	37
	38	case AUTO:
	39	case PARAM:
	40	/* fake up a structure reference */
	41	r = block( REG, NIL, NIL, PTR+STRTY, 0, 0 );
	42	r->tn.lval = 0;
	43	r->tn.rval = STKREG;
	44	p = stref( block( STREF, r, p, 0, 0, 0 ) );
	45	break;
	46
	47	case ULABEL:
	48	case LABEL:
	49	case STATIC:
	50	if( q->slevel == 0 ) break;
	51	p->tn.lval = 0;
	52	p->tn.rval = -q->offset;
	53	break;
	54
	55	case REGISTER:
	56	p->in.op = REG;
	57	p->tn.lval = 0;
	58	p->tn.rval = q->offset;
	59	#ifdef REG_CHAR
	60	m = p->in.type;
	61	if( m==CHAR \|\| m==SHORT )
	62	p->in.type = INT;
	63	else if( m==UCHAR \|\| m==USHORT )
	64	p->in.type = UNSIGNED;
	65	#endif
	66	break;
	67
	68	}
	69	break;
70
71	case LT:
72	case LE:
73	case GT:
74	case GE:
75	if( ISPTR( p->in.left->in.type ) \|\| ISPTR( p->in.right->in.type ) ){
76	p->in.op += (ULT-LT);
77	}
78	break;
79
80	case PCONV:
81	/* do pointer conversions for char and longs */
82	ml = p->in.left->in.type;
83	if( ( ml==CHAR \|\| ml==UCHAR \|\| ml==SHORT \|\| ml==USHORT ) && p->in.left->in.op != ICON ) break;
84
85	/* pointers all have the same representation; the type is inherited */
86
87	inherit:
88	p->in.left->in.type = p->in.type;
89	p->in.left->fn.cdim = p->fn.cdim;
90	p->in.left->fn.csiz = p->fn.csiz;
91	p->in.op = FREE;
92	return( p->in.left );
93
94	case SCONV:
95	m = p->in.type;
96	ml = p->in.left->in.type;
97	if(m == FLOAT \|\| m == DOUBLE) {
98	if(p->in.left->in.op==SCONV &&
d55e09a3	99	ml == DOUBLE &&
b4204852 SL	100	p->in.left->in.left->in.type==m) {
	101	p->in.op = p->in.left->in.op = FREE;
	102	return(p->in.left->in.left);
	103	}
	104	if(p->in.left->in.op==FCON)
	105	goto inherit;
	106	break;
	107	}
	108	if(ml == FLOAT \|\| ml == DOUBLE){
	109	if (p->in.left->in.op == FCON){
	110	p->in.left->in.op = FREE;
	111	p->in.op = ICON;
7b1562c4	112	p->tn.lval = p->in.left->fpn.fval;
b4204852 SL	113	p->tn.rval = NONAME;
	114	return(p);
	115	}
	116	break;
	117	}
	118	/* now, look for conversions downwards */
	119
b6f456ab	120	if( p->in.left->in.op == ICON ){ /* simulate the conversion here */
b4204852 SL	121	CONSZ val;
	122	val = p->in.left->tn.lval;
	123	switch( m ){
	124	case CHAR:
	125	p->in.left->tn.lval = (char) val;
	126	break;
	127	case UCHAR:
	128	p->in.left->tn.lval = val & 0XFF;
	129	break;
	130	case USHORT:
	131	p->in.left->tn.lval = val & 0XFFFFL;
	132	break;
	133	case SHORT:
	134	p->in.left->tn.lval = (short)val;
	135	break;
	136	case UNSIGNED:
	137	p->in.left->tn.lval = val & 0xFFFFFFFFL;
	138	break;
	139	case INT:
	140	p->in.left->tn.lval = (int)val;
	141	break;
	142	}
	143	p->in.left->in.type = m;
9ecc5499 DS	144	}
	145	#ifdef notdef
	146	else if (tlen(p) == tlen(p->in.left))
b6f456ab	147	goto inherit;
8b1d4f4a DS	148	#else
	149	else break;
	150	#endif
b4204852	151	/* clobber conversion */
b4204852 SL	152	p->in.op = FREE;
b4204852 SL	153	return( p->in.left ); /* conversion gets clobbered */
b6f456ab	154	break;
b4204852 SL	155
	156	case QUEST: /* the right side should be COLON */
	157	if((r = p->in.right)->in.op == SCONV) {
	158	p->in.right = r->in.left;
	159	p->in.type = r->in.left->in.type;
	160	r->in.left = p;
	161	return(r);
	162	}
	163	return(p);
	164
	165	case PVCONV:
	166	case PMCONV:
	167	if( p->in.right->in.op != ICON ) cerror( "bad conversion", 0);
	168	p->in.op = FREE;
	169	return( buildtree( o==PMCONV?MUL:DIV, p->in.left, p->in.right ) );
	170
	171	case FLD:
	172	/* make sure that the second pass does not make the
	173	descendant of a FLD operator into a doubly indexed OREG */
	174
	175	if( p->in.left->in.op == UNARY MUL
	176	&& (r=p->in.left->in.left)->in.op == PCONV)
	177	if( r->in.left->in.op == PLUS \|\| r->in.left->in.op == MINUS )
	178	if( ISPTR(r->in.type) ) {
	179	if( ISUNSIGNED(p->in.left->in.type) )
	180	p->in.left->in.type = UNSIGNED;
	181	else
	182	p->in.left->in.type = INT;
	183	}
	184	break;
7b1562c4 SL	185	case FORTCALL: /* arg must be FLOAT */
	186	if((r = p->in.right)->in.type != FLOAT)
	187	p->in.right = clocal(makety(r, FLOAT, 0, FLOAT));
	188	return(p);
	189	}
b4204852 SL	190
	191	/* if both sides are FLOAT, so is the op */
	192	if(optype(o)!=LTYPE && p->in.left->in.type==DOUBLE &&
	193	(o==UNARY MINUS \|\| optype(o)==BITYPE && p->in.right->in.type==DOUBLE)) {
	194	r = p->in.left;
	195	if(r->in.op==SCONV && r->in.left->in.type==FLOAT) {
	196	if(optype(o)==BITYPE) {
	197	r = p->in.right;
	198	if(r->in.op==SCONV && r->in.left->in.type==FLOAT) {
	199	r->in.op = FREE;
	200	p->in.right = r->in.left;
	201	} else if(r->in.op==FCON)
	202	r->in.type = FLOAT;
	203	else
	204	return(p);
	205	}
	206	r = p->in.left;
	207	p->in.left = r->in.left;
	208	} else if(optype(o)==BITYPE && r->in.op==FCON) {
	209	r = p->in.right;
	210	if(!(r->in.op==SCONV && r->in.left->in.type==FLOAT))
	211	return(p);
	212	p->in.right = r->in.left;
	213	p->in.left->in.type = FLOAT;
	214	} else
	215	return(p);
	216	if(p->in.type==DOUBLE) {
	217	p->in.type = FLOAT;
	218	r->in.left = p;
	219	return(r);
	220	} else { /* usually logop */
	221	r->in.op = FREE;
	222	return(p);
	223	}
	224	}
	225	return(p);
	226	}
	227
	228	andable( p ) NODE *p; {
	229	return(1); /* all names can have & taken on them */
	230	}
	231
	232	cendarg(){ /* at the end of the arguments of a ftn, set the automatic offset */
	233	autooff = AUTOINIT;
	234	}
	235
	236	cisreg( t ) TWORD t; { /* is an automatic variable of type t OK for a register variable */
	237
	238	if( t==INT \|\| t==UNSIGNED \|\| t==LONG \|\| t==ULONG /* tbl */
	239	#ifdef REG_CHAR
	240	\|\| t==CHAR \|\| t==UCHAR \|\| t==SHORT \|\| t==USHORT /* tbl */
	241	#endif
d55e09a3	242	\|\| ISPTR(t) \|\| t == FLOAT) return (1); /* wnj */
b4204852 SL	243	return(0);
	244	}
	245
	246	NODE *
	247	offcon( off, t, d, s ) OFFSZ off; TWORD t; {
	248
	249	/* return a node, for structure references, which is suitable for
	250	being added to a pointer of type t, in order to be off bits offset
	251	into a structure */
	252
	253	register NODE *p;
	254
	255	/* t, d, and s are the type, dimension offset, and sizeoffset */
	256	/* in general they are necessary for offcon, but not on H'well */
	257
	258	p = bcon(0);
	259	p->tn.lval = off/SZCHAR;
	260	return(p);
	261
	262	}
	263
	264
	265	static inwd /* current bit offsed in word */;
	266	static CONSZ word /* word being built from fields */;
	267
	268	incode( p, sz ) register NODE *p; {
	269
	270	/* generate initialization code for assigning a constant c
	271	to a field of width sz */
	272	/* we assume that the proper alignment has been obtained */
	273	/* inoff is updated to have the proper final value */
	274	/* we also assume sz < SZINT */
	275
	276	inwd += sz;
	277	if(inwd > SZINT) cerror("incode: field > int");
	278	word \|= (p->tn.lval&((1L<<sz)-1)) << (SZINT-inwd);
	279	inoff += sz;
	280	if(inoff%SZINT == 0) {
7b1562c4	281	printf( " .long 0x%X\n", word);
b4204852 SL	282	word = inwd = 0;
	283	}
	284	}
	285
b4204852 SL	286	fincode( d, sz ) double d; register int sz; {
	287	/*
	288	* output code to initialize space of size sz to the value d
	289	* the proper alignment has been obtained
7b1562c4	290	* inoff is updated to have the proper final value.
b4204852 SL	291	*/
	292
	293	register struct sh4 {
	294	unsigned short sh[4];
	295	} *x;
b4204852 SL	296	float f;
	297
	298	if(sz == SZFLOAT) { /* force rounding */
	299	f = d;
	300	d = f;
	301	}
b4204852 SL	302
	303	x = (struct sh4 *)&d;
	304	printf(" .long 0x%04x%04x", x->sh[0], x->sh[1]);
b4204852 SL	305	if(sz == SZDOUBLE) {
	306	printf(", 0x%04x%04x", x->sh[2], x->sh[3]);
	307	printf(" # .double %.17g\n", d);
	308	} else
	309	printf(" # .float %.8g\n", d);
	310	inoff += sz;
b4204852 SL	311	}
	312
	313	cinit( p, sz ) NODE *p; {
7b1562c4 SL	314	NODE *l;
	315
	316	/*
	317	* as a favor (?) to people who want to write
	318	* int i = 9600/134.5;
	319	* we will, under the proper circumstances, do
	320	* a coersion here.
	321	*/
	322	switch (p->in.type) {
	323	case INT:
	324	case UNSIGNED:
	325	l = p->in.left;
	326	if (l->in.op != SCONV \|\|
	327	(l->in.left->tn.op != DCON && l->in.left->tn.op != FCON))
	328	break;
	329	l->in.op = FREE;
	330	l = l->in.left;
	331	l->tn.lval = l->tn.op == DCON ? (long)(l->dpn.dval) :
	332	(long)(l->fpn.fval);
	333	l->tn.rval = NONAME;
	334	l->tn.op = ICON;
	335	l->tn.type = INT;
	336	p->in.left = l;
	337	break;
	338	}
b4204852 SL	339	/* arrange for the initialization of p into a space of
	340	size sz */
	341	/* the proper alignment has been opbtained */
	342	/* inoff is updated to have the proper final value */
	343	ecode( p );
	344	inoff += sz;
	345	}
	346
	347	vfdzero( n ){ /* define n bits of zeros in a vfd */
	348
	349	if( n <= 0 ) return;
	350
	351	inwd += n;
	352	inoff += n;
	353	if( inoff%ALINT ==0 ) {
7b1562c4	354	printf( " .long 0x%X\n", word );
b4204852 SL	355	word = inwd = 0;
	356	}
	357	}
	358
	359	char *
	360	exname( p ) char *p; {
	361	/* make a name look like an external name in the local machine */
	362
	363	#ifndef FLEXNAMES
	364	static char text[NCHNAM+1];
	365	#else
	366	static char text[BUFSIZ+1];
	367	#endif
	368
	369	register int i;
	370
	371	text[0] = '_';
	372	#ifndef FLEXNAMES
7b1562c4	373	for( i=1; *p&&i<NCHNAM; ++i )
b4204852	374	#else
7b1562c4	375	for( i=1; *p; ++i )
b4204852 SL	376	#endif
b4204852 SL	377	text[i] = *p++;
b4204852 SL	378
	379	text[i] = '\0';
	380	#ifndef FLEXNAMES
	381	text[NCHNAM] = '\0'; /* truncate */
	382	#endif
	383
	384	return( text );
	385	}
	386
	387	ctype( type )TWORD type;{ /* map types which are not defined on the local machine */
	388	switch( BTYPE(type) ){
	389
	390	case LONG:
	391	MODTYPE(type,INT);
	392	break;
	393
	394	case ULONG:
	395	MODTYPE(type,UNSIGNED);
	396	}
	397	return( type );
	398	}
	399
	400	noinit() { /* curid is a variable which is defined but
	401	is not initialized (and not a function );
	402	This routine returns the stroage class for an uninitialized declaration */
	403
	404	return(EXTERN);
	405
	406	}
	407
	408	commdec( id ){ /* make a common declaration for id, if reasonable */
	409	register struct symtab *q;
	410	OFFSZ off, tsize();
	411
	412	q = &stab[id];
	413	printf( " .comm %s,", exname( q->sname ) );
	414	off = tsize( q->stype, q->dimoff, q->sizoff );
895241c8	415	printf( "%d\n" /CONFMT/, off/SZCHAR );
b4204852 SL	416	}
b4204852 SL	417
7b1562c4 SL	418	prtdcon(p)
	419	register NODE *p;
	420	{
	421	register int o = p->in.op;
	422	int i;
	423
	424	if (o != DCON && o != FCON)
	425	return;
	426	/*
	427	* Clobber constants of value zero so
	428	* we can generate more efficient code.
	429	*/
	430	if ((o == DCON && p->dpn.dval == 0) \|\|
	431	(o == FCON && p->fpn.fval == 0)) {
	432	p->in.op = ICON;
	433	p->tn.rval = NONAME;
	434	return;
	435	}
	436	locctr(DATA);
	437	defalign(o == DCON ? ALDOUBLE : ALFLOAT);
	438	deflab(i = getlab());
	439	if (o == FCON)
	440	fincode(p->fpn.fval, SZFLOAT);
	441	else
	442	fincode(p->dpn.dval, SZDOUBLE);
	443	p->tn.lval = 0;
	444	p->tn.rval = -i;
	445	p->in.type = (o == DCON ? DOUBLE : FLOAT);
	446	p->in.op = NAME;
	447	}
b4204852 SL	448
b4204852 SL	449	isitfloat( s ) char *s; {
7b1562c4 SL	450	union cvt {
	451	double d;
	452	int n[2];
	453	} cvt;
b4204852	454	double atof();
7b1562c4 SL	455
	456	/* avoid floating point exception for double -> float conversions */
	457	dcon = cvt.d = atof(s);
	458	if( cvt.n[1] == 0 ){
	459	fcon = dcon;
	460	return( FCON );
	461	}
	462	return( DCON );
b4204852 SL	463	}
	464
	465	ecode( p ) NODE *p; {
	466
	467	/* walk the tree and write out the nodes.. */
	468
	469	if( nerrors ) return;
	470	p2tree( p );
	471	p2compile( p );
	472	}
	473
	474	#ifndef ONEPASS
	475	tlen(p) NODE *p;
	476	{
	477	switch(p->in.type) {
	478	case CHAR:
	479	case UCHAR:
	480	return(1);
	481
	482	case SHORT:
	483	case USHORT:
	484	return(2);
	485
	486	case DOUBLE:
	487	return(8);
	488
	489	default:
	490	return(4);
	491	}
	492	}
	493	#endif