summaryrefslogtreecommitdiff
path: root/laden/loader.c
blob: 2634bff9f71e41dcdfb4c9f98455bf544703ebc1 (plain)
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
163
164
165
166
167
168
169
170
171
172
173
174
175
176
177
178
179
180
181
182
183
184
185
186
187
188
189
190
191
192
193
194
195
196
197
198
199
200
201
202
203
204
205
206
207
208
209
210
211
212
213
214
215
216
217
218
219
220
221
222
223
224
225
226
227
228
229
230
231
232
233
234
235
236
237
238
239
240
241
242
243
244
/* loader.c - Load ELF files.
   Copyright (C) 2003 Free Software Foundation, Inc.
   Written by Marcus Brinkmann.

   This file is part of the GNU Hurd.

   The GNU Hurd 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, or (at
   your option) any later version.

   The GNU Hurd 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., 59 Temple Place - Suite 330, Boston, MA  02111, USA. */

#if HAVE_CONFIG_H
#include <config.h>
#endif

#include <string.h>

#include "loader.h"
#include "output.h"
#include "shutdown.h"

#include "elf.h"



/* Verify that the memory region START to END (exclusive) is valid.  */
static void
mem_check (const char *name, unsigned long start, unsigned long end)
{
  l4_memory_desc_t memdesc;
  int nr;
  int fits = 0;
  int conflicts = 0;

  if (!loader_get_num_memory_desc ())
    return;

  /* FIXME: This implementation does not account for conventional
     memory overriding non-conventional memory in the descriptor
     list.  */
  for (nr = 0; nr < loader_get_num_memory_desc (); nr++)
    {
      memdesc = loader_get_memory_desc (nr);

      if (memdesc->type == L4_MEMDESC_CONVENTIONAL)
	{
	  /* Check if the region fits into conventional memory.  */
	  if (start >= (memdesc->low << 10) && start < (memdesc->high << 10)
	      && end > (memdesc->low << 10) && end <= (memdesc->high << 10))
	    fits = 1;
	}
      else
	{
	  /* Check if the region overlaps with non-conventional
	     memory.  */
	  if ((start >= (memdesc->low << 10) && start < (memdesc->high << 10))
	      || (end > (memdesc->low << 10) && end <= (memdesc->high << 10))
	      || (start < (memdesc->low << 10) && end > (memdesc->high << 10)))
	    {
	      conflicts = 1;
	      break;
	    }
	}
    }
  if (conflicts)
    panic ("%s (0x%x - 0x%x) conflicts with memory of "
	   "type %i/%i (0x%x - 0x%x)", name, start, end,
	   memdesc->type, memdesc->subtype,
	   memdesc->low << 10, memdesc->high << 10);
  if (!fits)
    panic ("%s (0x%x - 0x%x) does not fit into memory",
	   name, start, end);
}


/* We use a table of memory regions to check for overlap.  */

#define MAX_REGIONS 16

static struct
{
  const char *name;
  l4_word_t start;
  l4_word_t end;
} used_regions[MAX_REGIONS];

static int nr_regions;


/* Check that the region with the name NAME from START to END does not
   overlap with an existing region.  */
static void
check_region (const char *name, l4_word_t start, l4_word_t end)
{
  int i;

  mem_check (name, start, end);
  
  for (i = 0; i < nr_regions; i++)
    {
      if ((start >= used_regions[i].start && start < used_regions[i].end)
	  || (end >= used_regions[i].start && end <= used_regions[i].end)
	  || (start < used_regions[i].start && end > used_regions[i].start))
	panic ("%s (0x%x - 0x%x) conflicts with %s (0x%x - 0x%x)",
	       name, start, end, used_regions[i].name, used_regions[i].start,
	       used_regions[i].end);
    }
}


/* Add the region with the name NAME from START to END to the table of
   regions to check against.  Before doing that, check for overlaps
   with existing regions.  */
