OpenGrok
Home
Sort by relevance
Sort by last modified time
Full Search
Definition
Symbol
File Path
History
|
|
Help
Searched
defs:NumBuckets
(Results
1 - 9
of
9
) sorted by null
/external/llvm/include/llvm/DebugInfo/DWARF/
DWARFAcceleratorTable.h
26
uint32_t
NumBuckets
;
DWARFUnitIndex.h
36
uint32_t
NumBuckets
= 0;
/external/clang/lib/Lex/
HeaderMap.cpp
50
uint32_t
NumBuckets
; // Number of buckets (always a power of 2).
52
// An array of '
NumBuckets
' HMapBucket objects follows this header.
179
unsigned
NumBuckets
= getEndianAdjustedWord(Hdr.
NumBuckets
);
182
getFileName(),
NumBuckets
,
185
for (unsigned i = 0; i !=
NumBuckets
; ++i) {
212
unsigned
NumBuckets
= getEndianAdjustedWord(Hdr.
NumBuckets
);
216
if (
NumBuckets
& (
NumBuckets
-1)
[
all
...]
/external/llvm/include/llvm/ADT/
FoldingSet.h
117
///
NumBuckets
- Length of the Buckets array. Always a power of 2.
119
unsigned
NumBuckets
;
433
iterator end() { return iterator(Buckets+
NumBuckets
); }
437
const_iterator end() const { return const_iterator(Buckets+
NumBuckets
); }
442
return bucket_iterator(Buckets + (hash & (
NumBuckets
-1)));
446
return bucket_iterator(Buckets + (hash & (
NumBuckets
-1)), true);
511
iterator end() { return iterator(Buckets+
NumBuckets
); }
515
const_iterator end() const { return const_iterator(Buckets+
NumBuckets
); }
520
return bucket_iterator(Buckets + (hash & (
NumBuckets
-1)));
524
return bucket_iterator(Buckets + (hash & (
NumBuckets
-1)), true)
[
all
...]
StringMap.h
44
// Array of
NumBuckets
pointers to entries, null pointers are holes.
45
// TheTable[
NumBuckets
] contains a sentinel value for easy iteration. Followed
48
unsigned
NumBuckets
;
57
NumBuckets
(0), NumItems(0), NumTombstones(0), ItemSize(itemSize) {}
59
: TheTable(RHS.TheTable),
NumBuckets
(RHS.
NumBuckets
),
63
RHS.
NumBuckets
= 0;
99
unsigned getNumBuckets() const { return
NumBuckets
; }
107
std::swap(
NumBuckets
, Other.
NumBuckets
);
[
all
...]
DenseMap.h
439
unsigned
NumBuckets
= getNumBuckets();
440
if (LLVM_UNLIKELY(NewNumEntries * 4 >=
NumBuckets
* 3)) {
441
this->grow(
NumBuckets
* 2);
443
NumBuckets
= getNumBuckets();
444
} else if (LLVM_UNLIKELY(
NumBuckets
-(NewNumEntries+getNumTombstones()) <=
445
NumBuckets
/8)) {
446
this->grow(
NumBuckets
);
471
const unsigned
NumBuckets
= getNumBuckets();
473
if (
NumBuckets
== 0) {
486
unsigned BucketNo = getHashValue(Val) & (
NumBuckets
-1)
[
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
312
unsigned
NumBuckets
= HashTable.getNumBuckets();
314
unsigned NumEmptyBuckets =
NumBuckets
-NumIdentifiers;
331
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)
156
for (offset_type I = 0; I <
NumBuckets
; ++I) {
201
LE.write<offset_type>(
NumBuckets
);
203
for (offset_type I = 0; I <
NumBuckets
; ++I
[
all
...]
Completed in 322 milliseconds