Logo Search packages:      
Sourcecode: xa version File versions  Download package

xar.c

/* xa65 - 65xx/65816 cross-assembler and utility suite
 *
 * Copyright (C) 1989-1997 André Fachat (a.fachat@physik.tu-chemnitz.de)
 *
 * This program is free software; you can redistribute it and/or modify
 * it under the terms of the GNU General Public License as published by
 * the Free Software Foundation; either version 2 of the License, or
 * (at your option) any later version.
 *
 * This program is distributed in the hope that it will be useful,
 * but WITHOUT ANY WARRANTY; without even the implied warranty of
 * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the
 * GNU General Public License for more details.
 *
 * You should have received a copy of the GNU General Public License
 * along with this program; if not, write to the Free Software
 * Foundation, Inc., 675 Mass Ave, Cambridge, MA 02139, USA.
 */

#include <stdio.h>
#include <stdlib.h>

#include "xa.h"
#include "xad.h"
#include "xal.h"
#include "xah.h"
#include "xao.h"
#include "xar.h"
#include "xau.h"

File *afile = NULL;

int rmode = RMODE_RELOC;

int r_set(int pc, int afl, int l)
{
      if (segment == SEG_TEXT)
            return rt_set(pc, afl, l, 0);
      if (segment == SEG_DATA)
            return rd_set(pc, afl, l, 0);

      return 0;
}

int u_set(int pc, int afl, int label, int l)
{
      if ((afl & A_FMASK) == (SEG_UNDEF << 8))
            label = u_label(label); /* set label as undefined */
      if (segment == SEG_TEXT)
            return rt_set(pc, afl, l, label);
      if (segment == SEG_DATA)
            return rd_set(pc, afl, l, label);

      return 0;
}

void r_mode(int m)
{
      static int old_segment = SEG_TEXT;

      if (rmode != m) {
            if (m == RMODE_RELOC) {
                  segment = old_segment;
            } else {    /* absolute mode */
                  old_segment = segment;
                  segment = SEG_ABS;
            }
      }
      rmode = m;
}

int rt_set(int pc, int afl, int l, int lab)
{
      int p, pp;

      if (!rmode)
            return 0;

      if (l == 2 && ((afl & A_MASK) != A_ADR))
            errout(W_BYTRELOC);

      if (l == 1 && ((afl & A_MASK) == A_ADR)) {
            if ((afl & A_FMASK) != (SEG_ZERO << 8))
                  errout(W_ADRRELOC);
            afl = (afl & (~A_MASK)) | A_LOW;
      }

      if (afile->rt.nlist >= afile->rt.mlist) {
            afile->rt.mlist += 500;
            afile->rt.rlist =
                realloc(afile->rt.rlist,
                      afile->rt.mlist * sizeof (relocateInfo));
      }
      if (!afile->rt.rlist) {
            fprintf(stderr, "Oops: no memory for relocation table!\n");
            exit(1);
      }

      afile->rt.rlist[afile->rt.nlist].adr = pc;
      afile->rt.rlist[afile->rt.nlist].afl = afl;
      afile->rt.rlist[afile->rt.nlist].lab = lab;
      afile->rt.rlist[afile->rt.nlist].next = -1;

      /* sorting this into the list is not optimized, to be honest... */
      if (afile->rt.first < 0) {
            afile->rt.first = afile->rt.nlist;
      } else {
            p = afile->rt.first;
            pp = -1;
            while (afile->rt.rlist[p].adr < pc
                   && afile->rt.rlist[p].next >= 0) {
                  pp = p;
                  p = afile->rt.rlist[p].next;
            }
            if (afile->rt.rlist[p].next < 0
                && afile->rt.rlist[p].adr < pc) {
                  afile->rt.rlist[p].next = afile->rt.nlist;
            } else if (pp == -1) {
                  afile->rt.rlist[afile->rt.nlist].next =
                      afile->rt.first;
                  afile->rt.first = afile->rt.nlist;
            } else {
                  afile->rt.rlist[afile->rt.nlist].next = p;
                  afile->rt.rlist[pp].next = afile->rt.nlist;
            }
      }
      afile->rt.nlist++;

      return 0;
}