void
loader_add_region (const char *name, l4_word_t start, l4_word_t end)
{
  debug ("Protected Region: %s (0x%x - 0x%x)\n", name, start, end);

  if (nr_regions == MAX_REGIONS)
    panic ("Too many memory regions, region %s doesn't fit", name);

  check_region (name, start, end);

  used_regions[nr_regions].name = name;
  used_regions[nr_regions].start = start;
  used_regions[nr_regions].end = end;
  nr_regions++;
}


/* Remove the region with the name NAME from the table.  */
void
loader_remove_region (const char *name)
{
  int i;

  for (i = 0; i < nr_regions; i++)
    if (!strcmp (used_regions[i].name, name))
      break;

  if (i == nr_regions)
    panic ("Assertion failure: Could not find region %s for removal", name);

  while (i < nr_regions - 1)
    {
      used_regions[i] = used_regions[i + 1];
      i++;
    }
  nr_regions--;
}


/* Load the ELF image from START to END (exclusive) into memory under
   the name NAME (also used as the name for the region of the
   resulting ELF program).  Return the lowest and highest address used
   by the program in NEW_START_P and NEW_END_P, and the entry point in
   ENTRY.  */
void
loader_elf_load (const char *name, l4_word_t start, l4_word_t end,
		 l4_word_t *new_start_p, l4_word_t *new_end_p,
		 l4_word_t *entry)
{
  l4_word_t new_start = -1;
  l4_word_t new_end = 0;
  int i;

  Elf32_Ehdr *elf = (Elf32_Ehdr *) start;

  if (elf->e_ident[EI_MAG0] != ELFMAG0
      || elf->e_ident[EI_MAG1] != ELFMAG1
      || elf->e_ident[EI_MAG2] != ELFMAG2
      || elf->e_ident[EI_MAG3] != ELFMAG3)
    panic ("%s is not an ELF file", name);

  if (elf->e_type != ET_EXEC)
    panic ("%s is not an executable file", name);

  if (!elf->e_phoff)
    panic ("%s has no valid program header offset", name);

  /* FIXME: Some architectures support both word sizes.  */
  if (!((elf->e_ident[EI_CLASS] == ELFCLASS32
	 && L4_WORDSIZE == 32)
	|| (elf->e_ident[EI_CLASS] == ELFCLASS64
	    && L4_WORDSIZE == 64)))
    panic ("%s has invalid word size", name);
  if (!((elf->e_ident[EI_DATA] == ELFDATA2LSB
	 && L4_BYTE_ORDER == L4_LITTLE_ENDIAN)
	|| (elf->e_ident[EI_DATA] == ELFDATA2MSB
	    && L4_BYTE_ORDER == L4_BIG_ENDIAN)))
    panic ("%s has invalid byte order", name);

#if i386
# define elf_machine EM_386
#elif PPC
# define elf_machine EM_PPC
#else
# error Not ported to this architecture!
#endif

  if (elf->e_machine != elf_machine)
    panic ("%s is not for this architecture", name);

  for (i = 0; i < elf->e_phnum; i++)
    {
      Elf32_Phdr *ph = (Elf32_Phdr *) (start + elf->e_phoff
				       + i * elf->e_phentsize);
      if (ph->p_type == PT_LOAD)
	{
	  check_region (name, ph->p_paddr,
			ph->p_paddr + ph->p_offset + ph->p_memsz);
	  memcpy ((char *) ph->p_paddr, (char *) start + ph->p_offset,
		  ph->p_filesz);
	  /* Initialize the rest.  */
	  if (ph->p_memsz > ph->p_filesz)
	    memset ((char *) ph->p_paddr + ph->p_filesz, 0,
		    ph->p_memsz - ph->p_filesz);
	  if (ph->p_paddr < new_start)
	    new_start = ph->p_paddr;
	  if (ph->p_memsz + ph->p_paddr > new_end)
	    new_end = ph->p_memsz + ph->p_paddr;
	}
    }

  /* FIXME: Add this as a bootloader specific memory type to L4's
     memdesc list instead.  */
  loader_add_region (name, new_start, new_end);

  if (new_start_p)
    *new_start_p = new_start;
  if (new_end_p)
    *new_end_p = new_end;
  if (entry)
    *entry = elf->e_entry;
}