Node.cpp 5.6 KB

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