#include "gc.h" static intneedc(Prog *p){	while(p != P) {		switch(p->as) {		case AADCL:		case AADCQ:		case ASBBL:		case ASBBQ:		case ARCRL:		case ARCRQ:			return 1;		case AADDL:		case AADDQ:		case ASUBL:		case ASUBQ:		case AJMP:		case ARET:		case ACALL:			return 0;		default:			if(p->to.type == D_BRANCH)				return 0;		}		p = p->link;	}	return 0;} static Reg*rnops(Reg *r){	Prog *p;	Reg *r1; 	if(r != R)	for(;;){		p = r->prog;		if(p->as != ANOP || p->from.type != D_NONE || p->to.type != D_NONE)			break;		r1 = uniqs(r);		if(r1 == R)			break;		r = r1;	}	return r;} voidpeep(void){	Reg *r, *r1, *r2;	Prog *p, *p1;	int t; 	/*	 * complete R structure	 */	t = 0;	for(r=firstr; r!=R; r=r1) {		r1 = r->link;		if(r1 == R)			break;		p = r->prog->link;		while(p != r1->prog)		switch(p->as) {		default:			r2 = rega();			r->link = r2;			r2->link = r1; 			r2->prog = p;			r2->p1 = r;			r->s1 = r2;			r2->s1 = r1;			r1->p1 = r2; 			r = r2;			t++; 		case ADATA:		case AGLOBL:		case ANAME:		case ASIGNAME:			p = p->link;		}	} 	pc = 0;	/* speculating it won't kill */ loop1: 	t = 0;	for(r=firstr; r!=R; r=r->link) {		p = r->prog;		switch(p->as) {		case AMOVL:		case AMOVQ:		case AMOVSS:		case AMOVSD:			if(regtyp(&p->to))			if(regtyp(&p->from)) {				if(copyprop(r)) {					excise(r);					t++;				} else				if(subprop(r) && copyprop(r)) {					excise(r);					t++;				}			}			break; 		case AMOVBLZX:		case AMOVWLZX:		case AMOVBLSX:		case AMOVWLSX:			if(regtyp(&p->to)) {				r1 = rnops(uniqs(r));				if(r1 != R) {					p1 = r1->prog;					if(p->as == p1->as && p->to.type == p1->from.type){						p1->as = AMOVL;						t++;					}				}			}			break; 		case AMOVBQSX:		case AMOVBQZX:		case AMOVWQSX:		case AMOVWQZX:		case AMOVLQSX:		case AMOVLQZX:			if(regtyp(&p->to)) {				r1 = rnops(uniqs(r));				if(r1 != R) {					p1 = r1->prog;					if(p->as == p1->as && p->to.type == p1->from.type){						p1->as = AMOVQ;						t++;					}				}			}			break; 		case AADDL:		case AADDQ:		case AADDW:			if(p->from.type != D_CONST || needc(p->link))				break;			if(p->from.offset == -1){				if(p->as == AADDQ)					p->as = ADECQ;				else if(p->as == AADDL)					p->as = ADECL;				else					p->as = ADECW;				p->from = zprog.from;			}			else if(p->from.offset == 1){				if(p->as == AADDQ)					p->as = AINCQ;				else if(p->as == AADDL)					p->as = AINCL;				else					p->as = AINCW;				p->from = zprog.from;			}			break; 		case ASUBL:		case ASUBQ:		case ASUBW:			if(p->from.type != D_CONST || needc(p->link))				break;			if(p->from.offset == -1) {				if(p->as == ASUBQ)					p->as = AINCQ;				else if(p->as == ASUBL)					p->as = AINCL;				else					p->as = AINCW;				p->from = zprog.from;			}			else if(p->from.offset == 1){				if(p->as == ASUBQ)					p->as = ADECQ;				else if(p->as == ASUBL)					p->as = ADECL;				else					p->as = ADECW;				p->from = zprog.from;			}			break;		}	}	if(t)		goto loop1;} voidexcise(Reg *r){	Prog *p; 	p = r->prog;	p->as = ANOP;	p->from = zprog.from;	p->to = zprog.to;} Reg*uniqp(Reg *r){	Reg *r1; 	r1 = r->p1;	if(r1 == R) {		r1 = r->p2;		if(r1 == R || r1->p2link != R)			return R;	} else		if(r->p2 != R)			return R;	return r1;} Reg*uniqs(Reg *r){	Reg *r1; 	r1 = r->s1;	if(r1 == R) {		r1 = r->s2;		if(r1 == R)			return R;	} else		if(r->s2 != R)			return R;	return r1;} intregtyp(Adr *a){	int t; 	t = a->type;	if(t >= D_AX && t <= D_R15)		return 1;	if(t >= D_X0 && t <= D_X0+15)		return 1;	return 0;} /* * the idea is to substitute * one register for another * from one MOV to another *	MOV	a, R0 *	ADD	b, R0	/ no use of R1 *	MOV	R0, R1 * would be converted to *	MOV	a, R1 *	ADD	b, R1 *	MOV	R1, R0 * hopefully, then the former or latter MOV * will be eliminated by copy propagation. */intsubprop(Reg *r0){	Prog *p;	Adr *v1, *v2;	Reg *r;	int t; 	p = r0->prog;	v1 = &p->from;	if(!regtyp(v1))		return 0;	v2 = &p->to;	if(!regtyp(v2))		return 0;	for(r=uniqp(r0); r!=R; r=uniqp(r)) {		if(uniqs(r) == R)			break;		p = r->prog;		switch(p->as) {		case ACALL:			return 0; 		case AIMULL:		case AIMULQ:		case AIMULW:			if(p->to.type != D_NONE)				break; 		case ADIVB:		case ADIVL:		case ADIVQ:		case ADIVW:		case AIDIVB:		case AIDIVL:		case AIDIVQ:		case AIDIVW:		case AIMULB:		case AMULB:		case AMULL:		case AMULQ:		case AMULW: 		case AROLB:		case AROLL:		case AROLQ:		case AROLW:		case ARORB:		case ARORL:		case ARORQ:		case ARORW:		case ASALB:		case ASALL:		case ASALQ:		case ASALW:		case ASARB:		case ASARL:		case ASARQ:		case ASARW:		case ASHLB:		case ASHLL:		case ASHLQ:		case ASHLW:		case ASHRB:		case ASHRL:		case ASHRQ:		case ASHRW: 		case AREP:		case AREPN: 		case ACWD:		case ACDQ:		case ACQO: 		case AMOVSL:		case AMOVSQ:			return 0; 		case AMOVL:		case AMOVQ:			if(p->to.type == v1->type)				goto gotit;			break;		}		if(copyau(&p->from, v2) ||		   copyau(&p->to, v2))			break;		if(copysub(&p->from, v1, v2, 0) ||		   copysub(&p->to, v1, v2, 0))			break;	}	return 0; gotit:	copysub(&p->to, v1, v2, 1);	if(debug['P']) {		print("gotit: %D->%D\n%P", v1, v2, r->prog);		if(p->from.type == v2->type)			print(" excise");		print("\n");	}	for(r=uniqs(r); r!=r0; r=uniqs(r)) {		p = r->prog;		copysub(&p->from, v1, v2, 1);		copysub(&p->to, v1, v2, 1);		if(debug['P'])			print("%P\n", r->prog);	}	t = v1->type;	v1->type = v2->type;	v2->type = t;	if(debug['P'])		print("%P last\n", r->prog);	return 1;} /* * The idea is to remove redundant copies. *	v1->v2	F=0 *	(use v2	s/v2/v1/)* *	set v1	F=1 *	use v2	return fail *	----------------- *	v1->v2	F=0 *	(use v2	s/v2/v1/)* *	set v1	F=1 *	set v2	return success */intcopyprop(Reg *r0){	Prog *p;	Adr *v1, *v2;	Reg *r; 	p = r0->prog;	v1 = &p->from;	v2 = &p->to;	if(copyas(v1, v2))		return 1;	for(r=firstr; r!=R; r=r->link)		r->active = 0;	return copy1(v1, v2, r0->s1, 0);} intcopy1(Adr *v1, Adr *v2, Reg *r, int f){	int t;	Prog *p; 	if(r->active) {		if(debug['P'])			print("act set; return 1\n");		return 1;	}	r->active = 1;	if(debug['P'])		print("copy %D->%D f=%d\n", v1, v2, f);	for(; r != R; r = r->s1) {		p = r->prog;		if(debug['P'])			print("%P", p);		if(!f && uniqp(r) == R) {			f = 1;			if(debug['P'])				print("; merge; f=%d", f);		}		t = copyu(p, v2, A);		switch(t) {		case 2:	/* rar, cant split */			if(debug['P'])				print("; %D rar; return 0\n", v2);			return 0; 		case 3:	/* set */			if(debug['P'])				print("; %D set; return 1\n", v2);			return 1; 		case 1:	/* used, substitute */		case 4:	/* use and set */			if(f) {				if(!debug['P'])					return 0;				if(t == 4)					print("; %D used+set and f=%d; return 0\n", v2, f);				else					print("; %D used and f=%d; return 0\n", v2, f);				return 0;			}			if(copyu(p, v2, v1)) {				if(debug['P'])					print("; sub fail; return 0\n");				return 0;			}			if(debug['P'])				print("; sub %D/%D", v2, v1);			if(t == 4) {				if(debug['P'])					print("; %D used+set; return 1\n", v2);				return 1;			}			break;		}		if(!f) {			t = copyu(p, v1, A);			if(!f && (t == 2 || t == 3 || t == 4)) {				f = 1;				if(debug['P'])					print("; %D set and !f; f=%d", v1, f);			}		}		if(debug['P'])			print("\n");		if(r->s2)			if(!copy1(v1, v2, r->s2, f))				return 0;	}	return 1;} /* * return * 1 if v only used (and substitute),

Lines 1–500 of 846. Load more