| /src/usr.sbin/traceroute/ |
| trrt2netbsd | 123 sub uniq { subroutine
|
| /src/crypto/external/bsd/openssl/dist/test/recipes/ |
| tconversion.pl | 134 sub uniq (@) { subroutine
144 return scalar(uniq @lines);
|
| /src/external/gpl3/autoconf/dist/lib/Autom4te/ |
| General.pm | 59 &uniq);
323 =item C<uniq (@list)>
331 # uniq (@LIST)
333 sub uniq (@) subroutine
|
| /src/sys/external/bsd/compiler_rt/dist/lib/tsan/tests/rtl/ |
| tsan_test_util_posix.cc | 77 static atomic_uintptr_t uniq = {(uintptr_t)&foo}; // Some real address. local
81 uintptr_t addr = atomic_fetch_add(&uniq, size, memory_order_relaxed);
|
| /src/usr.sbin/services_mkdb/ |
| uniq.c | 1 /* $NetBSD: uniq.c,v 1.7 2021/03/22 03:28:55 christos Exp $ */
32 __RCSID("$NetBSD: uniq.c,v 1.7 2021/03/22 03:28:55 christos Exp $");
67 uniq(const char *fname) function
|
| /src/crypto/external/apache2/openssl/dist/test/recipes/ |
| tconversion.pl | 154 sub uniq (@) { subroutine
164 return scalar(uniq @lines);
|
| /src/external/apache2/llvm/dist/clang/utils/perf-training/ |
| perf-helper.py | 250 def uniq(list): function
260 return uniq(s for symbols in symbol_lists for s in symbols)
267 # First, uniq all the lists.
268 uniq_lists = [list(uniq(symbols)) for symbols in symbol_lists]
284 return uniq(s
304 merged_symbols = uniq(s for symbols in symbol_lists
|
| /src/external/gpl3/gcc/dist/gcc/ |
| tree-switch-conversion.cc | 1479 /* Return true when RANGE of case values with UNIQ labels
1484 unsigned int uniq)
1493 return uniq <= m_max_case_bit_tests;
1533 /* Return true when COUNT of cases of UNIQ labels is beneficial for bit test
1537 bit_test_cluster::is_beneficial (unsigned count, unsigned uniq)
1539 return (((uniq == 1 && count >= 3)
1540 || (uniq == 2 && count >= 5)
1541 || (uniq == 3 && count >= 6)));
1563 unsigned uniq = bitmap_count_bits (dest_bbs);
1565 return is_beneficial (count, uniq);
1562 unsigned uniq = bitmap_count_bits (dest_bbs); local
[all...] |
| /src/external/gpl3/gcc.old/dist/gcc/ |
| tree-switch-conversion.cc | 1377 /* Return true when RANGE of case values with UNIQ labels
1382 unsigned int uniq)
1391 return uniq <= m_max_case_bit_tests;
1431 /* Return true when COUNT of cases of UNIQ labels is beneficial for bit test
1435 bit_test_cluster::is_beneficial (unsigned count, unsigned uniq)
1437 return (((uniq == 1 && count >= 3)
1438 || (uniq == 2 && count >= 5)
1439 || (uniq == 3 && count >= 6)));
1461 unsigned uniq = bitmap_count_bits (dest_bbs);
1463 return is_beneficial (count, uniq);
1460 unsigned uniq = bitmap_count_bits (dest_bbs); local
[all...] |
| /src/external/gpl2/gmake/dist/ |
| job.c | 257 unsigned uniq = 1;
268 uniq < 0x10000)
273 base, uniq, ext);
288 ++uniq;
255 unsigned uniq = 1; local
|
| /src/external/public-domain/sqlite/dist/autosetup/ |
| jimsh0.c | 309 unsigned int uniq; member in struct:Jim_HashTable
351 #define Jim_HashKey(ht, key) ((ht)->type->hashFunction(key) + (ht)->uniq)
530 unsigned int uniq; member in struct:Jim_Dict
7504 ht->uniq = (rand() ^ time(NULL) ^ clock());
7506 ht->uniq = 0;
7541 n.uniq = ht->uniq;
13082 unsigned h = (JimObjectHTHashFunction(keyObjPtr) + dict->uniq);
13193 dict->uniq = (rand() ^ time(NULL) ^ clock());
13219 newDict->uniq = oldDict->uniq
[all...] |
