OpenGrok
Home
Sort by relevance
Sort by last modified time
Full Search
Definition
Symbol
File Path
History
|
|
Help
Searched
defs:NumBuckets
(Results
1 - 16
of
16
) sorted by null
/external/llvm/lib/DebugInfo/PDB/Raw/
PublicsStream.cpp
71
ulittle32_t
NumBuckets
;
123
NumBuckets
+= countPopulation(B);
131
if (auto EC = Reader.readArray(HashBuckets,
NumBuckets
))
/external/clang/include/clang/Lex/
HeaderMapTypes.h
35
uint32_t
NumBuckets
; // Number of buckets (always a power of 2).
37
// An array of '
NumBuckets
' HMapBucket objects follows this header.
/external/llvm/include/llvm/DebugInfo/DWARF/
DWARFAcceleratorTable.h
26
uint32_t
NumBuckets
;
DWARFUnitIndex.h
37
uint32_t
NumBuckets
= 0;
87
return makeArrayRef(Rows.get(), Header.
NumBuckets
);
/external/llvm/include/llvm/DebugInfo/PDB/Raw/
PublicsStream.h
38
uint32_t getNumBuckets() const { return
NumBuckets
; }
60
uint32_t
NumBuckets
= 0;
/external/clang/lib/Lex/
HeaderMap.cpp
90
uint32_t
NumBuckets
= NeedsByteSwap
91
? llvm::sys::getSwappedBytes(Header->
NumBuckets
)
92
: Header->
NumBuckets
;
93
if (!llvm::isPowerOf2_32(
NumBuckets
))
96
sizeof(HMapHeader) + sizeof(HMapBucket) *
NumBuckets
)
174
unsigned
NumBuckets
= getEndianAdjustedWord(Hdr.
NumBuckets
);
176
llvm::dbgs() << "Header Map " << getFileName() << ":\n " <<
NumBuckets
185
for (unsigned i = 0; i !=
NumBuckets
; ++i) {
213
unsigned
NumBuckets
= getEndianAdjustedWord(Hdr.NumBuckets)
[
all
...]
/external/llvm/unittests/ADT/
StringMapTest.cpp
421
auto
NumBuckets
= Map.getNumBuckets();
433
EXPECT_EQ(Map.getNumBuckets(),
NumBuckets
);
/external/llvm/include/llvm/ADT/
FoldingSet.h
116
///
NumBuckets
- Length of the Buckets array. Always a power of 2.
118
unsigned
NumBuckets
;
191
// so that means our capacity is
NumBuckets
* 2
192
return
NumBuckets
* 2;
447
iterator end() { return iterator(Buckets+
NumBuckets
); }
451
const_iterator end() const { return const_iterator(Buckets+
NumBuckets
); }
456
return bucket_iterator(Buckets + (hash & (
NumBuckets
-1)));
460
return bucket_iterator(Buckets + (hash & (
NumBuckets
-1)), true);
525
iterator end() { return iterator(Buckets+
NumBuckets
); }
529
const_iterator end() const { return const_iterator(Buckets+
NumBuckets
); }
[
all
...]
StringMap.h
45
// Array of
NumBuckets
pointers to entries, null pointers are holes.
46
// TheTable[
NumBuckets
] contains a sentinel value for easy iteration. Followed
49
unsigned
NumBuckets
;
58
NumBuckets
(0), NumItems(0), NumTombstones(0), ItemSize(itemSize) {}
60
: TheTable(RHS.TheTable),
NumBuckets
(RHS.
NumBuckets
),
64
RHS.
NumBuckets
= 0;
103
unsigned getNumBuckets() const { return
NumBuckets
; }
111
std::swap(
NumBuckets
, Other.
NumBuckets
);
[
all
...]
DenseMap.h
87
auto
NumBuckets
= getMinBucketToReserveForEntries(NumEntries);
89
if (
NumBuckets
> getNumBuckets())
90
grow(
NumBuckets
);
313
// Ensure that "NumEntries * 4 <
NumBuckets
* 3"
484
unsigned
NumBuckets
= getNumBuckets();
485
if (LLVM_UNLIKELY(NewNumEntries * 4 >=
NumBuckets
* 3)) {
486
this->grow(
NumBuckets
* 2);
488
NumBuckets
= getNumBuckets();
489
} else if (LLVM_UNLIKELY(
NumBuckets
-(NewNumEntries+getNumTombstones()) <=
490
NumBuckets
/8))
[
all
...]
/external/swiftshader/third_party/LLVM/include/llvm/ADT/
DenseMap.h
41
unsigned
NumBuckets
;
52
NumBuckets
= 0;
68
for (BucketT *P = Buckets, *E = Buckets+
NumBuckets
; P != E; ++P) {
75
if (
NumBuckets
)
76
memset((void*)Buckets, 0x5a, sizeof(BucketT)*
NumBuckets
);
86
return empty() ? end() : iterator(Buckets, Buckets+
NumBuckets
);
89
return iterator(Buckets+
NumBuckets
, Buckets+
NumBuckets
);
92
return empty() ? end() : const_iterator(Buckets, Buckets+
NumBuckets
);
95
return const_iterator(Buckets+
NumBuckets
, Buckets+NumBuckets)
[
all
...]
FoldingSet.h
117
///
NumBuckets
- Length of the Buckets array. Always a power of 2.
119
unsigned
NumBuckets
;
410
iterator end() { return iterator(Buckets+
NumBuckets
); }
414
const_iterator end() const { return const_iterator(Buckets+
NumBuckets
); }
419
return bucket_iterator(Buckets + (hash & (
NumBuckets
-1)));
423
return bucket_iterator(Buckets + (hash & (
NumBuckets
-1)), true);
489
iterator end() { return iterator(Buckets+
NumBuckets
); }
493
const_iterator end() const { return const_iterator(Buckets+
NumBuckets
); }
498
return bucket_iterator(Buckets + (hash & (
NumBuckets
-1)));
502
return bucket_iterator(Buckets + (hash & (
NumBuckets
-1)), true)
[
all
...]
StringMap.h
68
unsigned
NumBuckets
;
76
NumBuckets
= 0;
109
unsigned getNumBuckets() const { return
NumBuckets
; }
277
return iterator(TheTable,
NumBuckets
== 0);
280
return iterator(TheTable+
NumBuckets
, true);
283
return const_iterator(TheTable,
NumBuckets
== 0);
286
return const_iterator(TheTable+
NumBuckets
, true);
331
assert(NumItems + NumTombstones <=
NumBuckets
);
343
for (ItemBucket *I = TheTable, *E = TheTable+
NumBuckets
; I != E; ++I) {
370
assert(NumItems + NumTombstones <=
NumBuckets
);
[
all
...]
/art/runtime/base/
hash_set.h
107
const size_t num_buckets = hash_set->
NumBuckets
();
181
AllocateStorage(other.
NumBuckets
());
291
return iterator(this,
NumBuckets
());
296
return const_iterator(this,
NumBuckets
());
338
unwrapped_next_index +=
NumBuckets
();
343
unwrapped_next_ideal_index +=
NumBuckets
();
438
if (num_buckets >
NumBuckets
()) {
447
for (size_t i = 0; i <
NumBuckets
(); ++i) {
452
total += i +
NumBuckets
() - ideal_location;
463
return static_cast<double>(Size()) / static_cast<double>(
NumBuckets
());
[
all
...]
/external/clang/lib/Basic/
IdentifierTable.cpp
313
unsigned
NumBuckets
= HashTable.getNumBuckets();
315
unsigned NumEmptyBuckets =
NumBuckets
-NumIdentifiers;
332
NumIdentifiers/(double)
NumBuckets
);
/external/llvm/include/llvm/Support/
OnDiskHashTable.h
75
offset_type
NumBuckets
;
101
for (size_t I = 0; I <
NumBuckets
; ++I)
110
NumBuckets
= NewSize;
128
if (4 * NumEntries >= 3 *
NumBuckets
)
129
resize(
NumBuckets
* 2);
130
insert(Buckets,
NumBuckets
, new (BA.Allocate()) Item(Key, Data, InfoObj));
136
for (Item *I = Buckets[Hash & (
NumBuckets
- 1)].Head; I; I = I->Next)
168
if (TargetNumBuckets !=
NumBuckets
)
172
for (offset_type I = 0; I <
NumBuckets
; ++I) {
217
LE.write<offset_type>(
NumBuckets
);
[
all
...]
Completed in 164 milliseconds