/haiku-buildtools/gcc/gcc/testsuite/g++.dg/opt/ |
H A D | const2.C | 12 int wd, ht; member in struct:QSize 17 { wd = ht = -1; } 20 { wd = w; ht = h; } 23 { return QSize(s1.wd+s2.wd, s1.ht+s2.ht); } 39 if (s.wd != 100 || s.ht != 200)
|
/haiku-buildtools/gcc/libstdc++-v3/testsuite/23_containers/unordered_set/ |
H A D | instantiation_neg.cc | 43 hashtable ht;
|
/haiku-buildtools/legacy/gcc/libf2c/libI77/ |
H A D | rsne.c | 72 hash(ht, s) hashtab *ht; register char *s; 74 hash(hashtab *ht, register char *s) 83 for(h = *(zot = ht->tab + x % ht->htsize); h; h = h->next) 97 hashtab *ht; local 120 ht = (hashtab *)malloc(sizeof(hashtab) + (nht-1)*sizeof(hashentry *) 122 if (!ht) 124 he = (hashentry *)&ht->tab[nht]; 125 ht 301 hashtab *ht; local [all...] |
/haiku-buildtools/gcc/gcc/testsuite/go.test/test/bench/shootout/ |
H A D | k-nucleotide.c | 47 GHashTable *ht, GTrashStack **ts, GPtrArray *roots, GStringChunk *sc) 65 stat = g_hash_table_lookup(ht, key); 82 g_hash_table_insert(ht, key, stat); 124 GHashTable *ht; local 128 ht = g_hash_table_new_full(g_str_hash, g_str_equal, NULL /* free key */, NULL /* free value */); 132 total = generate_frequencies (fl, buffer, buflen, ht, ts, roots, sc); 136 g_hash_table_foreach(ht, sorted_list, &lst); 141 g_hash_table_destroy(ht); 149 GHashTable *ht; local 157 ht 46 generate_frequencies(int fl, char *buffer, long buflen, GHashTable *ht, GTrashStack **ts, GPtrArray *roots, GStringChunk *sc) argument [all...] |
H A D | chameneosredux.c | 142 pthread_t ht; member in struct:Creature 240 pthread_create( &cr->ht, &cr->stack_att, &CreatureThreadRun, (void*)(cr) ); 275 pthread_join( creatures[i].ht, 0 );
|
/haiku-buildtools/gcc/gcc/testsuite/gcc.dg/tree-ssa/ |
H A D | ifc-4.c | 4 struct ht struct 27 struct ht *hash_table;
|
/haiku-buildtools/gcc/libcpp/include/ |
H A D | symtab.h | 40 typedef struct ht cpp_hash_table; 46 struct ht struct 97 extern void ht_load (cpp_hash_table *ht, hashnode *entries,
|
H A D | cpplib.h | 740 extern cpp_reader *cpp_create_reader (enum c_lang, struct ht *,
|
/haiku-buildtools/gcc/gcc/testsuite/g++.dg/lto/ |
H A D | 20101010-1_0.C | 77 dense_hashtable < Value, Value, HashFcn, Identity, EqualKey, Alloc > ht; typedef in class:dense_hash_set 78 ht rep; 80 typedef typename ht::value_type value_type; 81 typedef typename ht::const_iterator iterator; 84 pair < typename ht::iterator, bool > p = rep.insert (obj);
|
/haiku-buildtools/gcc/gcc/testsuite/g++.dg/tree-ssa/ |
H A D | copyprop.C | 156 dense_hashtable_iterator(const dense_hashtable<V,K,HF,ExK,EqK,A> *h, pointer it, pointer it_end, bool advance) : ht(h), pos(it), end(it_end) { 161 while ( pos != end && (ht->test_empty(*this) || ht->test_deleted(*this)) ) ++pos; 163 const dense_hashtable<V,K,HF,ExK,EqK,A> *ht; member in struct:dense_hashtable_iterator 171 dense_hashtable_const_iterator(const dense_hashtable<V,K,HF,ExK,EqK,A> *h, pointer it, pointer it_end, bool advance) : ht(h), pos(it), end(it_end) { 178 while ( pos != end && (ht->test_empty(*this) || ht->test_deleted(*this))) ++pos; 182 const dense_hashtable<V,K,HF,ExK,EqK,A> *ht; member in struct:dense_hashtable_const_iterator 263 void copy_from(const dense_hashtable &ht, size_type min_buckets_wanted = 0) { argument 265 const size_type resize_to = min_size(ht 271 dense_hashtable(const dense_hashtable& ht, size_type min_buckets_wanted = 0) argument 284 swap(dense_hashtable& ht) argument 386 typedef dense_hashtable<pair<const Key, T>, Key, HashFcn, SelectKey, EqualKey, Alloc> ht; typedef in class:dense_hash_map 414 typedef dense_hashtable<Value, Value, HashFcn, Identity, EqualKey, Alloc> ht; typedef in class:dense_hash_set [all...] |
/haiku-buildtools/gcc/gcc/testsuite/gfortran.dg/ |
H A D | assumed_rank_9.f90 | 71 call ht(yac) 74 call ht(yac) 129 subroutine ht (x) subroutine in program:main
|
H A D | use_only_3.inc | 641 SUBROUTINE cell_init_ht( box, ht ) 643 REAL(DP) :: ht(3,3) 777 SUBROUTINE cell_base_reinit( ht ) 778 REAL(DP), INTENT(IN) :: ht (3,3)
|
/haiku-buildtools/gcc/gcc/ |
H A D | toplev.h | 86 extern struct ht *ident_hash;
|
H A D | stringpool.c | 58 struct ht *ident_hash;
|
H A D | fold-const.c | 14148 hash_table<pointer_hash<const tree_node> > ht (32); 14151 fold_checksum_tree (expr, &ctx, &ht); 14153 ht.empty (); 14158 fold_checksum_tree (expr, &ctx, &ht); 14172 hash_table<pointer_hash<const tree_node> > ht (32); 14175 fold_checksum_tree (expr, &ctx, &ht); 14190 hash_table<pointer_hash <const tree_node> > *ht) 14200 slot = ht->find_slot (expr, INSERT); 14237 fold_checksum_tree (TREE_TYPE (expr), ctx, ht); 14243 fold_checksum_tree (TREE_CHAIN (expr), ctx, ht); 14160 fold_checksum_tree(const_tree expr, struct md5_ctx *ctx, hash_table<pointer_hash <const tree_node> > *ht) argument 14208 fold_checksum_tree (TREE_TYPE (expr), ctx, ht); local 14214 fold_checksum_tree (TREE_CHAIN (expr), ctx, ht); local 14225 fold_checksum_tree (TREE_REALPART (expr), ctx, ht); local 14226 fold_checksum_tree (TREE_IMAGPART (expr), ctx, ht); local 14230 fold_checksum_tree (VECTOR_CST_ELT (expr, i), ctx, ht); local 14240 fold_checksum_tree (TREE_PURPOSE (expr), ctx, ht); local 14241 fold_checksum_tree (TREE_VALUE (expr), ctx, ht); local 14247 fold_checksum_tree (TREE_VEC_ELT (expr, i), ctx, ht); local 14262 fold_checksum_tree (TREE_OPERAND (expr, i), ctx, ht); local 14265 fold_checksum_tree (DECL_NAME (expr), ctx, ht); local 14266 fold_checksum_tree (DECL_CONTEXT (expr), ctx, ht); local 14269 fold_checksum_tree (DECL_SIZE (expr), ctx, ht); local 14270 fold_checksum_tree (DECL_SIZE_UNIT (expr), ctx, ht); local 14271 fold_checksum_tree (DECL_INITIAL (expr), ctx, ht); local 14272 fold_checksum_tree (DECL_ABSTRACT_ORIGIN (expr), ctx, ht); local 14273 fold_checksum_tree (DECL_ATTRIBUTES (expr), ctx, ht); local 14280 fold_checksum_tree (DECL_VINDEX (expr), ctx, ht); local 14281 fold_checksum_tree (DECL_ARGUMENTS (expr), ctx, ht); local 14283 fold_checksum_tree (DECL_RESULT_FLD (expr), ctx, ht); local 14288 fold_checksum_tree (TYPE_VALUES (expr), ctx, ht); local 14289 fold_checksum_tree (TYPE_SIZE (expr), ctx, ht); local 14290 fold_checksum_tree (TYPE_SIZE_UNIT (expr), ctx, ht); local 14291 fold_checksum_tree (TYPE_ATTRIBUTES (expr), ctx, ht); local 14292 fold_checksum_tree (TYPE_NAME (expr), ctx, ht); local 14296 fold_checksum_tree (TYPE_MIN_VALUE (expr), ctx, ht); local 14297 fold_checksum_tree (TYPE_MAX_VALUE (expr), ctx, ht); local 14299 fold_checksum_tree (TYPE_MAIN_VARIANT (expr), ctx, ht); local 14303 fold_checksum_tree (TYPE_BINFO (expr), ctx, ht); local 14304 fold_checksum_tree (TYPE_CONTEXT (expr), ctx, ht); local [all...] |
/haiku-buildtools/gcc/libcpp/ |
H A D | symtab.c | 259 ht_load (cpp_hash_table *ht, hashnode *entries, argument 263 if (ht->entries_owned) 264 free (ht->entries); 265 ht->entries = entries; 266 ht->nslots = nslots; 267 ht->nelements = nelements; 268 ht->entries_owned = own;
|
H A D | internal.h | 528 struct ht *hash_table;
|
/haiku-buildtools/gcc/gcc/testsuite/g++.dg/torture/ |
H A D | pr58464.C | 10 typedef struct ht cpp_hash_table; 15 struct ht { struct 72 ht *hash_table;
|
H A D | pr51959.C | 21 int ht; member in class:QSize
|
/haiku-buildtools/gcc/gcc/testsuite/gcc.c-torture/compile/ |
H A D | pr34688.c | 7 HashTable *ht; member in struct:_zend_guard 128 if (php_convert_filter_ctor(inst, conv_mode, (filterparams != ((void *)0) ? (*filterparams).value.ht : ((void *)0)), filtername, persistent) != 0) {
|
/haiku-buildtools/legacy/gcc/gcc/ |
H A D | function.c | 1686 original_regno, used_p, ht) 1694 struct hash_table *ht; 1757 fixup_var_refs (reg, promoted_mode, TREE_UNSIGNED (type), ht); 1762 fixup_var_refs (var, promoted_mode, unsignedp, ht) 1766 struct hash_table *ht; 1775 stack == 0, ht); 1777 if (ht) 1845 fixup_var_refs_insns (var, promoted_mode, unsignedp, insn, toplevel, ht) 1851 struct hash_table *ht; 1858 if (ht) 3392 struct hash_table *ht; member in struct:insns_for_mem_walk_info 3486 struct hash_table ht; local [all...] |
/haiku-buildtools/binutils/binutils/ |
H A D | windmc.c | 585 unichar *ht = n->message; local 591 while (txt_len > 0 && ht[txt_len - 1] > 0 && ht[txt_len - 1] < 0x20) 592 ht[--txt_len] = 0; 601 while (*ht != 0) 603 target_put_16 (ret->data + txt_len, *ht++);
|
/haiku-buildtools/binutils/bfd/ |
H A D | elf32-bfin.c | 1944 bfinfdpic_relocs_info_find (struct htab *ht, 1951 if (!ht) 1954 loc = (struct bfinfdpic_relocs_info **) htab_find_slot (ht, entry, insert); 1980 bfinfdpic_relocs_info_for_global (struct htab *ht, 1992 return bfinfdpic_relocs_info_find (ht, abfd, &entry, insert); 1999 bfinfdpic_relocs_info_for_local (struct htab *ht, 2011 return bfinfdpic_relocs_info_find (ht, abfd, &entry, insert); 1940 bfinfdpic_relocs_info_find(struct htab *ht, bfd *abfd, const struct bfinfdpic_relocs_info *entry, enum insert_option insert) argument 1976 bfinfdpic_relocs_info_for_global(struct htab *ht, bfd *abfd, struct elf_link_hash_entry *h, bfd_vma addend, enum insert_option insert) argument 1995 bfinfdpic_relocs_info_for_local(struct htab *ht, bfd *abfd, long symndx, bfd_vma addend, enum insert_option insert) argument
|
/haiku-buildtools/legacy/binutils/bfd/ |
H A D | elf64-hppa.c | 276 elf64_hppa_dyn_hash_table_init (struct elf64_hppa_dyn_hash_table *ht, argument 281 memset (ht, 0, sizeof (*ht)); 282 return bfd_hash_table_init (&ht->root, new, entsize);
|
/haiku-buildtools/gcc/gcc/java/ |
H A D | class.c | 3183 java_treetreehash_find (hash_table<treetreehasher> *ht, tree t) 3187 e = ht->find_with_hash (t, hv); 3195 java_treetreehash_new (hash_table<treetreehasher> *ht, tree t) 3200 treetreehash_entry **e = ht->find_slot_with_hash (t, hv, INSERT);
|