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 "selectors.h"
  16 #include "debugger.h"
  17 #include "toolhelp.h"
  18 #include "xmalloc.h"
  19
  20 #define NR_NAME_HASH 16384
  21 #ifndef PATH_MAX
  22 #define PATH_MAX _MAX_PATH
  23 #endif
  24
  25 static char * reg_name[] =
  26 {
  27   "eax", "ecx", "edx", "ebx", "esp", "ebp", "esi", "edi"
  28 };
  29
  30
  31 struct name_hash
  32 {
  33     struct name_hash * next;            /* Used to look up within name hash */
  34     char *             name;
  35     char *             sourcefile;
  36
  37     int                n_locals;
  38     int                locals_alloc;
  39     WineLocals       * local_vars;
  40
  41     int                n_lines;
  42     int                lines_alloc;
  43     WineLineNo       * linetab;
  44
  45     DBG_ADDR           addr;
  46     unsigned short     flags;
  47     unsigned short     breakpoint_offset;
  48     unsigned int       symbol_size;
  49 };
  50
  51
  52 static BOOL32 DEBUG_GetStackSymbolValue( const char * name, DBG_ADDR *addr );
  53 static int sortlist_valid = FALSE;
  54
  55 static int sorttab_nsym;
  56 static struct name_hash ** addr_sorttab = NULL;
  57
  58 static struct name_hash * name_hash_table[NR_NAME_HASH];
  59
  60 static unsigned int name_hash( const char * name )
  61 {
  62     unsigned int hash = 0;
  63     unsigned int tmp;
  64     const char * p;
  65
  66     p = name;
  67
  68     while (*p)
  69       {
  70         hash = (hash << 4) + *p++;
  71
  72         if( (tmp = (hash & 0xf0000000)) )
  73           {
  74             hash ^= tmp >> 24;
  75           }
  76         hash &= ~tmp;
  77       }
  78     return hash % NR_NAME_HASH;
  79 }
  80
  81 int
  82 DEBUG_cmp_sym(const void * p1, const void * p2)
  83 {
  84   struct name_hash ** name1 = (struct name_hash **) p1;
  85   struct name_hash ** name2 = (struct name_hash **) p2;
  86
  87   if( ((*name1)->flags & SYM_INVALID) != 0 )
  88     {
  89       return -1;
  90     }
  91
  92   if( ((*name2)->flags & SYM_INVALID) != 0 )
  93     {
  94       return 1;
  95     }
  96
  97   if( (*name1)->addr.seg > (*name2)->addr.seg )
  98     {
  99       return 1;
 100     }
 101
 102   if( (*name1)->addr.seg < (*name2)->addr.seg )
 103     {
 104       return -1;
 105     }
 106
 107   if( (*name1)->addr.off > (*name2)->addr.off )
 108     {
 109       return 1;
 110     }
 111
 112   if( (*name1)->addr.off < (*name2)->addr.off )
 113     {
 114       return -1;
 115     }
 116
 117   return 0;
 118 }
 119
 120 /***********************************************************************
 121  *           DEBUG_ResortSymbols
 122  *
 123  * Rebuild sorted list of symbols.
 124  */
 125 static
 126 void
 127 DEBUG_ResortSymbols()
 128 {
 129     struct name_hash *nh;
 130     int         nsym = 0;
 131     int         i;
 132
 133     for(i=0; i<NR_NAME_HASH; i++)
 134     {
 135         for (nh = name_hash_table[i]; nh; nh = nh->next)
 136           {
 137             nsym++;
 138           }
 139     }
 140
 141     sorttab_nsym = nsym;
 142     if( nsym == 0 )
 143       {
 144         return;
 145       }
 146
 147     addr_sorttab = (struct name_hash **) xrealloc(addr_sorttab,
 148                                          nsym * sizeof(struct name_hash *));
 149
 150     nsym = 0;
 151     for(i=0; i<NR_NAME_HASH; i++)
 152     {
 153         for (nh = name_hash_table[i]; nh; nh = nh->next)
 154           {
 155             addr_sorttab[nsym++] = nh;
 156           }
 157     }
 158
 159     qsort(addr_sorttab, nsym,
 160           sizeof(struct name_hash *), DEBUG_cmp_sym);
 161     sortlist_valid = TRUE;
 162
 163 }
 164
 165 /***********************************************************************
 166  *           DEBUG_AddSymbol
 167  *
 168  * Add a symbol to the table.
 169  */
 170 struct name_hash *
 171 DEBUG_AddSymbol( const char * name, const DBG_ADDR *addr, const char * source,
 172                  int flags)
 173 {
 174     struct name_hash  * new;
 175     struct name_hash *nh;
 176     static char  prev_source[PATH_MAX] = {'\0', };
 177     static char * prev_duped_source = NULL;
 178     char * c;
 179     int hash;
 180
 181     hash = name_hash(name);
 182     for (nh = name_hash_table[hash]; nh; nh = nh->next)
 183     {
 184         if( ((nh->flags & SYM_INVALID) != 0) && strcmp(name, nh->name) == 0 )
 185         {
 186             nh->addr.off = addr->off;
 187             nh->addr.seg = addr->seg;
 188             if( nh->addr.type == NULL && addr->type != NULL )
 189             {
 190                 nh->addr.type = addr->type;
 191             }
 192             nh->flags &= ~SYM_INVALID;
 193             return nh;
 194         }
 195         if (nh->addr.seg == addr->seg &&
 196             nh->addr.off == addr->off &&
 197             strcmp(name, nh->name) == 0 )
 198         {
 199             return nh;
 200         }
 201     }
 202
 203     /*
 204      * First see if we already have an entry for this symbol.  If so
 205      * return it, so we don't end up with duplicates.
 206      */
 207
 208     new = (struct name_hash *) xmalloc(sizeof(struct name_hash));
 209     new->addr = *addr;
 210     new->name = xstrdup(name);
 211
 212     if( source != NULL )
 213       {
 214         /*
 215          * This is an enhancement to reduce memory consumption.  The idea
 216          * is that we duplicate a given string only once.  This is a big
 217          * win if there are lots of symbols defined in a given source file.
 218          */
 219         if( strcmp(source, prev_source) == 0 )
 220           {
 221             new->sourcefile = prev_duped_source;
 222           }
 223         else
 224           {
 225             strcpy(prev_source, source);
 226             prev_duped_source = new->sourcefile = xstrdup(source);
 227           }
 228       }
 229     else
 230       {
 231         new->sourcefile = NULL;
 232       }
 233
 234     new->n_lines        = 0;
 235     new->lines_alloc    = 0;
 236     new->linetab        = NULL;
 237
 238     new->n_locals       = 0;
 239     new->locals_alloc   = 0;
 240     new->local_vars     = NULL;
 241
 242     new->flags          = flags;
 243     new->next           = NULL;
 244
 245     /* Now insert into the hash table */
 246     new->next = name_hash_table[hash];
 247     name_hash_table[hash] = new;
 248
 249     /*
 250      * Check some heuristics based upon the file name to see whether
 251      * we want to step through this guy or not.  These are machine generated
 252      * assembly files that are used to translate between the MS way of
 253      * calling things and the GCC way of calling things.  In general we
 254      * always want to step through.
 255      */
 256     if( source != NULL )
 257       {
 258         c = strrchr(source, '.');
 259         if( c != NULL && strcmp(c, ".s") == 0 )
 260           {
 261             c = strrchr(source, '/');
 262             if( c != NULL )
 263               {
 264                 c++;
 265                 if(    (strcmp(c, "callfrom16.s") == 0)
 266                     || (strcmp(c, "callto16.s") == 0)
 267                     || (strcmp(c, "callfrom32.s") == 0)
 268                     || (strcmp(c, "callto32.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             /*
 638              * FIXME - this is an inefficient linear search.  A binary
 639              * search would be better if this gets to be a performance
 640              * bottleneck.
 641              */
 642             for(i=0; i < nearest->n_lines; i++)
 643               {
 644                 if( addr->off < nearest->linetab[i].pc_offset.off )
 645                 {
 646                   break;
 647                 }
 648                 lineno = nearest->linetab[i].line_number;
 649               }
 650           }
 651
 652         if( lineno != -1 )
 653           {
 654             sprintf(linebuff, ":%d", lineno);
 655             lineinfo = linebuff;
 656             if( source != NULL )
 657               {
 658                 source->line = lineno;
 659               }
 660           }
 661
 662         /* Remove the path from the file name */
 663         sourcefile = strrchr( nearest->sourcefile, '/' );
 664         if (!sourcefile) sourcefile = nearest->sourcefile;
 665         else sourcefile++;
 666
 667         if (addr->off == nearest->addr.off)
 668           sprintf( name_buffer, "%s%s [%s%s]", nearest->name,
 669                    arglist, sourcefile, lineinfo);
 670         else
 671           sprintf( name_buffer, "%s+0x%lx%s [%s%s]", nearest->name,
 672                    addr->off - nearest->addr.off,
 673                    arglist, sourcefile, lineinfo );
 674       }
 675     else
 676       {
 677         if (addr->off == nearest->addr.off)
 678           sprintf( name_buffer, "%s%s", nearest->name, arglist);
 679         else
 680           sprintf( name_buffer, "%s+0x%lx%s", nearest->name,
 681                    addr->off - nearest->addr.off, arglist);
 682       }
 683     return name_buffer;
 684 }
 685
 686
 687 /***********************************************************************
 688  *           DEBUG_ReadSymbolTable
 689  *
 690  * Read a symbol file into the hash table.
 691  */
 692 void DEBUG_ReadSymbolTable( const char * filename )
 693 {
 694     FILE * symbolfile;
 695     DBG_ADDR addr = { 0, 0 };
 696     int nargs;
 697     char type;
 698     char * cpnt;
 699     char buffer[256];
 700     char name[256];
 701
 702     if (!(symbolfile = fopen(filename, "r")))
 703     {
 704         fprintf( stderr, "Unable to open symbol table %s\n", filename );
 705         return;
 706     }
 707
 708     fprintf( stderr, "Reading symbols from file %s\n", filename );
 709
 710     while (1)
 711     {
 712         fgets( buffer, sizeof(buffer), symbolfile );
 713         if (feof(symbolfile)) break;
 714
 715         /* Strip any text after a # sign (i.e. comments) */
 716         cpnt = buffer;
 717         while (*cpnt)
 718             if(*cpnt++ == '#') { *cpnt = 0; break; }
 719
 720         /* Quietly ignore any lines that have just whitespace */
 721         cpnt = buffer;
 722         while(*cpnt)
 723         {
 724             if(*cpnt != ' ' && *cpnt != '\t') break;
 725             cpnt++;
 726         }
 727         if (!(*cpnt) || *cpnt == '\n') continue;
 728
 729         nargs = sscanf(buffer, "%lx %c %s", &addr.off, &type, name);
 730         DEBUG_AddSymbol( name, &addr, NULL, SYM_WINE );
 731     }
 732     fclose(symbolfile);
 733 }
 734
 735
 736 /***********************************************************************
 737  *           DEBUG_LoadEntryPoints
 738  *
 739  * Load the entry points of all the modules into the hash table.
 740  */
 741 void DEBUG_LoadEntryPoints(void)
 742 {
 743     MODULEENTRY entry;
 744     NE_MODULE *pModule;
 745     DBG_ADDR addr;
 746     char buffer[256];
 747     unsigned char *cpnt, *name;
 748     FARPROC16 address;
 749     BOOL32 ok;
 750
 751     for (ok = ModuleFirst(&entry); ok; ok = ModuleNext(&entry))
 752     {
 753         if (!(pModule = MODULE_GetPtr( entry.hModule ))) continue;
 754         if (pModule->flags & NE_FFLAGS_WIN32) continue;
 755
 756         name = (unsigned char *)pModule + pModule->name_table;
 757
 758         fprintf( stderr, " %.*s",*name, name + 1 );
 759
 760         /* First search the resident names */
 761
 762         cpnt = (unsigned char *)pModule + pModule->name_table;
 763         while (*cpnt)
 764         {
 765             cpnt += *cpnt + 1 + sizeof(WORD);
 766             sprintf( buffer, "%.*s_%.*s", *name, name + 1, *cpnt, cpnt + 1 );
 767             if ((address = MODULE_GetEntryPoint( entry.hModule,
 768                                             *(WORD *)(cpnt + *cpnt + 1) )))
 769             {
 770                 addr.seg = HIWORD(address);
 771                 addr.off = LOWORD(address);
 772                 addr.type = NULL;
 773                 DEBUG_AddSymbol( buffer, &addr, NULL, SYM_WIN32 | SYM_FUNC );
 774             }
 775         }
 776
 777         /* Now search the non-resident names table */
 778
 779         if (!pModule->nrname_handle) continue;  /* No non-resident table */
 780         cpnt = (char *)GlobalLock16( pModule->nrname_handle );
 781         while (*cpnt)
 782         {
 783             cpnt += *cpnt + 1 + sizeof(WORD);
 784             sprintf( buffer, "%.*s_%.*s", *name, name + 1, *cpnt, cpnt + 1 );
 785             if ((address = MODULE_GetEntryPoint( entry.hModule,
 786                                                 *(WORD *)(cpnt + *cpnt + 1) )))
 787             {
 788                 addr.seg = HIWORD(address);
 789                 addr.off = LOWORD(address);
 790                 addr.type = NULL;
 791                 DEBUG_AddSymbol( buffer, &addr, NULL, SYM_WIN32);
 792             }
 793         }
 794     }
 795 }
 796
 797 void
 798 DEBUG_AddLineNumber( struct name_hash * func, int line_num,
 799                      unsigned long offset )
 800 {
 801   if( func == NULL )
 802     {
 803       return;
 804     }
 805
 806   if( func->n_lines + 1 >= func->lines_alloc )
 807     {
 808       func->lines_alloc += 64;
 809       func->linetab = xrealloc(func->linetab,
 810                               func->lines_alloc * sizeof(WineLineNo));
 811     }
 812
 813   func->linetab[func->n_lines].line_number = line_num;
 814   func->linetab[func->n_lines].pc_offset.seg = func->addr.seg;
 815   func->linetab[func->n_lines].pc_offset.off = func->addr.off + offset;
 816   func->linetab[func->n_lines].pc_offset.type = NULL;
 817   func->n_lines++;
 818 }
 819
 820
 821 struct wine_locals *
 822 DEBUG_AddLocal( struct name_hash * func, int regno,
 823                 int offset,
 824                 int pc_start,
 825                 int pc_end,
 826                 char * name)
 827 {
 828   if( func == NULL )
 829     {
 830       return NULL;
 831     }
 832
 833   if( func->n_locals + 1 >= func->locals_alloc )
 834     {
 835       func->locals_alloc += 32;
 836       func->local_vars = xrealloc(func->local_vars,
 837                               func->locals_alloc * sizeof(WineLocals));
 838     }
 839
 840   func->local_vars[func->n_locals].regno = regno;
 841   func->local_vars[func->n_locals].offset = offset;
 842   func->local_vars[func->n_locals].pc_start = pc_start;
 843   func->local_vars[func->n_locals].pc_end = pc_end;
 844   func->local_vars[func->n_locals].name = xstrdup(name);
 845   func->local_vars[func->n_locals].type = NULL;
 846   func->n_locals++;
 847
 848   return &func->local_vars[func->n_locals - 1];
 849 }
 850
 851 void
 852 DEBUG_DumpHashInfo()
 853 {
 854   int i;
 855   int depth;
 856   struct name_hash *nh;
 857
 858   /*
 859    * Utility function to dump stats about the hash table.
 860    */
 861     for(i=0; i<NR_NAME_HASH; i++)
 862     {
 863       depth = 0;
 864       for (nh = name_hash_table[i]; nh; nh = nh->next)
 865         {
 866           depth++;
 867         }
 868       fprintf(stderr, "Bucket %d: %d\n", i, depth);
 869     }
 870 }
 871
 872 /***********************************************************************
 873  *           DEBUG_CheckLinenoStatus
 874  *
 875  * Find the symbol nearest to a given address.
 876  * If ebp is specified as non-zero, it means we should dump the argument
 877  * list into the string we return as well.
 878  */
 879 int DEBUG_CheckLinenoStatus( const DBG_ADDR *addr)
 880 {
 881     struct name_hash * nearest = NULL;
 882     int mid, high, low;
 883     int i;
 884
 885     if( sortlist_valid == FALSE )
 886       {
 887         DEBUG_ResortSymbols();
 888       }
 889
 890     /*
 891      * Binary search to find closest symbol.
 892      */
 893     low = 0;
 894     high = sorttab_nsym;
 895     if( addr_sorttab[0]->addr.seg > addr->seg
 896         || (   addr_sorttab[0]->addr.seg == addr->seg
 897             && addr_sorttab[0]->addr.off > addr->off) )
 898       {
 899         nearest = NULL;
 900       }
 901     else if( addr_sorttab[high - 1]->addr.seg < addr->seg
 902         || (   addr_sorttab[high - 1]->addr.seg == addr->seg
 903             && addr_sorttab[high - 1]->addr.off < addr->off) )
 904       {
 905         nearest = addr_sorttab[high - 1];
 906       }
 907     else
 908       {
 909         while(1==1)
 910           {
 911             mid = (high + low)/2;
 912             if( mid == low )
 913               {
 914                 /*
 915                  * See if there are any other entries that might also
 916                  * have the same address, and would also have a line
 917                  * number table.
 918                  */
 919                 if( mid > 0 && addr_sorttab[mid]->linetab == NULL )
 920                   {
 921                     if(    (addr_sorttab[mid - 1]->addr.seg ==
 922                             addr_sorttab[mid]->addr.seg)
 923                         && (addr_sorttab[mid - 1]->addr.off ==
 924                             addr_sorttab[mid]->addr.off)
 925                         && (addr_sorttab[mid - 1]->linetab != NULL) )
 926                       {
 927                         mid--;
 928                       }
 929                   }
 930
 931                 if(    (mid < sorttab_nsym - 1)
 932                     && (addr_sorttab[mid]->linetab == NULL) )
 933                   {
 934                     if(    (addr_sorttab[mid + 1]->addr.seg ==
 935                             addr_sorttab[mid]->addr.seg)
 936                         && (addr_sorttab[mid + 1]->addr.off ==
 937                             addr_sorttab[mid]->addr.off)
 938                         && (addr_sorttab[mid + 1]->linetab != NULL) )
 939                       {
 940                         mid++;
 941                       }
 942                   }
 943                 nearest = addr_sorttab[mid];
 944 #if 0
 945                 fprintf(stderr, "Found %x:%x when looking for %x:%x %x %s\n",
 946                         addr_sorttab[mid ]->addr.seg,
 947                         addr_sorttab[mid ]->addr.off,
 948                         addr->seg, addr->off,
 949                         addr_sorttab[mid ]->linetab,
 950                         addr_sorttab[mid ]->name);
 951 #endif
 952                 break;
 953               }
 954             if(    (addr_sorttab[mid]->addr.seg < addr->seg)
 955                 || (   addr_sorttab[mid]->addr.seg == addr->seg
 956                     && addr_sorttab[mid]->addr.off <= addr->off) )
 957               {
 958                 low = mid;
 959               }
 960             else
 961               {
 962                 high = mid;
 963               }
 964           }
 965       }
 966
 967     if (!nearest) return FUNC_HAS_NO_LINES;
 968
 969     if( nearest->flags & SYM_STEP_THROUGH )
 970       {
 971         /*
 972          * This will cause us to keep single stepping until
 973          * we get to the other side somewhere.
 974          */
 975         return NOT_ON_LINENUMBER;
 976       }
 977
 978     if( (nearest->flags & SYM_TRAMPOLINE) )
 979       {
 980         /*
 981          * This will cause us to keep single stepping until
 982          * we get to the other side somewhere.
 983          */
 984         return FUNC_IS_TRAMPOLINE;
 985       }
 986
 987     if( nearest->linetab == NULL )
 988       {
 989         return FUNC_HAS_NO_LINES;
 990       }
 991
 992
 993     /*
 994      * We never want to stop on the first instruction of a function
 995      * even if it has it's own linenumber.  Let the thing keep running
 996      * until it gets past the function prologue.  We only do this if there
 997      * is more than one line number for the function, of course.
 998      */
 999     if( nearest->addr.off == addr->off && nearest->n_lines > 1 )
1000       {
1001         return NOT_ON_LINENUMBER;
1002       }
1003
1004     if( (nearest->sourcefile != NULL)
1005         && (addr->off - nearest->addr.off < 0x100000) )
1006       {
1007         /*
1008          * FIXME - this is an inefficient linear search.  A binary
1009          * search would be better if this gets to be a performance
1010          * bottleneck.
1011          */
1012         for(i=0; i < nearest->n_lines; i++)
1013           {
1014             if( addr->off == nearest->linetab[i].pc_offset.off )
1015               {
1016                 return AT_LINENUMBER;
1017               }
1018             if( addr->off < nearest->linetab[i].pc_offset.off )
1019               {
1020                 break;
1021               }
1022           }
1023
1024         return NOT_ON_LINENUMBER;
1025       }
1026
1027     return FUNC_HAS_NO_LINES;
1028 }
1029
1030 /***********************************************************************
1031  *           DEBUG_GetFuncInfo
1032  *
1033  * Find the symbol nearest to a given address.
1034  * Returns sourcefile name and line number in a format that the listing
1035  * handler can deal with.
1036  */
1037 void
1038 DEBUG_GetFuncInfo( struct list_id * ret, const char * filename,
1039                    const char * name)
1040 {
1041     char buffer[256];
1042     char * pnt;
1043     struct name_hash *nh;
1044
1045     for(nh = name_hash_table[name_hash(name)]; nh; nh = nh->next)
1046       {
1047         if( filename != NULL )
1048           {
1049
1050             if( nh->sourcefile == NULL )
1051               {
1052                 continue;
1053               }
1054
1055             pnt = strrchr(nh->sourcefile, '/');
1056             if( strcmp(nh->sourcefile, filename) != 0
1057                 && (pnt == NULL || strcmp(pnt + 1, filename) != 0) )
1058               {
1059                 continue;
1060               }
1061           }
1062         if (!strcmp(nh->name, name)) break;
1063       }
1064
1065     if (!nh && (name[0] != '_'))
1066     {
1067         buffer[0] = '_';
1068         strcpy(buffer+1, name);
1069         for(nh = name_hash_table[name_hash(buffer)]; nh; nh = nh->next)
1070           {
1071             if( filename != NULL )
1072               {
1073                 if( nh->sourcefile == NULL )
1074                   {
1075                     continue;
1076                   }
1077
1078                 pnt = strrchr(nh->sourcefile, '/');
1079                 if( strcmp(nh->sourcefile, filename) != 0
1080                     && (pnt == NULL || strcmp(pnt + 1, filename) != 0) )
1081                   {
1082                     continue;
1083                   }
1084               }
1085             if (!strcmp(nh->name, buffer)) break;
1086           }
1087     }
1088
1089     if( !nh )
1090       {
1091         if( filename != NULL )
1092           {
1093             fprintf(stderr, "No such function %s in %s\n", name, filename);
1094           }
1095         else
1096           {
1097             fprintf(stderr, "No such function %s\n", name);
1098           }
1099         ret->sourcefile = NULL;
1100         ret->line = -1;
1101         return;
1102       }
1103
1104     ret->sourcefile = nh->sourcefile;
1105
1106     /*
1107      * Search for the specific line number.  If we don't find it,
1108      * then return FALSE.
1109      */
1110     if( nh->linetab == NULL )
1111       {
1112         ret->line = -1;
1113       }
1114     else
1115       {
1116         ret->line = nh->linetab[0].line_number;
1117       }
1118 }
1119
1120 /***********************************************************************
1121  *           DEBUG_GetStackSymbolValue
1122  *
1123  * Get the address of a named symbol from the current stack frame.
1124  */
1125 static
1126 BOOL32 DEBUG_GetStackSymbolValue( const char * name, DBG_ADDR *addr )
1127 {
1128   struct name_hash * curr_func;
1129   unsigned int       ebp;
1130   unsigned int       eip;
1131   int                i;
1132
1133   if( DEBUG_GetCurrentFrame(&curr_func, &eip, &ebp) == FALSE )
1134     {
1135       return FALSE;
1136     }
1137
1138   for(i=0; i < curr_func->n_locals; i++ )
1139     {
1140       /*
1141        * Test the range of validity of the local variable.  This
1142        * comes up with RBRAC/LBRAC stabs in particular.
1143        */
1144       if(    (curr_func->local_vars[i].pc_start != 0)
1145           && ((eip - curr_func->addr.off)
1146               < curr_func->local_vars[i].pc_start) )
1147         {
1148           continue;
1149         }
1150
1151       if(    (curr_func->local_vars[i].pc_end != 0)
1152           && ((eip - curr_func->addr.off)
1153               > curr_func->local_vars[i].pc_end) )
1154         {
1155           continue;
1156         }
1157
1158       if( strcmp(name, curr_func->local_vars[i].name) == 0 )
1159         {
1160           /*
1161            * OK, we found it.  Now figure out what to do with this.
1162            */
1163           if( curr_func->local_vars[i].regno != 0 )
1164             {
1165               /*
1166                * Register variable.  We don't know how to treat
1167                * this yet.
1168                */
1169               return FALSE;
1170             }
1171
1172           addr->seg = 0;
1173           addr->off = ebp + curr_func->local_vars[i].offset;
1174           addr->type = curr_func->local_vars[i].type;
1175
1176           return TRUE;
1177         }
1178     }
1179   return FALSE;
1180 }
1181
1182 int
1183 DEBUG_InfoLocals()
1184 {
1185   struct name_hash  * curr_func;
1186   unsigned int        ebp;
1187   unsigned int        eip;
1188   int                 i;
1189   unsigned int      * ptr;
1190   int                 rtn = FALSE;
1191
1192   if( DEBUG_GetCurrentFrame(&curr_func, &eip, &ebp) == FALSE )
1193     {
1194       return FALSE;
1195     }
1196
1197   for(i=0; i < curr_func->n_locals; i++ )
1198     {
1199       /*
1200        * Test the range of validity of the local variable.  This
1201        * comes up with RBRAC/LBRAC stabs in particular.
1202        */
1203       if(    (curr_func->local_vars[i].pc_start != 0)
1204           && ((eip - curr_func->addr.off)
1205               < curr_func->local_vars[i].pc_start) )
1206         {
1207           continue;
1208         }
1209
1210       if(    (curr_func->local_vars[i].pc_end != 0)
1211           && ((eip - curr_func->addr.off)
1212               > curr_func->local_vars[i].pc_end) )
1213         {
1214           continue;
1215         }
1216
1217       if( curr_func->local_vars[i].offset == 0 )
1218         {
1219           fprintf(stderr, "%s:%s optimized into register $%s \n",
1220                   curr_func->name, curr_func->local_vars[i].name,
1221                   reg_name[curr_func->local_vars[i].regno]);
1222         }
1223       else
1224         {
1225           ptr = (unsigned int *) (ebp + curr_func->local_vars[i].offset);
1226           fprintf(stderr, "%s:%s == 0x%8.8x\n",
1227                   curr_func->name, curr_func->local_vars[i].name,
1228                   *ptr);
1229         }
1230     }
1231
1232   rtn = TRUE;
1233
1234   return (rtn);
1235 }
1236
1237 int
1238 DEBUG_SetSymbolSize(struct name_hash * sym, unsigned int len)
1239 {
1240   sym->symbol_size = len;
1241
1242   return TRUE;
1243 }
1244
1245 int
1246 DEBUG_SetSymbolBPOff(struct name_hash * sym, unsigned int off)
1247 {
1248   sym->breakpoint_offset = off;
1249
1250   return TRUE;
1251 }
1252
1253 int
1254 DEBUG_GetSymbolAddr(struct name_hash * sym, DBG_ADDR * addr)
1255 {
1256
1257   *addr = sym->addr;
1258
1259   return TRUE;
1260 }
1261
1262 int DEBUG_SetLocalSymbolType(struct wine_locals * sym, struct datatype * type)
1263 {
1264   sym->type = type;
1265
1266   return TRUE;
1267 }