| /external/chromium_org/crypto/third_party/nss/ |
| rsawrapr.c | 26 const SECHashObject *hash; local
30 hash = HASH_GetHashObject(hashAlg);
31 if (hash == NULL)
34 hashContext = (*hash->create)();
35 rounds = (maskLen + hash->length - 1) / hash->length;
44 (*hash->begin)(hashContext);
45 (*hash->update)(hashContext, mgfSeed, mgfSeedLen);
46 (*hash->update)(hashContext, C, sizeof C);
48 tempHash = mask + counter * hash->length
78 const SECHashObject *hash; local
[all...] |
| /external/chromium_org/ui/android/java/src/org/chromium/ui/picker/ |
| DateTimeSuggestion.java | 53 int hash = 31; local
54 hash = 37 * hash + (int) mValue;
55 hash = 37 * hash + mLocalizedValue.hashCode();
56 hash = 37 * hash + mLabel.hashCode();
57 return hash;
|
| /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...] |
| /build/tools/droiddoc/templates-pdk/assets/ |
| jquery-history.js | 15 return msie.getDoc().location.hash;
17 setHash: function(hash) {
21 d.location.hash = hash;
26 var hash = msie.iframe ? msie.getHash() : location.hash;
27 if (hash != currentHash) {
28 currentHash = hash;
30 location.hash = currentHash;
39 add: function(hash) {
[all...] |
| /external/doclava/res/assets/templates/assets/ |
| jquery-history.js | 15 return msie.getDoc().location.hash;
17 setHash: function(hash) {
21 d.location.hash = hash;
26 var hash = msie.iframe ? msie.getHash() : location.hash;
27 if (hash != currentHash) {
28 currentHash = hash;
30 location.hash = currentHash;
39 add: function(hash) {
[all...] |
| /external/chromium_org/chrome/browser/metrics/variations/ |
| generated_resources_map_lookup.cc | 11 int GetResourceIndex(uint32_t hash) {
13 const uint32_t* element = std::lower_bound(kResourceHashes, kEnd, hash);
15 if (element == kEnd || *element != hash)
|
| generated_resources_map.h | 17 // kResourceHashes[i] = HASH("IDS_FOO") and kResourceIndices[i] = 12345. Both
33 // Gets the resource index corresponding to the given hash.
34 int GetResourceIndex(uint32_t hash);
|
| /external/chromium_org/components/policy/core/common/cloud/ |
| cloud_external_data_manager.cc | 16 const std::string& hash)
18 hash(hash) {
23 return url != other.url || hash != other.hash;
|
| /external/deqp/framework/delibs/depool/ |
| dePoolHash.h | 23 * \brief Memory pool hash class.
45 * \brief Declare a template pool hash class interface.
46 * \param TYPENAME Type name of the declared hash.
50 * This macro declares the interface for a hash. For the implementation of
51 * the hash, see DE_IMPLEMENT_POOL_HASH. Usually this macro is put into the
56 * The functions for operating the hash are:
60 * Hash* Hash_create (deMemPool* pool);
61 * int Hash_getNumElements (const Hash* hash);
62 * Value* Hash_find (Hash* hash, Key key)
[all...] |
| /external/oprofile/libutil/ |
| op_string.c | 24 size_t hash = 0; local
26 hash ^= (hash << 16) ^ (hash >> 8) ^ *str;
27 return hash;
|
| /external/linux-tools-perf/perf-3.12.0/include/linux/ |
| hash.h | 37 u64 hash = val; local
40 u64 n = hash;
42 hash -= n;
44 hash -= n;
46 hash += n;
48 hash -= n;
50 hash += n;
52 hash += n;
55 return hash >> (64 - bits);
61 u32 hash = val * GOLDEN_RATIO_PRIME_32 local
[all...] |
| /external/apache-xml/src/main/java/org/apache/xml/dtm/ref/ |
| ExtendedType.java | 32 private int hash; field in class:ExtendedType
36 * The hash code is calculated from the node type, namespace and local name.
47 this.hash = nodetype + namespace.hashCode() + localName.hashCode();
52 * and a given hash code.
57 * @param hash The given hash code
59 public ExtendedType (int nodetype, String namespace, String localName, int hash)
64 this.hash = hash;
77 this.hash = nodetype + namespace.hashCode() + localName.hashCode()
[all...] |
| /external/chromium_org/third_party/icu/source/common/ |
| uhash.c | 20 /* This hashtable is implemented as a double hash. All elements are
22 * resolution (no linked list, etc.). When there is a hash collision
24 * using a secondary hash. The secondary hash is an increment
25 * computed as a hash function (a different one) of the primary
26 * hashcode. This increment is added to the initial hash value to
27 * obtain further slots assigned to the same hash code. For this to
120 #define HASH_DELETE_KEY_VALUE(hash, keypointer, valuepointer) \
121 if (hash->keyDeleter != NULL && keypointer != NULL) { \
122 (*hash->keyDeleter)(keypointer);
[all...] |
| 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...] |
| /external/fio/ |
| filelock.c | 3 * No hash indexing, just a list, so only works well for < 100 files or
14 #include "hash.h"
18 uint32_t hash; member in struct:fio_filelock
55 static struct fio_filelock *fio_hash_find(uint32_t hash)
62 if (ff->hash == hash)
69 static struct fio_filelock *fio_hash_get(uint32_t hash)
73 ff = fio_hash_find(hash);
76 ff->hash = hash;
88 uint32_t hash; local
124 uint32_t hash; local
139 uint32_t hash; local
[all...] |
| /external/icu/icu4c/source/common/ |
| uhash.c | 20 /* This hashtable is implemented as a double hash. All elements are
22 * resolution (no linked list, etc.). When there is a hash collision
24 * using a secondary hash. The secondary hash is an increment
25 * computed as a hash function (a different one) of the primary
26 * hashcode. This increment is added to the initial hash value to
27 * obtain further slots assigned to the same hash code. For this to
120 #define HASH_DELETE_KEY_VALUE(hash, keypointer, valuepointer) \
121 if (hash->keyDeleter != NULL && keypointer != NULL) { \
122 (*hash->keyDeleter)(keypointer);
[all...] |
| 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...] |
| /external/jsilver/src/com/google/clearsilver/jsilver/precompiler/ |
| PrecompiledTemplateMapKey.java | 56 int hash = 17; local
58 hash = 31 * hash + templateName.hashCode();
59 hash = 31 * hash + escapeMode.hashCode();
60 return hash;
|
| /art/runtime/ |
| utf.cc | 73 int32_t hash = 0; local
75 hash = hash * 31 + chars->Get(offset + i);
77 return hash;
81 int32_t hash = 0; local
83 hash = hash * 31 + *chars++;
85 return hash;
89 size_t hash = 0; local
91 hash = hash * 31 + *chars++
[all...] |
| /external/chromium_org/chrome/installer/mac/third_party/bsdiff/ |
| sha1_adapter.h | 19 void SHA1(const unsigned char* data, size_t len, unsigned char* hash);
|
| /external/chromium_org/third_party/WebKit/Source/core/dom/custom/ |
| CustomElementDescriptorHash.h | 42 static unsigned hash(const CustomElementDescriptor& descriptor) function in struct:blink::CustomElementDescriptorHash
44 return WTF::pairIntHash(AtomicStringHash::hash(descriptor.type()), WTF::pairIntHash(AtomicStringHash::hash(descriptor.namespaceURI()), AtomicStringHash::hash(descriptor.localName())));
|
| /external/chromium_org/third_party/WebKit/Source/platform/ |
| LinkHash.h | 41 static unsigned hash(LinkHash key) { return static_cast<unsigned>(key); } function in struct:blink::LinkHashHash
49 unsigned hash = static_cast<unsigned>(hash64); local
50 unsigned newHash = hash | (!(hash + 1) << 31);
58 // base URL, and returns the hash of the string that will be used for visited
|
| /external/chromium_org/third_party/libvpx/source/libvpx/third_party/libyuv/source/ |
| compare_common.cc | 28 // hash seed of 5381 recommended.
31 uint32 hash = seed; local
34 hash += (hash << 5) + src[i];
36 return hash;
|
| /external/chromium_org/third_party/libyuv/source/ |
| compare_common.cc | 28 // hash seed of 5381 recommended.
31 uint32 hash = seed; local
34 hash += (hash << 5) + src[i];
36 return hash;
|
| /external/libcxx/test/extensions/hash/ |
| specializations.fail.cpp | 16 assert(__gnu_cxx::hash<std::string>()(std::string()) == 0); // error
|
