| /external/clang/test/CXX/temp/temp.decls/temp.variadic/ |
| 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}}
|
| 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&...> > {
|
| 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,
74 : m_head(other.head()), inherited(other.tail()) { }
78 m_head = other.head();
83 typename add_reference<Head>::type head() { return m_head; } function in class:tuple
84 typename add_reference<const Head>::type head() const { return m_head; } function in class:tuple
89 Head m_head
[all...] |
| 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,
74 : m_head(other.head()), inherited(other.tail()) { }
78 m_head = other.head();
83 typename add_reference<Head>::type head() { return m_head; } function in class:tuple
84 typename add_reference<const Head>::type head() const { return m_head; } function in class:tuple
89 Head m_head
[all...] |
| /external/llvm/include/llvm/CodeGen/ |
| ScoreboardHazardRecognizer.h | 35 // indicated by Head.
48 size_t Head;
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/ |
| example-typelist.cpp | 7 template<typename Head, typename Tail = nil>
9 typedef Head head; typedef in struct:cons
27 template<typename Head, typename Tail>
28 struct length<cons<Head, Tail> > {
55 typedef cons<typename reversed_tail::head,
56 typename reverse<cons<typename T::head, most_of_tail> >::type> type;
59 template<typename Head>
60 class reverse<cons<Head> > {
62 typedef cons<Head> type
[all...] |
| /external/clang/test/CXX/temp/temp.fct.spec/temp.arg.explicit/ |
| 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;
|
| p3-0x.cpp | 7 template<typename Head, typename ...Tail>
8 struct count<Head, Tail...> {
|
| /external/mdnsresponder/mDNSShared/ |
| GenLinkedList.c | 40 pList->Head = NULL;
52 pList->Head = elem;
60 /* Add a linked list element to the head of the list. */
62 ASSIGNLINK( elem, pList->Head, pList->LinkOffset);
66 pList->Head = elem;
76 for ( iElem = pList->Head, lastElem = NULL; iElem; iElem = GETLINK( iElem, pList->LinkOffset)) {
78 if ( lastElem) { // somewhere past the head
80 } else { // at the head
81 pList->Head = GETLINK( elem, pList->LinkOffset);
103 for ( iElem = pList->Head, lastElem = NULL; iElem; iElem = GETLINK( iElem, pList->LinkOffset))
[all...] |
| GenLinkedList.h | 27 void *Head,
47 void *Head,
69 size_t Head,
|
| /external/llvm/lib/CodeGen/ |
| EarlyIfConversion.cpp | 68 // Triangle: Head Diamond: Head
77 // Head block, and phis in the Tail block are converted to select instructions.
87 MachineBasicBlock *Head;
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.
178 /// If instructions use any values that are defined in the head basic block
[all...] |
| MachineRegisterInfo.cpp | 178 MachineOperand *const Head = HeadRef;
180 // Head points to the first list element.
182 // Prev pointers are circular, so Head->Prev == Last.
184 // Head is NULL for an empty list.
185 if (!Head) {
191 assert(MO->getReg() == Head->getReg() && "Different regs on the same list!");
193 // Insert MO between Last and Head in the circular Prev chain.
194 MachineOperand *Last = Head->Contents.Reg.Prev;
197 Head->Contents.Reg.Prev = MO;
204 MO->Contents.Reg.Next = Head;
[all...] |
| /external/clang/lib/Analysis/ |
| PseudoConstantAnalysis.cpp | 85 const Stmt *Head = WorkList.front();
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);
221 } // switch (head->getStmtClass()
[all...] |
| /external/llvm/include/llvm/ADT/ |
| 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) {
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;
[all...] |
| ImmutableList.h | 28 T Head;
31 ImmutableListImpl(const T& head, const ImmutableListImpl* tail = 0)
32 : Head(head), Tail(tail) {}
40 const T& getHead() const { return Head; }
50 Profile(ID, Head, Tail);
94 /// begin - Returns an iterator referring to the head of the list, or
122 /// getHead - Returns the head of the list.
124 assert (!isEmpty() && "Cannot get the head of an empty list.");
166 ImmutableList<T> concat(const T& Head, ImmutableList<T> Tail)
[all...] |
| /external/chromium_org/third_party/skia/src/images/ |
| SkImageDecoder_FactoryDefault.cpp | 25 const MovieReg* curr = MovieReg::Head();
|
| SkImageEncoder_Factory.cpp | 20 const EncodeReg* curr = EncodeReg::Head();
|
| /external/skia/src/images/ |
| SkImageDecoder_FactoryDefault.cpp | 25 const MovieReg* curr = MovieReg::Head();
|
| SkImageEncoder_Factory.cpp | 20 const EncodeReg* curr = EncodeReg::Head();
|
| /external/clang/test/CXX/temp/temp.fct.spec/temp.deduct/temp.deduct.call/ |
| 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/llvm/include/llvm/Analysis/ |
| BlockFrequencyImpl.h | 201 void doLoop(BlockT *Head, BlockT *Tail) {
202 DEBUG(dbgs() << "doLoop(" << getBlockName(Head) << ", "
207 for (rpot_iterator I = rpot_at(Head), E = rpot_at(Tail); ; ++I) {
209 doBlock(BB, Head, BlocksInLoop);
219 PI = GraphTraits< Inverse<BlockT *> >::child_begin(Head),
220 PE = GraphTraits< Inverse<BlockT *> >::child_end(Head);
224 if (isBackedge(Pred, Head))
225 BackFreq += getEdgeFreq(Pred, Head);
228 // The cyclic probability is freq(BackEdges) / freq(Head), where freq(Head)
[all...] |
| /external/chromium_org/third_party/skia/include/core/ |
| SkTRegistry.h | 41 static const SkTRegistry* Head() { return gHead; }
|
| /external/clang/lib/Sema/ |
| AttributeList.cpp | 83 if (!Head) {
84 Head = pool;
88 // Reverse the pool onto the current head. This optimizes for the
92 pool->NextInPool = Head;
93 Head = pool;
|
| /external/skia/include/core/ |
| SkTRegistry.h | 41 static const SkTRegistry* Head() { return gHead; }
|
| /external/chromium/testing/gtest/samples/ |
| sample3_unittest.cc | 105 for ( const QueueNode<int> * n1 = q->Head(), * n2 = new_q->Head();
|
