X-Git-Url: https://git.sur5r.net/?a=blobdiff_plain;f=src%2Ftree.c;h=5559908f0738d20afbbed8e9b5f048a7609a4e65;hb=ed2bcc15e384be99225a247435f6cff678e64f0c;hp=0a18e88d5b49fd1069748b03bf165ac9c3dc80d0;hpb=432563d6e709ea3caa77015a8a647c876f73fd88;p=i3%2Fi3 diff --git a/src/tree.c b/src/tree.c index 0a18e88d..5559908f 100644 --- a/src/tree.c +++ b/src/tree.c @@ -1,7 +1,12 @@ /* * vim:ts=4:sw=4:expandtab + * + * i3 - an improved dynamic tiling window manager + * © 2009-2011 Michael Stapelberg and contributors (see also: LICENSE) + * + * tree.c: Everything that primarily modifies the layout tree data structure. + * */ - #include "all.h" struct Con *croot; @@ -10,10 +15,51 @@ struct Con *focused; struct all_cons_head all_cons = TAILQ_HEAD_INITIALIZER(all_cons); /* - * Loads tree from ~/.i3/_restart.json (used for in-place restarts). + * Create the pseudo-output __i3. Output-independent workspaces such as + * __i3_scratch will live there. * */ -bool tree_restore(const char *path) { +static Con *_create___i3() { + Con *__i3 = con_new(croot, NULL); + FREE(__i3->name); + __i3->name = sstrdup("__i3"); + __i3->type = CT_OUTPUT; + __i3->layout = L_OUTPUT; + con_fix_percent(croot); + x_set_name(__i3, "[i3 con] pseudo-output __i3"); + /* For retaining the correct position/size of a scratchpad window, the + * dimensions of the real outputs should be multiples of the __i3 + * pseudo-output. */ + __i3->rect.width = 1280; + __i3->rect.height = 1024; + + /* Add a content container. */ + DLOG("adding main content container\n"); + Con *content = con_new(NULL, NULL); + content->type = CT_CON; + FREE(content->name); + content->name = sstrdup("content"); + + x_set_name(content, "[i3 con] content __i3"); + con_attach(content, __i3, false); + + /* Attach the __i3_scratch workspace. */ + Con *ws = con_new(NULL, NULL); + ws->type = CT_WORKSPACE; + ws->num = -1; + ws->name = sstrdup("__i3_scratch"); + con_attach(ws, content, false); + x_set_name(ws, "[i3 con] workspace __i3_scratch"); + ws->fullscreen_mode = CF_OUTPUT; + + return __i3; +} + +/* + * Loads tree from 'path' (used for in-place restarts). + * + */ +bool tree_restore(const char *path, xcb_get_geometry_reply_t *geometry) { char *globbed = resolve_tilde(path); if (!path_exists(globbed)) { @@ -23,7 +69,13 @@ bool tree_restore(const char *path) { } /* TODO: refactor the following */ - croot = con_new(NULL); + croot = con_new(NULL, NULL); + croot->rect = (Rect){ + geometry->x, + geometry->y, + geometry->width, + geometry->height + }; focused = croot; tree_append_json(globbed); @@ -36,6 +88,17 @@ bool tree_restore(const char *path) { Con *ws = TAILQ_FIRST(&(out->nodes_head)); printf("ws = %p\n", ws); + /* For in-place restarting into v4.2, we need to make sure the new + * pseudo-output __i3 is present. */ + if (strcmp(out->name, "__i3") != 0) { + DLOG("Adding pseudo-output __i3 during inplace restart\n"); + Con *__i3 = _create___i3(); + /* Ensure that it is the first output, other places in the code make + * that assumption. */ + TAILQ_REMOVE(&(croot->nodes_head), __i3, nodes); + TAILQ_INSERT_HEAD(&(croot->nodes_head), __i3, nodes); + } + return true; } @@ -44,42 +107,54 @@ bool tree_restore(const char *path) { * root node are created in randr.c for each Output. * */ -void tree_init() { - croot = con_new(NULL); +void tree_init(xcb_get_geometry_reply_t *geometry) { + croot = con_new(NULL, NULL); FREE(croot->name); croot->name = "root"; croot->type = CT_ROOT; + croot->rect = (Rect){ + geometry->x, + geometry->y, + geometry->width, + geometry->height + }; + + _create___i3(); } /* * Opens an empty container in the current container * */ -Con *tree_open_con(Con *con) { +Con *tree_open_con(Con *con, i3Window *window) { if (con == NULL) { /* every focusable Con has a parent (outputs have parent root) */ con = focused->parent; /* If the parent is an output, we are on a workspace. In this case, * the new container needs to be opened as a leaf of the workspace. */ - if (con->type == CT_OUTPUT) + if (con->parent->type == CT_OUTPUT && con->type != CT_DOCKAREA) { con = focused; + } + /* If the currently focused container is a floating container, we - * attach the new container to the workspace */ - if (con->type == CT_FLOATING_CON) - con = con->parent; + * attach the new container to the currently focused spot in its + * workspace. */ + if (con->type == CT_FLOATING_CON) { + con = con_descend_tiling_focused(con->parent); + if (con->type != CT_WORKSPACE) + con = con->parent; + } + DLOG("con = %p\n", con); } assert(con != NULL); /* 3. create the container and attach it to its parent */ - Con *new = con_new(con); + Con *new = con_new(con, window); /* 4: re-calculate child->percent for each child */ con_fix_percent(con); - /* 5: focus the new container */ - con_focus(new); - return new; } @@ -94,10 +169,19 @@ static bool _is_con_mapped(Con *con) { } /* - * Closes the given container including all children + * Closes the given container including all children. + * Returns true if the container was killed or false if just WM_DELETE was sent + * and the window is expected to kill itself. + * + * The dont_kill_parent flag is specified when the function calls itself + * recursively while deleting a containers children. + * + * The force_set_focus flag is specified in the case of killing a floating + * window: tree_close() will be invoked for the CT_FLOATINGCON (the parent + * container) and focus should be set there. * */ -void tree_close(Con *con, bool kill_window, bool dont_kill_parent) { +bool tree_close(Con *con, kill_window_t kill_window, bool dont_kill_parent, bool force_set_focus) { bool was_mapped = con->mapped; Con *parent = con->parent; @@ -113,23 +197,45 @@ void tree_close(Con *con, bool kill_window, bool dont_kill_parent) { DLOG("next = %p, focused = %p\n", next, focused); DLOG("closing %p, kill_window = %d\n", con, kill_window); - Con *child; + Con *child, *nextchild; + bool abort_kill = false; /* We cannot use TAILQ_FOREACH because the children get deleted * in their parent’s nodes_head */ - while (!TAILQ_EMPTY(&(con->nodes_head))) { - child = TAILQ_FIRST(&(con->nodes_head)); + for (child = TAILQ_FIRST(&(con->nodes_head)); child; ) { + nextchild = TAILQ_NEXT(child, nodes); DLOG("killing child=%p\n", child); - tree_close(child, kill_window, true); + if (!tree_close(child, kill_window, true, false)) + abort_kill = true; + child = nextchild; + } + + if (abort_kill) { + DLOG("One of the children could not be killed immediately (WM_DELETE sent), aborting.\n"); + return false; } if (con->window != NULL) { - if (kill_window) - x_window_kill(con->window->id); - else { + if (kill_window != DONT_KILL_WINDOW) { + x_window_kill(con->window->id, kill_window); + return false; + } else { + xcb_void_cookie_t cookie; /* un-parent the window */ - xcb_reparent_window(conn, con->window->id, root, 0, 0); - /* TODO: client_unmap to set state to withdrawn */ + cookie = xcb_reparent_window(conn, con->window->id, root, 0, 0); + + /* Ignore X11 errors for the ReparentWindow request. + * X11 Errors are returned when the window was already destroyed */ + add_ignore_event(cookie.sequence, 0); + + /* We are no longer handling this window, thus set WM_STATE to + * WM_STATE_WITHDRAWN (see ICCCM 4.1.3.1) */ + long data[] = { XCB_ICCCM_WM_STATE_WITHDRAWN, XCB_NONE }; + cookie = xcb_change_property(conn, XCB_PROP_MODE_REPLACE, + con->window->id, A_WM_STATE, A_WM_STATE, 32, 2, data); + /* Ignore X11 errors for the ReparentWindow request. + * X11 Errors are returned when the window was already destroyed */ + add_ignore_event(cookie.sequence, 0); } FREE(con->window->class_class); FREE(con->window->class_instance); @@ -151,15 +257,12 @@ void tree_close(Con *con, bool kill_window, bool dont_kill_parent) { if (con_is_floating(con)) { Con *ws = con_get_workspace(con); DLOG("Container was floating, killing floating container\n"); - tree_close(parent, false, false); + tree_close(parent, DONT_KILL_WINDOW, false, (con == focused)); DLOG("parent container killed\n"); if (con == focused) { DLOG("This is the focused container, i need to find another one to focus. I start looking at ws = %p\n", ws); - next = ws; - /* now go down the focus stack as far as - * possible, excluding the current container */ - while (!TAILQ_EMPTY(&(next->focus_head))) - next = TAILQ_FIRST(&(next->focus_head)); + /* go down the focus stack as far as possible */ + next = con_descend_focused(ws); dont_kill_parent = true; DLOG("Alright, focusing %p\n", next); @@ -169,6 +272,7 @@ void tree_close(Con *con, bool kill_window, bool dont_kill_parent) { } free(con->name); + FREE(con->deco_render_params); TAILQ_REMOVE(&all_cons, con, all_cons); free(con); @@ -176,33 +280,40 @@ void tree_close(Con *con, bool kill_window, bool dont_kill_parent) { * when closing the parent, so we can exit now. */ if (!next) { DLOG("No next container, i will just exit now\n"); - return; + return true; } if (was_mapped || con == focused) { - DLOG("focusing %p / %s\n", next, next->name); - /* TODO: check if the container (or one of its children) was focused */ - con_focus(next); + if ((kill_window != DONT_KILL_WINDOW) || !dont_kill_parent || con == focused) { + DLOG("focusing %p / %s\n", next, next->name); + if (next->type == CT_DOCKAREA) { + /* Instead of focusing the dockarea, we need to restore focus to the workspace */ + con_focus(con_descend_focused(output_get_content(next->parent))); + } else { + if (!force_set_focus && con != focused) + DLOG("not changing focus, the container was not focused before\n"); + else con_focus(next); + } + } + else { + DLOG("not focusing because we're not killing anybody"); + } } else { DLOG("not focusing, was not mapped\n"); } /* check if the parent container is empty now and close it */ - if (!dont_kill_parent && - parent->type != CT_WORKSPACE && - TAILQ_EMPTY(&(parent->nodes_head))) { - DLOG("Closing empty parent container\n"); - /* TODO: check if this container would swallow any other client and - * don’t close it automatically. */ - tree_close(parent, false, false); - } + if (!dont_kill_parent) + CALL(parent, on_remove_child); + + return true; } /* * Closes the current container using tree_close(). * */ -void tree_close_con() { +void tree_close_con(kill_window_t kill_window) { assert(focused != NULL); if (focused->type == CT_WORKSPACE) { LOG("Cannot close workspace\n"); @@ -214,7 +325,7 @@ void tree_close_con() { assert(focused->type != CT_ROOT); /* Kill con */ - tree_close(focused, true, false); + tree_close(focused, kill_window, false, false); } /* @@ -231,10 +342,16 @@ void tree_split(Con *con, orientation_t orientation) { } Con *parent = con->parent; + + /* Force re-rendering to make the indicator border visible. */ + FREE(con->deco_render_params); + FREE(parent->deco_render_params); + /* if we are in a container whose parent contains only one * child (its split functionality is unused so far), we just change the * orientation (more intuitive than splitting again) */ - if (con_num_children(parent) == 1) { + if (con_num_children(parent) == 1 && + parent->layout == L_DEFAULT) { parent->orientation = orientation; DLOG("Just changing orientation of existing container\n"); return; @@ -243,7 +360,7 @@ void tree_split(Con *con, orientation_t orientation) { DLOG("Splitting in orientation %d\n", orientation); /* 2: replace it with a new Con */ - Con *new = con_new(NULL); + Con *new = con_new(NULL, NULL); TAILQ_REPLACE(&(parent->nodes_head), con, new, nodes); TAILQ_REPLACE(&(parent->focus_head), con, new, focused); new->parent = parent; @@ -262,10 +379,17 @@ void tree_split(Con *con, orientation_t orientation) { * */ void level_up() { + /* We cannot go up when we are in fullscreen mode at the moment, that would + * be totally not intuitive */ + if (focused->fullscreen_mode != CF_NONE) { + LOG("Currently in fullscreen, not going up\n"); + return; + } /* We can focus up to the workspace, but not any higher in the tree */ - if (focused->parent->type != CT_CON && - focused->parent->type != CT_WORKSPACE) { - printf("cannot go up\n"); + if ((focused->parent->type != CT_CON && + focused->parent->type != CT_WORKSPACE) || + focused->type == CT_WORKSPACE) { + LOG("Cannot go up any further\n"); return; } con_focus(focused->parent); @@ -314,212 +438,142 @@ void tree_render() { mark_unmapped(croot); croot->mapped = true; - /* We start rendering at an output */ - Con *output; - TAILQ_FOREACH(output, &(croot->nodes_head), nodes) { - DLOG("output %p / %s\n", output, output->name); - render_con(output, false); - } + render_con(croot, false); + x_push_changes(croot); DLOG("-- END RENDERING --\n"); } /* - * Changes focus in the given way (next/previous) and given orientation - * (horizontal/vertical). + * Recursive function to walk the tree until a con can be found to focus. * */ -void tree_next(char way, orientation_t orientation) { - /* 1: get the first parent with the same orientation */ - Con *parent = focused->parent; - while (focused->type != CT_WORKSPACE && - con_orientation(parent) != orientation) { - LOG("need to go one level further up\n"); - /* if the current parent is an output, we are at a workspace - * and the orientation still does not match */ - if (parent->type == CT_WORKSPACE) - return; - parent = parent->parent; - } - Con *current = TAILQ_FIRST(&(parent->focus_head)); - assert(current != TAILQ_END(&(parent->focus_head))); - - /* 2: chose next (or previous) */ - Con *next; - if (way == 'n') { - next = TAILQ_NEXT(current, nodes); - /* if we are at the end of the list, we need to wrap */ - if (next == TAILQ_END(&(parent->nodes_head))) - next = TAILQ_FIRST(&(parent->nodes_head)); - } else { - next = TAILQ_PREV(current, nodes_head, nodes); - /* if we are at the end of the list, we need to wrap */ - if (next == TAILQ_END(&(parent->nodes_head))) - next = TAILQ_LAST(&(parent->nodes_head), nodes_head); +static bool _tree_next(Con *con, char way, orientation_t orientation, bool wrap) { + /* Stop recursing at workspaces after attempting to switch to next + * workspace if possible. */ + if (con->type == CT_WORKSPACE) { + Output *current_output = get_output_containing(con->rect.x, con->rect.y); + Output *next_output; + + if (!current_output) + return false; + DLOG("Current output is %s\n", current_output->name); + + /* Try to find next output */ + direction_t direction; + if (way == 'n' && orientation == HORIZ) + direction = D_RIGHT; + else if (way == 'p' && orientation == HORIZ) + direction = D_LEFT; + else if (way == 'n' && orientation == VERT) + direction = D_DOWN; + else if (way == 'p' && orientation == VERT) + direction = D_UP; + else + return false; + + next_output = get_output_next(direction, current_output); + if (!next_output) + return false; + DLOG("Next output is %s\n", next_output->name); + + /* Find visible workspace on next output */ + Con *workspace = NULL; + GREP_FIRST(workspace, output_get_content(next_output->con), workspace_is_visible(child)); + + /* Show next workspace and focus appropriate container if possible. */ + if (!workspace) + return false; + + workspace_show(workspace); + Con *focus = con_descend_direction(workspace, direction); + if (focus) { + con_focus(focus); + x_set_warp_to(&(focus->rect)); + } + return true; } - /* 3: focus choice comes in here. at the moment we will go down - * until we find a window */ - /* TODO: check for window, atm we only go down as far as possible */ - while (!TAILQ_EMPTY(&(next->focus_head))) - next = TAILQ_FIRST(&(next->focus_head)); - - DLOG("focusing %p\n", next); - con_focus(next); -} + Con *parent = con->parent; -/* - * Moves the current container in the given way (next/previous) and given - * orientation (horizontal/vertical). - * - */ -void tree_move(char way, orientation_t orientation) { - /* 1: get the first parent with the same orientation */ - Con *parent = focused->parent; - Con *old_parent = parent; - if (focused->type == CT_WORKSPACE) - return; - bool level_changed = false; - while (con_orientation(parent) != orientation) { - DLOG("need to go one level further up\n"); - /* If the current parent is an output, we are at a workspace - * and the orientation still does not match. In this case, we split the - * workspace to have the same look & feel as in older i3 releases. */ - if (parent->type == CT_WORKSPACE) { - DLOG("Arrived at workspace, splitting...\n"); - /* 1: create a new split container */ - Con *new = con_new(NULL); - new->parent = parent; - - /* 2: copy layout and orientation from workspace */ - new->layout = parent->layout; - new->orientation = parent->orientation; - - Con *old_focused = TAILQ_FIRST(&(parent->focus_head)); - if (old_focused == TAILQ_END(&(parent->focus_head))) - old_focused = NULL; - - /* 3: move the existing cons of this workspace below the new con */ - DLOG("Moving cons\n"); - Con *child; - while (!TAILQ_EMPTY(&(parent->nodes_head))) { - child = TAILQ_FIRST(&(parent->nodes_head)); - con_detach(child); - con_attach(child, new, true); + if (con->type == CT_FLOATING_CON) { + /* left/right focuses the previous/next floating container */ + if (orientation == HORIZ) { + Con *next; + if (way == 'n') + next = TAILQ_NEXT(con, floating_windows); + else next = TAILQ_PREV(con, floating_head, floating_windows); + + /* If there is no next/previous container, wrap */ + if (!next) { + if (way == 'n') + next = TAILQ_FIRST(&(parent->floating_head)); + else next = TAILQ_LAST(&(parent->floating_head), floating_head); } - /* 4: switch workspace orientation */ - parent->orientation = orientation; - - /* 5: attach the new split container to the workspace */ - DLOG("Attaching new split to ws\n"); - con_attach(new, parent, false); - - /* 6: fix the percentages */ - con_fix_percent(new); - con_fix_percent(parent); + /* Still no next/previous container? bail out */ + if (!next) + return false; - if (old_focused) - con_focus(old_focused); - - level_changed = true; - - break; + con_focus(con_descend_focused(next)); + return true; + } else { + /* up/down cycles through the Z-index */ + /* TODO: implement cycling through the z-index */ + return false; } - parent = parent->parent; - level_changed = true; } + + /* If the orientation does not match or there is no other con to focus, we + * need to go higher in the hierarchy */ + if (con_orientation(parent) != orientation || + con_num_children(parent) == 1) + return _tree_next(parent, way, orientation, wrap); + Con *current = TAILQ_FIRST(&(parent->focus_head)); - assert(current != TAILQ_END(&(parent->focus_head))); - - /* 2: chose next (or previous) */ - Con *next = current; - if (way == 'n') { - LOG("i would insert it after %p / %s\n", next, next->name); - - /* Have a look at the next container: If there is no next container or - * if it is a leaf node, we move the focused one left to it. However, - * for split containers, we descend into it. */ - next = TAILQ_NEXT(next, nodes); - if (next == TAILQ_END(&(next->parent->nodes_head))) { - if (focused == current) - return; - next = current; - } else { - if (level_changed && con_is_leaf(next)) { - next = current; - } else { - /* if this is a split container, we need to go down */ - while (!TAILQ_EMPTY(&(next->focus_head))) - next = TAILQ_FIRST(&(next->focus_head)); - } - } + /* TODO: when can the following happen (except for floating windows, which + * are handled above)? */ + if (TAILQ_EMPTY(&(parent->nodes_head))) { + DLOG("nothing to focus\n"); + return false; + } - con_detach(focused); - con_fix_percent(focused->parent); - focused->parent = next->parent; + Con *next; + if (way == 'n') + next = TAILQ_NEXT(current, nodes); + else next = TAILQ_PREV(current, nodes_head, nodes); - TAILQ_INSERT_AFTER(&(next->parent->nodes_head), next, focused, nodes); - TAILQ_INSERT_HEAD(&(next->parent->focus_head), focused, focused); - /* TODO: don’t influence focus handling? */ - } else { - LOG("i would insert it before %p / %s\n", current, current->name); - bool gone_down = false; - next = TAILQ_PREV(next, nodes_head, nodes); - if (next == TAILQ_END(&(next->parent->nodes_head))) { - if (focused == current) - return; - next = current; - } else { - if (level_changed && con_is_leaf(next)) { - next = current; - } else { - /* if this is a split container, we need to go down */ - while (!TAILQ_EMPTY(&(next->focus_head))) { - gone_down = true; - next = TAILQ_FIRST(&(next->focus_head)); - } - } + if (!next) { + if (!config.force_focus_wrapping) { + /* If there is no next/previous container, we check if we can focus one + * when going higher (without wrapping, though). If so, we are done, if + * not, we wrap */ + if (_tree_next(parent, way, orientation, false)) + return true; + + if (!wrap) + return false; } - con_detach(focused); - con_fix_percent(focused); - focused->parent = next->parent; - - /* After going down in the tree, we insert the container *after* - * the currently focused one even though the command used "before". - * This is to keep the user experience clear, since the before/after - * only signifies the direction of the movement on top-level */ - if (gone_down) - TAILQ_INSERT_AFTER(&(next->parent->nodes_head), next, focused, nodes); - else TAILQ_INSERT_BEFORE(next, focused, nodes); - TAILQ_INSERT_HEAD(&(next->parent->focus_head), focused, focused); - /* TODO: don’t influence focus handling? */ + if (way == 'n') + next = TAILQ_FIRST(&(parent->nodes_head)); + else next = TAILQ_LAST(&(parent->nodes_head), nodes_head); } - /* fix the percentages in the container we moved to */ - int children = con_num_children(next->parent); - if (children == 1) - focused->percent = 1.0; - else - focused->percent = 1.0 / (children - 1); - con_fix_percent(next->parent); - - /* We need to call con_focus() to fix the focus stack "above" the container - * we just inserted the focused container into (otherwise, the parent - * container(s) would still point to the old container(s)). */ - con_focus(focused); - - if (con_num_children(old_parent) == 0) { - DLOG("Old container empty after moving. Let's close it\n"); - tree_close(old_parent, false, false); - } - else { - /* fix the percentages in the container we moved from */ - con_fix_percent(old_parent); - } + /* 3: focus choice comes in here. at the moment we will go down + * until we find a window */ + /* TODO: check for window, atm we only go down as far as possible */ + con_focus(con_descend_focused(next)); + return true; +} - tree_flatten(croot); +/* + * Changes focus in the given way (next/previous) and given orientation + * (horizontal/vertical). + * + */ +void tree_next(char way, orientation_t orientation) { + _tree_next(focused, way, orientation, true); } /* @@ -575,6 +629,7 @@ void tree_flatten(Con *con) { TAILQ_INSERT_BEFORE(con, current, nodes); DLOG("attaching to focus list\n"); TAILQ_INSERT_TAIL(&(parent->focus_head), current, focused); + current->percent = con->percent; } DLOG("re-attached all\n"); @@ -589,7 +644,7 @@ void tree_flatten(Con *con) { /* 4: close the redundant cons */ DLOG("closing redundant cons\n"); - tree_close(con, false, true); + tree_close(con, DONT_KILL_WINDOW, true, false); /* Well, we got to abort the recursion here because we destroyed the * container. However, if tree_flatten() is called sufficiently often,