| /external/e2fsprogs/lib/ext2fs/ |
| ext_attr.c | 32 * Compute the hash of an extended attribute.
36 __u32 hash = 0; local
41 hash = (hash << NAME_HASH_SHIFT) ^
42 (hash >> (8*sizeof(hash) - NAME_HASH_SHIFT)) ^
46 /* The hash needs to be calculated on the data in little-endian. */
51 hash = (hash << VALUE_HASH_SHIFT) ^
52 (hash >> (8*sizeof(hash) - VALUE_HASH_SHIFT))
[all...] |
| /external/fio/ |
| hash.h | 35 unsigned long hash = val; local
39 unsigned long n = hash;
41 hash -= n;
43 hash -= n;
45 hash += n;
47 hash -= n;
49 hash += n;
51 hash += n;
54 hash *= GOLDEN_RATIO_PRIME;
57 return hash;
[all...] |
| /external/iproute2/tc/ |
| f_tcindex.c | 20 fprintf(stderr," Usage: ... tcindex [ hash SIZE ] [ mask MASK ]"
45 if (!strcmp(*argv,"hash")) {
46 int hash; local
49 hash = strtoul(*argv,&end,0);
50 if (*end || !hash || hash > 0x10000) {
54 addattr_l(n,4096,TCA_TCINDEX_HASH,&hash,sizeof(hash));
133 __u16 hash; local
135 if (RTA_PAYLOAD(tb[TCA_TCINDEX_HASH]) < sizeof(hash))
[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/guava/guava-tests/test/com/google/common/collect/ |
| MapMakerInternalMapTest.java | 368 int hash = map.hash(one); local
369 ReferenceEntry<Object, Object> entry = segment.getEntry(one, hash);
415 int hashOne = map.hash(keyOne);
428 int hashTwo = map.hash(keyTwo);
447 int hashOne = map.hash(keyOne);
453 int hashTwo = map.hash(keyTwo);
497 int hash = map.hash(key); local
500 int index = hash & (table.length() - 1)
572 int hash = map.hash(key); local
616 int hash = map.hash(key); local
655 int hash = map.hash(key); local
687 int hash = map.hash(key); local
722 int hash = map.hash(key); local
755 int hash = map.hash(key); local
794 int hash = map.hash(key); local
847 int hash = map.hash(key); local
980 int hash = map.hash(key); local
1038 int hash = map.hash(key); local
1070 int hash = map.hash(key); local
1104 int hash = map.hash(key); local
1151 int hash = map.hash(key); local
1266 int hash = map.hash(key); local
1307 int hash = map.hash(key); local
1349 int hash = map.hash(key); local
1450 int hash = map.hash(key); local
1700 private final int hash; field in class:MapMakerInternalMapTest.DummyEntry
[all...] |
| /external/libcxx/test/std/containers/unord/unord.multiset/unord.multiset.cnstr/ |
| assign_move.pass.cpp | 12 // template <class Value, class Hash = hash<Value>, class Pred = equal_to<Value>,
33 test_hash<std::hash<int> >,
49 test_hash<std::hash<int> >(8),
55 test_hash<std::hash<int> >(2),
74 assert(c.hash_function() == test_hash<std::hash<int> >(8));
86 test_hash<std::hash<int> >,
102 test_hash<std::hash<int> >(8),
108 test_hash<std::hash<int> >(2),
119 assert(c.hash_function() == test_hash<std::hash<int> >(8))
[all...] |
| /ndk/sources/cxx-stl/llvm-libc++/libcxx/test/containers/unord/unord.multiset/unord.multiset.cnstr/ |
| assign_move.pass.cpp | 12 // template <class Value, class Hash = hash<Value>, class Pred = equal_to<Value>,
33 test_hash<std::hash<int> >,
49 test_hash<std::hash<int> >(8),
55 test_hash<std::hash<int> >(2),
74 assert(c.hash_function() == test_hash<std::hash<int> >(8));
86 test_hash<std::hash<int> >,
102 test_hash<std::hash<int> >(8),
108 test_hash<std::hash<int> >(2),
119 assert(c.hash_function() == test_hash<std::hash<int> >(8))
[all...] |
| /system/bt/btcore/src/ |
| bdaddr.c | 96 hash_index_t hash = 5381; local
99 hash = ((hash << 5) + hash) + bytes[i];
100 return hash;
|
| /external/deqp/framework/delibs/depool/ |
| dePoolHashSet.h | 23 * \brief Memory pool hash-set class.
37 * \brief Declare a template pool hash-set (hash of sets) class interface.
38 * \param TYPENAME Type name of the declared hash-set.
44 * The functions for operating the hash are:
51 * Hash<Set*>* HashSet_getHash (const HashSet* hashSet); TODO: better API
60 DE_DECLARE_POOL_HASH(TYPENAME##Hash, KEYTYPE, TYPENAME##Set*); \
63 TYPENAME##Hash* hash; \
68 DE_INLINE TYPENAME##Hash* TYPENAME##_getHash (const TYPENAME* hashSet) DE_UNUSED_FUNCTION;
[all...] |
| /external/freetype/src/cache/ |
| ftccache.h | 62 FT_Offset hash; /* used for hashing too */ member in struct:FTC_NodeRec_
76 #define FTC_NODE__TOP_FOR_HASH( cache, hash ) \
78 ( ( ( ( hash ) & ( cache )->mask ) < ( cache )->p ) \
79 ? ( ( hash ) & ( ( cache )->mask * 2 + 1 ) ) \
80 : ( ( hash ) & ( cache )->mask ) ) )
84 FT_Offset hash );
85 #define FTC_NODE__TOP_FOR_HASH( cache, hash ) \
86 ftc_get_top_node_for_hash( ( cache ), ( hash ) )
142 /* each cache really implements a dynamic hash table to manage its nodes */
182 FT_Offset hash,
[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/libdrm/ |
| xf86drmHash.c | 1 /* xf86drmHash.c -- Small hash table support for integer -> integer mapping
31 * hash table using self-organizing linked lists [Knuth73, pp. 398-399] for
40 * 2) The hash computation uses a table of random integers [Hanson97,
48 * dynamic hash tables was postponed until the need arises. A common (and
49 * naive) approach to dynamic hash table implementation simply creates a
50 * new hash table when necessary, rehashes all the data into the new table,
66 * [Larson88] Per-Ake Larson. "Dynamic Hash Tables". CACM 31(4), April
131 unsigned long hash = 0; local
146 hash = (hash << 1) + scatter[tmp & 0xff]
200 unsigned long hash = HashHash(key); local
242 unsigned long hash; local
263 unsigned long hash; local
[all...] |
| /external/mesa3d/src/glx/ |
| glxhash.c | 1 /* glxhash.c -- Small hash table support for integer -> integer mapping
33 * hash table using self-organizing linked lists [Knuth73, pp. 398-399] for
42 * 2) The hash computation uses a table of random integers [Hanson97,
50 * dynamic hash tables was postponed until the need arises. A common (and
51 * naive) approach to dynamic hash table implementation simply creates a
52 * new hash table when necessary, rehashes all the data into the new table,
68 * [Larson88] Per-Ake Larson. "Dynamic Hash Tables". CACM 31(4), April
129 unsigned long hash = 0; local
145 hash = (hash << 1) + scatter[tmp & 0xff]
203 unsigned long hash = HashHash(key); local
251 unsigned long hash; local
276 unsigned long hash; local
[all...] |
| /external/guava/guava/src/com/google/common/hash/ |
| AbstractStreamingHashFunction.java | 15 package com.google.common.hash;
28 * {@link Hasher#hash}.
37 return newHasher().putObject(instance, funnel).hash();
49 return newHasher().putUnencodedChars(input).hash();
53 return newHasher().putString(input, charset).hash();
57 return newHasher().putInt(input).hash();
61 return newHasher().putLong(input).hash();
65 return newHasher().putBytes(input).hash();
69 return newHasher().putBytes(input, off, len).hash();
86 /** Buffer via which we pass data to the hash algorithm (the implementor) *
245 public final HashCode hash() { method in class:AbstractStreamingHashFunction.AbstractStreamingHasher
[all...] |
| /external/libcxx/test/std/containers/unord/unord.set/unord.set.cnstr/ |
| copy.pass.cpp | 12 // template <class Value, class Hash = hash<Value>, class Pred = equal_to<Value>,
31 test_hash<std::hash<int> >,
47 test_hash<std::hash<int> >(8),
58 assert(c.hash_function() == test_hash<std::hash<int> >(8));
70 test_hash<std::hash<int> >,
86 test_hash<std::hash<int> >(8),
97 assert(c.hash_function() == test_hash<std::hash<int> >(8));
110 test_hash<std::hash<int> >,
126 test_hash<std::hash<int> >(8)
[all...] |
| /ndk/sources/cxx-stl/llvm-libc++/libcxx/test/containers/unord/unord.set/unord.set.cnstr/ |
| copy.pass.cpp | 12 // template <class Value, class Hash = hash<Value>, class Pred = equal_to<Value>,
31 test_hash<std::hash<int> >,
47 test_hash<std::hash<int> >(8),
58 assert(c.hash_function() == test_hash<std::hash<int> >(8));
70 test_hash<std::hash<int> >,
86 test_hash<std::hash<int> >(8),
97 assert(c.hash_function() == test_hash<std::hash<int> >(8));
110 test_hash<std::hash<int> >,
126 test_hash<std::hash<int> >(8)
[all...] |
| /external/apache-harmony/x-net/src/test/impl/java.injected/org/apache/harmony/xnet/provider/jsse/ |
| ServerKeyExchangeTest.java | 36 byte[] hash = new byte[] { 1, 2, 3, 4, 5, 6, 7, 8, 9, 0, 1, 2, 3, 4, 5,
39 null, hash);
43 assertTrue("incorrect ServerKeyExchange", Arrays.equals(message.hash,
44 hash));
60 assertTrue("incorrect message decoding", Arrays.equals(message.hash,
61 message_2.hash));
90 byte[] hash = new byte[] { 1, 2, 3, 4, 5, 6, 7, 8, 9, 0, 1, 2, 3, 4, 5,
93 hash);
97 assertTrue("incorrect ServerKeyExchange", Arrays.equals(message.hash,
98 hash));
[all...] |
| /external/boringssl/src/crypto/lhash/ |
| lhash.c | 68 * average chain length exceeds this value, the hash table will be resized. */
72 _LHASH *lh_new(lhash_hash_func hash, lhash_cmp_func comp) {
93 ret->hash = hash;
94 if (ret->hash == NULL) {
95 ret->hash = (lhash_hash_func) lh_strhash;
128 * is not NULL, then it also puts the hash value of |data| in |*out_hash|. */
131 const uint32_t hash = lh->hash(data); local
135 *out_hash = hash;
225 uint32_t hash; local
[all...] |
| /external/ipsec-tools/src/racoon/ |
| vendorid.c | 132 lookup_vendor_id_by_hash (const char *hash)
135 unsigned char *h = (unsigned char *)hash;
138 if (strncmp(all_vendor_ids[i].hash->v, hash,
139 all_vendor_ids[i].hash->l) == 0)
154 all_vendor_ids[i].hash = vmalloc(sizeof(vendorid_dpd_hash));
155 if (all_vendor_ids[i].hash == NULL) {
157 "unable to get memory for VID hash\n");
160 memcpy(all_vendor_ids[i].hash->v, vendorid_dpd_hash,
168 all_vendor_ids[i].hash = eay_md5_one(&vid)
[all...] |
| /frameworks/opt/bitmap/src/com/android/bitmap/ |
| ContiguousFIFOAggregator.java | 100 final int hash = key.hashCode(); local
103 mTasks.remove(hash);
107 mTasks.put(hash, new Value(callback, null));
167 final int hash = key.hashCode(); local
168 final Value value = mTasks.get(hash);
201 final int hash = first.hashCode(); local
202 final Value value = mTasks.get(hash);
209 mTasks.delete(hash);
224 final int hash = key.hashCode(); local
225 final Value value = mTasks.get(hash);
257 final int hash = key.hashCode(); local
[all...] |
| /system/core/include/utils/ |
| BasicHashtable.h | 32 // such that at least two entries both hash to this bucket. When true, we
39 // Mask for 30 bits worth of the hash code that are stored within the bucket to
41 // hash code of the entry's key.
45 // a 30 bit hash code.
69 ssize_t find(ssize_t index, hash_t hash, const void* __restrict__ key) const;
70 size_t add(hash_t hash, const void* __restrict__ entry);
119 // Trim a hash code to 30 bits to match what we store in the bucket's cookie.
120 inline static hash_t trimHash(hash_t hash) {
121 return (hash & Bucket::HASH_MASK) ^ (hash >> 30)
[all...] |
| /external/apache-commons-math/src/main/java/org/apache/commons/math/stat/descriptive/ |
| StatisticalSummaryValues.java | 149 * Returns hash code based on values of statistics
151 * @return hash code
155 int result = 31 + MathUtils.hash(getMax());
156 result = result * 31 + MathUtils.hash(getMean());
157 result = result * 31 + MathUtils.hash(getMin());
158 result = result * 31 + MathUtils.hash(getN());
159 result = result * 31 + MathUtils.hash(getSum());
160 result = result * 31 + MathUtils.hash(getVariance());
|
| /external/apache-http/src/org/apache/http/auth/ |
| NTCredentials.java | 154 int hash = LangUtils.HASH_SEED; local
155 hash = LangUtils.hashCode(hash, this.principal);
156 hash = LangUtils.hashCode(hash, this.workstation);
157 return hash;
|
| /external/fio/lib/ |
| bloom.c | 5 #include "../hash.h"
94 uint32_t hash[N_HASHES]; local
98 hash[i] = hashes[i].fn(data, nwords, hashes[i].seed);
99 hash[i] = hash[i] % b->nentries;
104 const unsigned int index = hash[i] / BITS_PER_INDEX;
105 const unsigned int bit = hash[i] & BITS_INDEX_MASK;
|
| /external/guava/guava-tests/test/com/google/common/hash/ |
| AbstractByteHasherTest.java | 15 package com.google.common.hash;
75 new TestHasher().putString(s).hash(),
76 new TestHasher().putBytes(s.getBytes(UTF_16LE.name())).hash());
78 new TestHasher().putString(s).hash(),
79 new TestHasher().putString(s, UTF_16LE).hash());
137 public HashCode hash() { method in class:AbstractByteHasherTest.TestHasher
|
