i3
tree.c
Go to the documentation of this file.
1 #undef I3__FILE__
2 #define I3__FILE__ "tree.c"
3 /*
4  * vim:ts=4:sw=4:expandtab
5  *
6  * i3 - an improved dynamic tiling window manager
7  * © 2009-2011 Michael Stapelberg and contributors (see also: LICENSE)
8  *
9  * tree.c: Everything that primarily modifies the layout tree data structure.
10  *
11  */
12 #include "all.h"
13 
14 struct Con *croot;
15 struct Con *focused;
16 
17 struct all_cons_head all_cons = TAILQ_HEAD_INITIALIZER(all_cons);
18 
19 /*
20  * Create the pseudo-output __i3. Output-independent workspaces such as
21  * __i3_scratch will live there.
22  *
23  */
24 static Con *_create___i3(void) {
25  Con *__i3 = con_new(croot, NULL);
26  FREE(__i3->name);
27  __i3->name = sstrdup("__i3");
28  __i3->type = CT_OUTPUT;
29  __i3->layout = L_OUTPUT;
30  con_fix_percent(croot);
31  x_set_name(__i3, "[i3 con] pseudo-output __i3");
32  /* For retaining the correct position/size of a scratchpad window, the
33  * dimensions of the real outputs should be multiples of the __i3
34  * pseudo-output. Ensuring that is the job of scratchpad_fix_resolution()
35  * which gets called after this function and after detecting all the
36  * outputs (or whenever an output changes). */
37  __i3->rect.width = 1280;
38  __i3->rect.height = 1024;
39 
40  /* Add a content container. */
41  DLOG("adding main content container\n");
42  Con *content = con_new(NULL, NULL);
43  content->type = CT_CON;
44  FREE(content->name);
45  content->name = sstrdup("content");
46  content->layout = L_SPLITH;
47 
48  x_set_name(content, "[i3 con] content __i3");
49  con_attach(content, __i3, false);
50 
51  /* Attach the __i3_scratch workspace. */
52  Con *ws = con_new(NULL, NULL);
53  ws->type = CT_WORKSPACE;
54  ws->num = -1;
55  ws->name = sstrdup("__i3_scratch");
56  ws->layout = L_SPLITH;
57  con_attach(ws, content, false);
58  x_set_name(ws, "[i3 con] workspace __i3_scratch");
59  ws->fullscreen_mode = CF_OUTPUT;
60 
61  return __i3;
62 }
63 
64 /*
65  * Loads tree from 'path' (used for in-place restarts).
66  *
67  */
68 bool tree_restore(const char *path, xcb_get_geometry_reply_t *geometry) {
69  char *globbed = resolve_tilde(path);
70 
71  if (!path_exists(globbed)) {
72  LOG("%s does not exist, not restoring tree\n", globbed);
73  free(globbed);
74  return false;
75  }
76 
77  /* TODO: refactor the following */
78  croot = con_new(NULL, NULL);
79  croot->rect = (Rect){
80  geometry->x,
81  geometry->y,
82  geometry->width,
83  geometry->height
84  };
85  focused = croot;
86 
87  tree_append_json(globbed);
88 
89  printf("appended tree, using new root\n");
90  croot = TAILQ_FIRST(&(croot->nodes_head));
91  printf("new root = %p\n", croot);
92  Con *out = TAILQ_FIRST(&(croot->nodes_head));
93  printf("out = %p\n", out);
94  Con *ws = TAILQ_FIRST(&(out->nodes_head));
95  printf("ws = %p\n", ws);
96 
97  /* For in-place restarting into v4.2, we need to make sure the new
98  * pseudo-output __i3 is present. */
99  if (strcmp(out->name, "__i3") != 0) {
100  DLOG("Adding pseudo-output __i3 during inplace restart\n");
101  Con *__i3 = _create___i3();
102  /* Ensure that it is the first output, other places in the code make
103  * that assumption. */
104  TAILQ_REMOVE(&(croot->nodes_head), __i3, nodes);
105  TAILQ_INSERT_HEAD(&(croot->nodes_head), __i3, nodes);
106  }
107 
108  return true;
109 }
110 
111 /*
112  * Initializes the tree by creating the root node. The CT_OUTPUT Cons below the
113  * root node are created in randr.c for each Output.
114  *
115  */
116 void tree_init(xcb_get_geometry_reply_t *geometry) {
117  croot = con_new(NULL, NULL);
118  FREE(croot->name);
119  croot->name = "root";
120  croot->type = CT_ROOT;
121  croot->layout = L_SPLITH;
122  croot->rect = (Rect){
123  geometry->x,
124  geometry->y,
125  geometry->width,
126  geometry->height
127  };
128 
129  _create___i3();
130 }
131 
132 /*
133  * Opens an empty container in the current container
134  *
135  */
136 Con *tree_open_con(Con *con, i3Window *window) {
137  if (con == NULL) {
138  /* every focusable Con has a parent (outputs have parent root) */
139  con = focused->parent;
140  /* If the parent is an output, we are on a workspace. In this case,
141  * the new container needs to be opened as a leaf of the workspace. */
142  if (con->parent->type == CT_OUTPUT && con->type != CT_DOCKAREA) {
143  con = focused;
144  }
145 
146  /* If the currently focused container is a floating container, we
147  * attach the new container to the currently focused spot in its
148  * workspace. */
149  if (con->type == CT_FLOATING_CON) {
151  if (con->type != CT_WORKSPACE)
152  con = con->parent;
153  }
154  DLOG("con = %p\n", con);
155  }
156 
157  assert(con != NULL);
158 
159  /* 3. create the container and attach it to its parent */
160  Con *new = con_new(con, window);
161  new->layout = L_SPLITH;
162 
163  /* 4: re-calculate child->percent for each child */
164  con_fix_percent(con);
165 
166  return new;
167 }
168 
169 static bool _is_con_mapped(Con *con) {
170  Con *child;
171 
172  TAILQ_FOREACH(child, &(con->nodes_head), nodes)
173  if (_is_con_mapped(child))
174  return true;
175 
176  return con->mapped;
177 }
178 
179 /*
180  * Closes the given container including all children.
181  * Returns true if the container was killed or false if just WM_DELETE was sent
182  * and the window is expected to kill itself.
183  *
184  * The dont_kill_parent flag is specified when the function calls itself
185  * recursively while deleting a containers children.
186  *
187  * The force_set_focus flag is specified in the case of killing a floating
188  * window: tree_close() will be invoked for the CT_FLOATINGCON (the parent
189  * container) and focus should be set there.
190  *
191  */
192 bool tree_close(Con *con, kill_window_t kill_window, bool dont_kill_parent, bool force_set_focus) {
193  bool was_mapped = con->mapped;
194  Con *parent = con->parent;
195 
196  if (!was_mapped) {
197  /* Even if the container itself is not mapped, its children may be
198  * mapped (for example split containers don't have a mapped window on
199  * their own but usually contain mapped children). */
200  was_mapped = _is_con_mapped(con);
201  }
202 
203  /* remove the urgency hint of the workspace (if set) */
204  if (con->urgent) {
205  con->urgent = false;
208  }
209 
210  /* Get the container which is next focused */
211  Con *next = con_next_focused(con);
212  DLOG("next = %p, focused = %p\n", next, focused);
213 
214  DLOG("closing %p, kill_window = %d\n", con, kill_window);
215  Con *child, *nextchild;
216  bool abort_kill = false;
217  /* We cannot use TAILQ_FOREACH because the children get deleted
218  * in their parent’s nodes_head */
219  for (child = TAILQ_FIRST(&(con->nodes_head)); child; ) {
220  nextchild = TAILQ_NEXT(child, nodes);
221  DLOG("killing child=%p\n", child);
222  if (!tree_close(child, kill_window, true, false))
223  abort_kill = true;
224  child = nextchild;
225  }
226 
227  if (abort_kill) {
228  DLOG("One of the children could not be killed immediately (WM_DELETE sent), aborting.\n");
229  return false;
230  }
231 
232  if (con->window != NULL) {
233  if (kill_window != DONT_KILL_WINDOW) {
234  x_window_kill(con->window->id, kill_window);
235  return false;
236  } else {
237  xcb_void_cookie_t cookie;
238  /* Ignore any further events by clearing the event mask,
239  * unmap the window,
240  * then reparent it to the root window. */
241  xcb_change_window_attributes(conn, con->window->id,
242  XCB_CW_EVENT_MASK, (uint32_t[]){ XCB_NONE });
243  xcb_unmap_window(conn, con->window->id);
244  cookie = xcb_reparent_window(conn, con->window->id, root, 0, 0);
245 
246  /* Ignore X11 errors for the ReparentWindow request.
247  * X11 Errors are returned when the window was already destroyed */
248  add_ignore_event(cookie.sequence, 0);
249 
250  /* We are no longer handling this window, thus set WM_STATE to
251  * WM_STATE_WITHDRAWN (see ICCCM 4.1.3.1) */
252  long data[] = { XCB_ICCCM_WM_STATE_WITHDRAWN, XCB_NONE };
253  cookie = xcb_change_property(conn, XCB_PROP_MODE_REPLACE,
254  con->window->id, A_WM_STATE, A_WM_STATE, 32, 2, data);
255 
256  /* Ignore X11 errors for the ReparentWindow request.
257  * X11 Errors are returned when the window was already destroyed */
258  add_ignore_event(cookie.sequence, 0);
259  }
260  FREE(con->window->class_class);
261  FREE(con->window->class_instance);
262  i3string_free(con->window->name);
263  free(con->window);
264  }
265 
266  Con *ws = con_get_workspace(con);
267 
268  /* Figure out which container to focus next before detaching 'con'. */
269  if (con_is_floating(con)) {
270  if (con == focused) {
271  DLOG("This is the focused container, i need to find another one to focus. I start looking at ws = %p\n", ws);
272  next = con_next_focused(parent);
273 
274  dont_kill_parent = true;
275  DLOG("Alright, focusing %p\n", next);
276  } else {
277  next = NULL;
278  }
279  }
280 
281  /* Detach the container so that it will not be rendered anymore. */
282  con_detach(con);
283 
284  /* disable urgency timer, if needed */
285  if (con->urgency_timer != NULL) {
286  DLOG("Removing urgency timer of con %p\n", con);
288  ev_timer_stop(main_loop, con->urgency_timer);
289  FREE(con->urgency_timer);
290  }
291 
292  if (con->type != CT_FLOATING_CON) {
293  /* If the container is *not* floating, we might need to re-distribute
294  * percentage values for the resized containers. */
295  con_fix_percent(parent);
296  }
297 
298  /* Render the tree so that the surrounding containers take up the space
299  * which 'con' does no longer occupy. If we don’t render here, there will
300  * be a gap in our containers and that could trigger an EnterNotify for an
301  * underlying container, see ticket #660.
302  *
303  * Rendering has to be avoided when dont_kill_parent is set (when
304  * tree_close calls itself recursively) because the tree is in a
305  * non-renderable state during that time. */
306  if (!dont_kill_parent)
307  tree_render();
308 
309  /* kill the X11 part of this container */
310  x_con_kill(con);
311 
312  if (con_is_floating(con)) {
313  DLOG("Container was floating, killing floating container\n");
314  tree_close(parent, DONT_KILL_WINDOW, false, (con == focused));
315  DLOG("parent container killed\n");
316  }
317 
318  free(con->name);
319  FREE(con->deco_render_params);
321  free(con);
322 
323  /* in the case of floating windows, we already focused another container
324  * when closing the parent, so we can exit now. */
325  if (!next) {
326  DLOG("No next container, i will just exit now\n");
327  return true;
328  }
329 
330  if (was_mapped || con == focused) {
331  if ((kill_window != DONT_KILL_WINDOW) || !dont_kill_parent || con == focused) {
332  DLOG("focusing %p / %s\n", next, next->name);
333  if (next->type == CT_DOCKAREA) {
334  /* Instead of focusing the dockarea, we need to restore focus to the workspace */
336  } else {
337  if (!force_set_focus && con != focused)
338  DLOG("not changing focus, the container was not focused before\n");
339  else con_focus(next);
340  }
341  }
342  else {
343  DLOG("not focusing because we're not killing anybody\n");
344  }
345  } else {
346  DLOG("not focusing, was not mapped\n");
347  }
348 
349  /* check if the parent container is empty now and close it */
350  if (!dont_kill_parent)
351  CALL(parent, on_remove_child);
352 
353  return true;
354 }
355 
356 /*
357  * Closes the current container using tree_close().
358  *
359  */
360 void tree_close_con(kill_window_t kill_window) {
361  assert(focused != NULL);
362  if (focused->type == CT_WORKSPACE) {
363  LOG("Cannot close workspace\n");
364  return;
365  }
366 
367  /* There *should* be no possibility to focus outputs / root container */
368  assert(focused->type != CT_OUTPUT);
369  assert(focused->type != CT_ROOT);
370 
371  /* Kill con */
372  tree_close(focused, kill_window, false, false);
373 }
374 
375 /*
376  * Splits (horizontally or vertically) the given container by creating a new
377  * container which contains the old one and the future ones.
378  *
379  */
380 void tree_split(Con *con, orientation_t orientation) {
381  if (con->type == CT_FLOATING_CON) {
382  DLOG("Floating containers can't be split.\n");
383  return;
384  }
385 
386  if (con->type == CT_WORKSPACE) {
387  if (con_num_children(con) < 2) {
388  DLOG("Just changing orientation of workspace\n");
389  con->layout = (orientation == HORIZ) ? L_SPLITH : L_SPLITV;
390  return;
391  } else {
392  /* if there is more than one container on the workspace
393  * move them into a new container and handle this instead */
394  con = workspace_encapsulate(con);
395  }
396  }
397 
398  Con *parent = con->parent;
399 
400  /* Force re-rendering to make the indicator border visible. */
401  FREE(con->deco_render_params);
402  FREE(parent->deco_render_params);
403 
404  /* if we are in a container whose parent contains only one
405  * child (its split functionality is unused so far), we just change the
406  * orientation (more intuitive than splitting again) */
407  if (con_num_children(parent) == 1 &&
408  (parent->layout == L_SPLITH ||
409  parent->layout == L_SPLITV)) {
410  parent->layout = (orientation == HORIZ) ? L_SPLITH : L_SPLITV;
411  DLOG("Just changing orientation of existing container\n");
412  return;
413  }
414 
415  DLOG("Splitting in orientation %d\n", orientation);
416 
417  /* 2: replace it with a new Con */
418  Con *new = con_new(NULL, NULL);
419  TAILQ_REPLACE(&(parent->nodes_head), con, new, nodes);
420  TAILQ_REPLACE(&(parent->focus_head), con, new, focused);
421  new->parent = parent;
422  new->layout = (orientation == HORIZ) ? L_SPLITH : L_SPLITV;
423 
424  /* 3: swap 'percent' (resize factor) */
425  new->percent = con->percent;
426  con->percent = 0.0;
427 
428  /* 4: add it as a child to the new Con */
429  con_attach(con, new, false);
430 }
431 
432 /*
433  * Moves focus one level up. Returns true if focus changed.
434  *
435  */
436 bool level_up(void) {
437  /* Skip over floating containers and go directly to the grandparent
438  * (which should always be a workspace) */
439  if (focused->parent->type == CT_FLOATING_CON) {
440  con_focus(focused->parent->parent);
441  return true;
442  }
443 
444  /* We can focus up to the workspace, but not any higher in the tree */
445  if ((focused->parent->type != CT_CON &&
446  focused->parent->type != CT_WORKSPACE) ||
447  focused->type == CT_WORKSPACE) {
448  ELOG("'focus parent': Focus is already on the workspace, cannot go higher than that.\n");
449  return false;
450  }
451  con_focus(focused->parent);
452  return true;
453 }
454 
455 /*
456  * Moves focus one level down. Returns true if focus changed.
457  *
458  */
459 bool level_down(void) {
460  /* Go down the focus stack of the current node */
461  Con *next = TAILQ_FIRST(&(focused->focus_head));
462  if (next == TAILQ_END(&(focused->focus_head))) {
463  DLOG("cannot go down\n");
464  return false;
465  }
466  else if (next->type == CT_FLOATING_CON) {
467  /* Floating cons shouldn't be directly focused; try immediately
468  * going to the grandchild of the focused con. */
469  Con *child = TAILQ_FIRST(&(next->focus_head));
470  if (child == TAILQ_END(&(next->focus_head))) {
471  DLOG("cannot go down\n");
472  return false;
473  }
474  else
475  next = TAILQ_FIRST(&(next->focus_head));
476  }
477 
478  con_focus(next);
479  return true;
480 }
481 
482 static void mark_unmapped(Con *con) {
483  Con *current;
484 
485  con->mapped = false;
486  TAILQ_FOREACH(current, &(con->nodes_head), nodes)
487  mark_unmapped(current);
488  if (con->type == CT_WORKSPACE) {
489  /* We need to call mark_unmapped on floating nodes aswell since we can
490  * make containers floating. */
491  TAILQ_FOREACH(current, &(con->floating_head), floating_windows)
492  mark_unmapped(current);
493  }
494 }
495 
496 /*
497  * Renders the tree, that is rendering all outputs using render_con() and
498  * pushing the changes to X11 using x_push_changes().
499  *
500  */
501 void tree_render(void) {
502  if (croot == NULL)
503  return;
504 
505  DLOG("-- BEGIN RENDERING --\n");
506  /* Reset map state for all nodes in tree */
507  /* TODO: a nicer method to walk all nodes would be good, maybe? */
508  mark_unmapped(croot);
509  croot->mapped = true;
510 
511  render_con(croot, false);
512 
513  x_push_changes(croot);
514  DLOG("-- END RENDERING --\n");
515 }
516 
517 /*
518  * Recursive function to walk the tree until a con can be found to focus.
519  *
520  */
521 static bool _tree_next(Con *con, char way, orientation_t orientation, bool wrap) {
522  /* When dealing with fullscreen containers, it's necessary to go up to the
523  * workspace level, because 'focus $dir' will start at the con's real
524  * position in the tree, and it may not be possible to get to the edge
525  * normally due to fullscreen focusing restrictions. */
526  if (con->fullscreen_mode == CF_OUTPUT && con->type != CT_WORKSPACE)
527  con = con_get_workspace(con);
528 
529  /* Stop recursing at workspaces after attempting to switch to next
530  * workspace if possible. */
531  if (con->type == CT_WORKSPACE) {
532  if (con_get_fullscreen_con(con, CF_GLOBAL)) {
533  DLOG("Cannot change workspace while in global fullscreen mode.\n");
534  return false;
535  }
536  Output *current_output = get_output_containing(con->rect.x, con->rect.y);
537  Output *next_output;
538 
539  if (!current_output)
540  return false;
541  DLOG("Current output is %s\n", current_output->name);
542 
543  /* Try to find next output */
544  direction_t direction;
545  if (way == 'n' && orientation == HORIZ)
546  direction = D_RIGHT;
547  else if (way == 'p' && orientation == HORIZ)
548  direction = D_LEFT;
549  else if (way == 'n' && orientation == VERT)
550  direction = D_DOWN;
551  else if (way == 'p' && orientation == VERT)
552  direction = D_UP;
553  else
554  return false;
555 
556  next_output = get_output_next(direction, current_output, CLOSEST_OUTPUT);
557  if (!next_output)
558  return false;
559  DLOG("Next output is %s\n", next_output->name);
560 
561  /* Find visible workspace on next output */
562  Con *workspace = NULL;
563  GREP_FIRST(workspace, output_get_content(next_output->con), workspace_is_visible(child));
564 
565  /* Show next workspace and focus appropriate container if possible. */
566  if (!workspace)
567  return false;
568 
569  workspace_show(workspace);
570 
571  /* If a workspace has an active fullscreen container, one of its
572  * children should always be focused. The above workspace_show()
573  * should be adequate for that, so return. */
574  if (con_get_fullscreen_con(workspace, CF_OUTPUT))
575  return true;
576 
577  Con *focus = con_descend_direction(workspace, direction);
578  if (focus) {
579  con_focus(focus);
580  x_set_warp_to(&(focus->rect));
581  }
582  return true;
583  }
584 
585  Con *parent = con->parent;
586 
587  if (con->type == CT_FLOATING_CON) {
588  /* left/right focuses the previous/next floating container */
589  if (orientation == HORIZ) {
590  Con *next;
591  if (way == 'n')
592  next = TAILQ_NEXT(con, floating_windows);
593  else next = TAILQ_PREV(con, floating_head, floating_windows);
594 
595  /* If there is no next/previous container, wrap */
596  if (!next) {
597  if (way == 'n')
598  next = TAILQ_FIRST(&(parent->floating_head));
599  else next = TAILQ_LAST(&(parent->floating_head), floating_head);
600  }
601 
602  /* Still no next/previous container? bail out */
603  if (!next)
604  return false;
605 
607  return true;
608  } else {
609  /* up/down cycles through the Z-index */
610  /* TODO: implement cycling through the z-index */
611  return false;
612  }
613  }
614 
615  /* If the orientation does not match or there is no other con to focus, we
616  * need to go higher in the hierarchy */
617  if (con_orientation(parent) != orientation ||
618  con_num_children(parent) == 1)
619  return _tree_next(parent, way, orientation, wrap);
620 
621  Con *current = TAILQ_FIRST(&(parent->focus_head));
622  /* TODO: when can the following happen (except for floating windows, which
623  * are handled above)? */
624  if (TAILQ_EMPTY(&(parent->nodes_head))) {
625  DLOG("nothing to focus\n");
626  return false;
627  }
628 
629  Con *next;
630  if (way == 'n')
631  next = TAILQ_NEXT(current, nodes);
632  else next = TAILQ_PREV(current, nodes_head, nodes);
633 
634  if (!next) {
636  /* If there is no next/previous container, we check if we can focus one
637  * when going higher (without wrapping, though). If so, we are done, if
638  * not, we wrap */
639  if (_tree_next(parent, way, orientation, false))
640  return true;
641 
642  if (!wrap)
643  return false;
644  }
645 
646  if (way == 'n')
647  next = TAILQ_FIRST(&(parent->nodes_head));
648  else next = TAILQ_LAST(&(parent->nodes_head), nodes_head);
649  }
650 
651  /* Don't violate fullscreen focus restrictions. */
653  return false;
654 
655  /* 3: focus choice comes in here. at the moment we will go down
656  * until we find a window */
657  /* TODO: check for window, atm we only go down as far as possible */
659  return true;
660 }
661 
662 /*
663  * Changes focus in the given way (next/previous) and given orientation
664  * (horizontal/vertical).
665  *
666  */
667 void tree_next(char way, orientation_t orientation) {
668  _tree_next(focused, way, orientation, true);
669 }
670 
671 /*
672  * tree_flatten() removes pairs of redundant split containers, e.g.:
673  * [workspace, horizontal]
674  * [v-split] [child3]
675  * [h-split]
676  * [child1] [child2]
677  * In this example, the v-split and h-split container are redundant.
678  * Such a situation can be created by moving containers in a direction which is
679  * not the orientation of their parent container. i3 needs to create a new
680  * split container then and if you move containers this way multiple times,
681  * redundant chains of split-containers can be the result.
682  *
683  */
684 void tree_flatten(Con *con) {
685  Con *current, *child, *parent = con->parent;
686  DLOG("Checking if I can flatten con = %p / %s\n", con, con->name);
687 
688  /* We only consider normal containers without windows */
689  if (con->type != CT_CON ||
690  parent->layout == L_OUTPUT || /* con == "content" */
691  con->window != NULL)
692  goto recurse;
693 
694  /* Ensure it got only one child */
695  child = TAILQ_FIRST(&(con->nodes_head));
696  if (child == NULL || TAILQ_NEXT(child, nodes) != NULL)
697  goto recurse;
698 
699  DLOG("child = %p, con = %p, parent = %p\n", child, con, parent);
700 
701  /* The child must have a different orientation than the con but the same as
702  * the con’s parent to be redundant */
703  if (!con_is_split(con) ||
704  !con_is_split(child) ||
705  con_orientation(con) == con_orientation(child) ||
706  con_orientation(child) != con_orientation(parent))
707  goto recurse;
708 
709  DLOG("Alright, I have to flatten this situation now. Stay calm.\n");
710  /* 1: save focus */
711  Con *focus_next = TAILQ_FIRST(&(child->focus_head));
712 
713  DLOG("detaching...\n");
714  /* 2: re-attach the children to the parent before con */
715  while (!TAILQ_EMPTY(&(child->nodes_head))) {
716  current = TAILQ_FIRST(&(child->nodes_head));
717  DLOG("detaching current=%p / %s\n", current, current->name);
718  con_detach(current);
719  DLOG("re-attaching\n");
720  /* We don’t use con_attach() here because for a CT_CON, the special
721  * case handling of con_attach() does not trigger. So all it would do
722  * is calling TAILQ_INSERT_AFTER, but with the wrong container. So we
723  * directly use the TAILQ macros. */
724  current->parent = parent;
725  TAILQ_INSERT_BEFORE(con, current, nodes);
726  DLOG("attaching to focus list\n");
727  TAILQ_INSERT_TAIL(&(parent->focus_head), current, focused);
728  current->percent = con->percent;
729  }
730  DLOG("re-attached all\n");
731 
732  /* 3: restore focus, if con was focused */
733  if (focus_next != NULL &&
734  TAILQ_FIRST(&(parent->focus_head)) == con) {
735  DLOG("restoring focus to focus_next=%p\n", focus_next);
736  TAILQ_REMOVE(&(parent->focus_head), focus_next, focused);
737  TAILQ_INSERT_HEAD(&(parent->focus_head), focus_next, focused);
738  DLOG("restored focus.\n");
739  }
740 
741  /* 4: close the redundant cons */
742  DLOG("closing redundant cons\n");
743  tree_close(con, DONT_KILL_WINDOW, true, false);
744 
745  /* Well, we got to abort the recursion here because we destroyed the
746  * container. However, if tree_flatten() is called sufficiently often,
747  * there can’t be the situation of having two pairs of redundant containers
748  * at once. Therefore, we can safely abort the recursion on this level
749  * after flattening. */
750  return;
751 
752 recurse:
753  /* We cannot use normal foreach here because tree_flatten might close the
754  * current container. */
755  current = TAILQ_FIRST(&(con->nodes_head));
756  while (current != NULL) {
757  Con *next = TAILQ_NEXT(current, nodes);
758  tree_flatten(current);
759  current = next;
760  }
761 
762  current = TAILQ_FIRST(&(con->floating_head));
763  while (current != NULL) {
764  Con *next = TAILQ_NEXT(current, floating_windows);
765  tree_flatten(current);
766  current = next;
767  }
768 }
Con * con_descend_direction(Con *con, direction_t direction)
Definition: con.c:1009
char * name
Name of the output.
Definition: data.h:297
#define XCB_ICCCM_WM_STATE_WITHDRAWN
Definition: xcb_compat.h:21
#define DLOG(fmt,...)
Definition: log.h:28
#define GREP_FIRST(dest, head, condition)
Definition: util.h:38
A &#39;Con&#39; represents everything from the X11 root window down to a single X11 window.
Definition: data.h:457
void workspace_show(Con *workspace)
Switches to the given workspace.
Definition: workspace.c:481
struct all_cons_head all_cons
Definition: tree.c:17
Config config
Definition: config.c:19
kill_window_t
parameter to specify whether tree_close() and x_window_kill() should kill only this specific window o...
Definition: data.h:61
void x_push_changes(Con *con)
Pushes all changes (state of each node, see x_push_node() and the window stack) to X11...
Definition: x.c:849
Definition: data.h:55
#define TAILQ_INSERT_TAIL(head, elm, field)
Definition: queue.h:363
Definition: data.h:56
Definition: data.h:56
uint32_t y
Definition: data.h:109
bool urgent
Definition: data.h:462
bool workspace_is_visible(Con *ws)
Returns true if the workspace is currently visible.
Definition: workspace.c:233
struct Con * croot
Definition: tree.c:14
bool force_focus_wrapping
Think of the following layout: Horizontal workspace with a tabbed con on the left of the screen and a...
Definition: config.h:132
struct Rect rect
Definition: data.h:492
void x_window_kill(xcb_window_t window, kill_window_t kill_window)
Kills the given X11 window using WM_DELETE_WINDOW (if supported).
Definition: x.c:266
#define TAILQ_LAST(head, headname)
Definition: queue.h:327
static bool _is_con_mapped(Con *con)
Definition: tree.c:169
char * class_class
Definition: data.h:326
void render_con(Con *con, bool render_fullscreen)
&quot;Renders&quot; the given container (and its children), meaning that all rects are updated correctly...
Definition: render.c:126
void con_attach(Con *con, Con *parent, bool ignore_focus)
Attaches the given container to the given parent.
Definition: con.c:104
#define TAILQ_EMPTY(head)
Definition: queue.h:332
int con_num_children(Con *con)
Returns the number of children of this container.
Definition: con.c:517
i3String * name
The name of the window.
Definition: data.h:330
char * sstrdup(const char *str)
Safe-wrapper around strdup which exits if malloc returns NULL (meaning that there is no more memory a...
Definition: data.h:55
struct Window * window
Definition: data.h:525
#define TAILQ_PREV(elm, headname, field)
Definition: queue.h:330
#define TAILQ_INSERT_HEAD(head, elm, field)
Definition: queue.h:353
void tree_next(char way, orientation_t orientation)
Changes focus in the given way (next/previous) and given orientation (horizontal/vertical).
Definition: tree.c:667
#define TAILQ_END(head)
Definition: queue.h:325
Con * workspace_encapsulate(Con *ws)
Creates a new container and re-parents all of children from the given workspace into it...
Definition: workspace.c:882
Con * con_get_workspace(Con *con)
Gets the workspace container this node is on.
Definition: con.c:308
#define FREE(pointer)
Definition: util.h:47
void con_fix_percent(Con *con)
Updates the percent attribute of the children of the given container.
Definition: con.c:533
char * resolve_tilde(const char *path)
This function resolves ~ in pathnames.
Definition: util.c:128
struct Rect Rect
Definition: data.h:44
Output * get_output_next(direction_t direction, Output *current, output_close_far_t close_far)
Gets the output which is the next one in the given direction.
Definition: randr.c:162
#define TAILQ_INSERT_BEFORE(listelm, elm, field)
Definition: queue.h:380
static Con * _create___i3(void)
Definition: tree.c:24
Definition: data.h:55
#define TAILQ_REMOVE(head, elm, field)
Definition: queue.h:387
xcb_connection_t * conn
Definition: main.c:42
bool tree_restore(const char *path, xcb_get_geometry_reply_t *geometry)
Loads tree from ~/.i3/_restart.json (used for in-place restarts).
Definition: tree.c:68
Con * con_descend_tiling_focused(Con *con)
Returns the focused con inside this client, descending the tree as far as possible.
Definition: con.c:983
Con * tree_open_con(Con *con, i3Window *window)
Opens an empty container in the current container.
Definition: tree.c:136
void x_con_kill(Con *con)
Kills the window decoration associated with the given container.
Definition: x.c:223
Definition: data.h:91
A &#39;Window&#39; is a type which contains an xcb_window_t and all the related information (hints like _NET_...
Definition: data.h:313
enum Con::@18 type
void x_set_warp_to(Rect *rect)
Set warp_to coordinates.
Definition: x.c:1096
void tree_flatten(Con *con)
tree_flatten() removes pairs of redundant split containers, e.g.
Definition: tree.c:684
xcb_window_t root
Definition: main.c:55
#define TAILQ_HEAD_INITIALIZER(head)
Definition: queue.h:312
Con * con_next_focused(Con *con)
Returns the container which will be focused next when the given container is not available anymore...
Definition: con.c:863
#define TAILQ_REPLACE(head, elm, elm2, field)
Definition: queue.h:398
#define CALL(obj, member,...)
Definition: util.h:55
Definition: data.h:90
void workspace_update_urgent_flag(Con *ws)
Goes through all clients on the given workspace and updates the workspace’s urgent flag accordingly...
Definition: workspace.c:796
Con * con_descend_focused(Con *con)
Returns the focused con inside this client, descending the tree as far as possible.
Definition: con.c:968
bool tree_close(Con *con, kill_window_t kill_window, bool dont_kill_parent, bool force_set_focus)
Closes the given container including all children.
Definition: tree.c:192
bool con_is_split(Con *con)
Definition: con.c:256
xcb_window_t id
Definition: data.h:314
char * class_instance
Definition: data.h:327
#define TAILQ_NEXT(elm, field)
Definition: queue.h:326
bool level_up(void)
Moves focus one level up.
Definition: tree.c:436
void con_focus(Con *con)
Sets input focus to the given container.
Definition: con.c:212
orientation_t
Definition: data.h:56
static void mark_unmapped(Con *con)
Definition: tree.c:482
#define TAILQ_FIRST(head)
Definition: queue.h:324
Con * focused
Definition: tree.c:15
An Output is a physical output on your graphics driver.
Definition: data.h:282
Definition: data.h:55
Output * get_output_containing(int x, int y)
Returns the active (!) output which contains the coordinates x, y or NULL if there is no output which...
Definition: randr.c:80
layout_t layout
Definition: data.h:556
struct deco_render_params * deco_render_params
Cache for the decoration rendering.
Definition: data.h:531
#define TAILQ_FOREACH(var, head, field)
Definition: queue.h:335
void tree_append_json(const char *filename)
Definition: load_layout.c:350
Definition: data.h:92
struct ev_loop * main_loop
Definition: main.c:64
Con * con_new(Con *parent, i3Window *window)
Definition: con.c:88
int num
the workspace number, if this Con is of type CT_WORKSPACE and the workspace is not a named workspace ...
Definition: data.h:488
void tree_init(xcb_get_geometry_reply_t *geometry)
Initializes the tree by creating the root node, adding all RandR outputs to the tree (that means rand...
Definition: tree.c:116
void con_detach(Con *con)
Detaches the given container from its current parent.
Definition: con.c:196
char * name
Definition: data.h:498
Con * output_get_content(Con *output)
Returns the output container below the given output container.
Definition: output.c:18
struct Con * parent
Definition: data.h:490
uint32_t x
Definition: data.h:108
void i3string_free(i3String *str)
Free an i3String.
void x_set_name(Con *con, const char *name)
Sets the WM_NAME property (so, no UTF8, but used only for debugging anyways) of the given name...
Definition: x.c:1054
void tree_render(void)
Renders the tree, that is rendering all outputs using render_con() and pushing the changes to X11 usi...
Definition: tree.c:501
Con * con
Pointer to the Con which represents this output.
Definition: data.h:300
bool con_is_floating(Con *con)
Returns true if the node is floating.
Definition: con.c:410
#define LOG(fmt,...)
Definition: libi3.h:76
uint32_t height
Definition: data.h:111
bool level_down(void)
Moves focus one level down.
Definition: tree.c:459
double percent
Definition: data.h:508
Con * con_get_fullscreen_con(Con *con, int fullscreen_mode)
Returns the first fullscreen node below this node.
Definition: con.c:356
bool path_exists(const char *path)
Checks if the given path exists by calling stat().
Definition: util.c:158
static bool _tree_next(Con *con, char way, orientation_t orientation, bool wrap)
Definition: tree.c:521
#define ELOG(fmt,...)
Definition: libi3.h:80
bool con_fullscreen_permits_focusing(Con *con)
Returns true if changing the focus to con would be allowed considering the fullscreen focus constrain...
Definition: con.c:1465
void add_ignore_event(const int sequence, const int response_type)
Adds the given sequence to the list of events which are ignored.
int con_orientation(Con *con)
Returns the orientation of the given container (for stacked containers, vertical orientation is used ...
Definition: con.c:828
void tree_close_con(kill_window_t kill_window)
Closes the current container using tree_close().
Definition: tree.c:360
enum Con::@19 fullscreen_mode
direction_t
Definition: data.h:55
void tree_split(Con *con, orientation_t orientation)
Splits (horizontally or vertically) the given container by creating a new container which contains th...
Definition: tree.c:380
uint32_t width
Definition: data.h:110
void con_update_parents_urgency(Con *con)
Make all parent containers urgent if con is urgent or clear the urgent flag of all parent containers ...
Definition: con.c:1533
bool mapped
Definition: data.h:458