/external/chromium_org/third_party/smhasher/src/ |
H A D | Bitslice.cpp | 54 void Bitslice ( std::vector<hashtype> & hashes, slice_vec & slices ) argument 58 const int slicelen = ((int)hashes.size() + 31) / 32; 72 for(int i = 0; i < (int)hashes.size(); i++) 74 int b = getbit(hashes[i],j);
|
H A D | KeysetTest.cpp | 18 uint8_t * hashes = new uint8_t[hashbytes * 256]; local 22 memset(hashes,0,hashbytes*256); 32 hash(key,i,256-i,&hashes[i*hashbytes]); 37 hash(hashes,hashbytes*256,0,final); 45 delete [] hashes; 303 std::vector<uint128_t> hashes; local 305 HashCallback<uint128_t> c(hash,hashes); 309 printf("%d hashes\n",(int)hashes.size()); 315 FindCollisions(hashes,collision [all...] |
H A D | KeysetTest.h | 30 pfHash hash, std::vector<hashtype> & hashes ) 42 hashes.push_back(h); 47 CombinationKeygenRecurse(key,len+1,maxlen,blocks,blockcount,hash,hashes); 59 std::vector<hashtype> hashes; local 63 CombinationKeygenRecurse<hashtype>(key,0,maxlen,blocks,blockcount,hash,hashes); 67 printf("%d keys\n",(int)hashes.size()); 73 result &= TestHashList<hashtype>(hashes,testColl,testDist,drawDiagram); 85 void PermutationKeygenRecurse ( pfHash hash, uint32_t * blocks, int blockcount, int k, std::vector<hashtype> & hashes ) 93 hashes.push_back(h); 102 PermutationKeygenRecurse(hash,blocks,blockcount,k+1,hashes); 115 std::vector<hashtype> hashes; local 171 std::vector<hashtype> hashes; local 208 std::vector<hashtype> hashes; local 256 std::vector<hashtype> hashes; local 301 std::vector<hashtype> hashes; local 343 std::vector<hashtype> hashes; local 388 std::vector<hashtype> hashes; local 421 std::vector<hashtype> hashes; local [all...] |
H A D | Stats.h | 42 int FindCollisions ( std::vector<hashtype> & hashes, argument 48 std::sort(hashes.begin(),hashes.end()); 50 for(size_t i = 1; i < hashes.size(); i++) 52 if(hashes[i] == hashes[i-1]) 58 collisions.insert(hashes[i]); 106 double TestDistribution ( std::vector<hashtype> & hashes, bool drawDiagram ) argument 119 while(double(hashes.size()) / double(1 << maxwidth) < 5.0) 138 for(size_t j = 0; j < hashes 191 TestHashList( std::vector<hashtype> & hashes, std::vector<hashtype> & collisions, bool testDist, bool drawDiagram ) argument 251 TestHashList( std::vector<hashtype> & hashes, bool , bool testDist, bool drawDiagram ) argument 265 std::vector<hashtype> hashes; local 300 TestDistributionBytepairs( std::vector<hashtype> & hashes, bool drawDiagram ) argument 354 TestDistributionFast( std::vector<hashtype> & hashes, double & dworst, double & davg ) argument [all...] |
/external/chromium_org/net/http/ |
H A D | transport_security_persister_unittest.cc | 171 net::HashValueVector hashes; local 173 EXPECT_FALSE(domain_state.CheckPublicKeyPins(hashes, &failure_log)); 179 EXPECT_FALSE(domain_state.CheckPublicKeyPins(hashes, &failure_log)); 181 hashes.push_back(sha1); 182 EXPECT_TRUE(domain_state.CheckPublicKeyPins(hashes, &failure_log)); 184 hashes[0].data()[0] = '2'; 185 EXPECT_FALSE(domain_state.CheckPublicKeyPins(hashes, &failure_log));
|
H A D | http_security_headers_unittest.cc | 135 HashValueVector hashes; local 138 // Set some fake "chain" hashes 148 &include_subdomains, &hashes)); 150 &include_subdomains, &hashes)); 152 &include_subdomains, &hashes)); 154 &include_subdomains, &hashes)); 156 &include_subdomains, &hashes)); 158 &include_subdomains, &hashes)); 160 &include_subdomains, &hashes)); 162 &include_subdomains, &hashes)); 384 HashValueVector hashes; local 554 HashValueVector hashes; local [all...] |
H A D | transport_security_state_unittest.cc | 537 HashValueVector hashes; local 540 EXPECT_FALSE(domain_state.CheckPublicKeyPins(hashes, &failure_log));
|
H A D | http_security_headers.cc | 120 HashValueVector* hashes) { 135 hashes->push_back(hash); 280 HashValueVector* hashes) { 330 for (HashValueVector::const_iterator j = hashes->begin(); 331 j != hashes->end(); ++j) { 339 hashes->push_back(*i); 118 ParseAndAppendPin(const std::string& value, HashValueTag tag, HashValueVector* hashes) argument 276 ParseHPKPHeader(const std::string& value, const HashValueVector& chain_hashes, base::TimeDelta* max_age, bool* include_subdomains, HashValueVector* hashes) argument
|
H A D | transport_security_persister.cc | 29 base::ListValue* SPKIHashesToListValue(const HashValueVector& hashes) { argument 31 for (size_t i = 0; i != hashes.size(); i++) 32 pins->Append(new base::StringValue(hashes[i].ToString())); 37 HashValueVector* hashes) { 44 hashes->push_back(fingerprint); 49 // This function converts the binary hashes to a base64 string which we can 36 SPKIHashesFromListValue(const base::ListValue& pins, HashValueVector* hashes) argument
|
/external/oprofile/daemon/ |
H A D | 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]);
|
H A D | 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]);
|
/external/bouncycastle/bcpkix/src/main/java/org/bouncycastle/cms/ |
H A D | CMSSignedData.java | 65 private Map hashes; field in class:CMSSignedData 94 * @param hashes a map of precomputed digests for content indexed by name of hash. 98 Map hashes, 102 this(hashes, CMSUtils.readContentInfo(sigBlock)); 165 Map hashes, 169 this.hashes = hashes; 239 if (hashes == null) 245 Object obj = hashes.keySet().iterator().next(); 246 byte[] hash = (obj instanceof String) ? (byte[])hashes 97 CMSSignedData( Map hashes, byte[] sigBlock) argument 164 CMSSignedData( Map hashes, ContentInfo sigData) argument [all...] |
/external/chromium_org/extensions/browser/ |
H A D | computed_hashes.cc | 81 std::vector<std::string>* hashes = &(data_[relative_path].second); local 88 hashes->push_back(std::string()); 89 std::string* decoded = &hashes->back(); 91 hashes->clear(); 101 std::vector<std::string>* hashes) { 123 *hashes = info.second; 135 const std::vector<std::string>& hashes) { 144 for (std::vector<std::string>::const_iterator i = hashes.begin(); 145 i != hashes.end(); 172 std::vector<std::string>* hashes) { 99 GetHashes(const base::FilePath& relative_path, int* block_size, std::vector<std::string>* hashes) argument 133 AddHashes(const base::FilePath& relative_path, int block_size, const std::vector<std::string>& hashes) argument 170 ComputeHashesForContent(const std::string& contents, size_t block_size, std::vector<std::string>* hashes) argument [all...] |
H A D | verified_contents.cc | 151 DictionaryValue* hashes = NULL; local 152 if (!hashes_list->GetDictionary(i, &hashes)) 155 if (!hashes->GetString(kFormatKey, &format) || format != kTreeHash) 160 if (!hashes->GetInteger(kBlockSizeKey, &block_size) || 161 !hashes->GetInteger(kHashBlockSizeKey, &hash_block_size)) 171 if (!hashes->GetList(kFilesKey, &files))
|
/external/chromium_org/net/cert/ |
H A D | cert_verify_proc_openssl.cc | 158 HashValueVector* hashes) { 175 hashes->push_back(sha1); 179 hashes->push_back(sha256); 157 AppendPublicKeyHashes(X509_STORE_CTX* store_ctx, HashValueVector* hashes) argument
|
/external/chromium_org/third_party/libsrtp/srtp/ |
H A D | Makefile | 81 hashes = crypto/hash/null_auth.o crypto/hash/sha1.o \ macro 98 cryptobj = $(ciphers) $(hashes) $(math) $(stat) $(kernel) $(replay)
|
/external/chromium_org/third_party/libsrtp/srtp/crypto/ |
H A D | Makefile | 80 hashes = hash/null_auth.o hash/sha1.o \ macro 94 cryptobj = $(ciphers) $(hashes) $(math) $(stat) $(kernel) $(xfm)
|
/external/srtp/ |
H A D | Makefile | 79 hashes = crypto/hash/null_auth.o crypto/hash/sha1.o \ macro 96 cryptobj = $(ciphers) $(hashes) $(math) $(stat) $(kernel) $(replay)
|
/external/srtp/crypto/ |
H A D | Makefile | 73 hashes = hash/null_auth.o hash/sha1.o \ macro 87 cryptobj = $(ciphers) $(hashes) $(math) $(stat) $(kernel) $(xfm)
|
/external/chromium_org/chrome/browser/safe_browsing/ |
H A D | prefix_set_unittest.cc | 405 // Test that full hashes are persisted. 407 std::vector<SBFullHash> hashes; local 408 hashes.push_back(SBFullHashForString("one")); 409 hashes.push_back(SBFullHashForString("two")); 410 hashes.push_back(SBFullHashForString("three")); 415 for (size_t i = 0; i < hashes.size(); ++i) { 417 std::lower_bound(prefixes.begin(), prefixes.end(), hashes[i].prefix); 418 if (iter != prefixes.end() && *iter == hashes[i].prefix) 423 ASSERT_TRUE(builder.GetPrefixSet(hashes)->WriteFile(filename)); 429 EXPECT_TRUE(prefix_set->Exists(hashes[ 612 std::vector<SBFullHash> hashes; local [all...] |
/external/chromium_org/chrome/browser/supervised_user/ |
H A D | supervised_user_site_list.cc | 69 // (via URL patterns or hostname hashes) and the URL in the corresponding Site 91 std::vector<std::string>* hashes = &site->hostname_hashes; local 103 hashes->push_back(hash);
|
/external/chromium_org/third_party/mesa/src/src/gallium/auxiliary/cso_cache/ |
H A D | 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/jemalloc/src/ |
H A D | 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); 129 size_t hashes[2], bucket, tbucket; local 141 * were an item for which both hashes indicated the same 158 ckh->hash(key, hashes); 159 tbucket = hashes[ 196 size_t hashes[2], bucket; local [all...] |
/external/mesa3d/src/gallium/auxiliary/cso_cache/ |
H A D | 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/valgrind/main/VEX/useful/ |
H A D | smchash.c | 266 UInt* hashes = malloc( nHashes * sizeof(UInt) ); local 271 assert(hashes); 285 hashes[hashIx++] = hRunning; 310 free(hashes);
|