Node.cpp 6.3 KB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130131132133134135136137138139140141142143144145146147148149150151152153154155156157158159160161162163164165166167168169170171172173174175176177178179180181182183184185186187188189190191192193194195196197198199200201202203204205206207208209210
  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/EventWrapperFactory.h>
  34. #include <LibWeb/Bindings/NodeWrapper.h>
  35. #include <LibWeb/Bindings/NodeWrapperFactory.h>
  36. #include <LibWeb/CSS/StyleResolver.h>
  37. #include <LibWeb/DOM/Element.h>
  38. #include <LibWeb/DOM/Event.h>
  39. #include <LibWeb/DOM/EventListener.h>
  40. #include <LibWeb/HTML/HTMLAnchorElement.h>
  41. #include <LibWeb/DOM/Node.h>
  42. #include <LibWeb/Layout/LayoutBlock.h>
  43. #include <LibWeb/Layout/LayoutDocument.h>
  44. #include <LibWeb/Layout/LayoutInline.h>
  45. #include <LibWeb/Layout/LayoutNode.h>
  46. #include <LibWeb/Layout/LayoutText.h>
  47. //#define EVENT_DEBUG
  48. namespace Web::DOM {
  49. Node::Node(Document& document, NodeType type)
  50. : m_document(&document)
  51. , m_type(type)
  52. {
  53. }
  54. Node::~Node()
  55. {
  56. if (layout_node() && layout_node()->parent())
  57. layout_node()->parent()->remove_child(*layout_node());
  58. }
  59. const HTML::HTMLAnchorElement* Node::enclosing_link_element() const
  60. {
  61. for (auto* node = this; node; node = node->parent()) {
  62. if (is<HTML::HTMLAnchorElement>(*node) && downcast<HTML::HTMLAnchorElement>(*node).has_attribute(HTML::AttributeNames::href))
  63. return downcast<HTML::HTMLAnchorElement>(node);
  64. }
  65. return nullptr;
  66. }
  67. const HTML::HTMLElement* Node::enclosing_html_element() const
  68. {
  69. return first_ancestor_of_type<HTML::HTMLElement>();
  70. }
  71. String Node::text_content() const
  72. {
  73. Vector<String> strings;
  74. StringBuilder builder;
  75. for (auto* child = first_child(); child; child = child->next_sibling()) {
  76. auto text = child->text_content();
  77. if (!text.is_empty()) {
  78. builder.append(child->text_content());
  79. builder.append(' ');
  80. }
  81. }
  82. if (builder.length() > 1)
  83. builder.trim(1);
  84. return builder.to_string();
  85. }
  86. RefPtr<LayoutNode> Node::create_layout_node(const CSS::StyleProperties*)
  87. {
  88. return nullptr;
  89. }
  90. void Node::invalidate_style()
  91. {
  92. for_each_in_subtree_of_type<Element>([&](auto& element) {
  93. element.set_needs_style_update(true);
  94. return IterationDecision::Continue;
  95. });
  96. document().schedule_style_update();
  97. }
  98. bool Node::is_link() const
  99. {
  100. return enclosing_link_element();
  101. }
  102. void Node::dispatch_event(NonnullRefPtr<Event> event)
  103. {
  104. for (auto& listener : listeners()) {
  105. if (listener.event_name == event->type()) {
  106. auto& function = const_cast<EventListener&>(*listener.listener).function();
  107. #ifdef EVENT_DEBUG
  108. static_cast<const JS::ScriptFunction&>(function).body().dump(0);
  109. #endif
  110. auto& global_object = function.global_object();
  111. auto* this_value = wrap(global_object, *this);
  112. #ifdef EVENT_DEBUG
  113. dbg() << "calling event listener with this=" << this_value;
  114. #endif
  115. auto* event_wrapper = wrap(global_object, *event);
  116. JS::MarkedValueList arguments(global_object.heap());
  117. arguments.append(event_wrapper);
  118. auto& interpreter = document().interpreter();
  119. (void)interpreter.call(function, this_value, move(arguments));
  120. if (interpreter.exception())
  121. interpreter.clear_exception();
  122. }
  123. }
  124. // FIXME: This is a hack. We should follow the real rules of event bubbling.
  125. if (parent())
  126. parent()->dispatch_event(move(event));
  127. }
  128. String Node::child_text_content() const
  129. {
  130. if (!is<ParentNode>(*this))
  131. return String::empty();
  132. StringBuilder builder;
  133. downcast<ParentNode>(*this).for_each_child([&](auto& child) {
  134. if (is<Text>(child))
  135. builder.append(downcast<Text>(child).text_content());
  136. });
  137. return builder.build();
  138. }
  139. const Node* Node::root() const
  140. {
  141. const Node* root = this;
  142. while (root->parent())
  143. root = root->parent();
  144. return root;
  145. }
  146. bool Node::is_connected() const
  147. {
  148. return root() && root()->is_document();
  149. }
  150. Element* Node::parent_element()
  151. {
  152. if (!parent() || !is<Element>(parent()))
  153. return nullptr;
  154. return downcast<Element>(parent());
  155. }
  156. const Element* Node::parent_element() const
  157. {
  158. if (!parent() || !is<Element>(parent()))
  159. return nullptr;
  160. return downcast<Element>(parent());
  161. }
  162. RefPtr<Node> Node::append_child(NonnullRefPtr<Node> node, bool notify)
  163. {
  164. TreeNode<Node>::append_child(node, notify);
  165. return node;
  166. }
  167. RefPtr<Node> Node::insert_before(NonnullRefPtr<Node> node, RefPtr<Node> child, bool notify)
  168. {
  169. if (!child)
  170. return append_child(move(node), notify);
  171. if (child->parent_node() != this) {
  172. dbg() << "FIXME: Trying to insert_before() a bogus child";
  173. return nullptr;
  174. }
  175. TreeNode<Node>::insert_before(node, child, notify);
  176. return node;
  177. }
  178. void Node::set_document(Badge<Document>, Document& document)
  179. {
  180. m_document = &document;
  181. }
  182. bool Node::is_editable() const
  183. {
  184. return parent() && parent()->is_editable();
  185. }
  186. }