smithay/src/compositor/tree.rs

380 lines
14 KiB
Rust
Raw Normal View History

2017-09-03 17:53:29 +00:00
use super::{SubsurfaceRole, SurfaceAttributes};
use super::roles::*;
2017-06-04 15:47:37 +00:00
use std::sync::Mutex;
use wayland_server::{Liveness, Resource};
use wayland_server::protocol::wl_surface;
/// Node of a subsurface tree, holding some user specified data type U
/// at each node
///
/// This type is internal to Smithay, and should not appear in the
/// public API
///
/// It is a bidirectionnal tree, meaning we can move along it in both
/// direction (top-bottom or bottom-up). We are taking advantage of the
/// fact that lifetime of objects are decided by wayland-server to ensure
/// the cleanup will be done properly, and we won't leak anything.
///
/// This implementation is not strictly a tree, but rather a directed graph
/// with the constraint that node can have at most one incoming edge. Aka like
/// a tree, but with loops allowed. This is because the wayland protocol does not
/// have a failure case to forbid this. Note that if any node in such a graph does not
/// have a parent, then the graph is a tree and this node is its root.
///
/// All the methods here are unsafe, because they assume the provided wl_surface object
/// is correctly initialized regarding its user_data.
2017-09-03 17:53:29 +00:00
pub struct SurfaceData<U, R> {
2017-06-04 15:47:37 +00:00
parent: Option<wl_surface::WlSurface>,
children: Vec<wl_surface::WlSurface>,
2017-09-03 17:53:29 +00:00
role: R,
2017-06-04 15:47:37 +00:00
attributes: SurfaceAttributes<U>,
}
pub enum Location {
Before,
After,
}
/// Possible actions to do after handling a node diring tree traversal
pub enum TraversalAction<T> {
/// Traverse its children as well, providing them the data T
DoChildren(T),
/// Skip its children
SkipChildren,
/// Stop traversal completely
Break,
}
2017-09-03 17:53:29 +00:00
impl<U: Default, R: Default> SurfaceData<U, R> {
fn new() -> SurfaceData<U, R> {
2017-06-04 15:47:37 +00:00
SurfaceData {
parent: None,
children: Vec::new(),
2017-09-03 17:53:29 +00:00
role: Default::default(),
2017-06-04 15:47:37 +00:00
attributes: Default::default(),
}
}
/// Initialize the user_data of a surface, must be called right when the surface is created
pub unsafe fn init(surface: &wl_surface::WlSurface) {
2017-09-05 17:51:05 +00:00
surface.set_user_data(
Box::into_raw(Box::new(Mutex::new(SurfaceData::<U, R>::new()))) as *mut _,
)
2017-06-04 15:47:37 +00:00
}
}
2017-09-03 17:53:29 +00:00
impl<U, R> SurfaceData<U, R> {
unsafe fn get_data(surface: &wl_surface::WlSurface) -> &Mutex<SurfaceData<U, R>> {
2017-06-04 15:47:37 +00:00
let ptr = surface.get_user_data();
&*(ptr as *mut _)
}
/// Cleans the user_data of that surface, must be called when it is destroyed
pub unsafe fn cleanup(surface: &wl_surface::WlSurface) {
let ptr = surface.get_user_data();
surface.set_user_data(::std::ptr::null_mut());
2017-09-03 17:53:29 +00:00
let my_data_mutex: Box<Mutex<SurfaceData<U, R>>> = Box::from_raw(ptr as *mut _);
2017-06-04 15:47:37 +00:00
let mut my_data = my_data_mutex.into_inner().unwrap();
if let Some(old_parent) = my_data.parent.take() {
if !old_parent.equals(surface) {
// We had a parent that is not ourselves, lets unregister ourselves from it
let old_parent_mutex = Self::get_data(&old_parent);
let mut old_parent_guard = old_parent_mutex.lock().unwrap();
old_parent_guard.children.retain(|c| !c.equals(surface));
}
}
// orphan all our children
for child in &my_data.children {
// don't do anything if this child is ourselves
if child.equals(surface) {
continue;
}
let child_mutex = Self::get_data(child);
let mut child_guard = child_mutex.lock().unwrap();
child_guard.parent = None;
}
}
2017-09-03 17:53:29 +00:00
}
2017-06-04 15:47:37 +00:00
2017-09-03 17:53:29 +00:00
impl<U, R: RoleType> SurfaceData<U, R> {
pub unsafe fn has_a_role(surface: &wl_surface::WlSurface) -> bool {
2017-06-04 15:47:37 +00:00
debug_assert!(surface.status() == Liveness::Alive);
let data_mutex = Self::get_data(surface);
let data_guard = data_mutex.lock().unwrap();
2017-09-03 17:53:29 +00:00
<R as RoleType>::has_role(&data_guard.role)
}
/// Check wether a surface has a given role
pub unsafe fn has_role<RoleData>(surface: &wl_surface::WlSurface) -> bool
where
R: Role<RoleData>,
{
debug_assert!(surface.status() == Liveness::Alive);
let data_mutex = Self::get_data(surface);
let data_guard = data_mutex.lock().unwrap();
<R as Role<RoleData>>::has(&data_guard.role)
2017-06-04 15:47:37 +00:00
}
/// Register that this surface has a role, fails if it already has one
2017-09-03 17:53:29 +00:00
pub unsafe fn give_role<RoleData>(surface: &wl_surface::WlSurface) -> Result<(), ()>
where
R: Role<RoleData>,
RoleData: Default,
{
2017-06-04 15:47:37 +00:00
debug_assert!(surface.status() == Liveness::Alive);
let data_mutex = Self::get_data(surface);
let mut data_guard = data_mutex.lock().unwrap();
2017-09-03 17:53:29 +00:00
<R as Role<RoleData>>::set(&mut data_guard.role)
2017-06-04 15:47:37 +00:00
}
2017-09-03 17:53:29 +00:00
/// Register that this surface has a role with given data
///
/// Fails if it already has one and returns the data
pub unsafe fn give_role_with<RoleData>(surface: &wl_surface::WlSurface, data: RoleData)
-> Result<(), RoleData>
where
R: Role<RoleData>,
{
debug_assert!(surface.status() == Liveness::Alive);
let data_mutex = Self::get_data(surface);
let mut data_guard = data_mutex.lock().unwrap();
<R as Role<RoleData>>::set_with(&mut data_guard.role, data)
}
/// Register that this surface has no role and returns the data
2017-06-04 15:47:37 +00:00
///
/// It is a noop if this surface already didn't have one, but fails if
/// the role was "subsurface", it must be removed by the `unset_parent` method.
2017-09-03 17:53:29 +00:00
pub unsafe fn remove_role<RoleData>(surface: &wl_surface::WlSurface) -> Result<RoleData, WrongRole>
where
R: Role<RoleData>,
{
2017-06-04 15:47:37 +00:00
debug_assert!(surface.status() == Liveness::Alive);
let data_mutex = Self::get_data(surface);
let mut data_guard = data_mutex.lock().unwrap();
2017-09-03 17:53:29 +00:00
<R as Role<RoleData>>::unset(&mut data_guard.role)
2017-06-04 15:47:37 +00:00
}
2017-09-03 17:53:29 +00:00
/// Access to the role data
pub unsafe fn with_role_data<RoleData, F, T>(surface: &wl_surface::WlSurface, f: F)
-> Result<T, WrongRole>
where
R: Role<RoleData>,
F: FnOnce(&mut RoleData) -> T,
{
debug_assert!(surface.status() == Liveness::Alive);
let data_mutex = Self::get_data(surface);
let mut data_guard = data_mutex.lock().unwrap();
let data = <R as Role<RoleData>>::data_mut(&mut data_guard.role)?;
Ok(f(data))
}
}
impl<U, R: RoleType + Role<SubsurfaceRole>> SurfaceData<U, R> {
2017-06-04 15:47:37 +00:00
/// Sets the parent of a surface
2017-09-03 17:53:29 +00:00
///
2017-06-04 15:47:37 +00:00
/// if this surface already has a role, does nothing and fails, otherwise
/// its role is now to be a subsurface
pub unsafe fn set_parent(child: &wl_surface::WlSurface, parent: &wl_surface::WlSurface)
-> Result<(), ()> {
debug_assert!(child.status() == Liveness::Alive);
debug_assert!(parent.status() == Liveness::Alive);
// change child's parent
{
let child_mutex = Self::get_data(child);
let mut child_guard = child_mutex.lock().unwrap();
2017-09-03 17:53:29 +00:00
// if surface already has a role, it cannot become a subsurface
<R as Role<SubsurfaceRole>>::set(&mut child_guard.role)?;
2017-06-04 15:47:37 +00:00
debug_assert!(child_guard.parent.is_none());
child_guard.parent = Some(parent.clone_unchecked());
}
// register child to new parent
// double scoping is to be robust to have a child be its own parent
{
let parent_mutex = Self::get_data(parent);
let mut parent_guard = parent_mutex.lock().unwrap();
parent_guard.children.push(child.clone_unchecked())
}
Ok(())
}
/// Remove a pre-existing parent of this child
///
/// Does nothing if it has no parent
pub unsafe fn unset_parent(child: &wl_surface::WlSurface) {
debug_assert!(child.status() == Liveness::Alive);
let old_parent = {
let child_mutex = Self::get_data(child);
let mut child_guard = child_mutex.lock().unwrap();
let old_parent = child_guard.parent.take();
if old_parent.is_some() {
// We had a parent, so this does not have a role any more
2017-09-03 17:53:29 +00:00
<R as Role<SubsurfaceRole>>::unset(&mut child_guard.role)
.expect("Surface had a parent but not the subsurface role?!");
2017-06-04 15:47:37 +00:00
}
old_parent
};
// unregister from our parent
if let Some(old_parent) = old_parent {
let parent_mutex = Self::get_data(&old_parent);
let mut parent_guard = parent_mutex.lock().unwrap();
parent_guard.children.retain(|c| !c.equals(child));
}
}
/// Retrieve the parent surface (if any) of this surface
pub unsafe fn get_parent(child: &wl_surface::WlSurface) -> Option<wl_surface::WlSurface> {
let child_mutex = Self::get_data(child);
let child_guard = child_mutex.lock().unwrap();
child_guard.parent.as_ref().map(|p| p.clone_unchecked())
}
/// Retrieve the parent surface (if any) of this surface
pub unsafe fn get_children(child: &wl_surface::WlSurface) -> Vec<wl_surface::WlSurface> {
let child_mutex = Self::get_data(child);
let child_guard = child_mutex.lock().unwrap();
child_guard
.children
.iter()
.map(|p| p.clone_unchecked())
.collect()
}
/// Reorders a surface relative to one of its sibling
///
/// Fails if `relative_to` is not a sibling or parent of `surface`.
pub unsafe fn reorder(surface: &wl_surface::WlSurface, to: Location,
relative_to: &wl_surface::WlSurface)
-> Result<(), ()> {
let parent = {
let data_mutex = Self::get_data(surface);
let data_guard = data_mutex.lock().unwrap();
data_guard
.parent
.as_ref()
.map(|p| p.clone_unchecked())
.unwrap()
};
if parent.equals(relative_to) {
// TODO: handle positioning relative to parent
return Ok(());
}
fn index_of(surface: &wl_surface::WlSurface, slice: &[wl_surface::WlSurface]) -> Option<usize> {
for (i, s) in slice.iter().enumerate() {
if s.equals(surface) {
return Some(i);
}
}
None
}
let parent_mutex = Self::get_data(&parent);
let mut parent_guard = parent_mutex.lock().unwrap();
let my_index = index_of(surface, &parent_guard.children).unwrap();
let mut other_index = match index_of(surface, &parent_guard.children) {
Some(idx) => idx,
None => return Err(()),
};
let me = parent_guard.children.remove(my_index);
if my_index < other_index {
other_index -= 1;
}
let new_index = match to {
Location::Before => other_index,
Location::After => other_index + 1,
};
parent_guard.children.insert(new_index, me);
Ok(())
}
2017-09-03 17:53:29 +00:00
}
2017-09-03 17:53:29 +00:00
impl<U, R> SurfaceData<U, R> {
2017-06-04 15:47:37 +00:00
/// Access the attributes associated with a surface
///
/// Note that an internal lock is taken during access of this data,
/// so the tree cannot be manipulated at the same time
2017-09-03 17:53:29 +00:00
pub unsafe fn with_data<T, F>(surface: &wl_surface::WlSurface, f: F) -> T
2017-06-23 13:40:28 +00:00
where
2017-09-03 17:53:29 +00:00
F: FnOnce(&mut SurfaceAttributes<U>) -> T,
2017-06-04 15:47:37 +00:00
{
let data_mutex = Self::get_data(surface);
let mut data_guard = data_mutex.lock().unwrap();
f(&mut data_guard.attributes)
}
/// Access sequentially the attributes associated with a surface tree,
/// in a depth-first order
///
/// Note that an internal lock is taken during access of this data,
/// so the tree cannot be manipulated at the same time.
///
/// The callback returns wether the traversal should continue or not. Returning
/// false will cause an early-stopping.
pub unsafe fn map_tree<F, T>(root: &wl_surface::WlSurface, initial: T, mut f: F)
2017-06-23 13:40:28 +00:00
where
2017-09-05 17:51:05 +00:00
F: FnMut(&wl_surface::WlSurface, &mut SurfaceAttributes<U>, &mut R, &T)
2017-09-03 17:53:29 +00:00
-> TraversalAction<T>,
2017-06-04 15:47:37 +00:00
{
// helper function for recursion
2017-09-05 17:51:05 +00:00
unsafe fn map<U, R, F, T>(surface: &wl_surface::WlSurface, root: &wl_surface::WlSurface,
initial: &T, f: &mut F)
2017-09-03 17:53:29 +00:00
-> bool
2017-06-23 13:40:28 +00:00
where
2017-09-05 17:51:05 +00:00
F: FnMut(&wl_surface::WlSurface, &mut SurfaceAttributes<U>, &mut R, &T)
2017-09-03 17:53:29 +00:00
-> TraversalAction<T>,
2017-06-04 15:47:37 +00:00
{
// stop if we met the root, so to not deadlock/inifinte loop
if surface.equals(root) {
return true;
}
2017-09-03 17:53:29 +00:00
let data_mutex = SurfaceData::<U, R>::get_data(surface);
2017-06-04 15:47:37 +00:00
let mut data_guard = data_mutex.lock().unwrap();
2017-09-03 17:53:29 +00:00
let data_guard = &mut *data_guard;
2017-06-04 15:47:37 +00:00
// call the callback on ourselves
2017-09-03 17:53:29 +00:00
match f(
surface,
&mut data_guard.attributes,
&mut data_guard.role,
initial,
) {
TraversalAction::DoChildren(t) => {
// loop over children
for c in &data_guard.children {
2017-09-03 17:53:29 +00:00
if !map::<U, R, _, _>(c, root, &t, f) {
return false;
}
2017-06-04 15:47:37 +00:00
}
true
2017-06-04 15:47:37 +00:00
}
TraversalAction::SkipChildren => true,
TraversalAction::Break => false,
2017-06-04 15:47:37 +00:00
}
}
let data_mutex = Self::get_data(root);
let mut data_guard = data_mutex.lock().unwrap();
2017-09-03 17:53:29 +00:00
let data_guard = &mut *data_guard;
2017-06-04 15:47:37 +00:00
// call the callback on ourselves
2017-09-03 17:53:29 +00:00
match f(
root,
&mut data_guard.attributes,
&mut data_guard.role,
&initial,
) {
TraversalAction::DoChildren(t) => {
// loop over children
for c in &data_guard.children {
2017-09-03 17:53:29 +00:00
if !map::<U, R, _, _>(c, root, &t, &mut f) {
break;
}
2017-06-04 15:47:37 +00:00
}
}
_ => {}
2017-06-04 15:47:37 +00:00
}
}
}