| /openbsd/src/gnu/llvm/llvm/include/llvm/Demangle/ |
| D | MicrosoftDemangle.h | 37 NewHead->Next = Head; in addNode()
39 Head = NewHead; in addNode()
47 while (Head) { in ~ArenaAllocator()
48 assert(Head->Buf); in ~ArenaAllocator()
49 delete[] Head->Buf; in ~ArenaAllocator()
50 AllocatorNode *Next = Head->Next; in ~ArenaAllocator()
51 delete Head; in ~ArenaAllocator() local
52 Head = Next; in ~ArenaAllocator()
57 assert(Head && Head->Buf); in allocUnalignedBuffer()
59 uint8_t *P = Head->Buf + Head->Used; in allocUnalignedBuffer()
[all …]
|
| /openbsd/src/gnu/llvm/compiler-rt/lib/xray/ |
| D | xray_segmented_array.h | 165 Segment *Head; variable
263 DCHECK_EQ(Head, &SentinelSegment); in InitHeadAndTail()
271 Head = S; in InitHeadAndTail()
273 DCHECK_EQ(Head, Tail); in InitHeadAndTail()
298 Head(&SentinelSegment), in Array()
304 Head(&SentinelSegment), in Array()
313 Head(O.Head), in Array()
318 O.Head = &SentinelSegment; in Array()
327 Head = O.Head;
328 O.Head = &SentinelSegment;
[all …]
|
| /openbsd/src/gnu/llvm/llvm/lib/CodeGen/ |
| D | EarlyIfConversion.cpp | 89 MachineBasicBlock *Head; member in __anon20dbcc220111::SSAIfConv
105 MachineBasicBlock *getTPred() const { return TBB == Tail ? Head : TBB; } in getTPred()
108 MachineBasicBlock *getFPred() const { return FBB == Tail ? Head : FBB; } in getFPred()
273 if (!DefMI || DefMI->getParent() != Head) in InstrDependenciesAllowIfConv()
373 MachineBasicBlock::iterator FirstTerm = Head->getFirstTerminator(); in findInsertionPoint()
374 MachineBasicBlock::iterator I = Head->end(); in findInsertionPoint()
375 MachineBasicBlock::iterator B = Head->begin(); in findInsertionPoint()
439 Head = MBB; in canConvertIf()
442 if (Head->succ_size() != 2) in canConvertIf()
444 MachineBasicBlock *Succ0 = Head->succ_begin()[0]; in canConvertIf()
[all …]
|
| D | ShadowStackGCLowering.cpp | 56 GlobalVariable *Head = nullptr; member in __anond2948f7d0111::ShadowStackGCLowering
212 Head = M.getGlobalVariable("llvm_gc_root_chain"); in doInitialization()
213 if (!Head) { in doInitialization()
216 Head = new GlobalVariable( in doInitialization()
219 } else if (Head->hasExternalLinkage() && Head->isDeclaration()) { in doInitialization()
220 Head->setInitializer(Constant::getNullValue(StackEntryPtrTy)); in doInitialization()
221 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()
|
| D | MachineRegisterInfo.cpp | 268 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 …]
|
| /openbsd/src/gnu/llvm/llvm/lib/Target/AArch64/ |
| D | AArch64ConditionalCompares.cpp | 147 MachineBasicBlock *Head; member in __anon798947310111::SSACCmpConv
224 if (MBB == Head) { in trivialTailPHIs()
438 Head = MBB; in canConvert()
441 if (Head->succ_size() != 2) in canConvert()
443 MachineBasicBlock *Succ0 = Head->succ_begin()[0]; in canConvert()
444 MachineBasicBlock *Succ1 = Head->succ_begin()[1]; in canConvert()
461 LLVM_DEBUG(dbgs() << "\nTriangle: " << printMBBReference(*Head) << " -> " in canConvert()
501 if (TII->analyzeBranch(*Head, TBB, FBB, HeadCond)) { in canConvert()
570 << printMBBReference(*Head) << ":\n" in convert()
579 BranchProbability Head2CmpBB = MBPI->getEdgeProbability(Head, CmpBB); in convert()
[all …]
|
| /openbsd/src/gnu/llvm/llvm/include/llvm/CodeGen/ |
| D | ScoreboardHazardRecognizer.h | 48 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()
|
| /openbsd/src/gnu/llvm/llvm/include/llvm/Support/ |
| D | Automaton.h | 98 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()
|
| D | Registry.h | 56 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; \
|
| /openbsd/src/gnu/usr.bin/perl/ext/Pod-Html/t/ |
| D | feature2.t | 75 <li><a href="#Head-1">Head 1</a></li>
76 <li><a href="#Another-Head-1">Another Head 1</a></li>
79 <a href="#_podtop_"><h1 id="Head-1">Head 1</h1></a>
89 <a href="#_podtop_"><h1 id="Another-Head-1">Another Head 1</h1></a>
|
| D | htmldir4.t | 87 <p><a href="t/feature.html#Another-Head-1">"Another Head 1" in feature</a>,</p>
89 <p>and another <a href="t/feature.html#Another-Head-1">"Another Head 1" in feature</a>.</…
|
| D | feature.t | 66 <a href="#_podtop_"><h1 id="Head-1">Head 1</h1></a>
76 <a href="#_podtop_"><h1 id="Another-Head-1">Another Head 1</h1></a>
|
| D | htmldir5.t | 76 <p><a href="./feature.html#Another-Head-1">"Another Head 1" in feature</a>,</p>
78 <p>and another <a href="./feature.html#Another-Head-1">"Another Head 1" in feature</a>.</…
|
| D | htmldir2.t | 96 <p><a href="/t/feature.html#Another-Head-1">"Another Head 1" in feature</a>,</p>
98 <p>and another <a href="/t/feature.html#Another-Head-1">"Another Head 1" in feature</a>.<…
|
| D | htmldir1.t | 93 <p><a href="/[RELCURRENTWORKINGDIRECTORY]/t/feature.html#Another-Head-1">"Another Head 1"…
95 … <a href="/[RELCURRENTWORKINGDIRECTORY]/t/feature.html#Another-Head-1">"Another Head 1" …
|
| D | feature.pod | 1 =head1 Head 1
17 =head1 Another Head 1
|
| /openbsd/src/gnu/llvm/llvm/tools/llvm-cxxfilt/ |
| D | llvm-cxxfilt.cpp | 106 const auto Head = Source.begin(); in SplitStringDelims() local
109 auto Start = std::find_if(Head, Source.end(), IsLegalChar); in SplitStringDelims()
110 if (Start != Head) in SplitStringDelims()
111 OutFragments.push_back({"", Source.slice(0, Start - Head)}); in SplitStringDelims()
118 OutFragments.push_back({Source.slice(Start - Head, End - Head), in SplitStringDelims()
119 Source.slice(End - Head, DEnd - Head)}); in SplitStringDelims()
|
| /openbsd/src/gnu/gcc/libstdc++-v3/include/ext/pb_ds/detail/pat_trie_/ |
| D | point_iterators.hpp | 62 Head, \
72 Head, \
82 Head, \
92 Head, \
102 class Head,
127 Head>::other::pointer
360 class Head,
386 Head>::other::pointer
|
| D | node_iterators.hpp | 61 Head, \
72 Head, \
82 class Head,
259 class Head,
|
| /openbsd/src/gnu/llvm/llvm/lib/Support/ |
| D | OptimizedStructLayout.cpp | 245 OptimizedStructLayoutField *Head; in performOptimizedStructLayout() member
256 auto Head = I; in performOptimizedStructLayout() local
268 FlexibleFieldsByAlignment.push_back({MinSize, Head, Alignment}); in performOptimizedStructLayout()
282 assert(Queue.Head && "queue was empty"); in performOptimizedStructLayout()
284 for (auto I = Queue.Head; I; I = Queue.getNext(I)) { in performOptimizedStructLayout()
296 assert(Last ? Queue->getNext(Last) == Cur : Queue->Head == Cur); in performOptimizedStructLayout()
312 Queue->Head = NewHead; in performOptimizedStructLayout()
351 assert(Queue->Head); in performOptimizedStructLayout()
364 for (Field *Cur = Queue->Head, *Last = nullptr; true; in performOptimizedStructLayout()
|
| D | PrettyStackTrace.cpp | 72 PrettyStackTraceEntry *ReverseStackTrace(PrettyStackTraceEntry *Head) { in ReverseStackTrace() argument
74 while (Head) in ReverseStackTrace()
75 std::tie(Prev, Head, Head->NextEntry) = in ReverseStackTrace()
76 std::make_tuple(Head, Head->NextEntry, Prev); in ReverseStackTrace()
|
| /openbsd/src/gnu/llvm/llvm/include/llvm/ADT/ |
| D | ImmutableList.h | 31 T Head; variable
36 : Head(std::forward<ElemT>(head)), Tail(tail) {} in Head() function
42 const T& getHead() const { return Head; } in getHead()
52 Profile(ID, Head, Tail); in Profile()
177 [[nodiscard]] ImmutableList<T> concat(ElemT &&Head, ImmutableList<T> Tail) { in concat() argument
183 ListTy::Profile(ID, Head, TailImpl); in concat()
190 new (L) ListTy(std::forward<ElemT>(Head), TailImpl); in concat()
|
| D | BreadthFirstIterator.h | 81 std::optional<QueueElement> Head = VisitQueue.front(); in toNext() local
82 QueueElement H = *Head; in toNext()
99 Head = VisitQueue.front(); in toNext()
100 if (Head != std::nullopt) in toNext()
|
| /openbsd/src/gnu/llvm/lldb/include/lldb/Utility/ |
| D | Instrumentation.h | 58 template <typename Head>
59 inline void stringify_helper(llvm::raw_string_ostream &ss, const Head &head) { in stringify_helper()
63 template <typename Head, typename... Tail>
64 inline void stringify_helper(llvm::raw_string_ostream &ss, const Head &head, in stringify_helper()
|
| /openbsd/src/gnu/llvm/llvm/include/llvm/Analysis/ |
| D | MustExecute.h | 288 CurInst(Other.CurInst), Head(Other.Head), Tail(Other.Tail) {} in MustBeExecutedIterator()
294 std::swap(Head, Other.Head);
319 return CurInst == Other.CurInst && Head == Other.Head && Tail == Other.Tail;
371 const Instruction *Head, *Tail; member
|