darling-gdb/bfd/srec.c

/* Copyright (C) 1990, 1991 Free Software Foundation, Inc.

This file is part of BFD, the Binary File Diddler.

BFD 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 1, or (at your option)
any later version.

BFD 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 BFD; see the file COPYING.  If not, write to
the Free Software Foundation, 675 Mass Ave, Cambridge, MA 02139, USA.  */

/*

 bfd backend for srecord objects.

 Srecords cannot hold anything but addresses and data, so that's all
 that we impliment.
 
 The only interesting thing is that srecords may come out of order and
 there is no header, so an initial scan is required to discover the
 minimum and maximum addresses used to create the vma and size of the
 only section we create. We arbitarily call this section ".text".

 When bfd_get_section_contents is called the file is read again, and
 this time the data is placed into a malloced area.

 Any number of sections may be created for output, we just output them
 in the order provided to bfd_set_section_contents.


 Steve Chamberlain steve@cygnus.com

 */


/* $Id$
 * $Log$
 * Revision 1.5  1991/04/23 22:44:14  steve
 * *** empty log message ***
 *
 * Revision 1.4  1991/04/23  16:01:02  steve
 * *** empty log message ***
 *
 * Revision 1.3  1991/04/08  23:22:31  steve
 * *** empty log message ***
 *
 * Revision 1.2  1991/04/03  22:10:51  steve
 * Fixed typo
 *
 * Revision 1.1.1.1  1991/03/21  21:11:22  gumby
 * Back from Intel with Steve
 *
 * Revision 1.1  1991/03/21  21:11:20  gumby
 * Initial revision
 *
 * Revision 1.1  1991/03/13  00:22:29  chrisb
 * Initial revision
 *
 * Revision 1.3  1991/03/10  19:11:40  rich
 *  Modified Files:
 *  	bfd.c coff-code.h libbfd.c libbfd.h srec.c sunos.c
 *
 * Working bugs out of coff support.
 *
 * Revision 1.2  1991/03/07  02:26:18  sac
 * Tidied up xfer table
 *
 * Revision 1.1  1991/03/05  16:28:12  sac
 * Initial revision
 *
 */
#include "sysdep.h"
#include "bfd.h"
#include "libbfd.h"


static char digs[] = "0123456789ABCDEF";

/* Macros for converting between hex and binary */

#define NIBBLE(x) ((x >= '0' && x <= '9') ? (x - '0') : (x - 'A' + 10))
#define HEX(buffer) ((NIBBLE((buffer)->high) <<4) + NIBBLE((buffer)->low))
#define TOHEX(d,x) \
  ((d)->low = digs[(x) & 0xf], (d)->high = digs[((x)>>4)&0xf], x)

typedef struct {
  char high;
  char low;
} byte_as_two_char_type;

/* The maximum number of bytes on a line is FF */
#define MAXCHUNK 0xff 
/* The number of bytes we fit onto a line on output */
#define CHUNK 16 

/* The shape of an srecord .. */
typedef struct 
{
  char S;
  char type;
  byte_as_two_char_type size;
  union {
    struct {
      byte_as_two_char_type address[4];
      byte_as_two_char_type data[MAXCHUNK];
      /* If there isn't MAXCHUNK bytes of data then the checksum will 
	 appear earlier */
      byte_as_two_char_type checksum;
      char nl;
    } type_3;
    struct {
      byte_as_two_char_type address[4];
      byte_as_two_char_type data[MAXCHUNK];
      byte_as_two_char_type checksum;
      char nl;
    } type_6;

    struct {
      byte_as_two_char_type address[3];
      byte_as_two_char_type data[MAXCHUNK];
      byte_as_two_char_type checksum;
      char nl;
    } type_2;

    struct {
      byte_as_two_char_type address[2];
      byte_as_two_char_type data[MAXCHUNK];
      byte_as_two_char_type checksum;
      char nl;
    } type_1;
    byte_as_two_char_type data[MAXCHUNK];
  } u;
} srec_type;


/* 
   called once per input srecord, used to work out vma and size of data.
 */

static void
size_srec(abfd, section, address, raw, length)
bfd *abfd;
asection *section;
bfd_vma address;
byte_as_two_char_type *raw;
unsigned int length;
{
  if (address < section->vma)
    section->vma = address;

  if (address + length  > section->vma + section->size)
    section->size = (address+length) -  section->vma;
}

/*
 called once per input srecord, copies data from input into malloced area
 */

