1 /* hash.c -- hash table routines for BFD
2 Copyright (C) 1993, 94 Free Software Foundation, Inc.
3 Written by Steve Chamberlain <sac@cygnus.com>
5 This file is part of BFD, the Binary File Descriptor library.
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.
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.
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
19 Foundation, Inc., 59 Temple Place - Suite 330, Boston, MA 02111-1307, USA. */
31 BFD provides a simple set of hash table functions. Routines
32 are provided to initialize a hash table, to free a hash table,
33 to look up a string in a hash table and optionally create an
34 entry for it, and to traverse a hash table. There is
35 currently no routine to delete an string from a hash table.
37 The basic hash table does not permit any data to be stored
38 with a string. However, a hash table is designed to present a
39 base class from which other types of hash tables may be
40 derived. These derived types may store additional information
41 with the string. Hash tables were implemented in this way,
42 rather than simply providing a data pointer in a hash table
43 entry, because they were designed for use by the linker back
44 ends. The linker may create thousands of hash table entries,
45 and the overhead of allocating private data and storing and
46 following pointers becomes noticeable.
48 The basic hash table code is in <<hash.c>>.
51 @* Creating and Freeing a Hash Table::
52 @* Looking Up or Entering a String::
53 @* Traversing a Hash Table::
54 @* Deriving a New Hash Table Type::
58 Creating and Freeing a Hash Table, Looking Up or Entering a String, Hash Tables, Hash Tables
60 Creating and freeing a hash table
62 @findex bfd_hash_table_init
63 @findex bfd_hash_table_init_n
64 To create a hash table, create an instance of a <<struct
65 bfd_hash_table>> (defined in <<bfd.h>>) and call
66 <<bfd_hash_table_init>> (if you know approximately how many
67 entries you will need, the function <<bfd_hash_table_init_n>>,
68 which takes a @var{size} argument, may be used).
69 <<bfd_hash_table_init>> returns <<false>> if some sort of
72 @findex bfd_hash_newfunc
73 The function <<bfd_hash_table_init>> take as an argument a
74 function to use to create new entries. For a basic hash
75 table, use the function <<bfd_hash_newfunc>>. @xref{Deriving
76 a New Hash Table Type} for why you would want to use a
77 different value for this argument.
79 @findex bfd_hash_allocate
80 <<bfd_hash_table_init>> will create an obstack which will be
81 used to allocate new entries. You may allocate memory on this
82 obstack using <<bfd_hash_allocate>>.
84 @findex bfd_hash_table_free
85 Use <<bfd_hash_table_free>> to free up all the memory that has
86 been allocated for a hash table. This will not free up the
87 <<struct bfd_hash_table>> itself, which you must provide.
90 Looking Up or Entering a String, Traversing a Hash Table, Creating and Freeing a Hash Table, Hash Tables
92 Looking up or entering a string
94 @findex bfd_hash_lookup
95 The function <<bfd_hash_lookup>> is used both to look up a
96 string in the hash table and to create a new entry.
98 If the @var{create} argument is <<false>>, <<bfd_hash_lookup>>
99 will look up a string. If the string is found, it will
100 returns a pointer to a <<struct bfd_hash_entry>>. If the
101 string is not found in the table <<bfd_hash_lookup>> will
102 return <<NULL>>. You should not modify any of the fields in
103 the returns <<struct bfd_hash_entry>>.
105 If the @var{create} argument is <<true>>, the string will be
106 entered into the hash table if it is not already there.
107 Either way a pointer to a <<struct bfd_hash_entry>> will be
108 returned, either to the existing structure or to a newly
109 created one. In this case, a <<NULL>> return means that an
112 If the @var{create} argument is <<true>>, and a new entry is
113 created, the @var{copy} argument is used to decide whether to
114 copy the string onto the hash table obstack or not. If
115 @var{copy} is passed as <<false>>, you must be careful not to
116 deallocate or modify the string as long as the hash table
120 Traversing a Hash Table, Deriving a New Hash Table Type, Looking Up or Entering a String, Hash Tables
122 Traversing a hash table
124 @findex bfd_hash_traverse
125 The function <<bfd_hash_traverse>> may be used to traverse a
126 hash table, calling a function on each element. The traversal
127 is done in a random order.
129 <<bfd_hash_traverse>> takes as arguments a function and a
130 generic <<void *>> pointer. The function is called with a
131 hash table entry (a <<struct bfd_hash_entry *>>) and the
132 generic pointer passed to <<bfd_hash_traverse>>. The function
133 must return a <<boolean>> value, which indicates whether to
134 continue traversing the hash table. If the function returns
135 <<false>>, <<bfd_hash_traverse>> will stop the traversal and
139 Deriving a New Hash Table Type, , Traversing a Hash Table, Hash Tables
141 Deriving a new hash table type
143 Many uses of hash tables want to store additional information
144 which each entry in the hash table. Some also find it
145 convenient to store additional information with the hash table
146 itself. This may be done using a derived hash table.
148 Since C is not an object oriented language, creating a derived
149 hash table requires sticking together some boilerplate
150 routines with a few differences specific to the type of hash
151 table you want to create.
153 An example of a derived hash table is the linker hash table.
154 The structures for this are defined in <<bfdlink.h>>. The
155 functions are in <<linker.c>>.
157 You may also derive a hash table from an already derived hash
158 table. For example, the a.out linker backend code uses a hash
159 table derived from the linker hash table.
162 @* Define the Derived Structures::
163 @* Write the Derived Creation Routine::
164 @* Write Other Derived Routines::
168 Define the Derived Structures, Write the Derived Creation Routine, Deriving a New Hash Table Type, Deriving a New Hash Table Type
170 Define the derived structures
172 You must define a structure for an entry in the hash table,
173 and a structure for the hash table itself.
175 The first field in the structure for an entry in the hash
176 table must be of the type used for an entry in the hash table
177 you are deriving from. If you are deriving from a basic hash
178 table this is <<struct bfd_hash_entry>>, which is defined in
179 <<bfd.h>>. The first field in the structure for the hash
180 table itself must be of the type of the hash table you are
181 deriving from itself. If you are deriving from a basic hash
182 table, this is <<struct bfd_hash_table>>.
184 For example, the linker hash table defines <<struct
185 bfd_link_hash_entry>> (in <<bfdlink.h>>). The first field,
186 <<root>>, is of type <<struct bfd_hash_entry>>. Similarly,
187 the first field in <<struct bfd_link_hash_table>>, <<table>>,
188 is of type <<struct bfd_hash_table>>.
191 Write the Derived Creation Routine, Write Other Derived Routines, Define the Derived Structures, Deriving a New Hash Table Type
193 Write the derived creation routine
195 You must write a routine which will create and initialize an
196 entry in the hash table. This routine is passed as the
197 function argument to <<bfd_hash_table_init>>.
199 In order to permit other hash tables to be derived from the
200 hash table you are creating, this routine must be written in a
203 The first argument to the creation routine is a pointer to a
204 hash table entry. This may be <<NULL>>, in which case the
205 routine should allocate the right amount of space. Otherwise
206 the space has already been allocated by a hash table type
207 derived from this one.
209 After allocating space, the creation routine must call the
210 creation routine of the hash table type it is derived from,
211 passing in a pointer to the space it just allocated. This
212 will initialize any fields used by the base hash table.
214 Finally the creation routine must initialize any local fields
215 for the new hash table type.
217 Here is a boilerplate example of a creation routine.
218 @var{function_name} is the name of the routine.
219 @var{entry_type} is the type of an entry in the hash table you
220 are creating. @var{base_newfunc} is the name of the creation
221 routine of the hash table type your hash table is derived
226 .struct bfd_hash_entry *
227 .@var{function_name} (entry, table, string)
228 . struct bfd_hash_entry *entry;
229 . struct bfd_hash_table *table;
230 . const char *string;
232 . struct @var{entry_type} *ret = (@var{entry_type} *) entry;
234 . {* Allocate the structure if it has not already been allocated by a
236 . if (ret == (@var{entry_type} *) NULL)
238 . ret = ((@var{entry_type} *)
239 . bfd_hash_allocate (table, sizeof (@var{entry_type})));
240 . if (ret == (@var{entry_type} *) NULL)
244 . {* Call the allocation method of the base class. *}
245 . ret = ((@var{entry_type} *)
246 . @var{base_newfunc} ((struct bfd_hash_entry *) ret, table, string));
248 . {* Initialize the local fields here. *}
250 . return (struct bfd_hash_entry *) ret;
254 The creation routine for the linker hash table, which is in
255 <<linker.c>>, looks just like this example.
256 @var{function_name} is <<_bfd_link_hash_newfunc>>.
257 @var{entry_type} is <<struct bfd_link_hash_entry>>.
258 @var{base_newfunc} is <<bfd_hash_newfunc>>, the creation
259 routine for a basic hash table.
261 <<_bfd_link_hash_newfunc>> also initializes the local fields
262 in a linker hash table entry: <<type>>, <<written>> and
266 Write Other Derived Routines, , Write the Derived Creation Routine, Deriving a New Hash Table Type
268 Write other derived routines
270 You will want to write other routines for your new hash table,
273 You will want an initialization routine which calls the
274 initialization routine of the hash table you are deriving from
275 and initializes any other local fields. For the linker hash
276 table, this is <<_bfd_link_hash_table_init>> in <<linker.c>>.
278 You will want a lookup routine which calls the lookup routine
279 of the hash table you are deriving from and casts the result.
280 The linker hash table uses <<bfd_link_hash_lookup>> in
281 <<linker.c>> (this actually takes an additional argument which
282 it uses to decide how to return the looked up value).
284 You may want a traversal routine. This should just call the
285 traversal routine of the hash table you are deriving from with
286 appropriate casts. The linker hash table uses
287 <<bfd_link_hash_traverse>> in <<linker.c>>.
289 These routines may simply be defined as macros. For example,
290 the a.out backend linker hash table, which is derived from the
291 linker hash table, uses macros for the lookup and traversal
292 routines. These are <<aout_link_hash_lookup>> and
293 <<aout_link_hash_traverse>> in aoutx.h.
296 /* Obstack allocation and deallocation routines. */
297 #define obstack_chunk_alloc malloc
298 #define obstack_chunk_free free
300 /* The default number of entries to use when creating a hash table. */
301 #define DEFAULT_SIZE (4051)
303 /* Create a new hash table, given a number of entries. */
306 bfd_hash_table_init_n (table
, newfunc
, size
)
307 struct bfd_hash_table
*table
;
308 struct bfd_hash_entry
*(*newfunc
) PARAMS ((struct bfd_hash_entry
*,
309 struct bfd_hash_table
*,
315 alloc
= size
* sizeof (struct bfd_hash_entry
*);
316 if (!obstack_begin (&table
->memory
, alloc
))
318 bfd_set_error (bfd_error_no_memory
);
321 table
->table
= ((struct bfd_hash_entry
**)
322 obstack_alloc (&table
->memory
, alloc
));
325 bfd_set_error (bfd_error_no_memory
);
328 memset ((PTR
) table
->table
, 0, alloc
);
330 table
->newfunc
= newfunc
;
334 /* Create a new hash table with the default number of entries. */
337 bfd_hash_table_init (table
, newfunc
)
338 struct bfd_hash_table
*table
;
339 struct bfd_hash_entry
*(*newfunc
) PARAMS ((struct bfd_hash_entry
*,
340 struct bfd_hash_table
*,
343 return bfd_hash_table_init_n (table
, newfunc
, DEFAULT_SIZE
);
346 /* Free a hash table. */
349 bfd_hash_table_free (table
)
350 struct bfd_hash_table
*table
;
352 obstack_free (&table
->memory
, (PTR
) NULL
);
355 /* Look up a string in a hash table. */
357 struct bfd_hash_entry
*
358 bfd_hash_lookup (table
, string
, create
, copy
)
359 struct bfd_hash_table
*table
;
364 register const unsigned char *s
;
365 register unsigned long hash
;
366 register unsigned int c
;
367 struct bfd_hash_entry
*hashp
;
373 s
= (const unsigned char *) string
;
374 while ((c
= *s
++) != '\0')
376 hash
+= c
+ (c
<< 17);
380 hash
+= len
+ (len
<< 17);
383 index
= hash
% table
->size
;
384 for (hashp
= table
->table
[index
];
385 hashp
!= (struct bfd_hash_entry
*) NULL
;
388 if (hashp
->hash
== hash
389 && strcmp (hashp
->string
, string
) == 0)
394 return (struct bfd_hash_entry
*) NULL
;
396 hashp
= (*table
->newfunc
) ((struct bfd_hash_entry
*) NULL
, table
, string
);
397 if (hashp
== (struct bfd_hash_entry
*) NULL
)
398 return (struct bfd_hash_entry
*) NULL
;
403 new = (char *) obstack_alloc (&table
->memory
, len
+ 1);
406 bfd_set_error (bfd_error_no_memory
);
407 return (struct bfd_hash_entry
*) NULL
;
409 strcpy (new, string
);
412 hashp
->string
= string
;
414 hashp
->next
= table
->table
[index
];
415 table
->table
[index
] = hashp
;
420 /* Replace an entry in a hash table. */
423 bfd_hash_replace (table
, old
, nw
)
424 struct bfd_hash_table
*table
;
425 struct bfd_hash_entry
*old
;
426 struct bfd_hash_entry
*nw
;
429 struct bfd_hash_entry
**pph
;
431 index
= old
->hash
% table
->size
;
432 for (pph
= &table
->table
[index
];
433 (*pph
) != (struct bfd_hash_entry
*) NULL
;
446 /* Base method for creating a new hash table entry. */
449 struct bfd_hash_entry
*
450 bfd_hash_newfunc (entry
, table
, string
)
451 struct bfd_hash_entry
*entry
;
452 struct bfd_hash_table
*table
;
455 if (entry
== (struct bfd_hash_entry
*) NULL
)
456 entry
= ((struct bfd_hash_entry
*)
457 bfd_hash_allocate (table
, sizeof (struct bfd_hash_entry
)));
461 /* Allocate space in a hash table. */
464 bfd_hash_allocate (table
, size
)
465 struct bfd_hash_table
*table
;
470 ret
= obstack_alloc (&table
->memory
, size
);
471 if (ret
== NULL
&& size
!= 0)
472 bfd_set_error (bfd_error_no_memory
);
476 /* Traverse a hash table. */
479 bfd_hash_traverse (table
, func
, info
)
480 struct bfd_hash_table
*table
;
481 boolean (*func
) PARAMS ((struct bfd_hash_entry
*, PTR
));
486 for (i
= 0; i
< table
->size
; i
++)
488 struct bfd_hash_entry
*p
;
490 for (p
= table
->table
[i
]; p
!= NULL
; p
= p
->next
)
492 if (! (*func
) (p
, info
))
498 /* A few different object file formats (a.out, COFF, ELF) use a string
499 table. These functions support adding strings to a string table,
500 returning the byte offset, and writing out the table.
502 Possible improvements:
503 + look for strings matching trailing substrings of other strings
504 + better data structures? balanced trees?
505 + look at reducing memory use elsewhere -- maybe if we didn't have
506 to construct the entire symbol table at once, we could get by
507 with smaller amounts of VM? (What effect does that have on the
508 string table reductions?) */
510 /* An entry in the strtab hash table. */
512 struct strtab_hash_entry
514 struct bfd_hash_entry root
;
515 /* Index in string table. */
517 /* Next string in strtab. */
518 struct strtab_hash_entry
*next
;
521 /* The strtab hash table. */
523 struct bfd_strtab_hash
525 struct bfd_hash_table table
;
526 /* Size of strtab--also next available index. */
528 /* First string in strtab. */
529 struct strtab_hash_entry
*first
;
530 /* Last string in strtab. */
531 struct strtab_hash_entry
*last
;
532 /* Whether to precede strings with a two byte length, as in the
533 XCOFF .debug section. */
537 static struct bfd_hash_entry
*strtab_hash_newfunc
538 PARAMS ((struct bfd_hash_entry
*, struct bfd_hash_table
*, const char *));
540 /* Routine to create an entry in a strtab. */
542 static struct bfd_hash_entry
*
543 strtab_hash_newfunc (entry
, table
, string
)
544 struct bfd_hash_entry
*entry
;
545 struct bfd_hash_table
*table
;
548 struct strtab_hash_entry
*ret
= (struct strtab_hash_entry
*) entry
;
550 /* Allocate the structure if it has not already been allocated by a
552 if (ret
== (struct strtab_hash_entry
*) NULL
)
553 ret
= ((struct strtab_hash_entry
*)
554 bfd_hash_allocate (table
, sizeof (struct strtab_hash_entry
)));
555 if (ret
== (struct strtab_hash_entry
*) NULL
)
558 /* Call the allocation method of the superclass. */
559 ret
= ((struct strtab_hash_entry
*)
560 bfd_hash_newfunc ((struct bfd_hash_entry
*) ret
, table
, string
));
564 /* Initialize the local fields. */
565 ret
->index
= (bfd_size_type
) -1;
569 return (struct bfd_hash_entry
*) ret
;
572 /* Look up an entry in an strtab. */
574 #define strtab_hash_lookup(t, string, create, copy) \
575 ((struct strtab_hash_entry *) \
576 bfd_hash_lookup (&(t)->table, (string), (create), (copy)))
578 /* Create a new strtab. */
580 struct bfd_strtab_hash
*
581 _bfd_stringtab_init ()
583 struct bfd_strtab_hash
*table
;
585 table
= (struct bfd_strtab_hash
*) malloc (sizeof (struct bfd_strtab_hash
));
588 bfd_set_error (bfd_error_no_memory
);
592 if (! bfd_hash_table_init (&table
->table
, strtab_hash_newfunc
))
601 table
->xcoff
= false;
606 /* Create a new strtab in which the strings are output in the format
607 used in the XCOFF .debug section: a two byte length precedes each
610 struct bfd_strtab_hash
*
611 _bfd_xcoff_stringtab_init ()
613 struct bfd_strtab_hash
*ret
;
615 ret
= _bfd_stringtab_init ();
624 _bfd_stringtab_free (table
)
625 struct bfd_strtab_hash
*table
;
627 bfd_hash_table_free (&table
->table
);
631 /* Get the index of a string in a strtab, adding it if it is not
632 already present. If HASH is false, we don't really use the hash
633 table, and we don't eliminate duplicate strings. */
636 _bfd_stringtab_add (tab
, str
, hash
, copy
)
637 struct bfd_strtab_hash
*tab
;
642 register struct strtab_hash_entry
*entry
;
646 entry
= strtab_hash_lookup (tab
, str
, true, copy
);
648 return (bfd_size_type
) -1;
652 entry
= ((struct strtab_hash_entry
*)
653 bfd_hash_allocate (&tab
->table
,
654 sizeof (struct strtab_hash_entry
)));
656 return (bfd_size_type
) -1;
658 entry
->root
.string
= str
;
663 n
= (char *) bfd_hash_allocate (&tab
->table
, strlen (str
) + 1);
665 return (bfd_size_type
) -1;
666 entry
->root
.string
= n
;
668 entry
->index
= (bfd_size_type
) -1;
672 if (entry
->index
== (bfd_size_type
) -1)
674 entry
->index
= tab
->size
;
675 tab
->size
+= strlen (str
) + 1;
681 if (tab
->first
== NULL
)
684 tab
->last
->next
= entry
;
691 /* Get the number of bytes in a strtab. */
694 _bfd_stringtab_size (tab
)
695 struct bfd_strtab_hash
*tab
;
700 /* Write out a strtab. ABFD must already be at the right location in
704 _bfd_stringtab_emit (abfd
, tab
)
706 struct bfd_strtab_hash
*tab
;
708 register boolean xcoff
;
709 register struct strtab_hash_entry
*entry
;
713 for (entry
= tab
->first
; entry
!= NULL
; entry
= entry
->next
)
715 register const char *str
;
718 str
= entry
->root
.string
;
719 len
= strlen (str
) + 1;
725 /* The output length includes the null byte. */
726 bfd_put_16 (abfd
, len
, buf
);
727 if (bfd_write ((PTR
) buf
, 1, 2, abfd
) != 2)
731 if (bfd_write ((PTR
) str
, 1, len
, abfd
) != len
)
This page took 0.042777 seconds and 4 git commands to generate.