| /freebsd/contrib/llvm-project/llvm/include/llvm/Demangle/ |
| H A D | MicrosoftDemangle.h | 39 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()
63 assert(Head && Head->Buf); in allocUnalignedBuffer()
65 uint8_t *P = Head->Buf + Head->Used; in allocUnalignedBuffer()
[all …]
|
| /freebsd/contrib/llvm-project/compiler-rt/lib/xray/ |
| H A D | xray_segmented_array.h | 164 Segment *Head; variable
262 DCHECK_EQ(Head, &SentinelSegment); in InitHeadAndTail()
270 Head = S; in InitHeadAndTail()
272 DCHECK_EQ(Head, Tail); in InitHeadAndTail()
297 Head(&SentinelSegment), in Array()
303 Head(&SentinelSegment), in Array()
312 Head(O.Head), in Array()
317 O.Head = &SentinelSegment; in Array()
326 Head = O.Head;
327 O.Head = &SentinelSegment;
[all …]
|
| /freebsd/contrib/llvm-project/llvm/lib/Target/AArch64/ |
| H A D | AArch64ConditionalCompares.cpp | 146 MachineBasicBlock *Head; member in __anon79d718350111::SSACCmpConv
223 if (MBB == Head) { in trivialTailPHIs()
437 Head = MBB; in canConvert()
440 if (Head->succ_size() != 2) in canConvert()
442 MachineBasicBlock *Succ0 = Head->succ_begin()[0]; in canConvert()
443 MachineBasicBlock *Succ1 = Head->succ_begin()[1]; in canConvert()
460 LLVM_DEBUG(dbgs() << "\nTriangle: " << printMBBReference(*Head) << " -> " in canConvert()
500 if (TII->analyzeBranch(*Head, TBB, FBB, HeadCond)) { in canConvert()
569 << printMBBReference(*Head) << ":\n" in convert()
578 BranchProbability Head2CmpBB = MBPI->getEdgeProbability(Head, CmpBB); in convert()
[all …]
|
| /freebsd/contrib/llvm-project/llvm/lib/CodeGen/ |
| H A D | EarlyIfConversion.cpp | 92 MachineBasicBlock *Head; member in __anon4c5015260111::SSAIfConv
108 MachineBasicBlock *getTPred() const { return TBB == Tail ? Head : TBB; } in getTPred()
111 MachineBasicBlock *getFPred() const { return FBB == Tail ? Head : FBB; } in getFPred()
279 if (!DefMI || DefMI->getParent() != Head) in InstrDependenciesAllowIfConv()
382 MachineBasicBlock::iterator FirstTerm = Head->getFirstTerminator(); in findInsertionPoint()
383 MachineBasicBlock::iterator I = Head->end(); in findInsertionPoint()
384 MachineBasicBlock::iterator B = Head->begin(); in findInsertionPoint()
446 Head = MBB; in canConvertIf()
449 if (Head->succ_size() != 2) in canConvertIf()
451 MachineBasicBlock *Succ0 = Head->succ_begin()[0]; in canConvertIf()
[all …]
|
| H A D | MachineRegisterInfo.cpp | 276 MachineOperand *const Head = HeadRef; in addRegOperandToUseList() local
283 if (!Head) { in addRegOperandToUseList()
289 assert(MO->getReg() == Head->getReg() && "Different regs on the same list!"); in addRegOperandToUseList()
292 MachineOperand *Last = Head->Contents.Reg.Prev; in addRegOperandToUseList()
295 Head->Contents.Reg.Prev = MO; in addRegOperandToUseList()
302 MO->Contents.Reg.Next = Head; in addRegOperandToUseList()
315 MachineOperand *const Head = HeadRef; in removeRegOperandFromUseList() local
316 assert(Head && "List already empty"); in removeRegOperandFromUseList()
323 if (MO == Head) in removeRegOperandFromUseList()
328 (Next ? Next : Head)->Contents.Reg.Prev = Prev; in removeRegOperandFromUseList()
[all …]
|
| H A D | ShadowStackGCLowering.cpp | 57 GlobalVariable *Head = nullptr; member in __anonc14dba810111::ShadowStackGCLoweringImpl
252 Head = M.getGlobalVariable("llvm_gc_root_chain"); in doInitialization()
253 if (!Head) { in doInitialization()
256 Head = new GlobalVariable( in doInitialization()
259 } else if (Head->hasExternalLinkage() && Head->isDeclaration()) { in doInitialization()
260 Head->setInitializer(Constant::getNullValue(StackEntryPtrTy)); in doInitialization()
261 Head->setLinkage(GlobalValue::LinkOnceAnyLinkage); in doInitialization()
362 AtEntry.CreateLoad(AtEntry.getPtrTy(), Head, "gc_currhead"); in runOnFunction()
393 AtEntry.CreateStore(NewHeadVal, Head); in runOnFunction()
405 AtExit->CreateStore(SavedHead, Head); in runOnFunction()
|
| /freebsd/contrib/llvm-project/llvm/include/llvm/CodeGen/ |
| H A D | ScoreboardHazardRecognizer.h | 48 size_t Head = 0; variable
65 return Data[(Head + idx) & (Depth-1)];
75 Head = 0;
79 Head = (Head + 1) & (Depth-1); in advance()
83 Head = (Head - 1) & (Depth-1); in recede()
|
| /freebsd/contrib/llvm-project/llvm/include/llvm/Support/ |
| H A D | Automaton.h | 96 PathSegment *Head = Heads[I]; in transition()
99 auto PI = lower_bound(Pairs, NfaStatePair{Head->State, 0ULL}); in transition()
100 auto PE = upper_bound(Pairs, NfaStatePair{Head->State, INT64_MAX}); in transition()
104 if (PI->FromDfaState == Head->State) in transition()
105 Heads.push_back(makePathSegment(PI->ToDfaState, Head)); in transition()
141 for (auto *Head : Heads) { in getPaths()
143 while (Head->State != 0) { in getPaths()
144 P.push_back(Head->State); in getPaths()
145 Head = Head in getPaths()
98 PathSegment *Head = Heads[I]; transition() local
[all...] |
| H A D | Registry.h | 61 static node *Head; variable
89 Head = N; in add_node()
110 static iterator begin() { return iterator(Head); } in begin()
147 typename Registry<T>::node *Registry<T>::Head = nullptr; \
156 typename Registry<T>::node *Registry<T>::Head = nullptr; \
|
| /freebsd/contrib/llvm-project/llvm/tools/llvm-cxxfilt/ |
| H A D | llvm-cxxfilt.cpp | 117 const auto Head = Source.begin(); in SplitStringDelims() local
120 auto Start = std::find_if(Head, Source.end(), IsLegalChar); in SplitStringDelims()
121 if (Start != Head) in SplitStringDelims()
122 OutFragments.push_back({"", Source.slice(0, Start - Head)}); in SplitStringDelims()
129 OutFragments.push_back({Source.slice(Start - Head, End - Head), in SplitStringDelims()
130 Source.slice(End - Head, DEnd - Head)}); in SplitStringDelims()
|
| /freebsd/contrib/llvm-project/llvm/lib/Support/ |
| H A 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()
|
| H A D | PrettyStackTrace.cpp | 71 PrettyStackTraceEntry *ReverseStackTrace(PrettyStackTraceEntry *Head) { in ReverseStackTrace() argument
73 while (Head) in ReverseStackTrace()
74 std::tie(Prev, Head, Head->NextEntry) = in ReverseStackTrace()
75 std::make_tuple(Head, Head->NextEntry, Prev); in ReverseStackTrace()
|
| /freebsd/contrib/llvm-project/llvm/include/llvm/ADT/ |
| H A 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()
|
| H A 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()
|
| /freebsd/contrib/llvm-project/lldb/include/lldb/Utility/ |
| H A D | Instrumentation.h | 56 template <typename Head>
57 inline void stringify_helper(llvm::raw_string_ostream &ss, const Head &head) { in stringify_helper()
61 template <typename Head, typename... Tail>
62 inline void stringify_helper(llvm::raw_string_ostream &ss, const Head &head, in stringify_helper()
|
| /freebsd/contrib/llvm-project/llvm/include/llvm/Analysis/ |
| H A D | MustExecute.h | 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
|
| /freebsd/contrib/googletest/googletest/include/gtest/internal/ |
| H A D | gtest-type-util.h | 164 using Head = TemplateSel<Head_>; member
170 using Head = TemplateSel<Head_>;
177 using Head = Head_;
183 using Head = Head_;
|
| /freebsd/contrib/llvm-project/libc/src/__support/CPP/type_traits/ |
| H A D | is_integral.h | 23 template <typename Head, typename... Args>
25 return (... || is_same_v<remove_cv_t<Head>, Args>); in __is_unqualified_any_of()
|
| H A D | is_floating_point.h | 23 template <typename Head, typename... Args>
25 return (... || is_same_v<remove_cv_t<Head>, Args>); in __is_unqualified_any_of()
|
| H A D | is_complex.h | 24 template <typename Head, typename... Args>
26 return (... || is_same_v<remove_cv_t<Head>, Args>); in __is_unqualified_any_of()
|
| H A D | is_fixed_point.h | 25 template <typename Head, typename... Args>
27 return (... || is_same_v<remove_cv_t<Head>, Args>); in __is_unqualified_any_of()
|
| H A D | is_signed.h | 31 template <typename Head, typename... Args>
33 return (... || is_same_v<remove_cv_t<Head>, Args>);
|
| /freebsd/sys/dev/pms/RefTisa/sallsdk/spc/ |
| H A D | sallist.h | 67 SALINK Head; /* allways one link to speed up insert and delete */ member
98 #define saLlistInitialize(pList) {(pList)->pHead = &((pList)->Head); \
104 #define saLlistIOInitialize(pList){(pList)->pHead = &((pList)->Head); \
|
| /freebsd/contrib/bmake/unit-tests/ |
| H A D | varmod-head.mk | 66 .if ${:U Head :Head=replaced} != "replaced"
|
| /freebsd/contrib/llvm-project/llvm/include/llvm/IR/ |
| H A D | IntrinsicsRISCVXTHead.td | 1 //===- IntrinsicsRISCVXTHead.td - T-Head intrinsics --------*- tablegen -*-===//
9 // This file defines all of the T-Head vendor intrinsics for RISC-V.
|