2017-11-20 09:04:28 +11:00
|
|
|
#define _POSIX_C_SOURCE 200809L
|
2018-04-03 12:37:21 +10:00
|
|
|
#include <assert.h>
|
2017-11-20 09:04:28 +11:00
|
|
|
#include <stdint.h>
|
|
|
|
#include <stdlib.h>
|
|
|
|
#include <string.h>
|
2017-12-06 22:36:06 +11:00
|
|
|
#include <strings.h>
|
2018-01-31 15:09:21 +11:00
|
|
|
#include <wayland-server.h>
|
2017-12-06 03:02:31 +11:00
|
|
|
#include <wlr/types/wlr_output_layout.h>
|
2017-12-11 00:48:44 +11:00
|
|
|
#include <wlr/types/wlr_wl_shell.h>
|
2017-12-06 22:36:06 +11:00
|
|
|
#include "sway/config.h"
|
2018-01-31 15:09:21 +11:00
|
|
|
#include "sway/input/input-manager.h"
|
|
|
|
#include "sway/input/seat.h"
|
2018-03-31 02:58:17 +11:00
|
|
|
#include "sway/ipc-server.h"
|
2017-11-20 09:04:28 +11:00
|
|
|
#include "sway/output.h"
|
2017-12-10 01:48:52 +11:00
|
|
|
#include "sway/server.h"
|
2018-03-31 02:58:17 +11:00
|
|
|
#include "sway/tree/layout.h"
|
2018-03-30 14:41:33 +11:00
|
|
|
#include "sway/tree/view.h"
|
|
|
|
#include "sway/tree/workspace.h"
|
2017-11-23 12:39:27 +11:00
|
|
|
#include "log.h"
|
2017-11-20 09:04:28 +11:00
|
|
|
|
2018-02-25 06:30:47 +11:00
|
|
|
static list_t *bfs_queue;
|
|
|
|
|
|
|
|
static list_t *get_bfs_queue() {
|
|
|
|
if (!bfs_queue) {
|
|
|
|
bfs_queue = create_list();
|
|
|
|
if (!bfs_queue) {
|
|
|
|
wlr_log(L_ERROR, "could not allocate list for bfs queue");
|
|
|
|
return NULL;
|
|
|
|
}
|
|
|
|
}
|
|
|
|
bfs_queue->length = 0;
|
|
|
|
|
|
|
|
return bfs_queue;
|
|
|
|
}
|
|
|
|
|
2018-04-01 11:21:26 +10:00
|
|
|
const char *container_type_to_str(enum sway_container_type type) {
|
|
|
|
switch (type) {
|
|
|
|
case C_ROOT:
|
|
|
|
return "C_ROOT";
|
|
|
|
case C_OUTPUT:
|
|
|
|
return "C_OUTPUT";
|
|
|
|
case C_WORKSPACE:
|
|
|
|
return "C_WORKSPACE";
|
|
|
|
case C_CONTAINER:
|
|
|
|
return "C_CONTAINER";
|
|
|
|
case C_VIEW:
|
|
|
|
return "C_VIEW";
|
|
|
|
default:
|
|
|
|
return "C_UNKNOWN";
|
|
|
|
}
|
|
|
|
}
|
|
|
|
|
2018-04-04 09:52:17 +10:00
|
|
|
void container_create_notify(struct sway_container *container) {
|
2018-04-05 04:19:38 +10:00
|
|
|
// TODO send ipc event type based on the container type
|
2018-02-28 11:53:15 +11:00
|
|
|
wl_signal_emit(&root_container.sway_root->events.new_container, container);
|
2018-04-05 09:37:01 +10:00
|
|
|
|
|
|
|
if (container->type == C_VIEW || container->type == C_CONTAINER) {
|
|
|
|
ipc_event_window(container, "new");
|
|
|
|
}
|
2018-02-28 11:53:15 +11:00
|
|
|
}
|
|
|
|
|
2018-04-05 04:19:38 +10:00
|
|
|
static void container_close_notify(struct sway_container *container) {
|
2018-04-05 08:52:38 +10:00
|
|
|
if (container == NULL) {
|
|
|
|
return;
|
|
|
|
}
|
2018-04-05 04:19:38 +10:00
|
|
|
// TODO send ipc event type based on the container type
|
2018-04-06 05:39:57 +10:00
|
|
|
if (container->type == C_VIEW || container->type == C_WORKSPACE) {
|
|
|
|
ipc_event_window(container, "close");
|
|
|
|
}
|
2018-04-05 04:19:38 +10:00
|
|
|
}
|
|
|
|
|
2018-03-31 15:44:17 +11:00
|
|
|
struct sway_container *container_create(enum sway_container_type type) {
|
2017-11-20 09:04:28 +11:00
|
|
|
// next id starts at 1 because 0 is assigned to root_container in layout.c
|
|
|
|
static size_t next_id = 1;
|
2018-03-30 14:41:33 +11:00
|
|
|
struct sway_container *c = calloc(1, sizeof(struct sway_container));
|
2017-11-20 09:04:28 +11:00
|
|
|
if (!c) {
|
|
|
|
return NULL;
|
|
|
|
}
|
|
|
|
c->id = next_id++;
|
|
|
|
c->layout = L_NONE;
|
|
|
|
c->workspace_layout = L_NONE;
|
|
|
|
c->type = type;
|
2018-04-03 14:47:45 +10:00
|
|
|
c->alpha = 1.0f;
|
|
|
|
|
2017-11-20 09:04:28 +11:00
|
|
|
if (type != C_VIEW) {
|
|
|
|
c->children = create_list();
|
|
|
|
}
|
2017-12-11 03:11:47 +11:00
|
|
|
|
|
|
|
wl_signal_init(&c->events.destroy);
|
2018-04-01 11:21:26 +10:00
|
|
|
wl_signal_init(&c->events.reparent);
|
2017-12-11 03:11:47 +11:00
|
|
|
|
2017-11-20 09:04:28 +11:00
|
|
|
return c;
|
|
|
|
}
|
|
|
|
|
2018-04-04 09:32:09 +10:00
|
|
|
static void _container_destroy(struct sway_container *cont) {
|
2018-03-30 14:41:33 +11:00
|
|
|
if (cont == NULL) {
|
2018-04-04 09:32:09 +10:00
|
|
|
return;
|
2017-12-30 05:04:16 +11:00
|
|
|
}
|
|
|
|
|
|
|
|
wl_signal_emit(&cont->events.destroy, cont);
|
2018-04-05 04:19:38 +10:00
|
|
|
container_close_notify(cont);
|
2017-12-30 05:04:16 +11:00
|
|
|
|
2018-03-31 02:58:17 +11:00
|
|
|
struct sway_container *parent = cont->parent;
|
2018-04-04 09:32:09 +10:00
|
|
|
if (cont->children != NULL && cont->children->length) {
|
2018-03-30 14:41:33 +11:00
|
|
|
// remove children until there are no more, container_destroy calls
|
|
|
|
// container_remove_child, which removes child from this container
|
2018-04-13 15:57:36 +10:00
|
|
|
while (cont->children != NULL && cont->children->length > 0) {
|
2018-04-01 08:52:02 +10:00
|
|
|
struct sway_container *child = cont->children->items[0];
|
2018-04-03 06:09:27 +10:00
|
|
|
container_remove_child(child);
|
2018-04-04 09:32:09 +10:00
|
|
|
_container_destroy(child);
|
2017-12-30 05:04:16 +11:00
|
|
|
}
|
|
|
|
}
|
|
|
|
if (cont->marks) {
|
|
|
|
list_foreach(cont->marks, free);
|
|
|
|
list_free(cont->marks);
|
|
|
|
}
|
2018-03-31 02:58:17 +11:00
|
|
|
if (parent) {
|
2018-03-31 05:31:17 +11:00
|
|
|
parent = container_remove_child(cont);
|
2017-12-30 05:04:16 +11:00
|
|
|
}
|
|
|
|
if (cont->name) {
|
|
|
|
free(cont->name);
|
|
|
|
}
|
2018-04-01 08:52:02 +10:00
|
|
|
list_free(cont->children);
|
|
|
|
cont->children = NULL;
|
2017-12-30 05:04:16 +11:00
|
|
|
free(cont);
|
|
|
|
}
|
2018-04-04 02:34:01 +10:00
|
|
|
|
2018-04-04 03:08:45 +10:00
|
|
|
static struct sway_container *container_output_destroy(
|
|
|
|
struct sway_container *output) {
|
2018-04-04 02:34:01 +10:00
|
|
|
if (!sway_assert(output, "cannot destroy null output")) {
|
|
|
|
return NULL;
|
|
|
|
}
|
|
|
|
|
|
|
|
if (output->children->length > 0) {
|
|
|
|
// TODO save workspaces when there are no outputs.
|
|
|
|
// TODO also check if there will ever be no outputs except for exiting
|
|
|
|
// program
|
|
|
|
if (root_container.children->length > 1) {
|
|
|
|
int p = root_container.children->items[0] == output;
|
|
|
|
// Move workspace from this output to another output
|
|
|
|
while (output->children->length) {
|
|
|
|
struct sway_container *child = output->children->items[0];
|
|
|
|
container_remove_child(child);
|
|
|
|
container_add_child(root_container.children->items[p], child);
|
|
|
|
}
|
|
|
|
container_sort_workspaces(root_container.children->items[p]);
|
|
|
|
arrange_windows(root_container.children->items[p],
|
|
|
|
-1, -1);
|
|
|
|
}
|
|
|
|
}
|
|
|
|
|
|
|
|
wl_list_remove(&output->sway_output->destroy.link);
|
|
|
|
wl_list_remove(&output->sway_output->mode.link);
|
|
|
|
wl_list_remove(&output->sway_output->transform.link);
|
|
|
|
wl_list_remove(&output->sway_output->scale.link);
|
|
|
|
|
|
|
|
wl_list_remove(&output->sway_output->damage_destroy.link);
|
|
|
|
wl_list_remove(&output->sway_output->damage_frame.link);
|
|
|
|
|
|
|
|
wlr_log(L_DEBUG, "OUTPUT: Destroying output '%s'", output->name);
|
2018-04-04 09:32:09 +10:00
|
|
|
_container_destroy(output);
|
2018-04-04 02:34:01 +10:00
|
|
|
return &root_container;
|
|
|
|
}
|
|
|
|
|
2018-04-04 02:25:19 +10:00
|
|
|
static struct sway_container *container_workspace_destroy(
|
|
|
|
struct sway_container *workspace) {
|
|
|
|
if (!sway_assert(workspace, "cannot destroy null workspace")) {
|
|
|
|
return NULL;
|
|
|
|
}
|
|
|
|
|
|
|
|
// Do not destroy this if it's the last workspace on this output
|
|
|
|
struct sway_container *output = container_parent(workspace, C_OUTPUT);
|
|
|
|
if (output && output->children->length == 1) {
|
|
|
|
return NULL;
|
|
|
|
}
|
|
|
|
|
|
|
|
struct sway_container *parent = workspace->parent;
|
|
|
|
if (workspace->children->length == 0) {
|
|
|
|
// destroy the WS if there are no children (TODO check for floating)
|
|
|
|
wlr_log(L_DEBUG, "destroying workspace '%s'", workspace->name);
|
|
|
|
ipc_event_workspace(workspace, NULL, "empty");
|
|
|
|
} else {
|
|
|
|
// Move children to a different workspace on this output
|
|
|
|
struct sway_container *new_workspace = NULL;
|
|
|
|
// TODO move floating
|
|
|
|
for (int i = 0; i < output->children->length; i++) {
|
|
|
|
if (output->children->items[i] != workspace) {
|
|
|
|
new_workspace = output->children->items[i];
|
|
|
|
break;
|
|
|
|
}
|
|
|
|
}
|
|
|
|
|
|
|
|
wlr_log(L_DEBUG, "moving children to different workspace '%s' -> '%s'",
|
|
|
|
workspace->name, new_workspace->name);
|
|
|
|
for (int i = 0; i < workspace->children->length; i++) {
|
|
|
|
container_move_to(workspace->children->items[i], new_workspace);
|
|
|
|
}
|
|
|
|
}
|
|
|
|
|
2018-04-04 09:32:09 +10:00
|
|
|
_container_destroy(workspace);
|
2018-04-04 09:36:57 +10:00
|
|
|
|
|
|
|
output_damage_whole(output->sway_output);
|
|
|
|
|
2018-04-04 02:25:19 +10:00
|
|
|
return parent;
|
|
|
|
}
|
|
|
|
|
2018-04-04 09:23:59 +10:00
|
|
|
static void container_root_finish(struct sway_container *con) {
|
|
|
|
wlr_log(L_ERROR, "TODO: destroy the root container");
|
|
|
|
}
|
2017-12-30 05:04:16 +11:00
|
|
|
|
2018-04-03 03:49:37 +10:00
|
|
|
bool container_reap_empty(struct sway_container *con) {
|
2018-04-03 12:37:21 +10:00
|
|
|
switch (con->type) {
|
2018-04-04 09:23:59 +10:00
|
|
|
case C_ROOT:
|
|
|
|
case C_OUTPUT:
|
|
|
|
// dont reap these
|
|
|
|
break;
|
|
|
|
case C_WORKSPACE:
|
|
|
|
if (!workspace_is_visible(con) && con->children->length == 0) {
|
2018-04-06 23:26:28 +10:00
|
|
|
wlr_log(L_DEBUG, "Destroying workspace via reaper");
|
2018-04-04 09:23:59 +10:00
|
|
|
container_workspace_destroy(con);
|
|
|
|
return true;
|
|
|
|
}
|
|
|
|
break;
|
|
|
|
case C_CONTAINER:
|
|
|
|
if (con->children->length == 0) {
|
2018-04-04 09:32:09 +10:00
|
|
|
_container_destroy(con);
|
2018-04-04 09:23:59 +10:00
|
|
|
return true;
|
|
|
|
}
|
|
|
|
case C_VIEW:
|
|
|
|
break;
|
|
|
|
case C_TYPES:
|
|
|
|
sway_assert(false, "container_reap_empty called on an invalid "
|
|
|
|
"container");
|
|
|
|
break;
|
2018-04-03 12:37:21 +10:00
|
|
|
}
|
|
|
|
|
2018-04-04 09:23:59 +10:00
|
|
|
return false;
|
2018-04-04 02:25:19 +10:00
|
|
|
}
|
2018-04-04 01:27:27 +10:00
|
|
|
|
2018-04-03 03:49:37 +10:00
|
|
|
struct sway_container *container_reap_empty_recursive(
|
|
|
|
struct sway_container *con) {
|
|
|
|
while (con) {
|
|
|
|
struct sway_container *next = con->parent;
|
|
|
|
if (!container_reap_empty(con)) {
|
|
|
|
break;
|
|
|
|
}
|
|
|
|
con = next;
|
|
|
|
}
|
|
|
|
return con;
|
|
|
|
}
|
|
|
|
|
|
|
|
struct sway_container *container_flatten(struct sway_container *container) {
|
|
|
|
while (container->type == C_CONTAINER && container->children->length == 1) {
|
|
|
|
struct sway_container *child = container->children->items[0];
|
|
|
|
struct sway_container *parent = container->parent;
|
|
|
|
container_replace_child(container, child);
|
|
|
|
container_destroy(container);
|
|
|
|
container = parent;
|
|
|
|
}
|
|
|
|
return container;
|
|
|
|
}
|
|
|
|
|
2018-04-04 02:25:19 +10:00
|
|
|
struct sway_container *container_destroy(struct sway_container *con) {
|
|
|
|
if (con == NULL) {
|
|
|
|
return NULL;
|
2018-04-03 12:37:21 +10:00
|
|
|
}
|
|
|
|
|
2018-04-04 09:23:59 +10:00
|
|
|
struct sway_container *parent = con->parent;
|
2018-04-04 02:25:19 +10:00
|
|
|
|
|
|
|
switch (con->type) {
|
|
|
|
case C_ROOT:
|
|
|
|
container_root_finish(con);
|
|
|
|
break;
|
|
|
|
case C_OUTPUT:
|
2018-04-04 09:23:59 +10:00
|
|
|
// dont try to reap the root after this
|
|
|
|
container_output_destroy(con);
|
2018-04-04 02:25:19 +10:00
|
|
|
break;
|
|
|
|
case C_WORKSPACE:
|
2018-04-04 09:23:59 +10:00
|
|
|
// dont try to reap the output after this
|
|
|
|
container_workspace_destroy(con);
|
2018-04-04 02:25:19 +10:00
|
|
|
break;
|
|
|
|
case C_CONTAINER:
|
2018-04-04 09:23:59 +10:00
|
|
|
if (con->children->length) {
|
|
|
|
for (int i = 0; i < con->children->length; ++i) {
|
|
|
|
struct sway_container *child = con->children->items[0];
|
|
|
|
container_remove_child(child);
|
|
|
|
container_add_child(parent, child);
|
|
|
|
}
|
2018-04-04 02:25:19 +10:00
|
|
|
}
|
2018-04-04 09:32:09 +10:00
|
|
|
_container_destroy(con);
|
2018-04-04 02:25:19 +10:00
|
|
|
break;
|
|
|
|
case C_VIEW:
|
2018-04-04 09:32:09 +10:00
|
|
|
_container_destroy(con);
|
2018-04-04 02:25:19 +10:00
|
|
|
break;
|
|
|
|
case C_TYPES:
|
2018-04-04 09:23:59 +10:00
|
|
|
wlr_log(L_ERROR, "container_destroy called on an invalid "
|
|
|
|
"container");
|
2018-04-04 02:25:19 +10:00
|
|
|
break;
|
2018-04-03 12:37:21 +10:00
|
|
|
}
|
|
|
|
|
2018-04-03 03:49:37 +10:00
|
|
|
return container_reap_empty_recursive(parent);
|
2018-04-03 12:37:21 +10:00
|
|
|
}
|
|
|
|
|
2018-04-03 11:01:33 +10:00
|
|
|
static void container_close_func(struct sway_container *container, void *data) {
|
|
|
|
if (container->type == C_VIEW) {
|
|
|
|
view_close(container->sway_view);
|
|
|
|
}
|
|
|
|
}
|
|
|
|
|
|
|
|
struct sway_container *container_close(struct sway_container *con) {
|
2018-04-04 03:08:45 +10:00
|
|
|
if (!sway_assert(con != NULL,
|
2018-04-04 09:23:59 +10:00
|
|
|
"container_close called with a NULL container")) {
|
2018-04-03 11:01:33 +10:00
|
|
|
return NULL;
|
|
|
|
}
|
|
|
|
|
2018-04-03 12:37:21 +10:00
|
|
|
struct sway_container *parent = con->parent;
|
|
|
|
|
2018-04-04 13:59:44 +10:00
|
|
|
if (con->type == C_VIEW) {
|
2018-04-04 09:23:59 +10:00
|
|
|
view_close(con->sway_view);
|
2018-04-04 13:59:44 +10:00
|
|
|
} else {
|
|
|
|
container_for_each_descendant_dfs(con, container_close_func, NULL);
|
2018-04-03 11:01:33 +10:00
|
|
|
}
|
|
|
|
|
2018-04-03 12:37:21 +10:00
|
|
|
return parent;
|
2018-04-03 11:01:33 +10:00
|
|
|
}
|
|
|
|
|
2018-03-30 14:41:33 +11:00
|
|
|
struct sway_container *container_view_create(struct sway_container *sibling,
|
|
|
|
struct sway_view *sway_view) {
|
|
|
|
if (!sway_assert(sibling,
|
|
|
|
"container_view_create called with NULL sibling/parent")) {
|
2017-11-23 13:06:08 +11:00
|
|
|
return NULL;
|
|
|
|
}
|
2018-01-22 01:09:53 +11:00
|
|
|
const char *title = view_get_title(sway_view);
|
2018-03-30 14:41:33 +11:00
|
|
|
struct sway_container *swayc = container_create(C_VIEW);
|
2018-01-31 15:09:21 +11:00
|
|
|
wlr_log(L_DEBUG, "Adding new view %p:%s to container %p %d %s",
|
|
|
|
swayc, title, sibling, sibling ? sibling->type : 0, sibling->name);
|
2017-11-23 13:06:08 +11:00
|
|
|
// Setup values
|
|
|
|
swayc->sway_view = sway_view;
|
|
|
|
swayc->name = title ? strdup(title) : NULL;
|
|
|
|
swayc->width = 0;
|
|
|
|
swayc->height = 0;
|
|
|
|
|
|
|
|
if (sibling->type == C_WORKSPACE) {
|
|
|
|
// Case of focused workspace, just create as child of it
|
2018-03-30 14:41:33 +11:00
|
|
|
container_add_child(sibling, swayc);
|
2017-11-23 13:06:08 +11:00
|
|
|
} else {
|
|
|
|
// Regular case, create as sibling of current container
|
2018-03-30 14:41:33 +11:00
|
|
|
container_add_sibling(sibling, swayc);
|
2017-11-23 13:06:08 +11:00
|
|
|
}
|
2018-04-04 09:52:17 +10:00
|
|
|
container_create_notify(swayc);
|
2017-11-23 13:06:08 +11:00
|
|
|
return swayc;
|
|
|
|
}
|
2017-11-26 02:59:49 +11:00
|
|
|
|
2018-03-30 14:53:38 +11:00
|
|
|
void container_descendants(struct sway_container *root,
|
2018-03-30 14:41:33 +11:00
|
|
|
enum sway_container_type type,
|
|
|
|
void (*func)(struct sway_container *item, void *data), void *data) {
|
|
|
|
for (int i = 0; i < root->children->length; ++i) {
|
|
|
|
struct sway_container *item = root->children->items[i];
|
|
|
|
if (item->type == type) {
|
|
|
|
func(item, data);
|
|
|
|
}
|
|
|
|
if (item->children && item->children->length) {
|
2018-03-30 14:53:38 +11:00
|
|
|
container_descendants(item, type, func, data);
|
2018-03-30 14:41:33 +11:00
|
|
|
}
|
|
|
|
}
|
|
|
|
}
|
|
|
|
|
|
|
|
struct sway_container *container_find(struct sway_container *container,
|
|
|
|
bool (*test)(struct sway_container *view, void *data), void *data) {
|
|
|
|
if (!container->children) {
|
|
|
|
return NULL;
|
|
|
|
}
|
|
|
|
// TODO: floating windows
|
|
|
|
for (int i = 0; i < container->children->length; ++i) {
|
|
|
|
struct sway_container *child = container->children->items[i];
|
|
|
|
if (test(child, data)) {
|
|
|
|
return child;
|
|
|
|
} else {
|
|
|
|
struct sway_container *res = container_find(child, test, data);
|
|
|
|
if (res) {
|
|
|
|
return res;
|
|
|
|
}
|
|
|
|
}
|
|
|
|
}
|
|
|
|
return NULL;
|
|
|
|
}
|
|
|
|
|
|
|
|
struct sway_container *container_parent(struct sway_container *container,
|
|
|
|
enum sway_container_type type) {
|
2017-11-26 02:59:49 +11:00
|
|
|
if (!sway_assert(container, "container is NULL")) {
|
|
|
|
return NULL;
|
|
|
|
}
|
|
|
|
if (!sway_assert(type < C_TYPES && type >= C_ROOT, "invalid type")) {
|
|
|
|
return NULL;
|
|
|
|
}
|
|
|
|
do {
|
|
|
|
container = container->parent;
|
|
|
|
} while (container && container->type != type);
|
|
|
|
return container;
|
|
|
|
}
|
2017-12-11 00:48:44 +11:00
|
|
|
|
2018-03-30 14:41:33 +11:00
|
|
|
struct sway_container *container_at(struct sway_container *parent,
|
|
|
|
double lx, double ly,
|
2017-12-11 00:48:44 +11:00
|
|
|
struct wlr_surface **surface, double *sx, double *sy) {
|
2018-02-25 06:30:47 +11:00
|
|
|
list_t *queue = get_bfs_queue();
|
|
|
|
if (!queue) {
|
|
|
|
return NULL;
|
|
|
|
}
|
|
|
|
|
2017-12-11 00:48:44 +11:00
|
|
|
list_add(queue, parent);
|
|
|
|
|
2018-03-30 14:41:33 +11:00
|
|
|
struct sway_container *swayc = NULL;
|
2017-12-11 00:48:44 +11:00
|
|
|
while (queue->length) {
|
|
|
|
swayc = queue->items[0];
|
|
|
|
list_del(queue, 0);
|
|
|
|
if (swayc->type == C_VIEW) {
|
|
|
|
struct sway_view *sview = swayc->sway_view;
|
2018-03-30 14:41:33 +11:00
|
|
|
struct sway_container *soutput = container_parent(swayc, C_OUTPUT);
|
2017-12-11 00:48:44 +11:00
|
|
|
struct wlr_box *output_box =
|
2017-12-16 23:33:23 +11:00
|
|
|
wlr_output_layout_get_box(
|
|
|
|
root_container.sway_root->output_layout,
|
2017-12-11 00:48:44 +11:00
|
|
|
soutput->sway_output->wlr_output);
|
|
|
|
double ox = lx - output_box->x;
|
|
|
|
double oy = ly - output_box->y;
|
|
|
|
double view_sx = ox - swayc->x;
|
|
|
|
double view_sy = oy - swayc->y;
|
|
|
|
|
2018-04-05 07:57:12 +10:00
|
|
|
double _sx, _sy;
|
|
|
|
struct wlr_surface *_surface;
|
2017-12-11 00:48:44 +11:00
|
|
|
switch (sview->type) {
|
2018-04-05 05:53:46 +10:00
|
|
|
case SWAY_VIEW_XWAYLAND:
|
2018-04-05 07:57:12 +10:00
|
|
|
_surface = wlr_surface_surface_at(sview->surface,
|
|
|
|
view_sx, view_sy, &_sx, &_sy);
|
|
|
|
break;
|
2018-04-05 05:53:46 +10:00
|
|
|
case SWAY_VIEW_WL_SHELL:
|
2018-04-05 07:57:12 +10:00
|
|
|
_surface = wlr_wl_shell_surface_surface_at(
|
|
|
|
sview->wlr_wl_shell_surface,
|
|
|
|
view_sx, view_sy, &_sx, &_sy);
|
2018-04-05 05:53:46 +10:00
|
|
|
break;
|
|
|
|
case SWAY_VIEW_XDG_SHELL_V6:
|
|
|
|
// the top left corner of the sway container is the
|
|
|
|
// coordinate of the top left corner of the window geometry
|
|
|
|
view_sx += sview->wlr_xdg_surface_v6->geometry.x;
|
|
|
|
view_sy += sview->wlr_xdg_surface_v6->geometry.y;
|
|
|
|
|
2018-04-05 07:57:12 +10:00
|
|
|
_surface = wlr_xdg_surface_v6_surface_at(
|
|
|
|
sview->wlr_xdg_surface_v6,
|
|
|
|
view_sx, view_sy, &_sx, &_sy);
|
2018-04-05 05:53:46 +10:00
|
|
|
break;
|
2018-01-15 02:50:20 +11:00
|
|
|
}
|
2018-04-05 07:57:12 +10:00
|
|
|
if (_surface) {
|
|
|
|
*sx = _sx;
|
|
|
|
*sy = _sy;
|
|
|
|
*surface = _surface;
|
2017-12-11 00:48:44 +11:00
|
|
|
return swayc;
|
|
|
|
}
|
|
|
|
} else {
|
|
|
|
list_cat(queue, swayc->children);
|
|
|
|
}
|
|
|
|
}
|
|
|
|
|
|
|
|
return NULL;
|
|
|
|
}
|
2018-01-21 08:21:45 +11:00
|
|
|
|
2018-03-30 14:53:38 +11:00
|
|
|
void container_for_each_descendant_dfs(struct sway_container *container,
|
|
|
|
void (*f)(struct sway_container *container, void *data),
|
|
|
|
void *data) {
|
2018-01-21 08:21:45 +11:00
|
|
|
if (container) {
|
|
|
|
if (container->children) {
|
2018-03-30 14:53:38 +11:00
|
|
|
for (int i = 0; i < container->children->length; ++i) {
|
|
|
|
struct sway_container *child =
|
|
|
|
container->children->items[i];
|
|
|
|
container_for_each_descendant_dfs(child, f, data);
|
2018-01-21 08:21:45 +11:00
|
|
|
}
|
|
|
|
}
|
|
|
|
f(container, data);
|
|
|
|
}
|
|
|
|
}
|
2018-02-05 05:39:10 +11:00
|
|
|
|
2018-03-30 14:53:38 +11:00
|
|
|
void container_for_each_descendant_bfs(struct sway_container *con,
|
2018-03-30 14:41:33 +11:00
|
|
|
void (*f)(struct sway_container *con, void *data), void *data) {
|
2018-02-25 06:30:47 +11:00
|
|
|
list_t *queue = get_bfs_queue();
|
|
|
|
if (!queue) {
|
|
|
|
return;
|
|
|
|
}
|
|
|
|
|
2018-02-11 08:52:45 +11:00
|
|
|
if (queue == NULL) {
|
|
|
|
wlr_log(L_ERROR, "could not allocate list");
|
|
|
|
return;
|
|
|
|
}
|
2018-02-05 05:39:10 +11:00
|
|
|
|
|
|
|
list_add(queue, con);
|
|
|
|
|
2018-03-30 14:41:33 +11:00
|
|
|
struct sway_container *current = NULL;
|
2018-02-05 05:39:10 +11:00
|
|
|
while (queue->length) {
|
|
|
|
current = queue->items[0];
|
|
|
|
list_del(queue, 0);
|
2018-02-11 08:52:45 +11:00
|
|
|
f(current, data);
|
2018-02-05 05:39:10 +11:00
|
|
|
// TODO floating containers
|
|
|
|
list_cat(queue, current->children);
|
|
|
|
}
|
|
|
|
}
|
2018-03-31 01:31:21 +11:00
|
|
|
|
|
|
|
bool container_has_anscestor(struct sway_container *descendant,
|
|
|
|
struct sway_container *anscestor) {
|
|
|
|
while (descendant->type != C_ROOT) {
|
|
|
|
descendant = descendant->parent;
|
|
|
|
if (descendant == anscestor) {
|
|
|
|
return true;
|
|
|
|
}
|
|
|
|
}
|
|
|
|
return false;
|
|
|
|
}
|
2018-04-01 05:22:10 +10:00
|
|
|
|
2018-04-03 04:15:40 +10:00
|
|
|
static bool find_child_func(struct sway_container *con, void *data) {
|
2018-04-01 05:22:10 +10:00
|
|
|
struct sway_container *child = data;
|
|
|
|
return con == child;
|
|
|
|
}
|
|
|
|
|
|
|
|
bool container_has_child(struct sway_container *con,
|
|
|
|
struct sway_container *child) {
|
2018-04-06 08:31:19 +10:00
|
|
|
if (con == NULL || con->type == C_VIEW || con->children->length == 0) {
|
2018-04-01 05:22:10 +10:00
|
|
|
return false;
|
|
|
|
}
|
|
|
|
return container_find(con, find_child_func, child);
|
|
|
|
}
|
2018-04-06 08:31:19 +10:00
|
|
|
|
|
|
|
void container_damage_whole(struct sway_container *con) {
|
|
|
|
struct sway_container *output = con;
|
|
|
|
if (output->type != C_OUTPUT) {
|
|
|
|
output = container_parent(output, C_OUTPUT);
|
|
|
|
}
|
2018-04-06 08:38:50 +10:00
|
|
|
output_damage_whole_container(output->sway_output, con);
|
2018-04-06 08:31:19 +10:00
|
|
|
}
|