/external/llvm/lib/CodeGen/ |
D | EarlyIfConversion.cpp | 88 MachineBasicBlock *Head; member in __anon81a919940111::SSAIfConv 104 MachineBasicBlock *getTPred() const { return TBB == Tail ? Head : TBB; } in getTPred() 107 MachineBasicBlock *getFPred() const { return FBB == Tail ? Head : FBB; } in getFPred() 246 if (!DefMI || DefMI->getParent() != Head) in canSpeculateInstrs() 275 MachineBasicBlock::iterator FirstTerm = Head->getFirstTerminator(); in findInsertionPoint() 276 MachineBasicBlock::iterator I = Head->end(); in findInsertionPoint() 277 MachineBasicBlock::iterator B = Head->begin(); in findInsertionPoint() 341 Head = MBB; in canConvertIf() 344 if (Head->succ_size() != 2) in canConvertIf() 346 MachineBasicBlock *Succ0 = Head->succ_begin()[0]; in canConvertIf() [all …]
|
D | MachineRegisterInfo.cpp | 173 MachineOperand *const Head = HeadRef; in addRegOperandToUseList() local 180 if (!Head) { in addRegOperandToUseList() 186 assert(MO->getReg() == Head->getReg() && "Different regs on the same list!"); in addRegOperandToUseList() 189 MachineOperand *Last = Head->Contents.Reg.Prev; in addRegOperandToUseList() 192 Head->Contents.Reg.Prev = MO; in addRegOperandToUseList() 199 MO->Contents.Reg.Next = Head; in addRegOperandToUseList() 212 MachineOperand *const Head = HeadRef; in removeRegOperandFromUseList() local 213 assert(Head && "List already empty"); in removeRegOperandFromUseList() 220 if (MO == Head) in removeRegOperandFromUseList() 225 (Next ? Next : Head)->Contents.Reg.Prev = Prev; in removeRegOperandFromUseList() [all …]
|
D | ShadowStackGCLowering.cpp | 32 GlobalVariable *Head; member in __anon4b4f45ef0111::ShadowStackGCLowering 75 : FunctionPass(ID), Head(nullptr), StackEntryTy(nullptr), in ShadowStackGCLowering() 300 Head = M.getGlobalVariable("llvm_gc_root_chain"); in doInitialization() 301 if (!Head) { in doInitialization() 304 Head = new GlobalVariable( in doInitialization() 307 } else if (Head->hasExternalLinkage() && Head->isDeclaration()) { in doInitialization() 308 Head->setInitializer(Constant::getNullValue(StackEntryPtrTy)); in doInitialization() 309 Head->setLinkage(GlobalValue::LinkOnceAnyLinkage); in doInitialization() 409 Instruction *CurrentHead = AtEntry.CreateLoad(Head, "gc_currhead"); in runOnFunction() 440 AtEntry.CreateStore(NewHeadVal, Head); in runOnFunction() [all …]
|
/external/clang/test/CXX/temp/temp.decls/temp.variadic/ |
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, in tuple() 83 typename add_reference<Head>::type head() { return m_head; } in head() 84 typename add_reference<const Head>::type head() const { return m_head; } in 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, Tail...> > { [all …]
|
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, in tuple() 83 typename add_reference<Head>::type head() { return m_head; } in head() 84 typename add_reference<const Head>::type head() const { return m_head; } in 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, Tail...> > { [all …]
|
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&...> > {
|
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 | 48 size_t Head; variable 50 Scoreboard():Data(nullptr), Depth(0), Head(0) { } in Scoreboard() 61 return Data[(Head + idx) & (Depth-1)]; 71 Head = 0; 75 Head = (Head + 1) & (Depth-1); in advance() 79 Head = (Head - 1) & (Depth-1); in recede()
|
/external/clang/lib/Analysis/ |
D | PseudoConstantAnalysis.cpp | 85 const Stmt *Head = WorkList.front(); in RunAnalysis() local 88 if (const Expr *Ex = dyn_cast<Expr>(Head)) in RunAnalysis() 89 Head = Ex->IgnoreParenCasts(); in RunAnalysis() 91 switch (Head->getStmtClass()) { in RunAnalysis() 94 const BinaryOperator *BO = cast<BinaryOperator>(Head); in RunAnalysis() 139 const UnaryOperator *UO = cast<UnaryOperator>(Head); in RunAnalysis() 172 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 (const Stmt *SubStmt : Head->children()) in RunAnalysis()
|
/external/llvm/include/llvm/ADT/ |
D | ilist.h | 91 static NodeTy *ensureHead(NodeTy *&Head) { in ensureHead() 92 if (!Head) { in ensureHead() 93 Head = ilist_traits<NodeTy>::createSentinel(); in ensureHead() 94 ilist_traits<NodeTy>::noteHead(Head, Head); in ensureHead() 95 ilist_traits<NodeTy>::setNext(Head, nullptr); in ensureHead() 96 return Head; in ensureHead() 98 return ilist_traits<NodeTy>::getPrev(Head); in ensureHead() 363 mutable NodeTy *Head; 369 NodeTy *getTail() { return this->ensureHead(Head); } 370 const NodeTy *getTail() const { return this->ensureHead(Head); } [all …]
|
D | ImmutableList.h | 28 T Head; variable 32 : Head(head), Tail(tail) {} in Head() function 40 const T& getHead() const { return Head; } in getHead() 50 Profile(ID, Head, Tail); in Profile() 166 ImmutableList<T> concat(const T& Head, ImmutableList<T> Tail) { in concat() argument 172 ListTy::Profile(ID, Head, TailImpl); in concat() 179 new (L) ListTy(Head, TailImpl); in concat()
|
/external/clang/test/SemaTemplate/ |
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/llvm/lib/Target/AArch64/ |
D | AArch64ConditionalCompares.cpp | 149 MachineBasicBlock *Head; member in __anonc25738a30111::SSACCmpConv 224 if (MBB == Head) { in trivialTailPHIs() 437 Head = MBB; in canConvert() 440 if (Head->succ_size() != 2) in canConvert() 442 MachineBasicBlock *Succ0 = Head->succ_begin()[0]; in canConvert() 443 MachineBasicBlock *Succ1 = Head->succ_begin()[1]; in canConvert() 460 DEBUG(dbgs() << "\nTriangle: BB#" << Head->getNumber() << " -> BB#" in canConvert() 499 if (TII->AnalyzeBranch(*Head, TBB, FBB, HeadCond)) { in canConvert() 565 << Head->getNumber() << ":\n" << *CmpBB); in convert() 570 Head->removeSuccessor(CmpBB, true); in convert() [all …]
|
/external/opencv3/modules/cudalegacy/src/cuda/ |
D | NCVRuntimeTemplates.hpp | 92 typedef T Head; typedef 123 template <class Head, class Tail> 124 struct TypeAt<Typelist<Head, Tail>, 0> 126 typedef Head Result; 129 template <class Head, class Tail, unsigned int i> 130 struct TypeAt<Typelist<Head, Tail>, i>
|
/external/clang/test/CXX/temp/temp.fct.spec/temp.arg.explicit/ |
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;
|
/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/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/libchrome/base/memory/ |
D | raw_scoped_refptr_mismatch_checker.h | 54 template <typename Head, typename... Tail> 55 struct ParamsUseScopedRefptrCorrectly<Tuple<Head, Tail...>> { 56 enum { value = !NeedsScopedRefptrButGetsRawPtr<Head>::value &&
|
/external/libweave/third_party/chromium/base/memory/ |
D | raw_scoped_refptr_mismatch_checker.h | 54 template <typename Head, typename... Tail> 55 struct ParamsUseScopedRefptrCorrectly<Tuple<Head, Tail...>> { 56 enum { value = !NeedsScopedRefptrButGetsRawPtr<Head>::value &&
|
/external/clang/include/clang/Sema/ |
D | AttributeList.h | 541 AttributeList *Head; variable 549 attr->NextInPool = Head; in add() 550 Head = attr; in add() 558 AttributePool(AttributeFactory &factory) : Factory(factory), Head(nullptr) {} in AttributePool() 563 AttributePool(AttributePool &&pool) : Factory(pool.Factory), Head(pool.Head) { in AttributePool() 564 pool.Head = nullptr; in AttributePool() 570 if (Head) { in clear() 571 Factory.reclaimPool(Head); in clear() 572 Head = nullptr; in clear() 578 if (pool.Head) { in takeAllFrom() [all …]
|
/external/valgrind/coregrind/m_syswrap/ |
D | syswrap-darwin.c | 4900 mach_msg_header_t Head; in POST() member 4917 mach_msg_header_t Head; in PRE() member 4936 mach_msg_header_t Head; in POST() member 4964 mach_msg_header_t Head; in POST() member 4982 mach_msg_header_t Head; in PRE() member 4998 mach_msg_header_t Head; in POST() member 5016 mach_msg_header_t Head; in PRE() member 5034 mach_msg_header_t Head; in PRE() member 5072 mach_msg_header_t Head; in PRE() member 5092 mach_msg_header_t Head; in POST() member [all …]
|
/external/llvm/lib/Transforms/Utils/ |
D | BasicBlockUtils.cpp | 711 BasicBlock *Head = SplitBefore->getParent(); in SplitBlockAndInsertIfThen() local 712 BasicBlock *Tail = Head->splitBasicBlock(SplitBefore->getIterator()); in SplitBlockAndInsertIfThen() 713 TerminatorInst *HeadOldTerm = Head->getTerminator(); in SplitBlockAndInsertIfThen() 714 LLVMContext &C = Head->getContext(); in SplitBlockAndInsertIfThen() 715 BasicBlock *ThenBlock = BasicBlock::Create(C, "", Head->getParent(), Tail); in SplitBlockAndInsertIfThen() 728 if (DomTreeNode *OldNode = DT->getNode(Head)) { in SplitBlockAndInsertIfThen() 731 DomTreeNode *NewNode = DT->addNewBlock(Tail, Head); in SplitBlockAndInsertIfThen() 736 DT->addNewBlock(ThenBlock, Head); in SplitBlockAndInsertIfThen() 761 BasicBlock *Head = SplitBefore->getParent(); in SplitBlockAndInsertIfThenElse() local 762 BasicBlock *Tail = Head->splitBasicBlock(SplitBefore->getIterator()); in SplitBlockAndInsertIfThenElse() [all …]
|
/external/clang/lib/Sema/ |
D | AttributeList.cpp | 95 if (!Head) { in takePool() 96 Head = pool; in takePool() 104 pool->NextInPool = Head; in takePool() 105 Head = pool; in takePool()
|