struct all_cons_head all_cons = TAILQ_HEAD_INITIALIZER(all_cons);
/*
- * Loads tree from ~/.i3/_restart.json
+ * Loads tree from ~/.i3/_restart.json (used for in-place restarts).
*
*/
-bool tree_restore() {
- char *globbed = glob_path("~/.i3/_restart.json");
+bool tree_restore(const char *path) {
+ char *globbed = resolve_tilde(path);
if (!path_exists(globbed)) {
LOG("%s does not exist, not restoring tree\n", globbed);
focused = croot;
tree_append_json(globbed);
- char *old_restart = glob_path("~/.i3/_restart.json.old");
- unlink(old_restart);
- rename(globbed, old_restart);
- free(globbed);
- free(old_restart);
printf("appended tree, using new root\n");
croot = TAILQ_FIRST(&(croot->nodes_head));
printf("out = %p\n", out);
Con *ws = TAILQ_FIRST(&(out->nodes_head));
printf("ws = %p\n", ws);
- con_focus(ws);
return true;
}
/*
- * Initializes the tree by creating the root node, adding all RandR outputs
- * to the tree (that means randr_init() has to be called before) and
- * assigning a workspace to each RandR output.
+ * Initializes the tree by creating the root node. The CT_OUTPUT Cons below the
+ * root node are created in randr.c for each Output.
*
*/
void tree_init() {
- Output *output;
-
croot = con_new(NULL);
+ FREE(croot->name);
croot->name = "root";
croot->type = CT_ROOT;
-
- Con *ws;
- /* add the outputs */
- TAILQ_FOREACH(output, &outputs, outputs) {
- if (!output->active)
- continue;
-
- Con *oc = con_new(croot);
- oc->name = strdup(output->name);
- oc->type = CT_OUTPUT;
- oc->rect = output->rect;
-
- /* add a workspace to this output */
- ws = con_new(oc);
- ws->name = strdup("1");
- ws->fullscreen_mode = CF_OUTPUT;
- }
-
- con_focus(ws);
}
/*
con = focused->parent;
/* If the parent is an output, we are on a workspace. In this case,
* the new container needs to be opened as a leaf of the workspace. */
- if (con->type == CT_OUTPUT)
+ if (con->parent->type == CT_OUTPUT && con->type != CT_DOCKAREA) {
con = focused;
+ }
+
+ /* If the currently focused container is a floating container, we
+ * attach the new container to the workspace */
+ if (con->type == CT_FLOATING_CON)
+ con = con->parent;
+ DLOG("con = %p\n", con);
}
assert(con != NULL);
- /* 3: re-calculate child->percent for each child */
- con_fix_percent(con, WINDOW_ADD);
-
- /* 4: add a new container leaf to this con */
+ /* 3. create the container and attach it to its parent */
Con *new = con_new(con);
- con_focus(new);
+
+ /* 4: re-calculate child->percent for each child */
+ con_fix_percent(con);
return new;
}
+static bool _is_con_mapped(Con *con) {
+ Con *child;
+
+ TAILQ_FOREACH(child, &(con->nodes_head), nodes)
+ if (_is_con_mapped(child))
+ return true;
+
+ return con->mapped;
+}
+
/*
* Closes the given container including all children
*
*/
-void tree_close(Con *con) {
- /* TODO: check floating clients and adjust old_parent if necessary */
+void tree_close(Con *con, bool kill_window, bool dont_kill_parent) {
+ bool was_mapped = con->mapped;
+ Con *parent = con->parent;
- /* Get the container which is next focused */
- Con *next;
- if (con->type == CT_FLOATING_CON) {
- next = TAILQ_NEXT(con, floating_windows);
- if (next == TAILQ_END(&(con->parent->floating_head)))
- next = con->parent;
- } else {
- next = TAILQ_NEXT(con, focused);
- if (next == TAILQ_END(&(con->parent->nodes_head)))
- next = con->parent;
+ if (!was_mapped) {
+ /* Even if the container itself is not mapped, its children may be
+ * mapped (for example split containers don't have a mapped window on
+ * their own but usually contain mapped children). */
+ was_mapped = _is_con_mapped(con);
}
- LOG("closing %p\n", con);
+ /* Get the container which is next focused */
+ Con *next = con_next_focused(con);
+ DLOG("next = %p, focused = %p\n", next, focused);
+
+ DLOG("closing %p, kill_window = %d\n", con, kill_window);
Con *child;
/* We cannot use TAILQ_FOREACH because the children get deleted
* in their parent’s nodes_head */
while (!TAILQ_EMPTY(&(con->nodes_head))) {
child = TAILQ_FIRST(&(con->nodes_head));
- tree_close(child);
+ DLOG("killing child=%p\n", child);
+ tree_close(child, kill_window, true);
+ }
+
+ if (con->window != NULL) {
+ if (kill_window)
+ x_window_kill(con->window->id);
+ else {
+ /* un-parent the window */
+ xcb_reparent_window(conn, con->window->id, root, 0, 0);
+ /* TODO: client_unmap to set state to withdrawn */
+
+ }
+ FREE(con->window->class_class);
+ FREE(con->window->class_instance);
+ FREE(con->window->name_x);
+ FREE(con->window->name_json);
+ free(con->window);
}
/* kill the X11 part of this container */
x_con_kill(con);
con_detach(con);
- con_fix_percent(con->parent, WINDOW_REMOVE);
+ if (con->type != CT_FLOATING_CON) {
+ /* If the container is *not* floating, we might need to re-distribute
+ * percentage values for the resized containers. */
+ con_fix_percent(parent);
+ }
- if (con->window != NULL) {
- x_window_kill(con->window->id);
- free(con->window);
+ if (con_is_floating(con)) {
+ Con *ws = con_get_workspace(con);
+ DLOG("Container was floating, killing floating container\n");
+ tree_close(parent, false, false);
+ DLOG("parent container killed\n");
+ if (con == focused) {
+ DLOG("This is the focused container, i need to find another one to focus. I start looking at ws = %p\n", ws);
+ /* go down the focus stack as far as possible */
+ next = con_descend_focused(ws);
+
+ dont_kill_parent = true;
+ DLOG("Alright, focusing %p\n", next);
+ } else {
+ next = NULL;
+ }
}
+
free(con->name);
TAILQ_REMOVE(&all_cons, con, all_cons);
free(con);
- /* TODO: check if the container (or one of its children) was focused */
- con_focus(next);
+ /* in the case of floating windows, we already focused another container
+ * when closing the parent, so we can exit now. */
+ if (!next) {
+ DLOG("No next container, i will just exit now\n");
+ return;
+ }
+
+ if (was_mapped || con == focused) {
+ if (kill_window || !dont_kill_parent || con == focused) {
+ DLOG("focusing %p / %s\n", next, next->name);
+ /* TODO: check if the container (or one of its children) was focused */
+ if (next->type == CT_DOCKAREA) {
+ /* Instead of focusing the dockarea, we need to restore focus to the workspace */
+ con_focus(con_descend_focused(output_get_content(next->parent)));
+ } else {
+ con_focus(next);
+ }
+ }
+ else {
+ DLOG("not focusing because we're not killing anybody");
+ }
+ } else {
+ DLOG("not focusing, was not mapped\n");
+ }
+
+ /* check if the parent container is empty now and close it */
+ if (!dont_kill_parent)
+ CALL(parent, on_remove_child);
}
+/*
+ * Closes the current container using tree_close().
+ *
+ */
void tree_close_con() {
assert(focused != NULL);
- if (focused->parent->type == CT_OUTPUT) {
+ if (focused->type == CT_WORKSPACE) {
LOG("Cannot close workspace\n");
return;
}
+ /* There *should* be no possibility to focus outputs / root container */
+ assert(focused->type != CT_OUTPUT);
+ assert(focused->type != CT_ROOT);
+
/* Kill con */
- tree_close(focused);
+ tree_close(focused, true, false);
}
/*
*
*/
void tree_split(Con *con, orientation_t orientation) {
+ /* for a workspace, we just need to change orientation */
+ if (con->type == CT_WORKSPACE) {
+ DLOG("Workspace, simply changing orientation to %d\n", orientation);
+ con->orientation = orientation;
+ return;
+ }
+
+ Con *parent = con->parent;
+ /* if we are in a container whose parent contains only one
+ * child (its split functionality is unused so far), we just change the
+ * orientation (more intuitive than splitting again) */
+ if (con_num_children(parent) == 1) {
+ parent->orientation = orientation;
+ DLOG("Just changing orientation of existing container\n");
+ return;
+ }
+
+ DLOG("Splitting in orientation %d\n", orientation);
+
/* 2: replace it with a new Con */
Con *new = con_new(NULL);
- Con *parent = con->parent;
TAILQ_REPLACE(&(parent->nodes_head), con, new, nodes);
TAILQ_REPLACE(&(parent->focus_head), con, new, focused);
new->parent = parent;
new->orientation = orientation;
- /* 3: add it as a child to the new Con */
- con_attach(con, new);
+ /* 3: swap 'percent' (resize factor) */
+ new->percent = con->percent;
+ con->percent = 0.0;
+
+ /* 4: add it as a child to the new Con */
+ con_attach(con, new, false);
}
+/*
+ * Moves focus one level up.
+ *
+ */
void level_up() {
/* We can focus up to the workspace, but not any higher in the tree */
- if (focused->parent->type != CT_CON) {
+ if ((focused->parent->type != CT_CON &&
+ focused->parent->type != CT_WORKSPACE) ||
+ focused->type == CT_WORKSPACE) {
printf("cannot go up\n");
return;
}
con_focus(focused->parent);
}
+/*
+ * Moves focus one level down.
+ *
+ */
void level_down() {
/* Go down the focus stack of the current node */
Con *next = TAILQ_FIRST(&(focused->focus_head));
con->mapped = false;
TAILQ_FOREACH(current, &(con->nodes_head), nodes)
mark_unmapped(current);
+ if (con->type == CT_WORKSPACE) {
+ /* We need to call mark_unmapped on floating nodes aswell since we can
+ * make containers floating. */
+ TAILQ_FOREACH(current, &(con->floating_head), floating_windows)
+ mark_unmapped(current);
+ }
}
+/*
+ * Renders the tree, that is rendering all outputs using render_con() and
+ * pushing the changes to X11 using x_push_changes().
+ *
+ */
void tree_render() {
if (croot == NULL)
return;
- printf("-- BEGIN RENDERING --\n");
+ DLOG("-- BEGIN RENDERING --\n");
/* Reset map state for all nodes in tree */
/* TODO: a nicer method to walk all nodes would be good, maybe? */
mark_unmapped(croot);
/* We start rendering at an output */
Con *output;
TAILQ_FOREACH(output, &(croot->nodes_head), nodes) {
- printf("output %p / %s\n", output, output->name);
- render_con(output);
+ DLOG("output %p / %s\n", output, output->name);
+ render_con(output, false);
}
x_push_changes(croot);
- printf("-- END RENDERING --\n");
+ DLOG("-- END RENDERING --\n");
}
+/*
+ * Changes focus in the given way (next/previous) and given orientation
+ * (horizontal/vertical).
+ *
+ */
void tree_next(char way, orientation_t orientation) {
/* 1: get the first parent with the same orientation */
Con *parent = focused->parent;
- while (parent->orientation != orientation) {
+ while (focused->type != CT_WORKSPACE &&
+ (con_orientation(parent) != orientation ||
+ con_num_children(parent) == 1)) {
LOG("need to go one level further up\n");
/* if the current parent is an output, we are at a workspace
* and the orientation still does not match */
- if (parent->parent->type == CT_OUTPUT)
+ if (parent->type == CT_WORKSPACE)
return;
parent = parent->parent;
}
Con *current = TAILQ_FIRST(&(parent->focus_head));
assert(current != TAILQ_END(&(parent->focus_head)));
+ if (TAILQ_EMPTY(&(parent->nodes_head))) {
+ DLOG("Nothing to focus here, move along...\n");
+ return;
+ }
+
/* 2: chose next (or previous) */
Con *next;
if (way == 'n') {
/* 3: focus choice comes in here. at the moment we will go down
* until we find a window */
/* TODO: check for window, atm we only go down as far as possible */
- while (!TAILQ_EMPTY(&(next->focus_head)))
- next = TAILQ_FIRST(&(next->focus_head));
-
- con_focus(next);
+ con_focus(con_descend_focused(next));
}
-void tree_move(char way, orientation_t orientation) {
- /* 1: get the first parent with the same orientation */
- Con *parent = focused->parent;
- bool level_changed = false;
- while (parent->orientation != orientation) {
- LOG("need to go one level further up\n");
- /* if the current parent is an output, we are at a workspace
- * and the orientation still does not match */
- if (parent->parent->type == CT_OUTPUT)
- return;
- parent = parent->parent;
- level_changed = true;
+/*
+ * tree_flatten() removes pairs of redundant split containers, e.g.:
+ * [workspace, horizontal]
+ * [v-split] [child3]
+ * [h-split]
+ * [child1] [child2]
+ * In this example, the v-split and h-split container are redundant.
+ * Such a situation can be created by moving containers in a direction which is
+ * not the orientation of their parent container. i3 needs to create a new
+ * split container then and if you move containers this way multiple times,
+ * redundant chains of split-containers can be the result.
+ *
+ */
+void tree_flatten(Con *con) {
+ Con *current, *child, *parent = con->parent;
+ DLOG("Checking if I can flatten con = %p / %s\n", con, con->name);
+
+ /* We only consider normal containers without windows */
+ if (con->type != CT_CON || con->window != NULL)
+ goto recurse;
+
+ /* Ensure it got only one child */
+ child = TAILQ_FIRST(&(con->nodes_head));
+ if (child == NULL || TAILQ_NEXT(child, nodes) != NULL)
+ goto recurse;
+
+ /* The child must have a different orientation than the con but the same as
+ * the con’s parent to be redundant */
+ if (con->orientation == NO_ORIENTATION ||
+ child->orientation == NO_ORIENTATION ||
+ con->orientation == child->orientation ||
+ child->orientation != parent->orientation)
+ goto recurse;
+
+ DLOG("Alright, I have to flatten this situation now. Stay calm.\n");
+ /* 1: save focus */
+ Con *focus_next = TAILQ_FIRST(&(child->focus_head));
+
+ DLOG("detaching...\n");
+ /* 2: re-attach the children to the parent before con */
+ while (!TAILQ_EMPTY(&(child->nodes_head))) {
+ current = TAILQ_FIRST(&(child->nodes_head));
+ DLOG("detaching current=%p / %s\n", current, current->name);
+ con_detach(current);
+ DLOG("re-attaching\n");
+ /* We don’t use con_attach() here because for a CT_CON, the special
+ * case handling of con_attach() does not trigger. So all it would do
+ * is calling TAILQ_INSERT_AFTER, but with the wrong container. So we
+ * directly use the TAILQ macros. */
+ current->parent = parent;
+ TAILQ_INSERT_BEFORE(con, current, nodes);
+ DLOG("attaching to focus list\n");
+ TAILQ_INSERT_TAIL(&(parent->focus_head), current, focused);
+ current->percent = con->percent;
+ }
+ DLOG("re-attached all\n");
+
+ /* 3: restore focus, if con was focused */
+ if (focus_next != NULL &&
+ TAILQ_FIRST(&(parent->focus_head)) == con) {
+ DLOG("restoring focus to focus_next=%p\n", focus_next);
+ TAILQ_REMOVE(&(parent->focus_head), focus_next, focused);
+ TAILQ_INSERT_HEAD(&(parent->focus_head), focus_next, focused);
+ DLOG("restored focus.\n");
}
- Con *current = TAILQ_FIRST(&(parent->focus_head));
- assert(current != TAILQ_END(&(parent->focus_head)));
-
- /* 2: chose next (or previous) */
- Con *next = current;
- if (way == 'n') {
- LOG("i would insert it after %p / %s\n", next, next->name);
- if (!level_changed) {
- next = TAILQ_NEXT(next, nodes);
- if (next == TAILQ_END(&(next->parent->nodes_head))) {
- LOG("cannot move further to the right\n");
- return;
- }
- }
-
- con_detach(focused);
- focused->parent = next->parent;
-
- TAILQ_INSERT_AFTER(&(next->parent->nodes_head), next, focused, nodes);
- TAILQ_INSERT_HEAD(&(next->parent->focus_head), focused, focused);
- /* TODO: don’t influence focus handling? */
- } else {
- LOG("i would insert it before %p / %s\n", current, current->name);
- if (!level_changed) {
- next = TAILQ_PREV(next, nodes_head, nodes);
- if (next == TAILQ_END(&(next->parent->nodes_head))) {
- LOG("cannot move further\n");
- return;
- }
- }
- con_detach(focused);
- focused->parent = next->parent;
+ /* 4: close the redundant cons */
+ DLOG("closing redundant cons\n");
+ tree_close(con, false, true);
+
+ /* Well, we got to abort the recursion here because we destroyed the
+ * container. However, if tree_flatten() is called sufficiently often,
+ * there can’t be the situation of having two pairs of redundant containers
+ * at once. Therefore, we can safely abort the recursion on this level
+ * after flattening. */
+ return;
+
+recurse:
+ /* We cannot use normal foreach here because tree_flatten might close the
+ * current container. */
+ current = TAILQ_FIRST(&(con->nodes_head));
+ while (current != NULL) {
+ Con *next = TAILQ_NEXT(current, nodes);
+ tree_flatten(current);
+ current = next;
+ }
- TAILQ_INSERT_BEFORE(next, focused, nodes);
- TAILQ_INSERT_HEAD(&(next->parent->focus_head), focused, focused);
- /* TODO: don’t influence focus handling? */
+ current = TAILQ_FIRST(&(con->floating_head));
+ while (current != NULL) {
+ Con *next = TAILQ_NEXT(current, floating_windows);
+ tree_flatten(current);
+ current = next;
}
}
projects / i3 / i3 / blobdiff