Home
last modified time | relevance | path

Searched refs:Tail (Results 1 – 25 of 151) sorted by relevance

1234567

/llvm-project-15.0.7/compiler-rt/lib/xray/
H A Dxray_segmented_array.h166 Segment *Tail; variable
272 Tail = S; in InitHeadAndTail()
287 S->Prev = Tail; in AppendNewSegment()
288 Tail->Next = S; in AppendNewSegment()
289 Tail = S; in AppendNewSegment()
314 Tail(O.Tail), in Array()
329 Tail = O.Tail;
561 Tail = SPT; in trim()
597 auto ST = Tail; in trim()
602 Tail = SPT; in trim()
[all …]
/llvm-project-15.0.7/llvm/test/Transforms/CallSiteSplitting/
H A Dcallsite-split-or-phi.ll29 Tail:
59 Tail:
88 Tail:
113 Tail:
143 Tail:
168 Tail:
198 Tail:
225 Tail:
255 Tail:
280 Tail:
[all …]
H A Dcallsite-no-or-structure.ll13 ; CHECK-LABEL: Tail
18 br i1 undef, label %Tail, label %End
22 br i1 %cmp, label %Tail, label %End
24 Tail:
41 ; CHECK-LABEL: Tail
55 br i1 %cmp2, label %Tail, label %End
57 Tail:
74 ; CHECK-LABEL: Tail
90 Tail:
109 ; CHECK-LABEL: Tail
[all …]
H A Dmusttail.ll15 br i1 %c, label %Tail, label %TBB
18 br i1 %c2, label %Tail, label %End
19 Tail:
41 br i1 %c, label %Tail, label %TBB
44 br i1 %c2, label %Tail, label %End
45 Tail:
62 br i1 %c, label %Tail, label %TBB
65 br i1 %c2, label %Tail, label %End
66 Tail:
98 br i1 %cond3, label %Tail, label %End
[all …]
H A Dcallsite-no-splitting.ll10 ; CHECK: br i1 %cmp, label %Tail, label %Tail
14 br i1 %cmp, label %Tail, label %Tail
15 Tail:
/llvm-project-15.0.7/llvm/lib/CodeGen/
H A DEarlyIfConversion.cpp102 bool isTriangle() const { return TBB == Tail || FBB == Tail; } in isTriangle()
451 if (Tail != Succ1) { in canConvertIf()
475 if (!Predicate && (Tail->empty() || !Tail->front().isPHI())) { in canConvertIf()
508 for (MachineBasicBlock::iterator I = Tail->begin(), E = Tail->end(); in canConvertIf()
690 if (TBB != Tail) { in convertIf()
695 if (FBB != Tail) { in convertIf()
710 if (TBB != Tail) in convertIf()
712 if (FBB != Tail) in convertIf()
722 if (TBB != Tail) { in convertIf()
726 if (FBB != Tail) { in convertIf()
[all …]
/llvm-project-15.0.7/clang/test/SemaTemplate/
H A Dexample-typelist.cpp7 template<typename Head, typename Tail = nil>
10 typedef Tail tail;
27 template<typename Head, typename Tail>
28 struct length<cons<Head, Tail> > {
29 static const unsigned value = length<Tail>::value + 1;
85 template<typename Tail, typename T>
86 struct find<cons<T, Tail>, T> {
87 typedef cons<T, Tail> type;
/llvm-project-15.0.7/bolt/lib/Passes/
H A DTailDuplication.cpp279 if (isInCacheLine(BB, Tail)) in moderateDuplicate()
285 for (auto Itr = Tail.succ_begin(); Itr != Tail.succ_end(); ++Itr) { in moderateDuplicate()
290 BlocksToDuplicate.push_back(&Tail); in moderateDuplicate()
302 if (isInCacheLine(BB, Tail)) in aggressiveDuplicate()
366 if (Pred == Tail) in shouldDuplicate()
369 if (Tail->succ_size() != 0) in shouldDuplicate()
377 if (Tail->hasJumpTable()) in shouldDuplicate()
431 Addr += BBSize[Tail]; in cacheScoreImproved()
482 BlocksToDuplicate.push_back(Tail); in cacheDuplicate()
497 BlocksToDuplicate.push_back(Tail); in cacheDuplicate()
[all …]
/llvm-project-15.0.7/llvm/lib/Target/RISCV/
H A DRISCVMergeBaseOffset.cpp121 DeadInstrs.insert(&Tail); in foldOffset()
122 MRI->replaceRegWith(Tail.getOperand(0).getReg(), in foldOffset()
261 switch (Tail.getOpcode()) { in detectAndFoldOffset()
264 << Tail); in detectAndFoldOffset()
268 int64_t Offset = Tail.getOperand(2).getImm(); in detectAndFoldOffset()
277 DeadInstrs.insert(&Tail); in detectAndFoldOffset()
284 foldOffset(HiLUI, LoADDI, Tail, Offset); in detectAndFoldOffset()
297 if (!matchLargeOffset(Tail, DestReg, Offset)) in detectAndFoldOffset()
299 foldOffset(HiLUI, LoADDI, Tail, Offset); in detectAndFoldOffset()
309 if (!matchShiftedOffset(Tail, DestReg, Offset)) in detectAndFoldOffset()
[all …]
/llvm-project-15.0.7/clang/test/CXX/temp/temp.decls/temp.variadic/
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&...> > {
H A Dexample-tuple.cpp59 template<typename Head, typename... Tail>
60 class tuple<Head, Tail...> : private tuple<Tail...> {
61 typedef tuple<Tail...> inherited;
69 typename add_const_reference<Tail>::type... vtail) in tuple()
157 template<int I, typename Head, typename... Tail>
158 struct tuple_element<I, tuple<Head, Tail...> > {
159 typedef typename tuple_element<I-1, tuple<Tail...> >::type type;
162 template<typename Head, typename... Tail>
163 struct tuple_element<0, tuple<Head, Tail...> > {
H A Dexample-bind.cpp59 template<typename Head, typename... Tail>
60 class tuple<Head, Tail...> : private tuple<Tail...> {
61 typedef tuple<Tail...> inherited;
69 typename add_const_reference<Tail>::type... vtail) in tuple()
123 template<int I, typename Head, typename... Tail>
124 struct tuple_element<I, tuple<Head, Tail...> > {
125 typedef typename tuple_element<I-1, tuple<Tail...> >::type type;
128 template<typename Head, typename... Tail>
129 struct tuple_element<0, tuple<Head, Tail...> > {
/llvm-project-15.0.7/bolt/include/bolt/Passes/
H A DTailDuplication.h95 const BinaryBasicBlock &Tail) const;
103 bool shouldDuplicate(BinaryBasicBlock *BB, BinaryBasicBlock *Tail) const;
116 BinaryBasicBlock *Pred, BinaryBasicBlock *Tail) const;
122 moderateDuplicate(BinaryBasicBlock &BB, BinaryBasicBlock &Tail) const;
126 aggressiveDuplicate(BinaryBasicBlock &BB, BinaryBasicBlock &Tail) const;
132 BinaryBasicBlock *Tail) const;
/llvm-project-15.0.7/clang/lib/Format/
H A DEncoding.h64 StringRef Tail = Text; in columnWidthWithTabs() local
66 StringRef::size_type TabPos = Tail.find('\t'); in columnWidthWithTabs()
68 return TotalWidth + columnWidth(Tail, Encoding); in columnWidthWithTabs()
69 TotalWidth += columnWidth(Tail.substr(0, TabPos), Encoding); in columnWidthWithTabs()
72 Tail = Tail.substr(TabPos + 1); in columnWidthWithTabs()
/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...> {
H A Dp3-0x.cpp7 template<typename Head, typename ...Tail>
8 struct count<Head, Tail...> {
9 static const unsigned value = 1 + count<Tail...>::value;
/llvm-project-15.0.7/llvm/include/llvm/ADT/
H A DImmutableList.h32 const ImmutableListImpl* Tail; variable
36 : Head(std::forward<ElemT>(head)), Tail(tail) {} in Head()
43 const ImmutableListImpl* getTail() const { return Tail; } in getTail()
52 Profile(ID, Head, Tail); in Profile()
177 LLVM_NODISCARD ImmutableList<T> concat(ElemT &&Head, ImmutableList<T> Tail) { in concat() argument
182 const ListTy* TailImpl = Tail.getInternalPointer(); in concat()
205 LLVM_NODISCARD ImmutableList<T> emplace(ImmutableList<T> Tail, in emplace() argument
207 return concat(T(std::forward<CtorArgs>(Args)...), Tail); in emplace()
/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>
35 const Tail&... tail) { in join_impl()
/llvm-project-15.0.7/llvm/include/llvm/Support/
H A DRegistry.h56 static node *Head, *Tail; variable
140 template<typename T> typename Registry<T>::node *Registry<T>::Tail = nullptr;\
143 if (Tail) \
144 Tail->Next = N; \
147 Tail = N; \
153 template REGISTRY_CLASS::node *Registry<REGISTRY_CLASS::type>::Tail; \
/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...> {
/llvm-project-15.0.7/llvm/test/Analysis/MemorySSA/
H A Dmultiple-backedges-hal.ll44 ; CHECK: 5 = MemoryPhi({Entry,1},{InnerLoop.Tail,3})
64 br i1 %KeepGoing, label %InnerLoop.Tail, label %InnerLoop
66 InnerLoop.Tail:
67 %KeepGoing.Tail = call i1 @getBool()
68 br i1 %KeepGoing.Tail, label %End, label %OuterLoop
/llvm-project-15.0.7/libc/src/string/memory_utils/
H A Delements.h156 template <typename Head, typename... Tail> struct Chained<Head, Tail...> {
257 template <typename T> struct Tail {
292 Tail<T>::copy(dst, src, size);
296 const size_t offset = Tail<T>::offset(size);
306 return Tail<T>::equals(lhs, rhs, size);
312 return Tail<T>::three_way_compare(lhs, rhs, size);
317 Tail<T>::splat_set(dst, value, size);
344 Tail<TailT>::copy(dst, src, size);
362 const size_t tail_offset = Tail<T>::offset(size);
403 return Tail<TailT>::equals(lhs, rhs, size);
[all …]
/llvm-project-15.0.7/llvm/lib/Target/AArch64/
H A DAArch64ConditionalCompares.cpp154 MachineBasicBlock *Tail; member in __anoneb5605650111::SSACCmpConv
217 for (auto &I : *Tail) { in trivialTailPHIs()
243 for (auto &I : *Tail) { in updateTailPHIs()
440 Tail = CmpBB = nullptr; in canConvert()
456 Tail = Succ1; in canConvert()
458 if (!CmpBB->isSuccessor(Tail)) in canConvert()
464 << printMBBReference(*Tail) << '\n'); in canConvert()
479 if (!Tail->livein_empty()) { in canConvert()
525 assert(TBB == Tail && "Unexpected TBB"); in canConvert()
550 if (TBB != Tail) in canConvert()
[all …]
/llvm-project-15.0.7/llvm/include/llvm/Analysis/
H A DMustExecute.h288 CurInst(Other.CurInst), Head(Other.Head), Tail(Other.Tail) {} in MustBeExecutedIterator()
295 std::swap(Tail, Other.Tail);
319 return CurInst == Other.CurInst && Head == Other.Head && Tail == Other.Tail;
371 const Instruction *Head, *Tail; member
/llvm-project-15.0.7/clang-tools-extra/clangd/index/dex/
H A DTrigram.cpp52 NextTail = Roles[I] == Tail ? I : 0; in identifierTrigrams()
62 if (Roles[I] != Head && Roles[I] != Tail) in identifierTrigrams()
136 if (Roles[I] != Head && Roles[I] != Tail) in generateQueryTrigrams()
151 if (Roles[I] == Head || Roles[I] == Tail) in generateQueryTrigrams()

1234567