Home
last modified time | relevance | path

Searched refs:Head (Results 1 – 25 of 99) sorted by relevance

1234

/netbsd-src/external/apache2/llvm/dist/llvm/include/llvm/Demangle/
H A DMicrosoftDemangle.h39 NewHead->Next = Head; in addNode()
41 Head = NewHead; in addNode()
49 while (Head) { in ~ArenaAllocator()
50 assert(Head->Buf); in ~ArenaAllocator()
51 delete[] Head->Buf; in ~ArenaAllocator()
52 AllocatorNode *Next = Head->Next; in ~ArenaAllocator()
53 delete Head; in ~ArenaAllocator() local
54 Head = Next; in ~ArenaAllocator()
59 assert(Head && Head->Buf); in allocUnalignedBuffer()
61 uint8_t *P = Head->Buf + Head->Used; in allocUnalignedBuffer()
[all …]
/netbsd-src/sys/external/bsd/compiler_rt/dist/lib/xray/
H A Dxray_segmented_array.h166 Segment *Head; variable
264 DCHECK_EQ(Head, &SentinelSegment); in InitHeadAndTail()
272 Head = S; in InitHeadAndTail()
274 DCHECK_EQ(Head, Tail); in InitHeadAndTail()
299 Head(&SentinelSegment), in Array()
305 Head(&SentinelSegment), in Array()
314 Head(O.Head), in Array()
319 O.Head = &SentinelSegment; in Array()
328 Head = O.Head;
329 O.Head = &SentinelSegment;
[all …]
/netbsd-src/external/apache2/llvm/dist/llvm/lib/CodeGen/
H A DEarlyIfConversion.cpp90 MachineBasicBlock *Head; member in __anon91bad1d10111::SSAIfConv
106 MachineBasicBlock *getTPred() const { return TBB == Tail ? Head : TBB; } in getTPred()
109 MachineBasicBlock *getFPred() const { return FBB == Tail ? Head : FBB; } in getFPred()
275 if (!DefMI || DefMI->getParent() != Head) in InstrDependenciesAllowIfConv()
369 MachineBasicBlock::iterator FirstTerm = Head->getFirstTerminator(); in findInsertionPoint()
370 MachineBasicBlock::iterator I = Head->end(); in findInsertionPoint()
371 MachineBasicBlock::iterator B = Head->begin(); in findInsertionPoint()
435 Head = MBB; in canConvertIf()
438 if (Head->succ_size() != 2) in canConvertIf()
440 MachineBasicBlock *Succ0 = Head->succ_begin()[0]; in canConvertIf()
[all …]
H A DShadowStackGCLowering.cpp56 GlobalVariable *Head = nullptr; member in __anon01ccd4ac0111::ShadowStackGCLowering
211 Head = M.getGlobalVariable("llvm_gc_root_chain"); in doInitialization()
212 if (!Head) { in doInitialization()
215 Head = new GlobalVariable( in doInitialization()
218 } else if (Head->hasExternalLinkage() && Head->isDeclaration()) { in doInitialization()
219 Head->setInitializer(Constant::getNullValue(StackEntryPtrTy)); in doInitialization()
220 Head->setLinkage(GlobalValue::LinkOnceAnyLinkage); in doInitialization()
329 AtEntry.CreateLoad(StackEntryTy->getPointerTo(), Head, "gc_currhead"); in runOnFunction()
360 AtEntry.CreateStore(NewHeadVal, Head); in runOnFunction()
373 AtExit->CreateStore(SavedHead, Head); in runOnFunction()
H A DMachineRegisterInfo.cpp268 MachineOperand *const Head = HeadRef; in addRegOperandToUseList() local
275 if (!Head) { in addRegOperandToUseList()
281 assert(MO->getReg() == Head->getReg() && "Different regs on the same list!"); in addRegOperandToUseList()
284 MachineOperand *Last = Head->Contents.Reg.Prev; in addRegOperandToUseList()
287 Head->Contents.Reg.Prev = MO; in addRegOperandToUseList()
294 MO->Contents.Reg.Next = Head; in addRegOperandToUseList()
307 MachineOperand *const Head = HeadRef; in removeRegOperandFromUseList() local
308 assert(Head && "List already empty"); in removeRegOperandFromUseList()
315 if (MO == Head) in removeRegOperandFromUseList()
320 (Next ? Next : Head)->Contents.Reg.Prev = Prev; in removeRegOperandFromUseList()
[all …]
/netbsd-src/external/apache2/llvm/dist/llvm/lib/Target/AArch64/
H A DAArch64ConditionalCompares.cpp148 MachineBasicBlock *Head; member in __anon6cc3cae00111::SSACCmpConv
225 if (MBB == Head) { in trivialTailPHIs()
439 Head = MBB; in canConvert()
442 if (Head->succ_size() != 2) in canConvert()
444 MachineBasicBlock *Succ0 = Head->succ_begin()[0]; in canConvert()
445 MachineBasicBlock *Succ1 = Head->succ_begin()[1]; in canConvert()
462 LLVM_DEBUG(dbgs() << "\nTriangle: " << printMBBReference(*Head) << " -> " in canConvert()
502 if (TII->analyzeBranch(*Head, TBB, FBB, HeadCond)) { in canConvert()
571 << printMBBReference(*Head) << ":\n" in convert()
580 BranchProbability Head2CmpBB = MBPI->getEdgeProbability(Head, CmpBB); in convert()
[all …]
/netbsd-src/external/apache2/llvm/dist/llvm/include/llvm/CodeGen/
H A DScoreboardHazardRecognizer.h48 size_t Head = 0; variable
64 return Data[(Head + idx) & (Depth-1)];
74 Head = 0;
78 Head = (Head + 1) & (Depth-1); in advance()
82 Head = (Head - 1) & (Depth-1); in recede()
/netbsd-src/external/apache2/llvm/dist/llvm/include/llvm/Support/
H A DAutomaton.h98 PathSegment *Head = Heads[I]; in transition() local
101 auto PI = lower_bound(Pairs, NfaStatePair{Head->State, 0ULL}); in transition()
102 auto PE = upper_bound(Pairs, NfaStatePair{Head->State, INT64_MAX}); in transition()
106 if (PI->FromDfaState == Head->State) in transition()
107 Heads.push_back(makePathSegment(PI->ToDfaState, Head)); in transition()
143 for (auto *Head : Heads) { in getPaths()
145 while (Head->State != 0) { in getPaths()
146 P.push_back(Head->State); in getPaths()
147 Head = Head->Tail; in getPaths()
H A DRegistry.h56 static node *Head, *Tail; variable
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; \
H A DOnDiskHashTable.h82 Item *Head; member
91 E->Next = B.Head; in insert()
93 B.Head = E; in insert()
102 for (Item *E = Buckets[I].Head; E;) { in resize()
136 for (Item *I = Buckets[Hash & (NumBuckets - 1)].Head; I; I = I->Next) in contains()
174 if (!B.Head) in Emit()
186 for (Item *I = B.Head; I; I = I->Next) { in Emit()
/netbsd-src/external/apache2/llvm/dist/llvm/tools/llvm-cxxfilt/
H A Dllvm-cxxfilt.cpp118 const auto Head = Source.begin(); in SplitStringDelims() local
121 auto Start = std::find_if(Head, Source.end(), IsLegalChar); in SplitStringDelims()
122 if (Start != Head) in SplitStringDelims()
123 OutFragments.push_back({"", Source.slice(0, Start - Head)}); in SplitStringDelims()
130 OutFragments.push_back({Source.slice(Start - Head, End - Head), in SplitStringDelims()
131 Source.slice(End - Head, DEnd - Head)}); in SplitStringDelims()
/netbsd-src/external/apache2/llvm/dist/llvm/include/llvm/Analysis/
H A DMustExecute.h286 CurInst(Other.CurInst), Head(Other.Head), Tail(Other.Tail) {} in MustBeExecutedIterator()
290 CurInst(Other.CurInst), Head(Other.Head), Tail(Other.Tail) {} in MustBeExecutedIterator()
296 std::swap(Head, Other.Head);
321 return CurInst == Other.CurInst && Head == Other.Head && Tail == Other.Tail;
373 const Instruction *Head, *Tail; member
/netbsd-src/external/apache2/llvm/dist/llvm/lib/Support/
H A DOptimizedStructLayout.cpp244 OptimizedStructLayoutField *Head; in performOptimizedStructLayout() member
255 auto Head = I; in performOptimizedStructLayout() local
267 FlexibleFieldsByAlignment.push_back({MinSize, Head, Alignment}); in performOptimizedStructLayout()
281 assert(Queue.Head && "queue was empty"); in performOptimizedStructLayout()
283 for (auto I = Queue.Head; I; I = Queue.getNext(I)) { in performOptimizedStructLayout()
295 assert(Last ? Queue->getNext(Last) == Cur : Queue->Head == Cur); in performOptimizedStructLayout()
311 Queue->Head = NewHead; in performOptimizedStructLayout()
351 assert(Queue->Head); in performOptimizedStructLayout()
362 for (Field *Cur = Queue->Head, *Last = nullptr; true; in performOptimizedStructLayout()
H A DPrettyStackTrace.cpp69 PrettyStackTraceEntry *ReverseStackTrace(PrettyStackTraceEntry *Head) { in ReverseStackTrace() argument
71 while (Head) in ReverseStackTrace()
72 std::tie(Prev, Head, Head->NextEntry) = in ReverseStackTrace()
73 std::make_tuple(Head, Head->NextEntry, Prev); in ReverseStackTrace()
/netbsd-src/external/gpl2/rcs/dist/src/
H A Dci.c474 rcsinitflag = !Head;
581 puttree(Head,frewrite);
600 newhead = Head == &newdelta;
887 Head = &newdelta; in addelta()
904 if (targetdelta==Head) { in addelta()
906 newdelta.next=Head; in addelta()
907 Head= &newdelta; in addelta()
930 incnum(Head->num, &newdelnum); in addelta()
940 if (cmpnumfld(newdelnum.string,Head->num,1)==0) in addelta()
941 incnum(Head->num, &newdelnum); in addelta()
[all …]
H A Drlog.c400 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) in putrunk()
654 if ( Delta != Head) in readdeltalog()
1167 if (branchflag && (Dbranch||Head)) { in getnumericrev()
1170 Dbranch ? Dbranch : fstr_save(partialno(&s,Head->num,1)); in getnumericrev()
H A Drcsmerge.c227 if (!Head) rcsfaterror("no revisions present");
230 rev[1] = Dbranch ? Dbranch : Head->num;
236 rev[2] = Dbranch ? Dbranch : Head->num;
/netbsd-src/external/apache2/llvm/dist/llvm/include/llvm/ADT/
H A DImmutableList.h30 T Head; variable
35 : Head(std::forward<ElemT>(head)), Tail(tail) {} in Head() function
41 const T& getHead() const { return Head; } in getHead()
51 Profile(ID, Head, Tail); in Profile()
176 LLVM_NODISCARD ImmutableList<T> concat(ElemT &&Head, ImmutableList<T> Tail) { in concat() argument
182 ListTy::Profile(ID, Head, TailImpl); in concat()
189 new (L) ListTy(std::forward<ElemT>(Head), TailImpl); in concat()
H A DBreadthFirstIterator.h81 Optional<QueueElement> Head = VisitQueue.front(); in toNext() local
82 QueueElement H = Head.getValue(); in toNext()
99 Head = VisitQueue.front(); in toNext()
100 if (Head != None) in toNext()
/netbsd-src/lib/libcurses/PSD.doc/
H A Dlife.c45 LIST *Head; /* head of linked list */
127 if (Head != NULL) /* start new list */
128 dellist(Head);
129 Head = malloc(sizeof (LIST));
157 for (hp = Head; hp; hp = hp->next)
/netbsd-src/external/apache2/mDNSResponder/dist/mDNSShared/
H A DGenLinkedList.h27 void *Head, member
47 void *Head, member
69 size_t Head, member
/netbsd-src/external/gpl3/gcc/dist/libstdc++-v3/include/ext/pb_ds/detail/pat_trie_/
H A Dpat_trie_base.hpp472 _CIter<Node, Leaf, Head, Inode, Is_Forward_Iterator>
475 _CIter<Node, Leaf, Head, Inode, !Is_Forward_Iterator>
478 _Iter<Node, Leaf, Head, Inode, Is_Forward_Iterator>
481 _Iter<Node, Leaf, Head, Inode, !Is_Forward_Iterator>
485 template<typename Node, typename Leaf, typename Head, typename Inode,
506 typedef typename rebind_traits<_Alloc, Head>::pointer head_pointer;
707 template<typename Node, typename Leaf, typename Head, typename Inode,
710 : public _CIter<Node, Leaf, Head, Inode, Is_Forward_Iterator>
713 typedef _CIter<Node, Leaf, Head, Inode, Is_Forward_Iterator>
797 _Node_citer<Node, Leaf, Head, Inode, _CIterator, Iterator, _ATraits, _Alloc>
[all …]
/netbsd-src/external/gpl3/gcc.old/dist/libstdc++-v3/include/ext/pb_ds/detail/pat_trie_/
H A Dpat_trie_base.hpp472 _CIter<Node, Leaf, Head, Inode, Is_Forward_Iterator>
475 _CIter<Node, Leaf, Head, Inode, !Is_Forward_Iterator>
478 _Iter<Node, Leaf, Head, Inode, Is_Forward_Iterator>
481 _Iter<Node, Leaf, Head, Inode, !Is_Forward_Iterator>
485 template<typename Node, typename Leaf, typename Head, typename Inode,
506 typedef typename rebind_traits<_Alloc, Head>::pointer head_pointer;
707 template<typename Node, typename Leaf, typename Head, typename Inode,
710 : public _CIter<Node, Leaf, Head, Inode, Is_Forward_Iterator>
713 typedef _CIter<Node, Leaf, Head, Inode, Is_Forward_Iterator>
797 _Node_citer<Node, Leaf, Head, Inode, _CIterator, Iterator, _ATraits, _Alloc>
[all …]
/netbsd-src/external/apache2/llvm/dist/clang/include/clang/AST/
H A DDeclContextInternals.h189 DeclListNode::Decls Head = Data.getPointer(); in replaceExternalDecls() local
190 if (Head.isNull()) { in replaceExternalDecls()
198 DeclListNode::Decls *Tail = &Head; in replaceExternalDecls()
206 Data.setPointer(Head); in replaceExternalDecls()
/netbsd-src/external/apache2/llvm/dist/llvm/lib/Transforms/Utils/
H A DBasicBlockUtils.cpp1355 BasicBlock *Head = SplitBefore->getParent(); in SplitBlockAndInsertIfThenImpl() local
1356 BasicBlock *Tail = Head->splitBasicBlock(SplitBefore->getIterator()); in SplitBlockAndInsertIfThenImpl()
1360 Updates.push_back({DominatorTree::Insert, Head, Tail}); in SplitBlockAndInsertIfThenImpl()
1364 Updates.push_back({DominatorTree::Delete, Head, UniqueSuccessorOfHead}); in SplitBlockAndInsertIfThenImpl()
1367 Instruction *HeadOldTerm = Head->getTerminator(); in SplitBlockAndInsertIfThenImpl()
1368 LLVMContext &C = Head->getContext(); in SplitBlockAndInsertIfThenImpl()
1372 ThenBlock = BasicBlock::Create(C, "", Head->getParent(), Tail); in SplitBlockAndInsertIfThenImpl()
1386 Updates.push_back({DominatorTree::Insert, Head, ThenBlock}); in SplitBlockAndInsertIfThenImpl()
1393 if (DomTreeNode *OldNode = DT->getNode(Head)) { in SplitBlockAndInsertIfThenImpl()
1396 DomTreeNode *NewNode = DT->addNewBlock(Tail, Head); in SplitBlockAndInsertIfThenImpl()
[all …]

1234