debugger/hash.c

   1 /*
   2  * File hash.c - generate hash tables for Wine debugger symbols
   3  *
   4  * Copyright (C) 1993, Eric Youngdale.
   5  */
   6
   7
   8 #include <stdlib.h>
   9 #include <stdio.h>
  10 #include <string.h>
  11 #include <limits.h>
  12 #include <sys/types.h>
  13 #include <neexe.h>
  14 #include "module.h"
  15 #include "process.h"
  16 #include "selectors.h"
  17 #include "debugger.h"
  18 #include "toolhelp.h"
  19 #include "xmalloc.h"
  20
  21 #define NR_NAME_HASH 16384
  22 #ifndef PATH_MAX
  23 #define PATH_MAX _MAX_PATH
  24 #endif
  25
  26 static char * reg_name[] =
  27 {
  28   "eax", "ecx", "edx", "ebx", "esp", "ebp", "esi", "edi"
  29 };
  30
  31
  32 struct name_hash
  33 {
  34     struct name_hash * next;            /* Used to look up within name hash */
  35     char *             name;
  36     char *             sourcefile;
  37
  38     int                n_locals;
  39     int                locals_alloc;
  40     WineLocals       * local_vars;
  41
  42     int                n_lines;
  43     int                lines_alloc;
  44     WineLineNo       * linetab;
  45
  46     DBG_ADDR           addr;
  47     unsigned short     flags;
  48     unsigned short     breakpoint_offset;
  49     unsigned int       symbol_size;
  50 };
  51
  52
  53 static BOOL32 DEBUG_GetStackSymbolValue( const char * name, DBG_ADDR *addr );
  54 static int sortlist_valid = FALSE;
  55
  56 static int sorttab_nsym;
  57 static struct name_hash ** addr_sorttab = NULL;
  58
  59 static struct name_hash * name_hash_table[NR_NAME_HASH];
  60
  61 static unsigned int name_hash( const char * name )
  62 {
  63     unsigned int hash = 0;
  64     unsigned int tmp;
  65     const char * p;
  66
  67     p = name;
  68
  69     while (*p)
  70       {
  71         hash = (hash << 4) + *p++;
  72
  73         if( (tmp = (hash & 0xf0000000)) )
  74           {
  75             hash ^= tmp >> 24;
  76           }
  77         hash &= ~tmp;
  78       }
  79     return hash % NR_NAME_HASH;
  80 }
  81
  82 int
  83 DEBUG_cmp_sym(const void * p1, const void * p2)
  84 {
  85   struct name_hash ** name1 = (struct name_hash **) p1;
  86   struct name_hash ** name2 = (struct name_hash **) p2;
  87
  88   if( ((*name1)->flags & SYM_INVALID) != 0 )
  89     {
  90       return -1;
  91     }
  92
  93   if( ((*name2)->flags & SYM_INVALID) != 0 )
  94     {
  95       return 1;
  96     }
  97
  98   if( (*name1)->addr.seg > (*name2)->addr.seg )
  99     {
 100       return 1;
 101     }
 102
 103   if( (*name1)->addr.seg < (*name2)->addr.seg )
 104     {
 105       return -1;
 106     }
 107
 108   if( (*name1)->addr.off > (*name2)->addr.off )
 109     {
 110       return 1;
 111     }
 112
 113   if( (*name1)->addr.off < (*name2)->addr.off )
 114     {
 115       return -1;
 116     }
 117
 118   return 0;
 119 }
 120
 121 /***********************************************************************
 122  *           DEBUG_ResortSymbols
 123  *
 124  * Rebuild sorted list of symbols.
 125  */
 126 static
 127 void
 128 DEBUG_ResortSymbols()
 129 {
 130     struct name_hash *nh;
 131     int         nsym = 0;
 132     int         i;
 133
 134     for(i=0; i<NR_NAME_HASH; i++)
 135     {
 136         for (nh = name_hash_table[i]; nh; nh = nh->next)
 137           {
 138             nsym++;
 139           }
 140     }
 141
 142     sorttab_nsym = nsym;
 143     if( nsym == 0 )
 144       {
 145         return;
 146       }
 147
 148     addr_sorttab = (struct name_hash **) xrealloc(addr_sorttab,
 149                                          nsym * sizeof(struct name_hash *));
 150
 151     nsym = 0;
 152     for(i=0; i<NR_NAME_HASH; i++)
 153     {
 154         for (nh = name_hash_table[i]; nh; nh = nh->next)
 155           {
 156             addr_sorttab[nsym++] = nh;
 157           }
 158     }
 159
 160     qsort(addr_sorttab, nsym,
 161           sizeof(struct name_hash *), DEBUG_cmp_sym);
 162     sortlist_valid = TRUE;
 163
 164 }
 165
 166 /***********************************************************************
 167  *           DEBUG_AddSymbol
 168  *
 169  * Add a symbol to the table.
 170  */
 171 struct name_hash *
 172 DEBUG_AddSymbol( const char * name, const DBG_ADDR *addr, const char * source,
 173                  int flags)
 174 {
 175     struct name_hash  * new;
 176     struct name_hash *nh;
 177     static char  prev_source[PATH_MAX] = {'\0', };
 178     static char * prev_duped_source = NULL;
 179     char * c;
 180     int hash;
 181
 182     hash = name_hash(name);
 183     for (nh = name_hash_table[hash]; nh; nh = nh->next)
 184     {
 185         if( ((nh->flags & SYM_INVALID) != 0) && strcmp(name, nh->name) == 0 )
 186         {
 187             nh->addr.off = addr->off;
 188             nh->addr.seg = addr->seg;
 189             if( nh->addr.type == NULL && addr->type != NULL )
 190             {
 191                 nh->addr.type = addr->type;
 192             }
 193             nh->flags &= ~SYM_INVALID;
 194             return nh;
 195         }
 196         if (nh->addr.seg == addr->seg &&
 197             nh->addr.off == addr->off &&
 198             strcmp(name, nh->name) == 0 )
 199         {
 200             return nh;
 201         }
 202     }
 203
 204     /*
 205      * First see if we already have an entry for this symbol.  If so
 206      * return it, so we don't end up with duplicates.
 207      */
 208
 209     new = (struct name_hash *) xmalloc(sizeof(struct name_hash));
 210     new->addr = *addr;
 211     new->name = xstrdup(name);
 212
 213     if( source != NULL )
 214       {
 215         /*
 216          * This is an enhancement to reduce memory consumption.  The idea
 217          * is that we duplicate a given string only once.  This is a big
 218          * win if there are lots of symbols defined in a given source file.
 219          */
 220         if( strcmp(source, prev_source) == 0 )
 221           {
 222             new->sourcefile = prev_duped_source;
 223           }
 224         else
 225           {
 226             strcpy(prev_source, source);
 227             prev_duped_source = new->sourcefile = xstrdup(source);
 228           }
 229       }
 230     else
 231       {
 232         new->sourcefile = NULL;
 233       }
 234
 235     new->n_lines        = 0;
 236     new->lines_alloc    = 0;
 237     new->linetab        = NULL;
 238
 239     new->n_locals       = 0;
 240     new->locals_alloc   = 0;
 241     new->local_vars     = NULL;
 242
 243     new->flags          = flags;
 244     new->next           = NULL;
 245
 246     /* Now insert into the hash table */
 247     new->next = name_hash_table[hash];
 248     name_hash_table[hash] = new;
 249
 250     /*
 251      * Check some heuristics based upon the file name to see whether
 252      * we want to step through this guy or not.  These are machine generated
 253      * assembly files that are used to translate between the MS way of
 254      * calling things and the GCC way of calling things.  In general we
 255      * always want to step through.
 256      */
 257     if( source != NULL )
 258       {
 259         c = strrchr(source, '.');
 260         if( c != NULL && strcmp(c, ".s") == 0 )
 261           {
 262             c = strrchr(source, '/');
 263             if( c != NULL )
 264               {
 265                 c++;
 266                 if(    (strcmp(c, "callfrom16.s") == 0)
 267                     || (strcmp(c, "callto16.s") == 0)
 268                     || (strcmp(c, "call32.s") == 0) )
 269                   {
 270                     new->flags |= SYM_TRAMPOLINE;
 271                   }
 272               }
 273           }
 274       }
 275
 276     sortlist_valid = FALSE;
 277     return new;
 278 }
 279
 280 BOOL32 DEBUG_Normalize(struct name_hash * nh )
 281 {
 282
 283   /*
 284    * We aren't adding any more locals or linenumbers to this function.
 285    * Free any spare memory that we might have allocated.
 286    */
 287   if( nh == NULL )
 288     {
 289       return TRUE;
 290     }
 291
 292   if( nh->n_locals != nh->locals_alloc )
 293     {
 294       nh->locals_alloc = nh->n_locals;
 295       nh->local_vars = xrealloc(nh->local_vars,
 296                                   nh->locals_alloc * sizeof(WineLocals));
 297     }
 298
 299   if( nh->n_lines != nh->lines_alloc )
 300     {
 301       nh->lines_alloc = nh->n_lines;
 302       nh->linetab = xrealloc(nh->linetab,
 303                               nh->lines_alloc * sizeof(WineLineNo));
 304     }
 305
 306   return TRUE;
 307 }
 308
 309 /***********************************************************************
 310  *           DEBUG_GetSymbolValue
 311  *
 312  * Get the address of a named symbol.
 313  */
 314 BOOL32 DEBUG_GetSymbolValue( const char * name, const int lineno,
 315                              DBG_ADDR *addr, int bp_flag )
 316 {
 317     char buffer[256];
 318     struct name_hash *nh;
 319
 320     for(nh = name_hash_table[name_hash(name)]; nh; nh = nh->next)
 321       {
 322         if( (nh->flags & SYM_INVALID) != 0 )
 323           {
 324             continue;
 325           }
 326
 327         if (!strcmp(nh->name, name)) break;
 328       }
 329
 330     if (!nh && (name[0] != '_'))
 331     {
 332         buffer[0] = '_';
 333         strcpy(buffer+1, name);
 334         for(nh = name_hash_table[name_hash(buffer)]; nh; nh = nh->next)
 335           {
 336             if( (nh->flags & SYM_INVALID) != 0 )
 337               {
 338                 continue;
 339               }
 340             if (!strcmp(nh->name, buffer)) break;
 341           }
 342     }
 343
 344     /*
 345      * If we don't have anything here, then try and see if this
 346      * is a local symbol to the current stack frame.  No matter
 347      * what, we have nothing more to do, so we let that function
 348      * decide what we ultimately return.
 349      */
 350     if (!nh)
 351       {
 352         return DEBUG_GetStackSymbolValue(name, addr);
 353       }
 354
 355     return DEBUG_GetLineNumberAddr( nh, lineno, addr, bp_flag );
 356 }
 357
 358 /***********************************************************************
 359  *           DEBUG_GetLineNumberAddr
 360  *
 361  * Get the address of a named symbol.
 362  */
 363 BOOL32 DEBUG_GetLineNumberAddr( struct name_hash * nh, const int lineno,
 364                                 DBG_ADDR *addr, int bp_flag )
 365 {
 366     int i;
 367
 368     if( lineno == -1 )
 369       {
 370         *addr = nh->addr;
 371         if( bp_flag )
 372           {
 373             addr->off += nh->breakpoint_offset;
 374           }
 375       }
 376     else
 377       {
 378         /*
 379          * Search for the specific line number.  If we don't find it,
 380          * then return FALSE.
 381          */
 382         if( nh->linetab == NULL )
 383           {
 384             return FALSE;
 385           }
 386
 387         for(i=0; i < nh->n_lines; i++ )
 388           {
 389             if( nh->linetab[i].line_number == lineno )
 390               {
 391                 *addr = nh->linetab[i].pc_offset;
 392                 return TRUE;
 393               }
 394           }
 395
 396         /*
 397          * This specific line number not found.
 398          */
 399         return FALSE;
 400       }
 401
 402     return TRUE;
 403 }
 404
 405
 406 /***********************************************************************
 407  *           DEBUG_SetSymbolValue
 408  *
 409  * Set the address of a named symbol.
 410  */
 411 BOOL32 DEBUG_SetSymbolValue( const char * name, const DBG_ADDR *addr )
 412 {
 413     char buffer[256];
 414     struct name_hash *nh;
 415
 416     for(nh = name_hash_table[name_hash(name)]; nh; nh = nh->next)
 417         if (!strcmp(nh->name, name)) break;
 418
 419     if (!nh && (name[0] != '_'))
 420     {
 421         buffer[0] = '_';
 422         strcpy(buffer+1, name);
 423         for(nh = name_hash_table[name_hash(buffer)]; nh; nh = nh->next)
 424             if (!strcmp(nh->name, buffer)) break;
 425     }
 426
 427     if (!nh) return FALSE;
 428     nh->addr = *addr;
 429     nh->flags &= SYM_INVALID;
 430     DBG_FIX_ADDR_SEG( &nh->addr, DS_reg(&DEBUG_context) );
 431     return TRUE;
 432 }
 433
 434
 435 /***********************************************************************
 436  *           DEBUG_FindNearestSymbol
 437  *
 438  * Find the symbol nearest to a given address.
 439  * If ebp is specified as non-zero, it means we should dump the argument
 440  * list into the string we return as well.
 441  */
 442 const char * DEBUG_FindNearestSymbol( const DBG_ADDR *addr, int flag,
 443                                       struct name_hash ** rtn,
 444                                       unsigned int ebp,
 445                                       struct list_id * source)
 446 {
 447     static char name_buffer[MAX_PATH + 256];
 448     static char arglist[1024];
 449     static char argtmp[256];
 450     struct name_hash * nearest = NULL;
 451     int mid, high, low;
 452     unsigned    int * ptr;
 453     int lineno;
 454     char * lineinfo, *sourcefile;
 455     int i;
 456     char linebuff[16];
 457
 458     if( rtn != NULL )
 459       {
 460         *rtn = NULL;
 461       }
 462
 463     if( source != NULL )
 464       {
 465         source->sourcefile = NULL;
 466         source->line = -1;
 467       }
 468
 469     if( sortlist_valid == FALSE )
 470       {
 471         DEBUG_ResortSymbols();
 472       }
 473
 474     if( sortlist_valid == FALSE )
 475       {
 476         return NULL;
 477       }
 478
 479     /*
 480      * FIXME  - use the binary search that we added to
 481      * the function DEBUG_CheckLinenoStatus.  Better yet, we should
 482      * probably keep some notion of the current function so we don't
 483      * have to search every time.
 484      */
 485     /*
 486      * Binary search to find closest symbol.
 487      */
 488     low = 0;
 489     high = sorttab_nsym;
 490     if( addr_sorttab[0]->addr.seg > addr->seg
 491         || (   addr_sorttab[0]->addr.seg == addr->seg
 492             && addr_sorttab[0]->addr.off > addr->off) )
 493       {
 494         nearest = NULL;
 495       }
 496     else if( addr_sorttab[high - 1]->addr.seg < addr->seg
 497         || (   addr_sorttab[high - 1]->addr.seg == addr->seg
 498             && addr_sorttab[high - 1]->addr.off < addr->off) )
 499       {
 500         nearest = addr_sorttab[high - 1];
 501       }
 502     else
 503       {
 504         while(1==1)
 505           {
 506             mid = (high + low)/2;
 507             if( mid == low )
 508               {
 509                 /*
 510                  * See if there are any other entries that might also
 511                  * have the same address, and would also have a line
 512                  * number table.
 513                  */
 514                 if( mid > 0 && addr_sorttab[mid]->linetab == NULL )
 515                   {
 516                     if(    (addr_sorttab[mid - 1]->addr.seg ==
 517                             addr_sorttab[mid]->addr.seg)
 518                         && (addr_sorttab[mid - 1]->addr.off ==
 519                             addr_sorttab[mid]->addr.off)
 520                         && (addr_sorttab[mid - 1]->linetab != NULL) )
 521                       {
 522                         mid--;
 523                       }
 524                   }
 525
 526                 if(    (mid < sorttab_nsym - 1)
 527                     && (addr_sorttab[mid]->linetab == NULL) )
 528                   {
 529                     if(    (addr_sorttab[mid + 1]->addr.seg ==
 530                             addr_sorttab[mid]->addr.seg)
 531                         && (addr_sorttab[mid + 1]->addr.off ==
 532                             addr_sorttab[mid]->addr.off)
 533                         && (addr_sorttab[mid + 1]->linetab != NULL) )
 534                       {
 535                         mid++;
 536                       }
 537                   }
 538                 nearest = addr_sorttab[mid];
 539 #if 0
 540                 fprintf(stderr, "Found %x:%x when looking for %x:%x %x %s\n",
 541                         addr_sorttab[mid ]->addr.seg,
 542                         addr_sorttab[mid ]->addr.off,
 543                         addr->seg, addr->off,
 544                         addr_sorttab[mid ]->linetab,
 545                         addr_sorttab[mid ]->name);
 546 #endif
 547                 break;
 548               }
 549             if(    (addr_sorttab[mid]->addr.seg < addr->seg)
 550                 || (   addr_sorttab[mid]->addr.seg == addr->seg
 551                     && addr_sorttab[mid]->addr.off <= addr->off) )
 552               {
 553                 low = mid;
 554               }
 555             else
 556               {
 557                 high = mid;
 558               }
 559           }
 560       }
 561
 562     if (!nearest) return NULL;
 563
 564     if( rtn != NULL )
 565       {
 566         *rtn = nearest;
 567       }
 568
 569     /*
 570      * Fill in the relevant bits to the structure so that we can
 571      * locate the source and line for this bit of code.
 572      */
 573     if( source != NULL )
 574       {
 575         source->sourcefile = nearest->sourcefile;
 576         if( nearest->linetab == NULL )
 577           {
 578             source->line = -1;
 579           }
 580         else
 581           {
 582             source->line = nearest->linetab[0].line_number;
 583           }
 584       }
 585
 586     lineinfo = "";
 587     lineno = -1;
 588
 589     /*
 590      * Prepare to display the argument list.  If ebp is specified, it is
 591      * the framepointer for the function in question.  If not specified,
 592      * we don't want the arglist.
 593      */
 594     memset(arglist, '\0', sizeof(arglist));
 595     if( ebp != 0 )
 596       {
 597         for(i=0; i < nearest->n_locals; i++ )
 598           {
 599             /*
 600              * If this is a register (offset == 0) or a local
 601              * variable, we don't want to know about it.
 602              */
 603             if( nearest->local_vars[i].offset <= 0 )
 604               {
 605                 continue;
 606               }
 607
 608             ptr = (unsigned int *) (ebp + nearest->local_vars[i].offset);
 609             if( arglist[0] == '\0' )
 610               {
 611                 arglist[0] = '(';
 612               }
 613             else
 614               {
 615                 strcat(arglist, ", ");
 616               }
 617
 618             sprintf(argtmp, "%s=0x%x", nearest->local_vars[i].name,
 619                     *ptr);
 620             strcat(arglist, argtmp);
 621           }
 622         if( arglist[0] == '(' )
 623           {
 624             strcat(arglist, ")");
 625           }
 626       }
 627
 628     if( (nearest->sourcefile != NULL) && (flag == TRUE)
 629         && (addr->off - nearest->addr.off < 0x100000) )
 630       {
 631
 632         /*
 633          * Try and find the nearest line number to the current offset.
 634          */
 635         if( nearest->linetab != NULL )
 636         {
 637             low = 0;
 638             high = nearest->n_lines;
 639             while ((high - low) > 1)
 640             {
 641                 mid = (high + low) / 2;
 642                 if (addr->off < nearest->linetab[mid].pc_offset.off)
 643                     high = mid;
 644                 else
 645                     low = mid;
 646             }
 647             lineno = nearest->linetab[low].line_number;
 648         }
 649
 650         if( lineno != -1 )
 651           {
 652             sprintf(linebuff, ":%d", lineno);
 653             lineinfo = linebuff;
 654             if( source != NULL )
 655               {
 656                 source->line = lineno;
 657               }
 658           }
 659
 660         /* Remove the path from the file name */
 661         sourcefile = strrchr( nearest->sourcefile, '/' );
 662         if (!sourcefile) sourcefile = nearest->sourcefile;
 663         else sourcefile++;
 664
 665         if (addr->off == nearest->addr.off)
 666           sprintf( name_buffer, "%s%s [%s%s]", nearest->name,
 667                    arglist, sourcefile, lineinfo);
 668         else
 669           sprintf( name_buffer, "%s+0x%lx%s [%s%s]", nearest->name,
 670                    addr->off - nearest->addr.off,
 671                    arglist, sourcefile, lineinfo );
 672       }
 673     else
 674       {
 675         if (addr->off == nearest->addr.off)
 676           sprintf( name_buffer, "%s%s", nearest->name, arglist);
 677         else {
 678           if (addr->seg && (nearest->addr.seg!=addr->seg))
 679               return NULL;
 680           else
 681               sprintf( name_buffer, "%s+0x%lx%s", nearest->name,
 682                        addr->off - nearest->addr.off, arglist);
 683         }
 684       }
 685     return name_buffer;
 686 }
 687
 688
 689 /***********************************************************************
 690  *           DEBUG_ReadSymbolTable
 691  *
 692  * Read a symbol file into the hash table.
 693  */
 694 void DEBUG_ReadSymbolTable( const char * filename )
 695 {
 696     FILE * symbolfile;
 697     DBG_ADDR addr = { 0, 0 };
 698     int nargs;
 699     char type;
 700     char * cpnt;
 701     char buffer[256];
 702     char name[256];
 703
 704     if (!(symbolfile = fopen(filename, "r")))
 705     {
 706         fprintf( stderr, "Unable to open symbol table %s\n", filename );
 707         return;
 708     }
 709
 710     fprintf( stderr, "Reading symbols from file %s\n", filename );
 711
 712     while (1)
 713     {
 714         fgets( buffer, sizeof(buffer), symbolfile );
 715         if (feof(symbolfile)) break;
 716
 717         /* Strip any text after a # sign (i.e. comments) */
 718         cpnt = buffer;
 719         while (*cpnt)
 720             if(*cpnt++ == '#') { *cpnt = 0; break; }
 721
 722         /* Quietly ignore any lines that have just whitespace */
 723         cpnt = buffer;
 724         while(*cpnt)
 725         {
 726             if(*cpnt != ' ' && *cpnt != '\t') break;
 727             cpnt++;
 728         }
 729         if (!(*cpnt) || *cpnt == '\n') continue;
 730
 731         nargs = sscanf(buffer, "%lx %c %s", &addr.off, &type, name);
 732         DEBUG_AddSymbol( name, &addr, NULL, SYM_WINE );
 733     }
 734     fclose(symbolfile);
 735 }
 736
 737
 738 /***********************************************************************
 739  *           DEBUG_LoadEntryPoints16
 740  *
 741  * Load the entry points of a Win16 module into the hash table.
 742  */
 743 static void DEBUG_LoadEntryPoints16( HMODULE16 hModule, NE_MODULE *pModule,
 744                                      const char *name )
 745 {
 746     DBG_ADDR addr;
 747     char buffer[256];
 748     FARPROC16 address;
 749
 750     /* First search the resident names */
 751
 752     unsigned char *cpnt = (unsigned char *)pModule + pModule->name_table;
 753     while (*cpnt)
 754     {
 755         cpnt += *cpnt + 1 + sizeof(WORD);
 756         sprintf( buffer, "%s.%.*s", name, *cpnt, cpnt + 1 );
 757         if ((address = MODULE_GetEntryPoint( hModule,
 758                                              *(WORD *)(cpnt + *cpnt + 1) )))
 759         {
 760             addr.seg = HIWORD(address);
 761             addr.off = LOWORD(address);
 762             addr.type = NULL;
 763             DEBUG_AddSymbol( buffer, &addr, NULL, SYM_WIN32 | SYM_FUNC );
 764         }
 765     }
 766
 767     /* Now search the non-resident names table */
 768
 769     if (!pModule->nrname_handle) return;  /* No non-resident table */
 770     cpnt = (char *)GlobalLock16( pModule->nrname_handle );
 771     while (*cpnt)
 772     {
 773         cpnt += *cpnt + 1 + sizeof(WORD);
 774         sprintf( buffer, "%s.%.*s", name, *cpnt, cpnt + 1 );
 775         if ((address = MODULE_GetEntryPoint( hModule,
 776                                              *(WORD *)(cpnt + *cpnt + 1) )))
 777         {
 778             addr.seg = HIWORD(address);
 779             addr.off = LOWORD(address);
 780             addr.type = NULL;
 781             DEBUG_AddSymbol( buffer, &addr, NULL, SYM_WIN32 | SYM_FUNC );
 782         }
 783     }
 784 }
 785
 786
 787 /***********************************************************************
 788  *           DEBUG_LoadEntryPoints32
 789  *
 790  * Load the entry points of a Win32 module into the hash table.
 791  */
 792 static void DEBUG_LoadEntryPoints32( HMODULE32 hModule, const char *name )
 793 {
 794 #define RVA(x) (hModule+(DWORD)(x))
 795
 796     DBG_ADDR addr;
 797     char buffer[256];
 798     int i, j;
 799     IMAGE_SECTION_HEADER *pe_seg;
 800     IMAGE_EXPORT_DIRECTORY *exports;
 801     IMAGE_DATA_DIRECTORY *debug_dir;
 802     WORD *ordinals;
 803     void **functions;
 804     const char **names;
 805
 806     PE_MODREF *pem = pCurrentProcess->modref_list;
 807     while (pem && (pem->module != hModule)) pem = pem->next;
 808     if (!pem) return;
 809     exports = pem->pe_export;
 810
 811     addr.seg = 0;
 812     addr.type = NULL;
 813
 814     /* Add start of DLL */
 815
 816     addr.off = hModule;
 817     DEBUG_AddSymbol( name, &addr, NULL, SYM_WIN32 | SYM_FUNC );
 818
 819     /* Add entry point */
 820
 821     sprintf( buffer, "%s.EntryPoint", name );
 822     addr.off = (DWORD)RVA_PTR( hModule, OptionalHeader.AddressOfEntryPoint );
 823     DEBUG_AddSymbol( buffer, &addr, NULL, SYM_WIN32 | SYM_FUNC );
 824
 825     /* Add start of sections */
 826
 827     pe_seg = PE_SECTIONS(hModule);
 828     for (i = 0; i < PE_HEADER(hModule)->FileHeader.NumberOfSections; i++)
 829     {
 830         sprintf( buffer, "%s.%s", name, pe_seg->Name );
 831         addr.off = RVA(pe_seg->VirtualAddress );
 832         DEBUG_AddSymbol( buffer, &addr, NULL, SYM_WIN32 | SYM_FUNC );
 833         pe_seg++;
 834     }
 835
 836     /* Add exported functions */
 837
 838     if (!exports) return;
 839     ordinals  = (WORD *)RVA( exports->AddressOfNameOrdinals );
 840     names     = (const char **)RVA( exports->AddressOfNames );
 841     functions = (void **)RVA( exports->AddressOfFunctions );
 842
 843     for (i = 0; i < exports->NumberOfNames; i++)
 844     {
 845         if (!names[i]) continue;
 846         sprintf( buffer, "%s.%s", name, (char *)RVA(names[i]) );
 847         addr.off = RVA( functions[ordinals[i]] );
 848         DEBUG_AddSymbol( buffer, &addr, NULL, SYM_WIN32 | SYM_FUNC );
 849     }
 850
 851     for (i = 0; i < exports->NumberOfFunctions; i++)
 852     {
 853         if (!functions[i]) continue;
 854         /* Check if we already added it with a name */
 855         for (j = 0; j < exports->NumberOfNames; j++)
 856             if ((ordinals[j] == i) && names[j]) break;
 857         if (j < exports->NumberOfNames) continue;
 858         sprintf( buffer, "%s.%ld", name, i + exports->Base );
 859         addr.off = (DWORD)RVA( functions[i] );
 860         DEBUG_AddSymbol( buffer, &addr, NULL, SYM_WIN32 | SYM_FUNC );
 861     }
 862
 863     debug_dir = &PE_HEADER(hModule)->OptionalHeader.DataDirectory[IMAGE_DIRECTORY_ENTRY_DEBUG];
 864     if (debug_dir->Size)
 865         DEBUG_RegisterDebugInfo( hModule, name,
 866                                  debug_dir->VirtualAddress, debug_dir->Size );
 867 #undef RVA
 868 }
 869
 870
 871 /***********************************************************************
 872  *           DEBUG_LoadEntryPoints
 873  *
 874  * Load the entry points of all the modules into the hash table.
 875  */
 876 void DEBUG_LoadEntryPoints(void)
 877 {
 878     MODULEENTRY entry;
 879     NE_MODULE *pModule;
 880     BOOL32 ok;
 881
 882     for (ok = ModuleFirst(&entry); ok; ok = ModuleNext(&entry))
 883     {
 884         if (!(pModule = MODULE_GetPtr( entry.hModule ))) continue;
 885         fprintf( stderr, " %s", entry.szModule );
 886
 887         if (pModule->flags & NE_FFLAGS_WIN32)  /* PE module */
 888             DEBUG_LoadEntryPoints32( pModule->module32, entry.szModule );
 889         else  /* NE module */
 890             DEBUG_LoadEntryPoints16( entry.hModule, pModule, entry.szModule );
 891     }
 892 }
 893
 894
 895 void
 896 DEBUG_AddLineNumber( struct name_hash * func, int line_num,
 897                      unsigned long offset )
 898 {
 899   if( func == NULL )
 900     {
 901       return;
 902     }
 903
 904   if( func->n_lines + 1 >= func->lines_alloc )
 905     {
 906       func->lines_alloc += 64;
 907       func->linetab = xrealloc(func->linetab,
 908                               func->lines_alloc * sizeof(WineLineNo));
 909     }
 910
 911   func->linetab[func->n_lines].line_number = line_num;
 912   func->linetab[func->n_lines].pc_offset.seg = func->addr.seg;
 913   func->linetab[func->n_lines].pc_offset.off = func->addr.off + offset;
 914   func->linetab[func->n_lines].pc_offset.type = NULL;
 915   func->n_lines++;
 916 }
 917
 918
 919 struct wine_locals *
 920 DEBUG_AddLocal( struct name_hash * func, int regno,
 921                 int offset,
 922                 int pc_start,
 923                 int pc_end,
 924                 char * name)
 925 {
 926   if( func == NULL )
 927     {
 928       return NULL;
 929     }
 930
 931   if( func->n_locals + 1 >= func->locals_alloc )
 932     {
 933       func->locals_alloc += 32;
 934       func->local_vars = xrealloc(func->local_vars,
 935                               func->locals_alloc * sizeof(WineLocals));
 936     }
 937
 938   func->local_vars[func->n_locals].regno = regno;
 939   func->local_vars[func->n_locals].offset = offset;
 940   func->local_vars[func->n_locals].pc_start = pc_start;
 941   func->local_vars[func->n_locals].pc_end = pc_end;
 942   func->local_vars[func->n_locals].name = xstrdup(name);
 943   func->local_vars[func->n_locals].type = NULL;
 944   func->n_locals++;
 945
 946   return &func->local_vars[func->n_locals - 1];
 947 }
 948
 949 void
 950 DEBUG_DumpHashInfo()
 951 {
 952   int i;
 953   int depth;
 954   struct name_hash *nh;
 955
 956   /*
 957    * Utility function to dump stats about the hash table.
 958    */
 959     for(i=0; i<NR_NAME_HASH; i++)
 960     {
 961       depth = 0;
 962       for (nh = name_hash_table[i]; nh; nh = nh->next)
 963         {
 964           depth++;
 965         }
 966       fprintf(stderr, "Bucket %d: %d\n", i, depth);
 967     }
 968 }
 969
 970 /***********************************************************************
 971  *           DEBUG_CheckLinenoStatus
 972  *
 973  * Find the symbol nearest to a given address.
 974  * If ebp is specified as non-zero, it means we should dump the argument
 975  * list into the string we return as well.
 976  */
 977 int DEBUG_CheckLinenoStatus( const DBG_ADDR *addr)
 978 {
 979     struct name_hash * nearest = NULL;
 980     int mid, high, low;
 981
 982     if( sortlist_valid == FALSE )
 983       {
 984         DEBUG_ResortSymbols();
 985       }
 986
 987     /*
 988      * Binary search to find closest symbol.
 989      */
 990     low = 0;
 991     high = sorttab_nsym;
 992     if( addr_sorttab[0]->addr.seg > addr->seg
 993         || (   addr_sorttab[0]->addr.seg == addr->seg
 994             && addr_sorttab[0]->addr.off > addr->off) )
 995       {
 996         nearest = NULL;
 997       }
 998     else if( addr_sorttab[high - 1]->addr.seg < addr->seg
 999         || (   addr_sorttab[high - 1]->addr.seg == addr->seg
1000             && addr_sorttab[high - 1]->addr.off < addr->off) )
1001       {
1002         nearest = addr_sorttab[high - 1];
1003       }
1004     else
1005       {
1006         while(1==1)
1007           {
1008             mid = (high + low)/2;
1009             if( mid == low )
1010               {
1011                 /*
1012                  * See if there are any other entries that might also
1013                  * have the same address, and would also have a line
1014                  * number table.
1015                  */
1016                 if( mid > 0 && addr_sorttab[mid]->linetab == NULL )
1017                   {
1018                     if(    (addr_sorttab[mid - 1]->addr.seg ==
1019                             addr_sorttab[mid]->addr.seg)
1020                         && (addr_sorttab[mid - 1]->addr.off ==
1021                             addr_sorttab[mid]->addr.off)
1022                         && (addr_sorttab[mid - 1]->linetab != NULL) )
1023                       {
1024                         mid--;
1025                       }
1026                   }
1027
1028                 if(    (mid < sorttab_nsym - 1)
1029                     && (addr_sorttab[mid]->linetab == NULL) )
1030                   {
1031                     if(    (addr_sorttab[mid + 1]->addr.seg ==
1032                             addr_sorttab[mid]->addr.seg)
1033                         && (addr_sorttab[mid + 1]->addr.off ==
1034                             addr_sorttab[mid]->addr.off)
1035                         && (addr_sorttab[mid + 1]->linetab != NULL) )
1036                       {
1037                         mid++;
1038                       }
1039                   }
1040                 nearest = addr_sorttab[mid];
1041 #if 0
1042                 fprintf(stderr, "Found %x:%x when looking for %x:%x %x %s\n",
1043                         addr_sorttab[mid ]->addr.seg,
1044                         addr_sorttab[mid ]->addr.off,
1045                         addr->seg, addr->off,
1046                         addr_sorttab[mid ]->linetab,
1047                         addr_sorttab[mid ]->name);
1048 #endif
1049                 break;
1050               }
1051             if(    (addr_sorttab[mid]->addr.seg < addr->seg)
1052                 || (   addr_sorttab[mid]->addr.seg == addr->seg
1053                     && addr_sorttab[mid]->addr.off <= addr->off) )
1054               {
1055                 low = mid;
1056               }
1057             else
1058               {
1059                 high = mid;
1060               }
1061           }
1062       }
1063
1064     if (!nearest) return FUNC_HAS_NO_LINES;
1065
1066     if( nearest->flags & SYM_STEP_THROUGH )
1067       {
1068         /*
1069          * This will cause us to keep single stepping until
1070          * we get to the other side somewhere.
1071          */
1072         return NOT_ON_LINENUMBER;
1073       }
1074
1075     if( (nearest->flags & SYM_TRAMPOLINE) )
1076       {
1077         /*
1078          * This will cause us to keep single stepping until
1079          * we get to the other side somewhere.
1080          */
1081         return FUNC_IS_TRAMPOLINE;
1082       }
1083
1084     if( nearest->linetab == NULL )
1085       {
1086         return FUNC_HAS_NO_LINES;
1087       }
1088
1089
1090     /*
1091      * We never want to stop on the first instruction of a function
1092      * even if it has it's own linenumber.  Let the thing keep running
1093      * until it gets past the function prologue.  We only do this if there
1094      * is more than one line number for the function, of course.
1095      */
1096     if( nearest->addr.off == addr->off && nearest->n_lines > 1 )
1097       {
1098         return NOT_ON_LINENUMBER;
1099       }
1100
1101     if( (nearest->sourcefile != NULL)
1102         && (addr->off - nearest->addr.off < 0x100000) )
1103       {
1104           low = 0;
1105           high = nearest->n_lines;
1106           while ((high - low) > 1)
1107           {
1108               mid = (high + low) / 2;
1109               if (addr->off < nearest->linetab[mid].pc_offset.off) high = mid;
1110               else low = mid;
1111           }
1112           if (addr->off == nearest->linetab[low].pc_offset.off)
1113               return AT_LINENUMBER;
1114           else
1115               return NOT_ON_LINENUMBER;
1116       }
1117
1118     return FUNC_HAS_NO_LINES;
1119 }
1120
1121 /***********************************************************************
1122  *           DEBUG_GetFuncInfo
1123  *
1124  * Find the symbol nearest to a given address.
1125  * Returns sourcefile name and line number in a format that the listing
1126  * handler can deal with.
1127  */
1128 void
1129 DEBUG_GetFuncInfo( struct list_id * ret, const char * filename,
1130                    const char * name)
1131 {
1132     char buffer[256];
1133     char * pnt;
1134     struct name_hash *nh;
1135
1136     for(nh = name_hash_table[name_hash(name)]; nh; nh = nh->next)
1137       {
1138         if( filename != NULL )
1139           {
1140
1141             if( nh->sourcefile == NULL )
1142               {
1143                 continue;
1144               }
1145
1146             pnt = strrchr(nh->sourcefile, '/');
1147             if( strcmp(nh->sourcefile, filename) != 0
1148                 && (pnt == NULL || strcmp(pnt + 1, filename) != 0) )
1149               {
1150                 continue;
1151               }
1152           }
1153         if (!strcmp(nh->name, name)) break;
1154       }
1155
1156     if (!nh && (name[0] != '_'))
1157     {
1158         buffer[0] = '_';
1159         strcpy(buffer+1, name);
1160         for(nh = name_hash_table[name_hash(buffer)]; nh; nh = nh->next)
1161           {
1162             if( filename != NULL )
1163               {
1164                 if( nh->sourcefile == NULL )
1165                   {
1166                     continue;
1167                   }
1168
1169                 pnt = strrchr(nh->sourcefile, '/');
1170                 if( strcmp(nh->sourcefile, filename) != 0
1171                     && (pnt == NULL || strcmp(pnt + 1, filename) != 0) )
1172                   {
1173                     continue;
1174                   }
1175               }
1176             if (!strcmp(nh->name, buffer)) break;
1177           }
1178     }
1179
1180     if( !nh )
1181       {
1182         if( filename != NULL )
1183           {
1184             fprintf(stderr, "No such function %s in %s\n", name, filename);
1185           }
1186         else
1187           {
1188             fprintf(stderr, "No such function %s\n", name);
1189           }
1190         ret->sourcefile = NULL;
1191         ret->line = -1;
1192         return;
1193       }
1194
1195     ret->sourcefile = nh->sourcefile;
1196
1197     /*
1198      * Search for the specific line number.  If we don't find it,
1199      * then return FALSE.
1200      */
1201     if( nh->linetab == NULL )
1202       {
1203         ret->line = -1;
1204       }
1205     else
1206       {
1207         ret->line = nh->linetab[0].line_number;
1208       }
1209 }
1210
1211 /***********************************************************************
1212  *           DEBUG_GetStackSymbolValue
1213  *
1214  * Get the address of a named symbol from the current stack frame.
1215  */
1216 static
1217 BOOL32 DEBUG_GetStackSymbolValue( const char * name, DBG_ADDR *addr )
1218 {
1219   struct name_hash * curr_func;
1220   unsigned int       ebp;
1221   unsigned int       eip;
1222   int                i;
1223
1224   if( DEBUG_GetCurrentFrame(&curr_func, &eip, &ebp) == FALSE )
1225     {
1226       return FALSE;
1227     }
1228
1229   for(i=0; i < curr_func->n_locals; i++ )
1230     {
1231       /*
1232        * Test the range of validity of the local variable.  This
1233        * comes up with RBRAC/LBRAC stabs in particular.
1234        */
1235       if(    (curr_func->local_vars[i].pc_start != 0)
1236           && ((eip - curr_func->addr.off)
1237               < curr_func->local_vars[i].pc_start) )
1238         {
1239           continue;
1240         }
1241
1242       if(    (curr_func->local_vars[i].pc_end != 0)
1243           && ((eip - curr_func->addr.off)
1244               > curr_func->local_vars[i].pc_end) )
1245         {
1246           continue;
1247         }
1248
1249       if( strcmp(name, curr_func->local_vars[i].name) == 0 )
1250         {
1251           /*
1252            * OK, we found it.  Now figure out what to do with this.
1253            */
1254           if( curr_func->local_vars[i].regno != 0 )
1255             {
1256               /*
1257                * Register variable.  We don't know how to treat
1258                * this yet.
1259                */
1260               return FALSE;
1261             }
1262
1263           addr->seg = 0;
1264           addr->off = ebp + curr_func->local_vars[i].offset;
1265           addr->type = curr_func->local_vars[i].type;
1266
1267           return TRUE;
1268         }
1269     }
1270   return FALSE;
1271 }
1272
1273 int
1274 DEBUG_InfoLocals()
1275 {
1276   struct name_hash  * curr_func;
1277   unsigned int        ebp;
1278   unsigned int        eip;
1279   int                 i;
1280   unsigned int      * ptr;
1281   int                 rtn = FALSE;
1282
1283   if( DEBUG_GetCurrentFrame(&curr_func, &eip, &ebp) == FALSE )
1284     {
1285       return FALSE;
1286     }
1287
1288   for(i=0; i < curr_func->n_locals; i++ )
1289     {
1290       /*
1291        * Test the range of validity of the local variable.  This
1292        * comes up with RBRAC/LBRAC stabs in particular.
1293        */
1294       if(    (curr_func->local_vars[i].pc_start != 0)
1295           && ((eip - curr_func->addr.off)
1296               < curr_func->local_vars[i].pc_start) )
1297         {
1298           continue;
1299         }
1300
1301       if(    (curr_func->local_vars[i].pc_end != 0)
1302           && ((eip - curr_func->addr.off)
1303               > curr_func->local_vars[i].pc_end) )
1304         {
1305           continue;
1306         }
1307
1308       if( curr_func->local_vars[i].offset == 0 )
1309         {
1310           fprintf(stderr, "%s:%s optimized into register $%s \n",
1311                   curr_func->name, curr_func->local_vars[i].name,
1312                   reg_name[curr_func->local_vars[i].regno]);
1313         }
1314       else
1315         {
1316           ptr = (unsigned int *) (ebp + curr_func->local_vars[i].offset);
1317           fprintf(stderr, "%s:%s == 0x%8.8x\n",
1318                   curr_func->name, curr_func->local_vars[i].name,
1319                   *ptr);
1320         }
1321     }
1322
1323   rtn = TRUE;
1324
1325   return (rtn);
1326 }
1327
1328 int
1329 DEBUG_SetSymbolSize(struct name_hash * sym, unsigned int len)
1330 {
1331   sym->symbol_size = len;
1332
1333   return TRUE;
1334 }
1335
1336 int
1337 DEBUG_SetSymbolBPOff(struct name_hash * sym, unsigned int off)
1338 {
1339   sym->breakpoint_offset = off;
1340
1341   return TRUE;
1342 }
1343
1344 int
1345 DEBUG_GetSymbolAddr(struct name_hash * sym, DBG_ADDR * addr)
1346 {
1347
1348   *addr = sym->addr;
1349
1350   return TRUE;
1351 }
1352
1353 int DEBUG_SetLocalSymbolType(struct wine_locals * sym, struct datatype * type)
1354 {
1355   sym->type = type;
1356
1357   return TRUE;
1358 }