Kernel/bin/elf.c

   1 /*\r
   2  * Acess v0.1\r
   3  * ELF Executable Loader Code\r
   4  */\r
   5 #define DEBUG   0\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("ifp", 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                 // Get Pages\r
 138                 count = ( (phtab[i].VAddr&0xFFF) + phtab[i].FileSize + 0xFFF) >> 12;\r
 139                 for( k = 0; k < count; k ++ )\r
 140                 {\r
 141                         ret->Pages[j+k].Virtual = phtab[i].VAddr + (k<<12);\r
 142                         ret->Pages[j+k].Physical = phtab[i].Offset + (k<<12);   // Store the offset in the physical address\r
 143                         if(k != 0) {\r
 144                                 ret->Pages[j+k].Physical -= ret->Pages[j+k].Virtual&0xFFF;\r
 145                                 ret->Pages[j+k].Virtual &= ~0xFFF;\r
 146                         }\r
 147                         if(k == count-1)\r
 148                                 ret->Pages[j+k].Size = lastSize;        // Byte count in page\r
 149                         else if(k == 0)\r
 150                                 ret->Pages[j+k].Size = 4096 - (phtab[i].VAddr&0xFFF);\r
 151                         else\r
 152                                 ret->Pages[j+k].Size = 4096;\r
 153                         LOG("ret->Pages[%i].Size = 0x%x", j+k, ret->Pages[j+k].Size);\r
 154                         ret->Pages[j+k].Flags = 0;\r
 155                 }\r
 156                 count = (phtab[i].MemSize + 0xFFF) >> 12;\r
 157                 for(;k<count;k++)\r
 158                 {\r
 159                         ret->Pages[j+k].Virtual = phtab[i].VAddr + (k<<12);\r
 160                         ret->Pages[j+k].Physical = -1;  // -1 = Fill with zeros\r
 161                         if(k != 0)      ret->Pages[j+k].Virtual &= ~0xFFF;\r
 162                         if(k == count-1 && (phtab[i].MemSize & 0xFFF))\r
 163                                 ret->Pages[j+k].Size = phtab[i].MemSize & 0xFFF;        // Byte count in page\r
 164                         else\r
 165                                 ret->Pages[j+k].Size = 4096;\r
 166                         ret->Pages[j+k].Flags = 0;\r
 167                         LOG("%i - 0x%x => 0x%x - 0x%x", j+k,\r
 168                                 ret->Pages[j+k].Physical, ret->Pages[j+k].Virtual, ret->Pages[j+k].Size);\r
 169                 }\r
 170                 j += count;\r
 171         }\r
 172         \r
 173         #if 0\r
 174         LOG("Cleaning up overlaps");\r
 175         // Clear up Overlaps\r
 176         {\r
 177                 struct {\r
 178                         Uint    V;\r
 179                         Uint    P;\r
 180                         Uint    S;\r
 181                         Uint    F;\r
 182                 } *tmpRgns;\r
 183                 count = j;\r
 184                 tmpRgns = malloc(sizeof(*tmpRgns)*count);\r
 185                 // Copy\r
 186                 for(i=0;i<count;i++) {\r
 187                         tmpRgns[i].V = ret->Pages[i].Virtual;\r
 188                         tmpRgns[i].P = ret->Pages[i].Physical;\r
 189                         tmpRgns[i].S = ret->Pages[i].Size;\r
 190                         tmpRgns[i].F = ret->Pages[i].Flags;\r
 191                 }\r
 192                 // Compact\r
 193                 for(i=1,j=0; i < count; i++)\r
 194                 {                       \r
 195                         if(     tmpRgns[j].F == tmpRgns[i].F\r
 196                         &&      tmpRgns[j].V + tmpRgns[j].S == tmpRgns[i].V\r
 197                         &&      ((tmpRgns[j].P == -1 && tmpRgns[i].P == -1)\r
 198                         || (tmpRgns[j].P + tmpRgns[j].S == tmpRgns[i].P)) )\r
 199                         {\r
 200                                 tmpRgns[j].S += tmpRgns[i].S;\r
 201                         } else {\r
 202                                 j ++;\r
 203                                 tmpRgns[j].V = tmpRgns[i].V;\r
 204                                 tmpRgns[j].P = tmpRgns[i].P;\r
 205                                 tmpRgns[j].F = tmpRgns[i].F;\r
 206                                 tmpRgns[j].S = tmpRgns[i].S;\r
 207                         }\r
 208                 }\r
 209                 j ++;\r
 210                 // Count\r
 211                 count = j;      j = 0;\r
 212                 for(i=0;i<count;i++) {\r
 213                         //LogF(" Elf_Load: %i - 0x%x => 0x%x - 0x%x\n", i, tmpRgns[i].P, tmpRgns[i].V, tmpRgns[i].S);\r
 214                         tmpRgns[i].S += tmpRgns[i].V & 0xFFF;\r
 215                         if(tmpRgns[i].P != -1)  tmpRgns[i].P -= tmpRgns[i].V & 0xFFF;\r
 216                         tmpRgns[i].V &= ~0xFFF;\r
 217                         j += (tmpRgns[i].S + 0xFFF) >> 12;\r
 218                         //LogF(" Elf_Load: %i - 0x%x => 0x%x - 0x%x\n", i, tmpRgns[i].P, tmpRgns[i].V, tmpRgns[i].S);\r
 219                 }\r
 220                 // Reallocate\r
 221                 ret = realloc( ret, sizeof(tBinary) + 3*sizeof(Uint)*j );\r
 222                 if(!ret) {\r
 223                         Warning("BIN", "ElfLoad: Unable to reallocate return structure");\r
 224                         return NULL;\r
 225                 }\r
 226                 ret->NumPages = j;\r
 227                 // Split\r
 228                 k = 0;\r
 229                 for(i=0;i<count;i++) {\r
 230                         for( j = 0; j < (tmpRgns[i].S + 0xFFF) >> 12; j++,k++ ) {\r
 231                                 ret->Pages[k].Flags = tmpRgns[i].F;\r
 232                                 ret->Pages[k].Virtual = tmpRgns[i].V + (j<<12);\r
 233                                 if(tmpRgns[i].P != -1) {\r
 234                                         ret->Pages[k].Physical = tmpRgns[i].P + (j<<12);\r
 235                                 } else\r
 236                                         ret->Pages[k].Physical = -1;\r
 237                                 ret->Pages[k].Size = tmpRgns[i].S - (j << 12);\r
 238                                 // Clamp to page size\r
 239                                 if(ret->Pages[k].Size > 0x1000) ret->Pages[k].Size = 0x1000;\r
 240                         }\r
 241                 }\r
 242                 // Free Temp\r
 243                 free(tmpRgns);\r
 244         }\r
 245         #endif\r
 246         \r
 247         // Clean Up\r
 248         free(phtab);\r
 249         // Return\r
 250         LEAVE('p', ret);\r
 251         return ret;\r
 252 }\r
 253 \r
 254 // --- ELF RELOCATION ---\r
 255 // Taken from 'ld-acess.so'\r
 256 /**\r
 257  \fn int Elf_Relocate(void *Base)\r
 258  \brief Relocates a loaded ELF Executable\r
 259 */\r
 260 int Elf_Relocate(void *Base)\r
 261 {\r
 262         Elf32_Ehdr      *hdr = Base;\r
 263         Elf32_Phdr      *phtab;\r
 264          int    i, j;   // Counters\r
 265         char    *libPath;\r
 266         Uint    iRealBase = -1;\r
 267         Uint    iBaseDiff;\r
 268          int    iSegmentCount;\r
 269          int    iSymCount = 0;\r
 270         Elf32_Rel       *rel = NULL;\r
 271         Elf32_Rela      *rela = NULL;\r
 272         Uint32  *pltgot = NULL;\r
 273         void    *plt = NULL;\r
 274         Uint32  *ptr;\r
 275          int    relSz=0, relEntSz=8;\r
 276          int    relaSz=0, relaEntSz=8;\r
 277          int    pltSz=0, pltType=0;\r
 278         Elf32_Dyn       *dynamicTab = NULL;     // Dynamic Table Pointer\r
 279         char    *dynstrtab = NULL;      // .dynamic String Table\r
 280         Elf32_Sym       *dynsymtab = NULL;\r
 281          int    bFailed = 0;\r
 282         \r
 283         ENTER("pBase", Base);\r
 284         \r
 285         // Parse Program Header to get Dynamic Table\r
 286         phtab = Base + hdr->phoff;\r
 287         iSegmentCount = hdr->phentcount;\r
 288         for(i=0;i<iSegmentCount;i++)\r
 289         {\r
 290                 // Determine linked base address\r
 291                 if(phtab[i].Type == PT_LOAD && iRealBase > phtab[i].VAddr)\r
 292                         iRealBase = phtab[i].VAddr;\r
 293                 \r
 294                 // Find Dynamic Section\r
 295                 if(phtab[i].Type == PT_DYNAMIC) {\r
 296                         if(dynamicTab) {\r
 297                                 Warning("ELF", "Elf_Relocate - Multiple PT_DYNAMIC segments\n");\r
 298                                 continue;\r
 299                         }\r
 300                         dynamicTab = (void *) phtab[i].VAddr;\r
 301                         j = i;  // Save Dynamic Table ID\r
 302                         break;\r
 303                 }\r
 304         }\r
 305         \r
 306         // Check if a PT_DYNAMIC segement was found\r
 307         if(!dynamicTab) {\r
 308                 Warning("ELF", "Elf_Relocate: No PT_DYNAMIC segment in image, returning\n");\r
 309                 LEAVE('x', hdr->entrypoint);\r
 310                 return hdr->entrypoint;\r
 311         }\r
 312         \r
 313         // Page Align real base\r
 314         iRealBase &= ~0xFFF;\r
 315         \r
 316         // Adjust "Real" Base\r
 317         iBaseDiff = (Uint)Base - iRealBase;\r
 318         // Adjust Dynamic Table\r
 319         dynamicTab = (void *) ((Uint)dynamicTab + iBaseDiff);\r
 320         \r
 321         // === Get Symbol table and String Table ===\r
 322         for( j = 0; dynamicTab[j].d_tag != DT_NULL; j++)\r
 323         {\r
 324                 switch(dynamicTab[j].d_tag)\r
 325                 {\r
 326                 // --- Symbol Table ---\r
 327                 case DT_SYMTAB:\r
 328                         dynamicTab[j].d_val += iBaseDiff;\r
 329                         dynsymtab = (void*)(dynamicTab[j].d_val);\r
 330                         hdr->misc.SymTable = dynamicTab[j].d_val;       // Saved in unused bytes of ident\r
 331                         break;\r
 332                 \r
 333                 // --- String Table ---\r
 334                 case DT_STRTAB:\r
 335                         dynamicTab[j].d_val += iBaseDiff;\r
 336                         dynstrtab = (void*)(dynamicTab[j].d_val);\r
 337                         break;\r
 338                 \r
 339                 // --- Hash Table --\r
 340                 case DT_HASH:\r
 341                         dynamicTab[j].d_val += iBaseDiff;\r
 342                         iSymCount = ((Uint*)(dynamicTab[j].d_val))[1];\r
 343                         hdr->misc.HashTable = dynamicTab[j].d_val;      // Saved in unused bytes of ident\r
 344                         break;\r
 345                 }\r
 346         }\r
 347 \r
 348 \r
 349         // Alter Symbols to true base\r
 350         for(i=0;i<iSymCount;i++)\r
 351         {\r
 352                 dynsymtab[i].value += iBaseDiff;\r
 353                 dynsymtab[i].nameOfs += (Uint)dynstrtab;\r
 354                 //LOG("Sym '%s' = 0x%x (relocated)\n", dynsymtab[i].name, dynsymtab[i].value);\r
 355         }\r
 356         \r
 357         // === Add to loaded list (can be imported now) ===\r
 358         //Binary_AddLoaded( (Uint)Base );\r
 359 \r
 360         // === Parse Relocation Data ===\r
 361         for( j = 0; dynamicTab[j].d_tag != DT_NULL; j++)\r
 362         {\r
 363                 switch(dynamicTab[j].d_tag)\r
 364                 {\r
 365                 // --- Shared Library Name ---\r
 366                 case DT_SONAME:\r
 367                         LOG(".so Name '%s'\n", dynstrtab+dynamicTab[j].d_val);\r
 368                         break;\r
 369                 // --- Needed Library ---\r
 370                 case DT_NEEDED:\r
 371                         libPath = dynstrtab + dynamicTab[j].d_val;\r
 372                         LOG("Required Library '%s' (IGNORED in kernel mode)\n", libPath);\r
 373                         break;\r
 374                 // --- PLT/GOT ---\r
 375                 case DT_PLTGOT: pltgot = (void*)iBaseDiff+(dynamicTab[j].d_val);        break;\r
 376                 case DT_JMPREL: plt = (void*)(iBaseDiff+dynamicTab[j].d_val);   break;\r
 377                 case DT_PLTREL: pltType = dynamicTab[j].d_val;  break;\r
 378                 case DT_PLTRELSZ:       pltSz = dynamicTab[j].d_val;    break;\r
 379                 \r
 380                 // --- Relocation ---\r
 381                 case DT_REL:    rel = (void*)(iBaseDiff + dynamicTab[j].d_val); break;\r
 382                 case DT_RELSZ:  relSz = dynamicTab[j].d_val;    break;\r
 383                 case DT_RELENT: relEntSz = dynamicTab[j].d_val; break;\r
 384                 case DT_RELA:   rela = (void*)(iBaseDiff + dynamicTab[j].d_val);        break;\r
 385                 case DT_RELASZ: relaSz = dynamicTab[j].d_val;   break;\r
 386                 case DT_RELAENT:        relaEntSz = dynamicTab[j].d_val;        break;\r
 387                 }\r
 388         }\r
 389         \r
 390         // Parse Relocation Entries\r
 391         if(rel && relSz)\r
 392         {\r
 393                 j = relSz / relEntSz;\r
 394                 for( i = 0; i < j; i++ )\r
 395                 {\r
 396                         ptr = (void*)(iBaseDiff + rel[i].r_offset);\r
 397                         if( !Elf_Int_DoRelocate(rel[i].r_info, ptr, *ptr, dynsymtab, (Uint)Base) ) {\r
 398                                 bFailed = 1;\r
 399                         }\r
 400                 }\r
 401         }\r
 402         // Parse Relocation Entries\r
 403         if(rela && relaSz)\r
 404         {\r
 405                 j = relaSz / relaEntSz;\r
 406                 for( i = 0; i < j; i++ )\r
 407                 {\r
 408                         ptr = (void*)(iBaseDiff + rela[i].r_offset);\r
 409                         if( !Elf_Int_DoRelocate(rel[i].r_info, ptr, rela[i].r_addend, dynsymtab, (Uint)Base) ) {\r
 410                                 bFailed = 1;\r
 411                         }\r
 412                 }\r
 413         }\r
 414         \r
 415         // === Process PLT (Procedure Linkage Table) ===\r
 416         if(plt && pltSz)\r
 417         {\r
 418                 if(pltType == DT_REL)\r
 419                 {\r
 420                         Elf32_Rel       *pltRel = plt;\r
 421                         j = pltSz / sizeof(Elf32_Rel);\r
 422                         for(i = 0; i < j; i++)\r
 423                         {\r
 424                                 ptr = (void*)(iBaseDiff + pltRel[i].r_offset);\r
 425                                 if( !Elf_Int_DoRelocate(pltRel[i].r_info, ptr, *ptr, dynsymtab, (Uint)Base) ) {\r
 426                                         bFailed = 1;\r
 427                                 }\r
 428                         }\r
 429                 }\r
 430                 else\r
 431                 {\r
 432                         Elf32_Rela      *pltRela = plt;\r
 433                         j = pltSz / sizeof(Elf32_Rela);\r
 434                         for(i=0;i<j;i++)\r
 435                         {\r
 436                                 ptr = (void*)((Uint)Base + pltRela[i].r_offset);\r
 437                                 if( !Elf_Int_DoRelocate(pltRela[i].r_info, ptr, pltRela[i].r_addend, dynsymtab, (Uint)Base) ) {\r
 438                                         bFailed = 1;\r
 439                                 }\r
 440                         }\r
 441                 }\r
 442         }\r
 443         \r
 444         if(bFailed) {\r
 445                 LEAVE('i', 0);\r
 446                 return 0;\r
 447         }\r
 448         \r
 449         LEAVE('x', hdr->entrypoint);\r
 450         return hdr->entrypoint;\r
 451 }\r
 452 \r
 453 /**\r
 454  * \fn void Elf_Int_DoRelocate(Uint r_info, Uint32 *ptr, Uint32 addend, Elf32_Sym *symtab, Uint base)\r
 455  * \brief Performs a relocation\r
 456  * \param r_info        Field from relocation entry\r
 457  * \param ptr   Pointer to location of relocation\r
 458  * \param addend        Value to add to symbol\r
 459  * \param symtab        Symbol Table\r
 460  * \param base  Base of loaded binary\r
 461  */\r
 462 int Elf_Int_DoRelocate(Uint r_info, Uint32 *ptr, Uint32 addend, Elf32_Sym *symtab, Uint base)\r
 463 {\r
 464         Uint    val;\r
 465          int    type = ELF32_R_TYPE(r_info);\r
 466          int    sym = ELF32_R_SYM(r_info);\r
 467         char    *sSymName = symtab[sym].name;\r
 468         \r
 469         //LogF("Elf_Int_DoRelocate: (r_info=0x%x, ptr=0x%x, addend=0x%x, .., base=0x%x)\n",\r
 470         //      r_info, ptr, addend, base);\r
 471         \r
 472         switch( type )\r
 473         {\r
 474         // Standard 32 Bit Relocation (S+A)\r
 475         case R_386_32:\r
 476                 if( !Elf_GetSymbol((void*)base, sSymName, &val) )       // Search this binary first\r
 477                         if( !Binary_GetSymbol( sSymName, &val ) )\r
 478                                 return 0;\r
 479                 LOG("R_386_32 *0x%x += 0x%x('%s')", ptr, val, sSymName);\r
 480                 *ptr = val + addend;\r
 481                 break;\r
 482                 \r
 483         // 32 Bit Relocation wrt. Offset (S+A-P)\r
 484         case R_386_PC32:\r
 485                 if( !Elf_GetSymbol( (void*)base, sSymName, &val ) )\r
 486                         if( !Binary_GetSymbol( sSymName, &val ) )\r
 487                                 return 0;\r
 488                 LOG("R_386_PC32 *0x%x = 0x%x + 0x%x('%s') - 0x%x", ptr, *ptr, val, sSymName, (Uint)ptr );\r
 489                 // TODO: Check if it needs the true value of ptr or the compiled value\r
 490                 // NOTE: Testing using true value\r
 491                 *ptr = val + addend - (Uint)ptr;\r
 492                 break;\r
 493 \r
 494         // Absolute Value of a symbol (S)\r
 495         case R_386_GLOB_DAT:\r
 496                 if( !Elf_GetSymbol( (void*)base, sSymName, &val ) )\r
 497                         if( !Binary_GetSymbol( sSymName, &val ) )\r
 498                                 return 0;\r
 499                 LOG("R_386_GLOB_DAT *0x%x = 0x%x (%s)", ptr, val, sSymName);\r
 500                 *ptr = val;\r
 501                 break;\r
 502         \r
 503         // Absolute Value of a symbol (S)\r
 504         case R_386_JMP_SLOT:\r
 505                 if( !Elf_GetSymbol( (void*)base, sSymName, &val ) )\r
 506                         if( !Binary_GetSymbol( sSymName, &val ) )\r
 507                                 return 0;\r
 508                 LOG("R_386_JMP_SLOT *0x%x = 0x%x (%s)", ptr, val, sSymName);\r
 509                 *ptr = val;\r
 510                 break;\r
 511 \r
 512         // Base Address (B+A)\r
 513         case R_386_RELATIVE:\r
 514                 LOG("R_386_RELATIVE *0x%x = 0x%x + 0x%x", ptr, base, addend);\r
 515                 *ptr = base + addend;\r
 516                 break;\r
 517                 \r
 518         default:\r
 519                 LOG("Rel 0x%x: 0x%x,%i", ptr, sym, type);\r
 520                 break;\r
 521         }\r
 522         return 1;\r
 523 }\r
 524 \r
 525 /**\r
 526  * \fn int Elf_GetSymbol(void *Base, char *name, Uint *ret)\r
 527  * \brief Get a symbol from the loaded binary\r
 528  */\r
 529 int Elf_GetSymbol(void *Base, char *Name, Uint *ret)\r
 530 {\r
 531         Elf32_Ehdr      *hdr = (void*)Base;\r
 532         Elf32_Sym       *symtab;\r
 533          int    nbuckets = 0;\r
 534          int    iSymCount = 0;\r
 535          int    i;\r
 536         Uint    *pBuckets;\r
 537         Uint    *pChains;\r
 538         Uint    iNameHash;\r
 539 \r
 540         if(!Base)       return 0;\r
 541 \r
 542         pBuckets = (void *) hdr->misc.HashTable;\r
 543         symtab = (void *) hdr->misc.SymTable;\r
 544         \r
 545         nbuckets = pBuckets[0];\r
 546         iSymCount = pBuckets[1];\r
 547         pBuckets = &pBuckets[2];\r
 548         pChains = &pBuckets[ nbuckets ];\r
 549         \r
 550         // Get hash\r
 551         iNameHash = Elf_Int_HashString(Name);\r
 552         iNameHash %= nbuckets;\r
 553 \r
 554         // Check Bucket\r
 555         i = pBuckets[ iNameHash ];\r
 556         if(symtab[i].shndx != SHN_UNDEF && strcmp(symtab[i].name, Name) == 0) {\r
 557                 if(ret) *ret = symtab[ i ].value;\r
 558                 return 1;\r
 559         }\r
 560         \r
 561         // Walk Chain\r
 562         while(pChains[i] != STN_UNDEF)\r
 563         {\r
 564                 i = pChains[i];\r
 565                 if(symtab[i].shndx != SHN_UNDEF && strcmp(symtab[ i ].name, Name) == 0) {\r
 566                         if(ret) *ret = symtab[ i ].value;\r
 567                         return 1;\r
 568                 }\r
 569         }\r
 570         return 0;\r
 571 }\r
 572 \r
 573 /**\r
 574  * \fn Uint Elf_Int_HashString(char *str)\r
 575  * \brief Hash a string in the ELF format\r
 576  * \param str   String to hash\r
 577  * \return Hash value\r
 578  */\r
 579 Uint Elf_Int_HashString(char *str)\r
 580 {\r
 581         Uint    h = 0, g;\r
 582         while(*str)\r
 583         {\r
 584                 h = (h << 4) + *str++;\r
 585                 if( (g = h & 0xf0000000) )\r
 586                         h ^= g >> 24;\r
 587                 h &= ~g;\r
 588         }\r
 589         return h;\r
 590 }\r