HomeSort by relevance Sort by last modified time
    Searched full:hash (Results 101 - 125 of 8794) sorted by null

1 2 3 45 6 7 8 91011>>

  /external/linux-tools-perf/util/include/linux/added/
hash.h 40 u64 hash = val; local
43 u64 n = hash;
45 hash -= n;
47 hash -= n;
49 hash += n;
51 hash -= n;
53 hash += n;
55 hash += n;
58 return hash >> (64 - bits);
64 u32 hash = val * GOLDEN_RATIO_PRIME_32 local
    [all...]
  /frameworks/base/tools/aapt/
ResourceIdCache.cpp 36 static inline uint32_t hashround(uint32_t hash, int c) {
37 return ((hash << 5) + hash) + c; /* hash * 33 + c */
40 static uint32_t hash(const android::String16& hashableString) { function
41 uint32_t hash = 5381; local
43 while (int c = *str++) hash = hashround(hash, c);
44 return hash;
65 const uint32_t hashcode = hash(hashedName)
    [all...]
  /external/chromium_org/chrome/installer/mac/third_party/bsdiff/
sha1_adapter.cc 9 void SHA1(const unsigned char* data, size_t len, unsigned char* hash) {
10 base::SHA1HashBytes(data, len, hash);
  /external/chromium_org/media/base/
audio_hash.h 18 // Computes a running hash for a series of AudioBus objects. The hash is the
20 // current hash count. The hash was designed with two properties in mind:
37 // Update current hash with the contents of the provided AudioBus.
40 // Return a string representation of the current hash.
44 // Storage for the audio hash. The number of buckets controls the importance
45 // of position in the hash. A higher number reduces the chance of false
  /external/chromium_org/third_party/leveldatabase/src/util/
hash.h 5 // Simple hash function used for internal data structures
15 extern uint32_t Hash(const char* data, size_t n, uint32_t seed);
  /external/openfst/
fix_headers.sh 21 fix_tr1 "tr1::hash" "hash"
  /frameworks/ml/bordeaux/learning/stochastic_linear_ranker/native/
sparse_weight_vector.cpp 34 template<class Key, class Hash>
35 bool SparseWeightVector<Key, Hash>::IsValid() const {
47 template<class Key, class Hash>
48 void SparseWeightVector<Key, Hash>::AdditiveWeightUpdate(
50 const SparseWeightVector<Key, Hash> &w1,
61 template<class Key, class Hash>
62 void SparseWeightVector<Key, Hash>::AdditiveSquaredWeightUpdate(
64 const SparseWeightVector<Key, Hash> &w1,
76 template<class Key, class Hash>
77 void SparseWeightVector<Key, Hash>::AdditiveInvSqrtWeightUpdate
    [all...]
  /external/chromium_org/third_party/icu/source/common/
hash.h 28 UHashtable* hash; member in class:Hashtable
110 hash = &hashObj;
111 uhash_setKeyDeleter(hash, uhash_deleteUnicodeString);
116 UErrorCode& status) : hash(0) {
120 : hash(0)
131 : hash(0)
137 : hash(0)
144 if (hash != NULL) {
145 uhash_close(hash);
150 return uhash_setValueDeleter(hash, fn)
    [all...]
  /external/guava/guava-tests/test/com/google/common/hash/
Murmur3Hash32Test.java 17 package com.google.common.hash;
19 import static com.google.common.hash.Hashing.murmur3_32;
21 import com.google.common.hash.Funnels;
22 import com.google.common.hash.HashTestUtils.HashFn;
32 @Override public byte[] hash(byte[] input, int seed) {
35 return hasher.hash().asBytes();
  /external/icu4c/common/
hash.h 29 UHashtable* hash; member in class:Hashtable
111 hash = &hashObj;
112 uhash_setKeyDeleter(hash, uprv_deleteUObject);
117 UErrorCode& status) : hash(0) {
121 : hash(0)
132 : hash(0)
138 : hash(0)
145 if (hash != NULL) {
146 uhash_close(hash);
151 return uhash_setValueDeleter(hash, fn)
    [all...]
  /prebuilts/tools/common/proguard/proguard4.7/docs/manual/retrace/
index.html 11 window.top.location.replace("../../index.html#"+window.location.pathname+window.location.hash);
13 var hash="#"+window.location.pathname.replace(window.top.location.pathname.replace("index.html", ""), "");
14 if (window.top.location.hash!=hash)
15 window.top.location.hash=hash;
  /external/chromium/net/base/
ssl_false_start_blacklist.h 14 // precompiled by the code in ssl_false_start_blacklist_process.cc into a hash
22 // Hash returns the modified djb2 hash of the given string.
23 static unsigned Hash(const char* str) {
24 // This is inline because the code which generates the hash table needs to
29 unsigned hash = 5381; local
33 hash = ((hash << 5) + hash) ^ c;
34 return hash;
    [all...]
  /prebuilts/gcc/linux-x86/host/i686-linux-glibc2.7-4.4.3/i686-linux/include/c++/4.4.3/tr1_impl/
functional_hash.h 34 /// Class template hash.
35 // Declaration of default hash functor std::tr1::hash. The types for
36 // which std::tr1::hash<T> is well-defined is in clause 6.3.3. of the PDTR.
38 struct hash : public std::unary_function<_Tp, size_t> struct in namespace:std
46 struct hash<_Tp*> : public std::unary_function<_Tp*, size_t> struct in namespace:std
57 hash<_Tp>::operator()(_Tp __val) const \
80 // Fowler / Noll / Vo (FNV) Hash (type FNV-1a)
81 // (Used by the next specializations of std::tr1::hash.)
88 hash(const char* __first, size_t __length function in struct:std::_Fnv_hash
101 hash(const char* __first, size_t __length) function in struct:std::_Fnv_hash
117 hash(const char* __first, size_t __length) function in struct:std::_Fnv_hash
    [all...]
  /prebuilts/ndk/5/sources/cxx-stl/gnu-libstdc++/include/tr1_impl/
functional_hash.h 34 /// Class template hash.
35 // Declaration of default hash functor std::tr1::hash. The types for
36 // which std::tr1::hash<T> is well-defined is in clause 6.3.3. of the PDTR.
38 struct hash : public std::unary_function<_Tp, size_t> struct in namespace:std
46 struct hash<_Tp*> : public std::unary_function<_Tp*, size_t> struct in namespace:std
57 hash<_Tp>::operator()(_Tp __val) const \
80 // Fowler / Noll / Vo (FNV) Hash (type FNV-1a)
81 // (Used by the next specializations of std::tr1::hash.)
88 hash(const char* __first, size_t __length function in struct:std::_Fnv_hash
101 hash(const char* __first, size_t __length) function in struct:std::_Fnv_hash
117 hash(const char* __first, size_t __length) function in struct:std::_Fnv_hash
    [all...]
  /prebuilts/ndk/6/sources/cxx-stl/gnu-libstdc++/include/tr1_impl/
functional_hash.h 34 /// Class template hash.
35 // Declaration of default hash functor std::tr1::hash. The types for
36 // which std::tr1::hash<T> is well-defined is in clause 6.3.3. of the PDTR.
38 struct hash : public std::unary_function<_Tp, size_t> struct in namespace:std
46 struct hash<_Tp*> : public std::unary_function<_Tp*, size_t> struct in namespace:std
57 hash<_Tp>::operator()(_Tp __val) const \
80 // Fowler / Noll / Vo (FNV) Hash (type FNV-1a)
81 // (Used by the next specializations of std::tr1::hash.)
88 hash(const char* __first, size_t __length function in struct:std::_Fnv_hash
101 hash(const char* __first, size_t __length) function in struct:std::_Fnv_hash
117 hash(const char* __first, size_t __length) function in struct:std::_Fnv_hash
    [all...]
  /prebuilts/ndk/7/sources/cxx-stl/gnu-libstdc++/include/tr1_impl/
functional_hash.h 34 /// Class template hash.
35 // Declaration of default hash functor std::tr1::hash. The types for
36 // which std::tr1::hash<T> is well-defined is in clause 6.3.3. of the PDTR.
38 struct hash : public std::unary_function<_Tp, size_t> struct in namespace:std
46 struct hash<_Tp*> : public std::unary_function<_Tp*, size_t> struct in namespace:std
57 hash<_Tp>::operator()(_Tp __val) const \
80 // Fowler / Noll / Vo (FNV) Hash (type FNV-1a)
81 // (Used by the next specializations of std::tr1::hash.)
88 hash(const char* __first, size_t __length function in struct:std::_Fnv_hash
101 hash(const char* __first, size_t __length) function in struct:std::_Fnv_hash
117 hash(const char* __first, size_t __length) function in struct:std::_Fnv_hash
    [all...]
  /prebuilts/ndk/8/sources/cxx-stl/gnu-libstdc++/4.4.3/include/tr1_impl/
functional_hash.h 34 /// Class template hash.
35 // Declaration of default hash functor std::tr1::hash. The types for
36 // which std::tr1::hash<T> is well-defined is in clause 6.3.3. of the PDTR.
38 struct hash : public std::unary_function<_Tp, size_t> struct in namespace:std
46 struct hash<_Tp*> : public std::unary_function<_Tp*, size_t> struct in namespace:std
57 hash<_Tp>::operator()(_Tp __val) const \
80 // Fowler / Noll / Vo (FNV) Hash (type FNV-1a)
81 // (Used by the next specializations of std::tr1::hash.)
88 hash(const char* __first, size_t __length function in struct:std::_Fnv_hash
101 hash(const char* __first, size_t __length) function in struct:std::_Fnv_hash
117 hash(const char* __first, size_t __length) function in struct:std::_Fnv_hash
    [all...]
  /prebuilts/ndk/9/sources/cxx-stl/gnu-libstdc++/4.8/include/bits/
functional_hash.h 56 /// Primary class template hash.
58 struct hash;
62 struct hash<_Tp*> : public __hash_base<size_t, _Tp*> struct in inherits:__hash_base
72 struct hash<_Tp> : public __hash_base<size_t, _Tp> \
129 hash(const void* __ptr, size_t __clength, function in struct:_Hash_impl
135 hash(const _Tp& __val) function in struct:_Hash_impl
136 { return hash(&__val, sizeof(__val)); }
141 { return hash(&__val, sizeof(__val), __hash); }
147 hash(const void* __ptr, size_t __clength, function in struct:_Fnv_hash_impl
153 hash(const _Tp& __val function in struct:_Fnv_hash_impl
164 struct hash<float> : public __hash_base<size_t, float> struct in inherits:__hash_base
176 struct hash<double> : public __hash_base<size_t, double> struct in inherits:__hash_base
188 struct hash<long double> struct in inherits:__hash_base
    [all...]
  /art/runtime/
gc_map.h 68 size_t index = Hash(native_pc_offset) % num_entries;
78 static uint32_t Hash(uint32_t native_offset) {
79 uint32_t hash = native_offset; local
80 hash ^= (hash >> 20) ^ (hash >> 12);
81 hash ^= (hash >> 7) ^ (hash >> 4);
82 return hash;
    [all...]
  /external/chromium_org/net/quic/crypto/
null_decrypter.cc 29 uint128 hash; local
30 if (!ReadHash(&reader, &hash)) {
39 if (hash != ComputeHash(buffer)) {
54 uint128 hash; local
55 if (!ReadHash(&reader, &hash)) {
65 if (hash != ComputeHash(buffer)) {
75 bool NullDecrypter::ReadHash(QuicDataReader* reader, uint128* hash) {
82 *hash = hi;
83 *hash <<= 64;
84 *hash += lo
    [all...]
  /external/chromium_org/third_party/JSON/
get_and_build_json_pm.sh 16 # Check hash
17 # SHA-1 hash generated via:
21 echo "SHA-1 hash file $SHA1_FILENAME not found, could not verify archive"
25 # Check that hash file contains hash for archive
26 HASHFILE_REGEX="^[0-9a-f]{40} $FILENAME" # 40-digit hash, followed by filename
30 echo "SHA-1 hash file $SHA1_FILENAME does not contain hash for $FILENAME," \
32 echo 'Hash file contents are:'
39 echo 'SHA-1 hash does not match,'
    [all...]
  /prebuilts/python/darwin-x86/2.7.5/include/python2.7/
setobject.h 17 Note: .pop() abuses the hash field of an Unused or Dummy slot to
18 hold a search finger. The hash field of Unused or Dummy slots has
25 long hash; /* cached hash code for the entry key */ member in struct:__anon60482
52 setentry *(*lookup)(PySetObject *so, PyObject *key, long hash);
55 long hash; /* only used by frozenset objects */ member in struct:_setobject
64 * hash is the hash of the frozenset or -1 if not computed yet.
66 * hash is -1
92 PyAPI_FUNC(int) _PySet_NextEntry(PyObject *set, Py_ssize_t *pos, PyObject **key, long *hash);
    [all...]
  /prebuilts/python/linux-x86/2.7.5/include/python2.7/
setobject.h 17 Note: .pop() abuses the hash field of an Unused or Dummy slot to
18 hold a search finger. The hash field of Unused or Dummy slots has
25 long hash; /* cached hash code for the entry key */ member in struct:__anon60605
52 setentry *(*lookup)(PySetObject *so, PyObject *key, long hash);
55 long hash; /* only used by frozenset objects */ member in struct:_setobject
64 * hash is the hash of the frozenset or -1 if not computed yet.
66 * hash is -1
92 PyAPI_FUNC(int) _PySet_NextEntry(PyObject *set, Py_ssize_t *pos, PyObject **key, long *hash);
    [all...]
  /external/apache-harmony/security/src/test/impl/java/org/apache/harmony/security/tests/provider/crypto/
SHA1ImplTest.java 35 * The input data and results of computing are defined in Secure Hash Standard,
66 int[] words = new int[INDEX +6]; // working array to compute hash
68 // values defined in examples in Secure Hash Standard
70 int[] hash = {0xA9993E36, 0x4706816A, 0xBA3E2571, 0x7850C26C, 0x9CD0D89D }; local
75 words[0] = 0x61626380; // constants from Secure Hash Standard
91 hash[k] == hash1[k] );
93 assertTrue("false2: k=" + k + " j=" + Integer.toHexString(j), hash[k] == j );
106 // values defined in examples in Secure Hash Standard
107 int[] hash = {0x84983e44, 0x1c3bd26e, 0xbaae4aa1, 0xf95129e5, 0xe54670f1 }; local
109 // string defined in examples in Secure Hash Standar
131 int[] hash = {0x34aa973c, 0xd4c4daa4, 0xf61eeb2b, 0xdbad2731, 0x6534016f }; local
    [all...]
  /external/chromium_org/third_party/WebKit/Source/wtf/
BloomFilter.h 48 void add(unsigned hash);
49 void remove(unsigned hash);
53 bool mayContain(unsigned hash) const { return firstSlot(hash) && secondSlot(hash); }
60 void add(const String& string) { add(string.impl()->hash()); }
62 void remove(const String& string) { remove(string.impl()->hash()); }
65 bool mayContain(const String& string) const { return mayContain(string.impl()->hash()); }
74 uint8_t& firstSlot(unsigned hash) { return m_table[hash & keyMask];
    [all...]

Completed in 823 milliseconds

1 2 3 45 6 7 8 91011>>