| /external/lzma/CPP/7zip/Crypto/ |
| RandGen.cpp | 30 #define HASH_UPD(x) Sha256_Update(&hash, (const Byte *)&x, sizeof(x));
34 CSha256 hash;
local
35 Sha256_Init(&hash);
83 Sha256_Final(&hash, _buff);
84 Sha256_Init(&hash);
85 Sha256_Update(&hash, _buff, SHA256_DIGEST_SIZE);
88 Sha256_Final(&hash, _buff);
107 CSha256 hash;
local
109 Sha256_Init(&hash);
110 Sha256_Update(&hash, _buff, SHA256_DIGEST_SIZE);
[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...] |
| /external/llvm/test/Bitcode/ |
| module_hash.ll | 1 ; Check per module hash.
2 ; RUN: opt -module-hash %s -o - | llvm-bcanalyzer -dump | FileCheck %s --check-prefix=MOD1
3 ; MOD1: <HASH op0={{[0-9]*}} op1={{[0-9]*}} op2={{[0-9]*}} op3={{[0-9]*}} op4={{[0-9]*}} (match)/>
4 ; RUN: opt -module-hash %p/Inputs/module_hash.ll -o - | llvm-bcanalyzer -dump | FileCheck %s --check-prefix=MOD2
5 ; MOD2: <HASH op0={{[0-9]*}} op1={{[0-9]*}} op2={{[0-9]*}} op3={{[0-9]*}} op4={{[0-9]*}} (match)/>
7 ; Check that the hash matches in the combined index.
10 ; RUN: opt -module-hash -module-summary %s -o %t.m1.bc
11 ; RUN: opt -module-hash -module-summary %p/Inputs/module_hash.ll -o %t.m2.bc
14 ; RUN: llvm-bcanalyzer -dump %t.m1.bc | grep '<HASH' > %t.hash
[all...] |
| /external/tensorflow/tensorflow/core/api_def/base_api/ |
| api_def_StringToHashBucketFast.pbtxt | 6 The strings to assign a hash bucket.
21 summary: "Converts each string in the input Tensor to its hash mod by a number of buckets."
23 The hash function is deterministic on the content of the string within the
26 unimportant. There is a risk of adversaries constructing inputs that all hash
27 to the same bucket. To prevent this problem, use a strong hash function with
|
| /external/guava/guava/src/com/google/common/hash/ |
| HashFunction.java | 15 package com.google.common.hash;
23 * A hash function is a collision-averse pure function that maps an arbitrary block of
24 * data to a number called a <i>hash code</i>.
31 * <li><b>block of data:</b> the input for a hash function is always, in concept, an
36 * <li><b>hash code:</b> each hash function always yields hash codes of the same fixed bit
39 * {@code long} value is clearly insufficient to hold all hash code values, this API
40 * represents a hash code as an instance of {@link HashCode}.
46 * <li><b>collision-averse:</b> while it can't be helped that a hash function wil
[all...] |
| /external/curl/tests/unit/ |
| unit1603.c | 27 #include "hash.h"
60 /* Ensure the key hashes are as expected in order to test both hash
71 fail_unless(nodep, "insertion into hash failed");
73 fail_unless(nodep == key1, "hash retrieval failed");
76 fail_unless(nodep, "insertion into hash failed");
78 fail_unless(nodep == key2, "hash retrieval failed");
81 fail_unless(nodep, "insertion into hash failed");
83 fail_unless(nodep == key3, "hash retrieval failed");
87 fail_unless(nodep, "insertion into hash failed");
89 fail_unless(nodep == key4, "hash retrieval failed")
[all...] |
| /external/jacoco/org.jacoco.report/src/org/jacoco/report/internal/html/resources/ |
| sort.js | 16 * Sets the initial sorting derived from the hash.
20 * hash links
24 var hash = window.location.hash; variable
25 if (hash) {
26 var m = hash.match(/up-./);
34 var m = hash.match(/dn-./);
70 var hash;
77 hash = 'up-' + header.id;
83 hash = 'dn-' + header.id
[all...] |
| /external/mesa3d/src/gallium/auxiliary/cso_cache/ |
| cso_hash.h | 30 * Hash table implementation.
32 * This file provides a hash implementation that is capable of dealing
34 * functions operating on the hash return an iterator. The iterator
59 struct cso_hash *hash; member in struct:cso_hash_iter
65 void cso_hash_delete(struct cso_hash *hash);
68 int cso_hash_size(struct cso_hash *hash);
72 * Adds a data with the given key to the hash. If entry with the given
73 * key is already in the hash, this current entry is instered before it
75 * Function returns iterator pointing to the inserted item in the hash.
77 struct cso_hash_iter cso_hash_insert(struct cso_hash *hash, unsigned key
[all...] |
| /external/tpm2/ |
| CpriHash_fp.h | 11 _cpri__CompleteHash(CPRI_HASH_STATE *hashState, // IN: the state of hash stack
13 BYTE *dOut // OUT: hash digest
20 _cpri__HashBlock(TPM_ALG_ID hashAlg, // IN: The hash algorithm
21 UINT32 dataSize, // IN: size of buffer to hash
22 BYTE *data, // IN: the buffer to hash
24 BYTE *digest // OUT: hash digest
28 _cpri__GetDigestSize(TPM_ALG_ID hashAlg // IN: hash algorithm to look up
34 _cpri__KDFa(TPM_ALG_ID hashAlg, // IN: hash algorithm used in HMAC
48 _cpri__KDFe(TPM_ALG_ID hashAlg, // IN: hash algorithm used in HMAC
59 TPM_ALG_ID hashAlg, // IN: hash to us
[all...] |
| /external/vboot_reference/firmware/2lib/include/ |
| 2sha.h | 12 /* Hash algorithms may be disabled individually to save code space */
29 /* Context structs for hash algorithms */
64 /* Hash algorithm independent digest context; includes all of the above. */
79 /* Current hash algorithm */
87 * Initialize a hash context.
89 * @param ctx Hash context
96 * Update (extend) a hash.
98 * @param ctx Hash context
99 * @param data Data to hash
113 * Finalize a hash digest
[all...] |
| /external/libcxx/test/libcxx/extensions/hash/ |
| specializations.pass.cpp | 19 assert(__gnu_cxx::hash<const char *>()("test") ==
20 std::hash<std::string>()("test"));
21 assert(__gnu_cxx::hash<char *>()(str) == std::hash<std::string>()("test"));
22 assert(__gnu_cxx::hash<char>()(42) == 42);
23 assert(__gnu_cxx::hash<signed char>()(42) == 42);
24 assert(__gnu_cxx::hash<unsigned char>()(42) == 42);
25 assert(__gnu_cxx::hash<short>()(42) == 42);
26 assert(__gnu_cxx::hash<unsigned short>()(42) == 42);
27 assert(__gnu_cxx::hash<int>()(42) == 42)
[all...] |
| /prebuilts/ndk/r16/sources/cxx-stl/llvm-libc++/test/libcxx/extensions/hash/ |
| specializations.pass.cpp | 19 assert(__gnu_cxx::hash<const char *>()("test") ==
20 std::hash<std::string>()("test"));
21 assert(__gnu_cxx::hash<char *>()(str) == std::hash<std::string>()("test"));
22 assert(__gnu_cxx::hash<char>()(42) == 42);
23 assert(__gnu_cxx::hash<signed char>()(42) == 42);
24 assert(__gnu_cxx::hash<unsigned char>()(42) == 42);
25 assert(__gnu_cxx::hash<short>()(42) == 42);
26 assert(__gnu_cxx::hash<unsigned short>()(42) == 42);
27 assert(__gnu_cxx::hash<int>()(42) == 42)
[all...] |
| /external/vboot_reference/tests/ |
| vb20_api_tests.c | 239 /* For now, all we support is body signature hash */
243 "init hash good");
247 "hash context offset");
249 "hash context size");
252 "hash uses workbuf");
253 TEST_EQ(sd->hash_tag, VB2_HASH_TAG_FW_BODY, "hash tag");
254 TEST_EQ(sd->hash_remaining_size, mock_body_size, "hash remaining");
258 "init hash again");
259 TEST_EQ(cc.workbuf_used, wb_used_before, "init hash reuses context");
263 VB2_ERROR_API_INIT_HASH_TAG, "init hash invalid tag")
[all...] |
| /tools/dexter/slicer/export/slicer/ |
| hash_table.h | 28 // Implemented as an incrementally resizable hash table: we split the logical hash table
32 // rehashed into the new hash table)
34 // Similar to open addressing hash tables, all the buckets are a single,
41 // The Hash template argument is a type which must implement:
42 // 1. hash function : uint32_t Hash(const Key& key)
47 template<class Key, class T, class Hash>
65 Partition(Index size, const Hash& hasher);
75 Hash hasher_
[all...] |
| /external/fio/ |
| filelock.c | 3 * No hash indexing, just a list, so only works well for < 100 files or
15 #include "hash.h"
19 uint32_t hash; member in struct:fio_filelock
119 static struct fio_filelock *fio_hash_find(uint32_t hash)
126 if (ff->hash == hash)
133 static struct fio_filelock *fio_hash_get(uint32_t hash, int trylock)
137 ff = fio_hash_find(hash);
146 * If we dropped the main lock, re-lookup the hash in case
153 __ff = fio_hash_find(hash);
171 uint32_t hash; local
228 uint32_t hash; local
[all...] |
| /prebuilts/go/darwin-x86/src/crypto/hmac/ |
| hmac.go | 6 Package hmac implements the Keyed-Hash Message Authentication Code (HMAC) as
8 An HMAC is a cryptographic hash that uses a key to sign a message.
9 The receiver verifies the hash by recomputing it using the same key.
26 "hash"
32 // key is zero padded to the block size of the hash function
41 outer, inner hash.Hash
66 // New returns a new HMAC hash using the given hash.Hash type and key
[all...] |
| /prebuilts/go/linux-x86/src/crypto/hmac/ |
| hmac.go | 6 Package hmac implements the Keyed-Hash Message Authentication Code (HMAC) as
8 An HMAC is a cryptographic hash that uses a key to sign a message.
9 The receiver verifies the hash by recomputing it using the same key.
26 "hash"
32 // key is zero padded to the block size of the hash function
41 outer, inner hash.Hash
66 // New returns a new HMAC hash using the given hash.Hash type and key
[all...] |
| /external/autotest/server/site_tests/firmware_ECHash/ |
| control | 9 PURPOSE = "Servo based EC hash recompute test"
10 CRITERIA = "This test will fail if EC failed to recompute its hash."
20 This test ensures that the AP will ask the EC to recompute the hash if
21 the current hash isn't the right size/offset. Use 'ectool echash' command
22 to request the hash of some other part of EC EEPROM, then warm-reboot
23 the AP and use 'ectool echash' to see what hash the EC has after booting.
24 AP-RW should have requested the EC recompute the hash of EC-RW.
|
| /prebuilts/go/darwin-x86/src/cmd/go/internal/cache/ |
| hash.go | 11 "hash"
20 // HashSize is the number of bytes in a hash.
23 // A Hash provides access to the canonical hash function used to index the cache.
25 type Hash struct {
26 h hash.Hash
31 // hashSalt is a salt string added to the beginning of every hash
51 fmt.Fprintf(os.Stderr, "HASH subkey %x %q = %x\n", parent, desc, out)
61 // NewHash returns a new Hash
[all...] |
| /prebuilts/go/linux-x86/src/cmd/go/internal/cache/ |
| hash.go | 11 "hash"
20 // HashSize is the number of bytes in a hash.
23 // A Hash provides access to the canonical hash function used to index the cache.
25 type Hash struct {
26 h hash.Hash
31 // hashSalt is a salt string added to the beginning of every hash
51 fmt.Fprintf(os.Stderr, "HASH subkey %x %q = %x\n", parent, desc, out)
61 // NewHash returns a new Hash
[all...] |
| /external/boringssl/src/ssl/test/runner/ |
| prf.go | 13 "hash"
24 func pHash(result, secret, seed []byte, hash func() hash.Hash) {
25 h := hmac.New(hash, secret)
68 func prf12(hashFunc func() hash.Hash) func(result, secret, label, seed []byte) {
133 return prf12(suite.hash().New)
192 ret.hash = cipherSuite.hash()
[all...] |
