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
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;
63 TAILQ_FOREACH(output, &outputs, outputs) {
67 Con *oc = con_new(croot);
68 oc->name = strdup(output->name);
70 oc->rect = output->rect;
72 /* add a workspace to this output */
74 ws->type = CT_WORKSPACE;
75 ws->name = strdup("1");
76 ws->fullscreen_mode = CF_OUTPUT;
83 * Opens an empty container in the current container
86 Con *tree_open_con(Con *con) {
88 /* every focusable Con has a parent (outputs have parent root) */
89 con = focused->parent;
90 /* If the parent is an output, we are on a workspace. In this case,
91 * the new container needs to be opened as a leaf of the workspace. */
92 if (con->type == CT_OUTPUT)
98 /* 3: re-calculate child->percent for each child */
99 con_fix_percent(con, WINDOW_ADD);
101 /* 4: add a new container leaf to this con */
102 Con *new = con_new(con);
109 * Closes the given container including all children
112 void tree_close(Con *con, bool kill_window) {
113 /* TODO: check floating clients and adjust old_parent if necessary */
115 /* Get the container which is next focused */
117 if (con->type == CT_FLOATING_CON) {
118 next = TAILQ_NEXT(con, floating_windows);
119 if (next == TAILQ_END(&(con->parent->floating_head)))
122 next = TAILQ_NEXT(con, focused);
123 if (next == TAILQ_END(&(con->parent->nodes_head)))
127 LOG("closing %p\n", con);
129 /* We cannot use TAILQ_FOREACH because the children get deleted
130 * in their parent’s nodes_head */
131 while (!TAILQ_EMPTY(&(con->nodes_head))) {
132 child = TAILQ_FIRST(&(con->nodes_head));
133 tree_close(child, kill_window);
136 if (con->window != NULL) {
138 x_window_kill(con->window->id);
140 /* un-parent the window */
141 xcb_reparent_window(conn, con->window->id, root, 0, 0);
142 /* TODO: client_unmap to set state to withdrawn */
148 /* kill the X11 part of this container */
152 con_fix_percent(con->parent, WINDOW_REMOVE);
155 TAILQ_REMOVE(&all_cons, con, all_cons);
158 /* TODO: check if the container (or one of its children) was focused */
162 void tree_close_con() {
163 assert(focused != NULL);
164 if (focused->type == CT_WORKSPACE) {
165 LOG("Cannot close workspace\n");
170 tree_close(focused, true);
174 * Splits (horizontally or vertically) the given container by creating a new
175 * container which contains the old one and the future ones.
178 void tree_split(Con *con, orientation_t orientation) {
179 /* for a workspace, we just need to change orientation */
180 if (con->type == CT_WORKSPACE) {
181 con->orientation = orientation;
184 /* 2: replace it with a new Con */
185 Con *new = con_new(NULL);
186 Con *parent = con->parent;
187 TAILQ_REPLACE(&(parent->nodes_head), con, new, nodes);
188 TAILQ_REPLACE(&(parent->focus_head), con, new, focused);
189 new->parent = parent;
190 new->orientation = orientation;
192 /* 3: add it as a child to the new Con */
193 con_attach(con, new);
197 /* We can focus up to the workspace, but not any higher in the tree */
198 if (focused->parent->type != CT_CON &&
199 focused->parent->type != CT_WORKSPACE) {
200 printf("cannot go up\n");
203 con_focus(focused->parent);
207 /* Go down the focus stack of the current node */
208 Con *next = TAILQ_FIRST(&(focused->focus_head));
209 if (next == TAILQ_END(&(focused->focus_head))) {
210 printf("cannot go down\n");
216 static void mark_unmapped(Con *con) {
220 TAILQ_FOREACH(current, &(con->nodes_head), nodes)
221 mark_unmapped(current);
228 printf("-- BEGIN RENDERING --\n");
229 /* Reset map state for all nodes in tree */
230 /* TODO: a nicer method to walk all nodes would be good, maybe? */
231 mark_unmapped(croot);
232 croot->mapped = true;
234 /* We start rendering at an output */
236 TAILQ_FOREACH(output, &(croot->nodes_head), nodes) {
237 printf("output %p / %s\n", output, output->name);
240 x_push_changes(croot);
241 printf("-- END RENDERING --\n");
244 void tree_next(char way, orientation_t orientation) {
245 /* 1: get the first parent with the same orientation */
246 Con *parent = focused->parent;
247 while (parent->orientation != orientation) {
248 LOG("need to go one level further up\n");
249 /* if the current parent is an output, we are at a workspace
250 * and the orientation still does not match */
251 if (parent->type == CT_WORKSPACE)
253 parent = parent->parent;
255 Con *current = TAILQ_FIRST(&(parent->focus_head));
256 assert(current != TAILQ_END(&(parent->focus_head)));
258 /* 2: chose next (or previous) */
261 next = TAILQ_NEXT(current, nodes);
262 /* if we are at the end of the list, we need to wrap */
263 if (next == TAILQ_END(&(parent->nodes_head)))
264 next = TAILQ_FIRST(&(parent->nodes_head));
266 next = TAILQ_PREV(current, nodes_head, nodes);
267 /* if we are at the end of the list, we need to wrap */
268 if (next == TAILQ_END(&(parent->nodes_head)))
269 next = TAILQ_LAST(&(parent->nodes_head), nodes_head);
272 /* 3: focus choice comes in here. at the moment we will go down
273 * until we find a window */
274 /* TODO: check for window, atm we only go down as far as possible */
275 while (!TAILQ_EMPTY(&(next->focus_head)))
276 next = TAILQ_FIRST(&(next->focus_head));
281 void tree_move(char way, orientation_t orientation) {
282 /* 1: get the first parent with the same orientation */
283 Con *parent = focused->parent;
284 if (focused->type == CT_WORKSPACE)
286 bool level_changed = false;
287 while (parent->orientation != orientation) {
288 LOG("need to go one level further up\n");
289 /* if the current parent is an output, we are at a workspace
290 * and the orientation still does not match */
291 if (parent->type == CT_WORKSPACE)
293 parent = parent->parent;
294 level_changed = true;
296 Con *current = TAILQ_FIRST(&(parent->focus_head));
297 assert(current != TAILQ_END(&(parent->focus_head)));
299 /* 2: chose next (or previous) */
302 LOG("i would insert it after %p / %s\n", next, next->name);
303 if (!level_changed) {
304 next = TAILQ_NEXT(next, nodes);
305 if (next == TAILQ_END(&(next->parent->nodes_head))) {
306 LOG("cannot move further to the right\n");
312 focused->parent = next->parent;
314 TAILQ_INSERT_AFTER(&(next->parent->nodes_head), next, focused, nodes);
315 TAILQ_INSERT_HEAD(&(next->parent->focus_head), focused, focused);
316 /* TODO: don’t influence focus handling? */
318 LOG("i would insert it before %p / %s\n", current, current->name);
319 if (!level_changed) {
320 next = TAILQ_PREV(next, nodes_head, nodes);
321 if (next == TAILQ_END(&(next->parent->nodes_head))) {
322 LOG("cannot move further\n");
328 focused->parent = next->parent;
330 TAILQ_INSERT_BEFORE(next, focused, nodes);
331 TAILQ_INSERT_HEAD(&(next->parent->focus_head), focused, focused);
332 /* TODO: don’t influence focus handling? */