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).
17 char *globbed = glob_path("~/.i3/_restart.json");
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);
30 char *old_restart = glob_path("~/.i3/_restart.json.old");
32 rename(globbed, old_restart);
36 printf("appended tree, using new root\n");
37 croot = TAILQ_FIRST(&(croot->nodes_head));
38 printf("new root = %p\n", croot);
39 Con *out = TAILQ_FIRST(&(croot->nodes_head));
40 printf("out = %p\n", out);
41 Con *ws = TAILQ_FIRST(&(out->nodes_head));
42 printf("ws = %p\n", ws);
49 * Initializes the tree by creating the root node, adding all RandR outputs
50 * to the tree (that means randr_init() has to be called before) and
51 * assigning a workspace to each RandR output.
57 croot = con_new(NULL);
59 croot->type = CT_ROOT;
64 TAILQ_FOREACH(output, &outputs, outputs) {
68 Con *oc = con_new(croot);
69 oc->name = strdup(output->name);
71 oc->rect = output->rect;
73 /* add a workspace to this output */
75 ws->type = CT_WORKSPACE;
76 asprintf(&(ws->name), "%d", c);
78 ws->fullscreen_mode = CF_OUTPUT;
79 ws->orientation = HORIZ;
86 * Opens an empty container in the current container
89 Con *tree_open_con(Con *con) {
91 /* every focusable Con has a parent (outputs have parent root) */
92 con = focused->parent;
93 /* If the parent is an output, we are on a workspace. In this case,
94 * the new container needs to be opened as a leaf of the workspace. */
95 if (con->type == CT_OUTPUT)
101 /* 3: re-calculate child->percent for each child */
102 con_fix_percent(con, WINDOW_ADD);
104 /* 4: add a new container leaf to this con */
105 Con *new = con_new(con);
112 * vanishing is the container that is about to be closed (so any floating
113 * client which has old_parent == vanishing needs to be "re-parented").
116 static void fix_floating_parent(Con *con, Con *vanishing) {
119 if (con->old_parent == vanishing) {
120 LOG("Fixing vanishing old_parent (%p) of container %p to be %p\n",
121 vanishing, con, vanishing->parent);
122 con->old_parent = vanishing->parent;
125 TAILQ_FOREACH(child, &(con->floating_head), floating_windows)
126 fix_floating_parent(child, vanishing);
128 TAILQ_FOREACH(child, &(con->nodes_head), nodes)
129 fix_floating_parent(child, vanishing);
133 * Closes the given container including all children
136 void tree_close(Con *con, bool kill_window) {
137 Con *parent = con->parent;
139 /* check floating clients and adjust old_parent if necessary */
140 fix_floating_parent(croot, con);
142 /* Get the container which is next focused */
143 Con *next = con_next_focused(con);
145 DLOG("closing %p, kill_window = %d\n", con, kill_window);
147 /* We cannot use TAILQ_FOREACH because the children get deleted
148 * in their parent’s nodes_head */
149 while (!TAILQ_EMPTY(&(con->nodes_head))) {
150 child = TAILQ_FIRST(&(con->nodes_head));
151 tree_close(child, kill_window);
154 if (con->window != NULL) {
156 x_window_kill(con->window->id);
158 /* un-parent the window */
159 xcb_reparent_window(conn, con->window->id, root, 0, 0);
160 /* TODO: client_unmap to set state to withdrawn */
166 /* kill the X11 part of this container */
170 con_fix_percent(parent, WINDOW_REMOVE);
172 if (con_is_floating(con)) {
173 DLOG("Container was floating, killing floating container\n");
175 TAILQ_REMOVE(&(parent->parent->floating_head), parent, floating_windows);
176 TAILQ_REMOVE(&(parent->parent->focus_head), parent, focused);
177 tree_close(parent, false);
182 TAILQ_REMOVE(&all_cons, con, all_cons);
185 /* in the case of floating windows, we already focused another container
186 * when closing the parent, so we can exit now. */
190 DLOG("focusing %p / %s\n", next, next->name);
191 /* TODO: check if the container (or one of its children) was focused */
194 /* check if the parent container is empty now and close it */
195 if (parent->type != CT_WORKSPACE &&
196 TAILQ_EMPTY(&(parent->nodes_head))) {
197 DLOG("Closing empty parent container\n");
198 /* TODO: check if this container would swallow any other client and
199 * don’t close it automatically. */
200 tree_close(parent, false);
205 * Closes the current container using tree_close().
208 void tree_close_con() {
209 assert(focused != NULL);
210 if (focused->type == CT_WORKSPACE) {
211 LOG("Cannot close workspace\n");
216 tree_close(focused, true);
220 * Splits (horizontally or vertically) the given container by creating a new
221 * container which contains the old one and the future ones.
224 void tree_split(Con *con, orientation_t orientation) {
225 /* for a workspace, we just need to change orientation */
226 if (con->type == CT_WORKSPACE) {
227 DLOG("Workspace, simply changing orientation to %d\n", orientation);
228 con->orientation = orientation;
232 Con *parent = con->parent;
233 /* if we are in a container whose parent contains only one
234 * child and has the same orientation like we are trying to
235 * set, this operation is a no-op to not confuse the user */
236 if (parent->orientation == orientation &&
237 TAILQ_NEXT(con, nodes) == TAILQ_END(&(parent->nodes_head))) {
238 DLOG("Not splitting the same way again\n");
242 DLOG("Splitting in orientation %d\n", orientation);
244 /* 2: replace it with a new Con */
245 Con *new = con_new(NULL);
246 TAILQ_REPLACE(&(parent->nodes_head), con, new, nodes);
247 TAILQ_REPLACE(&(parent->focus_head), con, new, focused);
248 new->parent = parent;
249 new->orientation = orientation;
251 /* 3: add it as a child to the new Con */
252 con_attach(con, new);
256 * Moves focus one level up.
260 /* We can focus up to the workspace, but not any higher in the tree */
261 if (focused->parent->type != CT_CON &&
262 focused->parent->type != CT_WORKSPACE) {
263 printf("cannot go up\n");
266 con_focus(focused->parent);
270 * Moves focus one level down.
274 /* Go down the focus stack of the current node */
275 Con *next = TAILQ_FIRST(&(focused->focus_head));
276 if (next == TAILQ_END(&(focused->focus_head))) {
277 printf("cannot go down\n");
283 static void mark_unmapped(Con *con) {
287 TAILQ_FOREACH(current, &(con->nodes_head), nodes)
288 mark_unmapped(current);
292 * Renders the tree, that is rendering all outputs using render_con() and
293 * pushing the changes to X11 using x_push_changes().
300 printf("-- BEGIN RENDERING --\n");
301 /* Reset map state for all nodes in tree */
302 /* TODO: a nicer method to walk all nodes would be good, maybe? */
303 mark_unmapped(croot);
304 croot->mapped = true;
306 /* We start rendering at an output */
308 TAILQ_FOREACH(output, &(croot->nodes_head), nodes) {
309 printf("output %p / %s\n", output, output->name);
312 x_push_changes(croot);
313 printf("-- END RENDERING --\n");
317 * Changes focus in the given way (next/previous) and given orientation
318 * (horizontal/vertical).
321 void tree_next(char way, orientation_t orientation) {
322 /* 1: get the first parent with the same orientation */
323 Con *parent = focused->parent;
324 while (focused->type != CT_WORKSPACE &&
325 con_orientation(parent) != orientation) {
326 LOG("need to go one level further up\n");
327 /* if the current parent is an output, we are at a workspace
328 * and the orientation still does not match */
329 if (parent->type == CT_WORKSPACE)
331 parent = parent->parent;
333 Con *current = TAILQ_FIRST(&(parent->focus_head));
334 assert(current != TAILQ_END(&(parent->focus_head)));
336 /* 2: chose next (or previous) */
339 next = TAILQ_NEXT(current, nodes);
340 /* if we are at the end of the list, we need to wrap */
341 if (next == TAILQ_END(&(parent->nodes_head)))
342 next = TAILQ_FIRST(&(parent->nodes_head));
344 next = TAILQ_PREV(current, nodes_head, nodes);
345 /* if we are at the end of the list, we need to wrap */
346 if (next == TAILQ_END(&(parent->nodes_head)))
347 next = TAILQ_LAST(&(parent->nodes_head), nodes_head);
350 /* 3: focus choice comes in here. at the moment we will go down
351 * until we find a window */
352 /* TODO: check for window, atm we only go down as far as possible */
353 while (!TAILQ_EMPTY(&(next->focus_head)))
354 next = TAILQ_FIRST(&(next->focus_head));
360 * Moves the current container in the given way (next/previous) and given
361 * orientation (horizontal/vertical).
364 void tree_move(char way, orientation_t orientation) {
365 /* 1: get the first parent with the same orientation */
366 Con *parent = focused->parent;
367 Con *old_parent = parent;
368 if (focused->type == CT_WORKSPACE)
370 bool level_changed = false;
371 while (con_orientation(parent) != orientation) {
372 LOG("need to go one level further up\n");
373 /* if the current parent is an output, we are at a workspace
374 * and the orientation still does not match */
375 if (parent->type == CT_WORKSPACE)
377 parent = parent->parent;
378 level_changed = true;
380 Con *current = TAILQ_FIRST(&(parent->focus_head));
381 assert(current != TAILQ_END(&(parent->focus_head)));
383 /* 2: chose next (or previous) */
386 LOG("i would insert it after %p / %s\n", next, next->name);
387 if (!level_changed) {
388 next = TAILQ_NEXT(next, nodes);
389 if (next == TAILQ_END(&(next->parent->nodes_head))) {
390 LOG("cannot move further to the right\n");
394 /* if this is a split container, we need to go down */
395 while (!TAILQ_EMPTY(&(next->focus_head)))
396 next = TAILQ_FIRST(&(next->focus_head));
400 focused->parent = next->parent;
402 TAILQ_INSERT_AFTER(&(next->parent->nodes_head), next, focused, nodes);
403 TAILQ_INSERT_HEAD(&(next->parent->focus_head), focused, focused);
404 /* TODO: don’t influence focus handling? */
406 LOG("i would insert it before %p / %s\n", current, current->name);
407 bool gone_down = false;
408 if (!level_changed) {
409 next = TAILQ_PREV(next, nodes_head, nodes);
410 if (next == TAILQ_END(&(next->parent->nodes_head))) {
411 LOG("cannot move further\n");
415 /* if this is a split container, we need to go down */
416 while (!TAILQ_EMPTY(&(next->focus_head))) {
418 next = TAILQ_FIRST(&(next->focus_head));
423 focused->parent = next->parent;
425 /* After going down in the tree, we insert the container *after*
426 * the currently focused one even though the command used "before".
427 * This is to keep the user experience clear, since the before/after
428 * only signifies the direction of the movement on top-level */
430 TAILQ_INSERT_AFTER(&(next->parent->nodes_head), next, focused, nodes);
431 else TAILQ_INSERT_BEFORE(next, focused, nodes);
432 TAILQ_INSERT_HEAD(&(next->parent->focus_head), focused, focused);
433 /* TODO: don’t influence focus handling? */
436 if (con_num_children(old_parent) == 0) {
437 DLOG("Old container empty after moving. Let's close it\n");
438 tree_close(old_parent, false);