int rt_write(FILE *fp, int pc)
{
      int p = afile->rt.first;
      int pc2, afl;

      while (p >= 0) {
            pc2 = afile->rt.rlist[p].adr;
            afl = afile->rt.rlist[p].afl;
            /* hack to switch undef and abs flag from internal to file format */
            if (((afl & A_FMASK) >> 8) < SEG_TEXT)
                  afl ^= 0x100;
            if ((pc2 - pc) < 0) {
                  fprintf(stderr, "Oops, negative offset!\n");
            } else {
                  while ((pc2 - pc) > 254) {
                        fputc(255, fp);
                        pc += 254;
                  }
                  fputc(pc2 - pc, fp);
                  pc = pc2;
                  fputc((afl >> 8) & 255, fp);
                  if ((afile->rt.rlist[p].afl & A_FMASK) ==
                      (SEG_UNDEF << 8)) {
                        fputc(afile->rt.rlist[p].lab & 255, fp);
                        fputc((afile->rt.rlist[p].lab >> 8) & 255,
                              fp);
                  }
                  if ((afl & A_MASK) == A_HIGH)
                        fputc(afl & 255, fp);
            }
            p = afile->rt.rlist[p].next;
      }
      fputc(0, fp);

      free(afile->rt.rlist);
      afile->rt.rlist = NULL;
      afile->rt.mlist = afile->rt.nlist = 0;
      afile->rt.first = -1;

      return 0;
}

void seg_start(int fmode, int t_base, int d_base, int b_base, int z_base,
             int slen, int relmode)
{
      afile->fmode = fmode;
      afile->slen = slen;
      afile->relmode = relmode;

      pc[SEG_TEXT] = afile->base[SEG_TEXT] = t_base;
      pc[SEG_DATA] = afile->base[SEG_DATA] = d_base;
      pc[SEG_BSS] = afile->base[SEG_BSS] = b_base;
      pc[SEG_ZERO] = afile->base[SEG_ZERO] = z_base;

      afile->old_abspc = pc[SEG_ABS];
      pc[SEG_ABS] = pc[SEG_TEXT];
}

File *alloc_file(void)
{
      File *afile;
      int i;

      afile = malloc(sizeof (File));
      if (!afile) {
            fprintf(stderr, "Oops: not enough memory!\n");
            exit(1);
      }

      afile->mn.tmp = malloc(TMPMEM);
      if (!afile->mn.tmp) {
            fprintf(stderr, "Oops: not enough memory!\n");
            exit(1);
      }
      afile->mn.tmpz = 0;
      afile->mn.tmpe = 0;

      afile->ud.ulist = NULL;
      afile->ud.un = afile->ud.um = 0;
      afile->rt.rlist = NULL;
      afile->rt.first = -1;
      afile->rt.mlist = afile->rt.nlist = 0;
      afile->rd.rlist = NULL;
      afile->rd.first = -1;
      afile->rd.mlist = afile->rd.nlist = 0;
      afile->fo.olist = NULL;
      afile->fo.mlist = afile->fo.nlist = 0;

      for (i = 0; i < 256; i++)
            afile->la.hashindex[i] = 0;
      afile->la.lt = NULL;
      afile->la.lti = 0;
      afile->la.ltm = 0;

      afile->len[SEG_TEXT] = afile->len[SEG_DATA] =
          afile->len[SEG_BSS] = afile->len[SEG_ZERO] = 0;

      return afile;
}

void seg_pass2(void)
{

      pc[SEG_TEXT] = afile->base[SEG_TEXT];
      pc[SEG_DATA] = afile->base[SEG_DATA];
      pc[SEG_BSS] = afile->base[SEG_BSS];
      pc[SEG_ZERO] = afile->base[SEG_ZERO];

      afile->old_abspc = pc[SEG_ABS];
      pc[SEG_ABS] = pc[SEG_TEXT];
}

void seg_end(FILE *fpout)
{
      segment = SEG_ABS;

      u_write(fpout);
      rt_write(fpout, afile->base[SEG_TEXT] - 1);
      rd_write(fpout, afile->base[SEG_DATA] - 1);
      l_write(fpout);
}

/* write header for relocatable output format */
int h_write(FILE *fp, int mode, int tlen, int dlen, int blen, int zlen,
          int stack)
{

      afile->len[SEG_TEXT] = tlen;
      afile->len[SEG_DATA] = dlen;
      afile->len[SEG_BSS] = blen;
      afile->len[SEG_ZERO] = zlen;

      fputc(1, fp);           /* version byte */
      fputc(0, fp);           /* hi address 0 -> no C64 */
      fputc('o', fp);
      fputc('6', fp);
      fputc('5', fp);
      fputc(0, fp);           /* format version */
      fputw(mode, fp);  /* file mode */
      fputw(afile->base[SEG_TEXT], fp);   /* text base */
      fputw(tlen, fp);  /* text length */
      fputw(afile->base[SEG_DATA], fp);   /* data base */
      fputw(dlen, fp);  /* data length */
      fputw(afile->base[SEG_BSS], fp);    /* bss base */
      fputw(blen, fp);  /* bss length */
      fputw(afile->base[SEG_ZERO], fp);   /* zerop base */
      fputw(zlen, fp);  /* zerop length */
      fputw(stack, fp); /* needed stack size */

      o_write(fp);

      return 0;
}

Generated by  Doxygen 1.6.0   Back to index