Home
last modified time | relevance | path

Searched refs:pBeforeNode (Results 1 – 9 of 9) sorted by relevance

/external/pdfium/xfa/fxfa/parser/
Dcxfa_arraynodelist.cpp33 bool CXFA_ArrayNodeList::Insert(CXFA_Node* pNewNode, CXFA_Node* pBeforeNode) { in Insert() argument
34 if (!pBeforeNode) { in Insert()
37 auto it = std::find(m_array.begin(), m_array.end(), pBeforeNode); in Insert()
Dcxfa_attachnodelist.cpp32 bool CXFA_AttachNodeList::Insert(CXFA_Node* pNewNode, CXFA_Node* pBeforeNode) { in Insert() argument
37 return m_pAttachNode->InsertChild(pNewNode, pBeforeNode); in Insert()
Dcxfa_attachnodelist.h22 bool Insert(CXFA_Node* pNewNode, CXFA_Node* pBeforeNode) override;
Dcxfa_arraynodelist.h25 bool Insert(CXFA_Node* pNewNode, CXFA_Node* pBeforeNode) override;
Dcxfa_list.h22 virtual bool Insert(CXFA_Node* pNewNode, CXFA_Node* pBeforeNode) = 0;
Dcxfa_node.cpp134 CXFA_Node* pBeforeNode = nullptr; in ReorderDataNodes() local
136 pBeforeNode = rgNodeArray2.front(); in ReorderDataNodes()
137 pParentNode = pBeforeNode->GetParent(); in ReorderDataNodes()
141 pBeforeNode = pLastNode->GetNextSibling(); in ReorderDataNodes()
145 pParentNode->InsertChild(pCurNode, pBeforeNode); in ReorderDataNodes()
854 bool CXFA_Node::InsertChild(CXFA_Node* pNode, CXFA_Node* pBeforeNode) { in InsertChild() argument
856 (pBeforeNode && pBeforeNode->m_pParent != this)) { in InsertChild()
866 if (!m_pChild || pBeforeNode == m_pChild) { in InsertChild()
870 } else if (!pBeforeNode) { in InsertChild()
876 while (pPrev->m_pNext != pBeforeNode) { in InsertChild()
Dcxfa_node.h169 bool InsertChild(CXFA_Node* pNode, CXFA_Node* pBeforeNode);
Dxfa_document_datamerger_imp.cpp1481 CXFA_Node* pBeforeNode = pDataRoot->GetFirstChild(); in DoDataMerge() local
1482 pDataRoot->InsertChild(pDataTopLevel, pBeforeNode); in DoDataMerge()
/external/pdfium/fxjs/xfa/
Dcjx_list.cpp56 auto* pBeforeNode = ToNode(runtime->ToXFAObject(params[1])); in insert() local
57 GetXFAList()->Insert(pNewNode, pBeforeNode); in insert()