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/Analysis/
DominatorInternals.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
...]
/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
81
// Helper function to compute the number of
buckets
needed based on
89
uint32_t bucket_count; // The number of
buckets
in this hash table.
93
// indexes (
buckets
) for correct alignment.
263
//
Buckets
/Hashes/Offsets
266
BucketList
Buckets
;
/external/llvm/lib/Support/
FoldingSet.cpp
171
/// The problem with this is that the start of the hash
buckets
are not
192
static void **GetBucketFor(unsigned Hash, void **
Buckets
, unsigned NumBuckets) {
195
return
Buckets
+ BucketNum;
200
void **
Buckets
= static_cast<void**>(calloc(NumBuckets+1, sizeof(void*)));
202
Buckets
[NumBuckets] = reinterpret_cast<void*>(-1);
203
return
Buckets
;
213
Buckets
= AllocateBuckets(NumBuckets);
217
free(
Buckets
);
221
memset(
Buckets
, 0, NumBuckets*sizeof(void*));
224
Buckets
[NumBuckets] = reinterpret_cast<void*>(-1)
[
all
...]
/external/llvm/include/llvm/ADT/
DenseMap.h
41
BucketT *
Buckets
;
67
for (BucketT *P =
Buckets
, *E =
Buckets
+NumBuckets; P != E; ++P) {
75
memset((void*)
Buckets
, 0x5a, sizeof(BucketT)*NumBuckets);
77
operator delete(
Buckets
);
85
return empty() ? end() : iterator(
Buckets
,
Buckets
+NumBuckets);
88
return iterator(
Buckets
+NumBuckets,
Buckets
+NumBuckets, true);
91
return empty() ? end() : const_iterator(
Buckets
, Buckets+NumBuckets)
[
all
...]
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
.
408
iterator begin() { return iterator(
Buckets
); }
409
iterator end() { return iterator(
Buckets
+NumBuckets); }
412
const_iterator begin() const { return const_iterator(
Buckets
); }
413
const_iterator end() const { return const_iterator(
Buckets
+NumBuckets);
[
all
...]
/external/clang/include/clang/Basic/
OnDiskHashTable.h
141
Bucket*
Buckets
;
156
for (Item* E =
Buckets
[i].head; E ; ) {
163
free(
Buckets
);
165
Buckets
= newBuckets;
181
insert(
Buckets
, NumBuckets, new (BA.Allocate<Item>()) Item(key, data,
195
Bucket& B =
Buckets
[i];
221
for (unsigned i = 0; i < NumBuckets; ++i) Emit32(out,
Buckets
[i].off);
231
Buckets
= (Bucket*) std::calloc(NumBuckets, sizeof(Bucket));
235
std::free(
Buckets
);
243
const unsigned char* const
Buckets
;
[
all
...]
Completed in 169 milliseconds