| /external/chromium/net/http/ |
| des.cc | 92 void DESEncrypt(const uint8* key, const uint8* src, uint8* hash) {
100 reinterpret_cast<DES_cblock*>(hash), &ks, DES_ENCRYPT);
105 void DESEncrypt(const uint8* key, const uint8* src, uint8* hash) {
139 rv = PK11_CipherOp(ctxt, hash, reinterpret_cast<int*>(&n), 8,
145 rv = PK11_DigestFinal(ctxt, hash+8, &n, 0);
162 void DESEncrypt(const uint8* key, const uint8* src, uint8* hash) {
166 key, 8, NULL, src, 8, hash, 8, &data_out_moved);
173 void DESEncrypt(const uint8* key, const uint8* src, uint8* hash) {
210 CopyMemory(hash, src, 8);
214 CryptEncrypt(key, 0, FALSE, 0, hash, &hash_len, 8)
[all...] |
| /external/chromium/sdch/open-vcdiff/src/ |
| rolling_hash_test.cc | 110 result_array[i] = hasher.Hash(&buffer[i]);
120 uint32_t running_hash = hasher.Hash(buffer);
144 uint32_t running_hash = hasher.Hash(buffer_);
146 // UpdateHash() calculates the hash value incrementally.
150 // Hash() calculates the hash value from scratch. Verify that both
151 // methods return the same hash value.
152 EXPECT_EQ(running_hash, hasher.Hash(&buffer_[i + 1 - kBlockSize]));
158 // Execution time is expected to be O(kBlockSize) per hash operation,
170 // Execution time is expected to be O(1) per hash operation
[all...] |
| /external/chromium_org/content/browser/download/ |
| base_file.h | 87 // Fills |hash| with the hash digest for the file.
89 virtual bool GetHash(std::string* hash);
91 // Returns the current (intermediate) state of the hash as a byte string.
94 // Returns true if the given hash is considered empty. An empty hash is
96 // for the hash).
97 static bool IsEmptyHash(const std::string& hash);
163 // Indicates if hash should be calculated for the file.
166 // Used to calculate hash for the file when calculate_hash
[all...] |
| /external/chromium_org/net/http/ |
| des.cc | 92 void DESEncrypt(const uint8* key, const uint8* src, uint8* hash) {
100 reinterpret_cast<DES_cblock*>(hash), &ks, DES_ENCRYPT);
105 void DESEncrypt(const uint8* key, const uint8* src, uint8* hash) {
139 rv = PK11_CipherOp(ctxt, hash, reinterpret_cast<int*>(&n), 8,
145 rv = PK11_DigestFinal(ctxt, hash+8, &n, 0);
162 void DESEncrypt(const uint8* key, const uint8* src, uint8* hash) {
166 key, 8, NULL, src, 8, hash, 8, &data_out_moved);
173 void DESEncrypt(const uint8* key, const uint8* src, uint8* hash) {
210 CopyMemory(hash, src, 8);
214 CryptEncrypt(key, 0, FALSE, 0, hash, &hash_len, 8)
[all...] |
| /external/chromium_org/sdch/open-vcdiff/src/ |
| rolling_hash_test.cc | 110 result_array[i] = hasher.Hash(&buffer[i]);
120 uint32_t running_hash = hasher.Hash(buffer);
144 uint32_t running_hash = hasher.Hash(buffer_);
146 // UpdateHash() calculates the hash value incrementally.
150 // Hash() calculates the hash value from scratch. Verify that both
151 // methods return the same hash value.
152 EXPECT_EQ(running_hash, hasher.Hash(&buffer_[i + 1 - kBlockSize]));
158 // Execution time is expected to be O(kBlockSize) per hash operation,
170 // Execution time is expected to be O(1) per hash operation
[all...] |
| /external/kernel-headers/original/linux/sunrpc/ |
| svcauth.h | 17 #include <linux/hash.h>
49 struct hlist_node hash; member in struct:auth_domain
132 unsigned long hash = 0; local
143 hash = hash_long(hash^l, BITS_PER_LONG);
145 return hash >> (BITS_PER_LONG - bits);
150 unsigned long hash = 0; local
162 hash = hash_long(hash^l, BITS_PER_LONG);
164 return hash >> (BITS_PER_LONG - bits)
[all...] |
| /external/open-vcdiff/src/ |
| rolling_hash_test.cc | 110 result_array[i] = hasher.Hash(&buffer[i]);
120 uint32_t running_hash = hasher.Hash(buffer);
144 uint32_t running_hash = hasher.Hash(buffer_);
146 // UpdateHash() calculates the hash value incrementally.
150 // Hash() calculates the hash value from scratch. Verify that both
151 // methods return the same hash value.
152 EXPECT_EQ(running_hash, hasher.Hash(&buffer_[i + 1 - kBlockSize]));
158 // Execution time is expected to be O(kBlockSize) per hash operation,
170 // Execution time is expected to be O(1) per hash operation
[all...] |
| /frameworks/ml/bordeaux/learning/stochastic_linear_ranker/native/ |
| stochastic_linear_ranker.h | 40 template<class Key = std::string, class Hash = std::hash_map<std::string, double> >
168 void LoadWeights(const SparseWeightVector<Key, Hash> &model) {
172 void SaveWeights(SparseWeightVector<Key, Hash> *model) {
176 double ScoreSample(const SparseWeightVector<Key, Hash> &sample) {
200 int UpdateClassifier(const SparseWeightVector<Key, Hash> &positive,
201 const SparseWeightVector<Key, Hash> &negative);
204 SparseWeightVector<Key, Hash> weight_;
220 SparseWeightVector<Key, Hash> current_negative_;
234 void UpdateSubGradient(const SparseWeightVector<Key, Hash> &positive,
235 const SparseWeightVector<Key, Hash> &negative
[all...] |
| /libcore/luni/src/main/java/java/lang/annotation/ |
| Annotation.java | 67 * The hash code for all other member values is determined by simply
81 * Returns the hash code of this annotation. The hash code is determined
86 * The hash code of an annotation is the sum of the hash codes of
90 * The hash code of an annotation member is calculated as {@code
95 * The hash code for a primitive member value is determined using
101 * The hash code for an array member value {@code v} is determined
106 * The hash code for all other member values is determined by simply
111 * @return the hash code
[all...] |
| /sdk/hierarchyviewer/src/com/android/hierarchyviewer/scene/ |
| ViewNode.java | 160 int hash = 5; local
161 hash = 67 * hash + (this.name != null ? this.name.hashCode() : 0);
162 return hash;
192 int hash = 5; local
193 hash = 61 * hash + (this.name != null ? this.name.hashCode() : 0);
194 hash = 61 * hash + (this.value != null ? this.value.hashCode() : 0);
195 return hash;
[all...] |
| /external/bouncycastle/bcprov/src/main/java/org/bouncycastle/crypto/encodings/ |
| OAEPEncoding.java | 37 Digest hash)
39 this(cipher, hash, null);
44 Digest hash,
47 this(cipher, hash, hash, encodingParams);
52 Digest hash,
58 this.defHash = new byte[hash.getDigestSize()];
60 hash.reset();
64 hash.update(encodingParams, 0, encodingParams.length);
67 hash.doFinal(defHash, 0)
[all...] |
| /external/bouncycastle/bcprov/src/main/java/org/bouncycastle/jcajce/provider/asymmetric/rsa/ |
| DigestSignatureSpi.java | 137 byte[] hash = new byte[digest.getDigestSize()];
139 digest.doFinal(hash, 0);
143 byte[] bytes = derEncode(hash);
161 byte[] hash = new byte[digest.getDigestSize()];
163 digest.doFinal(hash, 0);
172 expected = derEncode(hash);
191 int sigOffset = sig.length - hash.length - 2;
192 int expectedOffset = expected.length - hash.length - 2;
197 for (int i = 0; i < hash.length; i++)
199 if (sig[sigOffset + i] != expected[expectedOffset + i]) // check hash
[all...] |
| /external/chromium_org/base/containers/ |
| hash_tables.h | 14 // NOTE: It is an explicit non-goal of this class to provide a generic hash
15 // function for pointers. If you want to hash a pointers to a particular class,
69 // The GNU C++ library provides identity hash functions for many integral types,
70 // but not for |long long|. This hash function will truncate if |size_t| is
76 struct hash<integral_type> { \
88 // Implement string hash functions so that strings of various flavors can
89 // be used as keys in STL maps and sets. The hash algorithm comes from the
96 struct hash<string_type> { \
123 // When size_t is 32 bits, we turn the 64-bit hash code into 32 bits by using
148 // We use the compound integer hash method to produce a 64-bit hash code, b
[all...] |
| /external/chromium_org/third_party/mesa/src/src/gallium/auxiliary/util/ |
| u_keymap.c | 82 * Return 4-byte hash key for a block of bytes.
85 hash(const void *key, unsigned keySize) function
87 unsigned i, hash; local
91 hash = 0;
93 hash ^= (i + 1) * ((const unsigned *) key)[i];
96 /*hash = hash ^ (hash >> 11) ^ (hash >> 22);*/
98 return hash;
[all...] |
| /external/clang/test/Index/ |
| index-module.m | 8 // RUN: -Xclang -fdisable-module-hash | FileCheck %s
12 // CHECK-NEXT: [ppIncludedFile]: {{.*}}/Modules/Inputs/DependsOnModule.framework{{[/\\]}}Headers{{[/\\]}}DependsOnModule.h | name: "DependsOnModule/DependsOnModule.h" | hash loc: 2:1 | isImport: 0 | isAngled: 1 | isModule: 1
21 // CHECK-DMOD-NEXT: [ppIncludedFile]: [[DMOD_MODULE_H:.*/Modules/Inputs/DependsOnModule\.framework[/\\]Headers[/\\]DependsOnModule\.h]] | {{.*}} | hash loc: <invalid>
22 // CHECK-DMOD-NEXT: [ppIncludedFile]: {{.*}}/Modules/Inputs/Module.framework{{[/\\]}}Headers{{[/\\]}}Module.h | name: "Module/Module.h" | hash loc: {{.*}}/Modules/Inputs/DependsOnModule.framework{{[/\\]}}Headers{{[/\\]}}DependsOnModule.h:1:1 | isImport: 0 | isAngled: 1 | isModule: 1
23 // CHECK-DMOD-NEXT: [ppIncludedFile]: [[DMOD_OTHER_H:.*/Modules/Inputs/DependsOnModule\.framework[/\\]Headers[/\\]other\.h]] | {{.*}} | hash loc: <invalid>
24 // CHECK-DMOD-NEXT: [ppIncludedFile]: [[DMOD_SUB_H:.*/Modules/Inputs/DependsOnModule\.framework[/\\]Frameworks[/\\]SubFramework\.framework[/\\]Headers[/\\]SubFramework\.h]] | {{.*}} | hash loc: <invalid>
25 // CHECK-DMOD-NEXT: [ppIncludedFile]: [[DMOD_SUB_OTHER_H:.*/Modules/Inputs/DependsOnModule.framework[/\\]Frameworks/SubFramework\.framework/Headers/Other\.h]] | name: "SubFramework/Other.h" | hash loc: [[DMOD_SUB_H]]:1:1 | isImport: 0 | isAngled: 0
26 // CHECK-DMOD-NEXT: [ppIncludedFile]: [[DMOD_PRIVATE_H:.*/Modules/Inputs/DependsOnModule.framework[/\\]PrivateHeaders[/\\]DependsOnModulePrivate.h]] | {{.*}} | hash loc: <invalid>
38 // CHECK-TMOD-NEXT: [ppIncludedFile]: [[TMOD_MODULE_H:.*/Modules/Inputs/Module\.framework[/\\]Headers[/\\]Module\.h]] | {{.*}} | hash loc: <invalid>
39 // CHECK-TMOD-NEXT: [ppIncludedFile]: [[TMODHDR:.*/Modules/Inputs/Module.framework[/\\]Headers.]]Sub.h | name: "Module/Sub.h" | hash loc: [[TMOD_MODULE_H]]:23:1 | isImport: 0 | isAngled:
[all...] |
| /external/mesa3d/src/gallium/auxiliary/util/ |
| u_keymap.c | 82 * Return 4-byte hash key for a block of bytes.
85 hash(const void *key, unsigned keySize) function
87 unsigned i, hash; local
91 hash = 0;
93 hash ^= (i + 1) * ((const unsigned *) key)[i];
96 /*hash = hash ^ (hash >> 11) ^ (hash >> 22);*/
98 return hash;
[all...] |
| /external/chromium_org/third_party/openssl/openssl/crypto/lhash/ |
| lhash.c | 59 /* Code for dynamic hash table routines
126 ret->hash=((h == NULL)?(LHASH_HASH_FN_TYPE)lh_strhash:h);
181 unsigned long hash; local
189 rn=getrn(lh,data,&hash);
201 nn->hash=hash;
219 unsigned long hash; local
224 rn=getrn(lh,data,&hash);
250 unsigned long hash; local
255 rn=getrn(lh,data,&hash);
314 unsigned long hash,nni; local
408 unsigned long hash,nn; local
[all...] |
| /external/openssl/crypto/lhash/ |
| lhash.c | 59 /* Code for dynamic hash table routines
126 ret->hash=((h == NULL)?(LHASH_HASH_FN_TYPE)lh_strhash:h);
181 unsigned long hash; local
189 rn=getrn(lh,data,&hash);
201 nn->hash=hash;
219 unsigned long hash; local
224 rn=getrn(lh,data,&hash);
250 unsigned long hash; local
255 rn=getrn(lh,data,&hash);
314 unsigned long hash,nni; local
408 unsigned long hash,nn; local
[all...] |
| /external/compiler-rt/lib/ubsan/ |
| ubsan_type_hash.cc | 10 // Implementation of a hash table for fast checking of inheritance
76 // (vptr,type) pair, a hash is computed. This hash is assumed to be globally
81 // * the vptr, and thus the hash, can be affected by ASLR, so multiple runs
84 // The first caching layer is a small hash table with no chaining; buckets are
85 // reused as needed. The second caching layer is a large hash table with open
88 // FIXME: Make these hash table accesses thread-safe. The races here are benign
92 /// Find a bucket to store the given hash value in.
110 /// A cache of recently-checked hashes. Mini hash table with "random" evictions.
208 bool __ubsan::checkDynamicType(void *Object, void *Type, HashValue Hash) {
[all...] |
| /external/libppp/src/ |
| pred.c | 52 /* The following hash code is the heart of the algorithm:
53 * It builds a sliding hash sum of the previous 3-and-a-bit characters
55 * A better hash function would result in additional compression,
58 #define HASH(state, x) state->hash = (state->hash << 4) ^ (x)
62 u_short hash; member in struct:pred1_state
77 if (state->dict[state->hash] == *source) {
80 state->dict[state->hash] = *source;
83 HASH(state, *source++)
[all...] |
| /external/llvm/lib/CodeGen/AsmPrinter/ |
| DwarfAccelTable.h | 30 // The dwarf accelerator tables are an indirect hash table optimized
46 // where the header contains a magic number, version, type of hash function,
51 // section contains all of the 32-bit hash values in contiguous memory, and
53 // hash.
55 // For a lookup example, we could hash a function name and take it modulo the
57 // as an index into the hashes table and look at each successive hash as long
58 // as the hash value is still the same modulo result (bucket value) as earlier.
86 uint32_t magic; // 'HASH' magic value to allow endian detection
88 uint16_t hash_function; // The hash function enumeration that was used.
89 uint32_t bucket_count; // The number of buckets in this hash table
[all...] |
| /external/jmonkeyengine/engine/src/core/com/jme3/input/ |
| InputManager.java | 154 private void invokeActions(int hash, boolean pressed) {
155 ArrayList<Mapping> maps = bindings.get(hash);
182 private void invokeTimedActions(int hash, long time, boolean pressed) {
183 if (!bindings.containsKey(hash)) {
188 pressedButtons.put(hash, time);
190 Long pressTimeObj = pressedButtons.remove(hash);
201 invokeAnalogs(hash, computeAnalogValue(timeDelta), false);
208 int hash = pressedButton.getKey();
local
214 invokeAnalogs(hash, computeAnalogValue(timeDelta), false);
219 int hash = axisValue.getKey(); local
324 int hash = JoyAxisTrigger.joyAxisHash(joyId, axis, true); local
330 int hash = JoyAxisTrigger.joyAxisHash(joyId, axis, false); local
354 int hash = JoyButtonTrigger.joyButtonHash(evt.getJoyIndex(), evt.getButtonIndex()); local
402 int hash = MouseButtonTrigger.mouseButtonHash(evt.getButtonIndex()); local
424 int hash = KeyTrigger.keyHash(evt.getKeyCode()); local
531 int hash = trigger.triggerHashCode(); local
578 int hash = triggers.get(i); local
[all...] |
| /external/antlr/antlr-3.4/runtime/ObjC/Framework/ |
| ANTLRPtrStack.m | 73 * HASH hash entry to get index to table
74 * NSInteger hash( ANTLRPtrStack *self, char *s );
83 -(NSInteger)hash:(NSString *)s /* form hash value for string s */
111 for( np = ptrBuffer[[self hash:s]]; np != nil; np = [np getfNext] ) {
|
| /external/apache-http/src/org/apache/http/auth/ |
| NTUserPrincipal.java | 88 int hash = LangUtils.HASH_SEED; local
89 hash = LangUtils.hashCode(hash, this.username);
90 hash = LangUtils.hashCode(hash, this.domain);
91 return hash;
|
| /external/chromium_org/courgette/ |
| difference_estimator.cc | 26 size_t hash = ((hash1 * 17 + hash2 * 37) + (hash1 >> 17)) ^ (hash2 >> 23); local
27 return hash;
46 size_t hash = HashTuple(p); local
47 hashes_.insert(hash);
103 size_t hash = HashTuple(p); local
104 if (base->hashes_.find(hash) == base->hashes_.end()) {
|
