ack/mach/proto/as/comm6.c

370 lines
6.7 KiB
C
Raw Normal View History

1994-06-24 14:02:31 +00:00
/* $Id$ */
1987-03-09 19:15:41 +00:00
/*
* (c) copyright 1987 by the Vrije Universiteit, Amsterdam, The Netherlands.
* See the copyright notice in the ACK home directory, in the file "Copyright".
*/
1985-04-12 16:56:43 +00:00
/* @(#)comm6.c 1.7 */
/*
* implement pseudo instructions
*/
#include "comm0.h"
#include "comm1.h"
#include "y.tab.h"
#include <object.h>
1985-04-12 16:56:43 +00:00
static void new_common(item_t *);
void
newequate(item_t *ip, int typ)
1985-04-12 16:56:43 +00:00
{
typ &= ~S_EXT;
if (typ & S_COM)
typ = S_UND;
else if ((typ & S_VAR) && (typ & S_TYP) != S_ABS)
typ = S_UND;
#ifdef THREE_PASS
else if (pass == PASS_1 && typ == S_UND)
typ = S_VAR;
else if (pass == PASS_2 && (ip->i_type & S_TYP) == S_UND)
ip->i_type |= typ;
#endif /* THREE_PASS */
1985-04-12 16:56:43 +00:00
if (typ == S_UND)
serror("illegal equate");
if (pass == PASS_3)
assert((ip->i_type & S_TYP) == (typ & S_TYP));
newident(ip, typ);
}
void
newident(item_t *ip, int typ)
1985-04-12 16:56:43 +00:00
{
int flag;
1985-04-12 16:56:43 +00:00
#ifdef GENLAB
static char genlab[] = GENLAB;
#endif /* GENLAB */
1985-04-12 16:56:43 +00:00
if (pass == PASS_1) {
/* printf("declare %s: %o\n", ip->i_name, typ); */
if (ip->i_type & ~S_EXT)
serror("multiple declared");
else
--unresolved;
ip->i_type |= typ;
}
if (PASS_SYMB == 0)
return;
#ifdef THREE_PASS
if (ip->i_type & S_EXT)
flag = SYM_EXT;
else
flag = SYM_LOC;
#else
flag = SYM_EXT|SYM_LOC; /* S_EXT not stable in PASS_1 */
#endif /* THREE_PASS */
1985-04-12 16:56:43 +00:00
#ifdef GENLAB
if (!(flag & SYM_EXT) &&
strncmp(ip->i_name, genlab, sizeof(genlab)-1) == 0)
1985-04-12 16:56:43 +00:00
flag = SYM_LAB;
#endif /* GENLAB */
1985-04-12 16:56:43 +00:00
if (sflag & flag)
newsymb(
ip->i_name,
ip->i_type & (S_EXT|S_TYP),
0,
1985-04-12 16:56:43 +00:00
load(ip)
);
}
void
newlabel(item_t *ip)
1985-04-12 16:56:43 +00:00
{
1988-06-28 13:43:54 +00:00
#if DEBUG != 0
1985-04-12 16:56:43 +00:00
#ifdef THREE_PASS
ADDR_T oldval = ip->i_valu;
1988-06-28 13:43:54 +00:00
#endif
1985-04-12 16:56:43 +00:00
#endif
if (DOTSCT == NULL)
nosect();
ip->i_type &= ~S_TYP;
ip->i_type |= DOTTYP;
if (store(ip, (valu_t) DOTVAL) == 0)
return;
#ifdef THREE_PASS
assert(pass != PASS_2 || oldval - (ADDR_T) ip->i_valu == DOTGAIN);
1985-04-12 16:56:43 +00:00
#endif
}
void
newsect(item_t *ip)
1985-04-12 16:56:43 +00:00
{
int typ;
sect_t *sp = NULL;
1985-04-12 16:56:43 +00:00
typ = ip->i_type & S_TYP;
if (typ == S_UND) {
/*
* new section
*/
assert(pass == PASS_1);
--unresolved;
typ = outhead.oh_nsect + S_MIN;
outhead.oh_nsect++;
if (outhead.oh_nsect > SECTMAX || typ > S_MAX)
fatal("too many sections");
sp = &sect[typ - S_MIN];
sp->s_item = ip;
sp->s_lign = ALIGNSECT;
1986-12-01 15:41:29 +00:00
#ifndef ASLD
1985-04-12 16:56:43 +00:00
ip->i_type = typ;
1986-12-01 15:41:29 +00:00
#else
1985-04-12 16:56:43 +00:00
ip->i_type = typ | S_EXT;
1986-12-01 15:41:29 +00:00
#endif
1985-04-12 16:56:43 +00:00
ip->i_valu = 0;
} else if (typ >= S_MIN) {
sp = &sect[typ - S_MIN];
if (sp->s_item != ip)
sp = NULL;
}
if (sp == NULL)
serror("multiple declared");
else
switchsect(typ);
}
1988-06-28 13:43:54 +00:00
/*ARGSUSED*/
void
newbase(valu_t base)
1985-04-12 16:56:43 +00:00
{
#ifdef ASLD
sect_t *sp;
1985-04-12 16:56:43 +00:00
if ((sp = DOTSCT) == NULL)
nosect();
if (sp->s_flag & BASED)
serror("already based");
sp->s_base = base;
sp->s_flag |= BASED;
DOTVAL += base;
#else
warning(".base ignored");
#endif
}
/*
1986-12-01 15:41:29 +00:00
* NOTE: A rather different solution is used for ASLD and not ASLD:
* ASLD, or local commons:
1985-04-12 16:56:43 +00:00
* - maximum length of .comm is recorded in i_valu during PASS_1
* - address of .comm is recorded in i_valu in later passes:
* assigned at end of PASS_1, corrected for s_gain at end of PASS_2
1986-12-01 15:41:29 +00:00
* not ASLD:
* - maximum length of .comm is recorded in i_valu during PASS_1
* - i_valu is used for relocation info during PASS_3
1985-04-12 16:56:43 +00:00
*/
void
newcomm(item_t *ip, valu_t val)
1985-04-12 16:56:43 +00:00
{
if (pass == PASS_1) {
if (DOTSCT == NULL)
nosect();
if (val == 0)
serror("bad size");
/* printf("declare %s: %o\n", ip->i_name, DOTTYP); */
if ((ip->i_type & ~S_EXT) == S_UND) {
--unresolved;
1986-12-01 15:41:29 +00:00
ip->i_type = S_COM|DOTTYP|(ip->i_type&S_EXT);
1985-04-12 16:56:43 +00:00
ip->i_valu = val;
1986-12-01 15:41:29 +00:00
new_common(ip);
} else if (ip->i_type == (S_COM|DOTTYP|(ip->i_type&S_EXT))) {
1985-04-12 16:56:43 +00:00
if (ip->i_valu < val)
ip->i_valu = val;
} else
serror("multiple declared");
}
}
void
switchsect(int newtyp)
1985-04-12 16:56:43 +00:00
{
sect_t *sp;
1985-04-12 16:56:43 +00:00
if (sp = DOTSCT)
sp->s_size = DOTVAL - sp->s_base;
if (newtyp == S_UND) {
DOTSCT = NULL;
DOTTYP = newtyp;
return;
}
assert(newtyp >= S_MIN);
sp = &sect[newtyp - S_MIN];
DOTVAL = sp->s_size + sp->s_base;
DOTSCT = sp;
DOTTYP = newtyp;
}
void
align(valu_t bytes)
1985-04-12 16:56:43 +00:00
{
valu_t gap;
sect_t *sp;
1985-04-12 16:56:43 +00:00
if ((sp = DOTSCT) == NULL)
nosect();
if (bytes == 0)
bytes = ALIGNWORD;
if (sp->s_lign % bytes)
if (bytes % sp->s_lign)
serror("illegal alignment");
else
sp->s_lign = bytes;
if (pass == PASS_1)
/*
* be pessimistic: biggest gap possible
*/
gap = bytes - 1;
else {
/*
* calculate gap correctly;
* will be the same in PASS_2 and PASS_3
*/
if ((gap = DOTVAL % bytes) != 0)
gap = bytes - gap;
#ifdef THREE_PASS
if (pass == PASS_2)
/*
* keep track of gain with respect to PASS_1
*/
DOTGAIN += (bytes - 1) - gap;
#endif
}
1986-12-01 15:41:29 +00:00
DOTVAL += gap;
sp->s_zero += gap;
1985-04-12 16:56:43 +00:00
}
#ifdef RELOCATION
void
newrelo(int s, int n)
1985-04-12 16:56:43 +00:00
{
int iscomm;
struct outrelo outrelo;
1985-04-12 16:56:43 +00:00
if (rflag == 0)
return;
if (PASS_RELO == 0)
return;
s &= ~S_DOT;
assert((s & ~(S_COM|S_VAR|S_TYP)) == 0);
1987-01-28 15:15:28 +00:00
#ifdef ASLD
1985-04-12 16:56:43 +00:00
#ifndef THREE_PASS
if (s == S_UND)
serror("bad relocation");
1987-01-28 15:15:28 +00:00
#endif
1985-04-12 16:56:43 +00:00
#endif
/*
* always relocation info if S_VAR to solve problems with:
* move b,d0
* b=a
* a: .data2 0
* but no relocation info if S_VAR is set, but type is S_ABS.
1985-04-12 16:56:43 +00:00
*/
iscomm = s & S_COM;
s &= ~S_COM;
if ((n & RELPC) == 0 && ((s & ~S_VAR) == S_ABS))
1985-04-12 16:56:43 +00:00
return;
if ((n & RELPC) != 0 && s == DOTTYP
#ifndef ASLD
&& ! iscomm
#endif
)
1985-04-12 16:56:43 +00:00
return;
if (pass != PASS_3) {
outhead.oh_nrelo++;
return;
}
s &= ~S_VAR;
outrelo.or_type = n;
outrelo.or_sect = DOTTYP;
1985-04-12 16:56:43 +00:00
#ifndef ASLD
if (s == S_UND || iscomm) {
assert(relonami != 0);
outrelo.or_nami = relonami-1;
1985-04-12 16:56:43 +00:00
relonami = 0;
} else
#endif
if (s < S_MIN) {
assert(s == S_ABS);
/*
* use first non existing entry (argh)
*/
outrelo.or_nami = outhead.oh_nname;
1985-04-12 16:56:43 +00:00
} else {
/*
* section symbols are at the end
*/
outrelo.or_nami = outhead.oh_nname
1985-04-12 16:56:43 +00:00
- outhead.oh_nsect
+ (s - S_MIN)
;
}
outrelo.or_addr = (long)DOTVAL;
wr_relo(&outrelo, 1);
1985-04-12 16:56:43 +00:00
}
#endif
1990-07-30 09:43:45 +00:00
long
new_string(const char *s)
1990-07-30 09:43:45 +00:00
{
long r = 0;
if (s) {
long len = strlen(s) + 1;
r = outhead.oh_nchar;
if (pass == PASS_3) wr_string(s, len);
outhead.oh_nchar += len;
}
return r;
}
void
newsymb(const char *name, int type, int desc, valu_t valu)
1985-04-12 16:56:43 +00:00
{
struct outname outname;
1985-04-12 16:56:43 +00:00
if (name && *name == 0)
name = 0;
assert(PASS_SYMB);
if (pass != PASS_3) {
1990-07-30 09:43:45 +00:00
new_string(name);
1985-04-12 16:56:43 +00:00
outhead.oh_nname++;
return;
}
1986-12-01 15:41:29 +00:00
nname++;
1990-07-30 09:43:45 +00:00
outname.on_foff = new_string(name);
outname.on_type = type;
outname.on_desc = desc;
1990-11-16 15:58:36 +00:00
outname.on_valu = valu;
wr_name(&outname, 1);
1986-12-01 15:41:29 +00:00
}
static void
new_common(item_t *ip)
1986-12-01 15:41:29 +00:00
{
struct common_t *cp;
static int nleft = 0;
1986-12-01 15:41:29 +00:00
static struct common_t *next;
if (--nleft < 0) {
1987-08-06 13:04:20 +00:00
next = (struct common_t *) malloc(MEMINCR);
if (next == 0) {
1986-12-01 15:41:29 +00:00
fatal("out of memory");
}
nleft += (MEMINCR / sizeof (struct common_t));
}
cp = next++;
cp->c_next = commons;
cp->c_it = ip;
commons = cp;
1985-04-12 16:56:43 +00:00
}