Fixing binary loader bugs relating to page sizes
[tpg/acess2.git] / Kernel / bin / elf.c
1 /*\r
2  * Acess v0.1\r
3  * ELF Executable Loader Code\r
4  */\r
5 #define DEBUG   1\r
6 #include <acess.h>\r
7 #include <binary.h>\r
8 #include "elf.h"\r
9 \r
10 #define DEBUG_WARN      1\r
11 \r
12 \r
13 // === PROTOTYPES ===\r
14 tBinary *Elf_Load(int fp);\r
15  int    Elf_Relocate(void *Base);\r
16  int    Elf_GetSymbol(void *Base, char *Name, Uint *ret);\r
17  int    Elf_Int_DoRelocate(Uint r_info, Uint32 *ptr, Uint32 addend, Elf32_Sym *symtab, Uint base);\r
18 Uint    Elf_Int_HashString(char *str);\r
19 \r
20 // === GLOBALS ===\r
21 tBinaryType     gELF_Info = {\r
22         NULL,\r
23         0x464C457F, 0xFFFFFFFF, // '\x7FELF'\r
24         "ELF",\r
25         Elf_Load, Elf_Relocate, Elf_GetSymbol\r
26         };\r
27 \r
28 // === CODE ===\r
29 tBinary *Elf_Load(int fp)\r
30 {\r
31         tBinary *ret;\r
32         Elf32_Ehdr      hdr;\r
33         Elf32_Phdr      *phtab;\r
34          int    i, j, k;\r
35          int    iPageCount;\r
36          int    count;\r
37         \r
38         ENTER("xfp", fp);\r
39         \r
40         // Read ELF Header\r
41         VFS_Read(fp, sizeof(hdr), &hdr);\r
42         \r
43         // Check the file type\r
44         if(hdr.ident[0] != 0x7F || hdr.ident[1] != 'E' || hdr.ident[2] != 'L' || hdr.ident[3] != 'F') {\r
45                 Warning("Non-ELF File was passed to the ELF loader\n");\r
46                 LEAVE('n');\r
47                 return NULL;\r
48         }\r
49         \r
50         // Check for a program header\r
51         if(hdr.phoff == 0) {\r
52                 #if DEBUG_WARN\r
53                 Warning("ELF File does not contain a program header\n");\r
54                 #endif\r
55                 LEAVE('n');\r
56                 return NULL;\r
57         }\r
58         \r
59         // Read Program Header Table\r
60         phtab = malloc( sizeof(Elf32_Phdr) * hdr.phentcount );\r
61         if( !phtab ) {\r
62                 LEAVE('n');\r
63                 return NULL;\r
64         }\r
65         LOG("hdr.phoff = 0x%08x", hdr.phoff);\r
66         VFS_Seek(fp, hdr.phoff, SEEK_SET);\r
67         VFS_Read(fp, sizeof(Elf32_Phdr)*hdr.phentcount, phtab);\r
68         \r
69         // Count Pages\r
70         iPageCount = 0;\r
71         LOG("hdr.phentcount = %i", hdr.phentcount);\r
72         for( i = 0; i < hdr.phentcount; i++ )\r
73         {\r
74                 // Ignore Non-LOAD types\r
75                 if(phtab[i].Type != PT_LOAD)\r
76                         continue;\r
77                 iPageCount += ((phtab[i].VAddr&0xFFF) + phtab[i].MemSize + 0xFFF) >> 12;\r
78                 LOG("phtab[%i] = {VAddr:0x%x, MemSize:0x%x}", i, phtab[i].VAddr, phtab[i].MemSize);\r
79         }\r
80         \r
81         LOG("iPageCount = %i", iPageCount);\r
82         \r
83         // Allocate Information Structure\r
84         ret = malloc( sizeof(tBinary) + sizeof(tBinaryPage)*iPageCount );\r
85         // Fill Info Struct\r
86         ret->Entry = hdr.entrypoint;\r
87         ret->Base = -1;         // Set Base to maximum value\r
88         ret->NumPages = iPageCount;\r
89         ret->Interpreter = NULL;\r
90         \r
91         // Load Pages\r
92         j = 0;\r
93         for( i = 0; i < hdr.phentcount; i++ )\r
94         {\r
95                  int    lastSize;\r
96                 //LOG("phtab[%i].Type = 0x%x", i, phtab[i].Type);\r
97                 LOG("phtab[%i] = {", i);\r
98                 LOG(" .Type = 0x%08x", phtab[i].Type);\r
99                 LOG(" .Offset = 0x%08x", phtab[i].Offset);\r
100                 LOG(" .VAddr = 0x%08x", phtab[i].VAddr);\r
101                 LOG(" .PAddr = 0x%08x", phtab[i].PAddr);\r
102                 LOG(" .FileSize = 0x%08x", phtab[i].FileSize);\r
103                 LOG(" .MemSize = 0x%08x", phtab[i].MemSize);\r
104                 LOG(" .Flags = 0x%08x", phtab[i].Flags);\r
105                 LOG(" .Align = 0x%08x", phtab[i].Align);\r
106                 LOG(" }");\r
107                 // Get Interpreter Name\r
108                 if( phtab[i].Type == PT_INTERP )\r
109                 {\r
110                         char *tmp;\r
111                         if(ret->Interpreter)    continue;\r
112                         tmp = malloc(phtab[i].FileSize);\r
113                         VFS_Seek(fp, phtab[i].Offset, 1);\r
114                         VFS_Read(fp, phtab[i].FileSize, tmp);\r
115                         ret->Interpreter = Binary_RegInterp(tmp);\r
116                         LOG("Interpreter '%s'", tmp);\r
117                         free(tmp);\r
118                         continue;\r
119                 }\r
120                 // Ignore non-LOAD types\r
121                 if(phtab[i].Type != PT_LOAD)    continue;\r
122                 \r
123                 // Find Base\r
124                 if(phtab[i].VAddr < ret->Base)  ret->Base = phtab[i].VAddr;\r
125                 \r
126                 LOG("phtab[%i] = {VAddr:0x%x,Offset:0x%x,FileSize:0x%x}",\r
127                         i, phtab[i].VAddr, phtab[i].Offset, phtab[i].FileSize);\r
128                 \r
129                 //if( (phtab[i].FileSize & 0xFFF) < 0x1000 - (phtab[i].VAddr & 0xFFF) )\r
130                 //      lastSize = phtab[i].FileSize;\r
131                 //else\r
132                         lastSize = (phtab[i].FileSize & 0xFFF) + (phtab[i].VAddr & 0xFFF);\r
133                 //lastSize &= 0xFFF;\r
134                 \r
135                 //LOG("lastSize = 0x%x", lastSize);\r
136                 \r
137                 lastSize = phtab[i].FileSize;\r
138                 \r
139                 // Get Pages\r
140                 count = ( (phtab[i].VAddr&0xFFF) + phtab[i].FileSize + 0xFFF) >> 12;\r
141                 for( k = 0; k < count; k ++ )\r
142                 {\r
143                         ret->Pages[j+k].Virtual = phtab[i].VAddr + (k<<12);\r
144                         ret->Pages[j+k].Physical = phtab[i].Offset + (k<<12);   // Store the offset in the physical address\r
145                         if(k != 0) {\r
146                                 ret->Pages[j+k].Physical -= ret->Pages[j+k].Virtual&0xFFF;\r
147                                 ret->Pages[j+k].Virtual &= ~0xFFF;\r
148                         }\r
149                         if(k == count-1)\r
150                                 ret->Pages[j+k].Size = lastSize;        // Byte count in page\r
151                         else if(k == 0)\r
152                                 ret->Pages[j+k].Size = 4096 - (phtab[i].VAddr&0xFFF);\r
153                         else\r
154                                 ret->Pages[j+k].Size = 4096;\r
155                         LOG("ret->Pages[%i].Size = 0x%x", j+k, ret->Pages[j+k].Size);\r
156                         ret->Pages[j+k].Flags = 0;\r
157                         lastSize -= ret->Pages[j+k].Size;\r
158                 }\r
159                 count = (phtab[i].MemSize + 0xFFF) >> 12;\r
160                 for(;k<count;k++)\r
161                 {\r
162                         ret->Pages[j+k].Virtual = phtab[i].VAddr + (k<<12);\r
163                         ret->Pages[j+k].Physical = -1;  // -1 = Fill with zeros\r
164                         if(k != 0)      ret->Pages[j+k].Virtual &= ~0xFFF;\r
165                         if(k == count-1 && (phtab[i].MemSize & 0xFFF))\r
166                                 ret->Pages[j+k].Size = phtab[i].MemSize & 0xFFF;        // Byte count in page\r
167                         else\r
168                                 ret->Pages[j+k].Size = 4096;\r
169                         ret->Pages[j+k].Flags = 0;\r
170                         LOG("%i - 0x%x => 0x%x - 0x%x", j+k,\r
171                                 ret->Pages[j+k].Physical, ret->Pages[j+k].Virtual, ret->Pages[j+k].Size);\r
172                 }\r
173                 j += count;\r
174         }\r
175         \r
176         #if 0\r
177         LOG("Cleaning up overlaps");\r
178         // Clear up Overlaps\r
179         {\r
180                 struct {\r
181                         Uint    V;\r
182                         Uint    P;\r
183                         Uint    S;\r
184                         Uint    F;\r
185                 } *tmpRgns;\r
186                 count = j;\r
187                 tmpRgns = malloc(sizeof(*tmpRgns)*count);\r
188                 // Copy\r
189                 for(i=0;i<count;i++) {\r
190                         tmpRgns[i].V = ret->Pages[i].Virtual;\r
191                         tmpRgns[i].P = ret->Pages[i].Physical;\r
192                         tmpRgns[i].S = ret->Pages[i].Size;\r
193                         tmpRgns[i].F = ret->Pages[i].Flags;\r
194                 }\r
195                 // Compact\r
196                 for(i=1,j=0; i < count; i++)\r
197                 {                       \r
198                         if(     tmpRgns[j].F == tmpRgns[i].F\r
199                         &&      tmpRgns[j].V + tmpRgns[j].S == tmpRgns[i].V\r
200                         &&      ((tmpRgns[j].P == -1 && tmpRgns[i].P == -1)\r
201                         || (tmpRgns[j].P + tmpRgns[j].S == tmpRgns[i].P)) )\r
202                         {\r
203                                 tmpRgns[j].S += tmpRgns[i].S;\r
204                         } else {\r
205                                 j ++;\r
206                                 tmpRgns[j].V = tmpRgns[i].V;\r
207                                 tmpRgns[j].P = tmpRgns[i].P;\r
208                                 tmpRgns[j].F = tmpRgns[i].F;\r
209                                 tmpRgns[j].S = tmpRgns[i].S;\r
210                         }\r
211                 }\r
212                 j ++;\r
213                 // Count\r
214                 count = j;      j = 0;\r
215                 for(i=0;i<count;i++) {\r
216                         //LogF(" Elf_Load: %i - 0x%x => 0x%x - 0x%x\n", i, tmpRgns[i].P, tmpRgns[i].V, tmpRgns[i].S);\r
217                         tmpRgns[i].S += tmpRgns[i].V & 0xFFF;\r
218                         if(tmpRgns[i].P != -1)  tmpRgns[i].P -= tmpRgns[i].V & 0xFFF;\r
219                         tmpRgns[i].V &= ~0xFFF;\r
220                         j += (tmpRgns[i].S + 0xFFF) >> 12;\r
221                         //LogF(" Elf_Load: %i - 0x%x => 0x%x - 0x%x\n", i, tmpRgns[i].P, tmpRgns[i].V, tmpRgns[i].S);\r
222                 }\r
223                 // Reallocate\r
224                 ret = realloc( ret, sizeof(tBinary) + 3*sizeof(Uint)*j );\r
225                 if(!ret) {\r
226                         Warning("BIN", "ElfLoad: Unable to reallocate return structure");\r
227                         return NULL;\r
228                 }\r
229                 ret->NumPages = j;\r
230                 // Split\r
231                 k = 0;\r
232                 for(i=0;i<count;i++) {\r
233                         for( j = 0; j < (tmpRgns[i].S + 0xFFF) >> 12; j++,k++ ) {\r
234                                 ret->Pages[k].Flags = tmpRgns[i].F;\r
235                                 ret->Pages[k].Virtual = tmpRgns[i].V + (j<<12);\r
236                                 if(tmpRgns[i].P != -1) {\r
237                                         ret->Pages[k].Physical = tmpRgns[i].P + (j<<12);\r
238                                 } else\r
239                                         ret->Pages[k].Physical = -1;\r
240                                 ret->Pages[k].Size = tmpRgns[i].S - (j << 12);\r
241                                 // Clamp to page size\r
242                                 if(ret->Pages[k].Size > 0x1000) ret->Pages[k].Size = 0x1000;\r
243                         }\r
244                 }\r
245                 // Free Temp\r
246                 free(tmpRgns);\r
247         }\r
248         #endif\r
249         \r
250         // Clean Up\r
251         free(phtab);\r
252         // Return\r
253         LEAVE('p', ret);\r
254         return ret;\r
255 }\r
256 \r
257 // --- ELF RELOCATION ---\r
258 // Taken from 'ld-acess.so'\r
259 /**\r
260  \fn int Elf_Relocate(void *Base)\r
261  \brief Relocates a loaded ELF Executable\r
262 */\r
263 int Elf_Relocate(void *Base)\r
264 {\r
265         Elf32_Ehdr      *hdr = Base;\r
266         Elf32_Phdr      *phtab;\r
267          int    i, j;   // Counters\r
268         char    *libPath;\r
269         Uint    iRealBase = -1;\r
270         Uint    iBaseDiff;\r
271          int    iSegmentCount;\r
272          int    iSymCount = 0;\r
273         Elf32_Rel       *rel = NULL;\r
274         Elf32_Rela      *rela = NULL;\r
275         Uint32  *pltgot = NULL;\r
276         void    *plt = NULL;\r
277         Uint32  *ptr;\r
278          int    relSz=0, relEntSz=8;\r
279          int    relaSz=0, relaEntSz=8;\r
280          int    pltSz=0, pltType=0;\r
281         Elf32_Dyn       *dynamicTab = NULL;     // Dynamic Table Pointer\r
282         char    *dynstrtab = NULL;      // .dynamic String Table\r
283         Elf32_Sym       *dynsymtab = NULL;\r
284          int    bFailed = 0;\r
285         \r
286         ENTER("pBase", Base);\r
287         \r
288         // Parse Program Header to get Dynamic Table\r
289         phtab = Base + hdr->phoff;\r
290         iSegmentCount = hdr->phentcount;\r
291         for(i = 0; i < iSegmentCount; i ++ )\r
292         {\r
293                 // Determine linked base address\r
294                 if(phtab[i].Type == PT_LOAD && iRealBase > phtab[i].VAddr)\r
295                         iRealBase = phtab[i].VAddr;\r
296                 \r
297                 // Find Dynamic Section\r
298                 if(phtab[i].Type == PT_DYNAMIC) {\r
299                         if(dynamicTab) {\r
300                                 Log_Warning("ELF", "Elf_Relocate - Multiple PT_DYNAMIC segments\n");\r
301                                 continue;\r
302                         }\r
303                         dynamicTab = (void *) (tVAddr) phtab[i].VAddr;\r
304                         j = i;  // Save Dynamic Table ID\r
305                         break;\r
306                 }\r
307         }\r
308         \r
309         // Check if a PT_DYNAMIC segement was found\r
310         if(!dynamicTab) {\r
311                 Log_Warning("ELF", "Elf_Relocate: No PT_DYNAMIC segment in image, returning\n");\r
312                 LEAVE('x', hdr->entrypoint);\r
313                 return hdr->entrypoint;\r
314         }\r
315         \r
316         // Page Align real base\r
317         iRealBase &= ~0xFFF;\r
318         \r
319         // Adjust "Real" Base\r
320         iBaseDiff = (Uint)Base - iRealBase;\r
321         // Adjust Dynamic Table\r
322         dynamicTab = (void *) ((Uint)dynamicTab + iBaseDiff);\r
323         \r
324         // === Get Symbol table and String Table ===\r
325         for( j = 0; dynamicTab[j].d_tag != DT_NULL; j++)\r
326         {\r
327                 switch(dynamicTab[j].d_tag)\r
328                 {\r
329                 // --- Symbol Table ---\r
330                 case DT_SYMTAB:\r
331                         dynamicTab[j].d_val += iBaseDiff;\r
332                         dynsymtab = (void*) (tVAddr) dynamicTab[j].d_val;\r
333                         hdr->misc.SymTable = dynamicTab[j].d_val;       // Saved in unused bytes of ident\r
334                         break;\r
335                 \r
336                 // --- String Table ---\r
337                 case DT_STRTAB:\r
338                         dynamicTab[j].d_val += iBaseDiff;\r
339                         dynstrtab = (void*) (tVAddr) dynamicTab[j].d_val;\r
340                         break;\r
341                 \r
342                 // --- Hash Table --\r
343                 case DT_HASH:\r
344                         dynamicTab[j].d_val += iBaseDiff;\r
345                         iSymCount = ((Uint*)((tVAddr)dynamicTab[j].d_val))[1];\r
346                         hdr->misc.HashTable = dynamicTab[j].d_val;      // Saved in unused bytes of ident\r
347                         break;\r
348                 }\r
349         }\r
350 \r
351 \r
352         // Alter Symbols to true base\r
353         for(i = 0; i < iSymCount; i ++)\r
354         {\r
355                 dynsymtab[i].value += iBaseDiff;\r
356                 dynsymtab[i].nameOfs += (Uint)dynstrtab;\r
357                 //LOG("Sym '%s' = 0x%x (relocated)\n", dynsymtab[i].name, dynsymtab[i].value);\r
358         }\r
359         \r
360         // === Add to loaded list (can be imported now) ===\r
361         //Binary_AddLoaded( (Uint)Base );\r
362 \r
363         // === Parse Relocation Data ===\r
364         for( j = 0; dynamicTab[j].d_tag != DT_NULL; j++)\r
365         {\r
366                 switch(dynamicTab[j].d_tag)\r
367                 {\r
368                 // --- Shared Library Name ---\r
369                 case DT_SONAME:\r
370                         LOG(".so Name '%s'\n", dynstrtab+dynamicTab[j].d_val);\r
371                         break;\r
372                 // --- Needed Library ---\r
373                 case DT_NEEDED:\r
374                         libPath = dynstrtab + dynamicTab[j].d_val;\r
375                         Log_Notice("ELF", "%p - Required Library '%s' (Ignored in kernel mode)\n", Base, libPath);\r
376                         break;\r
377                 // --- PLT/GOT ---\r
378                 case DT_PLTGOT: pltgot = (void*)(iBaseDiff+dynamicTab[j].d_val);        break;\r
379                 case DT_JMPREL: plt = (void*)(iBaseDiff+dynamicTab[j].d_val);   break;\r
380                 case DT_PLTREL: pltType = dynamicTab[j].d_val;  break;\r
381                 case DT_PLTRELSZ:       pltSz = dynamicTab[j].d_val;    break;\r
382                 \r
383                 // --- Relocation ---\r
384                 case DT_REL:    rel = (void*)(iBaseDiff + dynamicTab[j].d_val); break;\r
385                 case DT_RELSZ:  relSz = dynamicTab[j].d_val;    break;\r
386                 case DT_RELENT: relEntSz = dynamicTab[j].d_val; break;\r
387                 \r
388                 case DT_RELA:   rela = (void*)(iBaseDiff + dynamicTab[j].d_val);        break;\r
389                 case DT_RELASZ: relaSz = dynamicTab[j].d_val;   break;\r
390                 case DT_RELAENT:        relaEntSz = dynamicTab[j].d_val;        break;\r
391                 }\r
392         }\r
393         \r
394         // Parse Relocation Entries\r
395         if(rel && relSz)\r
396         {\r
397                 j = relSz / relEntSz;\r
398                 for( i = 0; i < j; i++ )\r
399                 {\r
400                         ptr = (void*)(iBaseDiff + rel[i].r_offset);\r
401                         if( !Elf_Int_DoRelocate(rel[i].r_info, ptr, *ptr, dynsymtab, (Uint)Base) ) {\r
402                                 bFailed = 1;\r
403                         }\r
404                 }\r
405         }\r
406         // Parse Relocation Entries\r
407         if(rela && relaSz)\r
408         {\r
409                 j = relaSz / relaEntSz;\r
410                 for( i = 0; i < j; i++ )\r
411                 {\r
412                         ptr = (void*)(iBaseDiff + rela[i].r_offset);\r
413                         if( !Elf_Int_DoRelocate(rel[i].r_info, ptr, rela[i].r_addend, dynsymtab, (Uint)Base) ) {\r
414                                 bFailed = 1;\r
415                         }\r
416                 }\r
417         }\r
418         \r
419         // === Process PLT (Procedure Linkage Table) ===\r
420         if(plt && pltSz)\r
421         {\r
422                 if(pltType == DT_REL)\r
423                 {\r
424                         Elf32_Rel       *pltRel = plt;\r
425                         j = pltSz / sizeof(Elf32_Rel);\r
426                         LOG("PLT Rel - plt = %p, pltSz = %i (%i ents)", plt, pltSz, j);\r
427                         for(i = 0; i < j; i++)\r
428                         {\r
429                                 ptr = (void*)(iBaseDiff + pltRel[i].r_offset);\r
430                                 if( !Elf_Int_DoRelocate(pltRel[i].r_info, ptr, *ptr, dynsymtab, (Uint)Base) ) {\r
431                                         bFailed = 1;\r
432                                 }\r
433                         }\r
434                 }\r
435                 else\r
436                 {\r
437                         Elf32_Rela      *pltRela = plt;\r
438                         j = pltSz / sizeof(Elf32_Rela);\r
439                         LOG("PLT RelA - plt = %p, pltSz = %i (%i ents)", plt, pltSz, j);\r
440                         for(i=0;i<j;i++)\r
441                         {\r
442                                 ptr = (void*)(iBaseDiff + pltRela[i].r_offset);\r
443                                 if( !Elf_Int_DoRelocate(pltRela[i].r_info, ptr, pltRela[i].r_addend, dynsymtab, (Uint)Base) ) {\r
444                                         bFailed = 1;\r
445                                 }\r
446                         }\r
447                 }\r
448         }\r
449         \r
450         if(bFailed) {\r
451                 LEAVE('i', 0);\r
452                 return 0;\r
453         }\r
454         \r
455         LEAVE('x', hdr->entrypoint);\r
456         return hdr->entrypoint;\r
457 }\r
458 \r
459 /**\r
460  * \fn void Elf_Int_DoRelocate(Uint r_info, Uint32 *ptr, Uint32 addend, Elf32_Sym *symtab, Uint base)\r
461  * \brief Performs a relocation\r
462  * \param r_info        Field from relocation entry\r
463  * \param ptr   Pointer to location of relocation\r
464  * \param addend        Value to add to symbol\r
465  * \param symtab        Symbol Table\r
466  * \param base  Base of loaded binary\r
467  */\r
468 int Elf_Int_DoRelocate(Uint r_info, Uint32 *ptr, Uint32 addend, Elf32_Sym *symtab, Uint base)\r
469 {\r
470         Uint    val;\r
471          int    type = ELF32_R_TYPE(r_info);\r
472          int    sym = ELF32_R_SYM(r_info);\r
473         char    *sSymName = symtab[sym].name;\r
474         \r
475         //LogF("Elf_Int_DoRelocate: (r_info=0x%x, ptr=0x%x, addend=0x%x, .., base=0x%x)\n",\r
476         //      r_info, ptr, addend, base);\r
477         \r
478         switch( type )\r
479         {\r
480         // Standard 32 Bit Relocation (S+A)\r
481         case R_386_32:\r
482                 if( !Elf_GetSymbol((void*)base, sSymName, &val) )       // Search this binary first\r
483                         if( !Binary_GetSymbol( sSymName, &val ) )\r
484                                 return 0;\r
485                 LOG("%08x R_386_32 *0x%x += 0x%x('%s')", r_info, ptr, val, sSymName);\r
486                 *ptr = val + addend;\r
487                 break;\r
488                 \r
489         // 32 Bit Relocation wrt. Offset (S+A-P)\r
490         case R_386_PC32:\r
491                 if( !Elf_GetSymbol( (void*)base, sSymName, &val ) )\r
492                         if( !Binary_GetSymbol( sSymName, &val ) )\r
493                                 return 0;\r
494                 LOG("%08x R_386_PC32 *0x%x = 0x%x + 0x%x('%s') - 0x%x", r_info, ptr, *ptr, val, sSymName, (Uint)ptr );\r
495                 // TODO: Check if it needs the true value of ptr or the compiled value\r
496                 // NOTE: Testing using true value\r
497                 *ptr = val + addend - (Uint)ptr;\r
498                 break;\r
499 \r
500         // Absolute Value of a symbol (S)\r
501         case R_386_GLOB_DAT:\r
502                 if( !Elf_GetSymbol( (void*)base, sSymName, &val ) )\r
503                         if( !Binary_GetSymbol( sSymName, &val ) )\r
504                                 return 0;\r
505                 LOG("%08x R_386_GLOB_DAT *0x%x = 0x%x (%s)", r_info, ptr, val, sSymName);\r
506                 *ptr = val;\r
507                 break;\r
508         \r
509         // Absolute Value of a symbol (S)\r
510         case R_386_JMP_SLOT:\r
511                 if( !Elf_GetSymbol( (void*)base, sSymName, &val ) )\r
512                         if( !Binary_GetSymbol( sSymName, &val ) )\r
513                                 return 0;\r
514                 LOG("%08x R_386_JMP_SLOT *0x%x = 0x%x (%s)", r_info, ptr, val, sSymName);\r
515                 *ptr = val;\r
516                 break;\r
517 \r
518         // Base Address (B+A)\r
519         case R_386_RELATIVE:\r
520                 LOG("%08x R_386_RELATIVE *0x%x = 0x%x + 0x%x", r_info, ptr, base, addend);\r
521                 *ptr = base + addend;\r
522                 break;\r
523                 \r
524         default:\r
525                 LOG("Rel 0x%x: 0x%x,%i", ptr, sym, type);\r
526                 break;\r
527         }\r
528         return 1;\r
529 }\r
530 \r
531 /**\r
532  * \fn int Elf_GetSymbol(void *Base, char *name, Uint *ret)\r
533  * \brief Get a symbol from the loaded binary\r
534  */\r
535 int Elf_GetSymbol(void *Base, char *Name, Uint *ret)\r
536 {\r
537         Elf32_Ehdr      *hdr = (void*)Base;\r
538         Elf32_Sym       *symtab;\r
539          int    nbuckets = 0;\r
540          int    iSymCount = 0;\r
541          int    i;\r
542         Uint    *pBuckets;\r
543         Uint    *pChains;\r
544         Uint    iNameHash;\r
545 \r
546         if(!Base)       return 0;\r
547 \r
548         pBuckets = (void *) hdr->misc.HashTable;\r
549         symtab = (void *) hdr->misc.SymTable;\r
550         \r
551         nbuckets = pBuckets[0];\r
552         iSymCount = pBuckets[1];\r
553         pBuckets = &pBuckets[2];\r
554         pChains = &pBuckets[ nbuckets ];\r
555         \r
556         // Get hash\r
557         iNameHash = Elf_Int_HashString(Name);\r
558         iNameHash %= nbuckets;\r
559 \r
560         // Check Bucket\r
561         i = pBuckets[ iNameHash ];\r
562         if(symtab[i].shndx != SHN_UNDEF && strcmp(symtab[i].name, Name) == 0) {\r
563                 if(ret) *ret = symtab[ i ].value;\r
564                 return 1;\r
565         }\r
566         \r
567         // Walk Chain\r
568         while(pChains[i] != STN_UNDEF)\r
569         {\r
570                 i = pChains[i];\r
571                 if(symtab[i].shndx != SHN_UNDEF && strcmp(symtab[ i ].name, Name) == 0) {\r
572                         if(ret) *ret = symtab[ i ].value;\r
573                         return 1;\r
574                 }\r
575         }\r
576         return 0;\r
577 }\r
578 \r
579 /**\r
580  * \fn Uint Elf_Int_HashString(char *str)\r
581  * \brief Hash a string in the ELF format\r
582  * \param str   String to hash\r
583  * \return Hash value\r
584  */\r
585 Uint Elf_Int_HashString(char *str)\r
586 {\r
587         Uint    h = 0, g;\r
588         while(*str)\r
589         {\r
590                 h = (h << 4) + *str++;\r
591                 if( (g = h & 0xf0000000) )\r
592                         h ^= g >> 24;\r
593                 h &= ~g;\r
594         }\r
595         return h;\r
596 }\r

UCC git Repository :: git.ucc.asn.au