2020-01-18 09:38:21 +01:00
|
|
|
/*
|
|
|
|
|
* 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.
|
|
|
|
|
*/
|
|
|
|
|
|
2019-06-15 22:49:44 +02:00
|
|
|
#pragma once
|
|
|
|
|
|
2020-03-07 10:32:51 +01:00
|
|
|
#include <LibWeb/Layout/LayoutBox.h>
|
|
|
|
|
#include <LibWeb/Layout/LineBox.h>
|
2019-06-15 22:49:44 +02:00
|
|
|
|
2020-03-07 10:27:02 +01:00
|
|
|
namespace Web {
|
|
|
|
|
|
2019-06-15 22:49:44 +02:00
|
|
|
class Element;
|
|
|
|
|
|
2019-10-15 16:48:38 +02:00
|
|
|
class LayoutBlock : public LayoutBox {
|
2019-06-15 22:49:44 +02:00
|
|
|
public:
|
2020-06-24 19:41:12 +02:00
|
|
|
LayoutBlock(Document&, const Node*, NonnullRefPtr<StyleProperties>);
|
2019-06-15 22:49:44 +02:00
|
|
|
virtual ~LayoutBlock() override;
|
|
|
|
|
|
|
|
|
|
virtual const char* class_name() const override { return "LayoutBlock"; }
|
|
|
|
|
|
2020-05-26 21:53:10 +02:00
|
|
|
virtual void layout(LayoutMode = LayoutMode::Default) override;
|
2020-06-18 21:35:44 +02:00
|
|
|
virtual void paint(PaintContext&, PaintPhase) override;
|
2019-06-20 23:00:26 +02:00
|
|
|
|
2019-07-08 17:42:23 +02:00
|
|
|
virtual LayoutNode& inline_wrapper() override;
|
|
|
|
|
|
2019-10-03 15:20:13 +02:00
|
|
|
Vector<LineBox>& line_boxes() { return m_line_boxes; }
|
|
|
|
|
const Vector<LineBox>& line_boxes() const { return m_line_boxes; }
|
|
|
|
|
|
2019-10-13 17:24:00 +02:00
|
|
|
LineBox& ensure_last_line_box();
|
|
|
|
|
LineBox& add_line_box();
|
|
|
|
|
|
2020-06-10 10:57:59 +02:00
|
|
|
virtual HitTestResult hit_test(const Gfx::IntPoint&) const override;
|
2019-10-03 15:20:13 +02:00
|
|
|
|
2019-10-15 16:48:38 +02:00
|
|
|
LayoutBlock* previous_sibling() { return to<LayoutBlock>(LayoutNode::previous_sibling()); }
|
|
|
|
|
const LayoutBlock* previous_sibling() const { return to<LayoutBlock>(LayoutNode::previous_sibling()); }
|
|
|
|
|
LayoutBlock* next_sibling() { return to<LayoutBlock>(LayoutNode::next_sibling()); }
|
|
|
|
|
const LayoutBlock* next_sibling() const { return to<LayoutBlock>(LayoutNode::next_sibling()); }
|
|
|
|
|
|
2019-10-20 09:14:12 +02:00
|
|
|
template<typename Callback>
|
|
|
|
|
void for_each_fragment(Callback);
|
|
|
|
|
template<typename Callback>
|
|
|
|
|
void for_each_fragment(Callback) const;
|
|
|
|
|
|
2020-05-26 21:53:10 +02:00
|
|
|
virtual void split_into_lines(LayoutBlock& container, LayoutMode) override;
|
|
|
|
|
|
2020-06-28 20:09:41 +02:00
|
|
|
void layout_inside(LayoutMode);
|
|
|
|
|
|
2020-06-09 21:08:15 +02:00
|
|
|
protected:
|
|
|
|
|
void compute_width();
|
|
|
|
|
void compute_height();
|
2020-06-12 14:19:03 +02:00
|
|
|
void layout_absolutely_positioned_descendants();
|
2020-05-05 16:06:22 +02:00
|
|
|
|
2020-06-28 15:11:08 +02:00
|
|
|
virtual float width_of_logical_containing_block() const;
|
|
|
|
|
|
2019-06-15 22:49:44 +02:00
|
|
|
private:
|
2019-07-01 07:28:37 +02:00
|
|
|
virtual bool is_block() const override { return true; }
|
|
|
|
|
|
2020-06-18 21:16:29 +02:00
|
|
|
struct ShrinkToFitResult {
|
|
|
|
|
float preferred_width { 0 };
|
|
|
|
|
float preferred_minimum_width { 0 };
|
|
|
|
|
};
|
|
|
|
|
ShrinkToFitResult calculate_shrink_to_fit_width();
|
2020-06-18 18:28:32 +02:00
|
|
|
|
|
|
|
|
void compute_width_for_absolutely_positioned_block();
|
|
|
|
|
|
LibWeb: Reorganize layout algorithm
Previously, layout recursively performed these steps (roughly):
1. Compute own width
2. Compute own position
3. Layout in-flow children
4. Compute own height
5. Layout absolutely positioned descendants
However, step (2) was pretty inconsistent. Some things computed their
own position, others had their parent do it for them, etc.
To get closer to CSS spec language, and make things easier in general,
this patch reorganizes the algorithm into:
1. Compute own width & height
2. Compute width & height of in-flow managed descendants
3. Move in-flow managed descendants to their final position
4. Layout absolutely positioned descendants
Block layout is now driven by the containing block, which will iterate
the descendants it's responsible for. There are a lot of inefficient
patterns in this logic right now, but they can easily be replaced with
better iteration functions once we settle on a long-term architecture.
Since the ICB (LayoutDocument) is at (0, 0), it doesn't rely on a
containing block to move it into place.
This code is still evolving along with my understanding of CSS layout,
so it's likely that we'll reorganize this again sooner or later. :^)
2020-06-14 18:48:10 +02:00
|
|
|
void place_block_level_non_replaced_element_in_normal_flow(LayoutBlock&);
|
|
|
|
|
void place_block_level_replaced_element_in_normal_flow(LayoutReplaced&);
|
|
|
|
|
void layout_absolutely_positioned_descendant(LayoutBox&);
|
|
|
|
|
|
2019-10-05 23:47:06 +02:00
|
|
|
NonnullRefPtr<StyleProperties> style_for_anonymous_block() const;
|
|
|
|
|
|
2020-05-26 21:53:10 +02:00
|
|
|
void layout_inline_children(LayoutMode);
|
LibWeb: Reorganize layout algorithm
Previously, layout recursively performed these steps (roughly):
1. Compute own width
2. Compute own position
3. Layout in-flow children
4. Compute own height
5. Layout absolutely positioned descendants
However, step (2) was pretty inconsistent. Some things computed their
own position, others had their parent do it for them, etc.
To get closer to CSS spec language, and make things easier in general,
this patch reorganizes the algorithm into:
1. Compute own width & height
2. Compute width & height of in-flow managed descendants
3. Move in-flow managed descendants to their final position
4. Layout absolutely positioned descendants
Block layout is now driven by the containing block, which will iterate
the descendants it's responsible for. There are a lot of inefficient
patterns in this logic right now, but they can easily be replaced with
better iteration functions once we settle on a long-term architecture.
Since the ICB (LayoutDocument) is at (0, 0), it doesn't rely on a
containing block to move it into place.
This code is still evolving along with my understanding of CSS layout,
so it's likely that we'll reorganize this again sooner or later. :^)
2020-06-14 18:48:10 +02:00
|
|
|
void layout_contained_boxes(LayoutMode);
|
2019-10-03 15:20:13 +02:00
|
|
|
|
|
|
|
|
Vector<LineBox> m_line_boxes;
|
2019-06-15 22:49:44 +02:00
|
|
|
};
|
2019-10-09 21:25:29 +02:00
|
|
|
|
|
|
|
|
template<typename Callback>
|
2019-10-20 09:14:12 +02:00
|
|
|
void LayoutBlock::for_each_fragment(Callback callback)
|
|
|
|
|
{
|
|
|
|
|
for (auto& line_box : line_boxes()) {
|
|
|
|
|
for (auto& fragment : line_box.fragments()) {
|
|
|
|
|
if (callback(fragment) == IterationDecision::Break)
|
|
|
|
|
return;
|
|
|
|
|
}
|
|
|
|
|
}
|
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
template<typename Callback>
|
|
|
|
|
void LayoutBlock::for_each_fragment(Callback callback) const
|
2019-10-09 21:25:29 +02:00
|
|
|
{
|
2019-10-20 09:14:12 +02:00
|
|
|
for (auto& line_box : line_boxes()) {
|
2019-10-09 21:25:29 +02:00
|
|
|
for (auto& fragment : line_box.fragments()) {
|
|
|
|
|
if (callback(fragment) == IterationDecision::Break)
|
|
|
|
|
return;
|
|
|
|
|
}
|
|
|
|
|
}
|
|
|
|
|
}
|
2019-10-15 14:19:52 +02:00
|
|
|
|
|
|
|
|
template<>
|
2020-06-23 23:21:39 +02:00
|
|
|
ALWAYS_INLINE bool is<LayoutBlock>(const LayoutNode& node)
|
2019-10-15 14:19:52 +02:00
|
|
|
{
|
|
|
|
|
return node.is_block();
|
|
|
|
|
}
|
2020-03-07 10:27:02 +01:00
|
|
|
|
|
|
|
|
}
|