| /src/external/apache2/mDNSResponder/dist/mDNSShared/ |
| GenLinkedList.h | 27 void *Head,
47 void *Head,
69 size_t Head,
|
| /src/external/apache2/llvm/dist/llvm/include/llvm/ADT/ |
| BreadthFirstIterator.h | 81 Optional<QueueElement> Head = VisitQueue.front();
82 QueueElement H = Head.getValue();
99 Head = VisitQueue.front();
100 if (Head != None)
|
| ImmutableList.h | 30 T Head;
34 ImmutableListImpl(ElemT &&head, const ImmutableListImpl *tail = nullptr)
35 : Head(std::forward<ElemT>(head)), Tail(tail) {}
41 const T& getHead() const { return Head; }
51 Profile(ID, Head, Tail);
103 /// begin - Returns an iterator referring to the head of the list, or
131 /// getHead - Returns the head of the list.
133 assert(!isEmpty() && "Cannot get the head of an empty list.");
176 LLVM_NODISCARD ImmutableList<T> concat(ElemT &&Head, ImmutableList<T> Tail)
[all...] |
| /src/external/apache2/llvm/dist/llvm/include/llvm/CodeGen/ |
| ScoreboardHazardRecognizer.h | 34 // indicated by Head.
48 size_t Head = 0;
64 return Data[(Head + idx) & (Depth-1)];
74 Head = 0;
78 Head = (Head + 1) & (Depth-1);
82 Head = (Head - 1) & (Depth-1);
|
| MachineTraceMetrics.h | 164 /// The block number of the head of the trace. (When hasValidDepth()).
165 unsigned Head;
196 /// trace head, and any dependencies from such a far away dominator are not
204 // Instruction depths are only comparable if the traces share a head.
205 if (Head != TBI.Head)
209 // flow, a dominator may share a trace head without actually being on the
273 /// the trace head to the trace center block. The resource depth only
|
| /src/external/apache2/llvm/dist/llvm/lib/Support/ |
| OptimizedStructLayout.cpp | 239 /// The head of the queue. A singly-linked list. The order here should
244 OptimizedStructLayoutField *Head;
255 auto Head = I;
267 FlexibleFieldsByAlignment.push_back({MinSize, Head, Alignment});
281 assert(Queue.Head && "queue was empty");
283 for (auto I = Queue.Head; I; I = Queue.getNext(I)) {
295 assert(Last ? Queue->getNext(Last) == Cur : Queue->Head == Cur);
308 // Otherwise, replace the head.
311 Queue->Head = NewHead;
351 assert(Queue->Head);
[all...] |
| /src/external/apache2/llvm/dist/clang/include/clang/AST/ |
| DeclContextInternals.h | 189 DeclListNode::Decls Head = Data.getPointer();
190 if (Head.isNull()) {
198 DeclListNode::Decls *Tail = &Head;
206 Data.setPointer(Head);
|
| /src/external/apache2/llvm/dist/llvm/include/llvm/Support/ |
| Automaton.h | 68 /// head.
98 PathSegment *Head = Heads[I];
100 // transition from the current head state.
101 auto PI = lower_bound(Pairs, NfaStatePair{Head->State, 0ULL});
102 auto PE = upper_bound(Pairs, NfaStatePair{Head->State, INT64_MAX});
103 // For every transition from the current head state, add a new path
106 if (PI->FromDfaState == Head->State)
107 Heads.push_back(makePathSegment(PI->ToDfaState, Head));
143 for (auto *Head : Heads) {
145 while (Head->State != 0)
[all...] |
| Registry.h | 56 static node *Head, *Tail;
131 /// This provides template definitions of add_node, begin, and the Head and Tail
139 template<typename T> typename Registry<T>::node *Registry<T>::Head = nullptr;\
146 Head = N; \
150 return iterator(Head); \
152 template REGISTRY_CLASS::node *Registry<REGISTRY_CLASS::type>::Head; \
|
| OnDiskHashTable.h | 82 Item *Head;
91 E->Next = B.Head;
93 B.Head = E;
102 for (Item *E = Buckets[I].Head; E;) {
136 for (Item *I = Buckets[Hash & (NumBuckets - 1)].Head; I; I = I->Next)
174 if (!B.Head)
183 assert(B.Length != 0 && "Bucket has a head but zero length?");
186 for (Item *I = B.Head; I; I = I->Next) {
|
| /src/external/apache2/llvm/dist/llvm/tools/llvm-cxxfilt/ |
| llvm-cxxfilt.cpp | 118 const auto Head = Source.begin();
121 auto Start = std::find_if(Head, Source.end(), IsLegalChar);
122 if (Start != Head)
123 OutFragments.push_back({"", Source.slice(0, Start - Head)});
130 OutFragments.push_back({Source.slice(Start - Head, End - Head),
131 Source.slice(End - Head, DEnd - Head)});
|
| /src/sys/external/bsd/compiler_rt/dist/lib/xray/ |
| xray_segmented_array.h | 166 Segment *Head;
264 DCHECK_EQ(Head, &SentinelSegment);
272 Head = S;
274 DCHECK_EQ(Head, Tail);
299 Head(&SentinelSegment),
305 Head(&SentinelSegment),
314 Head(O.Head),
319 O.Head = &SentinelSegment;
328 Head = O.Head
[all...] |
| /src/external/apache2/llvm/dist/llvm/include/llvm/Analysis/ |
| MustExecute.h | 286 CurInst(Other.CurInst), Head(Other.Head), Tail(Other.Tail) {}
290 CurInst(Other.CurInst), Head(Other.Head), Tail(Other.Tail) {}
296 std::swap(Head, Other.Head);
321 return CurInst == Other.CurInst && Head == Other.Head && Tail == Other.Tail;
352 /// Try to advance one of the underlying positions (Head or Tail).
372 /// one pointed to by Head, Tail, or both
[all...] |
| /src/external/apache2/llvm/dist/llvm/lib/CodeGen/ |
| ShadowStackGCLowering.cpp | 56 GlobalVariable *Head = nullptr;
211 Head = M.getGlobalVariable("llvm_gc_root_chain");
212 if (!Head) {
215 Head = new GlobalVariable(
218 } else if (Head->hasExternalLinkage() && Head->isDeclaration()) {
219 Head->setInitializer(Constant::getNullValue(StackEntryPtrTy));
220 Head->setLinkage(GlobalValue::LinkOnceAnyLinkage);
327 // Initialize the map pointer and load the current head of the shadow stack.
329 AtEntry.CreateLoad(StackEntryTy->getPointerTo(), Head, "gc_currhead")
[all...] |
| MachineRegisterInfo.cpp | 268 MachineOperand *const Head = HeadRef;
270 // Head points to the first list element.
272 // Prev pointers are circular, so Head->Prev == Last.
274 // Head is NULL for an empty list.
275 if (!Head) {
281 assert(MO->getReg() == Head->getReg() && "Different regs on the same list!");
283 // Insert MO between Last and Head in the circular Prev chain.
284 MachineOperand *Last = Head->Contents.Reg.Prev;
287 Head->Contents.Reg.Prev = MO;
294 MO->Contents.Reg.Next = Head;
[all...] |
| EarlyIfConversion.cpp | 71 // Triangle: Head Diamond: Head
80 // Head block, and phis in the Tail block are converted to select instructions.
90 MachineBasicBlock *Head;
106 MachineBasicBlock *getTPred() const { return TBB == Tail ? Head : TBB; }
109 MachineBasicBlock *getFPred() const { return FBB == Tail ? Head : FBB; }
128 /// Instructions in Head that define values used by the conditional blocks.
138 /// Insertion point in Head for speculatively executed instructions form TBB
158 /// Find a valid insertion point in Head.
196 /// If instructions use any values that are defined in the head basic block
[all...] |
| /src/external/apache2/llvm/dist/clang/lib/Tooling/Core/ |
| Replacement.cpp | 388 StringRef Head = TextRef.substr(0, R.getOffset() + Delta - Offset);
390 Text = (Head + R.getReplacementText() + Tail).str();
|
| /src/external/apache2/llvm/dist/llvm/lib/Target/AArch64/ |
| AArch64ConditionalCompares.cpp | 59 STATISTIC(NumHeadBranchRejs, "Number of ccmps rejected (Head branch)");
84 // From: Head To: Head
94 // The Head block is terminated by a br.cond instruction, and the CmpBB block
98 // compare, and merges CmpBB into Head, speculatively executing its
109 // Head:
121 // Head:
129 // The ccmp condition code is the one that would cause the Head terminator to
133 // between Head and Tail, just like if-converting a diamond.
148 MachineBasicBlock *Head;
[all...] |
| /src/external/gpl2/rcs/dist/src/ |
| rcssyn.c | 180 Khead[] = "head",
203 struct hshentry * Head;
246 Head = getdnum();
|
| rlog.c | 400 Head ? " " : "", Head ? Head->num : "",
439 if (Head && selectflag & descflag) {
441 exttree(Head);
447 recentdate(Head, currdate);
451 revno = extdate(Head);
469 putree(Head);
502 for (ptr = Head; ptr; ptr = ptr->next)
654 if ( Delta != Head)
[all...] |
| /src/external/apache2/llvm/dist/llvm/lib/Transforms/Utils/ |
| BasicBlockUtils.cpp | 1355 BasicBlock *Head = SplitBefore->getParent();
1356 BasicBlock *Tail = Head->splitBasicBlock(SplitBefore->getIterator());
1360 Updates.push_back({DominatorTree::Insert, Head, Tail});
1364 Updates.push_back({DominatorTree::Delete, Head, UniqueSuccessorOfHead});
1367 Instruction *HeadOldTerm = Head->getTerminator();
1368 LLVMContext &C = Head->getContext();
1372 ThenBlock = BasicBlock::Create(C, "", Head->getParent(), Tail);
1386 Updates.push_back({DominatorTree::Insert, Head, ThenBlock});
1393 if (DomTreeNode *OldNode = DT->getNode(Head)) {
1396 DomTreeNode *NewNode = DT->addNewBlock(Tail, Head);
[all...] |
| /src/external/apache2/llvm/dist/llvm/lib/Transforms/Vectorize/ |
| VPlan.cpp | 874 const VPBlockBase *Head = To->getEntryBasicBlock();
875 OS << Indent << getUID(Tail) << " -> " << getUID(Head);
879 if (Head != To)
|
| /src/external/apache2/llvm/dist/llvm/utils/unittest/googletest/include/gtest/internal/ |
| gtest-internal.h | 669 result->push_back(NameGenerator::template GetName<typename Types::Head>(i));
699 typedef typename Types::Head Type;
767 typedef typename Tests::Head Head;
770 TypeParameterizedTest<Fixture, Head, Types>::Register(
|
| gtest-type-util.h | 118 // Head for the first type in the list, and Tail for the rest of the
128 typedef T1 Head;
133 typedef T1 Head;
139 typedef T1 Head;
145 typedef T1 Head;
151 typedef T1 Head;
158 typedef T1 Head;
165 typedef T1 Head;
172 typedef T1 Head;
179 typedef T1 Head;
[all...] |
| /src/external/apache2/llvm/dist/llvm/lib/Demangle/ |
| MicrosoftDemangle.cpp | 1557 static NodeArrayNode *nodeListToNodeArray(ArenaAllocator &Arena, NodeList *Head,
1563 N->Nodes[I] = Head->N;
1564 Head = Head->Next;
1572 NodeList *Head = Arena.alloc<NodeList>();
1574 Head->N = UnqualifiedName;
1580 NewHead->Next = Head;
1581 Head = NewHead;
1593 Head->N = Elem;
1597 QN->Components = nodeListToNodeArray(Arena, Head, Count)
[all...] |
