Home
last modified time | relevance | path

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

123

/llvm-project-15.0.7/llvm/include/llvm/Demangle/
H A DMicrosoftDemangle.h47 while (Head) { in ~ArenaAllocator()
51 delete Head; in ~ArenaAllocator() local
57 assert(Head && Head->Buf); in allocUnalignedBuffer()
59 uint8_t *P = Head->Buf + Head->Used; in allocUnalignedBuffer()
62 if (Head->Used <= Head->Capacity) in allocUnalignedBuffer()
72 assert(Head && Head->Buf); in allocArray()
74 size_t P = (size_t)Head->Buf + Head->Used; in allocArray()
81 if (Head->Used <= Head->Capacity) in allocArray()
91 assert(Head && Head->Buf); in alloc()
93 size_t P = (size_t)Head->Buf + Head->Used; in alloc()
[all …]
/llvm-project-15.0.7/clang/test/CXX/temp/temp.decls/temp.variadic/
H A Dexample-tuple.cpp59 template<typename Head, typename... Tail>
68 tuple(typename add_const_reference<Head>::type v, in tuple()
89 Head m_head;
157 template<int I, typename Head, typename... Tail>
158 struct tuple_element<I, tuple<Head, Tail...> > {
162 template<typename Head, typename... Tail>
163 struct tuple_element<0, tuple<Head, Tail...> > {
164 typedef Head type;
179 class get_impl<I, tuple<Head, Values...> > {
189 template<typename Head, typename... Values>
[all …]
H A Dexample-bind.cpp59 template<typename Head, typename... Tail>
68 tuple(typename add_const_reference<Head>::type v, in tuple()
89 Head m_head;
123 template<int I, typename Head, typename... Tail>
124 struct tuple_element<I, tuple<Head, Tail...> > {
128 template<typename Head, typename... Tail>
129 struct tuple_element<0, tuple<Head, Tail...> > {
130 typedef Head type;
136 class get_impl<I, tuple<Head, Values...> > {
146 template<typename Head, typename... Values>
[all …]
H A Dpartial-ordering.cpp12 template<typename Head, typename ...Tail>
13 struct X1<tuple<Head, Tail...> > {
17 template<typename Head, typename ...Tail>
18 struct X1<tuple<Head, Tail&...> > {
22 template<typename Head, typename ...Tail>
23 struct X1<tuple<Head&, Tail&...> > {
/llvm-project-15.0.7/compiler-rt/lib/xray/
H A Dxray_segmented_array.h165 Segment *Head; variable
271 Head = S; in InitHeadAndTail()
273 DCHECK_EQ(Head, Tail); in InitHeadAndTail()
313 Head(O.Head), in Array()
318 O.Head = &SentinelSegment; in Array()
327 Head = O.Head;
328 O.Head = &SentinelSegment;
354 DCHECK((Size == 0 && Head == &SentinelSegment && Head == Tail) || in AppendEmplace()
386 DCHECK((Size == 0 && Head == &SentinelSegment && Head == Tail) || in Append()
417 auto S = Head;
[all …]
/llvm-project-15.0.7/llvm/lib/CodeGen/
H A DEarlyIfConversion.cpp89 MachineBasicBlock *Head; member in __anon1f7aa2560111::SSAIfConv
433 Head = MBB; in canConvertIf()
436 if (Head->succ_size() != 2) in canConvertIf()
708 Head->removeSuccessor(TBB); in convertIf()
709 Head->removeSuccessor(FBB, true); in convertIf()
718 TII->removeBranch(*Head); in convertIf()
736 Head->splice(Head->end(), Tail, in convertIf()
746 Head->addSuccessor(Tail); in convertIf()
748 LLVM_DEBUG(dbgs() << *Head); in convertIf()
837 Traces->invalidate(IfConv.Head); in invalidateTraces()
[all …]
H A DShadowStackGCLowering.cpp55 GlobalVariable *Head = nullptr; member in __anon145b5fb10111::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.cpp266 MachineOperand *const Head = HeadRef; in addRegOperandToUseList() local
273 if (!Head) { in addRegOperandToUseList()
282 MachineOperand *Last = Head->Contents.Reg.Prev; in addRegOperandToUseList()
285 Head->Contents.Reg.Prev = MO; in addRegOperandToUseList()
292 MO->Contents.Reg.Next = Head; in addRegOperandToUseList()
305 MachineOperand *const Head = HeadRef; in removeRegOperandFromUseList() local
306 assert(Head && "List already empty"); in removeRegOperandFromUseList()
313 if (MO == Head) in removeRegOperandFromUseList()
318 (Next ? Next : Head)->Contents.Reg.Prev = Prev; in removeRegOperandFromUseList()
358 if (Src == Head) in moveOperands()
[all …]
/llvm-project-15.0.7/llvm/lib/Target/AArch64/
H A DAArch64ConditionalCompares.cpp148 MachineBasicBlock *Head; member in __anoneb5605650111::SSACCmpConv
225 if (MBB == Head) { in trivialTailPHIs()
439 Head = MBB; in canConvert()
442 if (Head->succ_size() != 2) in canConvert()
583 Head->removeSuccessor(CmpBB); in convert()
597 Head->setSuccProbability(Head->succ_begin(), in convert()
613 TII->removeBranch(*Head); in convert()
637 BuildMI(*Head, Head->end(), TermDL, MCID) in convert()
647 Head->splice(Head->end(), CmpBB, CmpBB->begin(), CmpBB->end()); in convert()
717 LLVM_DEBUG(dbgs() << "Result:\n" << *Head); in convert()
[all …]
/llvm-project-15.0.7/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()
/llvm-project-15.0.7/clang/test/SemaTemplate/
H A Dexample-typelist.cpp7 template<typename Head, typename Tail = nil>
9 typedef Head head;
27 template<typename Head, typename Tail>
28 struct length<cons<Head, Tail> > {
59 template<typename Head>
60 class reverse<cons<Head> > {
62 typedef cons<Head> type;
/llvm-project-15.0.7/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; \
/llvm-project-15.0.7/clang/test/CXX/temp/temp.fct.spec/temp.arg.explicit/
H A Dp9-0x.cpp7 template<unsigned N, typename Head, typename ...Tail>
8 struct get_nth_type<N, Head, Tail...> : get_nth_type<N-1, Tail...> { };
10 template<typename Head, typename ...Tail>
11 struct get_nth_type<0, Head, Tail...> {
12 typedef Head type;
/llvm-project-15.0.7/llvm/tools/llvm-cxxfilt/
H A Dllvm-cxxfilt.cpp101 const auto Head = Source.begin(); in SplitStringDelims() local
104 auto Start = std::find_if(Head, Source.end(), IsLegalChar); in SplitStringDelims()
105 if (Start != Head) in SplitStringDelims()
106 OutFragments.push_back({"", Source.slice(0, Start - Head)}); in SplitStringDelims()
113 OutFragments.push_back({Source.slice(Start - Head, End - Head), in SplitStringDelims()
114 Source.slice(End - Head, DEnd - Head)}); in SplitStringDelims()
/llvm-project-15.0.7/third-party/benchmark/src/
H A Dbenchmark_name.cc24 template <typename Head, typename... Tail>
25 size_t size_impl(const Head& head, const Tail&... tail) { in size_impl()
33 template <typename Head, typename... Tail>
34 void join_impl(std::string& s, const char delimiter, const Head& head, in join_impl()
/llvm-project-15.0.7/clang/test/CXX/temp/temp.fct.spec/temp.deduct/temp.deduct.call/
H A Dp1-0x.cpp6 template<unsigned N, typename Head, typename ...Tail>
7 struct get_nth_type<N, Head, Tail...> : get_nth_type<N-1, Tail...> { };
9 template<typename Head, typename ...Tail>
10 struct get_nth_type<0, Head, Tail...> {
11 typedef Head type;
/llvm-project-15.0.7/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()
363 for (Field *Cur = Queue->Head, *Last = nullptr; true; in performOptimizedStructLayout()
H A DPrettyStackTrace.cpp72 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()
/llvm-project-15.0.7/llvm/include/llvm/ADT/
H A DImmutableList.h31 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 LLVM_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()
/llvm-project-15.0.7/clang/test/CodeGenCXX/
H A Ddebug-info-use-after-free.cpp10 typedef T1 Head; typedef
23 typedef TemplateSel < T1 > Head; typedef
42 typedef typename Types::Head Type; in Register()
51 typedef typename Tests::Head Head; in Register() typedef
52 TypeParameterizedTest < Fixture, Head, Types >::Register; in Register()
/llvm-project-15.0.7/libc/src/string/memory_utils/
H A Delements.h156 template <typename Head, typename... Tail> struct Chained<Head, Tail...> {
160 Chained<Tail...>::copy(dst + Head::SIZE, src + Head::SIZE);
161 __llvm_libc::copy<Head>(dst, src);
165 const auto value = Head::load(src);
166 Chained<Tail...>::move(dst + Head::SIZE, src + Head::SIZE);
167 Head::store(dst, value);
171 if (!__llvm_libc::equals<Head>(lhs, rhs))
173 return Chained<Tail...>::equals(lhs + Head::SIZE, rhs + Head::SIZE);
177 if (__llvm_libc::equals<Head>(lhs, rhs))
184 Chained<Tail...>::splat_set(dst + Head::SIZE, value);
[all …]
/llvm-project-15.0.7/clang-tools-extra/clangd/index/dex/
H A DPostingList.cpp102 ((CurrentChunk + 1)->Head <= ID)) { in advanceToChunk()
105 [&](const Chunk &C) { return C.Head < ID; }); in advanceToChunk()
170 DocID Last = Result.back().Head = Documents.front(); in encodeStream()
175 Result.back().Head = Doc; in encodeStream()
204 llvm::SmallVector<DocID, Chunk::PayloadSize + 1> Result{Head}; in decompress()
207 for (DocID Current = Head; !Bytes.empty(); Current += Delta) { in decompress()
H A DTrigram.cpp53 if (Roles[I] == Head) { in identifierTrigrams()
62 if (Roles[I] != Head && Roles[I] != Tail) in identifierTrigrams()
88 if (Roles[Position] == Head) in identifierTrigrams()
136 if (Roles[I] != Head && Roles[I] != Tail) in generateQueryTrigrams()
151 if (Roles[I] == Head || Roles[I] == Tail) in generateQueryTrigrams()
/llvm-project-15.0.7/lldb/include/lldb/Utility/
H A DInstrumentation.h58 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()

123