Home
last modified time | relevance | path

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

123456

/external/llvm/lib/CodeGen/
DEarlyIfConversion.cpp91 MachineBasicBlock *Tail; member in __anon9ba1b0650111::SSAIfConv
101 bool isTriangle() const { return TBB == Tail || FBB == Tail; } in isTriangle()
104 MachineBasicBlock *getTPred() const { return TBB == Tail ? Head : TBB; } in getTPred()
107 MachineBasicBlock *getFPred() const { return FBB == Tail ? Head : FBB; } in getFPred()
342 TBB = FBB = Tail = nullptr; in canConvertIf()
356 Tail = Succ0->succ_begin()[0]; in canConvertIf()
359 if (Tail != Succ1) { in canConvertIf()
362 Succ1->succ_begin()[0] != Tail) in canConvertIf()
367 << " -> BB#" << Tail->getNumber() << '\n'); in canConvertIf()
370 if (!Tail->livein_empty()) { in canConvertIf()
[all …]
/external/mdnsresponder/mDNSShared/
DGenLinkedList.c41 pList->Tail = NULL; in InitLinkedList()
49 if ( pList->Tail) { in AddToTail()
50 ASSIGNLINK( pList->Tail, elem, pList->LinkOffset); in AddToTail()
55 pList->Tail = elem; in AddToTail()
63 if ( pList->Tail == NULL) in AddToHead()
64 pList->Tail = elem; in AddToHead()
83 if ( pList->Tail == elem) in RemoveFromList()
84 pList->Tail = lastElem ? lastElem : NULL; in RemoveFromList()
116 if ( pList->Tail == elemInList) in ReplaceElem()
117 pList->Tail = newElem; in ReplaceElem()
[all …]
DGenLinkedList.h28 *Tail; member
48 *Tail; member
70 Tail; member
/external/clang/test/SemaTemplate/
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;
Ddeduction.cpp243 template <int i, typename Head, typename... Tail>
244 struct tup_impl<i, Head, Tail...> : tup_impl<i + 1, Tail...> {
251 template <typename Head, int i, typename... Tail>
252 Head &get_helper(tup_impl<i, Head, Tail...> &t) { in get_helper()
256 template <typename Head, int i, typename... Tail>
257 Head const &get_helper(tup_impl<i, Head, Tail...> const &t) { in get_helper()
/external/eigen/unsupported/Eigen/CXX11/src/util/
DEmulateCXX11Meta.h27 template<typename T, typename Tail=empty_list> struct type_list {
29 typedef Tail TailType;
31 static const Tail tail;
32 static const std::size_t count = 1 + Tail::count;
53 template <class Head, class Tail>
54 struct get_type<0, type_list<Head, Tail> >
59 template <std::size_t i, class Head, class Tail>
60 struct get_type<i, type_list<Head, Tail> >
62 typedef typename get_type<i-1, Tail>::type type;
139 template <class Head, class Tail>
[all …]
/external/clang/test/CXX/temp/temp.decls/temp.variadic/
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&...> > {
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...> > {
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...> > {
Dmetafunctions.cpp20 template<typename Head, typename ...Tail>
22 static const unsigned value = 1 + count<Tail...>::value;
38 template<typename Head, typename ...Tail>
39 struct count<Head, Tail...> {
40 static const unsigned value = 1 + count<Tail...>::value;
Dp2.cpp12 template<typename Head, typename ...Tail>
13 void recurse_until_fail(const Head &, const Tail &...tail) { // expected-note{{candidate function t… in recurse_until_fail()
/external/boringssl/mac-x86/crypto/fipsmodule/
Dbn-586.S202 # Tail Round 0
213 # Tail Round 1
224 # Tail Round 2
235 # Tail Round 3
246 # Tail Round 4
257 # Tail Round 5
268 # Tail Round 6
398 # Tail Round 0
407 # Tail Round 1
416 # Tail Round 2
[all …]
/external/clang/lib/Format/
DEncoding.h84 StringRef Tail = Text; in columnWidthWithTabs() local
86 StringRef::size_type TabPos = Tail.find('\t'); in columnWidthWithTabs()
88 return TotalWidth + columnWidth(Tail, Encoding); in columnWidthWithTabs()
89 TotalWidth += columnWidth(Tail.substr(0, TabPos), Encoding); in columnWidthWithTabs()
91 Tail = Tail.substr(TabPos + 1); in columnWidthWithTabs()
/external/clang/test/CXX/temp/temp.fct.spec/temp.arg.explicit/
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...> {
Dp3-0x.cpp7 template<typename Head, typename ...Tail>
8 struct count<Head, Tail...> {
9 static const unsigned value = 1 + count<Tail...>::value;
/external/boringssl/win-x86/crypto/fipsmodule/
Dbn-586.asm213 ; Tail Round 0
224 ; Tail Round 1
235 ; Tail Round 2
246 ; Tail Round 3
257 ; Tail Round 4
268 ; Tail Round 5
279 ; Tail Round 6
405 ; Tail Round 0
414 ; Tail Round 1
423 ; Tail Round 2
[all …]
/external/clang/test/CXX/temp/temp.fct.spec/temp.deduct/temp.deduct.call/
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...> {
/external/llvm/include/llvm/Support/
DRegistry.h56 static node *Head, *Tail; variable
73 if (Tail) in add_node()
74 Tail->Next = N; in add_node()
77 Tail = N; in add_node()
151 static std::pair<const node *, const node *> Info(Head, Tail); in exportRegistry()
163 typename Registry<T>::node *Registry<T>::Tail;
/external/llvm/test/Transforms/Util/MemorySSA/
Dmultiple-backedges-hal.ll45 ; CHECK: 5 = MemoryPhi({Entry,1},{InnerLoop.Tail,3})
65 br i1 %KeepGoing, label %InnerLoop.Tail, label %InnerLoop
67 InnerLoop.Tail:
68 %KeepGoing.Tail = call i1 @getBool()
69 br i1 %KeepGoing.Tail, label %End, label %OuterLoop
/external/swiftshader/third_party/LLVM/include/llvm/ADT/
DImmutableList.h29 const ImmutableListImpl* Tail; variable
32 : Head(head), Tail(tail) {} in Head()
42 const ImmutableListImpl* getTail() const { return Tail; } in getTail()
51 Profile(ID, Head, Tail); in Profile()
167 ImmutableList<T> concat(const T& Head, ImmutableList<T> Tail) { in concat() argument
172 const ListTy* TailImpl = Tail.getInternalPointer(); in concat()
/external/llvm/include/llvm/ADT/
DImmutableList.h29 const ImmutableListImpl* Tail; variable
32 : Head(head), Tail(tail) {} in Head()
41 const ImmutableListImpl* getTail() const { return Tail; } in getTail()
50 Profile(ID, Head, Tail); in Profile()
166 ImmutableList<T> concat(const T& Head, ImmutableList<T> Tail) { in concat() argument
171 const ListTy* TailImpl = Tail.getInternalPointer(); in concat()
/external/swiftshader/third_party/LLVM/include/llvm/Support/
DRegistry.h74 static node *Head, *Tail; variable
90 if (Tail) in node()
91 Tail->Next = this; in node()
94 Tail = this; in node()
213 typename Registry<T,U>::node *Registry<T,U>::Tail;
/external/libchrome/base/memory/
Draw_scoped_refptr_mismatch_checker.h48 template <typename Head, typename... Tail>
49 struct ParamsUseScopedRefptrCorrectly<std::tuple<Head, Tail...>> {
51 ParamsUseScopedRefptrCorrectly<std::tuple<Tail...>>::value };
/external/llvm/lib/Target/AArch64/
DAArch64ConditionalCompares.cpp152 MachineBasicBlock *Tail; member in __anon5a9d51740111::SSACCmpConv
213 for (auto &I : *Tail) { in trivialTailPHIs()
239 for (auto &I : *Tail) { in updateTailPHIs()
435 Tail = CmpBB = nullptr; in canConvert()
451 Tail = Succ1; in canConvert()
453 if (!CmpBB->isSuccessor(Tail)) in canConvert()
458 << CmpBB->getNumber() << " -> BB#" << Tail->getNumber() << '\n'); in canConvert()
473 if (!Tail->livein_empty()) { in canConvert()
518 assert(TBB == Tail && "Unexpected TBB"); in canConvert()
542 if (TBB != Tail) in canConvert()
[all …]
/external/llvm/lib/Transforms/Utils/
DBasicBlockUtils.cpp620 BasicBlock *Tail = Head->splitBasicBlock(SplitBefore->getIterator()); in SplitBlockAndInsertIfThen() local
623 BasicBlock *ThenBlock = BasicBlock::Create(C, "", Head->getParent(), Tail); in SplitBlockAndInsertIfThen()
628 CheckTerm = BranchInst::Create(Tail, ThenBlock); in SplitBlockAndInsertIfThen()
631 BranchInst::Create(/*ifTrue*/ThenBlock, /*ifFalse*/Tail, Cond); in SplitBlockAndInsertIfThen()
639 DomTreeNode *NewNode = DT->addNewBlock(Tail, Head); in SplitBlockAndInsertIfThen()
651 L->addBasicBlockToLoop(Tail, *LI); in SplitBlockAndInsertIfThen()
662 BasicBlock *Tail = Head->splitBasicBlock(SplitBefore->getIterator()); in SplitBlockAndInsertIfThenElse() local
665 BasicBlock *ThenBlock = BasicBlock::Create(C, "", Head->getParent(), Tail); in SplitBlockAndInsertIfThenElse()
666 BasicBlock *ElseBlock = BasicBlock::Create(C, "", Head->getParent(), Tail); in SplitBlockAndInsertIfThenElse()
667 *ThenTerm = BranchInst::Create(Tail, ThenBlock); in SplitBlockAndInsertIfThenElse()
[all …]

123456