summaryrefslogtreecommitdiff
path: root/core/fxcrt/xml/cfx_xmlnode.cpp
blob: a8be133171bd60c1b7f9b8e33cdfabbb0e15d944 (plain)
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
// Copyright 2017 PDFium Authors. All rights reserved.
// Use of this source code is governed by a BSD-style license that can be
// found in the LICENSE file.

// Original code copyright 2014 Foxit Software Inc. http://www.foxitsoftware.com

#include "core/fxcrt/xml/cfx_xmlnode.h"

#include <utility>
#include <vector>

#include "core/fxcrt/xml/cfx_xmlchardata.h"
#include "core/fxcrt/xml/cfx_xmlelement.h"
#include "core/fxcrt/xml/cfx_xmlinstruction.h"
#include "core/fxcrt/xml/cfx_xmltext.h"
#include "third_party/base/stl_util.h"

CFX_XMLNode::CFX_XMLNode() = default;

CFX_XMLNode::~CFX_XMLNode() {
  DeleteChildren();
}

FX_XMLNODETYPE CFX_XMLNode::GetType() const {
  return FX_XMLNODE_Unknown;
}

void CFX_XMLNode::DeleteChildren() {
  CFX_XMLNode* child = last_child_.Get();
  // Clear last child early as it will have been deleted already.
  last_child_ = nullptr;
  while (child) {
    child = child->prev_sibling_.Get();
    if (child)
      child->next_sibling_ = nullptr;
  }
  first_child_ = nullptr;
}

void CFX_XMLNode::AppendChild(std::unique_ptr<CFX_XMLNode> pNode) {
  InsertChildNode(std::move(pNode), -1);
}

void CFX_XMLNode::InsertChildNode(std::unique_ptr<CFX_XMLNode> pNode,
                                  int32_t index) {
  ASSERT(!pNode->parent_);

  pNode->parent_ = this;
  // No existing children, add node as first child.
  if (!first_child_) {
    ASSERT(!last_child_);

    first_child_ = std::move(pNode);
    last_child_ = first_child_.get();
    first_child_->prev_sibling_ = nullptr;
    first_child_->next_sibling_ = nullptr;
    return;
  }

  if (index == 0) {
    first_child_->prev_sibling_ = pNode.get();
    pNode->next_sibling_ = std::move(first_child_);
    pNode->prev_sibling_ = nullptr;
    first_child_ = std::move(pNode);
    return;
  }

  int32_t iCount = 0;
  CFX_XMLNode* pFind = first_child_.get();
  // Note, negative indexes, and indexes after the end of the list will result
  // in appending to the list.
  while (++iCount != index && pFind->next_sibling_)
    pFind = pFind->next_sibling_.get();

  pNode->prev_sibling_ = pFind;
  if (pFind->next_sibling_)
    pFind->next_sibling_->prev_sibling_ = pNode.get();
  pNode->next_sibling_ = std::move(pFind->next_sibling_);

  pFind->next_sibling_ = std::move(pNode);
  if (pFind == last_child_.Get())
    last_child_ = pFind->next_sibling_.get();
}

void CFX_XMLNode::RemoveChildNode(CFX_XMLNode* pNode) {
  ASSERT(first_child_);
  ASSERT(pNode);

  if (first_child_.get() == pNode) {
    first_child_.release();
    first_child_ = std::move(pNode->next_sibling_);
  } else {
    CFX_XMLNode* prev = pNode->prev_sibling_.Get();
    prev->next_sibling_.release();  // Release pNode
    prev->next_sibling_ = std::move(pNode->next_sibling_);
  }

  if (last_child_.Get() == pNode)
    last_child_ = pNode->prev_sibling_.Get();

  if (pNode->next_sibling_)
    pNode->next_sibling_->prev_sibling_ = pNode->prev_sibling_;

  pNode->parent_ = nullptr;
  pNode->prev_sibling_ = nullptr;
}

CFX_XMLNode* CFX_XMLNode::GetRoot() {
  CFX_XMLNode* pParent = this;
  while (pParent->parent_)
    pParent = pParent->parent_.Get();

  return pParent;
}

std::unique_ptr<CFX_XMLNode> CFX_XMLNode::Clone() {
  return nullptr;
}

void CFX_XMLNode::Save(const RetainPtr<IFX_SeekableStream>& pXMLStream) {}

WideString CFX_XMLNode::EncodeEntities(const WideString& value) {
  WideString ret = value;
  ret.Replace(L"&", L"&amp;");
  ret.Replace(L"<", L"&lt;");
  ret.Replace(L">", L"&gt;");
  ret.Replace(L"\'", L"&apos;");
  ret.Replace(L"\"", L"&quot;");
  return ret;
}