static void
fillup(abfd, section, address, raw, length)
bfd *abfd;
asection *section;
bfd_vma address;
byte_as_two_char_type *raw;
unsigned int length;
{
  unsigned int i;
  bfd_byte *dst = (bfd_byte *)(section->used_by_bfd) +  address - section->vma;
  for (i = 0; i < length; i++) {
    *dst = HEX(raw);
    dst++;
    raw++;
  }
}

/*
 pass over an srecord file calling one of the above functions on each
 record
 */
static void
pass_over(abfd, func, section)
bfd *abfd;
void (*func)();
asection *section;
{
  unsigned int bytes_on_line;
  boolean eof = false;
  bfd_vma address;
  /* To the front of the file */
  bfd_seek(abfd, (file_ptr)0, SEEK_SET);
  while (eof == false)
    {
      srec_type buffer;

      /* Find first 'S' */
      eof =  bfd_read(&buffer.S, 1, 1, abfd) != 1;
      while (buffer.S != 'S' && !eof) {
	eof =  bfd_read(&buffer.S, 1, 1, abfd) != 1;
      }
      if (eof) break;

      bfd_read(&buffer.type, 1, 3, abfd);

      bytes_on_line = HEX(&buffer.size);
    
      bfd_read(buffer.u.data, 1 , bytes_on_line * 2, abfd);

      switch (buffer.type) {
      case '6':
	/* Prologue - ignore */
	break;
      case '3':
	address = (HEX(buffer.u.type_3.address+0) << 24)
	  + (HEX(buffer.u.type_3.address+1) << 16)
	    + (HEX(buffer.u.type_3.address+2) << 8) 
	      + (HEX(buffer.u.type_3.address+3));
        func(abfd,section, address, buffer.u.type_2.data, bytes_on_line -1);

	break;

      case '2':
	address = (HEX(buffer.u.type_2.address+0) << 16)+
	  (HEX(buffer.u.type_2.address+1) << 8) +
	(HEX(buffer.u.type_2.address+2));
        func(abfd,section, address, buffer.u.type_2.data, bytes_on_line -1);

	break;
      case '1':
	address =
	  (HEX(buffer.u.type_1.address+0) << 8) 
	    + (HEX(buffer.u.type_1.address+1));
        func(abfd, section, address, buffer.u.type_1.data, bytes_on_line -1);
	break;

      }
    }
}


bfd_target *
srec_object_p (abfd)
bfd *abfd;
{
  char b;
  asection *section;
  bfd_seek(abfd, (file_ptr)0, SEEK_SET);
  bfd_read(&b, 1,1,abfd);
  if (b != 'S') return (bfd_target*)NULL;

  /* 
     We create one section called data for all the contents, 
     and allocate enough room for the entire file
     */


  section =  bfd_make_section(abfd, ".text");
  section->size = 0;
  section->vma = 0xffffffff;
  pass_over(abfd, size_srec, section);

  return abfd->xvec;
}








static boolean
srec_get_section_contents (abfd, section, location, offset, count)
bfd *abfd;
sec_ptr section;
void  *location;
file_ptr offset;
unsigned      int count;
{
  if (section->used_by_bfd == (bfd_byte *)NULL) {
    section->used_by_bfd = (bfd_byte *)malloc(section->size);
    pass_over(abfd, fillup, section);
  }
  (void) memcpy(location, (bfd_byte *)(section->used_by_bfd) + offset, count);
  return true;
}
      


boolean
srec_set_arch_mach (abfd, arch, machine)
bfd *abfd;
enum bfd_architecture arch;
unsigned long machine;
{
  abfd->obj_arch = arch;
  abfd->obj_machine = machine;
  return true;
}



