| /development/tools/apkcheck/src/com/android/apkcheck/ |
| ApkCheck.java | 222 * It also means filling the field/method hash tables with lots of
223 * entries that never get used, possibly worsening the hash table
|
| /external/apache-http/src/org/apache/http/conn/routing/ |
| HttpRoute.java | 375 * Generates a hash code for this route.
377 * @return the hash code
|
| RouteTracker.java | 363 * Generates a hash code for this tracked route.
368 * @return the hash code
|
| /external/blktrace/doc/ |
| blkparse.1 | 108 \-\-hash\-by\-name
110 Hash processes by name, not by PID
|
| /external/bluetooth/glib/gio/ |
| gfilemonitor.c | 493 /* Set a timeout at 2*rate limit so that we can clear out the change from the hash eventualy */
699 /* Set a timeout of 2*rate limit so that we can clear out the change from the hash eventualy */
|
| /external/e2fsprogs/debugfs/ |
| set_fields.c | 372 fprintf(stderr, "Invalid hash algorithm: %s\n", arg);
435 type = "hash algorithm";
|
| /external/e2fsprogs/e2fsck/ |
| problem.c | 726 /* Unsupported hash version in HTREE directory */
728 N_("@h %i has an unsupported hash version (%N)\n"),
779 N_("@a in @i %i has a hash (%N) which is @n (must be 0)\n"),
1122 /* Node in HTREE directory has bad min hash */
1124 N_("@p @h %d: node (%B) has bad min hash\n"),
1127 /* Node in HTREE directory has bad max hash */
1129 N_("@p @h %d: node (%B) has bad max hash\n"),
[all...] |
| /external/grub/stage2/ |
| xfs.h | 62 typedef xfs_uint32_t xfs_dahash_t; /* dir/attr hash value */
299 xfs_dahash_t hashval; /* hash value for this descendant */
|
| /external/guava/src/com/google/common/primitives/ |
| Booleans.java | 48 * Returns a hash code for {@code value}; equal to the result of invoking
52 * @return a hash code for the value
|
| Bytes.java | 48 * Returns a hash code for {@code value}; equal to the result of invoking
52 * @return a hash code for the value
|
| /external/icu4c/common/ |
| rbbicst.pl | 55 # Put in a hash, together with the current state number,
356 # At the same time, store the index corresponding to the set name back into hash.
|
| udata.c | 79 static UHashtable *gCommonDataCache = NULL; /* Global hash table of opened ICU data files. */
193 * udata cleanup function closes the hash table; hash table in turn calls back to
199 uprv_free(p->name); /* delete the hash key string. */
204 * Get the hash table used to store the data cache entries.
278 /* Create a new DataCacheElement - the thingy we store in the hash table -
304 /* Stick the new DataCacheElement into the hash table.
885 copyPData.map = 0; /* The mapping for this data is owned by the hash table */
[all...] |
| /external/icu4c/common/unicode/ |
| uchriter.h | 120 * Generates a hash code for this iterator.
121 * @return the hash code.
|
| /external/icu4c/i18n/ |
| regexcst.pl | 56 # Put in a hash, together with the current state number,
221 # At the same time, store the index corresponding to the set name back into hash.
|
| /external/ipsec-tools/src/racoon/ |
| algorithm.c | 297 /* oakley hash algorithm */
306 plog(LLV_DEBUG, LOCATION, NULL, "hash(%s)\n",
|
| /external/openssl/crypto/engine/ |
| README | 134 example tb_cipher.c, implements a hash-table keyed by integer "nid" values.
135 These nids provide the uniquenness of an algorithm/mode - and each nid will hash
|
| /external/openssl/crypto/ |
| md32_common.h | 55 * 32 bit values and invokes a block function that performs actual hash
94 * macro convering context variables to an ASCII hash string.
|
| /external/openssl/crypto/rsa/ |
| rsa.h | 382 const EVP_MD *Hash, const unsigned char *EM, int sLen);
385 const EVP_MD *Hash, int sLen);
|
| /external/openssl/crypto/x509/ |
| x509_cmp.c | 156 /* ensure hash is valid */
320 /* I now DER encode the name and hash it. Since I cache the DER encoding,
|
| /external/openssl/include/openssl/ |
| rsa.h | 382 const EVP_MD *Hash, const unsigned char *EM, int sLen);
385 const EVP_MD *Hash, int sLen);
|
| /external/srec/portable/src/ |
| phashtable.c | 488 * Removes the entry from its hash table.
547 * Iterates on the next key and value. Returns a NULL key when at the end of the hash table.
|
| /external/srec/tools/thirdparty/OpenFst/fst/lib/ |
| factor-weight.h | 303 // Hash function for Elements to Fst states.
307 return static_cast<size_t>(x.state * kPrime + x.weight.Hash());
|
| minimize.h | 67 const ssize_t xfinal = fst_.Final(x).Hash();
68 const ssize_t yfinal = fst_.Final(y).Hash();
|
| string-weight.h | 108 ssize_t Hash() const;
267 inline ssize_t StringWeight<L, S>::Hash() const {
|
| /external/stlport/stlport/stl/ |
| _hash_map.h | 42 template <class _Key, class _Tp, _STLP_DFL_TMPL_PARAM(_HashFcn,hash<_Key>),
233 template <class _Key, class _Tp, _STLP_DFL_TMPL_PARAM(_HashFcn,hash<_Key>),
|
