| /external/clang/test/Modules/ |
| load_failure.c | 10 // RUN: %clang_cc1 -fmodules -x objective-c++ -fmodules-cache-path=%t -fdisable-module-hash -emit-module -fmodule-name=load_failure %S/Inputs/module.map
11 // RUN: not %clang_cc1 -fmodules -x objective-c -fmodules-cache-path=%t -fdisable-module-hash %s -DNONEXISTENT 2>&1 | FileCheck -check-prefix=CHECK-NONEXISTENT %s
14 // RUN: not %clang_cc1 -fmodules -x objective-c -fmodules-cache-path=%t -fdisable-module-hash %s -DFAILURE 2> %t.out
|
| /external/clang/test/SemaObjC/ |
| sign-conversion.m | 8 - (NSUInteger)hash;
35 (void)((NSObject*)array[si]).hash; // expected-warning {{implicit conversion changes signedness: 'int' to 'NSUInteger'}}
37 (void)[((NSObject*)array[si]) hash]; // expected-warning {{implicit conversion changes signedness: 'int' to 'NSUInteger'}}
|
| /external/dropbear/libtomcrypt/src/misc/crypt/ |
| crypt_find_hash.c | 15 Find a hash, Tom St Denis
19 Find a registered hash by name
20 @param name The name of the hash to look for
|
| crypt_find_hash_any.c | 15 Find a hash, Tom St Denis
19 Find a hash flexibly. First by name then if not present by digest size
20 @param name The name of the hash desired
|
| crypt_find_hash_id.c | 15 Find hash by ID, Tom St Denis
19 Find a hash by ID number
20 @param ID The ID (not same as index) of the hash to find
|
| /external/dropbear/libtomcrypt/src/pk/rsa/ |
| rsa_verify_hash.c | 24 @param hash The hash of the message that was signed
25 @param hashlen The length of the hash of the message that was signed (octets)
27 @param hash_idx The index of the desired hash
34 const unsigned char *hash, unsigned long hashlen,
43 LTC_ARGCHK(hash != NULL);
59 /* valid hash ? */
95 err = pkcs_1_pss_decode(hash, hashlen, tmpbuf, x, saltlen, hash_idx, modulus_bitlen, stat);
109 /* allocate temp buffer for decoded hash */
122 /* now we must decode out[0...outlen-1] using ASN.1, test the OID and then test the hash */
[all...] |
| /external/lzma/C/ |
| LzFind.c | 138 p->hash = 0;
153 alloc->Free(alloc, p->hash);
154 p->hash = 0;
231 if (p->hash != 0 && prevSize == newSize)
234 p->hash = AllocRefs(newSize, alloc);
235 if (p->hash != 0)
237 p->son = p->hash + p->hashSizeSum;
275 p->hash[i] = kEmptyHashValue;
307 MatchFinder_Normalize3(subValue, p->hash, p->hashSizeSum + p->numSons);
489 curMatch = p->hash[hashValue];
[all...] |
| /external/markdown/MarkdownTest/Tests_2007/ |
| Backslash escapes.text | 25 Hash: \#
61 Hash: \#
96 Hash: `\#`
|
| /external/mesa3d/src/mesa/program/ |
| hash_table.c | 26 * \brief Implementation of a generic, opaque hash table data type.
41 hash_func_t hash; member in struct:hash_table
57 hash_table_ctor(unsigned num_buckets, hash_func_t hash,
71 ht->hash = hash;
114 const unsigned hash_value = (*ht->hash)(key);
140 const unsigned hash_value = (*ht->hash)(key);
155 const unsigned hash_value = (*ht->hash)(key);
212 unsigned hash = 5381; local
216 hash = (hash * 33) + *str
[all...] |
| /external/stlport/stlport/stl/ |
| _string_hash.h | 46 struct hash<basic_string<_CharT,_Traits,_Alloc> > { struct
54 struct _STLP_CLASS_DECLSPEC hash<string> { struct
61 struct _STLP_CLASS_DECLSPEC hash<wstring> { struct
|
| /ndk/sources/cxx-stl/llvm-libc++/libcxx/test/utilities/memory/util.smartptr/util.smartptr.hash/ |
| hash_shared_ptr.pass.cpp | 13 // struct hash<shared_ptr<T>>
27 std::hash<std::shared_ptr<int> > f;
29 assert(h == std::hash<int*>()(ptr));
|
| hash_unique_ptr.pass.cpp | 13 // struct hash<unique_ptr<T, D>>
27 std::hash<std::unique_ptr<int> > f;
29 assert(h == std::hash<int*>()(ptr));
|
| /ndk/sources/cxx-stl/stlport/stlport/stl/ |
| _string_hash.h | 46 struct hash<basic_string<_CharT,_Traits,_Alloc> > { struct
54 struct _STLP_CLASS_DECLSPEC hash<string> { struct
61 struct _STLP_CLASS_DECLSPEC hash<wstring> { struct
|
| /prebuilts/ndk/5/sources/cxx-stl/stlport/stlport/stl/ |
| _string_hash.h | 46 struct hash<basic_string<_CharT,_Traits,_Alloc> > { struct
54 struct _STLP_CLASS_DECLSPEC hash<string> { struct
61 struct _STLP_CLASS_DECLSPEC hash<wstring> { struct
|
| /prebuilts/ndk/6/sources/cxx-stl/stlport/stlport/stl/ |
| _string_hash.h | 46 struct hash<basic_string<_CharT,_Traits,_Alloc> > { struct
54 struct _STLP_CLASS_DECLSPEC hash<string> { struct
61 struct _STLP_CLASS_DECLSPEC hash<wstring> { struct
|
| /prebuilts/ndk/7/sources/cxx-stl/stlport/stlport/stl/ |
| _string_hash.h | 46 struct hash<basic_string<_CharT,_Traits,_Alloc> > { struct
54 struct _STLP_CLASS_DECLSPEC hash<string> { struct
61 struct _STLP_CLASS_DECLSPEC hash<wstring> { struct
|
| /prebuilts/ndk/8/sources/cxx-stl/stlport/stlport/stl/ |
| _string_hash.h | 46 struct hash<basic_string<_CharT,_Traits,_Alloc> > { struct
54 struct _STLP_CLASS_DECLSPEC hash<string> { struct
61 struct _STLP_CLASS_DECLSPEC hash<wstring> { struct
|
| /prebuilts/ndk/9/sources/cxx-stl/EH/stlport/stlport/stl/ |
| _string_hash.h | 46 struct hash<basic_string<_CharT,_Traits,_Alloc> > { struct
54 struct _STLP_CLASS_DECLSPEC hash<string> { struct
61 struct _STLP_CLASS_DECLSPEC hash<wstring> { struct
|
| /external/libxml2/ |
| dict.c | 31 * it seems that having hash randomization might be a good idea
36 * well but since the attack is based on growing a very big hash
37 * list we will use the BigKey algo as soon as the hash size grows
299 * Calculate a hash key using a good hash function that works well for
300 * larger hash table sizes.
302 * Hash function by "One-at-a-Time Hash" see
303 * http://burtleburtle.net/bob/hash/doobs.html
308 uint32_t hash; local
342 uint32_t hash; local
[all...] |
| /external/guava/guava/src/com/google/common/collect/ |
| MapMakerInternalMap.java | 63 * The concurrent hash map implementation built by {@link MapMaker}.
77 * concurrently readable hash table. The map supports non-blocking reads and concurrent writes
139 * Mask value for indexing into segments. The upper bits of a key's hash code are used to choose
150 /** The segments, each of which is a specialized hash table. */
342 * Returns the default equivalence strategy used to compare and hash keys or values referenced
356 Segment<K, V> segment, K key, int hash, @Nullable ReferenceEntry<K, V> next) {
357 return new StrongEntry<K, V>(key, hash, next);
363 Segment<K, V> segment, K key, int hash, @Nullable ReferenceEntry<K, V> next) {
364 return new StrongExpirableEntry<K, V>(key, hash, next);
378 Segment<K, V> segment, K key, int hash, @Nullable ReferenceEntry<K, V> next)
1036 final int hash; field in class:MapMakerInternalMap.StrongEntry
1290 final int hash; field in class:MapMakerInternalMap.SoftEntry
1548 final int hash; field in class:MapMakerInternalMap.WeakEntry
1886 int hash = original.getHash(); local
1896 int hash = entry.getHash(); local
1900 int hash(Object key) { method in class:MapMakerInternalMap
1907 int hash = entry.getHash(); local
1908 segmentFor(hash).reclaimValue(entry.getKey(), hash, valueReference); local
1912 int hash = entry.getHash(); local
2937 e.getKey(), hash, e.getValueReference().get(), RemovalCause.COLLECTED); local
3032 enqueueNotification(e.getKey(), hash, e.getValueReference().get(), cause); local
[all...] |
| /external/chromium_org/third_party/mesa/src/src/glsl/glcpp/ |
| glcpp-lex.l | 76 HASH ^{HSPACE}*#{HSPACE}*
123 {HASH}version {
131 {HASH}(extension|pragma)[^\n]+ {
138 {HASH}line {
143 {HASH}ifdef {
149 {HASH}ifndef {
155 {HASH}if/[^_a-zA-Z0-9] {
161 {HASH}elif {
167 {HASH}else {
172 {HASH}endif
[all...] |
| /external/mesa3d/src/glsl/glcpp/ |
| glcpp-lex.l | 76 HASH ^{HSPACE}*#{HSPACE}*
123 {HASH}version {
131 {HASH}(extension|pragma)[^\n]+ {
138 {HASH}line {
143 {HASH}ifdef {
149 {HASH}ifndef {
155 {HASH}if/[^_a-zA-Z0-9] {
161 {HASH}elif {
167 {HASH}else {
172 {HASH}endif
[all...] |
| /prebuilts/gcc/linux-x86/host/i686-linux-glibc2.7-4.4.3/i686-linux/include/c++/4.4.3/ext/pb_ds/detail/hash_fn/ |
| ranged_probe_fn.hpp | 67 * function, and requests that hash values not be stored.
155 operator()(const_key_reference, size_type hash, size_type i) const
157 return comb_probe_fn_base::operator()(hash + probe_fn_base::operator()(i));
172 * probe function, and requests that hash values not be stored.
261 const size_type hash = hash_fn_base::operator()(r_key); local
262 return std::make_pair(comb_probe_fn_base::operator()(hash), hash);
268 operator()(const_key_reference, size_type hash, size_type i) const
270 return comb_probe_fn_base::operator()(hash + probe_fn_base::operator()(i));
278 (const_key_reference r_key, size_type hash) cons
[all...] |
| /prebuilts/gcc/linux-x86/host/i686-linux-glibc2.7-4.6/i686-linux/include/c++/4.6.x-google/ext/pb_ds/detail/hash_fn/ |
| ranged_probe_fn.hpp | 67 * function, and requests that hash values not be stored.
155 operator()(const_key_reference, size_type hash, size_type i) const
157 return comb_probe_fn_base::operator()(hash + probe_fn_base::operator()(i));
172 * probe function, and requests that hash values not be stored.
261 const size_type hash = hash_fn_base::operator()(r_key); local
262 return std::make_pair(comb_probe_fn_base::operator()(hash), hash);
268 operator()(const_key_reference, size_type hash, size_type i) const
270 return comb_probe_fn_base::operator()(hash + probe_fn_base::operator()(i));
278 (const_key_reference r_key, size_type hash) cons
[all...] |
| /prebuilts/gcc/linux-x86/host/x86_64-linux-glibc2.7-4.6/x86_64-linux/include/c++/4.6.x-google/ext/pb_ds/detail/hash_fn/ |
| ranged_probe_fn.hpp | 67 * function, and requests that hash values not be stored.
155 operator()(const_key_reference, size_type hash, size_type i) const
157 return comb_probe_fn_base::operator()(hash + probe_fn_base::operator()(i));
172 * probe function, and requests that hash values not be stored.
261 const size_type hash = hash_fn_base::operator()(r_key); local
262 return std::make_pair(comb_probe_fn_base::operator()(hash), hash);
268 operator()(const_key_reference, size_type hash, size_type i) const
270 return comb_probe_fn_base::operator()(hash + probe_fn_base::operator()(i));
278 (const_key_reference r_key, size_type hash) cons
[all...] |
