HomeSort by relevance Sort by last modified time
    Searched defs:hash (Results 351 - 375 of 2236) sorted by null

<<11121314151617181920>>

  /prebuilts/clang/host/linux-x86/clang-4393122/include/llvm/ADT/
CachedHashString.h 11 // and not-owning string types that store their hash in addition to their string
29 /// A container which contains a StringRef plus a precomputed hash.
33 uint32_t Hash;
40 CachedHashStringRef(StringRef S, uint32_t Hash)
41 : P(S.data()), Size(S.size()), Hash(Hash) {
47 uint32_t hash() const { return Hash; } function in class:llvm::CachedHashStringRef
58 assert(!isEqual(S, getEmptyKey()) && "Cannot hash the empty key!");
59 assert(!isEqual(S, getTombstoneKey()) && "Cannot hash the tombstone key!")
138 uint32_t hash() const { return Hash; } function in class:llvm::CachedHashString
    [all...]
  /prebuilts/clang/host/linux-x86/clang-4393122/include/llvm/DebugInfo/CodeView/
CVRecord.h 45 Optional<uint32_t> hash() const { return Hash; } function in class:llvm::codeview::CVRecord
47 void setHash(uint32_t Value) { Hash = Value; }
51 Optional<uint32_t> Hash;
  /prebuilts/clang/host/linux-x86/clang-4479392/include/llvm/ADT/
CachedHashString.h 11 // and not-owning string types that store their hash in addition to their string
29 /// A container which contains a StringRef plus a precomputed hash.
33 uint32_t Hash;
40 CachedHashStringRef(StringRef S, uint32_t Hash)
41 : P(S.data()), Size(S.size()), Hash(Hash) {
47 uint32_t hash() const { return Hash; } function in class:llvm::CachedHashStringRef
58 assert(!isEqual(S, getEmptyKey()) && "Cannot hash the empty key!");
59 assert(!isEqual(S, getTombstoneKey()) && "Cannot hash the tombstone key!")
138 uint32_t hash() const { return Hash; } function in class:llvm::CachedHashString
    [all...]
  /prebuilts/clang/host/linux-x86/clang-4479392/include/llvm/DebugInfo/CodeView/
CVRecord.h 45 Optional<uint32_t> hash() const { return Hash; } function in class:llvm::codeview::CVRecord
47 void setHash(uint32_t Value) { Hash = Value; }
51 Optional<uint32_t> Hash;
  /prebuilts/clang/host/linux-x86/clang-4579689/include/llvm/ADT/
CachedHashString.h 11 // and not-owning string types that store their hash in addition to their string
29 /// A container which contains a StringRef plus a precomputed hash.
33 uint32_t Hash;
40 CachedHashStringRef(StringRef S, uint32_t Hash)
41 : P(S.data()), Size(S.size()), Hash(Hash) {
47 uint32_t hash() const { return Hash; } function in class:llvm::CachedHashStringRef
58 assert(!isEqual(S, getEmptyKey()) && "Cannot hash the empty key!");
59 assert(!isEqual(S, getTombstoneKey()) && "Cannot hash the tombstone key!")
138 uint32_t hash() const { return Hash; } function in class:llvm::CachedHashString
    [all...]
  /prebuilts/clang/host/linux-x86/clang-4579689/include/llvm/DebugInfo/CodeView/
CVRecord.h 48 Optional<uint32_t> hash() const { return Hash; } function in class:llvm::codeview::CVRecord
50 void setHash(uint32_t Value) { Hash = Value; }
54 Optional<uint32_t> Hash;
  /prebuilts/clang/host/linux-x86/clang-4630689/include/llvm/ADT/
CachedHashString.h 11 // and not-owning string types that store their hash in addition to their string
29 /// A container which contains a StringRef plus a precomputed hash.
33 uint32_t Hash;
40 CachedHashStringRef(StringRef S, uint32_t Hash)
41 : P(S.data()), Size(S.size()), Hash(Hash) {
47 uint32_t hash() const { return Hash; } function in class:llvm::CachedHashStringRef
58 assert(!isEqual(S, getEmptyKey()) && "Cannot hash the empty key!");
59 assert(!isEqual(S, getTombstoneKey()) && "Cannot hash the tombstone key!")
138 uint32_t hash() const { return Hash; } function in class:llvm::CachedHashString
    [all...]
  /prebuilts/clang/host/linux-x86/clang-4630689/include/llvm/DebugInfo/CodeView/
CVRecord.h 48 Optional<uint32_t> hash() const { return Hash; } function in class:llvm::codeview::CVRecord
50 void setHash(uint32_t Value) { Hash = Value; }
54 Optional<uint32_t> Hash;
  /prebuilts/clang/host/linux-x86/clang-4639204/include/llvm/ADT/
CachedHashString.h 11 // and not-owning string types that store their hash in addition to their string
29 /// A container which contains a StringRef plus a precomputed hash.
33 uint32_t Hash;
40 CachedHashStringRef(StringRef S, uint32_t Hash)
41 : P(S.data()), Size(S.size()), Hash(Hash) {
47 uint32_t hash() const { return Hash; } function in class:llvm::CachedHashStringRef
58 assert(!isEqual(S, getEmptyKey()) && "Cannot hash the empty key!");
59 assert(!isEqual(S, getTombstoneKey()) && "Cannot hash the tombstone key!")
138 uint32_t hash() const { return Hash; } function in class:llvm::CachedHashString
    [all...]
  /prebuilts/clang/host/linux-x86/clang-4639204/include/llvm/DebugInfo/CodeView/
CVRecord.h 48 Optional<uint32_t> hash() const { return Hash; } function in class:llvm::codeview::CVRecord
50 void setHash(uint32_t Value) { Hash = Value; }
54 Optional<uint32_t> Hash;
  /prebuilts/clang/host/linux-x86/clang-4691093/include/llvm/ADT/
CachedHashString.h 11 // and not-owning string types that store their hash in addition to their string
29 /// A container which contains a StringRef plus a precomputed hash.
33 uint32_t Hash;
40 CachedHashStringRef(StringRef S, uint32_t Hash)
41 : P(S.data()), Size(S.size()), Hash(Hash) {
47 uint32_t hash() const { return Hash; } function in class:llvm::CachedHashStringRef
58 assert(!isEqual(S, getEmptyKey()) && "Cannot hash the empty key!");
59 assert(!isEqual(S, getTombstoneKey()) && "Cannot hash the tombstone key!")
138 uint32_t hash() const { return Hash; } function in class:llvm::CachedHashString
    [all...]
  /prebuilts/clang/host/linux-x86/clang-4691093/include/llvm/DebugInfo/CodeView/
CVRecord.h 48 Optional<uint32_t> hash() const { return Hash; } function in class:llvm::codeview::CVRecord
50 void setHash(uint32_t Value) { Hash = Value; }
54 Optional<uint32_t> Hash;
  /prebuilts/gcc/linux-x86/host/x86_64-linux-glibc2.15-4.8/x86_64-linux/include/c++/4.8/bits/
shared_ptr.h 617 /// std::hash specialization for shared_ptr.
619 struct hash<shared_ptr<_Tp>> struct in inherits:__hash_base
624 { return std::hash<_Tp*>()(__s.get()); }
  /prebuilts/gcc/linux-x86/host/x86_64-w64-mingw32-4.8/x86_64-w64-mingw32/include/c++/4.8.3/bits/
shared_ptr.h 617 /// std::hash specialization for shared_ptr.
619 struct hash<shared_ptr<_Tp>> struct in inherits:__hash_base
624 { return std::hash<_Tp*>()(__s.get()); }
  /prebuilts/gdb/darwin-x86/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:__anon66500
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/gdb/linux-x86/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:__anon66622
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/go/darwin-x86/src/cmd/asm/internal/lex/
input.go 111 in.beginningOfLine = in.hash()
142 // hash processes a # preprocessor directive. It returns true iff it completes.
143 func (in *Input) hash() bool { func
  /prebuilts/go/linux-x86/src/cmd/asm/internal/lex/
input.go 111 in.beginningOfLine = in.hash()
142 // hash processes a # preprocessor directive. It returns true iff it completes.
143 func (in *Input) hash() bool { func
  /prebuilts/ndk/r16/sources/third_party/shaderc/third_party/glslang/hlsl/
hlslScanContext.cpp 70 unsigned long hash = 5381; local
74 hash = ((hash << 5) + hash) + c;
76 return hash;
    [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:__anon1015
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:__anon1138
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/tools/darwin-x86_64/protoc/include/google/protobuf/stubs/
hash.h 136 // google/protobuf/stubs/hash.h
181 // Make hash<T> be the same as less<T>. Note that everywhere where custom
182 // hash functions are defined in the protobuf code, they are also defined such
185 struct hash { struct in namespace:google::protobuf
186 // Dummy, just to make derivative hash functions compile.
199 struct hash<const char*> { struct in namespace:google::protobuf
200 // Dummy, just to make derivative hash functions compile.
212 typename HashFcn = hash<Key>,
227 typename HashFcn = hash<Key>,
239 struct hash : public GOOGLE_PROTOBUF_HASH_COMPARE<Key>
396 struct hash<string> { struct in namespace:google::protobuf
409 struct hash<pair<First, Second> > { struct in namespace:google::protobuf
    [all...]
  /system/extras/ioshark/
compile_ioshark_subr.c 68 u_int32_t hash; local
71 hash = jenkins_one_at_a_time_hash(pathname, strlen(pathname));
72 hash %= FILE_DB_HASHSIZE;
73 db_node = files_db_buckets[hash];
84 u_int32_t hash; local
89 hash = jenkins_one_at_a_time_hash(filename, strlen(filename));
90 hash %= FILE_DB_HASHSIZE;
96 db_node->next = files_db_buckets[hash];
98 files_db_buckets[hash] = db_node;
  /system/keymaster/km_openssl/
soft_keymaster_enforcement.cpp 69 uint8_t hash[EVP_MAX_MD_SIZE]; local
73 EVP_DigestFinal_ex(ctx.get(), hash, &hash_len)) {
75 memcpy(keyid, hash, sizeof(*keyid));
  /system/libufdt/
ufdt_prop_dict.c 25 /* Empirical values for hash functions. */
45 int hash = _ufdt_prop_dict_str_hash(name); local
47 int idx = hash & (size - 1);
48 /* If collision, use linear probing to find idx in the hash table */

Completed in 1597 milliseconds

<<11121314151617181920>>