/haiku-buildtools/gcc/gcc/testsuite/gcc.dg/ipa/ |
H A D | inlinehint-4.c | 17 lookup (int val) function 33 return lookup (i) + lookup (2 * i) + lookup (3 * i) + lookup (4 * i) + 34 lookup (5 * i) + lookup (6 * i) + lookup (7 * i) + lookup (8 * i) + 35 lookup ( [all...] |
/haiku-buildtools/gcc/gcc/testsuite/g++.dg/lto/ |
H A D | pr54625-1_1.C | 7 double lookup (UnaryFunType p1) function in class:A 18 b.lookup (sin);
|
H A D | pr54625-2_1.C | 7 void lookup (UnaryFunType p1) function in class:A 17 b.lookup (sin); 23 c.lookup (0);
|
/haiku-buildtools/gcc/gcc/testsuite/g++.dg/tm/ |
H A D | pr47530-2.C | 13 __attribute__((transaction_safe)) bool lookup(); 16 bool RBTree::lookup() function in class:RBTree 30 SET->lookup();
|
/haiku-buildtools/gcc/gcc/testsuite/g++.old-deja/g++.brendan/ |
H A D | groff1.C | 20 void lookup(symbol s, void *v=0) { win = 1; } function in class:dictionary 21 void lookup(const char *) {} function in class:dictionary 30 exceptions.lookup (symbol (buf), tem);
|
/haiku-buildtools/gcc/gcc/testsuite/g++.dg/warn/ |
H A D | Wreturn-4.C | 34 test (LookupResult *lookup) argument 36 Handle <JSObject> holder (lookup->holder ()); 37 switch (lookup->type ())
|
/haiku-buildtools/gcc/gcc/testsuite/gcc.dg/ |
H A D | 20050309-1.c | 8 void lookup (); 25 lookup (schema, name, -1);
|
/haiku-buildtools/gcc/gcc/testsuite/go.test/test/bench/shootout/ |
H A D | fasta.c | 109 * probabilities. Careful selection of table size allows lookup 118 fill_lookup(struct amino_acid **lookup, struct amino_acid *amino_acid, int amino_acid_size) { argument 134 lookup[i] = &amino_acid[j]; 143 struct amino_acid *lookup[LOOKUP_SIZE]; local 149 fill_lookup(lookup, amino_acid, amino_acid_size); 160 struct amino_acid *u = lookup[(short)r];
|
H A D | fasta.go | 87 var lookup [LookupSize]*Acid 99 for i := range lookup { 103 lookup[i] = &acid[j] 106 return &lookup 110 lookup := computeLookup(acid) 122 a := lookup[int(r)]
|
/haiku-buildtools/legacy/binutils/opcodes/ |
H A D | w65-dis.c | 33 print_operand (int lookup, char *format, int *args) argument 44 if (lookup)
|
/haiku-buildtools/gcc/gcc/testsuite/g++.old-deja/g++.other/ |
H A D | inline8.C | 62 lookup_t lookup; variable 67 lookup.insert(pair<NAMES_ITEM,size_t>(item,0));
|
/haiku-buildtools/binutils/opcodes/ |
H A D | w65-dis.c | 35 print_operand (int lookup, char *format, int *args) argument 46 if (lookup)
|
/haiku-buildtools/gcc/gcc/testsuite/go.test/test/bench/go1/ |
H A D | fasta_test.go | 129 var lookup [fastaLookupSize]*fastaAcid 141 for i := range lookup { 145 lookup[i] = &acid[j] 148 return &lookup 157 lookup := fastaComputeLookup(acid) 169 a := lookup[int(r)]
|
/haiku-buildtools/gcc/gcc/ |
H A D | typed-splay-tree.h | 42 value_type lookup (key_type k); 81 typed_splay_tree<KEY_TYPE, VALUE_TYPE>::lookup (key_type key) function in class:typed_splay_tree
|
/haiku-buildtools/binutils/gold/ |
H A D | dirsearch.cc | 112 Dir_cache* lookup(const char*) const; 138 if (this->lookup(dirname) != NULL) 156 Dir_caches::lookup(const char* dirname) const function in class:__anon544::Dir_caches 241 // Search for a file. NOTE: we only log failed file-lookup attempts 258 Dir_cache* pdc = caches->lookup(p->name().c_str());
|
/haiku-buildtools/binutils/ld/testsuite/ld-cris/ |
H A D | gotplt1.d | 14 # having an unnecessary PLT, dynamic reloc and lookup in the
|
H A D | pr16044.d | 16 # R_CRIS_RELATIVE relocation without symbol lookup. As part of
|
/haiku-buildtools/legacy/binutils/ld/testsuite/ld-cris/ |
H A D | gotplt1.d | 14 # having an unnecessary PLT, dynamic reloc and lookup in the
|
/haiku-buildtools/gcc/gcc/go/gofrontend/ |
H A D | unsafe.cc | 42 Named_object* no = package->bindings()->lookup("Pointer");
|
/haiku-buildtools/gcc/libcilkrts/runtime/ |
H A D | reducer_impl.cpp | 162 elem *lookup(void *key); 503 elem *cilkred_map::lookup(void *key) function in class:cilkred_map 580 elem *el = h->lookup(key); 588 fprintf(stderr, "[W=%d, key=%p, lookup in map %p, found el=%p, about to destroy]\n", 641 CILK_ASSERT(h->lookup(key) == NULL); 645 fprintf(stderr, "[W=%d, hb=%p, lookup in map %p of view %p, should be null]\n", 658 // The address of the leftmost value is the same as the key for lookup. 685 elem* el = h->lookup(key); 687 /* lookup failed; insert a new default element */ 849 elem *this_el = lookup(ke [all...] |
/haiku-buildtools/gcc/gcc/testsuite/go.test/test/ |
H A D | map.go | 537 panic(fmt.Sprintln("float32 map allows NaN lookup (a)")) 540 panic(fmt.Sprintln("float32 map allows NaN lookup (b)")) 573 panic(fmt.Sprintln("float64 map allows NaN lookup (a)")) 576 panic(fmt.Sprintln("float64 map allows NaN lookup (b)")) 609 panic(fmt.Sprintln("complex64 map allows NaN lookup (a)")) 612 panic(fmt.Sprintln("complex64 map allows NaN lookup (b)")) 645 panic(fmt.Sprintln("complex128 map allows NaN lookup (a)")) 648 panic(fmt.Sprintln("complex128 map allows NaN lookup (b)"))
|
/haiku-buildtools/legacy/binutils/ld/ |
H A D | mri.c | 57 lookup (const char *name, struct section_name_struct **list) function 83 struct section_name_struct **ptr = lookup (name, list);
|
/haiku-buildtools/gcc/gcc/testsuite/g++.dg/torture/ |
H A D | pr53752.C | 105 maybe_value lookup(key const &key) const; 154 optional<device_details> mdetail = pool_->md_->details_->lookup(key);
|
/haiku-buildtools/binutils/ld/ |
H A D | mri.c | 58 lookup (const char *name, struct section_name_struct **list) function 85 struct section_name_struct **ptr = lookup (name, list);
|
/haiku-buildtools/gcc/gcc/testsuite/g++.old-deja/g++.mike/ |
H A D | p1989.C | 370 vertex<T> *lookup(const T& from) const; 413 vertex<T> *fromv = lookup(from); 427 Graph<T>::lookup(const T& from) const function in class:Graph 440 vertex<T> *v = lookup(from);
|