Home | History | Annotate | Download | only in gcc

Lines Matching defs:hash_table

160    AN EXAMPLE HASH_TABLE DECLARATION
164       hash_table <some_type_hasher> some_type_hash_table;
169    You can then use any of the functions in hash_table's public interface.
170    See hash_table for details.  The interface is very similar to libiberty's
174    to construct the hash_table lazily before first use.  This is done
177       hash_table <some_type_hasher, true> some_type_hash_table;
197       hash_table <nofree_ptr_hash <whatever_type> > whatever_type_hash_table;
209       typedef hash_table <some_info_hasher> info_table_type;
301 /* Limit number of comparisons when calling hash_table<>::verify.  */
374 class hash_table
380   explicit hash_table (size_t, bool ggc = false,
385   explicit hash_table (const hash_table &, bool ggc = false,
390   ~hash_table ();
392   /* Create a hash_table in gc memory.  */
393   static hash_table *
396     hash_table *table = ggc_alloc<hash_table> ();
397     new (table) hash_table (n, true, sanitize_eq_and_hash, GATHER_STATISTICS,
512   void operator= (hash_table&);
514   template<typename T> friend void gt_ggc_mx (hash_table<T> *);
515   template<typename T> friend void gt_pch_nx (hash_table<T> *);
522   template<typename T> friend void gt_pch_nx (hash_table<T> *,
525   template<typename T> friend void gt_cleare_cache (hash_table<T> *);
592    mem-stats.h after hash_table declaration.  */
604 hash_table<Descriptor, Lazy, Allocator>::hash_table (size_t size, bool ggc,
635 hash_table<Descriptor, Lazy, Allocator>::hash_table (const hash_table &h,
676 hash_table<Descriptor, Lazy, Allocator>::~hash_table ()
701 inline typename hash_table<Descriptor, Lazy, Allocator>::value_type *
702 hash_table<Descriptor, Lazy,
732 typename hash_table<Descriptor, Lazy, Allocator>::value_type *
733 hash_table<Descriptor, Lazy,
764 hash_table<Descriptor, Lazy, Allocator>::too_empty_p (unsigned int elts)
779 hash_table<Descriptor, Lazy, Allocator>::expand ()
843 hash_table<Descriptor, Lazy, Allocator>::empty_slow ()
891 hash_table<Descriptor, Lazy, Allocator>::clear_slot (value_type *slot)
908 typename hash_table<Descriptor, Lazy, Allocator>::value_type &
909 hash_table<Descriptor, Lazy, Allocator>
954 typename hash_table<Descriptor, Lazy, Allocator>::value_type *
955 hash_table<Descriptor, Lazy, Allocator>
1027 hash_table<Descriptor, Lazy, Allocator>
1047 hash_table<Descriptor, Lazy, Allocator>
1068 	 (typename hash_table<Descriptor, Lazy, Allocator>::value_type *slot,
1071 hash_table<Descriptor, Lazy, Allocator>::traverse_noresize (Argument argument)
1097 	  (typename hash_table<Descriptor, Lazy, Allocator>::value_type *slot,
1100 hash_table<Descriptor, Lazy, Allocator>::traverse (Argument argument)
1113 hash_table<Descriptor, Lazy, Allocator>::iterator::slide ()
1129 inline typename hash_table<Descriptor, Lazy, Allocator>::iterator &
1130 hash_table<Descriptor, Lazy, Allocator>::iterator::operator ++ ()
1138 /* Iterate through the elements of hash_table HTAB,
1139    using hash_table <....>::iterator ITER,
1151 gt_ggc_mx (hash_table<E> *h)
1153   typedef hash_table<E> table;
1175   hash_table<D> *map = static_cast<hash_table<D> *> (h);
1179       typedef hash_table<D> table;
1190 gt_pch_nx (hash_table<D> *h)
1197       if (hash_table<D>::is_empty (h->m_entries[i])
1198 	  || hash_table<D>::is_deleted (h->m_entries[i]))
1207 gt_pch_nx (hash_table<D> *h, gt_pointer_operator op, void *cookie)
1214 gt_cleare_cache (hash_table<H> *h)
1216   typedef hash_table<H> table;