objcommon.c

   1 /*  Copyright (C) 2008  Jeffrey Brian Arnold <jbarnold@mit.edu>
   2  *
   3  *  This program is free software; you can redistribute it and/or modify
   4  *  it under the terms of the GNU General Public License, version 2.
   5  *
   6  *  This program is distributed in the hope that it will be useful,
   7  *  but WITHOUT ANY WARRANTY; without even the implied warranty of
   8  *  MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the
   9  *  GNU General Public License for more details.
  10  *
  11  *  You should have received a copy of the GNU General Public License
  12  *  along with this program; if not, write to the Free Software
  13  *  Foundation, Inc., 51 Franklin Street - Fifth Floor, Boston, MA
  14  *  02110-1301, USA.
  15  */
  16
  17 #include "objcommon.h"
  18
  19 void vec_do_reserve(void **data, size_t *mem_size, size_t new_size)
  20 {
  21         if (new_size > *mem_size || new_size * 2 < *mem_size) {
  22                 if (new_size < *mem_size * 2)
  23                         new_size = *mem_size * 2;
  24                 *data = realloc(*data, new_size);
  25                 assert(new_size == 0 || *data != NULL);
  26                 *mem_size = new_size;
  27         }
  28 }
  29
  30 void get_syms(bfd *abfd, struct asymbolp_vec *syms)
  31 {
  32         long storage_needed = bfd_get_symtab_upper_bound(abfd);
  33         if (storage_needed == 0)
  34                 return;
  35         assert(storage_needed >= 0);
  36
  37         vec_init(syms);
  38         vec_reserve(syms, storage_needed);
  39         vec_resize(syms, bfd_canonicalize_symtab(abfd, syms->data));
  40         assert(syms->size >= 0);
  41 }
  42
  43 struct supersect *fetch_supersect(bfd *abfd, asection *sect,
  44                                   struct asymbolp_vec *syms)
  45 {
  46         if (sect->userdata != NULL)
  47                 return sect->userdata;
  48
  49         struct supersect *new = malloc(sizeof(*new));
  50         sect->userdata = new;
  51         new->parent = abfd;
  52         new->name = malloc(strlen(sect->name) + 1);
  53         strcpy(new->name, sect->name);
  54         new->flags = bfd_get_section_flags(abfd, sect);
  55
  56         vec_init(&new->contents);
  57         vec_resize(&new->contents, bfd_get_section_size(sect));
  58         assert(bfd_get_section_contents
  59                (abfd, sect, new->contents.data, 0, new->contents.size));
  60         new->alignment = bfd_get_section_alignment(abfd, sect);
  61
  62         vec_init(&new->relocs);
  63         vec_reserve(&new->relocs, bfd_get_reloc_upper_bound(abfd, sect));
  64         vec_resize(&new->relocs,
  65                    bfd_canonicalize_reloc(abfd, sect, new->relocs.data,
  66                                           syms->data));
  67         assert(new->relocs.size >= 0);
  68
  69         return new;
  70 }
  71
  72 struct supersect *new_supersects = NULL;
  73
  74 struct supersect *new_supersect(char *name)
  75 {
  76         struct supersect *ss;
  77         for (ss = new_supersects; ss != NULL; ss = ss->next) {
  78                 if (strcmp(name, ss->name) == 0)
  79                         return ss;
  80         }
  81
  82         struct supersect *new = malloc(sizeof(*new));
  83         new->parent = NULL;
  84         new->name = name;
  85         new->next = new_supersects;
  86         new_supersects = new;
  87         new->flags = SEC_ALLOC | SEC_HAS_CONTENTS | SEC_RELOC;
  88
  89         vec_init(&new->contents);
  90         new->alignment = 0;
  91         vec_init(&new->relocs);
  92
  93         return new;
  94 }
  95
  96 void *sect_do_grow(struct supersect *ss, size_t n, size_t size, int alignment)
  97 {
  98         if (ss->alignment < ffs(alignment) - 1)
  99                 ss->alignment = ffs(alignment) - 1;
 100         int pad = ss->contents.size - align(ss->contents.size, alignment);
 101         memset(vec_grow(&ss->contents, pad), 0, pad);
 102         return vec_grow(&ss->contents, n * size);
 103 }
 104
 105 int label_offset(const char *sym_name)
 106 {
 107         int i;
 108         for (i = 0;
 109              sym_name[i] != 0 && sym_name[i + 1] != 0 && sym_name[i + 2] != 0
 110              && sym_name[i + 3] != 0; i++) {
 111                 if (sym_name[i] == '_' && sym_name[i + 1] == '_'
 112                     && sym_name[i + 2] == '_' && sym_name[i + 3] == '_')
 113                         return i + 4;
 114         }
 115         return -1;
 116 }
 117
 118 const char *only_label(const char *sym_name)
 119 {
 120         int offset = label_offset(sym_name);
 121         if (offset == -1)
 122                 return NULL;
 123         return &sym_name[offset];
 124 }
 125
 126 const char *dup_wolabel(const char *sym_name)
 127 {
 128         int offset, entire_strlen, label_strlen, new_strlen;
 129         char *newstr;
 130
 131         offset = label_offset(sym_name);
 132         if (offset == -1)
 133                 label_strlen = 0;
 134         else
 135                 label_strlen = strlen(&sym_name[offset]) + strlen("____");
 136
 137         entire_strlen = strlen(sym_name);
 138         new_strlen = entire_strlen - label_strlen;
 139         newstr = malloc(new_strlen + 1);
 140         memcpy(newstr, sym_name, new_strlen);
 141         newstr[new_strlen] = 0;
 142         return newstr;
 143 }