#ifndef NORCSID static char rcsid[] = "$Id$"; #endif #include "assert.h" #include "param.h" #include "tables.h" #include "types.h" #include #include "data.h" #include "result.h" #include "extern.h" /* * (c) copyright 1987 by the Vrije Universiteit, Amsterdam, The Netherlands. * See the copyright notice in the ACK home directory, in the file "Copyright". * * Author: Hans van Staveren */ chrefcount(regno,amount,tflag) { register struct reginfo *rp; #if MAXMEMBERS != 0 register i, tmp; #endif rp= &machregs[regno]; #if MAXMEMBERS!=0 if (rp->r_members[0]==0) { #endif rp->r_refcount += amount; if (tflag) rp->r_tcount += amount; assert(rp->r_refcount >= 0); #if MAXMEMBERS!=0 } else for (i=0;ir_members[i])!=0) chrefcount(tmp,amount,tflag); #endif } getrefcount(regno, tflag) { register struct reginfo *rp; #if MAXMEMBERS != 0 register i,maxcount, tmp; #endif rp= &machregs[regno]; #if MAXMEMBERS!=0 if (rp->r_members[0]==0) #endif return(rp->r_refcount - (tflag ? rp->r_tcount : 0)); #if MAXMEMBERS!=0 else { maxcount=0; for (i=0;ir_members[i])!=0) { tmp = getrefcount(tmp, tflag); if (tmp > maxcount) maxcount = tmp; } return(maxcount); } #endif } erasereg(regno) { register struct reginfo *rp = &machregs[regno]; register int i; register byte *tdpb; #if MAXMEMBERS==0 rp->r_contents.t_token = 0; for (i=TOKENSIZE-1;i>=0;i--) rp->r_contents.t_att[i].aw = 0; /* Now erase recursively all registers containing * something using this one */ for (rp=machregs;rpr_contents.t_token == -1) { if (rp->r_contents.t_att[0].ar == regno) { /* erasereg(rp-machregs); replaced by the following three lines */ rp->r_contents.t_token = 0; for (i=TOKENSIZE-1;i>=0;i--) rp->r_contents.t_att[i].aw = 0; } } else if (rp->r_contents.t_token > 0) { tdpb= & (tokens[rp->r_contents.t_token].t_type[0]); for (i=0;ir_contents.t_att[i].ar == regno) { /* erasereg(rp-machregs); replaced by the following three lines */ rp->r_contents.t_token = 0; for (i=TOKENSIZE-1;i>=0;i--) rp->r_contents.t_att[i].aw = 0; break; } } } #else extern short clashlist[]; register short *sp = &clashlist[rp->r_iclash]; rp->r_contents.t_token = 0; while (*sp) { rp = &machregs[*sp]; rp->r_contents.t_token = 0; for (i=TOKENSIZE-1;i>=0;i--) rp->r_contents.t_att[i].aw = 0; regno = *sp++; /* Now erase recursively all registers containing * something using this one */ for (rp=machregs;rpr_contents.t_token == -1) { if (rp->r_contents.t_att[0].ar == regno) { /* erasereg(rp-machregs); replaced by the following three lines */ rp->r_contents.t_token = 0; for (i=TOKENSIZE-1;i>=0;i--) rp->r_contents.t_att[i].aw = 0; } } else if (rp->r_contents.t_token > 0) { tdpb= & (tokens[rp->r_contents.t_token].t_type[0]); for (i=0;ir_contents.t_att[i].ar == regno) { /* erasereg(rp-machregs); replaced by the following three lines */ rp->r_contents.t_token = 0; for (i=TOKENSIZE-1;i>=0;i--) rp->r_contents.t_att[i].aw = 0; break; } } } } #endif } cleanregs() { register struct reginfo *rp; register i; for (rp=machregs;rpr_contents.t_token = 0; for (i=TOKENSIZE-1;i>=0;i--) rp->r_contents.t_att[i].aw = 0; } } #ifndef NDEBUG inctcount(regno) { register struct reginfo *rp; register i; rp = &machregs[regno]; #if MAXMEMBERS!=0 if (rp->r_members[0] == 0) { #endif rp->r_tcount++; #if MAXMEMBERS!=0 } else { for (i=0;ir_members[i] != 0) inctcount(rp->r_members[i]); } #endif } chkregs() { register struct reginfo *rp; register token_p tp; register byte *tdpb; int i; for (rp=machregs+1;rpr_tcount==0); } for (tp=fakestack;tpt_token == -1) inctcount(tp->t_att[0].ar); else { tdpb = &(tokens[tp->t_token].t_type[0]); for (i=0;it_att[i].ar); } } #ifdef REGVARS #include for(i=reg_any;i<=reg_float;i++) { int j; for(j=0;jr_refcount==rp->r_tcount); rp->r_tcount=0; } } #endif