jay-compositor 1.13.0

use {
    crate::{
        backend::ConnectorId,
        cursor::KnownCursor,
        fixed::Fixed,
        ifs::wl_seat::{NodeSeatState, WlSeatGlobal, tablet::TabletTool},
        rect::Rect,
        renderer::Renderer,
        state::State,
        tree::{
            FindTreeResult, FindTreeUsecase, FoundNode, Node, NodeId, NodeLayerLink, NodeLocation,
            OutputNode, StackedNode, TileDragDestination, WorkspaceDragDestination, WorkspaceNode,
            walker::NodeVisitor,
        },
        utils::{
            copyhashmap::CopyHashMap,
            linkedlist::{LinkedList, LinkedListIter, LinkedNode, NodeRef, RevLinkedListIter},
        },
    },
    std::{
        cell::{Cell, RefCell},
        ops::Deref,
        rc::Rc,
    },
};

pub struct DisplayNode {
    pub id: NodeId,
    pub extents: Cell<Rect>,
    pub outputs: CopyHashMap<ConnectorId, Rc<OutputNode>>,
    pub stacked: Rc<NodesStack>,
    pub stacked_above_layers: Rc<NodesStack>,
    pub stacked_in_overlay: Rc<NodesStack>,
    pub seat_state: NodeSeatState,
}

#[derive(Default)]
pub struct NodesStack {
    pub stacked: LinkedList<Rc<dyn StackedNode>>,
    visible: LinkedList<Rc<dyn StackedNode>>,
    visible_valid: Cell<bool>,
}

pub struct NodesStackElement {
    pub stack: Rc<NodesStack>,
    pub link: Option<LinkedNode<Rc<dyn StackedNode>>>,
    visible: Option<LinkedNode<Rc<dyn StackedNode>>>,
}

impl DisplayNode {
    pub fn new(id: NodeId) -> Self {
        let slf = Self {
            id,
            extents: Default::default(),
            outputs: Default::default(),
            stacked: Default::default(),
            stacked_above_layers: Default::default(),
            stacked_in_overlay: Default::default(),
            seat_state: Default::default(),
        };
        slf.seat_state.disable_focus_history();
        slf
    }

    pub fn clear(&self) {
        self.outputs.clear();
        self.seat_state.clear();
    }

    pub fn update_extents(&self) {
        let outputs = self.outputs.lock();
        let mut x1 = i32::MAX;
        let mut y1 = i32::MAX;
        let mut x2 = i32::MIN;
        let mut y2 = i32::MIN;
        for output in outputs.values() {
            let pos = output.global.pos.get();
            x1 = x1.min(pos.x1());
            y1 = y1.min(pos.y1());
            x2 = x2.max(pos.x2());
            y2 = y2.max(pos.y2());
        }
        if x1 >= x2 {
            x1 = 0;
            x2 = 0;
        }
        if y1 >= y2 {
            y1 = 0;
            y2 = 0;
        }
        self.extents.set(Rect::new_saturating(x1, y1, x2, y2));
    }

    pub fn update_visible(&self, state: &State) {
        let visible = state.root_visible();
        for output in self.outputs.lock().values() {
            output.update_visible();
        }
        for layer in [
            &self.stacked,
            &self.stacked_above_layers,
            &self.stacked_in_overlay,
        ] {
            for stacked in layer.stacked.iter() {
                if !stacked.stacked_has_workspace_link() {
                    stacked.stacked_set_visible(visible);
                }
            }
        }
        for seat in state.globals.seats.lock().values() {
            seat.set_visible(visible);
        }
        if visible {
            state.damage(self.extents.get());
        }
    }

    pub fn tile_drag_destination(
        &self,
        source: NodeId,
        x: i32,
        y: i32,
    ) -> Option<TileDragDestination> {
        for output in self.outputs.lock().values() {
            let pos = output.node_absolute_position();
            if pos.contains(x, y) {
                return output.tile_drag_destination(source, x, y);
            }
        }
        None
    }

    pub fn workspace_drag_destination(
        &self,
        source: &WorkspaceNode,
        x: i32,
        y: i32,
    ) -> Option<WorkspaceDragDestination> {
        for output in self.outputs.lock().values() {
            let pos = output.node_absolute_position();
            if pos.contains(x, y) {
                return output.workspace_drag_destination(source, x, y);
            }
        }
        None
    }
}

impl Node for DisplayNode {
    fn node_id(&self) -> NodeId {
        self.id
    }

    fn node_seat_state(&self) -> &NodeSeatState {
        &self.seat_state
    }

    fn node_visit(self: Rc<Self>, visitor: &mut dyn NodeVisitor) {
        visitor.visit_display(&self);
    }

    fn node_visit_children(&self, visitor: &mut dyn NodeVisitor) {
        let outputs = self.outputs.lock();
        for (_, output) in outputs.deref() {
            visitor.visit_output(output);
        }
        for layer in [
            &self.stacked,
            &self.stacked_above_layers,
            &self.stacked_in_overlay,
        ] {
            for stacked in layer.stacked.iter() {
                stacked.deref().clone().node_visit(visitor);
            }
        }
    }

