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

1 2 3 4

  /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,
  /test/vts-testcase/hal/treble/vintf/
utils.cpp 35 // Name of file containing HAL hashes.
106 // Returns the set of released hashes for a given HAL interface.
112 auto hashes = Hash::lookupHash(file_path, fq_iface_name.string(), &err); local
113 released_hashes.insert(hashes.begin(), hashes.end());
  /external/fio/lib/
bloom.c 38 static struct bloom_hash hashes[] = { variable in typeref:struct:bloom_hash
96 hash[i] = hashes[i].fn(data, len, hashes[i].seed);
  /frameworks/base/services/core/java/com/android/server/backup/
BackupUtils.java 124 ArrayList<byte[]> hashes = new ArrayList<>(sigs.length); local
126 hashes.add(hashSignature(s));
128 return hashes;
136 ArrayList<byte[]> hashes = new ArrayList<>(sigs.size()); local
138 hashes.add(hashSignature(s));
140 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 --)
  /prebuilts/go/darwin-x86/src/crypto/
crypto.go 78 var hashes = make([]func() hash.Hash, maxHash) var
84 f := hashes[h]
94 return h < maxHash && hashes[h] != nil
104 hashes[h] = f
  /prebuilts/go/linux-x86/src/crypto/
crypto.go 78 var hashes = make([]func() hash.Hash, maxHash) var
84 f := hashes[h]
94 return h < maxHash && hashes[h] != nil
104 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 34 static std::map<std::string, Hash> hashes; local
36 auto it = hashes.find(path);
38 if (hashes.find(path) == hashes.end()) {
39 it = hashes.insert(it, {path, Hash(path)});
116 auto it = hashes.find(fqName);
118 if (it == hashes.end()) {
161 file->hashes[fqName].push_back(hash);
167 std::map<std::string,std::vector<std::string>> hashes; member in struct:android::HashFile
  /bootable/recovery/
fuse_sideload.cpp 95 hashes; // SHA-256 hash of each block (all zeros if block hasn't been read yet) member in struct:fuse_data
262 const SHA256Digest& blockhash = fd->hashes[block];
274 fd->hashes[block] = hash;
372 // All hashes will be zero-initialized.
373 fd.hashes.resize(fd.file_blocks);
  /external/bouncycastle/bcpkix/src/main/java/org/bouncycastle/cms/
CMSSignedData.java 74 private Map hashes; field in class:CMSSignedData
103 * @param hashes a map of precomputed digests for content indexed by name of hash.
107 Map hashes,
111 this(hashes, CMSUtils.readContentInfo(sigBlock));
174 Map hashes,
178 this.hashes = hashes;
254 if (hashes == null)
260 Object obj = hashes.keySet().iterator().next();
261 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/v8/src/inspector/
v8-debugger-script.cc 37 uint64_t hashes[] = {0, 0, 0, 0, 0}; local
40 const size_t hashesSize = arraysize(hashes);
49 hashes[current] = (hashes[current] + zi[current] * xi) % prime[current];
60 hashes[current] = (hashes[current] + zi[current] * xi) % prime[current];
66 hashes[i] = (hashes[i] + zi[i] * (prime[i] - 1)) % prime[i];
69 for (size_t i = 0; i < hashesSize; ++i) appendUnsignedAsHex(hashes[i], &hash);
  /system/extras/verity/
build_verity_tree.cpp 22 unsigned char *hashes; member in struct:sparse_hash_ctx
100 ctx->hashes, &s,
102 ctx->hashes += s;
105 memcpy(ctx->hashes, ctx->zero_block_hash, ctx->hash_size);
106 ctx->hashes += ctx->hash_size;
307 ctx.hashes = verity_tree_levels[0];
  /frameworks/base/core/java/android/util/
ArraySet.java 211 private static void freeArrays(final int[] hashes, final Object[] array, final int size) {
212 if (hashes.length == (BASE_SIZE * 2)) {
216 array[1] = hashes;
228 } else if (hashes.length == BASE_SIZE) {
232 array[1] = hashes;
631 final int[] hashes = mHashes; local
634 result += hashes[i];
  /frameworks/base/services/core/java/com/android/server/pm/
ShortcutPackageInfo.java 266 final ArrayList<byte[]> hashes = new ArrayList<>(); local
285 hashes.add(decoded);
305 mSigHashes = hashes;

Completed in 266 milliseconds

1 2 3 4