HomeSort by relevance Sort by last modified time
    Searched defs:hashes (Results 1 - 25 of 67) sorted by null

1 2 3

  /art/test/920-objects/src/art/
Test920.java 59 int hashes[] = new int[objects.length]; local
62 hashes[i] = getObjectHashCode(objects[i]);
68 if (hashes[i] != ihash) {
69 throw new RuntimeException(objects[i] + ": " + hashes[i] + " vs " + ihash);
78 if (hashes[i] != newhash) {
79 throw new RuntimeException(objects[i] + ": " + hashes[i] + " vs " + newhash);
  /external/vboot_reference/tests/
vb21_host_fw_preamble_tests.c 34 struct vb2_signature *hashes[3]; local
66 TEST_SUCC(vb2_sign_data(hashes + 0, test_data1, sizeof(test_data1),
69 TEST_SUCC(vb2_sign_data(hashes + 1, test_data2, sizeof(test_data2),
72 TEST_SUCC(vb2_sign_data(hashes + 2, test_data3, sizeof(test_data3),
78 (const struct vb2_signature **)hashes,
92 TEST_EQ(0, memcmp((uint8_t *)fp + hash_next, hashes[i],
93 hashes[i]->c.total_size), " hash[i]");
94 hash_next += hashes[i]->c.total_size;
102 (const struct vb2_signature **)hashes,
vb21_common_tests.c 382 struct vb2_signature *hashes[3]; local
406 TEST_SUCC(vb2_sign_data(hashes + 0, test_data, sizeof(test_data),
409 TEST_SUCC(vb2_sign_data(hashes + 1, test_data2, sizeof(test_data2),
412 TEST_SUCC(vb2_sign_data(hashes + 2, test_data3, sizeof(test_data3),
418 (const struct vb2_signature **)hashes,
  /external/fio/lib/
bloom.c 38 struct bloom_hash hashes[] = { variable in typeref:struct:bloom_hash
98 hash[i] = hashes[i].fn(data, nwords, hashes[i].seed);
  /frameworks/base/services/core/java/com/android/server/backup/
BackupUtils.java 114 ArrayList<byte[]> hashes = new ArrayList<>(sigs.length); local
116 hashes.add(hashSignature(s));
118 return hashes;
126 ArrayList<byte[]> hashes = new ArrayList<>(sigs.size()); local
128 hashes.add(hashSignature(s));
130 return hashes;
  /packages/apps/ManagedProvisioning/src/com/android/managedprovisioning/task/
VerifyPackageTask.java 133 List<byte[]> hashes = new LinkedList<>(); local
136 hashes.add(hash);
138 return hashes;
144 + "-hashes of all signatures of downloaded package.");
160 ProvisionLogger.loge("Hashes computed from package signatures: ");
  /external/jemalloc/include/jemalloc/internal/
hash.h 347 uint64_t hashes[2]; local
348 hash_x86_128(key, (int)len, seed, hashes);
349 r_hash[0] = (size_t)hashes[0];
350 r_hash[1] = (size_t)hashes[1];
  /external/mesa3d/src/gallium/auxiliary/cso_cache/
cso_cache.c 40 struct cso_hash *hashes[CSO_CACHE_MAX]; member in struct:cso_cache
86 hash = sc->hashes[type];
255 sc->hashes[i] = cso_hash_create();
295 cso_hash_delete(sc->hashes[i]);
307 sanitize_hash(sc, sc->hashes[i], i, sc->max_size);
  /external/squashfs-tools/squashfs-tools/
progressbar.c 96 int max_digits, used, hashes, spaces; local
104 hashes = (current * (columns - used)) / max;
105 spaces = columns - used - hashes;
127 while (hashes --)
  /external/v8/src/inspector/
v8-debugger-script.cc 34 uint64_t hashes[] = {0, 0, 0, 0, 0}; local
37 const size_t hashesSize = arraysize(hashes);
46 hashes[current] = (hashes[current] + zi[current] * xi) % prime[current];
57 hashes[current] = (hashes[current] + zi[current] * xi) % prime[current];
63 hashes[i] = (hashes[i] + zi[i] * (prime[i] - 1)) % prime[i];
66 for (size_t i = 0; i < hashesSize; ++i) appendUnsignedAsHex(hashes[i], &hash);
  /prebuilts/go/darwin-x86/src/crypto/
crypto.go 70 var hashes = make([]func() hash.Hash, maxHash) var
76 f := hashes[h]
86 return h < maxHash && hashes[h] != nil
96 hashes[h] = f
  /prebuilts/go/linux-x86/src/crypto/
crypto.go 70 var hashes = make([]func() hash.Hash, maxHash) var
76 f := hashes[h]
86 return h < maxHash && hashes[h] != nil
96 hashes[h] = f
  /system/extras/libfec/
fec_verity.cpp 88 number of hash tree levels in `verity_levels,' and the number of hashes per
98 uint64_t hashes = file_size / FEC_BLOCKSIZE; local
102 level_hashes[level] = hashes;
105 hashes = fec_div_round_up(hashes * SHA256_DIGEST_LENGTH, FEC_BLOCKSIZE);
106 total += hashes;
109 } while (hashes > 1);
225 /* calculate the number of hashes on each level */
226 uint32_t hashes[levels]; local
228 verity_get_size(v->data_blocks * FEC_BLOCKSIZE, NULL, hashes);
    [all...]
  /system/tools/hidl/
Hash.cpp 31 static std::map<std::string, Hash> hashes; local
33 auto it = hashes.find(path);
35 if (hashes.find(path) == hashes.end()) {
36 it = hashes.insert(it, {path, Hash(path)});
105 auto it = hashes.find(fqName);
107 if (it == hashes.end()) {
150 file->hashes[fqName].push_back(hash);
156 std::map<std::string,std::vector<std::string>> hashes; member in struct:android::HashFile
  /test/vts-testcase/hal/treble/vintf/
vts_treble_vintf_test.cpp 57 // Name of file containing HAL hashes.
103 // Returns the set of released hashes for a given HAL interface.
109 auto hashes = Hash::lookupHash(file_path, fq_iface_name.string(), &err); local
110 released_hashes.insert(hashes.begin(), hashes.end());
254 // comparing it to the set of known hashes of released interfaces.
  /bootable/recovery/
fuse_sideload.cpp 94 uint8_t* hashes; // SHA-256 hash of each block (all zeros member in struct:fuse_data
275 uint8_t* blockhash = fd->hashes + block * SHA256_DIGEST_LENGTH;
397 fd.hashes = (uint8_t*)calloc(fd.file_blocks, SHA256_DIGEST_LENGTH);
398 if (fd.hashes == NULL) {
399 fprintf(stderr, "failed to allocate %d bites for hashes\n",
520 free(fd.hashes);
  /external/bouncycastle/bcpkix/src/main/java/org/bouncycastle/cms/
CMSSignedData.java 71 private Map hashes; field in class:CMSSignedData
100 * @param hashes a map of precomputed digests for content indexed by name of hash.
104 Map hashes,
108 this(hashes, CMSUtils.readContentInfo(sigBlock));
171 Map hashes,
175 this.hashes = hashes;
251 if (hashes == null)
257 Object obj = hashes.keySet().iterator().next();
258 byte[] hash = (obj instanceof String) ? (byte[])hashes.get(info.getDigestAlgorithm().getAlgorithm().getId()) : (byte[])hashes.get(info.getDigestAlgorithm (…)
    [all...]
  /external/icu/android_icu4j/src/main/java/android/icu/util/
CompactByteArray.java 71 hashes = new int[INDEXCOUNT];
77 hashes[i] = 0;
216 if (hashes[i] == hashes[j] &&
228 hashes[j] = hashes[i];
245 hashes = null;
272 hashes[i] = (hashes[i] + (value<<1)) | 1;
280 return hashes[i] != 0
404 private int[] hashes; field in class:CompactByteArray
    [all...]
CompactCharArray.java 72 hashes = new int[INDEXCOUNT];
78 hashes[i] = 0;
219 if (hashes[i] == hashes[j] &&
256 hashes = null;
296 hashes[i] = (hashes[i] + (value<<1)) | 1;
304 return hashes[i] != 0;
344 if (hashes != null) other.hashes = hashes.clone()
431 private int[] hashes; field in class:CompactCharArray
    [all...]
  /external/icu/icu4j/main/classes/core/src/com/ibm/icu/util/
CompactByteArray.java 69 hashes = new int[INDEXCOUNT];
75 hashes[i] = 0;
214 if (hashes[i] == hashes[j] &&
226 hashes[j] = hashes[i];
243 hashes = null;
270 hashes[i] = (hashes[i] + (value<<1)) | 1;
278 return hashes[i] != 0
402 private int[] hashes; field in class:CompactByteArray
    [all...]
CompactCharArray.java 70 hashes = new int[INDEXCOUNT];
76 hashes[i] = 0;
217 if (hashes[i] == hashes[j] &&
254 hashes = null;
294 hashes[i] = (hashes[i] + (value<<1)) | 1;
302 return hashes[i] != 0;
342 if (hashes != null) other.hashes = hashes.clone()
429 private int[] hashes; field in class:CompactCharArray
    [all...]
  /external/jemalloc/src/
ckh.c 19 * fewest that can work, and supporting multiple hashes is an implementation
25 * #hashes | 1 | 2 | 4 | 8 |
73 size_t hashes[2], bucket, cell; local
77 ckh->hash(key, hashes);
80 bucket = hashes[0] & ((ZU(1) << ckh->lg_curbuckets) - 1);
86 bucket = hashes[1] & ((ZU(1) << ckh->lg_curbuckets) - 1);
130 size_t hashes[2], bucket, tbucket; local
142 * were an item for which both hashes indicated the same
160 ckh->hash(key, hashes);
161 tbucket = hashes[1] & ((ZU(1) << ckh->lg_curbuckets) - 1)
198 size_t hashes[2], bucket; local
    [all...]
  /external/libchrome/sandbox/linux/bpf_dsl/
codegen_unittest.cc 78 std::vector<Hash> hashes; local
80 // Push a bunch of logically distinct hashes.
81 hashes.push_back(Hash::kZero);
83 hashes.push_back(Hash(i & 1, i & 2));
86 hashes.push_back(Hash(i & 1, i & 2, Hash(i & 4, i & 8)));
89 hashes.push_back(
93 for (const Hash& a : hashes) {
94 for (const Hash& b : hashes) {
95 // Hashes should equal themselves, but not equal all others.
  /external/valgrind/VEX/useful/
smchash.c 266 UInt* hashes = malloc( nHashes * sizeof(UInt) ); local
271 assert(hashes);
285 hashes[hashIx++] = hRunning;
310 free(hashes);
  /frameworks/base/services/core/java/com/android/server/pm/
ShortcutPackageInfo.java 183 final ArrayList<byte[]> hashes = new ArrayList<>(); local
202 hashes.add(decoded);
214 mSigHashes = hashes;

Completed in 504 milliseconds

1 2 3