mirror of
				https://github.com/RGBCube/serenity
				synced 2025-10-31 18:52:45 +00:00 
			
		
		
		
	 830a57c6b2
			
		
	
	
		830a57c6b2
		
	
	
	
	
		
			
			Let's rename this to LibWeb since it aims to provide more parts of the web platform than just HTML. :^)
		
			
				
	
	
		
			158 lines
		
	
	
	
		
			4.6 KiB
		
	
	
	
		
			C++
		
	
	
	
	
	
			
		
		
	
	
			158 lines
		
	
	
	
		
			4.6 KiB
		
	
	
	
		
			C++
		
	
	
	
	
	
| /*
 | |
|  * Copyright (c) 2018-2020, Andreas Kling <kling@serenityos.org>
 | |
|  * All rights reserved.
 | |
|  *
 | |
|  * Redistribution and use in source and binary forms, with or without
 | |
|  * modification, are permitted provided that the following conditions are met:
 | |
|  *
 | |
|  * 1. Redistributions of source code must retain the above copyright notice, this
 | |
|  *    list of conditions and the following disclaimer.
 | |
|  *
 | |
|  * 2. Redistributions in binary form must reproduce the above copyright notice,
 | |
|  *    this list of conditions and the following disclaimer in the documentation
 | |
|  *    and/or other materials provided with the distribution.
 | |
|  *
 | |
|  * THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS "AS IS"
 | |
|  * AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
 | |
|  * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE ARE
 | |
|  * DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT HOLDER OR CONTRIBUTORS BE LIABLE
 | |
|  * FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
 | |
|  * DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR
 | |
|  * SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER
 | |
|  * CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY,
 | |
|  * OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE
 | |
|  * OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
 | |
|  */
 | |
| 
 | |
| #include <LibGUI/Painter.h>
 | |
| #include <LibWeb/DOM/Document.h>
 | |
| #include <LibWeb/DOM/Element.h>
 | |
| #include <LibWeb/Frame.h>
 | |
| #include <LibWeb/Layout/LayoutBlock.h>
 | |
| #include <LibWeb/Layout/LayoutNode.h>
 | |
| 
 | |
| namespace Web {
 | |
| 
 | |
| LayoutNode::LayoutNode(const Node* node)
 | |
|     : m_node(node)
 | |
| {
 | |
|     if (m_node)
 | |
|         m_node->set_layout_node({}, this);
 | |
| }
 | |
| 
 | |
| LayoutNode::~LayoutNode()
 | |
| {
 | |
|     if (m_node && m_node->layout_node() == this)
 | |
|         m_node->set_layout_node({}, nullptr);
 | |
| }
 | |
| 
 | |
| void LayoutNode::layout()
 | |
| {
 | |
|     for_each_child([](auto& child) {
 | |
|         child.layout();
 | |
|     });
 | |
| }
 | |
| 
 | |
| const LayoutBlock* LayoutNode::containing_block() const
 | |
| {
 | |
|     for (auto* ancestor = parent(); ancestor; ancestor = ancestor->parent()) {
 | |
|         if (is<LayoutBlock>(*ancestor))
 | |
|             return to<LayoutBlock>(ancestor);
 | |
|     }
 | |
|     return nullptr;
 | |
| }
 | |
| 
 | |
| void LayoutNode::render(RenderingContext& context)
 | |
| {
 | |
|     if (!is_visible())
 | |
|         return;
 | |
| 
 | |
|     // TODO: render our border
 | |
|     for_each_child([&](auto& child) {
 | |
|         child.render(context);
 | |
|     });
 | |
| }
 | |
| 
 | |
| HitTestResult LayoutNode::hit_test(const Gfx::Point& position) const
 | |
| {
 | |
|     HitTestResult result;
 | |
|     for_each_child([&](auto& child) {
 | |
|         auto child_result = child.hit_test(position);
 | |
|         if (child_result.layout_node)
 | |
|             result = child_result;
 | |
|     });
 | |
|     return result;
 | |
| }
 | |
| 
 | |
| const Document& LayoutNode::document() const
 | |
| {
 | |
|     if (is_anonymous())
 | |
|         return parent()->document();
 | |
|     return node()->document();
 | |
| }
 | |
| 
 | |
| Document& LayoutNode::document()
 | |
| {
 | |
|     if (is_anonymous())
 | |
|         return parent()->document();
 | |
|     // FIXME: Remove this const_cast once we give up on the idea of a const link from layout tree to DOM tree.
 | |
|     return const_cast<Node*>(node())->document();
 | |
| }
 | |
| 
 | |
| const LayoutDocument& LayoutNode::root() const
 | |
| {
 | |
|     ASSERT(document().layout_node());
 | |
|     return *document().layout_node();
 | |
| }
 | |
| 
 | |
| LayoutDocument& LayoutNode::root()
 | |
| {
 | |
|     ASSERT(document().layout_node());
 | |
|     return *document().layout_node();
 | |
| }
 | |
| 
 | |
| void LayoutNode::split_into_lines(LayoutBlock& container)
 | |
| {
 | |
|     for_each_child([&](auto& child) {
 | |
|         if (child.is_inline()) {
 | |
|             child.split_into_lines(container);
 | |
|         } else {
 | |
|             // FIXME: Support block children of inlines.
 | |
|         }
 | |
|     });
 | |
| }
 | |
| 
 | |
| void LayoutNode::set_needs_display()
 | |
| {
 | |
|     auto* frame = document().frame();
 | |
|     ASSERT(frame);
 | |
| 
 | |
|     if (auto* block = containing_block()) {
 | |
|         block->for_each_fragment([&](auto& fragment) {
 | |
|             if (&fragment.layout_node() == this || is_ancestor_of(fragment.layout_node())) {
 | |
|                 const_cast<Frame*>(frame)->set_needs_display(enclosing_int_rect(fragment.rect()));
 | |
|             }
 | |
|             return IterationDecision::Continue;
 | |
|         });
 | |
|     }
 | |
| }
 | |
| 
 | |
| Gfx::FloatPoint LayoutNode::box_type_agnostic_position() const
 | |
| {
 | |
|     if (is_box())
 | |
|         return to<LayoutBox>(*this).position();
 | |
|     ASSERT(is_inline());
 | |
|     Gfx::FloatPoint position;
 | |
|     if (auto* block = containing_block()) {
 | |
|         block->for_each_fragment([&](auto& fragment) {
 | |
|             if (&fragment.layout_node() == this || is_ancestor_of(fragment.layout_node())) {
 | |
|                 position = fragment.rect().location();
 | |
|                 return IterationDecision::Break;
 | |
|             }
 | |
|             return IterationDecision::Continue;
 | |
|         });
 | |
|     }
 | |
|     return position;
 | |
| }
 | |
| 
 | |
| }
 |