| /external/webkit/Tools/Scripts/webkitpy/layout_tests/ |
| deduplicate_tests.py | 80 hashes = collections.defaultdict(set)
91 hashes[(test, hash)].add(path)
92 return hashes
96 """Get the hashes of all the test expectations in the tree.
97 We cheat and use git's hashes.
105 hashes = collections.defaultdict(set)
190 def find_dups(hashes, port_fallbacks, relative_to):
193 hashes: a list of hashes as returned by cluster_file_hashes.
200 for (test, hash), cluster in hashes.items()
[all...] |
| deduplicate_tests_unittest.py | 72 hashes = deduplicate_tests.parse_git_output(git_output, '*')
78 self.assertEquals(expected, hashes)
80 hashes = deduplicate_tests.parse_git_output(git_output, '*.png')
82 self.assertEquals(expected, hashes)
|
| /external/oprofile/daemon/ |
| opd_cookie.c | 100 static struct list_head hashes[HASH_SIZE]; variable in typeref:struct:list_head
142 list_for_each(pos, &hashes[hash]) {
150 list_add(&entry->list, &hashes[hash]);
165 list_for_each(pos, &hashes[hash]) {
172 list_add(&entry->list, &hashes[hash]);
190 list_for_each(pos, &hashes[hash]) {
208 list_init(&hashes[i]);
|
| opd_anon.c | 43 static struct list_head hashes[HASH_SIZE]; variable in typeref:struct:list_head
88 list_for_each_safe(pos, pos2, &hashes[hash]) {
118 list_add_tail(&m->list, &hashes[hash]);
190 list_for_each(pos, &hashes[hash]) {
211 list_add(&entry->list, &hashes[hash]);
225 list_init(&hashes[i]);
|
| opd_sfile.c | 33 static struct list_head hashes[HASH_SIZE]; variable in typeref:struct:list_head
261 list_for_each(pos, &hashes[hash]) {
270 list_add(&sf->hash, &hashes[hash]);
642 list_init(&hashes[i]);
|
| /external/dropbear/libtomcrypt/ |
| Android.mk | 25 src/hashes/chc/chc.c src/hashes/helper/hash_file.c src/hashes/helper/hash_filehandle.c \
26 src/hashes/helper/hash_memory.c src/hashes/helper/hash_memory_multi.c src/hashes/md2.c src/hashes/md4.c \
27 src/hashes/md5.c src/hashes/rmd128.c src/hashes/rmd160.c src/hashes/rmd256.c src/hashes/rmd320.c
[all...] |
| crypt.tex | 120 designing cryptosystems. It supports symmetric ciphers, one-way hashes, pseudo-random number generators,
123 The library was designed such that new ciphers/hashes/PRNGs can be added at run-time and the existing API
146 With this library all core functions (ciphers, hashes, prngs, and bignum) have the same prototype definition. They all load
150 that can be used to make a program automatically pick between ciphers, hashes and PRNGs at run-time. That means your
151 application can support all ciphers/hashes/prngs/bignum without changing the source code.
165 The LibTomCrypt package has also been written to be very modular. The block ciphers, one--way hashes,
195 of the ciphers and hashes are patent free or under patents that have since expired.
[all...] |
| /external/openssl/crypto/x509/ |
| by_dir.c | 86 STACK_OF(BY_DIR_HASH) *hashes;
191 if (ent->hashes)
192 sk_BY_DIR_HASH_pop_free(ent->hashes, by_dir_hash_free);
252 ent->hashes = sk_BY_DIR_HASH_new(by_dir_hash_cmp);
254 if (!ent->dir || !ent->hashes)
338 if (type == X509_LU_CRL && ent->hashes)
342 idx = sk_BY_DIR_HASH_find(ent->hashes, &htmp);
345 hent = sk_BY_DIR_HASH_value(ent->hashes, idx);
441 idx = sk_BY_DIR_HASH_find(ent->hashes, &htmp);
444 sk_BY_DIR_HASH_value(ent->hashes, idx)
[all...] |
| /libcore/luni/src/main/java/org/apache/harmony/security/provider/cert/ |
| Cache.java | 101 // in the particular array. I.e. for index N hash contained in hashes[N]
106 private final long[] hashes; field in class:Cache
113 // This is an ordered array of the hash codes from 'hashes' array (described
115 // the hash in the 'hashes' array. I.e. hash code ABCD00 with index 10 in
116 // the hashes array will be represented in this array as ABCD0A (10==0x0A)
135 hashes = new long[cache_size];
258 long idx_hash = (hashes[index] | (index+1));
262 // (hashes[index])
308 hashes[index] = hash;
|
| /external/bouncycastle/bcpkix/src/main/java/org/bouncycastle/cms/ |
| CMSSignedData.java | 83 private Map hashes; field in class:CMSSignedData
112 * @param hashes a map of precomputed digests for content indexed by name of hash.
116 Map hashes,
120 this(hashes, CMSUtils.readContentInfo(sigBlock));
183 Map hashes,
187 this.hashes = hashes;
257 if (hashes == null)
263 Object obj = hashes.keySet().iterator().next();
264 byte[] hash = (obj instanceof String) ? (byte[])hashes.get(info.getDigestAlgorithm().getAlgorithm().getId()) : (byte[])hashes.get(info.getDigestAlgorithm (…)
[all...] |
| /external/chromium/net/base/ |
| transport_security_state.h | 54 // IsChainOfPublicKeysPermitted takes a set of public key hashes and
57 // 2) |hashes| and |public_key_hashes| are not disjoint.
59 const std::vector<SHA1Fingerprint>& hashes);
|
| transport_security_state.cc | 269 // This function converts the binary hashes, which we store in
612 const std::vector<net::SHA1Fingerprint>& hashes) {
615 i = hashes.begin(); i != hashes.end(); i++) {
637 const std::vector<net::SHA1Fingerprint>& hashes) {
642 i = hashes.begin(); i != hashes.end(); ++i) {
651 << ". Validated chain: " << HashesToBase64String(hashes)
|
| transport_security_state_unittest.cc | 537 std::vector<SHA1Fingerprint> hashes; local
538 EXPECT_TRUE(domain_state.IsChainOfPublicKeysPermitted(hashes));
544 EXPECT_FALSE(domain_state.IsChainOfPublicKeysPermitted(hashes));
545 hashes.push_back(hash);
546 EXPECT_TRUE(domain_state.IsChainOfPublicKeysPermitted(hashes));
547 hashes[0].data[0] = '2';
548 EXPECT_FALSE(domain_state.IsChainOfPublicKeysPermitted(hashes));
|
| x509_certificate_nss.cc | 624 std::vector<SHA1Fingerprint>* hashes) {
628 hashes->push_back(CertPublicKeyHash(node->cert));
630 hashes->push_back(CertPublicKeyHash(root_cert));
[all...] |
| x509_certificate_win.cc | 469 std::vector<SHA1Fingerprint>* hashes) {
490 hashes->push_back(hash);
[all...] |
| x509_certificate_mac.cc | 580 std::vector<SHA1Fingerprint>* hashes) {
597 hashes->push_back(hash);
[all...] |
| /external/srtp/crypto/ |
| Makefile | 73 hashes = hash/null_auth.o hash/sha1.o \ macro
87 cryptobj = $(ciphers) $(hashes) $(math) $(stat) $(kernel) $(xfm)
|
| /external/valgrind/main/VEX/useful/ |
| smchash.c | 266 UInt* hashes = malloc( nHashes * sizeof(UInt) ); local
271 assert(hashes);
285 hashes[hashIx++] = hRunning;
310 free(hashes);
|
| /external/e2fsprogs/e2fsck/ |
| rehash.c | 77 ext2_dirhash_t *hashes; member in struct:out_dir
233 new_mem = realloc(outdir->hashes,
237 outdir->hashes = new_mem;
240 outdir->hashes = malloc(blocks * sizeof(ext2_dirhash_t));
250 free(outdir->hashes);
427 outdir->hashes[0] = 0;
459 outdir->hashes[outdir->num-1] = ent->hash | 1;
461 outdir->hashes[outdir->num-1] = ent->hash;
577 ext2fs_cpu_to_le32(outdir->hashes[i]);
597 ext2fs_cpu_to_le32(outdir->hashes[i])
[all...] |
| /external/guava/guava-tests/test/com/google/common/hash/ |
| HashTestUtils.java | 50 byte[] hashes = new byte[hashBytes * 256];
57 System.arraycopy(hash, 0, hashes, i * hashBytes, hash.length);
61 byte[] result = hashFunction.hash(hashes, 0);
|
| /external/webkit/Source/JavaScriptCore/ |
| create_hash_table | 43 my @hashes = ();
76 @hashes = ();
98 push(@hashes, hashValue($key));
|
| /external/srtp/ |
| Makefile | 79 hashes = crypto/hash/null_auth.o crypto/hash/sha1.o \ macro
96 cryptobj = $(ciphers) $(hashes) $(math) $(stat) $(kernel) $(replay)
|
| /external/webkit/LayoutTests/storage/ |
| hash-change-with-xhr.js | 96 // Create some hashes so we can call history.back().
|
| /external/chromium/chrome/browser/ |
| enumerate_modules_model_win.cc | 106 // Location must be entered as hashes (see GenerateHash). Filename is mandatory.
625 std::string hashes(kModuleBlacklist[i].filename);
628 hashes += " - " + hash1;
630 hashes += " - " + hash2;
632 hashes += " - " + hash3;
[all...] |
| /external/libvpx/libvpx/examples/includes/PHP-Markdown-Extra-1.2.3/ |
| markdown.php | 266 # Internal hashes used during transformation.
280 # Clear global hashes.
339 # Strip link definitions, store in hashes.
908 # ## Header 2 with closing hashes ##
[all...] |
