OpenGrok
Home
Sort by relevance
Sort by last modified time
Full Search
Definition
Symbol
File Path
History
|
|
Help
Searched
defs:Buckets
(Results
1 - 6
of
6
) sorted by null
/external/llvm/include/llvm/Support/
GenericDomTreeConstruction.h
181
// Instead of using a bucket per vertex, we use a single array
Buckets
that
183
//
Buckets
[i] stores the index of the first element in V's bucket. After V's
184
// bucket is processed,
Buckets
[i] stores the index of the next element in the
186
SmallVector<unsigned, 32>
Buckets
;
187
Buckets
.resize(N + 1);
189
Buckets
[i] = i;
197
for (unsigned j = i;
Buckets
[j] != i; j =
Buckets
[j]) {
198
typename GraphT::NodeType* V = DT.Vertex[
Buckets
[j]];
225
Buckets
[i] = Buckets[WInfo.Semi]
[
all
...]
OnDiskHashTable.h
87
Bucket *
Buckets
;
91
void insert(Bucket *
Buckets
, size_t Size, Item *E) {
92
Bucket &B =
Buckets
[E->Hash & (Size - 1)];
98
/// \brief Resize the hash table, moving the old entries into the new
buckets
.
103
for (Item *E =
Buckets
[I].Head; E;) {
110
free(
Buckets
);
112
Buckets
= NewBuckets;
132
insert(
Buckets
, NumBuckets, new (BA.Allocate()) Item(Key, Data, InfoObj));
150
Bucket &B =
Buckets
[I];
183
LE.write<offset_type>(
Buckets
[I].Off)
[
all
...]
/external/llvm/lib/CodeGen/AsmPrinter/
DwarfAccelTable.h
37
// |
BUCKETS
|
47
// the number of
buckets
, total number of hashes, and room for a special
50
// The
buckets
contain an index (e.g. 6) into the hashes array. The hashes
56
// number of
buckets
giving us our bucket. From there we take the bucket value
76
// Helper function to compute the number of
buckets
needed based on
84
uint32_t bucket_count; // The number of
buckets
in this hash table.
88
// indexes (
buckets
) for correct alignment.
239
//
Buckets
/Hashes/Offsets
242
BucketList
Buckets
;
/external/llvm/lib/Support/
FoldingSet.cpp
187
/// The problem with this is that the start of the hash
buckets
are not
208
static void **GetBucketFor(unsigned Hash, void **
Buckets
, unsigned NumBuckets) {
211
return
Buckets
+ BucketNum;
216
void **
Buckets
= static_cast<void**>(calloc(NumBuckets+1, sizeof(void*)));
218
Buckets
[NumBuckets] = reinterpret_cast<void*>(-1);
219
return
Buckets
;
229
Buckets
= AllocateBuckets(NumBuckets);
233
free(
Buckets
);
237
memset(
Buckets
, 0, NumBuckets*sizeof(void*));
240
Buckets
[NumBuckets] = reinterpret_cast<void*>(-1)
[
all
...]
/external/llvm/include/llvm/ADT/
FoldingSet.h
35
/// "
buckets
" are actually the nodes themselves (the next pointer is in the
106
/// structure is an array of
buckets
. Each bucket is indexed by the hash of
113
///
Buckets
- Array of bucket chains.
115
void **
Buckets
;
117
/// NumBuckets - Length of the
Buckets
array. Always a power of 2.
122
/// is greater than twice the number of
buckets
.
423
iterator begin() { return iterator(
Buckets
); }
424
iterator end() { return iterator(
Buckets
+NumBuckets); }
427
const_iterator begin() const { return const_iterator(
Buckets
); }
428
const_iterator end() const { return const_iterator(
Buckets
+NumBuckets);
[
all
...]
DenseMap.h
73
/// Grow the densemap so that it has at least Size
buckets
. Does not shrink
233
/// somewhere into the DenseMap's array of
buckets
(i.e. either to a key or
239
/// getPointerIntoBucketsArray() - Return an opaque pointer into the
buckets
269
"# initial
buckets
must be a power of two!");
422
// the
buckets
are empty (meaning that many are filled with tombstones),
443
// so that when growing
buckets
we have self-consistent entry count.
538
BucketT *
Buckets
;
566
operator delete(
Buckets
);
570
std::swap(
Buckets
, RHS.
Buckets
);
[
all
...]
Completed in 254 milliseconds