255 lines
6.6 KiB
C
255 lines
6.6 KiB
C
/*
|
|
* 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"
|
|
};
|
|
|
|
|
|
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]);
|
|
uint32_t cp = get_colorpixel(colors[cnt]);
|
|
cnt++;
|
|
if ((cnt % (sizeof(colors) / sizeof(char*))) == 0)
|
|
cnt = 0;
|
|
|
|
x_con_init(new);
|
|
|
|
xcb_change_window_attributes(conn, new->frame, XCB_CW_BACK_PIXEL, &cp);
|
|
|
|
TAILQ_INIT(&(new->floating_head));
|
|
TAILQ_INIT(&(new->nodes_head));
|
|
TAILQ_INIT(&(new->focus_head));
|
|
TAILQ_INIT(&(new->swallow_head));
|
|
|
|
if (parent != NULL)
|
|
con_attach(new, parent);
|
|
|
|
return new;
|
|
}
|
|
|
|
void con_attach(Con *con, Con *parent) {
|
|
con->parent = parent;
|
|
TAILQ_INSERT_TAIL(&(parent->nodes_head), con, nodes);
|
|
/* 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);
|
|
}
|
|
|
|
void con_detach(Con *con) {
|
|
if (con->type == CT_FLOATING_CON) {
|
|
/* TODO: remove */
|
|
} else {
|
|
TAILQ_REMOVE(&(con->parent->nodes_head), con, nodes);
|
|
TAILQ_REMOVE(&(con->parent->focus_head), con, focused);
|
|
}
|
|
}
|
|
|
|
/*
|
|
* 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 */
|
|
if (con->parent->type == CT_OUTPUT)
|
|
return false;
|
|
|
|
/* 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;
|
|
while (result != NULL && result->parent->type != CT_OUTPUT)
|
|
result = result->parent;
|
|
assert(result != NULL);
|
|
return result;
|
|
}
|
|
|
|
/*
|
|
* Returns the first fullscreen node below this node.
|
|
*
|
|
*/
|
|
Con *con_get_fullscreen_con(Con *con) {
|
|
Con *current;
|
|
|
|
LOG("looking for fullscreen node\n");
|
|
/* TODO: is breadth-first-search really appropriate? (check as soon as
|
|
* fullscreen levels and fullscreen for containers is implemented) */
|
|
Con **queue = NULL;
|
|
int queue_len = 0;
|
|
TAILQ_FOREACH(current, &(con->nodes_head), nodes) {
|
|
queue_len++;
|
|
queue = srealloc(queue, queue_len * sizeof(Con*));
|
|
queue[queue_len-1] = current;
|
|
}
|
|
|
|
while (queue_len > 0) {
|
|
current = queue[queue_len-1];
|
|
LOG("checking %p\n", current);
|
|
if (current->fullscreen_mode != CF_NONE) {
|
|
free(queue);
|
|
return current;
|
|
}
|
|
LOG("deleting from queue\n");
|
|
queue_len--;
|
|
queue = realloc(queue, queue_len * sizeof(Con*));
|
|
}
|
|
|
|
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);
|
|
}
|
|
|
|
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;
|
|
}
|
|
|
|
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;
|
|
}
|
|
|
|
static bool match_matches_window(Match *match, i3Window *window) {
|
|
/* TODO: pcre, full matching, … */
|
|
if (match->class != NULL && strcasecmp(match->class, window->class_class) == 0) {
|
|
LOG("match made by window class (%s)\n", window->class_class);
|
|
return true;
|
|
}
|
|
|
|
if (match->instance != NULL && strcasecmp(match->instance, window->class_instance) == 0) {
|
|
LOG("match made by window instance (%s)\n", window->class_instance);
|
|
return true;
|
|
}
|
|
|
|
|
|
if (match->id != XCB_NONE && window->id == match->id) {
|
|
LOG("match made by window id (%d)\n", window->id);
|
|
return true;
|
|
}
|
|
|
|
LOG("window %d (%s) could not be matched\n", window->id, window->class_class);
|
|
|
|
return false;
|
|
}
|
|
|
|
/*
|
|
* 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);
|
|
LOG("class == %s\n", window->class_class);
|
|
|
|
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;
|
|
}
|
|
|
|
/*
|
|
* 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;
|
|
int children = 0;
|
|
TAILQ_FOREACH(child, &(con->nodes_head), nodes)
|
|
children++;
|
|
/* 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;
|
|
}
|
|
}
|