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
|
/*
* Copyright (c) 2023-2024 Ian Marco Moffett and the Osmora Team.
* All rights reserved.
*
* Redistribution and use in source and binary forms, with or without
* modification, are permitted provided that the following conditions are met:
*
* 1. Redistributions of source code must retain the above copyright notice,
* this list of conditions and the following disclaimer.
* 2. Redistributions in binary form must reproduce the above copyright
* notice, this list of conditions and the following disclaimer in the
* documentation and/or other materials provided with the distribution.
* 3. Neither the name of Hyra nor the names of its
* contributors may be used to endorse or promote products derived from
* this software without specific prior written permission.
*
* THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS "AS IS"
* AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
* IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
* ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT OWNER OR CONTRIBUTORS BE
* LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR
* CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF
* SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS
* INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN
* CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE)
* ARISING IN ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE
* POSSIBILITY OF SUCH DAMAGE.
*/
#include <sys/loader.h>
#include <sys/cdefs.h>
#include <sys/elf.h>
#include <sys/types.h>
#include <sys/syslog.h>
#include <sys/errno.h>
#include <vm/vm.h>
#include <vm/map.h>
#include <vm/physseg.h>
#include <vm/dynalloc.h>
#include <string.h>
#include <assert.h>
__MODULE_NAME("kern_loader");
__KERNEL_META("$Hyra$: kern_loader.c, Ian Marco Moffett, "
"Kernel ELF loader");
#if !defined(DEBUG)
#define DBG(...) __nothing
#else
#define DBG(...) KDEBUG(__VA_ARGS__)
#endif
#define PHDR(hdrptr, IDX) \
(void *)((uintptr_t)hdr + (hdrptr)->e_phoff + (hdrptr->e_phentsize*IDX))
int loader_load(struct vas vas, const void *dataptr, struct auxval *auxv,
size_t load_base, char **ld_path)
{
const Elf64_Ehdr *hdr = dataptr;
Elf64_Phdr *phdr;
vm_prot_t prot = PROT_USER;
uintptr_t physmem;
uintptr_t max_addr, map_addr;
size_t misalign, page_count;
int status;
const size_t GRANULE = vm_get_page_size();
void *tmp_ptr;
if (auxv == NULL) {
DBG("Auxval argument NULL\n");
return -1;
}
if (memcmp(hdr->e_ident, ELFMAG, 4) != 0) {
/* Bad ELF header */
DBG("ELF header bad! (Magic incorrect)\n");
return -1;
}
/* Parse program headers */
for (size_t i = 0; i < hdr->e_phnum; ++i) {
phdr = PHDR(hdr, i);
switch (phdr->p_type) {
case PT_LOAD:
if (__TEST(phdr->p_flags, PF_W))
prot |= PROT_WRITE;
if (__TEST(phdr->p_flags, PF_X)) {
prot |= PROT_EXEC;
}
misalign = phdr->p_vaddr & (GRANULE - 1);
page_count = __DIV_ROUNDUP(phdr->p_memsz + misalign, GRANULE);
max_addr = phdr->p_vaddr + (GRANULE * page_count);
/*
* We are assuming this is a user program that we are loading.
* All user programs should be on the lower half of the address
* space. We will check that before we begin doing anything here.
*
* We are also going to check if the virtual address the program
* header refers to overflows into the higher half. If anything
* goes into the higher half, we won't simply drop the phdr,
* we'll instead assume caller error and return -EINVAL.
*/
if (phdr->p_vaddr >= VM_HIGHER_HALF) {
return -EINVAL;
} else if (max_addr >= VM_HIGHER_HALF) {
/* Overflows into higher half */
return -EINVAL;
}
physmem = vm_alloc_pageframe(page_count);
/* Do we not have enough page frames? */
if (physmem == 0) {
DBG("Failed to allocate physical memory\n");
vm_free_pageframe(physmem, page_count);
return -ENOMEM;
}
map_addr = phdr->p_vaddr + load_base;
status = vm_map_create(vas, map_addr, physmem, prot, page_count*GRANULE);
if (status != 0) {
DBG("Failed to map 0x%p - 0x%p\n",
phdr->p_vaddr + load_base,
(phdr->p_vaddr + load_base) + (page_count * GRANULE));
return status;
}
/* Now we want to copy the data */
tmp_ptr = (void *)((uintptr_t)hdr + phdr->p_offset);
memcpy(PHYS_TO_VIRT(physmem), tmp_ptr, phdr->p_filesz);
break;
case PT_INTERP:
if (ld_path == NULL) {
break;
}
*ld_path = dynalloc(phdr->p_filesz);
if (ld_path == NULL) {
DBG("Failed to allocate memory for PT_INTERP path\n");
return -ENOMEM;
}
memcpy(*ld_path, (char *)hdr + phdr->p_offset, phdr->p_filesz);
break;
case PT_PHDR:
auxv->at_phdr = phdr->p_vaddr + load_base;
break;
}
}
auxv->at_entry = hdr->e_entry + load_base;
auxv->at_phent = hdr->e_phentsize;
auxv->at_phnum = hdr->e_phnum;
return 0;
}
|
