| /external/srec/tools/thirdparty/OpenFst/fst/lib/ |
| encode.h | 69 // Hash function for EncodeTabe Tuples. Based on the encode flags
70 // we either hash the labels, weights or compbination of them.
86 size_t hash = x->ilabel << lshift; local
87 if (encode_flags_ & kEncodeLabels) hash ^= x->olabel >> rshift;
88 if (encode_flags_ & kEncodeWeights) hash ^= x->weight.Hash();
89 return hash;
192 // The Encode mapper stores the encoding in a local hash table (EncodeTable)
|
| /external/stlport/stlport/stl/ |
| _collate.h | 59 long hash(const char* __low, const char* __high) const function in class:collate
95 long hash(const wchar_t* __low, const wchar_t* __high) const function in class:collate
|
| /external/webkit/WebCore/bindings/v8/custom/ |
| V8LocationCustom.cpp | 64 INC_STATS("DOM.Location.hash._set");
67 String hash = toWebCoreString(value); local
76 if (hash.startsWith("#"))
77 hash = hash.substring(1);
78 if (oldRef == hash || (oldRef.isNull() && hash.isEmpty()))
80 url.setFragmentIdentifier(hash);
|
| /external/webkit/WebCore/platform/graphics/wx/ |
| FontPlatformDataWx.cpp | 110 // make a hash that is unique for this font, but not globally unique - that is,
111 // a font whose properties are equal should generate the same hash
|
| /external/webkit/WebKitTools/DumpRenderTree/ |
| PixelDumpSupport.cpp | 48 // Compute the hash of the bitmap context pixels
53 // Check the computed hash against the expected one and dump image on mismatch
|
| /frameworks/base/awt/java/awt/ |
| BufferCapabilities.java | 176 * Returns the hash code of the FlipContents object.
178 * @return the hash code of the FlipContents object.
|
| /frameworks/base/awt/java/awt/font/ |
| FontRenderContext.java | 166 * Returns hash code of the FontRenderContext object.
168 * @return the hash code of the FontRenderContext object.
|
| /packages/providers/ContactsProvider/src/com/android/providers/contacts/ |
| CommonNicknameCache.java | 59 * filter using the corresponding hash codes. The idea is to eliminate most
61 * its hash code and see if it is set in the Bloom filter. If not, we will know
|
| /external/ipsec-tools/src/racoon/ |
| isakmp_cfg.c | 134 * We expect HDR, HASH, ATTR
229 "Cannot compute hash\n");
236 "Hash verification failed\n");
1121 vchar_t *hash = NULL; local
1172 /* get IV and HASH(1) if skeyid_a was generated. */
1181 /* generate HASH(1) */
1182 hash = oakley_compute_hash1(iph2->ph1, iph2->msgid, payload);
1183 if (hash == NULL) {
1189 tlen = hash->l;
1193 hash = NULL
[all...] |
| isakmp_ident.c | 371 * rsa: HDR, KE, [ HASH(1), ] <IDi1_b>PubKey_r, <Ni_b>PubKey_r
372 * rev: HDR, [ HASH(1), ] <Ni_b>Pubkey_r, <KE_b>Ke_i,
643 /* generate HASH to send */
645 iph1->hash = oakley_ph1hash_common(iph1, GENERATE);
646 if (iph1->hash == NULL)
649 iph1->hash = NULL;
654 /* create HDR;ID;HASH payload */
1162 * rsa: HDR, KE, [ HASH(1), ] <IDi1_b>PubKey_r, <Ni_b>PubKey_r
1163 * rev: HDR, [ HASH(1), ] <Ni_b>Pubkey_r, <KE_b>Ke_i,
[all...] |
| /dalvik/libcore/concurrent/src/main/java/java/util/concurrent/ |
| Exchanger.java | 96 * an "arena"; basically a kind of hash table with a dynamically
99 * based on a hash of their Thread ids. If an incoming thread
129 * failures. (This is analogous to resizing a regular hash table
151 * tradeoffs of all hash tables. Here, we use a one-step FNV-1a
152 * hash code based on the current thread's Thread.getId(), along
161 * after collision in a hash table. (We move circularly, in
349 * Returns a hash index for the current thread. Uses a one-step
350 * FNV-1a hash code (http://www.isthe.com/chongo/tech/comp/fnv/)
351 * based on the current thread's Thread.getId(). These hash codes
361 * retried after rotating the hash by nbits bits, while forcing ne
372 int hash = (((int)(id ^ (id >>> 32))) ^ 0x811c9dc5) * 0x01000193; local
[all...] |
| /dalvik/vm/native/ |
| InternalNative.c | 69 * Set up hash values on the class names.
103 u4 hash; local
105 hash = dvmComputeUtf8Hash(classDescriptor);
110 if (pClass->classDescriptorHash == hash &&
|
| /external/bison/ |
| Android.mk | 28 lib/hash.c \
|
| /external/dbus/bus/ |
| selinux.h | 26 #include <dbus/dbus-hash.h>
|
| /external/dropbear/libtomcrypt/src/misc/ |
| error_to_string.c | 36 "Invalid hash specified.",
|
| /external/e2fsprogs/intl/ |
| hash-string.h | 34 /* Compute the hash value for the given string. */
|
| /external/elfutils/libdw/ |
| dwarf_end.c | 50 allocated separately, but the abbreviation hash tables need
|
| /external/guava/src/com/google/common/collect/ |
| Hashing.java | 23 * Static methods for implementing hash-based collections.
|
| /external/icu4c/test/intltest/ |
| sfwdchit.h | 27 * Generates a hash code for this iterator.
|
| /external/ipsec-tools/src/racoon/samples/ |
| racoon.conf.sample | 53 # - permutation of the crypto/hash/compression algorithms presented below
|
| /external/libxml2/ |
| NOTICE | 1 Except where otherwise noted in the source code (e.g. the files hash.c,
|
| /external/openssl/android.testssl/ |
| CAss.cnf | 72 subjectKeyIdentifier=hash
|
| /external/openssl/crypto/lhash/ |
| lhash.h | 59 /* Header for dynamic hash table routines
84 unsigned long hash; member in struct:lhash_node_st
100 /* First: "hash" functions */
142 LHASH_HASH_FN_TYPE hash; member in struct:lhash_st
|
| /external/openssl/include/openssl/ |
| lhash.h | 59 /* Header for dynamic hash table routines
84 unsigned long hash; member in struct:lhash_node_st
100 /* First: "hash" functions */
142 LHASH_HASH_FN_TYPE hash; member in struct:lhash_st
|
| /external/oprofile/libop/ |
| op_config_24.h | 66 * nr entries in hash map. This is the maximum number of name components
|
