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) {
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->type == CT_OUTPUT)
66 /* If the currently focused container is a floating container, we
67 * attach the new container to the workspace */
68 if (con->type == CT_FLOATING_CON)
74 /* 3. create the container and attach it to its parent */
75 Con *new = con_new(con);
77 /* 4: re-calculate child->percent for each child */
78 con_fix_percent(con, WINDOW_ADD);
80 /* 5: focus the new container */
86 static bool _is_con_mapped(Con *con) {
89 TAILQ_FOREACH(child, &(con->nodes_head), nodes)
90 if (_is_con_mapped(child))
97 * Closes the given container including all children
100 void tree_close(Con *con, bool kill_window, bool dont_kill_parent) {
101 bool was_mapped = con->mapped;
102 Con *parent = con->parent;
105 /* Even if the container itself is not mapped, its children may be
106 * mapped (for example split containers don't have a mapped window on
107 * their own but usually contain mapped children). */
108 was_mapped = _is_con_mapped(con);
111 /* Get the container which is next focused */
112 Con *next = con_next_focused(con);
113 DLOG("next = %p, focused = %p\n", next, focused);
115 DLOG("closing %p, kill_window = %d\n", con, kill_window);
117 /* We cannot use TAILQ_FOREACH because the children get deleted
118 * in their parent’s nodes_head */
119 while (!TAILQ_EMPTY(&(con->nodes_head))) {
120 child = TAILQ_FIRST(&(con->nodes_head));
121 DLOG("killing child=%p\n", child);
122 tree_close(child, kill_window, true);
125 if (con->window != NULL) {
127 x_window_kill(con->window->id);
129 /* un-parent the window */
130 xcb_reparent_window(conn, con->window->id, root, 0, 0);
131 /* TODO: client_unmap to set state to withdrawn */
134 FREE(con->window->class_class);
135 FREE(con->window->class_instance);
136 FREE(con->window->name_x);
137 FREE(con->window->name_json);
141 /* kill the X11 part of this container */
145 if (con->type != CT_FLOATING_CON) {
146 /* If the container is *not* floating, we might need to re-distribute
147 * percentage values for the resized containers. */
148 con_fix_percent(parent, WINDOW_REMOVE);
151 if (con_is_floating(con)) {
152 Con *ws = con_get_workspace(con);
153 DLOG("Container was floating, killing floating container\n");
154 tree_close(parent, false, false);
155 DLOG("parent container killed\n");
156 if (con == focused) {
157 DLOG("This is the focused container, i need to find another one to focus. I start looking at ws = %p\n", ws);
159 /* now go down the focus stack as far as
160 * possible, excluding the current container */
161 while (!TAILQ_EMPTY(&(next->focus_head)))
162 next = TAILQ_FIRST(&(next->focus_head));
164 dont_kill_parent = true;
165 DLOG("Alright, focusing %p\n", next);
172 TAILQ_REMOVE(&all_cons, con, all_cons);
175 /* in the case of floating windows, we already focused another container
176 * when closing the parent, so we can exit now. */
178 DLOG("No next container, i will just exit now\n");
182 if (was_mapped || con == focused) {
183 DLOG("focusing %p / %s\n", next, next->name);
184 /* TODO: check if the container (or one of its children) was focused */
187 DLOG("not focusing, was not mapped\n");
190 /* check if the parent container is empty now and close it */
191 if (!dont_kill_parent &&
192 parent->type != CT_WORKSPACE &&
193 TAILQ_EMPTY(&(parent->nodes_head))) {
194 DLOG("Closing empty parent container\n");
195 /* TODO: check if this container would swallow any other client and
196 * don’t close it automatically. */
197 tree_close(parent, false, false);
202 * Closes the current container using tree_close().
205 void tree_close_con() {
206 assert(focused != NULL);
207 if (focused->type == CT_WORKSPACE) {
208 LOG("Cannot close workspace\n");
212 /* There *should* be no possibility to focus outputs / root container */
213 assert(focused->type != CT_OUTPUT);
214 assert(focused->type != CT_ROOT);
217 tree_close(focused, true, false);
221 * Splits (horizontally or vertically) the given container by creating a new
222 * container which contains the old one and the future ones.
225 void tree_split(Con *con, orientation_t orientation) {
226 /* for a workspace, we just need to change orientation */
227 if (con->type == CT_WORKSPACE) {
228 DLOG("Workspace, simply changing orientation to %d\n", orientation);
229 con->orientation = orientation;
233 Con *parent = con->parent;
234 /* if we are in a container whose parent contains only one
235 * child (its split functionality is unused so far), we just change the
236 * orientation (more intuitive than splitting again) */
237 if (con_num_children(parent) == 1) {
238 parent->orientation = orientation;
239 DLOG("Just changing orientation of existing container\n");
243 DLOG("Splitting in orientation %d\n", orientation);
245 /* 2: replace it with a new Con */
246 Con *new = con_new(NULL);
247 TAILQ_REPLACE(&(parent->nodes_head), con, new, nodes);
248 TAILQ_REPLACE(&(parent->focus_head), con, new, focused);
249 new->parent = parent;
250 new->orientation = orientation;
252 /* 3: swap 'percent' (resize factor) */
253 new->percent = con->percent;
256 /* 4: add it as a child to the new Con */
257 con_attach(con, new, false);
261 * Moves focus one level up.
265 /* We can focus up to the workspace, but not any higher in the tree */
266 if (focused->parent->type != CT_CON &&
267 focused->parent->type != CT_WORKSPACE) {
268 printf("cannot go up\n");
271 con_focus(focused->parent);
275 * Moves focus one level down.
279 /* Go down the focus stack of the current node */
280 Con *next = TAILQ_FIRST(&(focused->focus_head));
281 if (next == TAILQ_END(&(focused->focus_head))) {
282 printf("cannot go down\n");
288 static void mark_unmapped(Con *con) {
292 TAILQ_FOREACH(current, &(con->nodes_head), nodes)
293 mark_unmapped(current);
294 if (con->type == CT_WORKSPACE) {
295 /* We need to call mark_unmapped on floating nodes aswell since we can
296 * make containers floating. */
297 TAILQ_FOREACH(current, &(con->floating_head), floating_windows)
298 mark_unmapped(current);
303 * Renders the tree, that is rendering all outputs using render_con() and
304 * pushing the changes to X11 using x_push_changes().
311 DLOG("-- BEGIN RENDERING --\n");
312 /* Reset map state for all nodes in tree */
313 /* TODO: a nicer method to walk all nodes would be good, maybe? */
314 mark_unmapped(croot);
315 croot->mapped = true;
317 /* We start rendering at an output */
319 TAILQ_FOREACH(output, &(croot->nodes_head), nodes) {
320 DLOG("output %p / %s\n", output, output->name);
321 render_con(output, false);
323 x_push_changes(croot);
324 DLOG("-- END RENDERING --\n");
328 * Changes focus in the given way (next/previous) and given orientation
329 * (horizontal/vertical).
332 void tree_next(char way, orientation_t orientation) {
333 /* 1: get the first parent with the same orientation */
334 Con *parent = focused->parent;
335 while (focused->type != CT_WORKSPACE &&
336 con_orientation(parent) != orientation) {
337 LOG("need to go one level further up\n");
338 /* if the current parent is an output, we are at a workspace
339 * and the orientation still does not match */
340 if (parent->type == CT_WORKSPACE)
342 parent = parent->parent;
344 Con *current = TAILQ_FIRST(&(parent->focus_head));
345 assert(current != TAILQ_END(&(parent->focus_head)));
347 /* 2: chose next (or previous) */
350 next = TAILQ_NEXT(current, nodes);
351 /* if we are at the end of the list, we need to wrap */
352 if (next == TAILQ_END(&(parent->nodes_head)))
353 next = TAILQ_FIRST(&(parent->nodes_head));
355 next = TAILQ_PREV(current, nodes_head, nodes);
356 /* if we are at the end of the list, we need to wrap */
357 if (next == TAILQ_END(&(parent->nodes_head)))
358 next = TAILQ_LAST(&(parent->nodes_head), nodes_head);
361 /* 3: focus choice comes in here. at the moment we will go down
362 * until we find a window */
363 /* TODO: check for window, atm we only go down as far as possible */
364 while (!TAILQ_EMPTY(&(next->focus_head)))
365 next = TAILQ_FIRST(&(next->focus_head));
367 DLOG("focusing %p\n", next);
372 * Moves the current container in the given way (next/previous) and given
373 * orientation (horizontal/vertical).
376 void tree_move(char way, orientation_t orientation) {
377 /* 1: get the first parent with the same orientation */
378 Con *parent = focused->parent;
379 Con *old_parent = parent;
380 if (focused->type == CT_WORKSPACE)
382 bool level_changed = false;
383 while (con_orientation(parent) != orientation) {
384 DLOG("need to go one level further up\n");
385 /* If the current parent is an output, we are at a workspace
386 * and the orientation still does not match. In this case, we split the
387 * workspace to have the same look & feel as in older i3 releases. */
388 if (parent->type == CT_WORKSPACE) {
389 DLOG("Arrived at workspace, splitting...\n");
390 /* 1: create a new split container */
391 Con *new = con_new(NULL);
392 new->parent = parent;
394 /* 2: copy layout and orientation from workspace */
395 new->layout = parent->layout;
396 new->orientation = parent->orientation;
398 Con *old_focused = TAILQ_FIRST(&(parent->focus_head));
399 if (old_focused == TAILQ_END(&(parent->focus_head)))
402 /* 3: move the existing cons of this workspace below the new con */
403 DLOG("Moving cons\n");
405 while (!TAILQ_EMPTY(&(parent->nodes_head))) {
406 child = TAILQ_FIRST(&(parent->nodes_head));
408 con_attach(child, new, true);
411 /* 4: switch workspace orientation */
412 parent->orientation = orientation;
414 /* 4: attach the new split container to the workspace */
415 DLOG("Attaching new split to ws\n");
416 con_attach(new, parent, false);
419 con_focus(old_focused);
421 level_changed = true;
425 parent = parent->parent;
426 level_changed = true;
428 Con *current = TAILQ_FIRST(&(parent->focus_head));
429 assert(current != TAILQ_END(&(parent->focus_head)));
431 /* 2: chose next (or previous) */
434 LOG("i would insert it after %p / %s\n", next, next->name);
436 /* Have a look at the next container: If there is no next container or
437 * if it is a leaf node, we move the focused one left to it. However,
438 * for split containers, we descend into it. */
439 next = TAILQ_NEXT(next, nodes);
440 if (next == TAILQ_END(&(next->parent->nodes_head))) {
441 if (focused == current)
445 if (level_changed && con_is_leaf(next)) {
448 /* if this is a split container, we need to go down */
449 while (!TAILQ_EMPTY(&(next->focus_head)))
450 next = TAILQ_FIRST(&(next->focus_head));
455 focused->parent = next->parent;
457 TAILQ_INSERT_AFTER(&(next->parent->nodes_head), next, focused, nodes);
458 TAILQ_INSERT_HEAD(&(next->parent->focus_head), focused, focused);
459 /* TODO: don’t influence focus handling? */
461 LOG("i would insert it before %p / %s\n", current, current->name);
462 bool gone_down = false;
463 next = TAILQ_PREV(next, nodes_head, nodes);
464 if (next == TAILQ_END(&(next->parent->nodes_head))) {
465 if (focused == current)
469 if (level_changed && con_is_leaf(next)) {
472 /* if this is a split container, we need to go down */
473 while (!TAILQ_EMPTY(&(next->focus_head))) {
475 next = TAILQ_FIRST(&(next->focus_head));
481 focused->parent = next->parent;
483 /* After going down in the tree, we insert the container *after*
484 * the currently focused one even though the command used "before".
485 * This is to keep the user experience clear, since the before/after
486 * only signifies the direction of the movement on top-level */
488 TAILQ_INSERT_AFTER(&(next->parent->nodes_head), next, focused, nodes);
489 else TAILQ_INSERT_BEFORE(next, focused, nodes);
490 TAILQ_INSERT_HEAD(&(next->parent->focus_head), focused, focused);
491 /* TODO: don’t influence focus handling? */
494 /* We need to call con_focus() to fix the focus stack "above" the container
495 * we just inserted the focused container into (otherwise, the parent
496 * container(s) would still point to the old container(s)). */
499 if (con_num_children(old_parent) == 0) {
500 DLOG("Old container empty after moving. Let's close it\n");
501 tree_close(old_parent, false, false);
508 * tree_flatten() removes pairs of redundant split containers, e.g.:
509 * [workspace, horizontal]
513 * In this example, the v-split and h-split container are redundant.
514 * Such a situation can be created by moving containers in a direction which is
515 * not the orientation of their parent container. i3 needs to create a new
516 * split container then and if you move containers this way multiple times,
517 * redundant chains of split-containers can be the result.
520 void tree_flatten(Con *con) {
521 Con *current, *child, *parent = con->parent;
522 DLOG("Checking if I can flatten con = %p / %s\n", con, con->name);
524 /* We only consider normal containers without windows */
525 if (con->type != CT_CON || con->window != NULL)
528 /* Ensure it got only one child */
529 child = TAILQ_FIRST(&(con->nodes_head));
530 if (child == NULL || TAILQ_NEXT(child, nodes) != NULL)
533 /* The child must have a different orientation than the con but the same as
534 * the con’s parent to be redundant */
535 if (con->orientation == NO_ORIENTATION ||
536 child->orientation == NO_ORIENTATION ||
537 con->orientation == child->orientation ||
538 child->orientation != parent->orientation)
541 DLOG("Alright, I have to flatten this situation now. Stay calm.\n");
543 Con *focus_next = TAILQ_FIRST(&(child->focus_head));
545 DLOG("detaching...\n");
546 /* 2: re-attach the children to the parent before con */
547 while (!TAILQ_EMPTY(&(child->nodes_head))) {
548 current = TAILQ_FIRST(&(child->nodes_head));
549 DLOG("detaching current=%p / %s\n", current, current->name);
551 DLOG("re-attaching\n");
552 /* We don’t use con_attach() here because for a CT_CON, the special
553 * case handling of con_attach() does not trigger. So all it would do
554 * is calling TAILQ_INSERT_AFTER, but with the wrong container. So we
555 * directly use the TAILQ macros. */
556 current->parent = parent;
557 TAILQ_INSERT_BEFORE(con, current, nodes);
558 DLOG("attaching to focus list\n");
559 TAILQ_INSERT_TAIL(&(parent->focus_head), current, focused);
561 DLOG("re-attached all\n");
563 /* 3: restore focus, if con was focused */
564 if (focus_next != NULL &&
565 TAILQ_FIRST(&(parent->focus_head)) == con) {
566 DLOG("restoring focus to focus_next=%p\n", focus_next);
567 TAILQ_REMOVE(&(parent->focus_head), focus_next, focused);
568 TAILQ_INSERT_HEAD(&(parent->focus_head), focus_next, focused);
569 DLOG("restored focus.\n");
572 /* 4: close the redundant cons */
573 DLOG("closing redundant cons\n");
574 tree_close(con, false, true);
576 /* Well, we got to abort the recursion here because we destroyed the
577 * container. However, if tree_flatten() is called sufficiently often,
578 * there can’t be the situation of having two pairs of redundant containers
579 * at once. Therefore, we can safely abort the recursion on this level
580 * after flattening. */
584 /* We cannot use normal foreach here because tree_flatten might close the
585 * current container. */
586 current = TAILQ_FIRST(&(con->nodes_head));
587 while (current != NULL) {
588 Con *next = TAILQ_NEXT(current, nodes);
589 tree_flatten(current);
593 current = TAILQ_FIRST(&(con->floating_head));
594 while (current != NULL) {
595 Con *next = TAILQ_NEXT(current, floating_windows);
596 tree_flatten(current);