2 Copyright (C) 2000, 2001, 2003, 2004, 2007 Free Software Foundation, Inc.
4 This program is free software; you can redistribute it and/or modify it
5 under the terms of the GNU General Public License as published by the
6 Free Software Foundation; either version 2, or (at your option) any
9 This program is distributed in the hope that it will be useful,
10 but WITHOUT ANY WARRANTY; without even the implied warranty of
11 MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
12 GNU General Public License for more details.
14 You should have received a copy of the GNU General Public License
15 along with this program; if not, write to the Free Software
16 Foundation, 51 Franklin Street, Fifth Floor, Boston, MA 02110-1301, USA. */
18 #ifndef LIBCPP_SYMTAB_H
19 #define LIBCPP_SYMTAB_H
21 #if defined(__APPLE__) && defined(__MACH__)
22 #include "libiberty/obstack.h"
27 #define GTY(x) /* nothing */
30 /* This is what each hash table entry points to. It may be embedded
31 deeply within another object. */
32 typedef struct ht_identifier ht_identifier;
33 struct ht_identifier GTY(())
35 const unsigned char *str;
37 unsigned int hash_value;
40 #define HT_LEN(NODE) ((NODE)->len)
41 #define HT_STR(NODE) ((NODE)->str)
43 typedef struct ht hash_table;
44 typedef struct ht_identifier *hashnode;
46 enum ht_lookup_option {HT_NO_INSERT = 0, HT_ALLOC, HT_ALLOCED};
48 /* An identifier hash table for cpplib and the front ends. */
51 /* Identifiers are allocated from here. */
55 /* Call back, allocate a node. */
56 hashnode (*alloc_node) (hash_table *);
57 /* Call back, allocate something that hangs off a node like a cpp_macro.
58 NULL means use the usual allocator. */
59 void * (*alloc_subobject) (size_t);
61 unsigned int nslots; /* Total slots in the entries array. */
62 unsigned int nelements; /* Number of live elements. */
64 /* Link to reader, if any. For the benefit of cpplib. */
65 struct cpp_reader *pfile;
67 /* Table usage statistics. */
68 unsigned int searches;
69 unsigned int collisions;
71 /* Should 'entries' be freed when it is no longer needed? */
75 /* Initialize the hashtable with 2 ^ order entries. */
76 extern hash_table *ht_create (unsigned int order);
78 /* Frees all memory associated with a hash table. */
79 extern void ht_destroy (hash_table *);
81 extern hashnode ht_lookup (hash_table *, const unsigned char *,
82 size_t, enum ht_lookup_option);
83 extern hashnode ht_lookup_with_hash (hash_table *, const unsigned char *,
85 enum ht_lookup_option);
86 #define HT_HASHSTEP(r, c) ((r) * 67 + ((c) - 113));
87 #define HT_HASHFINISH(r, len) ((r) + (len))
89 /* For all nodes in TABLE, make a callback. The callback takes
90 TABLE->PFILE, the node, and a PTR, and the callback sequence stops
91 if the callback returns zero. */
92 typedef int (*ht_cb) (struct cpp_reader *, hashnode, const void *);
93 extern void ht_forall (hash_table *, ht_cb, const void *);
95 /* Restore the hash table. */
96 extern void ht_load (hash_table *ht, hashnode *entries,
97 unsigned int nslots, unsigned int nelements, bool own);
99 /* Dump allocation statistics to stderr. */
100 extern void ht_dump_statistics (hash_table *);
102 #endif /* LIBCPP_SYMTAB_H */