slint/internal/core/item_rendering.rs
Simon Hausmann eb825f2e95 Support default-font-* properties in Live-Preview
... by changing the resolution for the `WindowItem` to traverse the
item tree from the current item, instead of going to the window.

This doesn't quite fix #4298 because `rem` resolution is still missing.
That requires the built-in default font size function to be fixed as
well, which is non-trivial.

cc #4298
2025-04-24 09:18:45 +02:00

1219 lines
46 KiB
Rust

// Copyright © SixtyFPS GmbH <info@slint.dev>
// SPDX-License-Identifier: GPL-3.0-only OR LicenseRef-Slint-Royalty-free-2.0 OR LicenseRef-Slint-Software-3.0
#![warn(missing_docs)]
//! module for rendering the tree of items
use super::graphics::RenderingCache;
use super::items::*;
use crate::graphics::{CachedGraphicsData, FontRequest, Image, IntRect};
use crate::item_tree::ItemTreeRc;
use crate::item_tree::{ItemVisitor, ItemVisitorResult, ItemVisitorVTable, VisitChildrenResult};
use crate::lengths::{
ItemTransform, LogicalBorderRadius, LogicalLength, LogicalPoint, LogicalPx, LogicalRect,
LogicalSize, LogicalVector, SizeLengths,
};
use crate::properties::PropertyTracker;
use crate::window::{WindowAdapter, WindowInner};
use crate::{Brush, Coord, SharedString};
use alloc::boxed::Box;
use alloc::rc::Rc;
use core::cell::{Cell, RefCell};
use core::pin::Pin;
#[cfg(feature = "std")]
use std::collections::HashMap;
use vtable::VRc;
/// This structure must be present in items that are Rendered and contains information.
/// Used by the backend.
#[derive(Default, Debug)]
#[repr(C)]
pub struct CachedRenderingData {
/// Used and modified by the backend, should be initialized to 0 by the user code
pub(crate) cache_index: Cell<usize>,
/// Used and modified by the backend, should be initialized to 0 by the user code.
/// The backend compares this generation against the one of the cache to verify
/// the validity of the cache_index field.
pub(crate) cache_generation: Cell<usize>,
}
impl CachedRenderingData {
/// This function can be used to remove an entry from the rendering cache for a given item, if it
/// exists, i.e. if any data was ever cached. This is typically called by the graphics backend's
/// implementation of the release_item_graphics_cache function.
pub fn release<T>(&self, cache: &mut RenderingCache<T>) -> Option<T> {
if self.cache_generation.get() == cache.generation() {
let index = self.cache_index.get();
self.cache_generation.set(0);
Some(cache.remove(index).data)
} else {
None
}
}
/// Return the value if it is in the cache
pub fn get_entry<'a, T>(
&self,
cache: &'a mut RenderingCache<T>,
) -> Option<&'a mut crate::graphics::CachedGraphicsData<T>> {
let index = self.cache_index.get();
if self.cache_generation.get() == cache.generation() {
cache.get_mut(index)
} else {
None
}
}
}
/// A per-item cache.
///
/// Cache rendering information for a given item.
///
/// Use [`ItemCache::get_or_update_cache_entry`] to get or update the items, the
/// cache is automatically invalided when the property gets dirty.
/// [`ItemCache::component_destroyed`] must be called to clear the cache for that
/// component.
#[cfg(feature = "std")]
pub struct ItemCache<T> {
/// The pointer is a pointer to a component
map: RefCell<HashMap<*const vtable::Dyn, HashMap<u32, CachedGraphicsData<T>>>>,
/// Track if the window scale factor changes; used to clear the cache if necessary.
window_scale_factor_tracker: Pin<Box<PropertyTracker>>,
}
#[cfg(feature = "std")]
impl<T> Default for ItemCache<T> {
fn default() -> Self {
Self { map: Default::default(), window_scale_factor_tracker: Box::pin(Default::default()) }
}
}
#[cfg(feature = "std")]
impl<T: Clone> ItemCache<T> {
/// Returns the cached value associated to the `item_rc` if it is still valid.
/// Otherwise call the `update_fn` to compute that value, and track property access
/// so it is automatically invalided when property becomes dirty.
pub fn get_or_update_cache_entry(&self, item_rc: &ItemRc, update_fn: impl FnOnce() -> T) -> T {
let component = &(**item_rc.item_tree()) as *const _;
let mut borrowed = self.map.borrow_mut();
match borrowed.entry(component).or_default().entry(item_rc.index()) {
std::collections::hash_map::Entry::Occupied(mut entry) => {
let mut tracker = entry.get_mut().dependency_tracker.take();
drop(borrowed);
let maybe_new_data = tracker
.get_or_insert_with(|| Box::pin(Default::default()))
.as_ref()
.evaluate_if_dirty(update_fn);
let mut borrowed = self.map.borrow_mut();
let e = borrowed.get_mut(&component).unwrap().get_mut(&item_rc.index()).unwrap();
e.dependency_tracker = tracker;
if let Some(new_data) = maybe_new_data {
e.data = new_data.clone();
new_data
} else {
e.data.clone()
}
}
std::collections::hash_map::Entry::Vacant(_) => {
drop(borrowed);
let new_entry = CachedGraphicsData::new(update_fn);
let data = new_entry.data.clone();
self.map
.borrow_mut()
.get_mut(&component)
.unwrap()
.insert(item_rc.index(), new_entry);
data
}
}
}
/// Returns the cached value associated with the `item_rc` if it is in the cache
/// and still valid.
pub fn with_entry<U>(
&self,
item_rc: &ItemRc,
callback: impl FnOnce(&T) -> Option<U>,
) -> Option<U> {
let component = &(**item_rc.item_tree()) as *const _;
self.map
.borrow()
.get(&component)
.and_then(|per_component_entries| per_component_entries.get(&item_rc.index()))
.and_then(|entry| callback(&entry.data))
}
/// Clears the cache if the window's scale factor has changed since the last call.
pub fn clear_cache_if_scale_factor_changed(&self, window: &crate::api::Window) {
if self.window_scale_factor_tracker.is_dirty() {
self.window_scale_factor_tracker
.as_ref()
.evaluate_as_dependency_root(|| window.scale_factor());
self.clear_all();
}
}
/// free the whole cache
pub fn clear_all(&self) {
self.map.borrow_mut().clear();
}
/// Function that must be called when a component is destroyed.
///
/// Usually can be called from [`crate::window::WindowAdapterInternal::unregister_item_tree`]
pub fn component_destroyed(&self, component: crate::item_tree::ItemTreeRef) {
let component_ptr: *const _ =
crate::item_tree::ItemTreeRef::as_ptr(component).cast().as_ptr();
self.map.borrow_mut().remove(&component_ptr);
}
/// free the cache for a given item
pub fn release(&self, item_rc: &ItemRc) {
let component = &(**item_rc.item_tree()) as *const _;
if let Some(sub) = self.map.borrow_mut().get_mut(&component) {
sub.remove(&item_rc.index());
}
}
/// Returns true if there are no entries in the cache; false otherwise.
pub fn is_empty(&self) -> bool {
self.map.borrow().is_empty()
}
}
/// Renders the children of the item with the specified index into the renderer.
pub fn render_item_children(
renderer: &mut dyn ItemRenderer,
component: &ItemTreeRc,
index: isize,
window_adapter: &Rc<dyn WindowAdapter>,
) {
let mut actual_visitor =
|component: &ItemTreeRc, index: u32, item: Pin<ItemRef>| -> VisitChildrenResult {
renderer.save_state();
let item_rc = ItemRc::new(component.clone(), index);
let (do_draw, item_geometry) = renderer.filter_item(&item_rc, window_adapter);
let item_origin = item_geometry.origin;
renderer.translate(item_origin.to_vector());
// Don't render items that are clipped, with the exception of the Clip or Flickable since
// they themselves clip their content.
let render_result = if do_draw
|| item.as_ref().clips_children()
// HACK, the geometry of the box shadow does not include the shadow, because when the shadow is the root for repeated elements it would translate the children
|| ItemRef::downcast_pin::<BoxShadow>(item).is_some()
{
item.as_ref().render(
&mut (renderer as &mut dyn ItemRenderer),
&item_rc,
item_geometry.size,
)
} else {
RenderingResult::ContinueRenderingChildren
};
if matches!(render_result, RenderingResult::ContinueRenderingChildren) {
render_item_children(renderer, component, index as isize, window_adapter);
}
renderer.restore_state();
VisitChildrenResult::CONTINUE
};
vtable::new_vref!(let mut actual_visitor : VRefMut<ItemVisitorVTable> for ItemVisitor = &mut actual_visitor);
VRc::borrow_pin(component).as_ref().visit_children_item(
index,
crate::item_tree::TraversalOrder::BackToFront,
actual_visitor,
);
}
/// Renders the tree of items that component holds, using the specified renderer. Rendering is done
/// relative to the specified origin.
pub fn render_component_items(
component: &ItemTreeRc,
renderer: &mut dyn ItemRenderer,
origin: LogicalPoint,
window_adapter: &Rc<dyn WindowAdapter>,
) {
renderer.save_state();
renderer.translate(origin.to_vector());
render_item_children(renderer, component, -1, window_adapter);
renderer.restore_state();
}
/// Compute the bounding rect of all children. This does /not/ include item's own bounding rect. Remember to run this
/// via `evaluate_no_tracking`.
pub fn item_children_bounding_rect(
component: &ItemTreeRc,
index: isize,
clip_rect: &LogicalRect,
) -> LogicalRect {
let mut bounding_rect = LogicalRect::zero();
let mut actual_visitor =
|component: &ItemTreeRc, index: u32, item: Pin<ItemRef>| -> VisitChildrenResult {
let item_geometry = ItemTreeRc::borrow_pin(component).as_ref().item_geometry(index);
let local_clip_rect = clip_rect.translate(-item_geometry.origin.to_vector());
if let Some(clipped_item_geometry) = item_geometry.intersection(clip_rect) {
bounding_rect = bounding_rect.union(&clipped_item_geometry);
}
if !item.as_ref().clips_children() {
bounding_rect = bounding_rect.union(&item_children_bounding_rect(
component,
index as isize,
&local_clip_rect,
));
}
VisitChildrenResult::CONTINUE
};
vtable::new_vref!(let mut actual_visitor : VRefMut<ItemVisitorVTable> for ItemVisitor = &mut actual_visitor);
VRc::borrow_pin(component).as_ref().visit_children_item(
index,
crate::item_tree::TraversalOrder::BackToFront,
actual_visitor,
);
bounding_rect
}
/// Trait for an item that represent a Rectangle to the Renderer
#[allow(missing_docs)]
pub trait RenderRectangle {
fn background(self: Pin<&Self>) -> Brush;
}
/// Trait for an item that represent a Rectangle with a border to the Renderer
#[allow(missing_docs)]
pub trait RenderBorderRectangle {
fn background(self: Pin<&Self>) -> Brush;
fn border_width(self: Pin<&Self>) -> LogicalLength;
fn border_radius(self: Pin<&Self>) -> LogicalBorderRadius;
fn border_color(self: Pin<&Self>) -> Brush;
}
/// Trait for an item that represents an Image towards the renderer
#[allow(missing_docs)]
pub trait RenderImage {
fn target_size(self: Pin<&Self>) -> LogicalSize;
fn source(self: Pin<&Self>) -> Image;
fn source_clip(self: Pin<&Self>) -> Option<IntRect>;
fn image_fit(self: Pin<&Self>) -> ImageFit;
fn rendering(self: Pin<&Self>) -> ImageRendering;
fn colorize(self: Pin<&Self>) -> Brush;
fn alignment(self: Pin<&Self>) -> (ImageHorizontalAlignment, ImageVerticalAlignment);
fn tiling(self: Pin<&Self>) -> (ImageTiling, ImageTiling);
}
/// Trait for an item that represents an Text towards the renderer
#[allow(missing_docs)]
pub trait RenderText {
fn target_size(self: Pin<&Self>) -> LogicalSize;
fn text(self: Pin<&Self>) -> SharedString;
fn font_request(self: Pin<&Self>, self_rc: &ItemRc) -> FontRequest;
fn color(self: Pin<&Self>) -> Brush;
fn alignment(self: Pin<&Self>) -> (TextHorizontalAlignment, TextVerticalAlignment);
fn wrap(self: Pin<&Self>) -> TextWrap;
fn overflow(self: Pin<&Self>) -> TextOverflow;
fn letter_spacing(self: Pin<&Self>) -> LogicalLength;
fn stroke(self: Pin<&Self>) -> (Brush, LogicalLength, TextStrokeStyle);
fn text_bounding_rect(
self: Pin<&Self>,
self_rc: &ItemRc,
window_adapter: &Rc<dyn WindowAdapter>,
mut geometry: euclid::Rect<f32, crate::lengths::LogicalPx>,
) -> euclid::Rect<f32, crate::lengths::LogicalPx> {
let window_inner = WindowInner::from_pub(window_adapter.window());
let text_string = self.text();
let font_request = self.font_request(self_rc);
let scale_factor = crate::lengths::ScaleFactor::new(window_inner.scale_factor());
let max_width = geometry.size.width_length();
geometry.size = geometry.size.max(
window_adapter
.renderer()
.text_size(
font_request.clone(),
text_string.as_str(),
Some(max_width.cast()),
scale_factor,
self.wrap(),
)
.cast(),
);
geometry
}
}
/// Trait used to render each items.
///
/// The item needs to be rendered relative to its (x,y) position. For example,
/// draw_rectangle should draw a rectangle in `(pos.x + rect.x, pos.y + rect.y)`
#[allow(missing_docs)]
pub trait ItemRenderer {
fn draw_rectangle(
&mut self,
rect: Pin<&dyn RenderRectangle>,
_self_rc: &ItemRc,
_size: LogicalSize,
_cache: &CachedRenderingData,
);
fn draw_border_rectangle(
&mut self,
rect: Pin<&dyn RenderBorderRectangle>,
_self_rc: &ItemRc,
_size: LogicalSize,
_cache: &CachedRenderingData,
);
fn draw_window_background(
&mut self,
rect: Pin<&dyn RenderRectangle>,
self_rc: &ItemRc,
size: LogicalSize,
cache: &CachedRenderingData,
);
fn draw_image(
&mut self,
image: Pin<&dyn RenderImage>,
_self_rc: &ItemRc,
_size: LogicalSize,
_cache: &CachedRenderingData,
);
fn draw_text(
&mut self,
text: Pin<&dyn RenderText>,
_self_rc: &ItemRc,
_size: LogicalSize,
_cache: &CachedRenderingData,
);
fn draw_text_input(
&mut self,
text_input: Pin<&TextInput>,
_self_rc: &ItemRc,
_size: LogicalSize,
);
#[cfg(feature = "std")]
fn draw_path(&mut self, path: Pin<&Path>, _self_rc: &ItemRc, _size: LogicalSize);
fn draw_box_shadow(
&mut self,
box_shadow: Pin<&BoxShadow>,
_self_rc: &ItemRc,
_size: LogicalSize,
);
fn visit_opacity(
&mut self,
opacity_item: Pin<&Opacity>,
_self_rc: &ItemRc,
_size: LogicalSize,
) -> RenderingResult {
self.apply_opacity(opacity_item.opacity());
RenderingResult::ContinueRenderingChildren
}
fn visit_layer(
&mut self,
_layer_item: Pin<&Layer>,
_self_rc: &ItemRc,
_size: LogicalSize,
) -> RenderingResult {
// Not supported
RenderingResult::ContinueRenderingChildren
}
// Apply the bounds of the Clip element, if enabled. The default implementation calls
// combine_clip, but the render may choose an alternate way of implementing the clip.
// For example the GL backend uses a layered rendering approach.
fn visit_clip(
&mut self,
clip_item: Pin<&Clip>,
item_rc: &ItemRc,
_size: LogicalSize,
) -> RenderingResult {
if clip_item.clip() {
let geometry = item_rc.geometry();
let clip_region_valid = self.combine_clip(
LogicalRect::new(LogicalPoint::default(), geometry.size),
clip_item.logical_border_radius(),
clip_item.border_width(),
);
// If clipping is enabled but the clip element is outside the visible range, then we don't
// need to bother doing anything, not even rendering the children.
if !clip_region_valid {
return RenderingResult::ContinueRenderingWithoutChildren;
}
}
RenderingResult::ContinueRenderingChildren
}
/// Clip the further call until restore_state.
/// radius/border_width can be used for border rectangle clip.
/// (FIXME: consider removing radius/border_width and have another function that take a path instead)
/// Returns a boolean indicating the state of the new clip region: true if the clip region covers
/// an area; false if the clip region is empty.
fn combine_clip(
&mut self,
rect: LogicalRect,
radius: LogicalBorderRadius,
border_width: LogicalLength,
) -> bool;
/// Get the current clip bounding box in the current transformed coordinate.
fn get_current_clip(&self) -> LogicalRect;
fn translate(&mut self, distance: LogicalVector);
fn translation(&self) -> LogicalVector {
unimplemented!()
}
fn rotate(&mut self, angle_in_degrees: f32);
/// Apply the opacity (between 0 and 1) for all following items until the next call to restore_state.
fn apply_opacity(&mut self, opacity: f32);
fn save_state(&mut self);
fn restore_state(&mut self);
/// Returns the scale factor
fn scale_factor(&self) -> f32;
/// Draw a pixmap in position indicated by the `pos`.
/// The pixmap will be taken from cache if the cache is valid, otherwise, update_fn will be called
/// with a callback that need to be called once with `fn (width, height, data)` where data are the
/// RGBA premultiplied pixel values
fn draw_cached_pixmap(
&mut self,
item_cache: &ItemRc,
update_fn: &dyn Fn(&mut dyn FnMut(u32, u32, &[u8])),
);
/// Draw the given string with the specified color at current (0, 0) with the default font. Mainly
/// used by the performance counter overlay.
fn draw_string(&mut self, string: &str, color: crate::Color);
fn draw_image_direct(&mut self, image: crate::graphics::Image);
/// This is called before it is being rendered (before the draw_* function).
/// Returns
/// - if the item needs to be drawn (false means it is clipped or doesn't need to be drawn)
/// - the geometry of the item
fn filter_item(
&mut self,
item: &ItemRc,
window_adapter: &Rc<dyn WindowAdapter>,
) -> (bool, LogicalRect) {
let item_geometry = item.geometry();
// Query bounding rect untracked, as properties that affect the bounding rect are already tracked
// when rendering the item.
let bounding_rect = crate::properties::evaluate_no_tracking(|| {
item.bounding_rect(&item_geometry, window_adapter)
});
(self.get_current_clip().intersects(&bounding_rect), item_geometry)
}
fn window(&self) -> &crate::window::WindowInner;
/// Return the internal renderer
fn as_any(&mut self) -> Option<&mut dyn core::any::Any>;
/// Returns any rendering metrics collecting since the creation of the renderer (typically
/// per frame)
fn metrics(&self) -> crate::graphics::rendering_metrics_collector::RenderingMetrics {
Default::default()
}
}
/// Helper trait to express the features of an item renderer.
pub trait ItemRendererFeatures {
/// The renderer supports applying 2D transformations to items.
const SUPPORTS_TRANSFORMATIONS: bool;
}
/// After rendering an item, we cache the geometry and the transform it applies to
/// children.
#[derive(Clone)]
pub enum CachedItemBoundingBoxAndTransform {
/// A regular item with a translation
RegularItem {
/// The item's bounding rect relative to its parent.
bounding_rect: LogicalRect,
/// The item's offset relative to its parent.
offset: LogicalVector,
},
/// An item such as Rotate that defines an additional transformation
ItemWithTransform {
/// The item's bounding rect relative to its parent.
bounding_rect: LogicalRect,
/// The item's transform to apply to children.
transform: Box<ItemTransform>,
},
/// A clip item.
ClipItem {
/// The item's geometry relative to its parent.
geometry: LogicalRect,
},
}
impl CachedItemBoundingBoxAndTransform {
fn bounding_rect(&self) -> &LogicalRect {
match self {
CachedItemBoundingBoxAndTransform::RegularItem { bounding_rect, .. } => bounding_rect,
CachedItemBoundingBoxAndTransform::ItemWithTransform { bounding_rect, .. } => {
bounding_rect
}
CachedItemBoundingBoxAndTransform::ClipItem { geometry } => geometry,
}
}
fn transform(&self) -> ItemTransform {
match self {
CachedItemBoundingBoxAndTransform::RegularItem { offset, .. } => {
ItemTransform::translation(offset.x as f32, offset.y as f32)
}
CachedItemBoundingBoxAndTransform::ItemWithTransform { transform, .. } => **transform,
CachedItemBoundingBoxAndTransform::ClipItem { geometry } => {
ItemTransform::translation(geometry.origin.x as f32, geometry.origin.y as f32)
}
}
}
fn new<T: ItemRendererFeatures>(
item_rc: &ItemRc,
window_adapter: &Rc<dyn WindowAdapter>,
) -> Self {
let geometry = item_rc.geometry();
if item_rc.borrow().as_ref().clips_children() {
return Self::ClipItem { geometry };
}
// Evaluate the bounding rect untracked, as properties that affect the bounding rect are already tracked
// at rendering time.
let bounding_rect = crate::properties::evaluate_no_tracking(|| {
item_rc.bounding_rect(&geometry, window_adapter)
});
if let Some(complex_child_transform) =
T::SUPPORTS_TRANSFORMATIONS.then(|| item_rc.children_transform()).flatten()
{
Self::ItemWithTransform {
bounding_rect,
transform: complex_child_transform
.then_translate(geometry.origin.to_vector().cast())
.into(),
}
} else {
Self::RegularItem { bounding_rect, offset: geometry.origin.to_vector() }
}
}
}
/// The cache that needs to be held by the Window for the partial rendering
pub type PartialRenderingCache = RenderingCache<CachedItemBoundingBoxAndTransform>;
/// A region composed of a few rectangles that need to be redrawn.
#[derive(Default, Clone, Debug)]
pub struct DirtyRegion {
rectangles: [euclid::Box2D<Coord, LogicalPx>; Self::MAX_COUNT],
count: usize,
}
impl DirtyRegion {
/// The maximum number of rectangles that can be stored in a DirtyRegion
pub(crate) const MAX_COUNT: usize = 3;
/// An iterator over the part of the region (they can overlap)
pub fn iter(&self) -> impl Iterator<Item = euclid::Box2D<Coord, LogicalPx>> + '_ {
(0..self.count).map(|x| self.rectangles[x])
}
/// Add a rectangle to the region.
///
/// Note that if the region becomes too complex, it might be simplified by being bigger than the actual union.
pub fn add_rect(&mut self, rect: LogicalRect) {
self.add_box(rect.to_box2d());
}
/// Add a box to the region
///
/// Note that if the region becomes too complex, it might be simplified by being bigger than the actual union.
pub fn add_box(&mut self, b: euclid::Box2D<Coord, LogicalPx>) {
if b.is_empty() {
return;
}
let mut i = 0;
while i < self.count {
let r = &self.rectangles[i];
if r.contains_box(&b) {
// the rectangle is already in the union
return;
} else if b.contains_box(r) {
self.rectangles.swap(i, self.count - 1);
self.count -= 1;
continue;
}
i += 1;
}
if self.count < Self::MAX_COUNT {
self.rectangles[self.count] = b;
self.count += 1;
} else {
let best_merge = (0..self.count)
.map(|i| (i, self.rectangles[i].union(&b).area() - self.rectangles[i].area()))
.min_by(|a, b| PartialOrd::partial_cmp(&a.1, &b.1).unwrap())
.expect("There should always be rectangles")
.0;
self.rectangles[best_merge] = self.rectangles[best_merge].union(&b);
}
}
/// Make an union of two regions.
///
/// Note that if the region becomes too complex, it might be simplified by being bigger than the actual union
#[must_use]
pub fn union(&self, other: &Self) -> Self {
let mut s = self.clone();
for o in other.iter() {
s.add_box(o)
}
s
}
/// Bounding rectangle of the region.
#[must_use]
pub fn bounding_rect(&self) -> LogicalRect {
if self.count == 0 {
return Default::default();
}
let mut r = self.rectangles[0];
for i in 1..self.count {
r = r.union(&self.rectangles[i]);
}
r.to_rect()
}
/// Intersection of a region and a rectangle.
#[must_use]
pub fn intersection(&self, other: LogicalRect) -> DirtyRegion {
let mut ret = self.clone();
let other = other.to_box2d();
let mut i = 0;
while i < ret.count {
if let Some(x) = ret.rectangles[i].intersection(&other) {
ret.rectangles[i] = x;
} else {
ret.count -= 1;
ret.rectangles.swap(i, ret.count);
continue;
}
i += 1;
}
ret
}
fn draw_intersects(&self, clipped_geom: LogicalRect) -> bool {
let b = clipped_geom.to_box2d();
self.iter().any(|r| r.intersects(&b))
}
}
impl From<LogicalRect> for DirtyRegion {
fn from(value: LogicalRect) -> Self {
let mut s = Self::default();
s.add_rect(value);
s
}
}
/// This enum describes which parts of the buffer passed to the [`SoftwareRenderer`](crate::software_renderer::SoftwareRenderer) may be re-used to speed up painting.
// FIXME: #[non_exhaustive] #3023
#[derive(PartialEq, Eq, Debug, Clone, Default, Copy)]
pub enum RepaintBufferType {
#[default]
/// The full window is always redrawn. No attempt at partial rendering will be made.
NewBuffer,
/// Only redraw the parts that have changed since the previous call to render().
///
/// This variant assumes that the same buffer is passed on every call to render() and
/// that it still contains the previously rendered frame.
ReusedBuffer,
/// Redraw the part that have changed since the last two frames were drawn.
///
/// This is used when using double buffering and swapping of the buffers.
SwappedBuffers,
}
/// Put this structure in the renderer to help with partial rendering
pub struct PartialRenderer<'a, T> {
cache: &'a RefCell<PartialRenderingCache>,
/// The region of the screen which is considered dirty and that should be repainted
pub dirty_region: DirtyRegion,
/// The actual renderer which the drawing call will be forwarded to
pub actual_renderer: T,
/// The window adapter the renderer is rendering into.
pub window_adapter: Rc<dyn WindowAdapter>,
}
impl<'a, T: ItemRenderer + ItemRendererFeatures> PartialRenderer<'a, T> {
/// Create a new PartialRenderer
pub fn new(
cache: &'a RefCell<PartialRenderingCache>,
initial_dirty_region: DirtyRegion,
actual_renderer: T,
) -> Self {
let window_adapter = actual_renderer.window().window_adapter();
Self { cache, dirty_region: initial_dirty_region, actual_renderer, window_adapter }
}
/// Visit the tree of item and compute what are the dirty regions
pub fn compute_dirty_regions(
&mut self,
component: &ItemTreeRc,
origin: LogicalPoint,
size: LogicalSize,
) {
#[derive(Clone, Copy)]
struct ComputeDirtyRegionState {
transform_to_screen: ItemTransform,
old_transform_to_screen: ItemTransform,
clipped: LogicalRect,
must_refresh_children: bool,
}
impl ComputeDirtyRegionState {
/// Adjust transform_to_screen and old_transform_to_screen to map from item coordinates
/// to the screen when using it on a child, specified by its children transform.
fn adjust_transforms_for_child(
&mut self,
children_transform: &ItemTransform,
old_children_transform: &ItemTransform,
) {
self.transform_to_screen = children_transform.then(&self.transform_to_screen);
self.old_transform_to_screen =
old_children_transform.then(&self.old_transform_to_screen);
}
}
crate::item_tree::visit_items(
component,
crate::item_tree::TraversalOrder::BackToFront,
|component, item, index, state| {
let mut new_state = *state;
let mut borrowed = self.cache.borrow_mut();
let item_rc = ItemRc::new(component.clone(), index);
match item.cached_rendering_data_offset().get_entry(&mut borrowed) {
Some(CachedGraphicsData {
data: cached_geom,
dependency_tracker: Some(tr),
}) => {
if tr.is_dirty() {
let old_geom = cached_geom.clone();
drop(borrowed);
let new_geom = crate::properties::evaluate_no_tracking(|| {
CachedItemBoundingBoxAndTransform::new::<T>(
&item_rc,
&self.window_adapter,
)
});
self.mark_dirty_rect(
old_geom.bounding_rect(),
state.old_transform_to_screen,
&state.clipped,
);
self.mark_dirty_rect(
new_geom.bounding_rect(),
state.transform_to_screen,
&state.clipped,
);
new_state.adjust_transforms_for_child(
&new_geom.transform(),
&old_geom.transform(),
);
if ItemRef::downcast_pin::<Clip>(item).is_some()
|| ItemRef::downcast_pin::<Opacity>(item).is_some()
{
// When the opacity or the clip change, this will impact all the children, including
// the ones outside the element, regardless if they are themselves dirty or not.
new_state.must_refresh_children = true;
}
ItemVisitorResult::Continue(new_state)
} else {
tr.as_ref().register_as_dependency_to_current_binding();
if state.must_refresh_children
|| new_state.transform_to_screen
!= new_state.old_transform_to_screen
{
self.mark_dirty_rect(
cached_geom.bounding_rect(),
state.old_transform_to_screen,
&state.clipped,
);
self.mark_dirty_rect(
cached_geom.bounding_rect(),
state.transform_to_screen,
&state.clipped,
);
}
new_state.adjust_transforms_for_child(
&cached_geom.transform(),
&cached_geom.transform(),
);
if let CachedItemBoundingBoxAndTransform::ClipItem { geometry } =
&cached_geom
{
new_state.clipped = new_state
.clipped
.intersection(
&state
.transform_to_screen
.outer_transformed_rect(&geometry.cast())
.cast()
.union(
&state
.old_transform_to_screen
.outer_transformed_rect(&geometry.cast())
.cast(),
),
)
.unwrap_or_default();
}
ItemVisitorResult::Continue(new_state)
}
}
_ => {
drop(borrowed);
let bounding_rect = crate::properties::evaluate_no_tracking(|| {
let geom = CachedItemBoundingBoxAndTransform::new::<T>(
&item_rc,
&self.window_adapter,
);
new_state
.adjust_transforms_for_child(&geom.transform(), &geom.transform());
if let CachedItemBoundingBoxAndTransform::ClipItem { geometry } = geom {
new_state.clipped = new_state
.clipped
.intersection(
&state
.transform_to_screen
.outer_transformed_rect(&geometry.cast())
.cast(),
)
.unwrap_or_default();
}
*geom.bounding_rect()
});
self.mark_dirty_rect(
&bounding_rect,
state.transform_to_screen,
&state.clipped,
);
ItemVisitorResult::Continue(new_state)
}
}
},
{
let initial_transform =
euclid::Transform2D::translation(origin.x as f32, origin.y as f32);
ComputeDirtyRegionState {
transform_to_screen: initial_transform,
old_transform_to_screen: initial_transform,
clipped: LogicalRect::from_size(size),
must_refresh_children: false,
}
},
);
}
fn mark_dirty_rect(
&mut self,
rect: &LogicalRect,
transform: ItemTransform,
clip_rect: &LogicalRect,
) {
if !rect.is_empty() {
if let Some(rect) =
transform.outer_transformed_rect(&rect.cast()).cast().intersection(clip_rect)
{
self.dirty_region.add_rect(rect);
}
}
}
fn do_rendering(
cache: &RefCell<PartialRenderingCache>,
rendering_data: &CachedRenderingData,
render_fn: impl FnOnce() -> CachedItemBoundingBoxAndTransform,
) {
let mut cache = cache.borrow_mut();
if let Some(entry) = rendering_data.get_entry(&mut cache) {
entry
.dependency_tracker
.get_or_insert_with(|| Box::pin(PropertyTracker::default()))
.as_ref()
.evaluate(render_fn);
} else {
let cache_entry = crate::graphics::CachedGraphicsData::new(render_fn);
rendering_data.cache_index.set(cache.insert(cache_entry));
rendering_data.cache_generation.set(cache.generation());
}
}
/// Move the actual renderer
pub fn into_inner(self) -> T {
self.actual_renderer
}
}
macro_rules! forward_rendering_call {
(fn $fn:ident($Ty:ty) $(-> $Ret:ty)?) => {
fn $fn(&mut self, obj: Pin<&$Ty>, item_rc: &ItemRc, size: LogicalSize) $(-> $Ret)? {
let mut ret = None;
Self::do_rendering(&self.cache, &obj.cached_rendering_data, || {
ret = Some(self.actual_renderer.$fn(obj, item_rc, size));
CachedItemBoundingBoxAndTransform::new::<T>(&item_rc, &self.window_adapter)
});
ret.unwrap_or_default()
}
};
}
macro_rules! forward_rendering_call2 {
(fn $fn:ident($Ty:ty) $(-> $Ret:ty)?) => {
fn $fn(&mut self, obj: Pin<&$Ty>, item_rc: &ItemRc, size: LogicalSize, cache: &CachedRenderingData) $(-> $Ret)? {
let mut ret = None;
Self::do_rendering(&self.cache, &cache, || {
ret = Some(self.actual_renderer.$fn(obj, item_rc, size, &cache));
CachedItemBoundingBoxAndTransform::new::<T>(&item_rc, &self.window_adapter)
});
ret.unwrap_or_default()
}
};
}
impl<T: ItemRenderer + ItemRendererFeatures> ItemRenderer for PartialRenderer<'_, T> {
fn filter_item(
&mut self,
item_rc: &ItemRc,
window_adapter: &Rc<dyn WindowAdapter>,
) -> (bool, LogicalRect) {
let item = item_rc.borrow();
let eval = || {
// registers dependencies on the geometry and clip properties.
CachedItemBoundingBoxAndTransform::new::<T>(item_rc, window_adapter)
};
let rendering_data = item.cached_rendering_data_offset();
let mut cache = self.cache.borrow_mut();
let item_bounding_rect = match rendering_data.get_entry(&mut cache) {
Some(CachedGraphicsData { data, dependency_tracker }) => {
dependency_tracker
.get_or_insert_with(|| Box::pin(PropertyTracker::default()))
.as_ref()
.evaluate_if_dirty(|| *data = eval());
*data.bounding_rect()
}
None => {
let cache_entry = crate::graphics::CachedGraphicsData::new(eval);
let geom = cache_entry.data.clone();
rendering_data.cache_index.set(cache.insert(cache_entry));
rendering_data.cache_generation.set(cache.generation());
*geom.bounding_rect()
}
};
let clipped_geom = self.get_current_clip().intersection(&item_bounding_rect);
let draw = clipped_geom.is_some_and(|clipped_geom| {
let clipped_geom = clipped_geom.translate(self.translation());
self.dirty_region.draw_intersects(clipped_geom)
});
// Query untracked, as the bounding rect calculation already registers a dependency on the geometry.
let item_geometry = crate::properties::evaluate_no_tracking(|| item_rc.geometry());
(draw, item_geometry)
}
forward_rendering_call2!(fn draw_rectangle(dyn RenderRectangle));
forward_rendering_call2!(fn draw_border_rectangle(dyn RenderBorderRectangle));
forward_rendering_call2!(fn draw_window_background(dyn RenderRectangle));
forward_rendering_call2!(fn draw_image(dyn RenderImage));
forward_rendering_call2!(fn draw_text(dyn RenderText));
forward_rendering_call!(fn draw_text_input(TextInput));
#[cfg(feature = "std")]
forward_rendering_call!(fn draw_path(Path));
forward_rendering_call!(fn draw_box_shadow(BoxShadow));
forward_rendering_call!(fn visit_clip(Clip) -> RenderingResult);
forward_rendering_call!(fn visit_opacity(Opacity) -> RenderingResult);
fn combine_clip(
&mut self,
rect: LogicalRect,
radius: LogicalBorderRadius,
border_width: LogicalLength,
) -> bool {
self.actual_renderer.combine_clip(rect, radius, border_width)
}
fn get_current_clip(&self) -> LogicalRect {
self.actual_renderer.get_current_clip()
}
fn translate(&mut self, distance: LogicalVector) {
self.actual_renderer.translate(distance)
}
fn translation(&self) -> LogicalVector {
self.actual_renderer.translation()
}
fn rotate(&mut self, angle_in_degrees: f32) {
self.actual_renderer.rotate(angle_in_degrees)
}
fn apply_opacity(&mut self, opacity: f32) {
self.actual_renderer.apply_opacity(opacity)
}
fn save_state(&mut self) {
self.actual_renderer.save_state()
}
fn restore_state(&mut self) {
self.actual_renderer.restore_state()
}
fn scale_factor(&self) -> f32 {
self.actual_renderer.scale_factor()
}
fn draw_cached_pixmap(
&mut self,
item_rc: &ItemRc,
update_fn: &dyn Fn(&mut dyn FnMut(u32, u32, &[u8])),
) {
self.actual_renderer.draw_cached_pixmap(item_rc, update_fn)
}
fn draw_string(&mut self, string: &str, color: crate::Color) {
self.actual_renderer.draw_string(string, color)
}
fn draw_image_direct(&mut self, image: crate::graphics::image::Image) {
self.actual_renderer.draw_image_direct(image)
}
fn window(&self) -> &crate::window::WindowInner {
self.actual_renderer.window()
}
fn as_any(&mut self) -> Option<&mut dyn core::any::Any> {
self.actual_renderer.as_any()
}
}
/// This struct holds the state of the partial renderer between different frames, in particular the cache of the bounding rect
/// of each item. This permits a more fine-grained computation of the region that needs to be repainted.
#[derive(Default)]
pub struct PartialRenderingState {
partial_cache: RefCell<PartialRenderingCache>,
/// This is the area which we are going to redraw in the next frame, no matter if the items are dirty or not
force_dirty: RefCell<DirtyRegion>,
/// Force a redraw in the next frame, no matter what's dirty. Use only as a last resort.
force_screen_refresh: Cell<bool>,
}
impl PartialRenderingState {
/// Creates a partial renderer that's initialized with the partial rendering caches maintained in this state structure.
/// Call [`Self::apply_dirty_region`] after this function to compute the correct partial rendering region.
pub fn create_partial_renderer<T: ItemRenderer + ItemRendererFeatures>(
&self,
renderer: T,
) -> PartialRenderer<'_, T> {
PartialRenderer::new(&self.partial_cache, self.force_dirty.take(), renderer)
}
/// Compute the correct partial rendering region based on the components to be drawn, the bounding rectangles of
/// changes items within, and the current repaint buffer type. Returns the computed dirty region just for this frame.
/// The provided buffer_dirty_region specifies which area of the buffer is known to *additionally* require repainting,
/// where `None` means that buffer is not known to be dirty beyond what applies to this frame (reused buffer).
pub fn apply_dirty_region<T: ItemRenderer + ItemRendererFeatures>(
&self,
partial_renderer: &mut PartialRenderer<'_, T>,
components: &[(&ItemTreeRc, LogicalPoint)],
logical_window_size: LogicalSize,
dirty_region_of_existing_buffer: Option<DirtyRegion>,
) -> DirtyRegion {
for (component, origin) in components {
partial_renderer.compute_dirty_regions(component, *origin, logical_window_size);
}
let screen_region = LogicalRect::from_size(logical_window_size);
if self.force_screen_refresh.take() {
partial_renderer.dirty_region = screen_region.into();
}
let region_to_repaint = partial_renderer.dirty_region.clone();
partial_renderer.dirty_region = match dirty_region_of_existing_buffer {
Some(dirty_region) => partial_renderer.dirty_region.union(&dirty_region),
None => partial_renderer.dirty_region.clone(),
}
.intersection(screen_region);
region_to_repaint
}
/// Add the specified region to the list of regions to include in the next rendering.
pub fn mark_dirty_region(&self, region: DirtyRegion) {
self.force_dirty.replace_with(|r| r.union(&region));
}
/// Call this from your renderer's `free_graphics_resources` function to ensure that the cached item geometries
/// are cleared for the destroyed items in the item tree.
pub fn free_graphics_resources(&self, items: &mut dyn Iterator<Item = Pin<ItemRef<'_>>>) {
for item in items {
item.cached_rendering_data_offset().release(&mut self.partial_cache.borrow_mut());
}
// We don't have a way to determine the screen region of the delete items, what's in the cache is relative. So
// as a last resort, refresh everything.
self.force_screen_refresh.set(true)
}
/// Clears the partial rendering cache. Use this for example when the entire undering window surface changes.
pub fn clear_cache(&self) {
self.partial_cache.borrow_mut().clear();
}
/// Force re-rendering of the entire window region the next time a partial renderer is created.
pub fn force_screen_refresh(&self) {
self.force_screen_refresh.set(true);
}
}
#[test]
fn dirty_region_no_intersection() {
let mut region = DirtyRegion::default();
region.add_rect(LogicalRect::new(LogicalPoint::new(10., 10.), LogicalSize::new(16., 16.)));
region.add_rect(LogicalRect::new(LogicalPoint::new(100., 100.), LogicalSize::new(16., 16.)));
region.add_rect(LogicalRect::new(LogicalPoint::new(200., 100.), LogicalSize::new(16., 16.)));
let i = region
.intersection(LogicalRect::new(LogicalPoint::new(50., 50.), LogicalSize::new(10., 10.)));
assert_eq!(i.iter().count(), 0);
}