2 * vim:ts=4:sw=4:expandtab
4 * i3 - an improved dynamic tiling window manager
5 * © 2009-2010 Michael Stapelberg and contributors (see also: LICENSE)
7 * con.c contains all functions which deal with containers directly (creating
8 * containers, searching containers, getting specific properties from
28 Con *con_new(Con *parent) {
29 Con *new = scalloc(sizeof(Con));
30 TAILQ_INSERT_TAIL(&all_cons, new, all_cons);
32 new->name = strdup("");
34 LOG("opening window %d\n", cnt);
36 /* TODO: remove window coloring after test-phase */
37 LOG("color %s\n", colors[cnt]);
38 new->name = strdup(colors[cnt]);
39 uint32_t cp = get_colorpixel(colors[cnt]);
41 if ((cnt % (sizeof(colors) / sizeof(char*))) == 0)
46 xcb_change_window_attributes(conn, new->frame, XCB_CW_BACK_PIXEL, &cp);
48 TAILQ_INIT(&(new->floating_head));
49 TAILQ_INIT(&(new->nodes_head));
50 TAILQ_INIT(&(new->focus_head));
51 TAILQ_INIT(&(new->swallow_head));
54 con_attach(new, parent);
59 void con_attach(Con *con, Con *parent) {
61 TAILQ_INSERT_TAIL(&(parent->nodes_head), con, nodes);
62 /* We insert to the TAIL because con_focus() will correct this.
63 * This way, we have the option to insert Cons without having
65 TAILQ_INSERT_TAIL(&(parent->focus_head), con, focused);
68 void con_detach(Con *con) {
69 if (con->type == CT_FLOATING_CON) {
72 TAILQ_REMOVE(&(con->parent->nodes_head), con, nodes);
73 TAILQ_REMOVE(&(con->parent->focus_head), con, focused);
78 * Sets input focus to the given container. Will be updated in X11 in the next
79 * run of x_push_changes().
82 void con_focus(Con *con) {
85 /* 1: set focused-pointer to the new con */
86 /* 2: exchange the position of the container in focus stack of the parent all the way up */
87 TAILQ_REMOVE(&(con->parent->focus_head), con, focused);
88 TAILQ_INSERT_HEAD(&(con->parent->focus_head), con, focused);
89 if (con->parent->parent != NULL)
90 con_focus(con->parent);
96 * Returns true when this node is a leaf node (has no children)
99 bool con_is_leaf(Con *con) {
100 return TAILQ_EMPTY(&(con->nodes_head));
104 * Returns true if this node accepts a window (if the node swallows windows,
105 * it might already have swallowed enough and cannot hold any more).
108 bool con_accepts_window(Con *con) {
109 /* 1: workspaces never accept direct windows */
110 if (con->parent->type == CT_OUTPUT)
113 /* TODO: if this is a swallowing container, we need to check its max_clients */
114 return (con->window == NULL);
118 * Gets the output container (first container with CT_OUTPUT in hierarchy) this
122 Con *con_get_output(Con *con) {
124 while (result != NULL && result->type != CT_OUTPUT)
125 result = result->parent;
126 /* We must be able to get an output because focus can never be set higher
127 * in the tree (root node cannot be focused). */
128 assert(result != NULL);
133 * Gets the workspace container this node is on.
136 Con *con_get_workspace(Con *con) {
138 while (result != NULL && result->parent->type != CT_OUTPUT)
139 result = result->parent;
140 assert(result != NULL);
145 * helper data structure for the breadth-first-search in
146 * con_get_fullscreen_con()
152 TAILQ_ENTRY(bfs_entry) entries;
156 * Returns the first fullscreen node below this node.
159 Con *con_get_fullscreen_con(Con *con) {
160 Con *current, *child;
162 LOG("looking for fullscreen node\n");
163 /* TODO: is breadth-first-search really appropriate? (check as soon as
164 * fullscreen levels and fullscreen for containers is implemented) */
165 TAILQ_HEAD(bfs_head, bfs_entry) bfs_head = TAILQ_HEAD_INITIALIZER(bfs_head);
166 struct bfs_entry *entry = smalloc(sizeof(struct bfs_entry));
168 TAILQ_INSERT_TAIL(&bfs_head, entry, entries);
170 while (!TAILQ_EMPTY(&bfs_head)) {
171 entry = TAILQ_FIRST(&bfs_head);
172 current = entry->con;
173 LOG("checking %p\n", current);
174 if (current != con && current->fullscreen_mode != CF_NONE) {
175 /* empty the queue */
176 while (!TAILQ_EMPTY(&bfs_head)) {
177 entry = TAILQ_FIRST(&bfs_head);
178 TAILQ_REMOVE(&bfs_head, entry, entries);
184 LOG("deleting from queue\n");
185 TAILQ_REMOVE(&bfs_head, entry, entries);
188 TAILQ_FOREACH(child, &(current->nodes_head), nodes) {
189 entry = smalloc(sizeof(struct bfs_entry));
191 TAILQ_INSERT_TAIL(&bfs_head, entry, entries);
199 * Returns true if the node is floating.
202 bool con_is_floating(Con *con) {
204 LOG("checking if con %p is floating\n", con);
205 return (con->floating >= FLOATING_AUTO_ON);
208 Con *con_by_window_id(xcb_window_t window) {
210 TAILQ_FOREACH(con, &all_cons, all_cons)
211 if (con->window != NULL && con->window->id == window)
216 Con *con_by_frame_id(xcb_window_t frame) {
218 TAILQ_FOREACH(con, &all_cons, all_cons)
219 if (con->frame == frame)
225 * Returns the first container which wants to swallow this window
229 Con *con_for_window(i3Window *window, Match **store_match) {
232 LOG("searching con for window %p\n", window);
233 LOG("class == %s\n", window->class_class);
235 TAILQ_FOREACH(con, &all_cons, all_cons)
236 TAILQ_FOREACH(match, &(con->swallow_head), matches) {
237 if (!match_matches_window(match, window))
239 if (store_match != NULL)
240 *store_match = match;
248 * Updates the percent attribute of the children of the given container. This
249 * function needs to be called when a window is added or removed from a
253 void con_fix_percent(Con *con, int action) {
256 TAILQ_FOREACH(child, &(con->nodes_head), nodes)
258 /* TODO: better document why this math works */
260 if (action == WINDOW_ADD)
261 fix = (1.0 - (1.0 / (children+1)));
263 fix = 1.0 / (1.0 - (1.0 / (children+1)));
265 TAILQ_FOREACH(child, &(con->nodes_head), nodes) {
266 if (child->percent <= 0.0)
268 child->percent *= fix;