Searched refs:Head (Results 1 - 25 of 72) sorted by relevance

123

/external/clang/test/CXX/temp/temp.decls/temp.variadic/
H A Dp2.cpp12 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 Dpartial-ordering.cpp11 template<typename Head, typename ...Tail>
12 struct X1<tuple<Head, Tail...> > {
16 template<typename Head, typename ...Tail>
17 struct X1<tuple<Head, Tail&...> > {
21 template<typename Head, typename ...Tail>
22 struct X1<tuple<Head&, Tail&...> > {
H A Dexample-tuple.cpp58 template<typename Head, typename... Tail>
59 class tuple<Head, Tail...> : private tuple<Tail...> {
67 tuple(typename add_const_reference<Head>::type v,
82 typename add_reference<Head>::type head() { return m_head; }
83 typename add_reference<const Head>::type head() const { return m_head; }
88 Head m_head;
156 template<int I, typename Head, typename... Tail>
157 struct tuple_element<I, tuple<Head, Tail...> > {
161 template<typename Head, typename... Tail>
162 struct tuple_element<0, tuple<Head, Tai
[all...]
H A Dexample-bind.cpp58 template<typename Head, typename... Tail>
59 class tuple<Head, Tail...> : private tuple<Tail...> {
67 tuple(typename add_const_reference<Head>::type v,
82 typename add_reference<Head>::type head() { return m_head; }
83 typename add_reference<const Head>::type head() const { return m_head; }
88 Head m_head;
122 template<int I, typename Head, typename... Tail>
123 struct tuple_element<I, tuple<Head, Tail...> > {
127 template<typename Head, typename... Tail>
128 struct tuple_element<0, tuple<Head, Tai
[all...]
/external/llvm/include/llvm/CodeGen/
H A DScoreboardHazardRecognizer.h36 // indicated by Head.
49 size_t Head; member in class:llvm::ScoreboardHazardRecognizer::Scoreboard
51 Scoreboard():Data(NULL), Depth(0), Head(0) { }
62 return Data[(Head + idx) & (Depth-1)];
72 Head = 0;
76 Head = (Head + 1) & (Depth-1);
80 Head = (Head - 1) & (Depth-1);
/external/clang/test/SemaTemplate/
H A Dexample-typelist.cpp6 template<typename Head, typename Tail = nil>
8 typedef Head head;
26 template<typename Head, typename Tail>
27 struct length<cons<Head, Tail> > {
58 template<typename Head>
59 class reverse<cons<Head> > {
61 typedef cons<Head> type;
/external/skia/include/core/
H A DSkDeque.h43 struct Head;
59 SkDeque::Head* fHead;
65 Head* fFront;
66 Head* fBack;
/external/skia/src/core/
H A DSkDeque.cpp14 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 Dp3-0x.cpp6 template<typename Head, typename ...Tail>
7 struct count<Head, Tail...> {
H A Dp9-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;
/external/mdnsresponder/mDNSShared/
H A DGenLinkedList.c40 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 DGenLinkedList.h27 void *Head, member in struct:GenLinkedList
47 void *Head, member in struct:GenDoubleLinkedList
69 size_t Head, member in struct:GenLinkedOffsetList
/external/clang/lib/Analysis/
H A DPseudoConstantAnalysis.cpp84 const Stmt *Head = WorkList.front(); local
87 if (const Expr *Ex = dyn_cast<Expr>(Head))
88 Head = Ex->IgnoreParenCasts();
90 switch (Head->getStmtClass()) {
93 const BinaryOperator *BO = cast<BinaryOperator>(Head);
138 const UnaryOperator *UO = cast<UnaryOperator>(Head);
171 const DeclStmt *DS = cast<DeclStmt>(Head);
201 const DeclRefExpr *DR = cast<DeclRefExpr>(Head);
212 const BlockExpr *B = cast<BlockExpr>(Head);
223 for (Stmt::const_child_range I = Head
[all...]
/external/skia/src/images/
H A DSkImageDecoder_Factory.cpp27 const DecodeReg* curr = DecodeReg::Head();
53 const MovieReg* curr = MovieReg::Head();
H A DSkImageEncoder_Factory.cpp24 const EncodeReg* curr = EncodeReg::Head();
/external/llvm/include/llvm/ADT/
H A Dilist.h72 /// strategy. The sentinel is stored in the prev field of ilist's Head.
83 /// value for its Head
87 /// ensureHead - make sure that Head is either already
90 static NodeTy *ensureHead(NodeTy *&Head) { argument
91 if (!Head) {
92 Head = ilist_traits<NodeTy>::createSentinel();
93 ilist_traits<NodeTy>::noteHead(Head, Head);
94 ilist_traits<NodeTy>::setNext(Head, 0);
95 return Head;
313 mutable NodeTy *Head; member in class:llvm::iplist
[all...]
H A DImmutableList.h28 T Head; member in class:llvm::ImmutableListImpl
32 : Head(head), Tail(tail) {}
41 const T& getHead() const { return Head; }
51 Profile(ID, Head, Tail);
167 ImmutableList<T> concat(const T& Head, ImmutableList<T> Tail) { argument
173 ListTy::Profile(ID, Head, TailImpl);
180 new (L) ListTy(Head, TailImpl);
/external/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;
/external/clang/test/CodeGenCXX/
H A Ddebug-info-use-after-free.cpp8 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 DBlockFrequencyImpl.h221 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 DAttributeList.cpp77 if (!Head) {
78 Head = pool;
86 pool->NextInPool = Head;
87 Head = pool;
/external/clang/include/clang/Sema/
H A DAttributeList.h337 AttributeList *Head;
345 attr->NextInPool = Head;
346 Head = attr;
354 AttributePool(AttributeFactory &factory) : Factory(factory), Head(0) {}
357 AttributePool(AttributePool &pool) : Factory(pool.Factory), Head(pool.Head) {
358 pool.Head = 0;
364 if (Head) {
365 Factory.reclaimPool(Head);
366 Head
[all...]
/external/chromium/testing/gtest/samples/
H A Dsample3_unittest.cc105 for ( const QueueNode<int> * n1 = q->Head(), * n2 = new_q->Head();
/external/gtest/samples/
H A Dsample3_unittest.cc105 for ( const QueueNode<int> * n1 = q->Head(), * n2 = new_q->Head();
/external/protobuf/gtest/samples/
H A Dsample3_unittest.cc105 for ( const QueueNode<int> * n1 = q->Head(), * n2 = new_q->Head();

Completed in 2755 milliseconds

123