Node.cpp 5.9 KB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130131132133134135136137138139140141142143144145146147148149150151152153154155156157158159160161162163164165166167168169170171172173174175176177178179180181182183184185186187188189190191192193194195196197198199200201202
  1. /*
  2. * Copyright (c) 2018-2020, Andreas Kling <kling@serenityos.org>
  3. * All rights reserved.
  4. *
  5. * Redistribution and use in source and binary forms, with or without
  6. * modification, are permitted provided that the following conditions are met:
  7. *
  8. * 1. Redistributions of source code must retain the above copyright notice, this
  9. * list of conditions and the following disclaimer.
  10. *
  11. * 2. Redistributions in binary form must reproduce the above copyright notice,
  12. * this list of conditions and the following disclaimer in the documentation
  13. * and/or other materials provided with the distribution.
  14. *
  15. * THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS "AS IS"
  16. * AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
  17. * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE ARE
  18. * DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT HOLDER OR CONTRIBUTORS BE LIABLE
  19. * FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
  20. * DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR
  21. * SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER
  22. * CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY,
  23. * OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE
  24. * OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
  25. */
  26. #include <AK/StringBuilder.h>
  27. #include <LibJS/AST.h>
  28. #include <LibJS/Interpreter.h>
  29. #include <LibJS/Runtime/Function.h>
  30. #include <LibJS/Runtime/MarkedValueList.h>
  31. #include <LibJS/Runtime/ScriptFunction.h>
  32. #include <LibWeb/Bindings/EventWrapper.h>
  33. #include <LibWeb/Bindings/NodeWrapper.h>
  34. #include <LibWeb/Bindings/NodeWrapperFactory.h>
  35. #include <LibWeb/CSS/StyleResolver.h>
  36. #include <LibWeb/DOM/Element.h>
  37. #include <LibWeb/DOM/Event.h>
  38. #include <LibWeb/DOM/EventListener.h>
  39. #include <LibWeb/DOM/HTMLAnchorElement.h>
  40. #include <LibWeb/DOM/Node.h>
  41. #include <LibWeb/Layout/LayoutBlock.h>
  42. #include <LibWeb/Layout/LayoutDocument.h>
  43. #include <LibWeb/Layout/LayoutInline.h>
  44. #include <LibWeb/Layout/LayoutNode.h>
  45. #include <LibWeb/Layout/LayoutText.h>
  46. //#define EVENT_DEBUG
  47. namespace Web {
  48. Node::Node(Document& document, NodeType type)
  49. : m_document(document)
  50. , m_type(type)
  51. {
  52. }
  53. Node::~Node()
  54. {
  55. if (layout_node() && layout_node()->parent())
  56. layout_node()->parent()->remove_child(*layout_node());
  57. }
  58. const HTMLAnchorElement* Node::enclosing_link_element() const
  59. {
  60. for (auto* node = this; node; node = node->parent()) {
  61. if (is<HTMLAnchorElement>(*node) && to<HTMLAnchorElement>(*node).has_attribute(HTML::AttributeNames::href))
  62. return to<HTMLAnchorElement>(node);
  63. }
  64. return nullptr;
  65. }
  66. const HTMLElement* Node::enclosing_html_element() const
  67. {
  68. return first_ancestor_of_type<HTMLElement>();
  69. }
  70. String Node::text_content() const
  71. {
  72. Vector<String> strings;
  73. StringBuilder builder;
  74. for (auto* child = first_child(); child; child = child->next_sibling()) {
  75. auto text = child->text_content();
  76. if (!text.is_empty()) {
  77. builder.append(child->text_content());
  78. builder.append(' ');
  79. }
  80. }
  81. if (builder.length() > 1)
  82. builder.trim(1);
  83. return builder.to_string();
  84. }
  85. const Element* Node::next_element_sibling() const
  86. {
  87. for (auto* node = next_sibling(); node; node = node->next_sibling()) {
  88. if (node->is_element())
  89. return static_cast<const Element*>(node);
  90. }
  91. return nullptr;
  92. }
  93. const Element* Node::previous_element_sibling() const
  94. {
  95. for (auto* node = previous_sibling(); node; node = node->previous_sibling()) {
  96. if (node->is_element())
  97. return static_cast<const Element*>(node);
  98. }
  99. return nullptr;
  100. }
  101. RefPtr<LayoutNode> Node::create_layout_node(const StyleProperties*) const
  102. {
  103. return nullptr;
  104. }
  105. void Node::invalidate_style()
  106. {
  107. for_each_in_subtree_of_type<Element>([&](auto& element) {
  108. element.set_needs_style_update(true);
  109. return IterationDecision::Continue;
  110. });
  111. document().schedule_style_update();
  112. }
  113. bool Node::is_link() const
  114. {
  115. return enclosing_link_element();
  116. }
  117. void Node::dispatch_event(NonnullRefPtr<Event> event)
  118. {
  119. for (auto& listener : listeners()) {
  120. if (listener.event_name == event->name()) {
  121. auto& function = const_cast<EventListener&>(*listener.listener).function();
  122. #ifdef EVENT_DEBUG
  123. static_cast<const JS::ScriptFunction*>(function)->body().dump(0);
  124. #endif
  125. auto& heap = function.heap();
  126. auto* this_value = wrap(heap, *this);
  127. #ifdef EVENT_DEBUG
  128. dbg() << "calling event listener with this=" << this_value;
  129. #endif
  130. auto* event_wrapper = wrap(heap, *event);
  131. JS::MarkedValueList arguments(heap);
  132. arguments.append(event_wrapper);
  133. document().interpreter().call(function, this_value, move(arguments));
  134. }
  135. }
  136. // FIXME: This is a hack. We should follow the real rules of event bubbling.
  137. if (parent())
  138. parent()->dispatch_event(move(event));
  139. }
  140. String Node::child_text_content() const
  141. {
  142. if (!is<ParentNode>(*this))
  143. return String::empty();
  144. StringBuilder builder;
  145. to<ParentNode>(*this).for_each_child([&](auto& child) {
  146. if (is<Text>(child))
  147. builder.append(to<Text>(child).text_content());
  148. });
  149. return builder.build();
  150. }
  151. const Node* Node::root() const
  152. {
  153. const Node* root = this;
  154. while (root->parent())
  155. root = root->parent();
  156. return root;
  157. }
  158. bool Node::is_connected() const
  159. {
  160. return root() && root()->is_document();
  161. }
  162. Element* Node::parent_element()
  163. {
  164. if (!parent() || !is<Element>(parent()))
  165. return nullptr;
  166. return to<Element>(parent());
  167. }
  168. const Element* Node::parent_element() const
  169. {
  170. if (!parent() || !is<Element>(parent()))
  171. return nullptr;
  172. return to<Element>(parent());
  173. }
  174. RefPtr<Node> Node::append_child(NonnullRefPtr<Node> node, bool notify)
  175. {
  176. TreeNode<Node>::append_child(node, notify);
  177. return node;
  178. }
  179. }