ceeeca40f6
changed place of #ifdef to make this null-module compile faster when no register variables are used.
152 lines
3.3 KiB
C
152 lines
3.3 KiB
C
#include "assert.h"
|
|
#include "param.h"
|
|
#include "tables.h"
|
|
|
|
#ifdef REGVARS
|
|
|
|
#include "types.h"
|
|
#include <cg_pattern.h>
|
|
#include "data.h"
|
|
#include "regvar.h"
|
|
#include <em_reg.h>
|
|
#include "result.h"
|
|
#include "extern.h"
|
|
|
|
/*
|
|
* (c) copyright 1983 by the Vrije Universiteit, Amsterdam, The Netherlands.
|
|
*
|
|
* This product is part of the Amsterdam Compiler Kit.
|
|
*
|
|
* Permission to use, sell, duplicate or disclose this software must be
|
|
* obtained in writing. Requests for such permissions may be sent to
|
|
*
|
|
* Dr. Andrew S. Tanenbaum
|
|
* Wiskundig Seminarium
|
|
* Vrije Universiteit
|
|
* Postbox 7161
|
|
* 1007 MC Amsterdam
|
|
* The Netherlands
|
|
*
|
|
* Author: Hans van Staveren
|
|
*/
|
|
|
|
struct regvar *rvlist;
|
|
|
|
struct regvar *
|
|
linkreg(of,sz,tp,sc) long of; {
|
|
struct regvar *rvlp;
|
|
|
|
rvlp= (struct regvar *) myalloc(sizeof *rvlp);
|
|
rvlp->rv_next = rvlist;
|
|
rvlist=rvlp;
|
|
rvlp->rv_off = of;
|
|
rvlp->rv_size = sz;
|
|
rvlp->rv_type = tp;
|
|
rvlp->rv_score = sc;
|
|
rvlp->rv_reg = 0; /* no register assigned yet */
|
|
return(rvlp);
|
|
}
|
|
|
|
tryreg(rvlp,typ) struct regvar *rvlp; {
|
|
int score;
|
|
register i;
|
|
struct regassigned *ra;
|
|
struct regvar *save;
|
|
|
|
if (typ != reg_any && nregvar[typ]!=0) {
|
|
if (machregs[rvnumbers[typ][0]].r_size!=rvlp->rv_size)
|
|
score = -1;
|
|
else
|
|
score = regscore(rvlp->rv_off,
|
|
rvlp->rv_size,
|
|
rvlp->rv_type,
|
|
rvlp->rv_score,
|
|
typ); /* machine dependent */
|
|
ra = regassigned[typ];
|
|
if (score>ra[nregvar[typ]-1].ra_score) {
|
|
save = ra[nregvar[typ]-1].ra_rv;
|
|
for (i=nregvar[typ]-1;i>0 && ra[i-1].ra_score<score;i--)
|
|
ra[i] = ra[i-1];
|
|
ra[i].ra_rv = rvlp;
|
|
ra[i].ra_score = score;
|
|
if((rvlp=save)==0)
|
|
return;
|
|
}
|
|
}
|
|
if (nregvar[reg_any]==0)
|
|
return;
|
|
if (machregs[rvnumbers[reg_any][0]].r_size!=rvlp->rv_size)
|
|
score = -1;
|
|
else
|
|
score = regscore(rvlp->rv_off,
|
|
rvlp->rv_size,
|
|
rvlp->rv_type,
|
|
rvlp->rv_score,
|
|
reg_any); /* machine dependent */
|
|
ra = regassigned[reg_any];
|
|
if (score>ra[nregvar[reg_any]-1].ra_score) {
|
|
for (i=nregvar[reg_any]-1;i>0 && ra[i-1].ra_score<score;i--)
|
|
ra[i] = ra[i-1];
|
|
ra[i].ra_rv = rvlp;
|
|
ra[i].ra_score = score;
|
|
}
|
|
}
|
|
|
|
fixregvars(saveall) {
|
|
register struct regvar *rv;
|
|
register rvtyp,i;
|
|
|
|
swtxt();
|
|
i_regsave(); /* machine dependent initialization */
|
|
for (rvtyp=reg_any;rvtyp<=reg_float;rvtyp++) {
|
|
for(i=0;i<nregvar[rvtyp];i++)
|
|
if (saveall) {
|
|
struct reginfo *rp;
|
|
rp= &machregs[rvnumbers[rvtyp][i]];
|
|
regsave(codestrings[rp->r_repr],-EM_WSIZE,rp->r_size);
|
|
} else if(regassigned[rvtyp][i].ra_score>0) {
|
|
rv=regassigned[rvtyp][i].ra_rv;
|
|
rv->rv_reg=rvnumbers[rvtyp][i];
|
|
regsave(codestrings[machregs[rv->rv_reg].r_repr],
|
|
rv->rv_off,rv->rv_size);
|
|
}
|
|
}
|
|
f_regsave();
|
|
#ifndef EM_BSIZE
|
|
for(rv=rvlist;rv!=0;rv=rv->rv_next)
|
|
if (rv->rv_off >= 0) rv->rv_off += EM_BSIZE;
|
|
#endif
|
|
}
|
|
|
|
isregvar(off) long off; {
|
|
register struct regvar *rvlp;
|
|
|
|
for(rvlp=rvlist;rvlp!=0;rvlp=rvlp->rv_next)
|
|
if(rvlp->rv_off == off)
|
|
return(rvlp->rv_reg);
|
|
return(-1);
|
|
}
|
|
|
|
unlinkregs() {
|
|
register struct regvar *rvlp,*t;
|
|
register struct regassigned *ra;
|
|
int rvtyp,i;
|
|
|
|
for(rvlp=rvlist;rvlp!=0;rvlp=t) {
|
|
t=rvlp->rv_next;
|
|
myfree(rvlp);
|
|
}
|
|
rvlist=0;
|
|
for (rvtyp=reg_any;rvtyp<=reg_float;rvtyp++) {
|
|
for(i=0;i<nregvar[rvtyp];i++) {
|
|
ra= ®assigned[rvtyp][i];
|
|
ra->ra_rv = 0;
|
|
ra->ra_score = 0;
|
|
}
|
|
}
|
|
}
|
|
|
|
#endif REGVARS
|
|
|
|
/* nothing after this */
|