    fn node_visible(&self) -> bool {
        true
    }

    fn node_absolute_position(&self) -> Rect {
        self.extents.get()
    }

    fn node_output(&self) -> Option<Rc<OutputNode>> {
        None
    }

    fn node_workspace(&self) -> Option<Rc<WorkspaceNode>> {
        None
    }

    fn node_location(&self) -> Option<NodeLocation> {
        None
    }

    fn node_layer(&self) -> NodeLayerLink {
        NodeLayerLink::Display
    }

    fn node_find_tree_at(
        &self,
        x: i32,
        y: i32,
        tree: &mut Vec<FoundNode>,
        usecase: FindTreeUsecase,
    ) -> FindTreeResult {
        let outputs = self.outputs.lock();
        for output in outputs.values() {
            let pos = output.global.pos.get();
            if pos.contains(x, y) {
                let (x, y) = pos.translate(x, y);
                tree.push(FoundNode {
                    node: output.clone(),
                    x,
                    y,
                });
                output.node_find_tree_at(x, y, tree, usecase);
                break;
            }
        }
        FindTreeResult::AcceptsInput
    }

    fn node_render(&self, renderer: &mut Renderer, x: i32, y: i32, _bounds: Option<&Rect>) {
        renderer.render_display(self, x, y);
    }

    fn node_on_pointer_focus(&self, seat: &Rc<WlSeatGlobal>) {
        // log::info!("display focus");
        seat.pointer_cursor().set_known(KnownCursor::Default);
    }

    fn node_on_tablet_tool_enter(
        self: Rc<Self>,
        tool: &Rc<TabletTool>,
        _time_usec: u64,
        _x: Fixed,
        _y: Fixed,
    ) {
        tool.cursor().set_known(KnownCursor::Default)
    }

    fn node_is_display(&self) -> bool {
        true
    }
}

impl NodesStack {
    fn validate(&self) {
        if self.visible_valid.replace(true) {
            return;
        }
        for node in self.stacked.iter() {
            node.deref().clone().stacked_validate();
        }
    }

    pub fn iter_visible(&self) -> NodeStackVisibleIter {
        self.validate();
        NodeStackVisibleIter {
            iter: self.visible.iter(),
        }
    }

    pub fn iter_visible_rev(&self) -> RevNodeStackVisibleIter {
        self.validate();
        RevNodeStackVisibleIter {
            iter: self.visible.rev_iter(),
        }
    }

    pub fn element(self: &Rc<Self>) -> RefCell<NodesStackElement> {
        RefCell::new(NodesStackElement {
            stack: self.clone(),
            link: Default::default(),
            visible: Default::default(),
        })
    }

    pub fn maybe_has_visible(&self) -> bool {
        self.validate();
        self.visible.is_not_empty()
    }

    pub fn definitely_has_no_visible(&self) -> bool {
        !self.maybe_has_visible()
    }
}

impl NodesStackElement {
    pub fn clear(&mut self) {
        self.link.take();
        self.visible.take();
    }

    pub fn restack(&self) {
        if let Some(link) = &self.link {
            self.stack.stacked.add_last_existing(link);
        }
        if let Some(link) = &self.visible
            && link.node_visible()
        {
            self.stack.visible.add_last_existing(link);
        }
    }

    pub fn restack_on(&mut self, stack: &Rc<NodesStack>) {
        self.stack = stack.clone();
        self.restack();
    }

    pub fn add_last_visible(&mut self, slf: &Rc<impl StackedNode>) {
        let link = self
            .visible
            .get_or_insert_with(|| LinkedNode::detached(slf.clone()));
        self.stack.visible.add_last_existing(link);
    }

    pub fn invalidate(&self) {
        self.stack.visible_valid.set(false);
    }
}

fn next_visible(
    iter: &mut impl Iterator<Item = NodeRef<Rc<dyn StackedNode>>>,
) -> Option<NodeRef<Rc<dyn StackedNode>>> {
    loop {
        let v = iter.next()?;
        if v.node_visible() {
            return Some(v);
        }
        v.detach();
    }
}

pub struct NodeStackVisibleIter {
    iter: LinkedListIter<Rc<dyn StackedNode>>,
}

impl Iterator for NodeStackVisibleIter {
    type Item = NodeRef<Rc<dyn StackedNode>>;

    fn next(&mut self) -> Option<Self::Item> {
        next_visible(&mut self.iter)
    }
}

pub struct RevNodeStackVisibleIter {
    iter: RevLinkedListIter<Rc<dyn StackedNode>>,
}

impl Iterator for RevNodeStackVisibleIter {
    type Item = NodeRef<Rc<dyn StackedNode>>;

    fn next(&mut self) -> Option<Self::Item> {
        next_visible(&mut self.iter)
    }
}