OpenGrok
Home
Sort by relevance
Sort by last modified time
Full Search
Definition
Symbol
File Path
History
|
|
Help
Searched
defs:NumBuckets
(Results
1 - 6
of
6
) sorted by null
/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.
183
unsigned
NumBuckets
= getEndianAdjustedWord(Hdr.
NumBuckets
);
186
getFileName(),
NumBuckets
,
189
for (unsigned i = 0; i !=
NumBuckets
; ++i) {
205
unsigned
NumBuckets
= getEndianAdjustedWord(Hdr.
NumBuckets
);
209
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
;
418
iterator end() { return iterator(Buckets+
NumBuckets
); }
422
const_iterator end() const { return const_iterator(Buckets+
NumBuckets
); }
427
return bucket_iterator(Buckets + (hash & (
NumBuckets
-1)));
431
return bucket_iterator(Buckets + (hash & (
NumBuckets
-1)), true);
498
iterator end() { return iterator(Buckets+
NumBuckets
); }
502
const_iterator end() const { return const_iterator(Buckets+
NumBuckets
); }
507
return bucket_iterator(Buckets + (hash & (
NumBuckets
-1)));
511
return bucket_iterator(Buckets + (hash & (
NumBuckets
-1)), true)
[
all
...]
StringMap.h
55
// Array of
NumBuckets
pointers to entries, null pointers are holes.
56
// TheTable[
NumBuckets
] contains a sentinel value for easy iteration. Follwed
59
unsigned
NumBuckets
;
67
NumBuckets
= 0;
100
unsigned getNumBuckets() const { return
NumBuckets
; }
269
return iterator(TheTable,
NumBuckets
== 0);
272
return iterator(TheTable+
NumBuckets
, true);
275
return const_iterator(TheTable,
NumBuckets
== 0);
278
return const_iterator(TheTable+
NumBuckets
, true);
323
assert(NumItems + NumTombstones <=
NumBuckets
);
[
all
...]
DenseMap.h
416
unsigned
NumBuckets
= getNumBuckets();
417
if (NewNumEntries*4 >=
NumBuckets
*3) {
418
this->grow(
NumBuckets
* 2);
420
NumBuckets
= getNumBuckets();
422
if (
NumBuckets
-(NewNumEntries+getNumTombstones()) <=
NumBuckets
/8) {
423
this->grow(
NumBuckets
);
446
const unsigned
NumBuckets
= getNumBuckets();
448
if (
NumBuckets
== 0) {
461
unsigned BucketNo = getHashValue(Val) & (
NumBuckets
-1)
[
all
...]
/external/clang/include/clang/Basic/
OnDiskHashTable.h
115
unsigned
NumBuckets
;
154
for (unsigned i = 0; i <
NumBuckets
; ++i)
163
NumBuckets
= newsize;
179
if (4*NumEntries >= 3*
NumBuckets
) resize(
NumBuckets
*2);
180
insert(Buckets,
NumBuckets
, new (BA.Allocate<Item>()) Item(key, data,
193
for (unsigned i = 0; i <
NumBuckets
; ++i) {
218
Emit32(out,
NumBuckets
);
220
for (unsigned i = 0; i <
NumBuckets
; ++i) Emit32(out, Buckets[i].off);
227
NumBuckets
= 64
[
all
...]
/external/clang/lib/Basic/
IdentifierTable.cpp
257
unsigned
NumBuckets
= HashTable.getNumBuckets();
259
unsigned NumEmptyBuckets =
NumBuckets
-NumIdentifiers;
276
NumIdentifiers/(double)
NumBuckets
);
Completed in 5416 milliseconds