forsyth20121205-174063a80cc13 years agoHistory
1746 lines · 30.3 KB · C
RawDownload
#include	"l.h" static int	rexflag;static int	asmode; voidspan(void){	Prog *p, *q;	long v;	vlong c, idat;	int m, n, again; 	xdefine("etext", STEXT, 0L);	idat = INITDAT;	for(p = firstp; p != P; p = p->link) {		if(p->as == ATEXT)			curtext = p;		n = 0;		if(p->to.type == D_BRANCH)			if(p->pcond == P)				p->pcond = p;		if((q = p->pcond) != P)			if(q->back != 2)				n = 1;		p->back = n;		if(p->as == AADJSP) {			p->to.type = D_SP;			v = -p->from.offset;			p->from.offset = v;			p->as = p->mode != 64? AADDL: AADDQ;			if(v < 0) {				p->as = p->mode != 64? ASUBL: ASUBQ;				v = -v;				p->from.offset = v;			}			if(v == 0)				p->as = ANOP;		}	}	n = 0; start:	if(debug['v'])		Bprint(&bso, "%5.2f span\n", cputime());	Bflush(&bso);	c = INITTEXT;	for(p = firstp; p != P; p = p->link) {		if(p->as == ATEXT)			curtext = p;		if(p->to.type == D_BRANCH)			if(p->back)				p->pc = c;		asmins(p);		p->pc = c;		m = andptr-and;		p->mark = m;		c += m;	} loop:	n++;	if(debug['v'])		Bprint(&bso, "%5.2f span %d\n", cputime(), n);	Bflush(&bso);	if(n > 50) {		print("span must be looping\n");		errorexit();	}	again = 0;	c = INITTEXT;	for(p = firstp; p != P; p = p->link) {		if(p->as == ATEXT)			curtext = p;		if(p->to.type == D_BRANCH || p->back & 0100) {			if(p->back)				p->pc = c;			asmins(p);			m = andptr-and;			if(m != p->mark) {				p->mark = m;				again++;			}		}		p->pc = c;		c += p->mark;	}	if(again) {		textsize = c;		goto loop;	}	if(INITRND) {		INITDAT = rnd(c, INITRND);		if(INITDAT != idat) {			idat = INITDAT;			goto start;		}	}	xdefine("etext", STEXT, c);	if(debug['v'])		Bprint(&bso, "etext = %llux\n", c);	Bflush(&bso);	for(p = textp; p != P; p = p->pcond)		p->from.sym->value = p->pc;	textsize = c - INITTEXT;} voidxdefine(char *p, int t, vlong v){	Sym *s; 	s = lookup(p, 0);	if(s->type == 0 || s->type == SXREF) {		s->type = t;		s->value = v;	}	if(s->type == STEXT && s->value == 0)		s->value = v;} voidputsymb(char *s, int t, vlong v, int ver){	int i, f, l; 	if(t == 'f')		s++;	l = 4;	if(!debug['8']){		lput(v>>32);		l = 8;	}	lput(v);	if(ver)		t += 'a' - 'A';	cput(t+0x80);			/* 0x80 is variable length */ 	if(t == 'Z' || t == 'z') {		cput(s[0]);		for(i=1; s[i] != 0 || s[i+1] != 0; i += 2) {			cput(s[i]);			cput(s[i+1]);		}		cput(0);		cput(0);		i++;	}	else {		for(i=0; s[i]; i++)			cput(s[i]);		cput(0);	}	symsize += l + 1 + i + 1; 	if(debug['n']) {		if(t == 'z' || t == 'Z') {			Bprint(&bso, "%c %.8llux ", t, v);			for(i=1; s[i] != 0 || s[i+1] != 0; i+=2) {				f = ((s[i]&0xff) << 8) | (s[i+1]&0xff);				Bprint(&bso, "/%x", f);			}			Bprint(&bso, "\n");			return;		}		if(ver)			Bprint(&bso, "%c %.8llux %s<%d>\n", t, v, s, ver);		else			Bprint(&bso, "%c %.8llux %s\n", t, v, s);	}} voidasmsym(void){	Prog *p;	Auto *a;	Sym *s;	int h; 	s = lookup("etext", 0);	if(s->type == STEXT)		putsymb(s->name, 'T', s->value, s->version); 	for(h=0; h<NHASH; h++)		for(s=hash[h]; s!=S; s=s->link)			switch(s->type) {			case SCONST:				putsymb(s->name, 'D', s->value, s->version);				continue; 			case SDATA:				putsymb(s->name, 'D', s->value+INITDAT, s->version);				continue; 			case SBSS:				putsymb(s->name, 'B', s->value+INITDAT, s->version);				continue; 			case SFILE:				putsymb(s->name, 'f', s->value, s->version);				continue;			} 	for(p=textp; p!=P; p=p->pcond) {		s = p->from.sym;		if(s->type != STEXT)			continue; 		/* filenames first */		for(a=p->to.autom; a; a=a->link)			if(a->type == D_FILE)				putsymb(a->asym->name, 'z', a->aoffset, 0);			else			if(a->type == D_FILE1)				putsymb(a->asym->name, 'Z', a->aoffset, 0); 		putsymb(s->name, 'T', s->value, s->version); 		/* frame, auto and param after */		putsymb(".frame", 'm', p->to.offset+8, 0); 		for(a=p->to.autom; a; a=a->link)			if(a->type == D_AUTO)				putsymb(a->asym->name, 'a', -a->aoffset, 0);			else			if(a->type == D_PARAM)				putsymb(a->asym->name, 'p', a->aoffset, 0);	}	if(debug['v'] || debug['n'])		Bprint(&bso, "symsize = %lud\n", symsize);	Bflush(&bso);} voidasmlc(void){	vlong oldpc;	Prog *p;	long oldlc, v, s; 	oldpc = INITTEXT;	oldlc = 0;	for(p = firstp; p != P; p = p->link) {		if(p->line == oldlc || p->as == ATEXT || p->as == ANOP) {			if(p->as == ATEXT)				curtext = p;			if(debug['L'])				Bprint(&bso, "%6llux %P\n",					p->pc, p);			continue;		}		if(debug['L'])			Bprint(&bso, "\t\t%6ld", lcsize);		v = (p->pc - oldpc) / MINLC;		while(v) {			s = 127;			if(v < 127)				s = v;			cput(s+128);	/* 129-255 +pc */			if(debug['L'])				Bprint(&bso, " pc+%ld*%d(%ld)", s, MINLC, s+128);			v -= s;			lcsize++;		}		s = p->line - oldlc;		oldlc = p->line;		oldpc = p->pc + MINLC;		if(s > 64 || s < -64) {			cput(0);	/* 0 vv +lc */			cput(s>>24);			cput(s>>16);			cput(s>>8);			cput(s);			if(debug['L']) {				if(s > 0)					Bprint(&bso, " lc+%ld(%d,%ld)\n",						s, 0, s);				else					Bprint(&bso, " lc%ld(%d,%ld)\n",						s, 0, s);				Bprint(&bso, "%6llux %P\n",					p->pc, p);			}			lcsize += 5;			continue;		}		if(s > 0) {			cput(0+s);	/* 1-64 +lc */			if(debug['L']) {				Bprint(&bso, " lc+%ld(%ld)\n", s, 0+s);				Bprint(&bso, "%6llux %P\n",					p->pc, p);			}		} else {			cput(64-s);	/* 65-128 -lc */			if(debug['L']) {				Bprint(&bso, " lc%ld(%ld)\n", s, 64-s);				Bprint(&bso, "%6llux %P\n",					p->pc, p);			}		}		lcsize++;	}	while(lcsize & 1) {		s = 129;		cput(s);		lcsize++;	}	if(debug['v'] || debug['L'])		Bprint(&bso, "lcsize = %ld\n", lcsize);	Bflush(&bso);} intoclass(Adr *a){	vlong v;	long l; 	if(a->type >= D_INDIR || a->index != D_NONE) {		if(a->index != D_NONE && a->scale == 0) {			if(a->type == D_ADDR) {				switch(a->index) {				case D_EXTERN:				case D_STATIC:					return Yi32;	/* TO DO: Yi64 */				case D_AUTO:				case D_PARAM:					return Yiauto;				}				return Yxxx;			}			return Ycol;		}		return Ym;	}	switch(a->type)	{	case D_AL:		return Yal; 	case D_AX:		return Yax; /*	case D_SPB:*/	case D_BPB:	case D_SIB:	case D_DIB:	case D_R8B:	case D_R9B:	case D_R10B:	case D_R11B:	case D_R12B:	case D_R13B:	case D_R14B:	case D_R15B:		if(asmode != 64)			return Yxxx;	case D_DL:	case D_BL:	case D_AH:	case D_CH:	case D_DH:	case D_BH:		return Yrb; 	case D_CL:		return Ycl; 	case D_CX:		return Ycx; 	case D_DX:	case D_BX:		return Yrx; 	case D_R8:	/* not really Yrl */	case D_R9:	case D_R10:	case D_R11:	case D_R12:	case D_R13:	case D_R14:	case D_R15:		if(asmode != 64)			return Yxxx;	case D_SP:	case D_BP:	case D_SI:	case D_DI:		return Yrl; 	case D_F0+0:		return	Yf0; 	case D_F0+1:	case D_F0+2:	case D_F0+3:	case D_F0+4:	case D_F0+5:	case D_F0+6:	case D_F0+7:		return	Yrf; 	case D_M0+0:	case D_M0+1:	case D_M0+2:	case D_M0+3:	case D_M0+4:	case D_M0+5:	case D_M0+6:	case D_M0+7:		return	Ymr; 	case D_X0+0:	case D_X0+1:	case D_X0+2:	case D_X0+3:	case D_X0+4:	case D_X0+5:	case D_X0+6:	case D_X0+7:	case D_X0+8:	case D_X0+9:	case D_X0+10:	case D_X0+11:	case D_X0+12:	case D_X0+13:	case D_X0+14:	case D_X0+15:		return	Yxr; 	case D_NONE:		return Ynone; 	case D_CS:	return	Ycs;	case D_SS:	return	Yss;	case D_DS:	return	Yds;	case D_ES:	return	Yes;	case D_FS:	return	Yfs;	case D_GS:	return	Ygs; 	case D_GDTR:	return	Ygdtr;	case D_IDTR:	return	Yidtr;	case D_LDTR:	return	Yldtr;	case D_MSW:	return	Ymsw;	case D_TASK:	return	Ytask; 	case D_CR+0:	return	Ycr0;	case D_CR+1:	return	Ycr1;	case D_CR+2:	return	Ycr2;	case D_CR+3:	return	Ycr3;	case D_CR+4:	return	Ycr4;	case D_CR+5:	return	Ycr5;	case D_CR+6:	return	Ycr6;	case D_CR+7:	return	Ycr7;	case D_CR+8:	return	Ycr8; 	case D_DR+0:	return	Ydr0;	case D_DR+1:	return	Ydr1;	case D_DR+2:	return	Ydr2;	case D_DR+3:	return	Ydr3;	case D_DR+4:	return	Ydr4;	case D_DR+5:	return	Ydr5;	case D_DR+6:	return	Ydr6;	case D_DR+7:	return	Ydr7; 	case D_TR+0:	return	Ytr0;	case D_TR+1:	return	Ytr1;	case D_TR+2:	return	Ytr2;	case D_TR+3:	return	Ytr3;	case D_TR+4:	return	Ytr4;	case D_TR+5:	return	Ytr5;	case D_TR+6:	return	Ytr6;	case D_TR+7:	return	Ytr7; 	case D_EXTERN:	case D_STATIC:	case D_AUTO:	case D_PARAM:		return Ym; 	case D_CONST:	case D_ADDR:		if(a->sym == S) {			v = a->offset;			if(v == 0)				return Yi0;			if(v == 1)				return Yi1;			if(v >= -128 && v <= 127)				return Yi8;			l = v;			if((vlong)l == v)				return Ys32;	/* can sign extend */			if((v>>32) == 0)				return Yi32;	/* unsigned */

Lines 1–500 of 1746.