/external/skia/src/core/ |
D | SkDeque.cpp | 14 struct SkDeque::Head { struct in SkDeque 15 Head* fNext; argument 16 Head* fPrev; argument 40 if (storageSize >= sizeof(Head) + elemSize) { in SkDeque() 41 fFront = (Head*)storage; in SkDeque() 50 Head* head = fFront; in ~SkDeque() 51 Head* initialHead = (Head*)fInitialStorage; in ~SkDeque() 54 Head* next = head->fNext; in ~SkDeque() 63 Head* front = fFront; in front() 79 Head* back = fBack; in back() [all …]
|
/external/clang/test/CXX/temp/temp.decls/temp.variadic/ |
D | example-tuple.cpp | 58 template<typename Head, typename... Tail> 59 class tuple<Head, Tail...> : private tuple<Tail...> { 67 tuple(typename add_const_reference<Head>::type v, in tuple() 82 typename add_reference<Head>::type head() { return m_head; } in head() 83 typename add_reference<const Head>::type head() const { return m_head; } in 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, Tail...> > { [all …]
|
D | example-bind.cpp | 58 template<typename Head, typename... Tail> 59 class tuple<Head, Tail...> : private tuple<Tail...> { 67 tuple(typename add_const_reference<Head>::type v, in tuple() 82 typename add_reference<Head>::type head() { return m_head; } in head() 83 typename add_reference<const Head>::type head() const { return m_head; } in 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, Tail...> > { [all …]
|
D | partial-ordering.cpp | 11 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&...> > {
|
D | p2.cpp | 12 template<typename Head, typename ...Tail> 13 void recurse_until_fail(const Head &, const Tail &...tail) { // expected-note{{candidate function t… in recurse_until_fail() argument
|
/external/mdnsresponder/mDNSShared/ |
D | GenLinkedList.c | 40 pList->Head = NULL; in InitLinkedList() 52 pList->Head = elem; in AddToTail() 62 ASSIGNLINK( elem, pList->Head, pList->LinkOffset); in AddToHead() 66 pList->Head = elem; in AddToHead() 76 for ( iElem = pList->Head, lastElem = NULL; iElem; iElem = GETLINK( iElem, pList->LinkOffset)) { in RemoveFromList() 81 pList->Head = GETLINK( elem, pList->LinkOffset); in RemoveFromList() 103 for ( iElem = pList->Head, lastElem = NULL; iElem; iElem = GETLINK( iElem, pList->LinkOffset)) in ReplaceElem() 114 pList->Head = newElem; in ReplaceElem() 133 pList->Head = NULL; in InitDoubleLinkedList() 145 pNext = pList->Head; in DLLAddToHead() [all …]
|
D | GenLinkedList.h | 27 void *Head, member 47 void *Head, member 69 size_t Head, member
|
/external/llvm/include/llvm/CodeGen/ |
D | ScoreboardHazardRecognizer.h | 49 size_t Head; variable 51 Scoreboard():Data(NULL), Depth(0), Head(0) { } in Scoreboard() 62 return Data[(Head + idx) & (Depth-1)]; 72 Head = 0; 76 Head = (Head + 1) & (Depth-1); in advance() 80 Head = (Head - 1) & (Depth-1); in recede()
|
/external/llvm/include/llvm/ADT/ |
D | ilist.h | 90 static NodeTy *ensureHead(NodeTy *&Head) { in ensureHead() 91 if (!Head) { in ensureHead() 92 Head = ilist_traits<NodeTy>::createSentinel(); in ensureHead() 93 ilist_traits<NodeTy>::noteHead(Head, Head); in ensureHead() 94 ilist_traits<NodeTy>::setNext(Head, 0); in ensureHead() 95 return Head; in ensureHead() 97 return ilist_traits<NodeTy>::getPrev(Head); in ensureHead() 313 mutable NodeTy *Head; 319 NodeTy *getTail() { return this->ensureHead(Head); } 320 const NodeTy *getTail() const { return this->ensureHead(Head); } [all …]
|
D | ImmutableList.h | 28 T Head; variable 32 : Head(head), Tail(tail) {} in Head() function 41 const T& getHead() const { return Head; } in getHead() 51 Profile(ID, Head, Tail); in Profile() 167 ImmutableList<T> concat(const T& Head, ImmutableList<T> Tail) { in concat() argument 173 ListTy::Profile(ID, Head, TailImpl); in concat() 180 new (L) ListTy(Head, TailImpl); in concat()
|
/external/clang/lib/Analysis/ |
D | PseudoConstantAnalysis.cpp | 84 const Stmt *Head = WorkList.front(); in RunAnalysis() local 87 if (const Expr *Ex = dyn_cast<Expr>(Head)) in RunAnalysis() 88 Head = Ex->IgnoreParenCasts(); in RunAnalysis() 90 switch (Head->getStmtClass()) { in RunAnalysis() 93 const BinaryOperator *BO = cast<BinaryOperator>(Head); in RunAnalysis() 138 const UnaryOperator *UO = cast<UnaryOperator>(Head); in RunAnalysis() 171 const DeclStmt *DS = cast<DeclStmt>(Head); in RunAnalysis() 201 const DeclRefExpr *DR = cast<DeclRefExpr>(Head); in RunAnalysis() 212 const BlockExpr *B = cast<BlockExpr>(Head); in RunAnalysis() 223 for (Stmt::const_child_range I = Head->children(); I; ++I) in RunAnalysis()
|
/external/clang/test/SemaTemplate/ |
D | example-typelist.cpp | 6 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/chromium/base/ |
D | mach_ipc_mac.mm | 30 Head()->msgh_bits = MACH_MSGH_BITS(MACH_MSG_TYPE_COPY_SEND, 0); 33 Head()->msgh_local_port = MACH_PORT_NULL; 34 Head()->msgh_reserved = 0; 35 Head()->msgh_id = 0; 107 Head()->msgh_size = size; 158 Head()->msgh_bits |= MACH_MSGH_BITS_COMPLEX; 160 Head()->msgh_bits &= ~MACH_MSGH_BITS_COMPLEX; 258 out_message->Head()->msgh_bits = 0; 259 out_message->Head()->msgh_local_port = port_; 260 out_message->Head()->msgh_remote_port = MACH_PORT_NULL; [all …]
|
/external/clang/test/CXX/temp/temp.fct.spec/temp.arg.explicit/ |
D | p9-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/include/clang/Sema/ |
D | AttributeList.h | 337 AttributeList *Head; variable 345 attr->NextInPool = Head; in add() 346 Head = attr; in add() 354 AttributePool(AttributeFactory &factory) : Factory(factory), Head(0) {} in AttributePool() 357 AttributePool(AttributePool &pool) : Factory(pool.Factory), Head(pool.Head) { in AttributePool() 358 pool.Head = 0; in AttributePool() 364 if (Head) { in clear() 365 Factory.reclaimPool(Head); in clear() 366 Head = 0; in clear() 372 if (pool.Head) { in takeAllFrom() [all …]
|
/external/llvm/include/llvm/Analysis/ |
D | BlockFrequencyImpl.h | 221 void doLoop(BlockT *Head, BlockT *Tail) { in doLoop() argument 222 DEBUG(dbgs() << "doLoop(" << getBlockName(Head) << ", " in doLoop() 227 for (rpot_iterator I = rpot_at(Head), E = rpot_at(Tail); ; ++I) { in doLoop() 229 doBlock(BB, Head, BlocksInLoop); in doLoop() 238 PI = GraphTraits< Inverse<BlockT *> >::child_begin(Head), in doLoop() 239 PE = GraphTraits< Inverse<BlockT *> >::child_end(Head); in doLoop() 243 if (isReachable(Pred) && isBackedge(Pred, Head)) { in doLoop() 244 uint64_t N = getEdgeFreq(Pred, Head).getFrequency(); in doLoop() 245 uint64_t D = getBlockFreq(Head).getFrequency(); in doLoop() 250 CycleProb[Head] += (uint32_t) Res; in doLoop() [all …]
|
/external/skia/include/core/ |
D | SkDeque.h | 43 struct Head; 59 SkDeque::Head* fHead; 65 Head* fFront; 66 Head* fBack;
|
/external/clang/test/CXX/temp/temp.fct.spec/temp.deduct/temp.deduct.call/ |
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/srec/tools/thirdparty/OpenFst/fst/lib/ |
D | queue.h | 78 StateId Head() const { return Head_(); } in Head() function 107 StateId Head() const { return front_; } in Head() function 116 virtual StateId Head_() const { return Head(); } in Head_() 140 StateId Head() const { return back(); } in Head() function 148 virtual StateId Head_() const { return Head(); } in Head_() 170 StateId Head() const { return front(); } in Head() function 178 virtual StateId Head_() const { return Head(); } in Head_() 200 StateId Head() const { return heap_.Top(); } in Head() function 231 virtual StateId Head_() const { return Head(); } in Head_() 308 StateId Head() const { return state_[front_]; } in Head() function [all …]
|
/external/llvm/lib/CodeGen/ |
D | ShadowStackGC.cpp | 44 GlobalVariable *Head; member in __anonb55ebc800111::ShadowStackGC 197 ShadowStackGC::ShadowStackGC() : Head(0), StackEntryTy(0) { in ShadowStackGC() 299 Head = M.getGlobalVariable("llvm_gc_root_chain"); in initializeCustomLowering() 300 if (!Head) { in initializeCustomLowering() 303 Head = new GlobalVariable(M, StackEntryPtrTy, false, in initializeCustomLowering() 307 } else if (Head->hasExternalLinkage() && Head->isDeclaration()) { in initializeCustomLowering() 308 Head->setInitializer(Constant::getNullValue(StackEntryPtrTy)); in initializeCustomLowering() 309 Head->setLinkage(GlobalValue::LinkOnceAnyLinkage); in initializeCustomLowering() 400 Instruction *CurrentHead = AtEntry.CreateLoad(Head, "gc_currhead"); in performCustomLowering() 429 AtEntry.CreateStore(NewHeadVal, Head); in performCustomLowering() [all …]
|
/external/openfst/src/include/fst/ |
D | queue.h | 81 StateId Head() const { return Head_(); } in Head() function 116 StateId Head() const { return front_; } in Head() function 128 virtual StateId Head_() const { return Head(); } in Head_() 152 StateId Head() const { return back(); } in Head() function 163 virtual StateId Head_() const { return Head(); } in Head_() 185 StateId Head() const { return front(); } in Head() function 196 virtual StateId Head_() const { return Head(); } in Head_() 219 StateId Head() const { return heap_.Top(); } in Head() function 262 virtual StateId Head_() const { return Head(); } in Head_() 339 StateId Head() const { return state_[front_]; } in Head() function [all …]
|
/external/clang/test/CodeGenCXX/ |
D | debug-info-use-after-free.cpp | 8 typedef T1 Head; typedef 21 typedef TemplateSel < T1 > Head; typedef 40 typedef typename Types::Head Type; in Register() 49 typedef typename Tests::Head Head; in Register() typedef 50 TypeParameterizedTest < Fixture, Head, Types >::Register; in Register()
|
/external/clang/lib/Sema/ |
D | AttributeList.cpp | 77 if (!Head) { in takePool() 78 Head = pool; in takePool() 86 pool->NextInPool = Head; in takePool() 87 Head = pool; in takePool()
|
/external/valgrind/main/coregrind/m_syswrap/ |
D | syswrap-darwin.c | 4148 mach_msg_header_t Head; in POST() member 4165 mach_msg_header_t Head; in PRE() member 4184 mach_msg_header_t Head; in POST() member 4212 mach_msg_header_t Head; in POST() member 4230 mach_msg_header_t Head; in PRE() member 4246 mach_msg_header_t Head; in POST() member 4264 mach_msg_header_t Head; in PRE() member 4282 mach_msg_header_t Head; in PRE() member 4330 mach_msg_header_t Head; in PRE() member 4350 mach_msg_header_t Head; in POST() member [all …]
|
/external/llvm/include/llvm/Support/ |
D | Registry.h | 74 static node *Head, *Tail; variable 93 Head = this; in node() 116 static iterator begin() { return iterator(Head); } in begin() 210 typename Registry<T,U>::node *Registry<T,U>::Head;
|