/external/skia/src/core/ |
D | SkDeque.cpp | 22 struct SkDeque::Head { struct in SkDeque 23 Head* fNext; argument 24 Head* fPrev; argument 48 if (storageSize >= sizeof(Head) + elemSize) { in SkDeque() 49 fFront = (Head*)storage; in SkDeque() 58 Head* head = fFront; in ~SkDeque() 59 Head* initialHead = (Head*)fInitialStorage; in ~SkDeque() 62 Head* next = head->fNext; in ~SkDeque() 71 Head* front = fFront; in front() 87 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/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 | 86 const Stmt* Head = WorkList.front(); in RunAnalysis() local 89 if (const Expr *Ex = dyn_cast<Expr>(Head)) in RunAnalysis() 90 Head = Ex->IgnoreParenCasts(); in RunAnalysis() 92 switch (Head->getStmtClass()) { in RunAnalysis() 95 const BinaryOperator *BO = cast<BinaryOperator>(Head); in RunAnalysis() 140 const UnaryOperator *UO = cast<UnaryOperator>(Head); in RunAnalysis() 173 const DeclStmt *DS = cast<DeclStmt>(Head); in RunAnalysis() 203 const BlockDeclRefExpr *BDR = cast<BlockDeclRefExpr>(Head); in RunAnalysis() 214 const DeclRefExpr *DR = cast<DeclRefExpr>(Head); in RunAnalysis() 225 const BlockExpr *B = cast<BlockExpr>(Head); in RunAnalysis() [all …]
|
/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;
|
D | p3-0x.cpp | 6 template<typename Head, typename ...Tail> 7 struct count<Head, Tail...> {
|
/external/clang/include/clang/Sema/ |
D | AttributeList.h | 398 AttributeList *Head; variable 406 attr->NextInPool = Head; in add() 407 Head = attr; in add() 415 AttributePool(AttributeFactory &factory) : Factory(factory), Head(0) {} in AttributePool() 418 AttributePool(AttributePool &pool) : Factory(pool.Factory), Head(pool.Head) { in AttributePool() 419 pool.Head = 0; in AttributePool() 425 if (Head) { in clear() 426 Factory.reclaimPool(Head); in clear() 427 Head = 0; in clear() 433 if (pool.Head) { in takeAllFrom() [all …]
|
/external/skia/include/core/ |
D | SkDeque.h | 50 struct Head; 66 SkDeque::Head* fHead; 72 Head* fFront; 73 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 __anon4f10565f0111::ShadowStackGC 186 ShadowStackGC::ShadowStackGC() : Head(0), StackEntryTy(0) { in ShadowStackGC() 288 Head = M.getGlobalVariable("llvm_gc_root_chain"); in initializeCustomLowering() 289 if (!Head) { in initializeCustomLowering() 292 Head = new GlobalVariable(M, StackEntryPtrTy, false, in initializeCustomLowering() 296 } else if (Head->hasExternalLinkage() && Head->isDeclaration()) { in initializeCustomLowering() 297 Head->setInitializer(Constant::getNullValue(StackEntryPtrTy)); in initializeCustomLowering() 298 Head->setLinkage(GlobalValue::LinkOnceAnyLinkage); in initializeCustomLowering() 389 Instruction *CurrentHead = AtEntry.CreateLoad(Head, "gc_currhead"); in performCustomLowering() 418 AtEntry.CreateStore(NewHeadVal, Head); in performCustomLowering() [all …]
|
/external/llvm/include/llvm/Analysis/ |
D | BlockFrequencyImpl.h | 234 void doLoop(BlockT *Head, BlockT *Tail) { in doLoop() argument 235 DEBUG(dbgs() << "doLoop(" << getBlockName(Head) << ", " in doLoop() 240 for (rpot_iterator I = rpot_at(Head), E = rpot_end(); I != E; ++I) { in doLoop() 242 doBlock(BB, Head, BlocksInLoop); in doLoop() 249 PI = GraphTraits< Inverse<BlockT *> >::child_begin(Head), in doLoop() 250 PE = GraphTraits< Inverse<BlockT *> >::child_end(Head); in doLoop() 254 if (isReachable(Pred) && isBackedge(Pred, Head)) { in doLoop() 255 BranchProbability Prob = getBackEdgeProbability(Pred, Head); in doLoop() 261 CycleProb[Head] += (uint32_t) Res; in doLoop()
|
/external/skia/samplecode/ |
D | SampleGM.cpp | 15 fReg = GMRegistry::Head(); in Iter() 19 fReg = GMRegistry::Head(); in reset() 32 const GMRegistry* reg = GMRegistry::Head(); in Count()
|
/external/valgrind/main/coregrind/m_syswrap/ |
D | syswrap-darwin.c | 4097 mach_msg_header_t Head; in POST() member 4114 mach_msg_header_t Head; in PRE() member 4133 mach_msg_header_t Head; in POST() member 4161 mach_msg_header_t Head; in POST() member 4179 mach_msg_header_t Head; in PRE() member 4195 mach_msg_header_t Head; in POST() member 4213 mach_msg_header_t Head; in PRE() member 4231 mach_msg_header_t Head; in PRE() member 4274 mach_msg_header_t Head; in PRE() member 4297 mach_msg_header_t Head; in PRE() 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;
|
/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/skia/src/images/ |
D | SkImageDecoder_Factory.cpp | 35 const DecodeReg* curr = DecodeReg::Head(); in Factory() 61 const MovieReg* curr = MovieReg::Head(); in DecodeStream()
|
/external/llvm/test/Transforms/SCCP/ |
D | apint-array.ll | 8 Head: 21 %H = phi i101 [%G, %True], [-1, %Head]
|