2 * vim:ts=4:sw=4:expandtab
10 struct all_cons_head all_cons = TAILQ_HEAD_INITIALIZER(all_cons);
13 * Loads tree from ~/.i3/_restart.json (used for in-place restarts).
16 bool tree_restore(const char *path) {
17 char *globbed = resolve_tilde(path);
19 if (!path_exists(globbed)) {
20 LOG("%s does not exist, not restoring tree\n", globbed);
25 /* TODO: refactor the following */
26 croot = con_new(NULL);
29 tree_append_json(globbed);
31 printf("appended tree, using new root\n");
32 croot = TAILQ_FIRST(&(croot->nodes_head));
33 printf("new root = %p\n", croot);
34 Con *out = TAILQ_FIRST(&(croot->nodes_head));
35 printf("out = %p\n", out);
36 Con *ws = TAILQ_FIRST(&(out->nodes_head));
37 printf("ws = %p\n", ws);
43 * Initializes the tree by creating the root node. The CT_OUTPUT Cons below the
44 * root node are created in randr.c for each Output.
48 croot = con_new(NULL);
51 croot->type = CT_ROOT;
55 * Opens an empty container in the current container
58 Con *tree_open_con(Con *con, bool focus_it) {
60 /* every focusable Con has a parent (outputs have parent root) */
61 con = focused->parent;
62 /* If the parent is an output, we are on a workspace. In this case,
63 * the new container needs to be opened as a leaf of the workspace. */
64 if (con->parent->type == CT_OUTPUT && con->type != CT_DOCKAREA) {
68 /* If the currently focused container is a floating container, we
69 * attach the new container to the workspace */
70 if (con->type == CT_FLOATING_CON)
72 DLOG("con = %p\n", con);
77 /* 3. create the container and attach it to its parent */
78 Con *new = con_new(con);
80 /* 4: re-calculate child->percent for each child */
83 /* 5: focus the new container */
90 static bool _is_con_mapped(Con *con) {
93 TAILQ_FOREACH(child, &(con->nodes_head), nodes)
94 if (_is_con_mapped(child))
101 * Closes the given container including all children
104 void tree_close(Con *con, bool kill_window, bool dont_kill_parent) {
105 bool was_mapped = con->mapped;
106 Con *parent = con->parent;
109 /* Even if the container itself is not mapped, its children may be
110 * mapped (for example split containers don't have a mapped window on
111 * their own but usually contain mapped children). */
112 was_mapped = _is_con_mapped(con);
115 /* Get the container which is next focused */
116 Con *next = con_next_focused(con);
117 DLOG("next = %p, focused = %p\n", next, focused);
119 DLOG("closing %p, kill_window = %d\n", con, kill_window);
121 /* We cannot use TAILQ_FOREACH because the children get deleted
122 * in their parent’s nodes_head */
123 while (!TAILQ_EMPTY(&(con->nodes_head))) {
124 child = TAILQ_FIRST(&(con->nodes_head));
125 DLOG("killing child=%p\n", child);
126 tree_close(child, kill_window, true);
129 if (con->window != NULL) {
131 x_window_kill(con->window->id);
133 /* un-parent the window */
134 xcb_reparent_window(conn, con->window->id, root, 0, 0);
135 /* TODO: client_unmap to set state to withdrawn */
138 FREE(con->window->class_class);
139 FREE(con->window->class_instance);
140 FREE(con->window->name_x);
141 FREE(con->window->name_json);
145 /* kill the X11 part of this container */
149 if (con->type != CT_FLOATING_CON) {
150 /* If the container is *not* floating, we might need to re-distribute
151 * percentage values for the resized containers. */
152 con_fix_percent(parent);
155 if (con_is_floating(con)) {
156 Con *ws = con_get_workspace(con);
157 DLOG("Container was floating, killing floating container\n");
158 tree_close(parent, false, false);
159 DLOG("parent container killed\n");
160 if (con == focused) {
161 DLOG("This is the focused container, i need to find another one to focus. I start looking at ws = %p\n", ws);
162 /* go down the focus stack as far as possible */
163 next = con_descend_focused(ws);
165 dont_kill_parent = true;
166 DLOG("Alright, focusing %p\n", next);
173 TAILQ_REMOVE(&all_cons, con, all_cons);
176 /* in the case of floating windows, we already focused another container
177 * when closing the parent, so we can exit now. */
179 DLOG("No next container, i will just exit now\n");
183 if (was_mapped || con == focused) {
184 if (kill_window || !dont_kill_parent || con == focused) {
185 DLOG("focusing %p / %s\n", next, next->name);
186 /* TODO: check if the container (or one of its children) was focused */
187 if (next->type == CT_DOCKAREA) {
188 /* Instead of focusing the dockarea, we need to restore focus to the workspace */
189 con_focus(con_descend_focused(output_get_content(next->parent)));
195 DLOG("not focusing because we're not killing anybody");
198 DLOG("not focusing, was not mapped\n");
201 /* check if the parent container is empty now and close it */
202 if (!dont_kill_parent)
203 CALL(parent, on_remove_child);
207 * Closes the current container using tree_close().
210 void tree_close_con() {
211 assert(focused != NULL);
212 if (focused->type == CT_WORKSPACE) {
213 LOG("Cannot close workspace\n");
217 /* There *should* be no possibility to focus outputs / root container */
218 assert(focused->type != CT_OUTPUT);
219 assert(focused->type != CT_ROOT);
222 tree_close(focused, true, false);
226 * Splits (horizontally or vertically) the given container by creating a new
227 * container which contains the old one and the future ones.
230 void tree_split(Con *con, orientation_t orientation) {
231 /* for a workspace, we just need to change orientation */
232 if (con->type == CT_WORKSPACE) {
233 DLOG("Workspace, simply changing orientation to %d\n", orientation);
234 con->orientation = orientation;
238 Con *parent = con->parent;
239 /* if we are in a container whose parent contains only one
240 * child (its split functionality is unused so far), we just change the
241 * orientation (more intuitive than splitting again) */
242 if (con_num_children(parent) == 1) {
243 parent->orientation = orientation;
244 DLOG("Just changing orientation of existing container\n");
248 DLOG("Splitting in orientation %d\n", orientation);
250 /* 2: replace it with a new Con */
251 Con *new = con_new(NULL);
252 TAILQ_REPLACE(&(parent->nodes_head), con, new, nodes);
253 TAILQ_REPLACE(&(parent->focus_head), con, new, focused);
254 new->parent = parent;
255 new->orientation = orientation;
257 /* 3: swap 'percent' (resize factor) */
258 new->percent = con->percent;
261 /* 4: add it as a child to the new Con */
262 con_attach(con, new, false);
266 * Moves focus one level up.
270 /* We can focus up to the workspace, but not any higher in the tree */
271 if ((focused->parent->type != CT_CON &&
272 focused->parent->type != CT_WORKSPACE) ||
273 focused->type == CT_WORKSPACE) {
274 printf("cannot go up\n");
277 con_focus(focused->parent);
281 * Moves focus one level down.
285 /* Go down the focus stack of the current node */
286 Con *next = TAILQ_FIRST(&(focused->focus_head));
287 if (next == TAILQ_END(&(focused->focus_head))) {
288 printf("cannot go down\n");
294 static void mark_unmapped(Con *con) {
298 TAILQ_FOREACH(current, &(con->nodes_head), nodes)
299 mark_unmapped(current);
300 if (con->type == CT_WORKSPACE) {
301 /* We need to call mark_unmapped on floating nodes aswell since we can
302 * make containers floating. */
303 TAILQ_FOREACH(current, &(con->floating_head), floating_windows)
304 mark_unmapped(current);
309 * Renders the tree, that is rendering all outputs using render_con() and
310 * pushing the changes to X11 using x_push_changes().
317 DLOG("-- BEGIN RENDERING --\n");
318 /* Reset map state for all nodes in tree */
319 /* TODO: a nicer method to walk all nodes would be good, maybe? */
320 mark_unmapped(croot);
321 croot->mapped = true;
323 /* We start rendering at an output */
325 TAILQ_FOREACH(output, &(croot->nodes_head), nodes) {
326 DLOG("output %p / %s\n", output, output->name);
327 render_con(output, false);
329 x_push_changes(croot);
330 DLOG("-- END RENDERING --\n");
334 * Changes focus in the given way (next/previous) and given orientation
335 * (horizontal/vertical).
338 void tree_next(char way, orientation_t orientation) {
339 /* 1: get the first parent with the same orientation */
340 Con *parent = focused->parent;
341 while (focused->type != CT_WORKSPACE &&
342 (con_orientation(parent) != orientation ||
343 con_num_children(parent) == 1)) {
344 LOG("need to go one level further up\n");
345 /* if the current parent is an output, we are at a workspace
346 * and the orientation still does not match */
347 if (parent->type == CT_WORKSPACE)
349 parent = parent->parent;
351 Con *current = TAILQ_FIRST(&(parent->focus_head));
352 assert(current != TAILQ_END(&(parent->focus_head)));
354 if (TAILQ_EMPTY(&(parent->nodes_head))) {
355 DLOG("Nothing to focus here, move along...\n");
359 /* 2: chose next (or previous) */
362 next = TAILQ_NEXT(current, nodes);
363 /* if we are at the end of the list, we need to wrap */
364 if (next == TAILQ_END(&(parent->nodes_head)))
365 next = TAILQ_FIRST(&(parent->nodes_head));
367 next = TAILQ_PREV(current, nodes_head, nodes);
368 /* if we are at the end of the list, we need to wrap */
369 if (next == TAILQ_END(&(parent->nodes_head)))
370 next = TAILQ_LAST(&(parent->nodes_head), nodes_head);
373 /* 3: focus choice comes in here. at the moment we will go down
374 * until we find a window */
375 /* TODO: check for window, atm we only go down as far as possible */
376 con_focus(con_descend_focused(next));
380 * tree_flatten() removes pairs of redundant split containers, e.g.:
381 * [workspace, horizontal]
385 * In this example, the v-split and h-split container are redundant.
386 * Such a situation can be created by moving containers in a direction which is
387 * not the orientation of their parent container. i3 needs to create a new
388 * split container then and if you move containers this way multiple times,
389 * redundant chains of split-containers can be the result.
392 void tree_flatten(Con *con) {
393 Con *current, *child, *parent = con->parent;
394 DLOG("Checking if I can flatten con = %p / %s\n", con, con->name);
396 /* We only consider normal containers without windows */
397 if (con->type != CT_CON || con->window != NULL)
400 /* Ensure it got only one child */
401 child = TAILQ_FIRST(&(con->nodes_head));
402 if (child == NULL || TAILQ_NEXT(child, nodes) != NULL)
405 /* The child must have a different orientation than the con but the same as
406 * the con’s parent to be redundant */
407 if (con->orientation == NO_ORIENTATION ||
408 child->orientation == NO_ORIENTATION ||
409 con->orientation == child->orientation ||
410 child->orientation != parent->orientation)
413 DLOG("Alright, I have to flatten this situation now. Stay calm.\n");
415 Con *focus_next = TAILQ_FIRST(&(child->focus_head));
417 DLOG("detaching...\n");
418 /* 2: re-attach the children to the parent before con */
419 while (!TAILQ_EMPTY(&(child->nodes_head))) {
420 current = TAILQ_FIRST(&(child->nodes_head));
421 DLOG("detaching current=%p / %s\n", current, current->name);
423 DLOG("re-attaching\n");
424 /* We don’t use con_attach() here because for a CT_CON, the special
425 * case handling of con_attach() does not trigger. So all it would do
426 * is calling TAILQ_INSERT_AFTER, but with the wrong container. So we
427 * directly use the TAILQ macros. */
428 current->parent = parent;
429 TAILQ_INSERT_BEFORE(con, current, nodes);
430 DLOG("attaching to focus list\n");
431 TAILQ_INSERT_TAIL(&(parent->focus_head), current, focused);
432 current->percent = con->percent;
434 DLOG("re-attached all\n");
436 /* 3: restore focus, if con was focused */
437 if (focus_next != NULL &&
438 TAILQ_FIRST(&(parent->focus_head)) == con) {
439 DLOG("restoring focus to focus_next=%p\n", focus_next);
440 TAILQ_REMOVE(&(parent->focus_head), focus_next, focused);
441 TAILQ_INSERT_HEAD(&(parent->focus_head), focus_next, focused);
442 DLOG("restored focus.\n");
445 /* 4: close the redundant cons */
446 DLOG("closing redundant cons\n");
447 tree_close(con, false, true);
449 /* Well, we got to abort the recursion here because we destroyed the
450 * container. However, if tree_flatten() is called sufficiently often,
451 * there can’t be the situation of having two pairs of redundant containers
452 * at once. Therefore, we can safely abort the recursion on this level
453 * after flattening. */
457 /* We cannot use normal foreach here because tree_flatten might close the
458 * current container. */
459 current = TAILQ_FIRST(&(con->nodes_head));
460 while (current != NULL) {
461 Con *next = TAILQ_NEXT(current, nodes);
462 tree_flatten(current);
466 current = TAILQ_FIRST(&(con->floating_head));
467 while (current != NULL) {
468 Con *next = TAILQ_NEXT(current, floating_windows);
469 tree_flatten(current);