/external/clang/test/CXX/temp/temp.decls/temp.variadic/ |
H A D | p2.cpp | 12 template<typename Head, typename ...Tail> 13 void recurse_until_fail(const Head &, const Tail &...tail) { // expected-note{{candidate function template not viable: requires at least 1 argument, but 0 were provided}}
|
H A D | partial-ordering.cpp | 12 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 D | example-tuple.cpp | 59 template<typename Head, typename... Tail> 60 class tuple<Head, Tail...> : private tuple<Tail...> { 68 tuple(typename add_const_reference<Head>::type v, 83 typename add_reference<Head>::type head() { return m_head; } 84 typename add_reference<const Head>::type head() const { return m_head; } 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, Tai [all...] |
H A D | example-bind.cpp | 59 template<typename Head, typename... Tail> 60 class tuple<Head, Tail...> : private tuple<Tail...> { 68 tuple(typename add_const_reference<Head>::type v, 83 typename add_reference<Head>::type head() { return m_head; } 84 typename add_reference<const Head>::type head() const { return m_head; } 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, Tai [all...] |
/external/llvm/include/llvm/CodeGen/ |
H A D | ScoreboardHazardRecognizer.h | 35 // indicated by Head. 48 size_t Head; member in class:llvm::ScoreboardHazardRecognizer::Scoreboard 50 Scoreboard():Data(NULL), Depth(0), Head(0) { } 61 return Data[(Head + idx) & (Depth-1)]; 71 Head = 0; 75 Head = (Head + 1) & (Depth-1); 79 Head = (Head - 1) & (Depth-1);
|
/external/clang/test/SemaTemplate/ |
H A D | example-typelist.cpp | 7 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;
|
/external/skia/legacy/include/core/ |
H A D | SkDeque.h | 43 struct Head; 59 SkDeque::Head* fHead; 65 Head* fFront; 66 Head* fBack;
|
/external/skia/legacy/src/core/ |
H A D | SkDeque.cpp | 14 struct SkDeque::Head { struct in class:SkDeque 15 Head* fNext; 16 Head* fPrev; 40 if (storageSize >= sizeof(Head) + elemSize) { 41 fFront = (Head*)storage; 50 Head* head = fFront; 51 Head* initialHead = (Head*)fInitialStorage; 54 Head* next = head->fNext; 63 Head* fron [all...] |
/external/clang/test/CXX/temp/temp.fct.spec/temp.arg.explicit/ |
H A D | p9-0x.cpp | 7 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;
|
H A D | p3-0x.cpp | 7 template<typename Head, typename ...Tail> 8 struct count<Head, Tail...> {
|
/external/mdnsresponder/mDNSShared/ |
H A D | GenLinkedList.c | 40 pList->Head = NULL; 52 pList->Head = elem; 62 ASSIGNLINK( elem, pList->Head, pList->LinkOffset); 66 pList->Head = elem; 76 for ( iElem = pList->Head, lastElem = NULL; iElem; iElem = GETLINK( iElem, pList->LinkOffset)) { 81 pList->Head = GETLINK( elem, pList->LinkOffset); 103 for ( iElem = pList->Head, lastElem = NULL; iElem; iElem = GETLINK( iElem, pList->LinkOffset)) 114 pList->Head = newElem; 133 pList->Head = NULL; 145 pNext = pList->Head; [all...] |
H A D | GenLinkedList.h | 27 void *Head, member in struct:GenLinkedList 47 void *Head, member in struct:GenDoubleLinkedList 69 size_t Head, member in struct:GenLinkedOffsetList
|
/external/llvm/lib/CodeGen/ |
H A D | EarlyIfConversion.cpp | 68 // Triangle: Head Diamond: Head 77 // Head block, and phis in the Tail block are converted to select instructions. 87 MachineBasicBlock *Head; member in class:__anon9453::SSAIfConv 103 MachineBasicBlock *getTPred() const { return TBB == Tail ? Head : TBB; } 106 MachineBasicBlock *getFPred() const { return FBB == Tail ? Head : FBB; } 125 /// Instructions in Head that define values used by the conditional blocks. 135 /// Insertion point in Head for speculatively executed instructions form TBB 143 /// Find a valid insertion point in Head. 227 // Check for any dependencies on Head instruction [all...] |
H A D | MachineRegisterInfo.cpp | 120 MachineOperand *const Head = HeadRef; local 122 // Head points to the first list element. 124 // Prev pointers are circular, so Head->Prev == Last. 126 // Head is NULL for an empty list. 127 if (!Head) { 133 assert(MO->getReg() == Head->getReg() && "Different regs on the same list!"); 135 // Insert MO between Last and Head in the circular Prev chain. 136 MachineOperand *Last = Head->Contents.Reg.Prev; 139 Head->Contents.Reg.Prev = MO; 146 MO->Contents.Reg.Next = Head; 159 MachineOperand *const Head = HeadRef; local 204 MachineOperand *&Head = getRegUseDefListHead(Src->getReg()); local [all...] |
/external/clang/lib/Analysis/ |
H A D | PseudoConstantAnalysis.cpp | 85 const Stmt *Head = WorkList.front(); local 88 if (const Expr *Ex = dyn_cast<Expr>(Head)) 89 Head = Ex->IgnoreParenCasts(); 91 switch (Head->getStmtClass()) { 94 const BinaryOperator *BO = cast<BinaryOperator>(Head); 139 const UnaryOperator *UO = cast<UnaryOperator>(Head); 172 const DeclStmt *DS = cast<DeclStmt>(Head); 202 const DeclRefExpr *DR = cast<DeclRefExpr>(Head); 213 const BlockExpr *B = cast<BlockExpr>(Head); 224 for (Stmt::const_child_range I = Head [all...] |
/external/llvm/include/llvm/ADT/ |
H A D | ilist.h | 73 /// strategy. The sentinel is stored in the prev field of ilist's Head. 84 /// value for its Head 88 /// ensureHead - make sure that Head is either already 91 static NodeTy *ensureHead(NodeTy *&Head) { argument 92 if (!Head) { 93 Head = ilist_traits<NodeTy>::createSentinel(); 94 ilist_traits<NodeTy>::noteHead(Head, Head); 95 ilist_traits<NodeTy>::setNext(Head, 0); 96 return Head; 314 mutable NodeTy *Head; member in class:llvm::iplist [all...] |
/external/skia/legacy/src/images/ |
H A D | SkImageDecoder_Factory.cpp | 27 const DecodeReg* curr = DecodeReg::Head(); 53 const MovieReg* curr = MovieReg::Head();
|
H A D | SkImageEncoder_Factory.cpp | 24 const EncodeReg* curr = EncodeReg::Head();
|
/external/skia/src/images/ |
H A D | SkImageDecoder_Factory.cpp | 27 const DecodeReg* curr = DecodeReg::Head(); 53 const MovieReg* curr = MovieReg::Head();
|
H A D | SkImageEncoder_Factory.cpp | 24 const EncodeReg* curr = EncodeReg::Head();
|
/external/clang/test/CXX/temp/temp.fct.spec/temp.deduct/temp.deduct.call/ |
H A D | p1-0x.cpp | 6 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;
|
/external/clang/test/CodeGenCXX/ |
H A D | debug-info-use-after-free.cpp | 8 typedef T1 Head; typedef in struct:Types1 21 typedef TemplateSel < T1 > Head; typedef in struct:Templates2 40 typedef typename Types::Head Type; 49 typedef typename Tests::Head Head; typedef 50 TypeParameterizedTest < Fixture, Head, Types >::Register;
|
/external/llvm/include/llvm/Analysis/ |
H A D | BlockFrequencyImpl.h | 221 void doLoop(BlockT *Head, BlockT *Tail) { argument 222 DEBUG(dbgs() << "doLoop(" << getBlockName(Head) << ", " 227 for (rpot_iterator I = rpot_at(Head), E = rpot_at(Tail); ; ++I) { 229 doBlock(BB, Head, BlocksInLoop); 238 PI = GraphTraits< Inverse<BlockT *> >::child_begin(Head), 239 PE = GraphTraits< Inverse<BlockT *> >::child_end(Head); 243 if (isReachable(Pred) && isBackedge(Pred, Head)) { 244 uint64_t N = getEdgeFreq(Pred, Head).getFrequency(); 245 uint64_t D = getBlockFreq(Head).getFrequency(); 250 CycleProb[Head] [all...] |
/external/clang/lib/Sema/ |
H A D | AttributeList.cpp | 81 if (!Head) { 82 Head = pool; 90 pool->NextInPool = Head; 91 Head = pool;
|
/external/chromium/testing/gtest/samples/ |
H A D | sample3_unittest.cc | 105 for ( const QueueNode<int> * n1 = q->Head(), * n2 = new_q->Head();
|