| /freebsd-10-stable/cddl/contrib/opensolaris/cmd/dtrace/test/tst/common/java_api/ |
| D | tst.Bean.ksh.out | 45 …Bucket[min = 1, max = 10, frequency = 0], org.opensolaris.os.dtrace.Distribution$Bucket[min = 11, …
56 …Bucket[min = 1, max = 10, frequency = 0], org.opensolaris.os.dtrace.Distribution$Bucket[min = 11, …
68 …Bucket[min = 1, max = 10, frequency = 0], org.opensolaris.os.dtrace.Distribution$Bucket[min = 11, …
79 …Bucket[min = 1, max = 10, frequency = 0], org.opensolaris.os.dtrace.Distribution$Bucket[min = 11, …
150 …Bucket[min = -4611686018427387904, max = -2305843009213693953, frequency = 0], org.opensolaris.os.…
151 …Bucket[min = -4611686018427387904, max = -2305843009213693953, frequency = 0], org.opensolaris.os.…
153 …Bucket[min = -4611686018427387904, max = -2305843009213693953, frequency = 0], org.opensolaris.os.…
154 …Bucket[min = -4611686018427387904, max = -2305843009213693953, frequency = 0], org.opensolaris.os.…
156 …Bucket[min = 1, max = 10, frequency = 0], org.opensolaris.os.dtrace.Distribution$Bucket[min = 11, …
157 …Bucket[min = 1, max = 10, frequency = 0], org.opensolaris.os.dtrace.Distribution$Bucket[min = 11, …
[all …]
|
| /freebsd-10-stable/contrib/llvm/lib/Support/ |
| D | FoldingSet.cpp | 285 void **Bucket = GetBucketFor(IDHash, Buckets, NumBuckets); in FindNodeOrInsertPos() local
286 void *Probe = *Bucket; in FindNodeOrInsertPos()
300 InsertPos = Bucket; in FindNodeOrInsertPos()
319 void **Bucket = static_cast<void**>(InsertPos); in InsertNode() local
321 void *Next = *Bucket; in InsertNode()
327 Next = reinterpret_cast<void*>(reinterpret_cast<intptr_t>(Bucket)|1); in InsertNode()
331 *Bucket = N; in InsertNode()
361 void **Bucket = GetBucketPtr(Ptr); in RemoveNode() local
362 Ptr = *Bucket; in RemoveNode()
367 *Bucket = NodeNextPtr; in RemoveNode()
[all …]
|
| D | SmallPtrSet.cpp | 63 const void **Bucket = const_cast<const void**>(FindBucketFor(Ptr)); in insert_imp() local
64 if (*Bucket == Ptr) return false; // Already inserted, good. in insert_imp()
67 if (*Bucket == getTombstoneMarker()) in insert_imp()
69 *Bucket = Ptr; in insert_imp()
91 void **Bucket = const_cast<void**>(FindBucketFor(Ptr)); in erase_imp() local
92 if (*Bucket != Ptr) return false; // Not in the set? in erase_imp()
95 *Bucket = getTombstoneMarker(); in erase_imp()
102 unsigned Bucket = DenseMapInfo<void *>::getHashValue(Ptr) & (CurArraySize-1); in FindBucketFor() local
109 if (Array[Bucket] == Ptr) in FindBucketFor()
110 return Array+Bucket; in FindBucketFor()
[all …]
|
| D | StringMap.cpp | 168 int Bucket = FindKey(Key); in RemoveKey() local
169 if (Bucket == -1) return 0; in RemoveKey()
171 StringMapEntryBase *Result = TheTable[Bucket]; in RemoveKey()
172 TheTable[Bucket] = getTombstoneVal(); in RemoveKey()
210 StringMapEntryBase *Bucket = TheTable[I]; in RehashTable() local
211 if (Bucket && Bucket != getTombstoneVal()) { in RehashTable()
216 NewTableArray[FullHash & (NewSize-1)] = Bucket; in RehashTable()
228 NewTableArray[NewBucket] = Bucket; in RehashTable()
|
| /freebsd-10-stable/contrib/llvm/include/llvm/Support/ |
| D | ArrayRecycler.h | 39 SmallVector<FreeList*, 8> Bucket; variable
44 if (Idx >= Bucket.size()) in pop()
46 FreeList *Entry = Bucket[Idx]; in pop()
49 Bucket[Idx] = Entry->Next; in pop()
59 if (Idx >= Bucket.size()) in push()
60 Bucket.resize(size_t(Idx) + 1); in push()
61 Entry->Next = Bucket[Idx]; in push()
62 Bucket[Idx] = Entry; in push()
97 assert(Bucket.empty() && "Non-empty ArrayRecycler deleted!"); in ~ArrayRecycler()
104 for (; !Bucket.empty(); Bucket.pop_back()) in clear()
[all …]
|
| /freebsd-10-stable/contrib/llvm/include/llvm/ADT/ |
| D | StringMap.h | 292 int Bucket = FindKey(Key); in find() local
293 if (Bucket == -1) return end(); in find()
294 return iterator(TheTable+Bucket, true); in find()
298 int Bucket = FindKey(Key); in find() local
299 if (Bucket == -1) return end(); in find()
300 return const_iterator(TheTable+Bucket, true); in find()
325 StringMapEntryBase *&Bucket = TheTable[BucketNo]; in insert() local
326 if (Bucket && Bucket != getTombstoneVal()) in insert()
329 if (Bucket == getTombstoneVal()) in insert()
331 Bucket = KeyValue; in insert()
[all …]
|
| D | SmallPtrSet.h | 144 const void *const *Bucket;
148 : Bucket(BP), End(E) { in SmallPtrSetIteratorImpl()
153 return Bucket == RHS.Bucket;
156 return Bucket != RHS.Bucket;
164 assert(Bucket <= End); in AdvanceIfNotValid()
165 while (Bucket != End && in AdvanceIfNotValid()
166 (*Bucket == SmallPtrSetImpl::getEmptyMarker() || in AdvanceIfNotValid()
167 *Bucket == SmallPtrSetImpl::getTombstoneMarker())) in AdvanceIfNotValid()
168 ++Bucket; in AdvanceIfNotValid()
190 assert(Bucket < End);
[all …]
|
| D | FoldingSet.h | 641 FoldingSetIteratorImpl(void **Bucket);
657 explicit FoldingSetIterator(void **Bucket) : FoldingSetIteratorImpl(Bucket) {} in FoldingSetIterator() argument
685 explicit FoldingSetBucketIteratorImpl(void **Bucket);
687 FoldingSetBucketIteratorImpl(void **Bucket, bool) in FoldingSetBucketIteratorImpl() argument
688 : Ptr(Bucket) {} in FoldingSetBucketIteratorImpl()
709 explicit FoldingSetBucketIterator(void **Bucket) : in FoldingSetBucketIterator() argument
710 FoldingSetBucketIteratorImpl(Bucket) {} in FoldingSetBucketIterator()
712 FoldingSetBucketIterator(void **Bucket, bool) : in FoldingSetBucketIterator() argument
713 FoldingSetBucketIteratorImpl(Bucket, true) {} in FoldingSetBucketIterator()
|
| D | DenseMap.h | 988 typedef std::pair<KeyT, ValueT> Bucket; typedef
994 typedef typename conditional<IsConst, const Bucket, Bucket>::type value_type;
|
| /freebsd-10-stable/contrib/llvm/tools/clang/include/clang/Basic/ |
| D | OnDiskHashTable.h | 132 class Bucket {
138 Bucket() {} in Bucket() function
141 Bucket* Buckets;
144 void insert(Bucket* b, size_t size, Item* E) { in insert()
146 Bucket& B = b[idx]; in insert()
153 Bucket* newBuckets = (Bucket*) std::calloc(newsize, sizeof(Bucket)); in resize()
195 Bucket& B = Buckets[i]; in Emit()
231 Buckets = (Bucket*) std::calloc(NumBuckets, sizeof(Bucket)); in OnDiskChainedHashTableGenerator()
295 const unsigned char* Bucket = Buckets + sizeof(uint32_t)*idx; variable
297 unsigned offset = ReadLE32(Bucket);
|
| /freebsd-10-stable/cddl/contrib/opensolaris/cmd/dtrace/test/tst/common/java_api/src/ |
| D | TestBean.java | 206 List < Distribution.Bucket > buckets = in getLogDistribution()
207 new ArrayList < Distribution.Bucket > (); in getLogDistribution()
208 Distribution.Bucket bucket; in getLogDistribution()
220 bucket = new Distribution.Bucket(-1, -1, n++); in getLogDistribution()
222 bucket = new Distribution.Bucket(0, 0, n++); in getLogDistribution()
224 bucket = new Distribution.Bucket(1, 1, n++); in getLogDistribution()
238 bucket = new Distribution.Bucket(lowerBound, upperBound, n++); in getLogDistribution()
248 List < Distribution.Bucket > buckets = in getLinearDistribution()
249 new ArrayList < Distribution.Bucket > (); in getLinearDistribution()
250 Distribution.Bucket bucket; in getLinearDistribution()
[all …]
|
| /freebsd-10-stable/contrib/llvm/tools/clang/lib/Lex/ |
| D | HeaderMap.cpp | 213 for (unsigned Bucket = HashHMapKey(Filename);; ++Bucket) { in LookupFile() local
214 HMapBucket B = getBucket(Bucket & (NumBuckets-1)); in LookupFile()
|
| /freebsd-10-stable/contrib/serf/ |
| D | design-guide.txt | 9 4. Bucket Read Functions
11 6. Bucket lifetimes
|
| /freebsd-10-stable/cddl/contrib/opensolaris/cmd/dtrace/test/cmd/jdtrace/ |
| D | JDTrace.java | 303 Distribution.Bucket bucket; in printDistribution()
|
| /freebsd-10-stable/contrib/libstdc++/include/tr1/ |
| D | hashtable | 292 // Bucket operations
|
| /freebsd-10-stable/sys/dev/aic7xxx/ |
| D | aic7xxx.seq | 893 * Turn on `Bit Bucket' mode, wait until the target takes
|
| D | aic79xx.seq | 1650 * Turn on `Bit Bucket' mode, wait until the target takes
|
| /freebsd-10-stable/games/fortune/datfiles/ |
| D | fortunes | 38168 BBBF Branch on Bit Bucket Full
|