Node.cpp 4.5 KB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130131132133134135136137138139140141142143
  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/ScriptFunction.h>
  31. #include <LibWeb/Bindings/NodeWrapper.h>
  32. #include <LibWeb/CSS/StyleResolver.h>
  33. #include <LibWeb/DOM/Element.h>
  34. #include <LibWeb/DOM/EventListener.h>
  35. #include <LibWeb/DOM/HTMLAnchorElement.h>
  36. #include <LibWeb/DOM/Node.h>
  37. #include <LibWeb/Layout/LayoutBlock.h>
  38. #include <LibWeb/Layout/LayoutDocument.h>
  39. #include <LibWeb/Layout/LayoutInline.h>
  40. #include <LibWeb/Layout/LayoutNode.h>
  41. #include <LibWeb/Layout/LayoutText.h>
  42. namespace Web {
  43. Node::Node(Document& document, NodeType type)
  44. : m_document(document)
  45. , m_type(type)
  46. {
  47. }
  48. Node::~Node()
  49. {
  50. }
  51. const HTMLAnchorElement* Node::enclosing_link_element() const
  52. {
  53. for (auto* node = this; node; node = node->parent()) {
  54. if (is<HTMLAnchorElement>(*node) && to<HTMLAnchorElement>(*node).has_attribute("href"))
  55. return to<HTMLAnchorElement>(node);
  56. }
  57. return nullptr;
  58. }
  59. const HTMLElement* Node::enclosing_html_element() const
  60. {
  61. return first_ancestor_of_type<HTMLElement>();
  62. }
  63. String Node::text_content() const
  64. {
  65. Vector<String> strings;
  66. StringBuilder builder;
  67. for (auto* child = first_child(); child; child = child->next_sibling()) {
  68. auto text = child->text_content();
  69. if (!text.is_empty()) {
  70. builder.append(child->text_content());
  71. builder.append(' ');
  72. }
  73. }
  74. if (builder.length() > 1)
  75. builder.trim(1);
  76. return builder.to_string();
  77. }
  78. const Element* Node::next_element_sibling() const
  79. {
  80. for (auto* node = next_sibling(); node; node = node->next_sibling()) {
  81. if (node->is_element())
  82. return static_cast<const Element*>(node);
  83. }
  84. return nullptr;
  85. }
  86. const Element* Node::previous_element_sibling() const
  87. {
  88. for (auto* node = previous_sibling(); node; node = node->previous_sibling()) {
  89. if (node->is_element())
  90. return static_cast<const Element*>(node);
  91. }
  92. return nullptr;
  93. }
  94. RefPtr<LayoutNode> Node::create_layout_node(const StyleProperties*) const
  95. {
  96. return nullptr;
  97. }
  98. void Node::invalidate_style()
  99. {
  100. for_each_in_subtree_of_type<Element>([&](auto& element) {
  101. element.set_needs_style_update(true);
  102. return IterationDecision::Continue;
  103. });
  104. document().schedule_style_update();
  105. }
  106. bool Node::is_link() const
  107. {
  108. auto* enclosing_link = enclosing_link_element();
  109. if (!enclosing_link)
  110. return false;
  111. return enclosing_link->has_attribute("href");
  112. }
  113. void Node::dispatch_event(String event_name)
  114. {
  115. for (auto& listener : listeners()) {
  116. if (listener.event_name == event_name) {
  117. auto* function = const_cast<EventListener&>(*listener.listener).function();
  118. static_cast<const JS::ScriptFunction*>(function)->body().dump(0);
  119. auto* this_value = wrap(function->heap(), *this);
  120. dbg() << "calling event listener with this=" << this_value;
  121. document().interpreter().call(function, this_value, {});
  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_name));
  127. }
  128. }