| /src/external/gpl2/groff/dist/src/roff/troff/ |
| dictionary.h | 50 void rehash(int);
|
| /src/external/apache2/llvm/dist/libcxx/benchmarks/ |
| ContainerBenchmarks.h | 69 c.rehash(16);
125 c.rehash(8);
|
| /src/bin/sh/ |
| exec.c | 93 char rehash; /* if set, cd done since entry created */ member in struct:tblentry
555 if (cmdp->rehash)
624 if (cmdp != NULL && cmdp->rehash == 0)
635 if (cmdp) { /* doing a rehash */
660 /* if rehash, don't redo absolute path names */
753 cmdp->rehash = 0;
832 cmdp->rehash = 1;
994 cmdp->rehash = 0;
|
| /src/external/gpl2/gmake/dist/ |
| dir.c | 591 int rehash = 0;
643 * filesystems force a rehash always as mtime does not change
651 rehash = 1;
657 rehash = 1;
661 if (!rehash)
706 if (! rehash || HASH_VACANT (*dirfile_slot))
587 int rehash = 0; local
|
| /src/external/gpl3/gcc.old/dist/libphobos/testsuite/libphobos.aa/ |
| test_aa.d | 95 aa.rehash;
424 test.rehash;
425 test["test3"] = "test3"; // causes divide by zero if rehash broke the AA
429 /// stops using binit, in order to test another code path in rehash.
437 aa.rehash;
583 map.rehash;
|
| /src/external/historical/nawk/dist/ |
| proto.h | 103 extern void rehash(Array *);
|
| tran.c | 37 #define FULLTAB 2 /* rehash when table gets this x full */
249 rehash(tp);
267 void rehash(Array *tp) /* rehash items in small table into big one */ function
|
| /src/external/gpl3/binutils/dist/bfd/ |
| ecoff.c | 2900 *REHASH to the rehash adjustment if the first slot is taken. SIZE
2906 unsigned int *rehash,
2918 *rehash = (hash & (size - 1)) | 1;
3029 unsigned int hash, rehash, srch;
3035 hash = ecoff_armap_hash (stringbase + name_offset, &rehash, count,
3040 /* See if we can rehash to this location. */
3041 for (srch = (hash + rehash) & (count - 1);
3043 srch = (srch + rehash) & (count - 1))
3191 unsigned int hash, rehash = 0
3021 unsigned int hash, rehash, srch; local
3183 unsigned int hash, rehash = 0; local
3640 unsigned int hash, rehash = 0; local
[all...] |
| /src/external/gpl3/binutils.old/dist/bfd/ |
| ecoff.c | 2890 *REHASH to the rehash adjustment if the first slot is taken. SIZE
2896 unsigned int *rehash,
2908 *rehash = (hash & (size - 1)) | 1;
3019 unsigned int hash, rehash, srch;
3025 hash = ecoff_armap_hash (stringbase + name_offset, &rehash, count,
3030 /* See if we can rehash to this location. */
3031 for (srch = (hash + rehash) & (count - 1);
3033 srch = (srch + rehash) & (count - 1))
3181 unsigned int hash, rehash = 0
3011 unsigned int hash, rehash, srch; local
3173 unsigned int hash, rehash = 0; local
3630 unsigned int hash, rehash = 0; local
[all...] |
| /src/external/gpl3/gdb/dist/bfd/ |
| ecoff.c | 2902 *REHASH to the rehash adjustment if the first slot is taken. SIZE
2908 unsigned int *rehash,
2920 *rehash = (hash & (size - 1)) | 1;
3031 unsigned int hash, rehash, srch;
3037 hash = ecoff_armap_hash (stringbase + name_offset, &rehash, count,
3042 /* See if we can rehash to this location. */
3043 for (srch = (hash + rehash) & (count - 1);
3045 srch = (srch + rehash) & (count - 1))
3193 unsigned int hash, rehash = 0
3023 unsigned int hash, rehash, srch; local
3185 unsigned int hash, rehash = 0; local
3642 unsigned int hash, rehash = 0; local
[all...] |
| /src/external/gpl3/gdb.old/dist/bfd/ |
| ecoff.c | 2899 *REHASH to the rehash adjustment if the first slot is taken. SIZE
2905 unsigned int *rehash,
2917 *rehash = (hash & (size - 1)) | 1;
3028 unsigned int hash, rehash, srch;
3034 hash = ecoff_armap_hash (stringbase + name_offset, &rehash, count,
3039 /* See if we can rehash to this location. */
3040 for (srch = (hash + rehash) & (count - 1);
3042 srch = (srch + rehash) & (count - 1))
3190 unsigned int hash, rehash = 0
3020 unsigned int hash, rehash, srch; local
3182 unsigned int hash, rehash = 0; local
3639 unsigned int hash, rehash = 0; local
[all...] |
| /src/external/gpl3/gcc/dist/libstdc++-v3/include/bits/ |
| unordered_set.h | 849 * @brief May rehash the %unordered_set.
852 * Rehash will occur only if the new number of buckets respect the
856 rehash(size_type __n) function in class:unordered_set
857 { _M_h.rehash(__n); }
864 * Same as rehash(ceil(n / max_load_factor())).
1694 * @brief May rehash the %unordered_multiset.
1697 * Rehash will occur only if the new number of buckets respect the
1701 rehash(size_type __n) function in class:unordered_multiset
1702 { _M_h.rehash(__n); }
1709 * Same as rehash(ceil(n / max_load_factor()))
[all...] |
| unordered_map.h | 1116 * @brief May rehash the %unordered_map.
1119 * Rehash will occur only if the new number of buckets respect the
1123 rehash(size_type __n) function in class:unordered_map
1124 { _M_h.rehash(__n); }
1131 * Same as rehash(ceil(n / max_load_factor())).
2016 * @brief May rehash the %unordered_multimap.
2019 * Rehash will occur only if the new number of buckets respect the
2023 rehash(size_type __n) function in class:unordered_multimap
2024 { _M_h.rehash(__n); }
2031 * Same as rehash(ceil(n / max_load_factor()))
[all...] |
| hashtable.h | 617 rehash(__l_bkt_count);
1026 void rehash(size_type __bkt_count);
1228 // Helper rehash method used when keys are unique.
1231 // Helper rehash method used when keys can be non-unique.
2353 // Second compute the hash code so that we don't rehash if it throws.
2590 rehash(size_type __bkt_count) function in class:_Hashtable
2605 // Rehash when there is no equivalent elements.
2647 // Rehash when there can be equivalent elements, preserve their relative
|
| hashtable_policy.h | 586 /// Default value for rehash policy. Bucket size is (usually) the
664 /// Rehash policy providing power of 2 bucket numbers. Avoids modulo
701 // Set next resize to the max value so that we never try to rehash again
1214 * rehash policy supports it.
1224 /// Specialization when rehash policy doesn't provide load factor management.
1235 /// Specialization when rehash policy provide load factor management.
1268 __this->rehash(__this->__rehash_policy()._M_bkt_for_elements(__n));
|
| /src/external/gpl3/gcc.old/dist/libstdc++-v3/include/bits/ |
| unordered_set.h | 844 * @brief May rehash the %unordered_set.
847 * Rehash will occur only if the new number of buckets respect the
851 rehash(size_type __n) function in class:unordered_set
852 { _M_h.rehash(__n); }
859 * Same as rehash(ceil(n / max_load_factor())).
1689 * @brief May rehash the %unordered_multiset.
1692 * Rehash will occur only if the new number of buckets respect the
1696 rehash(size_type __n) function in class:unordered_multiset
1697 { _M_h.rehash(__n); }
1704 * Same as rehash(ceil(n / max_load_factor()))
[all...] |
| unordered_map.h | 1110 * @brief May rehash the %unordered_map.
1113 * Rehash will occur only if the new number of buckets respect the
1117 rehash(size_type __n) function in class:unordered_map
1118 { _M_h.rehash(__n); }
1125 * Same as rehash(ceil(n / max_load_factor())).
2010 * @brief May rehash the %unordered_multimap.
2013 * Rehash will occur only if the new number of buckets respect the
2017 rehash(size_type __n) function in class:unordered_multimap
2018 { _M_h.rehash(__n); }
2025 * Same as rehash(ceil(n / max_load_factor()))
[all...] |
| hashtable.h | 609 rehash(__l_bkt_count);
850 // rehash (assumes no element with same key already present).
983 void rehash(size_type __bkt_count);
1148 // Helper rehash method used when keys are unique.
1151 // Helper rehash method used when keys can be non-unique.
2291 // Second compute the hash code so that we don't rehash if it throws.
2529 rehash(size_type __bkt_count) function in class:_Hashtable
2540 // No rehash, restore previous state to keep it consistent with
2567 // Rehash when there is no equivalent elements.
2609 // Rehash when there can be equivalent elements, preserve their relativ
[all...] |
| hashtable_policy.h | 502 /// Default value for rehash policy. Bucket size is (usually) the
580 /// Rehash policy providing power of 2 bucket numbers. Avoids modulo
617 // Set next resize to the max value so that we never try to rehash again
1109 * rehash policy supports it.
1119 /// Specialization when rehash policy doesn't provide load factor management.
1130 /// Specialization when rehash policy provide load factor management.
1163 __this->rehash(__this->__rehash_policy()._M_bkt_for_elements(__n));
|
| /src/external/mit/lua/dist/src/ |
| ltable.c | 389 ** Rehash
608 static void rehash (lua_State *L, Table *t, const TValue *ek) { function
701 rehash(L, t, key); /* grow table */
|
| /src/external/mpl/dhcp/bind/dist/lib/dns/ |
| rbt.c | 424 rehash(dns_rbt_t *rbt, uint32_t newbits);
1114 * those hash table slots, then rehash the RBT if necessary.
2400 rehash(dns_rbt_t *rbt, uint32_t newbits) { function
2437 rehash(rbt, newbits);
2442 * Add a node to the hash table. Rehash the hashtable if the node count
|
| /src/external/gpl3/gcc/dist/libstdc++-v3/include/tr1/ |
| hashtable.h | 415 void rehash(size_type __n);
862 // Allocate the new node before doing the rehash so that we don't
863 // do a rehash if the allocation throws.
1142 rehash(size_type __n) function in class:tr1::_Hashtable
|
| /src/external/gpl3/gcc.old/dist/libstdc++-v3/include/tr1/ |
| hashtable.h | 415 void rehash(size_type __n);
862 // Allocate the new node before doing the rehash so that we don't
863 // do a rehash if the allocation throws.
1142 rehash(size_type __n) function in class:tr1::_Hashtable
|
| /src/external/gpl3/gcc.old/dist/libphobos/libdruntime/ |
| object.d | 19 * $(MYREF rehash)
2924 T rehash(T : Value[Key], Value, Key)(T aa)
2931 T rehash(T : Value[Key], Value, Key)(T* aa)
2938 T rehash(T : shared Value[Key], Value, Key)(T aa)
2945 T rehash(T : shared Value[Key], Value, Key)(T* aa)
|
| /src/external/gpl3/gdb/dist/gdbsupport/ |
| unordered_dense.h | 1848 void rehash(size_t count) { function in class:ankerl::unordered_dense::ANKERL_UNORDERED_DENSE_NAMESPACE::detail::table
|
