HomeSort by relevance Sort by last modified time
    Searched refs:m_pCurrent (Results 1 - 4 of 4) sorted by null

  /external/pdfium/xfa/fxfa/parser/
cxfa_nodeiteratortemplate.h 14 : m_pRoot(pRoot), m_pCurrent(pRoot) {}
17 NodeType* GetCurrent() const { return m_pCurrent; }
19 void Reset() { m_pCurrent = m_pRoot; }
22 m_pCurrent = nullptr;
25 m_pCurrent = pNode;
32 if (!m_pCurrent) {
33 m_pCurrent = LastDescendant(m_pRoot);
34 return m_pCurrent;
36 NodeType* pSibling = PreviousSiblingWithinSubtree(m_pCurrent);
38 m_pCurrent = LastDescendant(pSibling)
    [all...]
  /frameworks/compile/mclinker/include/mcld/ADT/
TreeAllocator.h 77 Alloc::m_pCurrent = pClient.Alloc::m_pCurrent;
84 Alloc::m_pCurrent->next = pClient.Alloc::m_pRoot;
85 Alloc::m_pCurrent = pClient.Alloc::m_pCurrent;
  /frameworks/compile/mclinker/include/mcld/Support/
Allocators.h 102 LinearAllocatorBase() : m_pRoot(NULL), m_pCurrent(NULL), m_AllocatedNum(0) {}
146 size_type rest_num_elem = chunk_type::size() - m_pCurrent->bound;
150 result = m_pCurrent->data + m_pCurrent->bound;
151 m_pCurrent->bound += N;
161 if (chunk_type::size() == m_pCurrent->bound)
163 result = m_pCurrent->data + m_pCurrent->bound;
164 ++m_pCurrent->bound;
172 if (N == 0 || N > chunk_type::size() || m_pCurrent->bound == 0 |
    [all...]
GCFactory.h 159 return (Alloc::m_pCurrent) == 0
161 : iterator(Alloc::m_pCurrent, Alloc::m_pCurrent->bound);
165 return (Alloc::m_pCurrent) == 0
167 : const_iterator(Alloc::m_pCurrent, Alloc::m_pCurrent->bound);

Completed in 122 milliseconds