/external/mdnsresponder/mDNSShared/ |
H A D | GenLinkedList.h | 27 void *Head, member in struct:GenLinkedList 47 void *Head, member in struct:GenDoubleLinkedList 69 size_t Head, member in struct:GenLinkedOffsetList
|
/external/skia/include/core/ |
H A D | SkTRegistry.h | 41 static const SkTRegistry* Head() { return gHead; } function in class:SkTRegistry
|
/external/chromium/testing/gtest/samples/ |
H A D | sample3-inl.h | 106 QueueNode<E>* Head() { return head_; } function in class:Queue 107 const QueueNode<E>* Head() const { return head_; } function in class:Queue
|
/external/clang/lib/Analysis/ |
H A D | PseudoConstantAnalysis.cpp | 85 const Stmt *Head = WorkList.front(); local 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); 224 for (Stmt::const_child_range I = Head [all...] |
/external/gtest/samples/ |
H A D | sample3-inl.h | 106 QueueNode<E>* Head() { return head_; } function in class:Queue 107 const QueueNode<E>* Head() const { return head_; } function in class:Queue
|
/external/llvm/include/llvm/CodeGen/ |
H A D | ScoreboardHazardRecognizer.h | 36 // 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/protobuf/gtest/samples/ |
H A D | sample3-inl.h | 106 QueueNode<E> * Head() { return head_; } function in class:Queue 107 const QueueNode<E> * Head() const { return head_; } function in class:Queue
|
/external/clang/test/SemaTemplate/ |
H A D | instantiate-member-class.cpp | 67 static node *Head; member in struct:test1::Registry 69 node(int v) { Head = this; }
|
/external/skia/samplecode/ |
H A D | SampleCode.h | 90 static const SkViewRegister* Head() { return gHead; } function in class:SkViewRegister
|
/external/skia/src/core/ |
H A D | SkDeque.cpp | 14 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/chromium/base/ |
H A D | mach_ipc_mac.h | 213 mach_msg_header_t *Head() { return &(storage_->head); } function in class:base::MachMessage
|
/external/llvm/include/llvm/ADT/ |
H A D | ImmutableList.h | 28 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/llvm/include/llvm/Analysis/ |
H A D | BlockFrequencyImpl.h | 221 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/llvm/include/llvm/Support/ |
H A D | Registry.h | 74 static node *Head, *Tail; member in class:llvm::Registry 93 Head = this; 116 static iterator begin() { return iterator(Head); } 210 typename Registry<T,U>::node *Registry<T,U>::Head; member in class:llvm::Registry
|
/external/llvm/lib/CodeGen/ |
H A D | MachineRegisterInfo.cpp | 125 MachineOperand *const Head = HeadRef; local 127 // Head points to the first list element. 129 // Prev pointers are circular, so Head->Prev == Last. 131 // Head is NULL for an empty list. 132 if (!Head) { 138 assert(MO->getReg() == Head->getReg() && "Different regs on the same list!"); 140 // Insert MO between Last and Head in the circular Prev chain. 141 MachineOperand *Last = Head->Contents.Reg.Prev; 144 Head->Contents.Reg.Prev = MO; 151 MO->Contents.Reg.Next = Head; 164 MachineOperand *const Head = HeadRef; local [all...] |
H A D | MachineTraceMetrics.h | 135 unsigned Head; member in struct:llvm::MachineTraceMetrics::TraceBlockInfo
|
H A D | ShadowStackGC.cpp | 44 GlobalVariable *Head; member in class:__anon9323::ShadowStackGC 197 ShadowStackGC::ShadowStackGC() : Head(0), StackEntryTy(0) { 299 Head = M.getGlobalVariable("llvm_gc_root_chain"); 300 if (!Head) { 303 Head = new GlobalVariable(M, StackEntryPtrTy, false, 307 } else if (Head->hasExternalLinkage() && Head->isDeclaration()) { 308 Head->setInitializer(Constant::getNullValue(StackEntryPtrTy)); 309 Head->setLinkage(GlobalValue::LinkOnceAnyLinkage); 400 Instruction *CurrentHead = AtEntry.CreateLoad(Head, "gc_currhea [all...] |
H A D | EarlyIfConversion.cpp | 68 // Triangle: Head Diamond: Head 77 // Head block, and phis in the Tail block are converted to select instructions. 87 MachineBasicBlock *Head; member in class:__anon9248::SSAIfConv 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. 227 // Check for any dependencies on Head instruction [all...] |
/external/clang/test/CodeGenCXX/ |
H A D | debug-info-use-after-free.cpp | 8 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/srec/tools/thirdparty/OpenFst/fst/lib/ |
H A D | queue.h | 42 // StateId Head() const; 78 StateId Head() const { return Head_(); } function in class:fst::QueueBase 107 StateId Head() const { return front_; } function in class:fst::TrivialQueue 116 virtual StateId Head_() const { return Head(); } 140 StateId Head() const { return back(); } function in class:fst::FifoQueue 148 virtual StateId Head_() const { return Head(); } 170 StateId Head() const { return front(); } function in class:fst::LifoQueue 178 virtual StateId Head_() const { return Head(); } 200 StateId Head() const { return heap_.Top(); } function in class:fst::ShortestFirstQueue 231 virtual StateId Head_() const { return Head(); } 308 StateId Head() const { return state_[front_]; } function in class:fst::TopOrderQueue 358 StateId Head() const { return front_; } function in class:fst::StateOrderQueue 414 StateId Head() const { function in class:fst::SccQueue 597 StateId Head() const { return queue_->Head(); } function in class:fst::AutoQueue [all...] |
/external/clang/lib/StaticAnalyzer/Core/ |
H A D | BugReporterVisitors.cpp | 588 const Stmt *Head = WorkList.front(); local 594 if (const DeclRefExpr *DR = dyn_cast<DeclRefExpr>(Head)) { 609 for (Stmt::const_child_iterator I = Head->child_begin(); 610 I != Head->child_end(); ++I)
|
/external/openfst/src/include/fst/ |
H A D | queue.h | 45 // StateId Head() const; 81 StateId Head() const { return Head_(); } function in class:fst::QueueBase 116 StateId Head() const { return front_; } function in class:fst::TrivialQueue 128 virtual StateId Head_() const { return Head(); } 152 StateId Head() const { return back(); } function in class:fst::FifoQueue 163 virtual StateId Head_() const { return Head(); } 185 StateId Head() const { return front(); } function in class:fst::LifoQueue 196 virtual StateId Head_() const { return Head(); } 219 StateId Head() const { return heap_.Top(); } function in class:fst::ShortestFirstQueue 262 virtual StateId Head_() const { return Head(); } 339 StateId Head() const { return state_[front_]; } function in class:fst::TopOrderQueue 391 StateId Head() const { return front_; } function in class:fst::StateOrderQueue 450 StateId Head() const { function in class:fst::SccQueue 633 StateId Head() const { return queue_->Head(); } function in class:fst::AutoQueue 818 StateId Head() const { return queue_->Head(); } function in class:fst::PruneQueue [all...] |
/external/protobuf/gtest/include/gtest/internal/ |
H A D | gtest-internal.h | 670 typedef typename Types::Head Type; 712 typedef typename Tests::Head Head; typedef 715 TypeParameterizedTest<Fixture, Head, Types>::Register(
|
/external/chromium/sdch/open-vcdiff/src/gtest/src/ |
H A D | gtest-internal-inl.h | 227 ListNode<E> * Head() { return head_; } function in class:testing::internal::List 228 const ListNode<E> * Head() const { return head_; } function in class:testing::internal::List 295 return Head(); 315 for ( const ListNode<E> * node = Head(); 332 for ( const ListNode<E> * node = Head(); 345 for ( const ListNode<E> * node = Head(); 358 for ( ListNode<E> * node = Head();
|
/external/chromium/testing/gtest/include/gtest/internal/ |
H A D | gtest-internal.h | 642 typedef typename Types::Head Type; 684 typedef typename Tests::Head Head; typedef 687 TypeParameterizedTest<Fixture, Head, Types>::Register(
|