2010-03-27 15:25:51 +01:00
|
|
|
|
/*
|
|
|
|
|
* vim:ts=4:sw=4:expandtab
|
|
|
|
|
*
|
|
|
|
|
* i3 - an improved dynamic tiling window manager
|
|
|
|
|
* © 2009-2010 Michael Stapelberg and contributors (see also: LICENSE)
|
|
|
|
|
*
|
|
|
|
|
* con.c contains all functions which deal with containers directly (creating
|
|
|
|
|
* containers, searching containers, getting specific properties from
|
|
|
|
|
* containers, …).
|
|
|
|
|
*
|
|
|
|
|
*/
|
|
|
|
|
#include "all.h"
|
|
|
|
|
|
|
|
|
|
char *colors[] = {
|
|
|
|
|
"#ff0000",
|
|
|
|
|
"#00FF00",
|
|
|
|
|
"#0000FF",
|
|
|
|
|
"#ff00ff",
|
|
|
|
|
"#00ffff",
|
|
|
|
|
"#ffff00",
|
|
|
|
|
"#aa0000",
|
|
|
|
|
"#00aa00",
|
|
|
|
|
"#0000aa",
|
|
|
|
|
"#aa00aa"
|
|
|
|
|
};
|
|
|
|
|
|
2010-07-13 11:35:05 +02:00
|
|
|
|
/*
|
|
|
|
|
* Create a new container (and attach it to the given parent, if not NULL).
|
|
|
|
|
* This function initializes the data structures and creates the appropriate
|
|
|
|
|
* X11 IDs using x_con_init().
|
|
|
|
|
*
|
|
|
|
|
*/
|
2010-03-27 15:25:51 +01:00
|
|
|
|
Con *con_new(Con *parent) {
|
|
|
|
|
Con *new = scalloc(sizeof(Con));
|
|
|
|
|
TAILQ_INSERT_TAIL(&all_cons, new, all_cons);
|
|
|
|
|
new->type = CT_CON;
|
|
|
|
|
new->name = strdup("");
|
|
|
|
|
static int cnt = 0;
|
|
|
|
|
LOG("opening window %d\n", cnt);
|
|
|
|
|
|
|
|
|
|
/* TODO: remove window coloring after test-phase */
|
|
|
|
|
LOG("color %s\n", colors[cnt]);
|
|
|
|
|
new->name = strdup(colors[cnt]);
|
2010-11-13 22:39:59 +01:00
|
|
|
|
//uint32_t cp = get_colorpixel(colors[cnt]);
|
2010-03-27 15:25:51 +01:00
|
|
|
|
cnt++;
|
|
|
|
|
if ((cnt % (sizeof(colors) / sizeof(char*))) == 0)
|
|
|
|
|
cnt = 0;
|
|
|
|
|
|
|
|
|
|
x_con_init(new);
|
|
|
|
|
|
2010-11-13 20:07:49 +01:00
|
|
|
|
// TODO: this needs to be integrated into src/x.c and updated on config file reloads
|
|
|
|
|
xcb_change_window_attributes(conn, new->frame, XCB_CW_BACK_PIXEL, &config.client.background);
|
2010-03-27 15:25:51 +01:00
|
|
|
|
|
|
|
|
|
TAILQ_INIT(&(new->floating_head));
|
|
|
|
|
TAILQ_INIT(&(new->nodes_head));
|
|
|
|
|
TAILQ_INIT(&(new->focus_head));
|
|
|
|
|
TAILQ_INIT(&(new->swallow_head));
|
|
|
|
|
|
|
|
|
|
if (parent != NULL)
|
2010-11-28 01:51:16 +01:00
|
|
|
|
con_attach(new, parent, false);
|
2010-03-27 15:25:51 +01:00
|
|
|
|
|
|
|
|
|
return new;
|
|
|
|
|
}
|
|
|
|
|
|
2010-07-13 11:35:05 +02:00
|
|
|
|
/*
|
|
|
|
|
* Attaches the given container to the given parent. This happens when moving
|
|
|
|
|
* a container or when inserting a new container at a specific place in the
|
|
|
|
|
* tree.
|
|
|
|
|
*
|
2010-11-28 01:51:16 +01:00
|
|
|
|
* ignore_focus is to just insert the Con at the end (useful when creating a
|
|
|
|
|
* new split container *around* some containers, that is, detaching and
|
|
|
|
|
* attaching them in order without wanting to mess with the focus in between).
|
|
|
|
|
*
|
2010-07-13 11:35:05 +02:00
|
|
|
|
*/
|
2010-11-28 01:51:16 +01:00
|
|
|
|
void con_attach(Con *con, Con *parent, bool ignore_focus) {
|
2010-03-27 15:25:51 +01:00
|
|
|
|
con->parent = parent;
|
2010-11-21 16:49:59 +01:00
|
|
|
|
Con *loop;
|
|
|
|
|
Con *current = NULL;
|
2010-11-21 23:35:49 +01:00
|
|
|
|
struct nodes_head *nodes_head = &(parent->nodes_head);
|
|
|
|
|
|
|
|
|
|
/* Workspaces are handled differently: they need to be inserted at the
|
|
|
|
|
* right position. */
|
|
|
|
|
if (con->type == CT_WORKSPACE) {
|
|
|
|
|
DLOG("it's a workspace. num = %d\n", con->num);
|
|
|
|
|
if (con->num == -1 || TAILQ_EMPTY(nodes_head)) {
|
|
|
|
|
TAILQ_INSERT_TAIL(nodes_head, con, nodes);
|
|
|
|
|
} else {
|
|
|
|
|
current = TAILQ_FIRST(nodes_head);
|
|
|
|
|
if (con->num < current->num) {
|
|
|
|
|
/* we need to insert the container at the beginning */
|
|
|
|
|
TAILQ_INSERT_HEAD(nodes_head, con, nodes);
|
2010-11-23 00:28:21 +01:00
|
|
|
|
} else {
|
|
|
|
|
while (current->num != -1 && con->num > current->num) {
|
|
|
|
|
current = TAILQ_NEXT(current, nodes);
|
|
|
|
|
if (current == TAILQ_END(nodes_head)) {
|
|
|
|
|
current = NULL;
|
|
|
|
|
break;
|
|
|
|
|
}
|
2010-11-21 23:35:49 +01:00
|
|
|
|
}
|
2010-11-23 00:28:21 +01:00
|
|
|
|
/* we need to insert con after current, if current is not NULL */
|
|
|
|
|
if (current)
|
|
|
|
|
TAILQ_INSERT_BEFORE(current, con, nodes);
|
|
|
|
|
else TAILQ_INSERT_TAIL(nodes_head, con, nodes);
|
2010-11-21 23:35:49 +01:00
|
|
|
|
}
|
|
|
|
|
}
|
|
|
|
|
goto add_to_focus_head;
|
|
|
|
|
}
|
2010-07-03 17:42:36 +02:00
|
|
|
|
|
2010-11-28 01:51:16 +01:00
|
|
|
|
if (!ignore_focus) {
|
|
|
|
|
/* Get the first tiling container in focus stack */
|
|
|
|
|
TAILQ_FOREACH(loop, &(parent->focus_head), focused) {
|
|
|
|
|
if (loop->type == CT_FLOATING_CON)
|
|
|
|
|
continue;
|
|
|
|
|
current = loop;
|
|
|
|
|
break;
|
|
|
|
|
}
|
2010-07-03 17:42:36 +02:00
|
|
|
|
}
|
2010-11-21 16:49:59 +01:00
|
|
|
|
|
|
|
|
|
/* Insert the container after the tiling container, if found */
|
|
|
|
|
if (current) {
|
|
|
|
|
DLOG("Inserting con = %p after last focused tiling con %p\n",
|
|
|
|
|
con, current);
|
2010-11-21 23:35:49 +01:00
|
|
|
|
TAILQ_INSERT_AFTER(nodes_head, current, con, nodes);
|
|
|
|
|
} else TAILQ_INSERT_TAIL(nodes_head, con, nodes);
|
2010-11-21 16:49:59 +01:00
|
|
|
|
|
2010-11-21 23:35:49 +01:00
|
|
|
|
add_to_focus_head:
|
2010-03-27 15:25:51 +01:00
|
|
|
|
/* We insert to the TAIL because con_focus() will correct this.
|
|
|
|
|
* This way, we have the option to insert Cons without having
|
|
|
|
|
* to focus them. */
|
|
|
|
|
TAILQ_INSERT_TAIL(&(parent->focus_head), con, focused);
|
|
|
|
|
}
|
|
|
|
|
|
2010-07-13 11:35:05 +02:00
|
|
|
|
/*
|
|
|
|
|
* Detaches the given container from its current parent
|
|
|
|
|
*
|
|
|
|
|
*/
|
2010-03-27 15:25:51 +01:00
|
|
|
|
void con_detach(Con *con) {
|
|
|
|
|
if (con->type == CT_FLOATING_CON) {
|
2010-05-31 23:16:20 +02:00
|
|
|
|
TAILQ_REMOVE(&(con->parent->floating_head), con, floating_windows);
|
|
|
|
|
TAILQ_REMOVE(&(con->parent->focus_head), con, focused);
|
2010-03-27 15:25:51 +01:00
|
|
|
|
} else {
|
|
|
|
|
TAILQ_REMOVE(&(con->parent->nodes_head), con, nodes);
|
|
|
|
|
TAILQ_REMOVE(&(con->parent->focus_head), con, focused);
|
|
|
|
|
}
|
|
|
|
|
}
|
|
|
|
|
|
2010-04-16 21:04:36 +02:00
|
|
|
|
/*
|
|
|
|
|
* Sets input focus to the given container. Will be updated in X11 in the next
|
|
|
|
|
* run of x_push_changes().
|
|
|
|
|
*
|
|
|
|
|
*/
|
|
|
|
|
void con_focus(Con *con) {
|
|
|
|
|
assert(con != NULL);
|
|
|
|
|
|
|
|
|
|
/* 1: set focused-pointer to the new con */
|
|
|
|
|
/* 2: exchange the position of the container in focus stack of the parent all the way up */
|
|
|
|
|
TAILQ_REMOVE(&(con->parent->focus_head), con, focused);
|
|
|
|
|
TAILQ_INSERT_HEAD(&(con->parent->focus_head), con, focused);
|
|
|
|
|
if (con->parent->parent != NULL)
|
|
|
|
|
con_focus(con->parent);
|
|
|
|
|
|
|
|
|
|
focused = con;
|
2010-06-02 17:51:58 +02:00
|
|
|
|
if (con->urgent) {
|
|
|
|
|
con->urgent = false;
|
|
|
|
|
workspace_update_urgent_flag(con_get_workspace(con));
|
|
|
|
|
}
|
2010-04-16 21:04:36 +02:00
|
|
|
|
}
|
|
|
|
|
|
2010-03-27 15:25:51 +01:00
|
|
|
|
/*
|
|
|
|
|
* Returns true when this node is a leaf node (has no children)
|
|
|
|
|
*
|
|
|
|
|
*/
|
|
|
|
|
bool con_is_leaf(Con *con) {
|
|
|
|
|
return TAILQ_EMPTY(&(con->nodes_head));
|
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
/*
|
|
|
|
|
* Returns true if this node accepts a window (if the node swallows windows,
|
|
|
|
|
* it might already have swallowed enough and cannot hold any more).
|
|
|
|
|
*
|
|
|
|
|
*/
|
|
|
|
|
bool con_accepts_window(Con *con) {
|
|
|
|
|
/* 1: workspaces never accept direct windows */
|
2010-05-31 00:11:11 +02:00
|
|
|
|
if (con->type == CT_WORKSPACE)
|
2010-03-27 15:25:51 +01:00
|
|
|
|
return false;
|
|
|
|
|
|
2010-06-02 22:35:37 +02:00
|
|
|
|
if (con->orientation != NO_ORIENTATION) {
|
|
|
|
|
DLOG("container %p does not accepts windows, orientation != NO_ORIENTATION\n", con);
|
|
|
|
|
return false;
|
|
|
|
|
}
|
|
|
|
|
|
2010-03-27 15:25:51 +01:00
|
|
|
|
/* TODO: if this is a swallowing container, we need to check its max_clients */
|
|
|
|
|
return (con->window == NULL);
|
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
/*
|
|
|
|
|
* Gets the output container (first container with CT_OUTPUT in hierarchy) this
|
|
|
|
|
* node is on.
|
|
|
|
|
*
|
|
|
|
|
*/
|
|
|
|
|
Con *con_get_output(Con *con) {
|
|
|
|
|
Con *result = con;
|
|
|
|
|
while (result != NULL && result->type != CT_OUTPUT)
|
|
|
|
|
result = result->parent;
|
|
|
|
|
/* We must be able to get an output because focus can never be set higher
|
|
|
|
|
* in the tree (root node cannot be focused). */
|
|
|
|
|
assert(result != NULL);
|
|
|
|
|
return result;
|
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
/*
|
|
|
|
|
* Gets the workspace container this node is on.
|
|
|
|
|
*
|
|
|
|
|
*/
|
|
|
|
|
Con *con_get_workspace(Con *con) {
|
|
|
|
|
Con *result = con;
|
2010-05-31 00:11:11 +02:00
|
|
|
|
while (result != NULL && result->type != CT_WORKSPACE)
|
2010-03-27 15:25:51 +01:00
|
|
|
|
result = result->parent;
|
|
|
|
|
assert(result != NULL);
|
|
|
|
|
return result;
|
|
|
|
|
}
|
|
|
|
|
|
2010-04-13 20:51:43 +02:00
|
|
|
|
/*
|
|
|
|
|
* helper data structure for the breadth-first-search in
|
|
|
|
|
* con_get_fullscreen_con()
|
|
|
|
|
*
|
|
|
|
|
*/
|
|
|
|
|
struct bfs_entry {
|
|
|
|
|
Con *con;
|
|
|
|
|
|
|
|
|
|
TAILQ_ENTRY(bfs_entry) entries;
|
|
|
|
|
};
|
|
|
|
|
|
2010-03-27 15:25:51 +01:00
|
|
|
|
/*
|
|
|
|
|
* Returns the first fullscreen node below this node.
|
|
|
|
|
*
|
|
|
|
|
*/
|
|
|
|
|
Con *con_get_fullscreen_con(Con *con) {
|
2010-04-13 20:51:43 +02:00
|
|
|
|
Con *current, *child;
|
2010-03-27 15:25:51 +01:00
|
|
|
|
|
|
|
|
|
/* TODO: is breadth-first-search really appropriate? (check as soon as
|
|
|
|
|
* fullscreen levels and fullscreen for containers is implemented) */
|
2010-04-13 20:51:43 +02:00
|
|
|
|
TAILQ_HEAD(bfs_head, bfs_entry) bfs_head = TAILQ_HEAD_INITIALIZER(bfs_head);
|
|
|
|
|
struct bfs_entry *entry = smalloc(sizeof(struct bfs_entry));
|
|
|
|
|
entry->con = con;
|
|
|
|
|
TAILQ_INSERT_TAIL(&bfs_head, entry, entries);
|
|
|
|
|
|
|
|
|
|
while (!TAILQ_EMPTY(&bfs_head)) {
|
|
|
|
|
entry = TAILQ_FIRST(&bfs_head);
|
|
|
|
|
current = entry->con;
|
|
|
|
|
if (current != con && current->fullscreen_mode != CF_NONE) {
|
|
|
|
|
/* empty the queue */
|
|
|
|
|
while (!TAILQ_EMPTY(&bfs_head)) {
|
|
|
|
|
entry = TAILQ_FIRST(&bfs_head);
|
|
|
|
|
TAILQ_REMOVE(&bfs_head, entry, entries);
|
|
|
|
|
free(entry);
|
|
|
|
|
}
|
2010-03-27 15:25:51 +01:00
|
|
|
|
return current;
|
|
|
|
|
}
|
2010-04-13 20:51:43 +02:00
|
|
|
|
|
|
|
|
|
TAILQ_REMOVE(&bfs_head, entry, entries);
|
|
|
|
|
free(entry);
|
|
|
|
|
|
|
|
|
|
TAILQ_FOREACH(child, &(current->nodes_head), nodes) {
|
|
|
|
|
entry = smalloc(sizeof(struct bfs_entry));
|
|
|
|
|
entry->con = child;
|
|
|
|
|
TAILQ_INSERT_TAIL(&bfs_head, entry, entries);
|
|
|
|
|
}
|
2010-03-27 15:25:51 +01:00
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
return NULL;
|
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
/*
|
|
|
|
|
* Returns true if the node is floating.
|
|
|
|
|
*
|
|
|
|
|
*/
|
|
|
|
|
bool con_is_floating(Con *con) {
|
|
|
|
|
assert(con != NULL);
|
|
|
|
|
LOG("checking if con %p is floating\n", con);
|
|
|
|
|
return (con->floating >= FLOATING_AUTO_ON);
|
|
|
|
|
}
|
|
|
|
|
|
2010-07-13 11:35:05 +02:00
|
|
|
|
/*
|
|
|
|
|
* Returns the container with the given client window ID or NULL if no such
|
|
|
|
|
* container exists.
|
|
|
|
|
*
|
|
|
|
|
*/
|
2010-03-27 15:25:51 +01:00
|
|
|
|
Con *con_by_window_id(xcb_window_t window) {
|
|
|
|
|
Con *con;
|
|
|
|
|
TAILQ_FOREACH(con, &all_cons, all_cons)
|
|
|
|
|
if (con->window != NULL && con->window->id == window)
|
|
|
|
|
return con;
|
|
|
|
|
return NULL;
|
|
|
|
|
}
|
|
|
|
|
|
2010-07-13 11:35:05 +02:00
|
|
|
|
/*
|
|
|
|
|
* Returns the container with the given frame ID or NULL if no such container
|
|
|
|
|
* exists.
|
|
|
|
|
*
|
|
|
|
|
*/
|
2010-03-27 15:25:51 +01:00
|
|
|
|
Con *con_by_frame_id(xcb_window_t frame) {
|
|
|
|
|
Con *con;
|
|
|
|
|
TAILQ_FOREACH(con, &all_cons, all_cons)
|
|
|
|
|
if (con->frame == frame)
|
|
|
|
|
return con;
|
|
|
|
|
return NULL;
|
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
/*
|
|
|
|
|
* Returns the first container which wants to swallow this window
|
|
|
|
|
* TODO: priority
|
|
|
|
|
*
|
|
|
|
|
*/
|
|
|
|
|
Con *con_for_window(i3Window *window, Match **store_match) {
|
|
|
|
|
Con *con;
|
|
|
|
|
Match *match;
|
|
|
|
|
LOG("searching con for window %p\n", window);
|
2010-04-13 17:22:34 +02:00
|
|
|
|
LOG("class == %s\n", window->class_class);
|
2010-03-27 15:25:51 +01:00
|
|
|
|
|
|
|
|
|
TAILQ_FOREACH(con, &all_cons, all_cons)
|
|
|
|
|
TAILQ_FOREACH(match, &(con->swallow_head), matches) {
|
|
|
|
|
if (!match_matches_window(match, window))
|
|
|
|
|
continue;
|
|
|
|
|
if (store_match != NULL)
|
|
|
|
|
*store_match = match;
|
|
|
|
|
return con;
|
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
return NULL;
|
|
|
|
|
}
|
|
|
|
|
|
2010-11-13 14:55:11 +01:00
|
|
|
|
/*
|
|
|
|
|
* Returns the number of children of this container.
|
|
|
|
|
*
|
|
|
|
|
*/
|
|
|
|
|
int con_num_children(Con *con) {
|
|
|
|
|
Con *child;
|
|
|
|
|
int children = 0;
|
|
|
|
|
|
|
|
|
|
TAILQ_FOREACH(child, &(con->nodes_head), nodes)
|
|
|
|
|
children++;
|
|
|
|
|
|
|
|
|
|
return children;
|
|
|
|
|
}
|
|
|
|
|
|
2010-03-27 15:25:51 +01:00
|
|
|
|
/*
|
|
|
|
|
* Updates the percent attribute of the children of the given container. This
|
|
|
|
|
* function needs to be called when a window is added or removed from a
|
|
|
|
|
* container.
|
|
|
|
|
*
|
|
|
|
|
*/
|
|
|
|
|
void con_fix_percent(Con *con, int action) {
|
|
|
|
|
Con *child;
|
2010-11-13 14:55:11 +01:00
|
|
|
|
int children = con_num_children(con);
|
2010-03-27 15:25:51 +01:00
|
|
|
|
/* TODO: better document why this math works */
|
|
|
|
|
double fix;
|
|
|
|
|
if (action == WINDOW_ADD)
|
|
|
|
|
fix = (1.0 - (1.0 / (children+1)));
|
|
|
|
|
else
|
|
|
|
|
fix = 1.0 / (1.0 - (1.0 / (children+1)));
|
|
|
|
|
|
|
|
|
|
TAILQ_FOREACH(child, &(con->nodes_head), nodes) {
|
|
|
|
|
if (child->percent <= 0.0)
|
|
|
|
|
continue;
|
|
|
|
|
child->percent *= fix;
|
|
|
|
|
}
|
|
|
|
|
}
|
2010-04-17 17:40:41 +02:00
|
|
|
|
|
2010-07-13 11:35:05 +02:00
|
|
|
|
/*
|
|
|
|
|
* Toggles fullscreen mode for the given container. Fullscreen mode will not be
|
|
|
|
|
* entered when there already is a fullscreen container on this workspace.
|
|
|
|
|
*
|
|
|
|
|
*/
|
2010-04-17 17:40:41 +02:00
|
|
|
|
void con_toggle_fullscreen(Con *con) {
|
|
|
|
|
Con *workspace, *fullscreen;
|
|
|
|
|
LOG("toggling fullscreen for %p / %s\n", con, con->name);
|
|
|
|
|
if (con->fullscreen_mode == CF_NONE) {
|
|
|
|
|
/* 1: check if there already is a fullscreen con */
|
|
|
|
|
workspace = con_get_workspace(con);
|
|
|
|
|
if ((fullscreen = con_get_fullscreen_con(workspace)) != NULL) {
|
|
|
|
|
LOG("Not entering fullscreen mode, container (%p/%s) "
|
|
|
|
|
"already is in fullscreen mode\n",
|
|
|
|
|
fullscreen, fullscreen->name);
|
|
|
|
|
return;
|
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
/* 2: enable fullscreen */
|
|
|
|
|
con->fullscreen_mode = CF_OUTPUT;
|
|
|
|
|
} else {
|
|
|
|
|
/* 1: disable fullscreen */
|
|
|
|
|
con->fullscreen_mode = CF_NONE;
|
|
|
|
|
}
|
|
|
|
|
LOG("mode now: %d\n", con->fullscreen_mode);
|
2010-05-26 23:21:37 +02:00
|
|
|
|
|
|
|
|
|
/* update _NET_WM_STATE if this container has a window */
|
|
|
|
|
/* TODO: when a window is assigned to a container which is already
|
|
|
|
|
* fullscreened, this state needs to be pushed to the client, too */
|
|
|
|
|
if (con->window == NULL)
|
|
|
|
|
return;
|
|
|
|
|
|
|
|
|
|
uint32_t values[1];
|
|
|
|
|
unsigned int num = 0;
|
|
|
|
|
|
|
|
|
|
if (con->fullscreen_mode != CF_NONE)
|
|
|
|
|
values[num++] = atoms[_NET_WM_STATE_FULLSCREEN];
|
|
|
|
|
|
|
|
|
|
xcb_change_property(conn, XCB_PROP_MODE_REPLACE, con->window->id,
|
|
|
|
|
atoms[_NET_WM_STATE], ATOM, 32, num, values);
|
2010-04-17 17:40:41 +02:00
|
|
|
|
}
|
2010-06-30 22:23:32 +02:00
|
|
|
|
|
|
|
|
|
/*
|
2010-07-13 11:35:05 +02:00
|
|
|
|
* Moves the given container to the currently focused container on the given
|
|
|
|
|
* workspace.
|
2010-06-30 22:23:32 +02:00
|
|
|
|
* TODO: is there a better place for this function?
|
|
|
|
|
*
|
|
|
|
|
*/
|
|
|
|
|
void con_move_to_workspace(Con *con, Con *workspace) {
|
2010-07-17 13:27:34 +02:00
|
|
|
|
/* 1: save the container which is going to be focused after the current
|
|
|
|
|
* container is moved away */
|
|
|
|
|
Con *focus_next = con_next_focused(con);
|
|
|
|
|
|
|
|
|
|
/* 2: get the focused container of this workspace by going down as far as
|
2010-06-30 22:23:32 +02:00
|
|
|
|
* possible */
|
|
|
|
|
Con *next = workspace;
|
|
|
|
|
|
|
|
|
|
while (!TAILQ_EMPTY(&(next->focus_head)))
|
|
|
|
|
next = TAILQ_FIRST(&(next->focus_head));
|
|
|
|
|
|
2010-07-17 13:27:34 +02:00
|
|
|
|
/* 3: we go up one level, but only when next is a normal container */
|
2010-06-30 22:23:32 +02:00
|
|
|
|
if (next->type != CT_WORKSPACE)
|
|
|
|
|
next = next->parent;
|
|
|
|
|
|
|
|
|
|
DLOG("Re-attaching container to %p / %s\n", next, next->name);
|
2010-07-17 13:27:34 +02:00
|
|
|
|
/* 4: re-attach the con to the parent of this focused container */
|
2010-06-30 22:23:32 +02:00
|
|
|
|
con_detach(con);
|
2010-11-28 01:51:16 +01:00
|
|
|
|
con_attach(con, next, false);
|
2010-07-17 13:27:34 +02:00
|
|
|
|
|
|
|
|
|
/* 5: keep focus on the current workspace */
|
|
|
|
|
con_focus(focus_next);
|
2010-06-30 22:23:32 +02:00
|
|
|
|
}
|
2010-07-17 01:27:47 +02:00
|
|
|
|
|
|
|
|
|
/*
|
|
|
|
|
* Returns the orientation of the given container (for stacked containers,
|
|
|
|
|
* vertical orientation is used regardless of the actual orientation of the
|
|
|
|
|
* container).
|
|
|
|
|
*
|
|
|
|
|
*/
|
|
|
|
|
int con_orientation(Con *con) {
|
|
|
|
|
/* stacking containers behave like they are in vertical orientation */
|
|
|
|
|
if (con->layout == L_STACKED)
|
|
|
|
|
return VERT;
|
|
|
|
|
|
2010-11-15 13:55:10 +01:00
|
|
|
|
if (con->layout == L_TABBED)
|
|
|
|
|
return HORIZ;
|
|
|
|
|
|
2010-07-17 01:27:47 +02:00
|
|
|
|
return con->orientation;
|
|
|
|
|
}
|
2010-07-17 13:27:34 +02:00
|
|
|
|
|
|
|
|
|
/*
|
|
|
|
|
* Returns the container which will be focused next when the given container
|
|
|
|
|
* is not available anymore. Called in tree_close and con_move_to_workspace
|
|
|
|
|
* to properly restore focus.
|
|
|
|
|
*
|
|
|
|
|
*/
|
|
|
|
|
Con *con_next_focused(Con *con) {
|
|
|
|
|
Con *next;
|
|
|
|
|
/* floating containers are attached to a workspace, so we focus either the
|
|
|
|
|
* next floating container (if any) or the workspace itself. */
|
|
|
|
|
if (con->type == CT_FLOATING_CON) {
|
2010-11-14 22:35:44 +01:00
|
|
|
|
DLOG("selecting next for CT_FLOATING_CON\n");
|
2010-07-17 13:27:34 +02:00
|
|
|
|
next = TAILQ_NEXT(con, floating_windows);
|
2010-11-14 22:35:44 +01:00
|
|
|
|
if (next == TAILQ_END(&(parent->floating_head))) {
|
|
|
|
|
Con *ws = con_get_workspace(con);
|
|
|
|
|
next = ws;
|
|
|
|
|
DLOG("no more floating containers for next = %p, restoring workspace focus\n", next);
|
|
|
|
|
while (next != TAILQ_END(&(ws->focus_head)) && !TAILQ_EMPTY(&(next->focus_head))) {
|
|
|
|
|
next = TAILQ_FIRST(&(next->focus_head));
|
|
|
|
|
if (next == con) {
|
|
|
|
|
DLOG("skipping container itself, we want the next client\n");
|
|
|
|
|
next = TAILQ_NEXT(next, focused);
|
|
|
|
|
}
|
|
|
|
|
}
|
|
|
|
|
if (next == TAILQ_END(&(ws->focus_head))) {
|
2010-11-20 18:38:24 +01:00
|
|
|
|
DLOG("Focus list empty, returning ws\n");
|
|
|
|
|
next = ws;
|
2010-11-14 22:35:44 +01:00
|
|
|
|
}
|
|
|
|
|
}
|
2010-07-17 13:27:34 +02:00
|
|
|
|
return next;
|
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
/* try to focus the next container on the same level as this one */
|
|
|
|
|
next = TAILQ_NEXT(con, focused);
|
|
|
|
|
|
2010-07-17 15:08:22 +02:00
|
|
|
|
/* if that was not possible, go up to its parent */
|
|
|
|
|
if (next == TAILQ_END(&(parent->nodes_head)))
|
2010-07-17 13:27:34 +02:00
|
|
|
|
next = con->parent;
|
2010-07-17 15:08:22 +02:00
|
|
|
|
|
|
|
|
|
/* now go down the focus stack as far as
|
|
|
|
|
* possible, excluding the current container */
|
|
|
|
|
while (!TAILQ_EMPTY(&(next->focus_head)) &&
|
|
|
|
|
TAILQ_FIRST(&(next->focus_head)) != con)
|
|
|
|
|
next = TAILQ_FIRST(&(next->focus_head));
|
2010-07-17 13:27:34 +02:00
|
|
|
|
|
|
|
|
|
return next;
|
|
|
|
|
}
|
2010-11-12 21:41:10 +01:00
|
|
|
|
|
|
|
|
|
/*
|
|
|
|
|
* Returns a "relative" Rect which contains the amount of pixels that need to
|
|
|
|
|
* be added to the original Rect to get the final position (obviously the
|
|
|
|
|
* amount of pixels for normal, 1pixel and borderless are different).
|
|
|
|
|
*
|
|
|
|
|
*/
|
|
|
|
|
Rect con_border_style_rect(Con *con) {
|
2010-11-13 22:39:59 +01:00
|
|
|
|
switch (con_border_style(con)) {
|
|
|
|
|
case BS_NORMAL:
|
2010-11-12 21:41:10 +01:00
|
|
|
|
return (Rect){2, 0, -(2 * 2), -2};
|
|
|
|
|
|
2010-11-13 22:39:59 +01:00
|
|
|
|
case BS_1PIXEL:
|
2010-11-12 21:41:10 +01:00
|
|
|
|
return (Rect){1, 1, -2, -2};
|
|
|
|
|
|
2010-11-13 22:39:59 +01:00
|
|
|
|
case BS_NONE:
|
2010-11-12 21:41:10 +01:00
|
|
|
|
return (Rect){0, 0, 0, 0};
|
2010-11-13 14:55:11 +01:00
|
|
|
|
|
2010-11-13 22:39:59 +01:00
|
|
|
|
default:
|
|
|
|
|
assert(false);
|
|
|
|
|
}
|
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
/*
|
|
|
|
|
* Use this function to get a container’s border style. This is important
|
|
|
|
|
* because when inside a stack, the border style is always BS_NORMAL.
|
|
|
|
|
* For tabbed mode, the same applies, with one exception: when the container is
|
|
|
|
|
* borderless and the only element in the tabbed container, the border is not
|
|
|
|
|
* rendered.
|
|
|
|
|
*
|
|
|
|
|
*/
|
|
|
|
|
int con_border_style(Con *con) {
|
2010-11-21 17:00:10 +01:00
|
|
|
|
Con *fs = con_get_fullscreen_con(con->parent);
|
|
|
|
|
if (fs == con) {
|
|
|
|
|
DLOG("this one is fullscreen! overriding BS_NONE\n");
|
|
|
|
|
return BS_NONE;
|
|
|
|
|
}
|
|
|
|
|
|
2010-11-13 22:39:59 +01:00
|
|
|
|
if (con->parent->layout == L_STACKED)
|
|
|
|
|
return BS_NORMAL;
|
|
|
|
|
|
|
|
|
|
return con->border_style;
|
2010-11-12 21:41:10 +01:00
|
|
|
|
}
|
2010-11-26 23:08:12 +01:00
|
|
|
|
|
|
|
|
|
/*
|
|
|
|
|
* This function changes the layout of a given container. Use it to handle
|
|
|
|
|
* special cases like changing a whole workspace to stacked/tabbed (creates a
|
|
|
|
|
* new split container before).
|
|
|
|
|
*
|
|
|
|
|
*/
|
|
|
|
|
void con_set_layout(Con *con, int layout) {
|
|
|
|
|
/* When the container type is CT_WORKSPACE, the user wants to change the
|
|
|
|
|
* whole workspace into stacked/tabbed mode. To do this and still allow
|
|
|
|
|
* intuitive operations (like level-up and then opening a new window), we
|
|
|
|
|
* need to create a new split container. */
|
|
|
|
|
if (con->type == CT_WORKSPACE) {
|
|
|
|
|
DLOG("Creating new split container\n");
|
|
|
|
|
/* 1: create a new split container */
|
|
|
|
|
Con *new = con_new(NULL);
|
|
|
|
|
new->parent = con;
|
|
|
|
|
|
|
|
|
|
/* 2: set the requested layout on the split con */
|
|
|
|
|
new->layout = layout;
|
|
|
|
|
|
|
|
|
|
/* 3: While the layout is irrelevant in stacked/tabbed mode, it needs
|
|
|
|
|
* to be set. Otherwise, this con will not be interpreted as a split
|
|
|
|
|
* container. */
|
|
|
|
|
new->orientation = HORIZ;
|
|
|
|
|
|
2010-11-28 01:39:47 +01:00
|
|
|
|
Con *old_focused = TAILQ_FIRST(&(con->focus_head));
|
|
|
|
|
if (old_focused == TAILQ_END(&(con->focus_head)))
|
|
|
|
|
old_focused = NULL;
|
|
|
|
|
|
2010-11-26 23:08:12 +01:00
|
|
|
|
/* 4: move the existing cons of this workspace below the new con */
|
|
|
|
|
DLOG("Moving cons\n");
|
|
|
|
|
Con *child;
|
|
|
|
|
while (!TAILQ_EMPTY(&(con->nodes_head))) {
|
|
|
|
|
child = TAILQ_FIRST(&(con->nodes_head));
|
|
|
|
|
con_detach(child);
|
2010-11-28 01:51:16 +01:00
|
|
|
|
con_attach(child, new, true);
|
2010-11-26 23:08:12 +01:00
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
/* 4: attach the new split container to the workspace */
|
|
|
|
|
DLOG("Attaching new split to ws\n");
|
2010-11-28 01:51:16 +01:00
|
|
|
|
con_attach(new, con, false);
|
2010-11-26 23:08:12 +01:00
|
|
|
|
|
2010-11-28 01:39:47 +01:00
|
|
|
|
if (old_focused)
|
|
|
|
|
con_focus(old_focused);
|
|
|
|
|
|
2010-11-26 23:08:12 +01:00
|
|
|
|
return;
|
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
con->layout = layout;
|
|
|
|
|
}
|