2 * GINGE - GINGE Is Not Gp2x Emulator
5 * This work is licensed under the MAME license, see COPYING file for details.
11 #include <sys/types.h>
17 #include "realfuncs.h"
21 #define CHECK_(val, fail_operator, expect, err_msg) \
22 if (val fail_operator expect) { \
23 fprintf(stderr, err_msg ", exiting (%d)\n", (int)(long)val); \
27 #define CHECK_EQ(val, expect, err_msg) \
28 CHECK_(val, !=, expect, err_msg)
30 #define CHECK_NE(val, expect, err_msg) \
31 CHECK_(val, ==, expect, err_msg)
33 #define HDR_CHECK_EQ(field, expect, err_msg) \
34 CHECK_(hdr.field, !=, expect, err_msg)
36 #define HDR_CHECK_NE(field, expect, err_msg) \
37 CHECK_(hdr.field, ==, expect, err_msg)
39 #define FAIL_PERROR(msg) { \
49 static int is_range_used(maps_range *maps, int map_cnt, unsigned long start, unsigned long end)
52 for (i = 0; i < map_cnt; i++) {
53 if (maps[i].end <= start)
55 if (end <= maps[i].start)
64 extern char **environ;
66 int main(int argc, char *argv[])
68 void *lowest_segment = (void *)-1;
74 int i, ret, envc, sfp;
80 fprintf(stderr, "usage: %s <program> [args]\n", argv[0]);
84 fi = fopen("/proc/self/maps", "r");
85 CHECK_NE(fi, NULL, "fopen maps");
87 for (i = 0; i < ARRAY_SIZE(maps); i++) {
88 ret = fscanf(fi, "%lx-%lx %*s %*s %*s %*s %*s\n", &maps[i].start, &maps[i].end);
91 CHECK_EQ(ret, 2, "maps parse error");
95 CHECK_NE(map_cnt, 0, "no maps");
96 CHECK_NE(map_cnt, ARRAY_SIZE(maps), "too many maps");
98 fi = fopen(argv[1], "rb");
100 FAIL_PERROR("fopen");
102 if (fread(&hdr, 1, sizeof(hdr), fi) != sizeof(hdr))
103 FAIL_PERROR("too small or");
105 if (memcmp(hdr.e_ident, ELFMAG "\x01\x01", SELFMAG + 2) != 0) {
106 fprintf(stderr, "not 32bit LE ELF?\n");
110 HDR_CHECK_EQ(e_type, ET_EXEC, "not executable");
111 HDR_CHECK_EQ(e_machine, EM_ARM, "not ARM");
112 HDR_CHECK_EQ(e_phentsize, sizeof(Elf32_Phdr), "bad PH entry size");
113 HDR_CHECK_NE(e_phnum, 0, "no PH entries");
115 phdr = malloc(hdr.e_phnum * hdr.e_phentsize);
116 CHECK_NE(phdr, NULL, "OOM");
118 if (fread(phdr, hdr.e_phentsize, hdr.e_phnum, fi) != hdr.e_phnum)
119 FAIL_PERROR("too small or");
121 for (i = 0; i < hdr.e_phnum; i++) {
122 Elf32_Addr end_addr = phdr[i].p_vaddr + phdr[i].p_memsz;
126 if (phdr[i].p_type == PT_NOTE)
128 if (phdr[i].p_type != PT_LOAD) {
129 fprintf(stderr, "skipping section %d\n", phdr[i].p_type);
133 ret = is_range_used(maps, map_cnt, phdr[i].p_vaddr, end_addr);
135 fprintf(stderr, "segment %d (%08x-%08x) hits %08lx-%08lx in maps\n",
136 i, phdr[i].p_vaddr, end_addr, maps[ret - 1].start, maps[ret - 1].end);
140 log("load %d %08x-%08x from %08x\n", phdr[i].p_type,
141 phdr[i].p_vaddr, end_addr, phdr[i].p_offset);
143 align = phdr[i].p_vaddr & 0xfff;
144 map_ptr = (void *)(phdr[i].p_vaddr - align);
145 ptr = mmap(map_ptr, phdr[i].p_memsz + align, PROT_READ|PROT_WRITE|PROT_EXEC,
146 MAP_FIXED|MAP_PRIVATE|MAP_ANONYMOUS, -1, 0);
147 if (ptr == MAP_FAILED || ptr != map_ptr)
150 if (phdr[i].p_filesz > 0) {
151 if (fseek(fi, phdr[i].p_offset, SEEK_SET) != 0)
152 FAIL_PERROR("fseek");
153 if (fread((char *)ptr + align, 1, phdr[i].p_filesz, fi) != phdr[i].p_filesz)
154 FAIL_PERROR("too small or");
156 if (phdr[i].p_flags & PF_X)
157 do_patches((char *)ptr + align, phdr[i].p_filesz);
160 if (map_ptr < lowest_segment)
161 lowest_segment = map_ptr;
164 // build self bin path
165 snprintf(buf, sizeof(buf), "/proc/self/fd/%d", fileno(fi));
166 if (lstat(buf, &st) != 0)
167 FAIL_PERROR("lstat bin_path");
168 bin_path = malloc(st.st_size + 1);
169 CHECK_NE(bin_path, NULL, "bin_path");
170 ret = readlink(buf, bin_path, st.st_size);
172 FAIL_PERROR("readlink");
177 emu_init(lowest_segment);
179 // generate stack frame: argc, argv[], NULL, env[], NULL
180 for (envc = 0; environ[envc] != NULL; envc++)
183 stack_frame = calloc(argc + envc + 3, sizeof(stack_frame[0]));
184 if (stack_frame == NULL) {
185 fprintf(stderr, "stack_frame OOM\n");
189 // update the environment
190 setenv("_", bin_path, 1);
193 stack_frame[sfp++] = argc - 1;
194 for (i = 1; i < argc; i++)
195 stack_frame[sfp++] = (long)argv[i];
196 stack_frame[sfp++] = 0;
197 for (i = 0; i < envc; i++)
198 stack_frame[sfp++] = (long)environ[i];
199 stack_frame[sfp++] = 0;
201 log("entering %08x, %d stack entries\n", hdr.e_entry, sfp);
202 do_entry(hdr.e_entry, stack_frame, sfp, NULL);
204 fprintf(stderr, "do_entry failed!\n");
208 // vim:shiftwidth=2:expandtab