| /dports/lang/gcc9/gcc-9.4.0/gcc/testsuite/g++.dg/tree-ssa/ |
| H A D | copyprop.C | 209 if ( num_deleted ) { in squash_deleted()
216 return (use_deleted && num_deleted > 0 && equals(get_key(delval), get_key(table[bucknum]))); in test_deleted()
219 return (use_deleted && num_deleted > 0 && equals(get_key(delval), get_key(*it))); in test_deleted()
238 return num_elements - num_deleted; in size()
247 …if (shrink_threshold > 0 && (num_elements-num_deleted) < shrink_threshold && bucket_count() > HT… in maybe_shrink()
258 const size_type resize_to = min_size(num_elements - num_deleted + delta, min_buckets_wanted);
268 …nst EqualKey& eql = EqualKey(),const ExtractKey& ext = ExtractKey()) : num_deleted(0), use_deleted…
271 …dense_hashtable(const dense_hashtable& ht, size_type min_buckets_wanted = 0) : num_deleted(0), u…
355 size_type num_deleted; variable
|
| /dports/devel/arm-none-eabi-gcc492/gcc-4.9.2/gcc/testsuite/g++.dg/tree-ssa/ |
| H A D | copyprop.C | 209 if ( num_deleted ) { in squash_deleted()
216 return (use_deleted && num_deleted > 0 && equals(get_key(delval), get_key(table[bucknum]))); in test_deleted()
219 return (use_deleted && num_deleted > 0 && equals(get_key(delval), get_key(*it))); in test_deleted()
238 return num_elements - num_deleted; in size()
247 …if (shrink_threshold > 0 && (num_elements-num_deleted) < shrink_threshold && bucket_count() > HT… in maybe_shrink()
258 const size_type resize_to = min_size(num_elements - num_deleted + delta, min_buckets_wanted);
268 …nst EqualKey& eql = EqualKey(),const ExtractKey& ext = ExtractKey()) : num_deleted(0), use_deleted…
271 …dense_hashtable(const dense_hashtable& ht, size_type min_buckets_wanted = 0) : num_deleted(0), u…
355 size_type num_deleted; variable
|
| /dports/devel/riscv64-gcc/gcc-8.3.0/gcc/testsuite/g++.dg/tree-ssa/ |
| H A D | copyprop.C | 209 if ( num_deleted ) { in squash_deleted()
216 return (use_deleted && num_deleted > 0 && equals(get_key(delval), get_key(table[bucknum]))); in test_deleted()
219 return (use_deleted && num_deleted > 0 && equals(get_key(delval), get_key(*it))); in test_deleted()
238 return num_elements - num_deleted; in size()
247 …if (shrink_threshold > 0 && (num_elements-num_deleted) < shrink_threshold && bucket_count() > HT… in maybe_shrink()
258 const size_type resize_to = min_size(num_elements - num_deleted + delta, min_buckets_wanted);
268 …nst EqualKey& eql = EqualKey(),const ExtractKey& ext = ExtractKey()) : num_deleted(0), use_deleted…
271 …dense_hashtable(const dense_hashtable& ht, size_type min_buckets_wanted = 0) : num_deleted(0), u…
355 size_type num_deleted; variable
|
| /dports/lang/gnat_util/gcc-6-20180516/gcc/testsuite/g++.dg/tree-ssa/ |
| H A D | copyprop.C | 209 if ( num_deleted ) { in squash_deleted()
216 return (use_deleted && num_deleted > 0 && equals(get_key(delval), get_key(table[bucknum]))); in test_deleted()
219 return (use_deleted && num_deleted > 0 && equals(get_key(delval), get_key(*it))); in test_deleted()
238 return num_elements - num_deleted; in size()
247 …if (shrink_threshold > 0 && (num_elements-num_deleted) < shrink_threshold && bucket_count() > HT… in maybe_shrink()
258 const size_type resize_to = min_size(num_elements - num_deleted + delta, min_buckets_wanted);
268 …nst EqualKey& eql = EqualKey(),const ExtractKey& ext = ExtractKey()) : num_deleted(0), use_deleted…
271 …dense_hashtable(const dense_hashtable& ht, size_type min_buckets_wanted = 0) : num_deleted(0), u…
355 size_type num_deleted; variable
|
| /dports/devel/avr-gcc/gcc-10.2.0/gcc/testsuite/g++.dg/tree-ssa/ |
| H A D | copyprop.C | 209 if ( num_deleted ) { in squash_deleted()
216 return (use_deleted && num_deleted > 0 && equals(get_key(delval), get_key(table[bucknum]))); in test_deleted()
219 return (use_deleted && num_deleted > 0 && equals(get_key(delval), get_key(*it))); in test_deleted()
238 return num_elements - num_deleted; in size()
247 …if (shrink_threshold > 0 && (num_elements-num_deleted) < shrink_threshold && bucket_count() > HT… in maybe_shrink()
258 const size_type resize_to = min_size(num_elements - num_deleted + delta, min_buckets_wanted);
268 …nst EqualKey& eql = EqualKey(),const ExtractKey& ext = ExtractKey()) : num_deleted(0), use_deleted…
271 …dense_hashtable(const dense_hashtable& ht, size_type min_buckets_wanted = 0) : num_deleted(0), u…
355 size_type num_deleted; variable
|
| /dports/lang/gcc11-devel/gcc-11-20211009/gcc/testsuite/g++.dg/tree-ssa/ |
| H A D | copyprop.C | 214 if ( num_deleted ) { in squash_deleted()
221 return (use_deleted && num_deleted > 0 && equals(get_key(delval), get_key(table[bucknum]))); in test_deleted()
224 return (use_deleted && num_deleted > 0 && equals(get_key(delval), get_key(*it))); in test_deleted()
243 return num_elements - num_deleted; in size()
252 …if (shrink_threshold > 0 && (num_elements-num_deleted) < shrink_threshold && bucket_count() > HT… in maybe_shrink()
263 const size_type resize_to = min_size(num_elements - num_deleted + delta, min_buckets_wanted);
273 …nst EqualKey& eql = EqualKey(),const ExtractKey& ext = ExtractKey()) : num_deleted(0), use_deleted…
276 …dense_hashtable(const dense_hashtable& ht, size_type min_buckets_wanted = 0) : num_deleted(0), u…
360 size_type num_deleted; variable
|
| /dports/lang/gcc11/gcc-11.2.0/gcc/testsuite/g++.dg/tree-ssa/ |
| H A D | copyprop.C | 214 if ( num_deleted ) { in squash_deleted()
221 return (use_deleted && num_deleted > 0 && equals(get_key(delval), get_key(table[bucknum]))); in test_deleted()
224 return (use_deleted && num_deleted > 0 && equals(get_key(delval), get_key(*it))); in test_deleted()
243 return num_elements - num_deleted; in size()
252 …if (shrink_threshold > 0 && (num_elements-num_deleted) < shrink_threshold && bucket_count() > HT… in maybe_shrink()
263 const size_type resize_to = min_size(num_elements - num_deleted + delta, min_buckets_wanted);
273 …nst EqualKey& eql = EqualKey(),const ExtractKey& ext = ExtractKey()) : num_deleted(0), use_deleted…
276 …dense_hashtable(const dense_hashtable& ht, size_type min_buckets_wanted = 0) : num_deleted(0), u…
360 size_type num_deleted; variable
|
| /dports/devel/arm-none-eabi-gcc/gcc-8.4.0/gcc/testsuite/g++.dg/tree-ssa/ |
| H A D | copyprop.C | 209 if ( num_deleted ) { in squash_deleted()
216 return (use_deleted && num_deleted > 0 && equals(get_key(delval), get_key(table[bucknum]))); in test_deleted()
219 return (use_deleted && num_deleted > 0 && equals(get_key(delval), get_key(*it))); in test_deleted()
238 return num_elements - num_deleted; in size()
247 …if (shrink_threshold > 0 && (num_elements-num_deleted) < shrink_threshold && bucket_count() > HT… in maybe_shrink()
258 const size_type resize_to = min_size(num_elements - num_deleted + delta, min_buckets_wanted);
268 …nst EqualKey& eql = EqualKey(),const ExtractKey& ext = ExtractKey()) : num_deleted(0), use_deleted…
271 …dense_hashtable(const dense_hashtable& ht, size_type min_buckets_wanted = 0) : num_deleted(0), u…
355 size_type num_deleted; variable
|
| /dports/devel/riscv64-none-elf-gcc/gcc-8.4.0/gcc/testsuite/g++.dg/tree-ssa/ |
| H A D | copyprop.C | 209 if ( num_deleted ) { in squash_deleted()
216 return (use_deleted && num_deleted > 0 && equals(get_key(delval), get_key(table[bucknum]))); in test_deleted()
219 return (use_deleted && num_deleted > 0 && equals(get_key(delval), get_key(*it))); in test_deleted()
238 return num_elements - num_deleted; in size()
247 …if (shrink_threshold > 0 && (num_elements-num_deleted) < shrink_threshold && bucket_count() > HT… in maybe_shrink()
258 const size_type resize_to = min_size(num_elements - num_deleted + delta, min_buckets_wanted);
268 …nst EqualKey& eql = EqualKey(),const ExtractKey& ext = ExtractKey()) : num_deleted(0), use_deleted…
271 …dense_hashtable(const dense_hashtable& ht, size_type min_buckets_wanted = 0) : num_deleted(0), u…
355 size_type num_deleted; variable
|
| /dports/lang/gcc9-aux/gcc-9.1.0/gcc/testsuite/g++.dg/tree-ssa/ |
| H A D | copyprop.C | 209 if ( num_deleted ) { in squash_deleted()
216 return (use_deleted && num_deleted > 0 && equals(get_key(delval), get_key(table[bucknum]))); in test_deleted()
219 return (use_deleted && num_deleted > 0 && equals(get_key(delval), get_key(*it))); in test_deleted()
238 return num_elements - num_deleted; in size()
247 …if (shrink_threshold > 0 && (num_elements-num_deleted) < shrink_threshold && bucket_count() > HT… in maybe_shrink()
258 const size_type resize_to = min_size(num_elements - num_deleted + delta, min_buckets_wanted);
268 …nst EqualKey& eql = EqualKey(),const ExtractKey& ext = ExtractKey()) : num_deleted(0), use_deleted…
271 …dense_hashtable(const dense_hashtable& ht, size_type min_buckets_wanted = 0) : num_deleted(0), u…
355 size_type num_deleted; variable
|
| /dports/misc/cxx_atomics_pic/gcc-11.2.0/gcc/testsuite/g++.dg/tree-ssa/ |
| H A D | copyprop.C | 214 if ( num_deleted ) { in squash_deleted()
221 return (use_deleted && num_deleted > 0 && equals(get_key(delval), get_key(table[bucknum]))); in test_deleted()
224 return (use_deleted && num_deleted > 0 && equals(get_key(delval), get_key(*it))); in test_deleted()
243 return num_elements - num_deleted; in size()
252 …if (shrink_threshold > 0 && (num_elements-num_deleted) < shrink_threshold && bucket_count() > HT… in maybe_shrink()
263 const size_type resize_to = min_size(num_elements - num_deleted + delta, min_buckets_wanted);
273 …nst EqualKey& eql = EqualKey(),const ExtractKey& ext = ExtractKey()) : num_deleted(0), use_deleted…
276 …dense_hashtable(const dense_hashtable& ht, size_type min_buckets_wanted = 0) : num_deleted(0), u…
360 size_type num_deleted; variable
|
| /dports/lang/gcc10/gcc-10.3.0/gcc/testsuite/g++.dg/tree-ssa/ |
| H A D | copyprop.C | 209 if ( num_deleted ) { in squash_deleted()
216 return (use_deleted && num_deleted > 0 && equals(get_key(delval), get_key(table[bucknum]))); in test_deleted()
219 return (use_deleted && num_deleted > 0 && equals(get_key(delval), get_key(*it))); in test_deleted()
238 return num_elements - num_deleted; in size()
247 …if (shrink_threshold > 0 && (num_elements-num_deleted) < shrink_threshold && bucket_count() > HT… in maybe_shrink()
258 const size_type resize_to = min_size(num_elements - num_deleted + delta, min_buckets_wanted);
268 …nst EqualKey& eql = EqualKey(),const ExtractKey& ext = ExtractKey()) : num_deleted(0), use_deleted…
271 …dense_hashtable(const dense_hashtable& ht, size_type min_buckets_wanted = 0) : num_deleted(0), u…
355 size_type num_deleted; variable
|
| /dports/lang/gcc48/gcc-4.8.5/gcc/testsuite/g++.dg/tree-ssa/ |
| H A D | copyprop.C | 209 if ( num_deleted ) { in squash_deleted()
216 return (use_deleted && num_deleted > 0 && equals(get_key(delval), get_key(table[bucknum]))); in test_deleted()
219 return (use_deleted && num_deleted > 0 && equals(get_key(delval), get_key(*it))); in test_deleted()
238 return num_elements - num_deleted; in size()
247 …if (shrink_threshold > 0 && (num_elements-num_deleted) < shrink_threshold && bucket_count() > HT… in maybe_shrink()
258 const size_type resize_to = min_size(num_elements - num_deleted + delta, min_buckets_wanted);
268 …nst EqualKey& eql = EqualKey(),const ExtractKey& ext = ExtractKey()) : num_deleted(0), use_deleted…
271 …dense_hashtable(const dense_hashtable& ht, size_type min_buckets_wanted = 0) : num_deleted(0), u…
355 size_type num_deleted; variable
|
| /dports/lang/gcc9-devel/gcc-9-20211007/gcc/testsuite/g++.dg/tree-ssa/ |
| H A D | copyprop.C | 209 if ( num_deleted ) { in squash_deleted()
216 return (use_deleted && num_deleted > 0 && equals(get_key(delval), get_key(table[bucknum]))); in test_deleted()
219 return (use_deleted && num_deleted > 0 && equals(get_key(delval), get_key(*it))); in test_deleted()
238 return num_elements - num_deleted; in size()
247 …if (shrink_threshold > 0 && (num_elements-num_deleted) < shrink_threshold && bucket_count() > HT… in maybe_shrink()
258 const size_type resize_to = min_size(num_elements - num_deleted + delta, min_buckets_wanted);
268 …nst EqualKey& eql = EqualKey(),const ExtractKey& ext = ExtractKey()) : num_deleted(0), use_deleted…
271 …dense_hashtable(const dense_hashtable& ht, size_type min_buckets_wanted = 0) : num_deleted(0), u…
355 size_type num_deleted; variable
|
| /dports/devel/riscv32-unknown-elf-gcc/gcc-8.4.0/gcc/testsuite/g++.dg/tree-ssa/ |
| H A D | copyprop.C | 209 if ( num_deleted ) { in squash_deleted()
216 return (use_deleted && num_deleted > 0 && equals(get_key(delval), get_key(table[bucknum]))); in test_deleted()
219 return (use_deleted && num_deleted > 0 && equals(get_key(delval), get_key(*it))); in test_deleted()
238 return num_elements - num_deleted; in size()
247 …if (shrink_threshold > 0 && (num_elements-num_deleted) < shrink_threshold && bucket_count() > HT… in maybe_shrink()
258 const size_type resize_to = min_size(num_elements - num_deleted + delta, min_buckets_wanted);
268 …nst EqualKey& eql = EqualKey(),const ExtractKey& ext = ExtractKey()) : num_deleted(0), use_deleted…
271 …dense_hashtable(const dense_hashtable& ht, size_type min_buckets_wanted = 0) : num_deleted(0), u…
355 size_type num_deleted; variable
|
| /dports/lang/gcc8/gcc-8.5.0/gcc/testsuite/g++.dg/tree-ssa/ |
| H A D | copyprop.C | 209 if ( num_deleted ) { in squash_deleted()
216 return (use_deleted && num_deleted > 0 && equals(get_key(delval), get_key(table[bucknum]))); in test_deleted()
219 return (use_deleted && num_deleted > 0 && equals(get_key(delval), get_key(*it))); in test_deleted()
238 return num_elements - num_deleted; in size()
247 …if (shrink_threshold > 0 && (num_elements-num_deleted) < shrink_threshold && bucket_count() > HT… in maybe_shrink()
258 const size_type resize_to = min_size(num_elements - num_deleted + delta, min_buckets_wanted);
268 …nst EqualKey& eql = EqualKey(),const ExtractKey& ext = ExtractKey()) : num_deleted(0), use_deleted…
271 …dense_hashtable(const dense_hashtable& ht, size_type min_buckets_wanted = 0) : num_deleted(0), u…
355 size_type num_deleted; variable
|
| /dports/lang/gcc10-devel/gcc-10-20211008/gcc/testsuite/g++.dg/tree-ssa/ |
| H A D | copyprop.C | 209 if ( num_deleted ) { in squash_deleted()
216 return (use_deleted && num_deleted > 0 && equals(get_key(delval), get_key(table[bucknum]))); in test_deleted()
219 return (use_deleted && num_deleted > 0 && equals(get_key(delval), get_key(*it))); in test_deleted()
238 return num_elements - num_deleted; in size()
247 …if (shrink_threshold > 0 && (num_elements-num_deleted) < shrink_threshold && bucket_count() > HT… in maybe_shrink()
258 const size_type resize_to = min_size(num_elements - num_deleted + delta, min_buckets_wanted);
268 …nst EqualKey& eql = EqualKey(),const ExtractKey& ext = ExtractKey()) : num_deleted(0), use_deleted…
271 …dense_hashtable(const dense_hashtable& ht, size_type min_buckets_wanted = 0) : num_deleted(0), u…
355 size_type num_deleted; variable
|
| /dports/devel/mingw32-gcc/gcc-4.8.1/gcc/testsuite/g++.dg/tree-ssa/ |
| H A D | copyprop.C | 209 if ( num_deleted ) { in squash_deleted()
216 return (use_deleted && num_deleted > 0 && equals(get_key(delval), get_key(table[bucknum]))); in test_deleted()
219 return (use_deleted && num_deleted > 0 && equals(get_key(delval), get_key(*it))); in test_deleted()
238 return num_elements - num_deleted; in size()
247 …if (shrink_threshold > 0 && (num_elements-num_deleted) < shrink_threshold && bucket_count() > HT… in maybe_shrink()
258 const size_type resize_to = min_size(num_elements - num_deleted + delta, min_buckets_wanted);
268 …nst EqualKey& eql = EqualKey(),const ExtractKey& ext = ExtractKey()) : num_deleted(0), use_deleted…
271 …dense_hashtable(const dense_hashtable& ht, size_type min_buckets_wanted = 0) : num_deleted(0), u…
355 size_type num_deleted; variable
|
| /dports/lang/gcc12-devel/gcc-12-20211205/gcc/testsuite/g++.dg/tree-ssa/ |
| H A D | copyprop.C | 214 if ( num_deleted ) { in squash_deleted()
221 return (use_deleted && num_deleted > 0 && equals(get_key(delval), get_key(table[bucknum]))); in test_deleted()
224 return (use_deleted && num_deleted > 0 && equals(get_key(delval), get_key(*it))); in test_deleted()
243 return num_elements - num_deleted; in size()
252 …if (shrink_threshold > 0 && (num_elements-num_deleted) < shrink_threshold && bucket_count() > HT… in maybe_shrink()
263 const size_type resize_to = min_size(num_elements - num_deleted + delta, min_buckets_wanted);
273 …nst EqualKey& eql = EqualKey(),const ExtractKey& ext = ExtractKey()) : num_deleted(0), use_deleted…
276 …dense_hashtable(const dense_hashtable& ht, size_type min_buckets_wanted = 0) : num_deleted(0), u…
360 size_type num_deleted; variable
|
| /dports/lang/gcc6-aux/gcc-6-20180516/gcc/testsuite/g++.dg/tree-ssa/ |
| H A D | copyprop.C | 209 if ( num_deleted ) { in squash_deleted()
216 return (use_deleted && num_deleted > 0 && equals(get_key(delval), get_key(table[bucknum]))); in test_deleted()
219 return (use_deleted && num_deleted > 0 && equals(get_key(delval), get_key(*it))); in test_deleted()
238 return num_elements - num_deleted; in size()
247 …if (shrink_threshold > 0 && (num_elements-num_deleted) < shrink_threshold && bucket_count() > HT… in maybe_shrink()
258 const size_type resize_to = min_size(num_elements - num_deleted + delta, min_buckets_wanted);
268 …nst EqualKey& eql = EqualKey(),const ExtractKey& ext = ExtractKey()) : num_deleted(0), use_deleted…
271 …dense_hashtable(const dense_hashtable& ht, size_type min_buckets_wanted = 0) : num_deleted(0), u…
355 size_type num_deleted; variable
|
| /dports/www/chromium-legacy/chromium-88.0.4324.182/chrome/browser/extensions/api/identity/ |
| H A D | identity_clear_all_cached_auth_tokens_function.h | 25 void OnCookiesDeleted(uint32_t num_deleted);
|
| /dports/biology/cufflinks/cufflinks-2.2.1-89-gdc3b0cb/src/ |
| H A D | hits.h | 72 extern int num_deleted;
86 num_deleted++; in ReadHit()
114 num_deleted++; in ReadHit()
142 num_deleted++; in ReadHit()
159 num_deleted++; in ReadHit()
164 --num_deleted; in ~ReadHit()
|
| /dports/databases/evolution-data-server/evolution-data-server-3.42.1/tests/libedata-cal/ |
| H A D | test-intervaltree.c | 227 gint num_deleted = 0; in random_test() local
359 num_deleted++; in random_test()
365 g_print ("Number of intervals deleted: %d\n", num_deleted); in random_test()
|
| /dports/cad/graywolf/graywolf-0.1.6-4-gf47937b/src/twsc/ |
| H A D | utemp.c | 354 INT cells_in_row , index , num_deleted ; in rm_overlapping_feeds() local
357 num_deleted = 0 ; in rm_overlapping_feeds()
376 num_deleted++ ; in rm_overlapping_feeds()
383 num_deleted++ ; in rm_overlapping_feeds()
393 return( num_deleted ) ; in rm_overlapping_feeds()
|
| /dports/devel/libfirm/libfirm-1.21.0/ir/adt/ |
| H A D | hashset.h | 48 size_t num_deleted; member
|