Commit | Line | Data |
---|---|---|
d07734e3 | 1 | /* Support routines for building symbol tables in GDB's internal format. |
436d4143 | 2 | Copyright 1986, 1987, 1988, 1989, 1990, 1991, 1992, 1995, 1996 |
93297ea0 | 3 | Free Software Foundation, Inc. |
c0302457 JG |
4 | |
5 | This file is part of GDB. | |
6 | ||
7 | This program is free software; you can redistribute it and/or modify | |
8 | it under the terms of the GNU General Public License as published by | |
9 | the Free Software Foundation; either version 2 of the License, or | |
10 | (at your option) any later version. | |
11 | ||
12 | This program is distributed in the hope that it will be useful, | |
13 | but WITHOUT ANY WARRANTY; without even the implied warranty of | |
14 | MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the | |
15 | GNU General Public License for more details. | |
16 | ||
17 | You should have received a copy of the GNU General Public License | |
18 | along with this program; if not, write to the Free Software | |
6c9638b4 | 19 | Foundation, Inc., 59 Temple Place - Suite 330, Boston, MA 02111-1307, USA. */ |
c0302457 JG |
20 | |
21 | /* This module provides subroutines used for creating and adding to | |
22 | the symbol table. These routines are called from various symbol- | |
d07734e3 | 23 | file-reading routines. |
c0302457 | 24 | |
d07734e3 FF |
25 | Routines to support specific debugging information formats (stabs, |
26 | DWARF, etc) belong somewhere else. */ | |
c0302457 JG |
27 | |
28 | #include "defs.h" | |
d07734e3 | 29 | #include "bfd.h" |
c0302457 JG |
30 | #include "obstack.h" |
31 | #include "symtab.h" | |
c0302457 | 32 | #include "symfile.h" /* Needed for "struct complaint" */ |
5e2e79f8 | 33 | #include "objfiles.h" |
27202b6a | 34 | #include "gdbtypes.h" |
51b80b00 | 35 | #include "complaints.h" |
2b576293 | 36 | #include "gdb_string.h" |
c0302457 JG |
37 | |
38 | /* Ask buildsym.h to define the vars it normally declares `extern'. */ | |
39 | #define EXTERN /**/ | |
40 | #include "buildsym.h" /* Our own declarations */ | |
41 | #undef EXTERN | |
42 | ||
100f92e2 JK |
43 | /* For cleanup_undefined_types and finish_global_stabs (somewhat |
44 | questionable--see comment where we call them). */ | |
45 | #include "stabsread.h" | |
46 | ||
a7f56d5a FF |
47 | /* Pointer to the head of a linked list of symbol blocks which have |
48 | already been finalized (lexical contexts already closed) and which are | |
49 | just waiting to be built into a blockvector when finalizing the | |
50 | associated symtab. */ | |
51 | ||
52 | static struct pending_block *pending_blocks = NULL; | |
53 | ||
54 | /* List of free `struct pending' structures for reuse. */ | |
55 | ||
56 | static struct pending *free_pendings; | |
57 | ||
45a70ed6 SG |
58 | /* Non-zero if symtab has line number info. This prevents an otherwise empty |
59 | symtab from being tossed. */ | |
60 | ||
61 | static int have_line_numbers; | |
a7f56d5a | 62 | \f |
1ab3bf1b JG |
63 | static int |
64 | compare_line_numbers PARAMS ((const void *, const void *)); | |
65 | ||
1ab3bf1b | 66 | \f |
4137c5fc JG |
67 | /* Initial sizes of data structures. These are realloc'd larger if needed, |
68 | and realloc'd down to the size actually used, when completed. */ | |
69 | ||
70 | #define INITIAL_CONTEXT_STACK_SIZE 10 | |
4137c5fc | 71 | #define INITIAL_LINE_VECTOR_LENGTH 1000 |
d07734e3 | 72 | |
c0302457 JG |
73 | \f |
74 | /* Complaints about the symbols we have encountered. */ | |
75 | ||
73369488 FF |
76 | struct complaint block_end_complaint = |
77 | {"block end address less than block start address in %s (patched it)", 0, 0}; | |
78 | ||
79 | struct complaint anon_block_end_complaint = | |
80 | {"block end address 0x%lx less than block start address 0x%lx (patched it)", 0, 0}; | |
81 | ||
c0302457 JG |
82 | struct complaint innerblock_complaint = |
83 | {"inner block not inside outer block in %s", 0, 0}; | |
84 | ||
76512886 | 85 | struct complaint innerblock_anon_complaint = |
73369488 | 86 | {"inner block (0x%lx-0x%lx) not inside outer block (0x%lx-0x%lx)", 0, 0}; |
76512886 | 87 | |
c0302457 | 88 | struct complaint blockvector_complaint = |
5573d7d4 | 89 | {"block at 0x%lx out of order", 0, 0}; |
c0302457 | 90 | |
c0302457 JG |
91 | \f |
92 | /* maintain the lists of symbols and blocks */ | |
93 | ||
94 | /* Add a symbol to one of the lists of symbols. */ | |
d07734e3 | 95 | |
c0302457 JG |
96 | void |
97 | add_symbol_to_list (symbol, listhead) | |
98 | struct symbol *symbol; | |
99 | struct pending **listhead; | |
100 | { | |
d07734e3 | 101 | register struct pending *link; |
d719efc6 | 102 | |
f109cc3d | 103 | /* If this is an alias for another symbol, don't add it. */ |
d719efc6 DP |
104 | if (symbol->ginfo.name && symbol->ginfo.name[0] == '#') |
105 | return; | |
d07734e3 | 106 | |
c0302457 JG |
107 | /* We keep PENDINGSIZE symbols in each link of the list. |
108 | If we don't have a link with room in it, add a new link. */ | |
d07734e3 | 109 | if (*listhead == NULL || (*listhead)->nsyms == PENDINGSIZE) |
c0302457 | 110 | { |
c0302457 JG |
111 | if (free_pendings) |
112 | { | |
113 | link = free_pendings; | |
114 | free_pendings = link->next; | |
115 | } | |
116 | else | |
d07734e3 FF |
117 | { |
118 | link = (struct pending *) xmalloc (sizeof (struct pending)); | |
119 | } | |
c0302457 JG |
120 | |
121 | link->next = *listhead; | |
122 | *listhead = link; | |
123 | link->nsyms = 0; | |
124 | } | |
125 | ||
126 | (*listhead)->symbol[(*listhead)->nsyms++] = symbol; | |
127 | } | |
128 | ||
c438b3af JK |
129 | /* Find a symbol named NAME on a LIST. NAME need not be '\0'-terminated; |
130 | LENGTH is the length of the name. */ | |
d07734e3 | 131 | |
a048c8f5 JG |
132 | struct symbol * |
133 | find_symbol_in_list (list, name, length) | |
134 | struct pending *list; | |
135 | char *name; | |
136 | int length; | |
137 | { | |
138 | int j; | |
d07734e3 | 139 | char *pp; |
a048c8f5 | 140 | |
d07734e3 FF |
141 | while (list != NULL) |
142 | { | |
143 | for (j = list->nsyms; --j >= 0; ) | |
144 | { | |
145 | pp = SYMBOL_NAME (list->symbol[j]); | |
146 | if (*pp == *name && strncmp (pp, name, length) == 0 && | |
147 | pp[length] == '\0') | |
148 | { | |
149 | return (list->symbol[j]); | |
150 | } | |
151 | } | |
152 | list = list->next; | |
a048c8f5 | 153 | } |
d07734e3 | 154 | return (NULL); |
a048c8f5 JG |
155 | } |
156 | ||
c0302457 | 157 | /* At end of reading syms, or in case of quit, |
d07734e3 | 158 | really free as many `struct pending's as we can easily find. */ |
c0302457 JG |
159 | |
160 | /* ARGSUSED */ | |
161 | void | |
162 | really_free_pendings (foo) | |
163 | int foo; | |
164 | { | |
165 | struct pending *next, *next1; | |
c0302457 JG |
166 | |
167 | for (next = free_pendings; next; next = next1) | |
168 | { | |
169 | next1 = next->next; | |
84ffdec2 | 170 | free ((PTR)next); |
c0302457 | 171 | } |
d07734e3 | 172 | free_pendings = NULL; |
c0302457 | 173 | |
a7f56d5a | 174 | free_pending_blocks (); |
c0302457 | 175 | |
d07734e3 | 176 | for (next = file_symbols; next != NULL; next = next1) |
c0302457 JG |
177 | { |
178 | next1 = next->next; | |
84ffdec2 | 179 | free ((PTR)next); |
c0302457 | 180 | } |
d07734e3 | 181 | file_symbols = NULL; |
c0302457 | 182 | |
d07734e3 | 183 | for (next = global_symbols; next != NULL; next = next1) |
c0302457 JG |
184 | { |
185 | next1 = next->next; | |
84ffdec2 | 186 | free ((PTR)next); |
c0302457 | 187 | } |
d07734e3 | 188 | global_symbols = NULL; |
c0302457 JG |
189 | } |
190 | ||
a7f56d5a FF |
191 | /* This function is called to discard any pending blocks. */ |
192 | ||
193 | void | |
194 | free_pending_blocks () | |
195 | { | |
196 | #if 0 /* Now we make the links in the symbol_obstack, so don't free them. */ | |
197 | struct pending_block *bnext, *bnext1; | |
198 | ||
199 | for (bnext = pending_blocks; bnext; bnext = bnext1) | |
200 | { | |
201 | bnext1 = bnext->next; | |
202 | free ((PTR)bnext); | |
203 | } | |
204 | #endif | |
205 | pending_blocks = NULL; | |
206 | } | |
207 | ||
c0302457 JG |
208 | /* Take one of the lists of symbols and make a block from it. |
209 | Keep the order the symbols have in the list (reversed from the input file). | |
210 | Put the block on the list of pending blocks. */ | |
211 | ||
212 | void | |
1ab3bf1b | 213 | finish_block (symbol, listhead, old_blocks, start, end, objfile) |
c0302457 JG |
214 | struct symbol *symbol; |
215 | struct pending **listhead; | |
216 | struct pending_block *old_blocks; | |
217 | CORE_ADDR start, end; | |
1ab3bf1b | 218 | struct objfile *objfile; |
c0302457 JG |
219 | { |
220 | register struct pending *next, *next1; | |
221 | register struct block *block; | |
222 | register struct pending_block *pblock; | |
223 | struct pending_block *opblock; | |
224 | register int i; | |
d07734e3 | 225 | register int j; |
c0302457 JG |
226 | |
227 | /* Count the length of the list of symbols. */ | |
228 | ||
cd46ffad FF |
229 | for (next = *listhead, i = 0; |
230 | next; | |
231 | i += next->nsyms, next = next->next) | |
d07734e3 FF |
232 | { |
233 | /*EMPTY*/; | |
234 | } | |
c0302457 | 235 | |
1ab3bf1b | 236 | block = (struct block *) obstack_alloc (&objfile -> symbol_obstack, |
a048c8f5 | 237 | (sizeof (struct block) + ((i - 1) * sizeof (struct symbol *)))); |
c0302457 JG |
238 | |
239 | /* Copy the symbols into the block. */ | |
240 | ||
241 | BLOCK_NSYMS (block) = i; | |
242 | for (next = *listhead; next; next = next->next) | |
243 | { | |
c0302457 | 244 | for (j = next->nsyms - 1; j >= 0; j--) |
d07734e3 FF |
245 | { |
246 | BLOCK_SYM (block, --i) = next->symbol[j]; | |
247 | } | |
c0302457 JG |
248 | } |
249 | ||
250 | BLOCK_START (block) = start; | |
251 | BLOCK_END (block) = end; | |
d07734e3 FF |
252 | /* Superblock filled in when containing block is made */ |
253 | BLOCK_SUPERBLOCK (block) = NULL; | |
c0302457 JG |
254 | BLOCK_GCC_COMPILED (block) = processing_gcc_compilation; |
255 | ||
256 | /* Put the block in as the value of the symbol that names it. */ | |
257 | ||
258 | if (symbol) | |
259 | { | |
27202b6a | 260 | struct type *ftype = SYMBOL_TYPE (symbol); |
c0302457 JG |
261 | SYMBOL_BLOCK_VALUE (symbol) = block; |
262 | BLOCK_FUNCTION (block) = symbol; | |
27202b6a PB |
263 | |
264 | if (TYPE_NFIELDS (ftype) <= 0) | |
265 | { | |
266 | /* No parameter type information is recorded with the function's | |
267 | type. Set that from the type of the parameter symbols. */ | |
268 | int nparams = 0, iparams; | |
269 | struct symbol *sym; | |
270 | for (i = 0; i < BLOCK_NSYMS (block); i++) | |
271 | { | |
272 | sym = BLOCK_SYM (block, i); | |
273 | switch (SYMBOL_CLASS (sym)) | |
274 | { | |
275 | case LOC_ARG: | |
276 | case LOC_REF_ARG: | |
277 | case LOC_REGPARM: | |
278 | case LOC_REGPARM_ADDR: | |
ac954805 SG |
279 | case LOC_BASEREG_ARG: |
280 | case LOC_LOCAL_ARG: | |
27202b6a | 281 | nparams++; |
6b14af2b FF |
282 | break; |
283 | case LOC_UNDEF: | |
284 | case LOC_CONST: | |
285 | case LOC_STATIC: | |
286 | case LOC_REGISTER: | |
287 | case LOC_LOCAL: | |
288 | case LOC_TYPEDEF: | |
289 | case LOC_LABEL: | |
290 | case LOC_BLOCK: | |
291 | case LOC_CONST_BYTES: | |
6b14af2b | 292 | case LOC_BASEREG: |
b1027aa4 | 293 | case LOC_UNRESOLVED: |
6b14af2b FF |
294 | case LOC_OPTIMIZED_OUT: |
295 | default: | |
296 | break; | |
27202b6a PB |
297 | } |
298 | } | |
299 | if (nparams > 0) | |
300 | { | |
301 | TYPE_NFIELDS (ftype) = nparams; | |
302 | TYPE_FIELDS (ftype) = (struct field *) | |
303 | TYPE_ALLOC (ftype, nparams * sizeof (struct field)); | |
304 | ||
305 | for (i = iparams = 0; iparams < nparams; i++) | |
306 | { | |
307 | sym = BLOCK_SYM (block, i); | |
308 | switch (SYMBOL_CLASS (sym)) | |
309 | { | |
310 | case LOC_ARG: | |
311 | case LOC_REF_ARG: | |
312 | case LOC_REGPARM: | |
313 | case LOC_REGPARM_ADDR: | |
ac954805 SG |
314 | case LOC_BASEREG_ARG: |
315 | case LOC_LOCAL_ARG: | |
27202b6a PB |
316 | TYPE_FIELD_TYPE (ftype, iparams) = SYMBOL_TYPE (sym); |
317 | iparams++; | |
6b14af2b FF |
318 | break; |
319 | case LOC_UNDEF: | |
320 | case LOC_CONST: | |
321 | case LOC_STATIC: | |
322 | case LOC_REGISTER: | |
323 | case LOC_LOCAL: | |
324 | case LOC_TYPEDEF: | |
325 | case LOC_LABEL: | |
326 | case LOC_BLOCK: | |
327 | case LOC_CONST_BYTES: | |
6b14af2b | 328 | case LOC_BASEREG: |
b1027aa4 | 329 | case LOC_UNRESOLVED: |
6b14af2b FF |
330 | case LOC_OPTIMIZED_OUT: |
331 | default: | |
332 | break; | |
27202b6a PB |
333 | } |
334 | } | |
335 | } | |
336 | } | |
c0302457 JG |
337 | } |
338 | else | |
d07734e3 FF |
339 | { |
340 | BLOCK_FUNCTION (block) = NULL; | |
341 | } | |
c0302457 JG |
342 | |
343 | /* Now "free" the links of the list, and empty the list. */ | |
344 | ||
345 | for (next = *listhead; next; next = next1) | |
346 | { | |
347 | next1 = next->next; | |
348 | next->next = free_pendings; | |
349 | free_pendings = next; | |
350 | } | |
d07734e3 | 351 | *listhead = NULL; |
c0302457 | 352 | |
73369488 FF |
353 | #if 1 |
354 | /* Check to be sure that the blocks have an end address that is | |
355 | greater than starting address */ | |
356 | ||
357 | if (BLOCK_END (block) < BLOCK_START (block)) | |
358 | { | |
359 | if (symbol) | |
360 | { | |
361 | complain (&block_end_complaint, SYMBOL_SOURCE_NAME (symbol)); | |
362 | } | |
363 | else | |
364 | { | |
365 | complain (&anon_block_end_complaint, BLOCK_END (block), BLOCK_START (block)); | |
366 | } | |
367 | /* Better than nothing */ | |
368 | BLOCK_END (block) = BLOCK_START (block); | |
369 | } | |
370 | #endif | |
371 | ||
c0302457 JG |
372 | /* Install this block as the superblock |
373 | of all blocks made since the start of this scope | |
374 | that don't have superblocks yet. */ | |
375 | ||
d07734e3 | 376 | opblock = NULL; |
c0302457 JG |
377 | for (pblock = pending_blocks; pblock != old_blocks; pblock = pblock->next) |
378 | { | |
d07734e3 FF |
379 | if (BLOCK_SUPERBLOCK (pblock->block) == NULL) |
380 | { | |
c0302457 | 381 | #if 1 |
d07734e3 FF |
382 | /* Check to be sure the blocks are nested as we receive them. |
383 | If the compiler/assembler/linker work, this just burns a small | |
384 | amount of time. */ | |
385 | if (BLOCK_START (pblock->block) < BLOCK_START (block) || | |
386 | BLOCK_END (pblock->block) > BLOCK_END (block)) | |
387 | { | |
388 | if (symbol) | |
389 | { | |
2e4964ad FF |
390 | complain (&innerblock_complaint, |
391 | SYMBOL_SOURCE_NAME (symbol)); | |
d07734e3 FF |
392 | } |
393 | else | |
394 | { | |
73369488 FF |
395 | complain (&innerblock_anon_complaint, BLOCK_START (pblock->block), |
396 | BLOCK_END (pblock->block), BLOCK_START (block), | |
397 | BLOCK_END (block)); | |
d07734e3 | 398 | } |
32dab603 MA |
399 | if (BLOCK_START (pblock->block) < BLOCK_START (block)) |
400 | BLOCK_START (pblock->block) = BLOCK_START (block); | |
401 | if (BLOCK_END (pblock->block) > BLOCK_END (block)) | |
402 | BLOCK_END (pblock->block) = BLOCK_END (block); | |
d07734e3 | 403 | } |
c0302457 | 404 | #endif |
d07734e3 FF |
405 | BLOCK_SUPERBLOCK (pblock->block) = block; |
406 | } | |
c0302457 JG |
407 | opblock = pblock; |
408 | } | |
409 | ||
a7f56d5a FF |
410 | record_pending_block (objfile, block, opblock); |
411 | } | |
412 | ||
413 | /* Record BLOCK on the list of all blocks in the file. Put it after | |
414 | OPBLOCK, or at the beginning if opblock is NULL. This puts the block | |
415 | in the list after all its subblocks. | |
416 | ||
417 | Allocate the pending block struct in the symbol_obstack to save | |
418 | time. This wastes a little space. FIXME: Is it worth it? */ | |
419 | ||
420 | void | |
421 | record_pending_block (objfile, block, opblock) | |
422 | struct objfile* objfile; | |
423 | struct block *block; | |
424 | struct pending_block *opblock; | |
425 | { | |
426 | register struct pending_block *pblock; | |
c0302457 | 427 | |
c0302457 | 428 | pblock = (struct pending_block *) |
a7f56d5a FF |
429 | obstack_alloc (&objfile -> symbol_obstack, sizeof (struct pending_block)); |
430 | pblock -> block = block; | |
c0302457 JG |
431 | if (opblock) |
432 | { | |
a7f56d5a FF |
433 | pblock -> next = opblock -> next; |
434 | opblock -> next = pblock; | |
c0302457 JG |
435 | } |
436 | else | |
437 | { | |
a7f56d5a | 438 | pblock -> next = pending_blocks; |
c0302457 JG |
439 | pending_blocks = pblock; |
440 | } | |
441 | } | |
442 | ||
a7f56d5a FF |
443 | /* Note that this is only used in this file and in dstread.c, which should be |
444 | fixed to not need direct access to this function. When that is done, it can | |
445 | be made static again. */ | |
446 | ||
447 | struct blockvector * | |
1ab3bf1b | 448 | make_blockvector (objfile) |
c438b3af | 449 | struct objfile *objfile; |
c0302457 JG |
450 | { |
451 | register struct pending_block *next; | |
452 | register struct blockvector *blockvector; | |
453 | register int i; | |
454 | ||
455 | /* Count the length of the list of blocks. */ | |
456 | ||
d07734e3 | 457 | for (next = pending_blocks, i = 0; next; next = next->next, i++) {;} |
c0302457 JG |
458 | |
459 | blockvector = (struct blockvector *) | |
1ab3bf1b | 460 | obstack_alloc (&objfile -> symbol_obstack, |
c0302457 JG |
461 | (sizeof (struct blockvector) |
462 | + (i - 1) * sizeof (struct block *))); | |
463 | ||
464 | /* Copy the blocks into the blockvector. | |
465 | This is done in reverse order, which happens to put | |
466 | the blocks into the proper order (ascending starting address). | |
467 | finish_block has hair to insert each block into the list | |
468 | after its subblocks in order to make sure this is true. */ | |
469 | ||
470 | BLOCKVECTOR_NBLOCKS (blockvector) = i; | |
d07734e3 FF |
471 | for (next = pending_blocks; next; next = next->next) |
472 | { | |
473 | BLOCKVECTOR_BLOCK (blockvector, --i) = next->block; | |
474 | } | |
c0302457 JG |
475 | |
476 | #if 0 /* Now we make the links in the obstack, so don't free them. */ | |
477 | /* Now free the links of the list, and empty the list. */ | |
478 | ||
479 | for (next = pending_blocks; next; next = next1) | |
480 | { | |
481 | next1 = next->next; | |
482 | free (next); | |
483 | } | |
484 | #endif | |
d07734e3 | 485 | pending_blocks = NULL; |
c0302457 JG |
486 | |
487 | #if 1 /* FIXME, shut this off after a while to speed up symbol reading. */ | |
488 | /* Some compilers output blocks in the wrong order, but we depend | |
489 | on their being in the right order so we can binary search. | |
490 | Check the order and moan about it. FIXME. */ | |
491 | if (BLOCKVECTOR_NBLOCKS (blockvector) > 1) | |
d07734e3 FF |
492 | { |
493 | for (i = 1; i < BLOCKVECTOR_NBLOCKS (blockvector); i++) | |
494 | { | |
495 | if (BLOCK_START(BLOCKVECTOR_BLOCK (blockvector, i-1)) | |
496 | > BLOCK_START(BLOCKVECTOR_BLOCK (blockvector, i))) | |
497 | { | |
833e0d94 JK |
498 | |
499 | /* FIXME-32x64: loses if CORE_ADDR doesn't fit in a | |
500 | long. Possible solutions include a version of | |
501 | complain which takes a callback, a | |
502 | sprintf_address_numeric to match | |
503 | print_address_numeric, or a way to set up a GDB_FILE | |
504 | * which causes sprintf rather than fprintf to be | |
505 | called. */ | |
506 | ||
d07734e3 | 507 | complain (&blockvector_complaint, |
5573d7d4 | 508 | (unsigned long) BLOCK_START(BLOCKVECTOR_BLOCK (blockvector, i))); |
d07734e3 FF |
509 | } |
510 | } | |
c0302457 JG |
511 | } |
512 | #endif | |
513 | ||
d07734e3 | 514 | return (blockvector); |
c0302457 | 515 | } |
d07734e3 | 516 | |
c0302457 | 517 | \f |
4137c5fc | 518 | /* Start recording information about source code that came from an included |
c438b3af JK |
519 | (or otherwise merged-in) source file with a different name. NAME is |
520 | the name of the file (cannot be NULL), DIRNAME is the directory in which | |
521 | it resides (or NULL if not known). */ | |
c0302457 JG |
522 | |
523 | void | |
4137c5fc JG |
524 | start_subfile (name, dirname) |
525 | char *name; | |
526 | char *dirname; | |
527 | { | |
528 | register struct subfile *subfile; | |
529 | ||
530 | /* See if this subfile is already known as a subfile of the | |
531 | current main source file. */ | |
532 | ||
533 | for (subfile = subfiles; subfile; subfile = subfile->next) | |
534 | { | |
2e4964ad | 535 | if (STREQ (subfile->name, name)) |
4137c5fc JG |
536 | { |
537 | current_subfile = subfile; | |
538 | return; | |
539 | } | |
540 | } | |
541 | ||
542 | /* This subfile is not known. Add an entry for it. | |
543 | Make an entry for this subfile in the list of all subfiles | |
544 | of the current main source file. */ | |
545 | ||
546 | subfile = (struct subfile *) xmalloc (sizeof (struct subfile)); | |
547 | subfile->next = subfiles; | |
548 | subfiles = subfile; | |
549 | current_subfile = subfile; | |
550 | ||
551 | /* Save its name and compilation directory name */ | |
bb6247c6 JK |
552 | subfile->name = (name == NULL) ? NULL : savestring (name, strlen (name)); |
553 | subfile->dirname = | |
554 | (dirname == NULL) ? NULL : savestring (dirname, strlen (dirname)); | |
4137c5fc JG |
555 | |
556 | /* Initialize line-number recording for this subfile. */ | |
d07734e3 | 557 | subfile->line_vector = NULL; |
2e4964ad FF |
558 | |
559 | /* Default the source language to whatever can be deduced from | |
560 | the filename. If nothing can be deduced (such as for a C/C++ | |
561 | include file with a ".h" extension), then inherit whatever | |
562 | language the previous subfile had. This kludgery is necessary | |
563 | because there is no standard way in some object formats to | |
564 | record the source language. Also, when symtabs are allocated | |
565 | we try to deduce a language then as well, but it is too late | |
566 | for us to use that information while reading symbols, since | |
567 | symtabs aren't allocated until after all the symbols have | |
568 | been processed for a given source file. */ | |
569 | ||
570 | subfile->language = deduce_language_from_filename (subfile->name); | |
571 | if (subfile->language == language_unknown && | |
572 | subfile->next != NULL) | |
573 | { | |
574 | subfile->language = subfile->next->language; | |
575 | } | |
56ad756a | 576 | |
609fd033 FF |
577 | /* Initialize the debug format string to NULL. We may supply it |
578 | later via a call to record_debugformat. */ | |
579 | subfile->debugformat = NULL; | |
580 | ||
56ad756a JK |
581 | /* cfront output is a C program, so in most ways it looks like a C |
582 | program. But to demangle we need to set the language to C++. We | |
583 | can distinguish cfront code by the fact that it has #line | |
584 | directives which specify a file name ending in .C. | |
585 | ||
586 | So if the filename of this subfile ends in .C, then change the language | |
8b05f64a JK |
587 | of any pending subfiles from C to C++. We also accept any other C++ |
588 | suffixes accepted by deduce_language_from_filename (in particular, | |
589 | some people use .cxx with cfront). */ | |
21af55c9 | 590 | /* Likewise for f2c. */ |
56ad756a JK |
591 | |
592 | if (subfile->name) | |
593 | { | |
56ad756a | 594 | struct subfile *s; |
21af55c9 | 595 | enum language sublang = deduce_language_from_filename (subfile->name); |
56ad756a | 596 | |
21af55c9 | 597 | if (sublang == language_cplus || sublang == language_fortran) |
56ad756a JK |
598 | for (s = subfiles; s != NULL; s = s->next) |
599 | if (s->language == language_c) | |
21af55c9 | 600 | s->language = sublang; |
56ad756a JK |
601 | } |
602 | ||
603 | /* And patch up this file if necessary. */ | |
604 | if (subfile->language == language_c | |
605 | && subfile->next != NULL | |
21af55c9 JK |
606 | && (subfile->next->language == language_cplus |
607 | || subfile->next->language == language_fortran)) | |
56ad756a | 608 | { |
21af55c9 | 609 | subfile->language = subfile->next->language; |
56ad756a | 610 | } |
4137c5fc | 611 | } |
d07734e3 | 612 | |
3416d90b FF |
613 | /* For stabs readers, the first N_SO symbol is assumed to be the source |
614 | file name, and the subfile struct is initialized using that assumption. | |
615 | If another N_SO symbol is later seen, immediately following the first | |
616 | one, then the first one is assumed to be the directory name and the | |
617 | second one is really the source file name. | |
618 | ||
619 | So we have to patch up the subfile struct by moving the old name value to | |
620 | dirname and remembering the new name. Some sanity checking is performed | |
621 | to ensure that the state of the subfile struct is reasonable and that the | |
622 | old name we are assuming to be a directory name actually is (by checking | |
623 | for a trailing '/'). */ | |
624 | ||
625 | void | |
626 | patch_subfile_names (subfile, name) | |
627 | struct subfile *subfile; | |
628 | char *name; | |
629 | { | |
630 | if (subfile != NULL && subfile->dirname == NULL && subfile->name != NULL | |
631 | && subfile->name[strlen(subfile->name)-1] == '/') | |
632 | { | |
633 | subfile->dirname = subfile->name; | |
bb6247c6 | 634 | subfile->name = savestring (name, strlen (name)); |
b9e58503 | 635 | last_source_file = name; |
2e4964ad FF |
636 | |
637 | /* Default the source language to whatever can be deduced from | |
638 | the filename. If nothing can be deduced (such as for a C/C++ | |
639 | include file with a ".h" extension), then inherit whatever | |
640 | language the previous subfile had. This kludgery is necessary | |
641 | because there is no standard way in some object formats to | |
642 | record the source language. Also, when symtabs are allocated | |
643 | we try to deduce a language then as well, but it is too late | |
644 | for us to use that information while reading symbols, since | |
645 | symtabs aren't allocated until after all the symbols have | |
646 | been processed for a given source file. */ | |
647 | ||
648 | subfile->language = deduce_language_from_filename (subfile->name); | |
649 | if (subfile->language == language_unknown && | |
650 | subfile->next != NULL) | |
651 | { | |
652 | subfile->language = subfile->next->language; | |
653 | } | |
3416d90b FF |
654 | } |
655 | } | |
656 | ||
4137c5fc | 657 | \f |
a048c8f5 JG |
658 | /* Handle the N_BINCL and N_EINCL symbol types |
659 | that act like N_SOL for switching source files | |
660 | (different subfiles, as we call them) within one object file, | |
661 | but using a stack rather than in an arbitrary order. */ | |
662 | ||
663 | void | |
664 | push_subfile () | |
665 | { | |
666 | register struct subfile_stack *tem | |
667 | = (struct subfile_stack *) xmalloc (sizeof (struct subfile_stack)); | |
668 | ||
669 | tem->next = subfile_stack; | |
670 | subfile_stack = tem; | |
d07734e3 FF |
671 | if (current_subfile == NULL || current_subfile->name == NULL) |
672 | { | |
673 | abort (); | |
674 | } | |
a048c8f5 | 675 | tem->name = current_subfile->name; |
a048c8f5 JG |
676 | } |
677 | ||
678 | char * | |
679 | pop_subfile () | |
680 | { | |
681 | register char *name; | |
682 | register struct subfile_stack *link = subfile_stack; | |
683 | ||
d07734e3 FF |
684 | if (link == NULL) |
685 | { | |
686 | abort (); | |
687 | } | |
a048c8f5 JG |
688 | name = link->name; |
689 | subfile_stack = link->next; | |
84ffdec2 | 690 | free ((PTR)link); |
d07734e3 | 691 | return (name); |
a048c8f5 | 692 | } |
d07734e3 | 693 | |
a048c8f5 | 694 | \f |
be7d4f3f JK |
695 | /* Add a linetable entry for line number LINE and address PC to the line |
696 | vector for SUBFILE. */ | |
4137c5fc JG |
697 | |
698 | void | |
699 | record_line (subfile, line, pc) | |
700 | register struct subfile *subfile; | |
c0302457 JG |
701 | int line; |
702 | CORE_ADDR pc; | |
703 | { | |
704 | struct linetable_entry *e; | |
705 | /* Ignore the dummy line number in libg.o */ | |
706 | ||
707 | if (line == 0xffff) | |
d07734e3 FF |
708 | { |
709 | return; | |
710 | } | |
c0302457 | 711 | |
4137c5fc | 712 | /* Make sure line vector exists and is big enough. */ |
d07734e3 FF |
713 | if (!subfile->line_vector) |
714 | { | |
715 | subfile->line_vector_length = INITIAL_LINE_VECTOR_LENGTH; | |
716 | subfile->line_vector = (struct linetable *) | |
4137c5fc JG |
717 | xmalloc (sizeof (struct linetable) |
718 | + subfile->line_vector_length * sizeof (struct linetable_entry)); | |
d07734e3 | 719 | subfile->line_vector->nitems = 0; |
45a70ed6 | 720 | have_line_numbers = 1; |
d07734e3 | 721 | } |
c0302457 | 722 | |
4137c5fc | 723 | if (subfile->line_vector->nitems + 1 >= subfile->line_vector_length) |
c0302457 | 724 | { |
4137c5fc JG |
725 | subfile->line_vector_length *= 2; |
726 | subfile->line_vector = (struct linetable *) | |
1ab3bf1b | 727 | xrealloc ((char *) subfile->line_vector, (sizeof (struct linetable) |
d07734e3 | 728 | + subfile->line_vector_length * sizeof (struct linetable_entry))); |
c0302457 JG |
729 | } |
730 | ||
4137c5fc | 731 | e = subfile->line_vector->item + subfile->line_vector->nitems++; |
c0302457 JG |
732 | e->line = line; e->pc = pc; |
733 | } | |
4137c5fc JG |
734 | |
735 | ||
736 | /* Needed in order to sort line tables from IBM xcoff files. Sigh! */ | |
737 | ||
1ab3bf1b JG |
738 | static int |
739 | compare_line_numbers (ln1p, ln2p) | |
c1d58bcd FF |
740 | const void *ln1p; |
741 | const void *ln2p; | |
4137c5fc | 742 | { |
c438b3af JK |
743 | struct linetable_entry *ln1 = (struct linetable_entry *) ln1p; |
744 | struct linetable_entry *ln2 = (struct linetable_entry *) ln2p; | |
745 | ||
746 | /* Note: this code does not assume that CORE_ADDRs can fit in ints. | |
747 | Please keep it that way. */ | |
748 | if (ln1->pc < ln2->pc) | |
749 | return -1; | |
750 | ||
751 | if (ln1->pc > ln2->pc) | |
752 | return 1; | |
753 | ||
754 | /* If pc equal, sort by line. I'm not sure whether this is optimum | |
755 | behavior (see comment at struct linetable in symtab.h). */ | |
756 | return ln1->line - ln2->line; | |
4137c5fc | 757 | } |
1ab3bf1b | 758 | |
c0302457 JG |
759 | \f |
760 | /* Start a new symtab for a new source file. | |
d07734e3 FF |
761 | Called, for example, when a stabs symbol of type N_SO is seen, or when |
762 | a DWARF TAG_compile_unit DIE is seen. | |
763 | It indicates the start of data for one original source file. */ | |
c0302457 JG |
764 | |
765 | void | |
766 | start_symtab (name, dirname, start_addr) | |
767 | char *name; | |
768 | char *dirname; | |
769 | CORE_ADDR start_addr; | |
770 | { | |
771 | ||
772 | last_source_file = name; | |
773 | last_source_start_addr = start_addr; | |
d07734e3 FF |
774 | file_symbols = NULL; |
775 | global_symbols = NULL; | |
c0302457 | 776 | within_function = 0; |
45a70ed6 | 777 | have_line_numbers = 0; |
c0302457 | 778 | |
a048c8f5 JG |
779 | /* Context stack is initially empty. Allocate first one with room for |
780 | 10 levels; reuse it forever afterward. */ | |
d07734e3 FF |
781 | if (context_stack == NULL) |
782 | { | |
783 | context_stack_size = INITIAL_CONTEXT_STACK_SIZE; | |
784 | context_stack = (struct context_stack *) | |
785 | xmalloc (context_stack_size * sizeof (struct context_stack)); | |
786 | } | |
c0302457 JG |
787 | context_stack_depth = 0; |
788 | ||
c0302457 JG |
789 | /* Initialize the list of sub source files with one entry |
790 | for this file (the top-level source file). */ | |
791 | ||
d07734e3 FF |
792 | subfiles = NULL; |
793 | current_subfile = NULL; | |
c0302457 JG |
794 | start_subfile (name, dirname); |
795 | } | |
796 | ||
797 | /* Finish the symbol definitions for one main source file, | |
798 | close off all the lexical contexts for that file | |
799 | (creating struct block's for them), then make the struct symtab | |
800 | for that file and put it in the list of all such. | |
801 | ||
7b5d9650 | 802 | END_ADDR is the address of the end of the file's text. |
3c02636b JK |
803 | SECTION is the section number (in objfile->section_offsets) of |
804 | the blockvector and linetable. | |
7b5d9650 FF |
805 | |
806 | Note that it is possible for end_symtab() to return NULL. In particular, | |
807 | for the DWARF case at least, it will return NULL when it finds a | |
808 | compilation unit that has exactly one DIE, a TAG_compile_unit DIE. This | |
809 | can happen when we link in an object file that was compiled from an empty | |
810 | source file. Returning NULL is probably not the correct thing to do, | |
811 | because then gdb will never know about this empty file (FIXME). */ | |
c0302457 JG |
812 | |
813 | struct symtab * | |
436d4143 | 814 | end_symtab (end_addr, objfile, section) |
c0302457 | 815 | CORE_ADDR end_addr; |
a048c8f5 | 816 | struct objfile *objfile; |
3c02636b | 817 | int section; |
c0302457 | 818 | { |
fee933f1 | 819 | register struct symtab *symtab = NULL; |
c0302457 JG |
820 | register struct blockvector *blockvector; |
821 | register struct subfile *subfile; | |
d07734e3 | 822 | register struct context_stack *cstk; |
c0302457 JG |
823 | struct subfile *nextsub; |
824 | ||
825 | /* Finish the lexical context of the last function in the file; | |
826 | pop the context stack. */ | |
827 | ||
828 | if (context_stack_depth > 0) | |
829 | { | |
d8831024 | 830 | cstk = pop_context(); |
c0302457 JG |
831 | /* Make a block for the local symbols within. */ |
832 | finish_block (cstk->name, &local_symbols, cstk->old_blocks, | |
1ab3bf1b | 833 | cstk->start_addr, end_addr, objfile); |
a048c8f5 | 834 | |
a048c8f5 | 835 | if (context_stack_depth > 0) |
d07734e3 | 836 | { |
f91b837d JK |
837 | /* This is said to happen with SCO. The old coffread.c code |
838 | simply emptied the context stack, so we do the same. FIXME: | |
839 | Find out why it is happening. This is not believed to happen | |
840 | in most cases (even for coffread.c); it used to be an abort(). */ | |
841 | static struct complaint msg = | |
842 | {"Context stack not empty in end_symtab", 0, 0}; | |
843 | complain (&msg); | |
844 | context_stack_depth = 0; | |
d07734e3 | 845 | } |
c0302457 JG |
846 | } |
847 | ||
436d4143 JL |
848 | /* Reordered executables may have out of order pending blocks; if |
849 | OBJF_REORDERED is true, then sort the pending blocks. */ | |
850 | if ((objfile->flags & OBJF_REORDERED) && pending_blocks) | |
d07734e3 | 851 | { |
b57d4d17 | 852 | /* FIXME! Remove this horrid bubble sort and use merge sort!!! */ |
d07734e3 FF |
853 | int swapped; |
854 | do | |
855 | { | |
856 | struct pending_block *pb, *pbnext; | |
857 | ||
858 | pb = pending_blocks; | |
859 | pbnext = pb->next; | |
860 | swapped = 0; | |
861 | ||
862 | while (pbnext) | |
863 | { | |
864 | /* swap blocks if unordered! */ | |
865 | ||
866 | if (BLOCK_START(pb->block) < BLOCK_START(pbnext->block)) | |
867 | { | |
868 | struct block *tmp = pb->block; | |
869 | pb->block = pbnext->block; | |
870 | pbnext->block = tmp; | |
871 | swapped = 1; | |
872 | } | |
873 | pb = pbnext; | |
874 | pbnext = pbnext->next; | |
875 | } | |
876 | } while (swapped); | |
877 | } | |
4137c5fc | 878 | |
c0302457 JG |
879 | /* Cleanup any undefined types that have been left hanging around |
880 | (this needs to be done before the finish_blocks so that | |
d07734e3 | 881 | file_symbols is still good). |
c438b3af JK |
882 | |
883 | Both cleanup_undefined_types and finish_global_stabs are stabs | |
884 | specific, but harmless for other symbol readers, since on gdb | |
885 | startup or when finished reading stabs, the state is set so these | |
886 | are no-ops. FIXME: Is this handled right in case of QUIT? Can | |
887 | we make this cleaner? */ | |
888 | ||
c0302457 | 889 | cleanup_undefined_types (); |
d07734e3 | 890 | finish_global_stabs (objfile); |
c0302457 | 891 | |
d07734e3 FF |
892 | if (pending_blocks == NULL |
893 | && file_symbols == NULL | |
45a70ed6 SG |
894 | && global_symbols == NULL |
895 | && have_line_numbers == 0) | |
d07734e3 FF |
896 | { |
897 | /* Ignore symtabs that have no functions with real debugging info */ | |
898 | blockvector = NULL; | |
899 | } | |
900 | else | |
901 | { | |
902 | /* Define the STATIC_BLOCK & GLOBAL_BLOCK, and build the blockvector. */ | |
903 | finish_block (0, &file_symbols, 0, last_source_start_addr, end_addr, | |
904 | objfile); | |
905 | finish_block (0, &global_symbols, 0, last_source_start_addr, end_addr, | |
906 | objfile); | |
907 | blockvector = make_blockvector (objfile); | |
908 | } | |
c0302457 | 909 | |
818de002 | 910 | #ifdef PROCESS_LINENUMBER_HOOK |
9b280a7f | 911 | PROCESS_LINENUMBER_HOOK (); /* Needed for xcoff. */ |
818de002 PB |
912 | #endif |
913 | ||
c0302457 JG |
914 | /* Now create the symtab objects proper, one for each subfile. */ |
915 | /* (The main file is the last one on the chain.) */ | |
916 | ||
917 | for (subfile = subfiles; subfile; subfile = nextsub) | |
918 | { | |
fee933f1 | 919 | int linetablesize = 0; |
a048c8f5 JG |
920 | /* If we have blocks of symbols, make a symtab. |
921 | Otherwise, just ignore this file and any line number info in it. */ | |
d07734e3 FF |
922 | symtab = NULL; |
923 | if (blockvector) | |
924 | { | |
925 | if (subfile->line_vector) | |
926 | { | |
d07734e3 FF |
927 | linetablesize = sizeof (struct linetable) + |
928 | subfile->line_vector->nitems * sizeof (struct linetable_entry); | |
c438b3af JK |
929 | #if 0 |
930 | /* I think this is artifact from before it went on the obstack. | |
931 | I doubt we'll need the memory between now and when we | |
932 | free it later in this function. */ | |
933 | /* First, shrink the linetable to make more memory. */ | |
d07734e3 FF |
934 | subfile->line_vector = (struct linetable *) |
935 | xrealloc ((char *) subfile->line_vector, linetablesize); | |
c438b3af | 936 | #endif |
d07734e3 | 937 | |
436d4143 JL |
938 | /* Like the pending blocks, the line table may be scrambled |
939 | in reordered executables. Sort it if OBJF_REORDERED is | |
940 | true. */ | |
941 | if (objfile->flags & OBJF_REORDERED) | |
d07734e3 FF |
942 | qsort (subfile->line_vector->item, |
943 | subfile->line_vector->nitems, | |
944 | sizeof (struct linetable_entry), compare_line_numbers); | |
945 | } | |
946 | ||
947 | /* Now, allocate a symbol table. */ | |
948 | symtab = allocate_symtab (subfile->name, objfile); | |
4137c5fc | 949 | |
d07734e3 FF |
950 | /* Fill in its components. */ |
951 | symtab->blockvector = blockvector; | |
952 | if (subfile->line_vector) | |
953 | { | |
954 | /* Reallocate the line table on the symbol obstack */ | |
955 | symtab->linetable = (struct linetable *) | |
956 | obstack_alloc (&objfile -> symbol_obstack, linetablesize); | |
957 | memcpy (symtab->linetable, subfile->line_vector, linetablesize); | |
958 | } | |
959 | else | |
960 | { | |
961 | symtab->linetable = NULL; | |
962 | } | |
3c02636b | 963 | symtab->block_line_section = section; |
8275e802 FF |
964 | if (subfile->dirname) |
965 | { | |
966 | /* Reallocate the dirname on the symbol obstack */ | |
967 | symtab->dirname = (char *) | |
968 | obstack_alloc (&objfile -> symbol_obstack, | |
969 | strlen (subfile -> dirname) + 1); | |
970 | strcpy (symtab->dirname, subfile->dirname); | |
971 | } | |
972 | else | |
973 | { | |
974 | symtab->dirname = NULL; | |
975 | } | |
d07734e3 FF |
976 | symtab->free_code = free_linetable; |
977 | symtab->free_ptr = NULL; | |
2b5a8d9c | 978 | |
2e4964ad FF |
979 | /* Use whatever language we have been using for this subfile, |
980 | not the one that was deduced in allocate_symtab from the | |
981 | filename. We already did our own deducing when we created | |
982 | the subfile, and we may have altered our opinion of what | |
983 | language it is from things we found in the symbols. */ | |
984 | symtab->language = subfile->language; | |
985 | ||
609fd033 FF |
986 | /* Save the debug format string (if any) in the symtab */ |
987 | if (subfile -> debugformat != NULL) | |
988 | { | |
989 | symtab->debugformat = obsavestring (subfile->debugformat, | |
990 | strlen (subfile->debugformat), | |
991 | &objfile -> symbol_obstack); | |
992 | } | |
993 | ||
3c02636b JK |
994 | /* All symtabs for the main file and the subfiles share a |
995 | blockvector, so we need to clear primary for everything but | |
996 | the main file. */ | |
2b5a8d9c | 997 | |
3c02636b | 998 | symtab->primary = 0; |
d07734e3 | 999 | } |
3416d90b FF |
1000 | if (subfile->name != NULL) |
1001 | { | |
1002 | free ((PTR) subfile->name); | |
1003 | } | |
1004 | if (subfile->dirname != NULL) | |
1005 | { | |
1006 | free ((PTR) subfile->dirname); | |
1007 | } | |
1008 | if (subfile->line_vector != NULL) | |
d07734e3 | 1009 | { |
3416d90b | 1010 | free ((PTR) subfile->line_vector); |
d07734e3 | 1011 | } |
609fd033 FF |
1012 | if (subfile->debugformat != NULL) |
1013 | { | |
1014 | free ((PTR) subfile->debugformat); | |
1015 | } | |
4137c5fc | 1016 | |
c0302457 | 1017 | nextsub = subfile->next; |
84ffdec2 | 1018 | free ((PTR)subfile); |
c0302457 JG |
1019 | } |
1020 | ||
3c02636b | 1021 | /* Set this for the main source file. */ |
1eeba686 | 1022 | if (symtab) |
d07734e3 | 1023 | { |
3c02636b | 1024 | symtab->primary = 1; |
d07734e3 | 1025 | } |
2b5a8d9c | 1026 | |
d07734e3 FF |
1027 | last_source_file = NULL; |
1028 | current_subfile = NULL; | |
4137c5fc | 1029 | |
d07734e3 | 1030 | return (symtab); |
c0302457 | 1031 | } |
a048c8f5 JG |
1032 | |
1033 | ||
1034 | /* Push a context block. Args are an identifying nesting level (checkable | |
1035 | when you pop it), and the starting PC address of this context. */ | |
1036 | ||
1037 | struct context_stack * | |
1038 | push_context (desc, valu) | |
1039 | int desc; | |
1040 | CORE_ADDR valu; | |
1041 | { | |
1042 | register struct context_stack *new; | |
1043 | ||
1044 | if (context_stack_depth == context_stack_size) | |
1045 | { | |
1046 | context_stack_size *= 2; | |
1047 | context_stack = (struct context_stack *) | |
1ab3bf1b JG |
1048 | xrealloc ((char *) context_stack, |
1049 | (context_stack_size * sizeof (struct context_stack))); | |
a048c8f5 JG |
1050 | } |
1051 | ||
1052 | new = &context_stack[context_stack_depth++]; | |
1053 | new->depth = desc; | |
1054 | new->locals = local_symbols; | |
1055 | new->old_blocks = pending_blocks; | |
1056 | new->start_addr = valu; | |
d07734e3 | 1057 | new->name = NULL; |
a048c8f5 | 1058 | |
d07734e3 | 1059 | local_symbols = NULL; |
a048c8f5 | 1060 | |
d07734e3 | 1061 | return (new); |
a048c8f5 | 1062 | } |
d07734e3 | 1063 | |
48f075eb SS |
1064 | \f |
1065 | /* Compute a small integer hash code for the given name. */ | |
1066 | ||
1067 | int | |
1068 | hashname (name) | |
1069 | char *name; | |
1070 | { | |
1071 | register char *p = name; | |
1072 | register int total = p[0]; | |
1073 | register int c; | |
1074 | ||
1075 | c = p[1]; | |
1076 | total += c << 2; | |
1077 | if (c) | |
1078 | { | |
1079 | c = p[2]; | |
1080 | total += c << 4; | |
1081 | if (c) | |
1082 | { | |
1083 | total += p[3] << 6; | |
1084 | } | |
1085 | } | |
1086 | ||
1087 | /* Ensure result is positive. */ | |
1088 | if (total < 0) | |
1089 | { | |
1090 | total += (1000 << 6); | |
1091 | } | |
1092 | return (total % HASHSIZE); | |
1093 | } | |
1094 | ||
609fd033 FF |
1095 | \f |
1096 | void | |
1097 | record_debugformat (format) | |
1098 | char *format; | |
1099 | { | |
1100 | current_subfile -> debugformat = savestring (format, strlen (format)); | |
1101 | } | |
1102 | ||
c0302457 JG |
1103 | \f |
1104 | /* Initialize anything that needs initializing when starting to read | |
1105 | a fresh piece of a symbol file, e.g. reading in the stuff corresponding | |
1106 | to a psymtab. */ | |
1107 | ||
1108 | void | |
1109 | buildsym_init () | |
1110 | { | |
d07734e3 FF |
1111 | free_pendings = NULL; |
1112 | file_symbols = NULL; | |
1113 | global_symbols = NULL; | |
1114 | pending_blocks = NULL; | |
c0302457 JG |
1115 | } |
1116 | ||
1117 | /* Initialize anything that needs initializing when a completely new | |
1118 | symbol file is specified (not just adding some symbols from another | |
1119 | file, e.g. a shared library). */ | |
1120 | ||
1121 | void | |
1122 | buildsym_new_init () | |
1123 | { | |
c0302457 JG |
1124 | buildsym_init (); |
1125 | } | |
1126 | ||
d07734e3 | 1127 | /* Initializer for this module */ |
095db7ce | 1128 | |
c0302457 JG |
1129 | void |
1130 | _initialize_buildsym () | |
1131 | { | |
c0302457 | 1132 | } |