113 lines
2.4 KiB
C
113 lines
2.4 KiB
C
#ifndef NORCSID
|
|
static char rcsid[] = "$Header$";
|
|
#endif
|
|
|
|
#include "assert.h"
|
|
#include "param.h"
|
|
#include "types.h"
|
|
#include "line.h"
|
|
#include "tes.h"
|
|
#include "proinf.h"
|
|
#include "alloc.h"
|
|
#include <em_spec.h>
|
|
#include <em_pseu.h>
|
|
#include <em_mes.h>
|
|
#include "ext.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
|
|
*/
|
|
|
|
regvar(ap) register arg_p ap; {
|
|
register reg_p rp;
|
|
register i;
|
|
|
|
rp = newreg();
|
|
i=0;
|
|
while (ap!=(arg_p)0 && ap->a_typ==ARGOFF && i<4) {
|
|
rp->r_par[i++]=ap->a_a.a_offset;
|
|
ap=ap->a_next;
|
|
}
|
|
/*
|
|
* Omit incomplete messages
|
|
*/
|
|
switch(i) {
|
|
default:assert(FALSE);
|
|
case 0:
|
|
case 1:
|
|
case 2: oldreg(rp); return;
|
|
case 3: rp->r_par[3]= (offset) 0; break;
|
|
case 4: break;
|
|
}
|
|
rp->r_next = curpro.freg;
|
|
curpro.freg = rp;
|
|
}
|
|
|
|
inreg(off) offset off; {
|
|
register reg_p rp;
|
|
|
|
for (rp=curpro.freg; rp != (reg_p) 0; rp=rp->r_next)
|
|
if( rp->r_par[0] == off)
|
|
return(TRUE);
|
|
return(FALSE);
|
|
}
|
|
|
|
outregs() {
|
|
register reg_p rp,tp;
|
|
register i;
|
|
|
|
for(rp=curpro.freg; rp != (reg_p) 0; rp = tp) {
|
|
tp = rp->r_next;
|
|
outinst(ps_mes);
|
|
outoff((offset)ms_reg);
|
|
for(i=0;i<4;i++)
|
|
outoff(rp->r_par[i]);
|
|
outinst(sp_cend);
|
|
oldreg(rp);
|
|
}
|
|
/* List of register messages is followed by an empty ms_reg
|
|
* unless an ms_gto was in this procedure, then the ms_gto
|
|
* will be output. Kludgy.
|
|
*/
|
|
outinst(ps_mes);
|
|
outoff((offset)(curpro.gtoproc? ms_gto : ms_reg));
|
|
outinst(sp_cend);
|
|
curpro.freg = (reg_p) 0;
|
|
}
|
|
|
|
/* outtes() handles the output of the top elt. messages */
|
|
outtes() {
|
|
register num_p *npp, np;
|
|
|
|
for (npp=curpro.numhash;npp< &curpro.numhash[NNUMHASH]; npp++) {
|
|
for (np = *npp; np != (num_p) 0; np=np->n_next) {
|
|
if (! (np->n_flags & NUMSET) || np->n_size == 0 ||
|
|
(np->n_flags & NUMCOND)) continue;
|
|
outinst(ps_mes);
|
|
outoff((offset)ms_tes);
|
|
outoff((offset)np->n_number);
|
|
outoff((offset)np->n_size);
|
|
outoff((offset)((np->n_flags & NUMFALLTHROUGH) ? 1 : 0));
|
|
outinst(sp_cend);
|
|
}
|
|
}
|
|
}
|
|
|
|
incregusage(off) offset off; {
|
|
register reg_p rp;
|
|
|
|
#ifndef GLOBAL_OPT
|
|
/* If we're optimizing the output of the global optimizer
|
|
* we must not change the count fields of the register messages.
|
|
*/
|
|
for(rp=curpro.freg; rp != (reg_p) 0; rp=rp->r_next)
|
|
if (rp->r_par[0]==off) {
|
|
rp->r_par[3]++;
|
|
return;
|
|
}
|
|
#endif
|
|
}
|