| /external/llvm/lib/CodeGen/ |
| MachineRegisterInfo.cpp | 173 MachineOperand *const Head = HeadRef;
175 // Head points to the first list element.
177 // Prev pointers are circular, so Head->Prev == Last.
179 // Head is NULL for an empty list.
180 if (!Head) {
186 assert(MO->getReg() == Head->getReg() && "Different regs on the same list!");
188 // Insert MO between Last and Head in the circular Prev chain.
189 MachineOperand *Last = Head->Contents.Reg.Prev;
192 Head->Contents.Reg.Prev = MO;
199 MO->Contents.Reg.Next = Head;
[all...] |
| ShadowStackGCLowering.cpp | 32 GlobalVariable *Head;
75 : FunctionPass(ID), Head(nullptr), StackEntryTy(nullptr),
300 Head = M.getGlobalVariable("llvm_gc_root_chain");
301 if (!Head) {
304 Head = new GlobalVariable(
307 } else if (Head->hasExternalLinkage() && Head->isDeclaration()) {
308 Head->setInitializer(Constant::getNullValue(StackEntryPtrTy));
309 Head->setLinkage(GlobalValue::LinkOnceAnyLinkage);
408 // Initialize the map pointer and load the current head of the shadow stack
[all...] |
| /external/google-breakpad/src/testing/gtest/samples/ |
| sample3_unittest.cc | 105 for ( const QueueNode<int> * n1 = q->Head(), * n2 = new_q->Head();
|
| sample3-inl.h | 105 QueueNode<E>* Head() { return head_; }
106 const QueueNode<E>* Head() const { return head_; }
129 // Removes the head of the queue and returns it. Returns NULL if
|
| /external/protobuf/gtest/samples/ |
| sample3_unittest.cc | 105 for ( const QueueNode<int> * n1 = q->Head(), * n2 = new_q->Head();
|
| sample3-inl.h | 106 QueueNode<E>* Head() { return head_; }
107 const QueueNode<E>* Head() const { return head_; }
130 // Removes the head of the queue and returns it. Returns NULL if
|
| /external/vulkan-validation-layers/tests/gtest-1.7.0/samples/ |
| sample3_unittest.cc | 105 for ( const QueueNode<int> * n1 = q->Head(), * n2 = new_q->Head();
|
| sample3-inl.h | 105 QueueNode<E>* Head() { return head_; }
106 const QueueNode<E>* Head() const { return head_; }
129 // Removes the head of the queue and returns it. Returns NULL if
|
| /ndk/sources/third_party/googletest/googletest/samples/ |
| sample3_unittest.cc | 105 for ( const QueueNode<int> * n1 = q->Head(), * n2 = new_q->Head();
|
| sample3-inl.h | 105 QueueNode<E>* Head() { return head_; }
106 const QueueNode<E>* Head() const { return head_; }
129 // Removes the head of the queue and returns it. Returns NULL if
|
| /frameworks/native/services/sensorservice/ |
| traits.h | 31 typedef T Head;
55 template <typename Head, typename Tail, typename T>
56 struct IndexOf<TypeList<Head, Tail>, T> {
|
| /external/clang/lib/Sema/ |
| AttributeList.cpp | 95 if (!Head) {
96 Head = pool;
100 // Reverse the pool onto the current head. This optimizes for the
104 pool->NextInPool = Head;
105 Head = pool;
|
| /external/llvm/include/llvm/Support/ |
| Registry.h | 77 static node *Head, *Tail;
96 Head = this;
118 static iterator begin() { return iterator(Head); }
214 typename Registry<T,U>::node *Registry<T,U>::Head;
|
| /external/clang/test/CodeGenCXX/ |
| debug-info-use-after-free.cpp | 8 typedef T1 Head;
21 typedef TemplateSel < T1 > Head;
40 typedef typename Types::Head Type;
49 typedef typename Tests::Head Head;
50 TypeParameterizedTest < Fixture, Head, Types >::Register;
|
| /external/llvm/include/llvm/CodeGen/ |
| MachineTraceMetrics.h | 142 /// The block number of the head of the trace. (When hasValidDepth()).
143 unsigned Head;
177 /// trace head, and any dependencies from such a far away dominator are not
185 // Instruction depths are only comparable if the traces share a head.
186 if (Head != TBI.Head)
190 // flow, a dominator may share a trace head without actually being on the
253 /// the trace head to the trace center block. The resource depth only
|
| /external/clang/test/SemaTemplate/ |
| instantiate-member-class.cpp | 67 static node *Head;
69 node(int v) { Head = this; }
|
| /frameworks/volley/src/test/java/com/android/volley/mock/ |
| TestRequest.java | 137 /** Test example of a HEAD request in the new style. */
138 public static class Head extends Base {
139 public Head() {
140 super(Method.HEAD, TEST_URL, null);
|
| /external/valgrind/coregrind/m_syswrap/ |
| syswrap-darwin.c | [all...] |
| /external/clang/include/clang/Sema/ |
| AttributeList.h | 532 void reclaimPool(AttributeList *head);
541 AttributeList *Head;
549 attr->NextInPool = Head;
550 Head = attr;
558 AttributePool(AttributeFactory &factory) : Factory(factory), Head(nullptr) {}
563 AttributePool(AttributePool &&pool) : Factory(pool.Factory), Head(pool.Head) {
564 pool.Head = nullptr;
570 if (Head) {
571 Factory.reclaimPool(Head);
[all...] |
| /external/llvm/lib/Transforms/Utils/ |
| BasicBlockUtils.cpp | 692 /// Head
696 /// Head
711 BasicBlock *Head = SplitBefore->getParent();
712 BasicBlock *Tail = Head->splitBasicBlock(SplitBefore->getIterator());
713 TerminatorInst *HeadOldTerm = Head->getTerminator();
714 LLVMContext &C = Head->getContext();
715 BasicBlock *ThenBlock = BasicBlock::Create(C, "", Head->getParent(), Tail);
728 if (DomTreeNode *OldNode = DT->getNode(Head)) {
731 DomTreeNode *NewNode = DT->addNewBlock(Tail, Head);
735 // Head dominates ThenBlock
[all...] |
| /external/skia/tests/ |
| skia_test.cpp | 165 for (const TestRegistry* iter = TestRegistry::Head(); iter;
182 for (const TestRegistry* iter = TestRegistry::Head(); iter;
|
| /external/skia/tools/VisualBench/ |
| VisualBenchmarkStream.cpp | 78 , fBenches(BenchRegistry::Head())
79 , fGMs(skiagm::GMRegistry::Head())
|
| /external/skia/samplecode/ |
| SampleCode.h | 90 static const SkViewRegister* Head() { return gHead; }
|
| /external/clang/test/CXX/temp/temp.decls/temp.variadic/ |
| metafunctions.cpp | 20 template<typename Head, typename ...Tail>
38 template<typename Head, typename ...Tail>
39 struct count<Head, Tail...> {
|
| /prebuilts/gcc/linux-x86/host/x86_64-linux-glibc2.11-4.8/x86_64-linux/include/c++/4.8/ext/pb_ds/detail/pat_trie_/ |
| pat_trie_base.hpp | 129 /// Head node for PATRICIA tree.
472 _CIter<Node, Leaf, Head, Inode, Is_Forward_Iterator>
475 _CIter<Node, Leaf, Head, Inode, !Is_Forward_Iterator>
478 _Iter<Node, Leaf, Head, Inode, Is_Forward_Iterator>
481 _Iter<Node, Leaf, Head, Inode, !Is_Forward_Iterator>
485 template<typename Node, typename Leaf, typename Head, typename Inode,
508 typedef typename _Alloc::template rebind<Head> __rebind_h;
711 template<typename Node, typename Leaf, typename Head, typename Inode,
714 : public _CIter<Node, Leaf, Head, Inode, Is_Forward_Iterator>
717 typedef _CIter<Node, Leaf, Head, Inode, Is_Forward_Iterator
[all...] |