boolean
srec_set_section_contents (abfd, section, location, offset, bytes_to_do)
bfd *abfd;
sec_ptr section;
unsigned char *location;
file_ptr offset;
int bytes_to_do;
{
  bfd_vma address;
  int bytes_written;

  int type;
  unsigned int i;
  srec_type buffer;
  bytes_written = 0;
  if (section->size <= 0xffff) 
    type = 1;
  else if (section->size <= 0xffffff) 
    type = 2;
  else
    type = 3;

  buffer.S = 'S';
  buffer.type = '0' + type;

  while (bytes_written < bytes_to_do) {
    unsigned int size;
    unsigned int check_sum;
    byte_as_two_char_type *data; 
 unsigned   int bytes_this_chunk = bytes_to_do - bytes_written;

    if (bytes_this_chunk > CHUNK) {
      bytes_this_chunk = CHUNK;
    }

    address = section->vma + offset + bytes_written;

    switch (type) {
    case 3:
      check_sum = TOHEX(buffer.u.type_3.address, address >> 24);
      check_sum += TOHEX(buffer.u.type_3.address+1, address >> 16);
      check_sum += TOHEX(buffer.u.type_3.address+2, address >> 8);
      check_sum += TOHEX(buffer.u.type_3.address+3, address >> 0);
      size = bytes_this_chunk + 5;
      data = buffer.u.type_3.data;

    case 2:
      check_sum = TOHEX(buffer.u.type_3.address, address >> 16);
      check_sum += TOHEX(buffer.u.type_3.address+1, address >> 8);
      check_sum += TOHEX(buffer.u.type_3.address+2, address >> 0);
      size = bytes_this_chunk + 4;
      data = buffer.u.type_2.data;
      break;

    case 1:
      check_sum = TOHEX(buffer.u.type_3.address+0, address >> 8);
      check_sum += TOHEX(buffer.u.type_3.address+1, address >> 0);
      size = bytes_this_chunk + 3;
      data = buffer.u.type_1.data;
    }

    for (i = 0; i < bytes_this_chunk; i++) {
      check_sum += TOHEX(data, (location[i]));
      data++;
    }

    check_sum += TOHEX(&(buffer.size), size );
    (void) TOHEX(data, ~check_sum);
    data++;

    * ( (char *)(data)) = '\n';
    bfd_write(&buffer, 1, (char *)data - (char *)&buffer + 1 , abfd);

    bytes_written += bytes_this_chunk;
    location += bytes_this_chunk;
  }


  return true;
}


boolean
srec_close_and_cleanup (abfd)
bfd *abfd;
{
  asection *s;
  if (bfd_read_p (abfd) == false) {
    switch (abfd->format) {
    case bfd_archive:
      if (!_bfd_write_archive_contents (abfd)) {
	return false;
      }
      break;
    case bfd_object:
      bfd_write("S9030000FC\n", 1,11,abfd);
      break;
    default:
      bfd_error = invalid_operation;
      return false;
    }
  }
  for (s = abfd->sections; s != (asection *)NULL;s = s->next) {
    if (s->used_by_bfd != (void *)NULL) {
      free(s->used_by_bfd);
    }
  }
  return true;
}

static int 
DEFUN(srec_sizeof_headers,(abfd),
      bfd *abfd)
{
return 0;
}

/*SUPPRESS 460 */
#define srec_core_file_failing_command bfd_false
#define srec_core_file_failing_signal bfd_false
#define srec_core_file_matches_executable_p bfd_false
#define srec_slurp_armap bfd_false
#define srec_slurp_extended_name_table bfd_false
#define srec_truncate_arname bfd_false
#define srec_write_armap bfd_false
#define srec_new_section_hook bfd_false
#define srec_get_symtab_upper_bound bfd_false
#define srec_get_symtab bfd_false
#define srec_get_reloc_upper_bound bfd_false
#define srec_canonicalize_reloc bfd_false
#define srec_make_empty_symbol bfd_false
#define srec_print_symbol bfd_false
#define srec_get_lineno bfd_false
#define srec_openr_next_archived_file bfd_false
#define srec_find_nearest_line bfd_false
#define srec_generic_stat_arch_elt bfd_false

bfd_target srec_vec =
{
  "srec",			/* name */
  bfd_target_srec_flavour_enum,
  true,				/* target byte order */
  true,				/* target headers byte order */
  (HAS_RELOC | EXEC_P |		/* object flags */
   HAS_LINENO | HAS_DEBUG |
   HAS_SYMS | HAS_LOCALS | DYNAMIC | WP_TEXT | D_PAGED),
  (SEC_CODE|SEC_DATA|SEC_ROM|SEC_HAS_CONTENTS
   |SEC_ALLOC | SEC_LOAD | SEC_RELOC), /* section flags */
  ' ',				/* ar_pad_char */
  16,				/* ar_max_namelen */
  _do_getblong, _do_putblong, _do_getbshort, _do_putbshort, /* data */
  _do_getblong, _do_putblong, _do_getbshort, _do_putbshort, /* hdrs */

  {_bfd_dummy_target,
     srec_object_p,		/* bfd_check_format */
     (struct bfd_target *(*)()) bfd_nullvoidptr,
     (struct bfd_target *(*)())     bfd_nullvoidptr,
   },
  {
    bfd_false,
    bfd_true,			/* mkobject */
    _bfd_generic_mkarchive,
    bfd_false,
  },
JUMP_TABLE(srec)
};