| /external/deqp/framework/delibs/depool/ |
| dePoolHash.h | 23 * \brief Memory pool hash class.
45 * \brief Declare a template pool hash class interface.
46 * \param TYPENAME Type name of the declared hash.
50 * This macro declares the interface for a hash. For the implementation of
51 * the hash, see DE_IMPLEMENT_POOL_HASH. Usually this macro is put into the
56 * The functions for operating the hash are:
60 * Hash* Hash_create (deMemPool* pool);
61 * int Hash_getNumElements (const Hash* hash);
62 * Value* Hash_find (Hash* hash, Key key)
[all...] |
| /external/llvm/test/tools/llvm-profdata/Inputs/ |
| vp-malform.proftext | 2 # Func Hash:
11 # Func Hash:
20 # Func Hash:
|
| vp-malform2.proftext | 2 # Func Hash:
11 # Func Hash:
|
| /cts/tests/tests/webkit/assets/webkit/ |
| test_anchor.html | 7 document.title = self.document.location.hash.substring(1);
|
| /external/llvm/test/tools/llvm-readobj/Inputs/ |
| gnuhash.so.elf-i386 | |
| /toolchain/binutils/binutils-2.25/ld/testsuite/ld-mips-elf/ |
| hash1a.d | 2 #ld: -shared --hash-style=sysv
|
| export-class-call16.ld | 8 .hash : { *(.hash) }
|
| /toolchain/binutils/binutils-2.25/bfd/ |
| hash.c | 0 /* hash.c -- hash table routines for BFD
30 Hash Tables
32 @cindex Hash tables
33 BFD provides a simple set of hash table functions. Routines
34 are provided to initialize a hash table, to free a hash table,
35 to look up a string in a hash table and optionally create an
36 entry for it, and to traverse a hash table. There is
37 currently no routine to delete an string from a hash table
434 unsigned long hash; local
462 unsigned long hash; local
[all...] |
| /external/libchrome/crypto/third_party/nss/ |
| rsawrapr.c | 26 const SECHashObject *hash; local
30 hash = HASH_GetHashObject(hashAlg);
31 if (hash == NULL)
34 hashContext = (*hash->create)();
35 rounds = (maskLen + hash->length - 1) / hash->length;
44 (*hash->begin)(hashContext);
45 (*hash->update)(hashContext, mgfSeed, mgfSeedLen);
46 (*hash->update)(hashContext, C, sizeof C);
48 tempHash = mask + counter * hash->length
78 const SECHashObject *hash; local
[all...] |
| /prebuilts/go/darwin-x86/src/crypto/ |
| crypto.go | 9 "hash"
14 // Hash identifies a cryptographic hash function that is implemented in another
16 type Hash uint
18 // HashFunc simply returns the value of h so that Hash implements SignerOpts.
19 func (h Hash) HashFunc() Hash {
24 MD4 Hash = 1 + iota // import golang.org/x/crypto/md4
60 // Size returns the length, in bytes, of a digest resulting from the given hash
61 // function. It doesn't require that the hash function in question be linke
[all...] |
| /prebuilts/go/linux-x86/src/crypto/ |
| crypto.go | 9 "hash"
14 // Hash identifies a cryptographic hash function that is implemented in another
16 type Hash uint
18 // HashFunc simply returns the value of h so that Hash implements SignerOpts.
19 func (h Hash) HashFunc() Hash {
24 MD4 Hash = 1 + iota // import golang.org/x/crypto/md4
60 // Size returns the length, in bytes, of a digest resulting from the given hash
61 // function. It doesn't require that the hash function in question be linke
[all...] |
| /external/libxml2/python/tests/ |
| compareNodes.py | 9 # Testing XML Node comparison and Node hash-value
30 # Next check that the hash function for the objects also works ok
31 if not (hash(foonode1) == hash(foonode2)):
32 print("Error hash values for two equal nodes are different")
34 if not (hash(foonode1) != hash(root)):
35 print("Error hash values for two unequal nodes are not different")
37 if hash(foonode1) == hash(root)
[all...] |
| /external/curl/tests/data/ |
| test1306 | 6 hash
20 internal hash create/add/destroy testing
|
| /external/libxml2/test/schemas/ |
| bug152470_1.xml | 7 ><hash>vXENc+Um/9/NvmYKiHDLaErK0gk=</hash></keyIdentifier>
|
| /external/llvm/test/Transforms/ArgumentPromotion/ |
| 2008-09-07-CGUpdate.ll | 3 define internal fastcc i32 @hash(i32* %ts, i32 %mod) nounwind {
10 %0 = call fastcc i32 @hash( i32* %ts, i32 0 ) nounwind ; <i32> [#uses=0]
|
| /toolchain/binutils/binutils-2.25/ld/testsuite/ld-elf/ |
| provide-hidden-1.ld | 14 .hash : { *(.hash) }
|
| provide-hidden-2.ld | 11 .hash : { *(.hash) }
|
| /toolchain/binutils/binutils-2.25/ld/testsuite/ld-vax-elf/ |
| plt-local-lib.ld | 4 .hash : { *(.hash) }
|
| /external/icu/icu4c/source/common/ |
| uhash.c | 20 /* This hashtable is implemented as a double hash. All elements are
22 * resolution (no linked list, etc.). When there is a hash collision
24 * using a secondary hash. The secondary hash is an increment
25 * computed as a hash function (a different one) of the primary
26 * hashcode. This increment is added to the initial hash value to
27 * obtain further slots assigned to the same hash code. For this to
120 #define HASH_DELETE_KEY_VALUE(hash, keypointer, valuepointer) \
121 if (hash->keyDeleter != NULL && keypointer != NULL) { \
122 (*hash->keyDeleter)(keypointer);
[all...] |
| /external/deqp/framework/delibs/debase/ |
| deSha1.c | 21 * \brief SHA1 hash functions.
50 stream->hash[0] = 0x67452301u;
51 stream->hash[1] = 0xEFCDAB89u;
52 stream->hash[2] = 0x98BADCFEu;
53 stream->hash[3] = 0x10325476u;
54 stream->hash[4] = 0xC3D2E1F0u;
75 deUint32 a = stream->hash[0];
76 deUint32 b = stream->hash[1];
77 deUint32 c = stream->hash[2];
78 deUint32 d = stream->hash[3]
267 const char* const hash; member in struct:__anon9953
287 deSha1 hash; local
299 deSha1 hash; local
358 deSha1 hash; local
[all...] |
| /external/zopfli/src/zopfli/ |
| hash.h | 21 The hash for ZopfliFindLongestMatch of lz77.c.
30 int* head; /* Hash value to index of its most recent occurance. */
31 unsigned short* prev; /* Index to index of prev. occurance of same hash. */
32 int* hashval; /* Index to hash value at this index. */
33 int val; /* Current hash value. */
36 /* Fields with similar purpose as the above hash, but for the second hash with
38 int* head2; /* Hash value to index of its most recent occurance. */
39 unsigned short* prev2; /* Index to index of prev. occurance of same hash. */
40 int* hashval2; /* Index to hash value at this index. *
[all...] |
| /frameworks/base/sax/java/android/sax/ |
| Children.java | 31 int hash = uri.hashCode() * 31 + localName.hashCode(); local
32 int index = hash & 15;
37 current = new Child(parent, uri, localName, parent.depth + 1, hash);
44 if (current.hash == hash
56 current = new Child(parent, uri, localName, parent.depth + 1, hash);
66 int hash = uri.hashCode() * 31 + localName.hashCode(); local
67 int index = hash & 15;
74 if (current.hash == hash
88 final int hash; field in class:Children.Child
[all...] |
| /prebuilts/go/darwin-x86/src/crypto/rsa/ |
| pss.go | 15 "hash"
20 func emsaPSSEncode(mHash []byte, emBits int, salt []byte, hash hash.Hash) ([]byte, error) {
22 hLen := hash.Size()
27 // hash function (2^61 - 1 octets for SHA-1), output "message too
30 // 2. Let mHash = Hash(M), an octet string of length hLen.
55 // 6. Let H = Hash(M'), an octet string of length hLen.
59 hash.Write(prefix[:])
60 hash.Write(mHash
[all...] |
| /prebuilts/go/linux-x86/src/crypto/rsa/ |
| pss.go | 15 "hash"
20 func emsaPSSEncode(mHash []byte, emBits int, salt []byte, hash hash.Hash) ([]byte, error) {
22 hLen := hash.Size()
27 // hash function (2^61 - 1 octets for SHA-1), output "message too
30 // 2. Let mHash = Hash(M), an octet string of length hLen.
55 // 6. Let H = Hash(M'), an octet string of length hLen.
59 hash.Write(prefix[:])
60 hash.Write(mHash
[all...] |
| /external/androidplot/AndroidPlot-Core/src/main/java/com/androidplot/util/ |
| ZHash.java | 23 * Concrete implementation of ZIndexable. Provides fast element retrieval via hash key. Also provides
28 private HashMap<KeyType, ValueType> hash;
field in class:ZHash
34 hash = new HashMap<KeyType, ValueType>();
45 return hash.get(key);
59 if(hash.containsKey(key)) {
60 hash.put(key, value);
63 hash.put(key, value);
76 if(hash.containsKey(key)) {
77 hash.put(key, value);
80 hash.put(key, value);
[all...] |
