4 * i3 - an improved dynamic tiling window manager
6 * © 2009 Michael Stapelberg and contributors
8 * See file LICENSE for license information.
10 * table.c: Functions/macros for easy modifying/accessing of _the_ table (defining our
18 #include <sys/types.h>
28 int current_workspace = 0;
29 Workspace workspaces[10];
30 /* Convenience pointer to the current workspace */
31 Workspace *c_ws = &workspaces[0];
40 memset(workspaces, 0, sizeof(workspaces));
42 for (int i = 0; i < 10; i++) {
43 workspaces[i].screen = NULL;
44 workspaces[i].num = i;
45 SLIST_INIT(&(workspaces[i].dock_clients));
46 expand_table_cols(&(workspaces[i]));
47 expand_table_rows(&(workspaces[i]));
51 static void new_container(Workspace *workspace, Container **container, int col, int row) {
53 new = *container = calloc(sizeof(Container), 1);
54 CIRCLEQ_INIT(&(new->clients));
59 new->workspace = workspace;
63 * Add one row to the table
66 void expand_table_rows(Workspace *workspace) {
69 for (int c = 0; c < workspace->cols; c++) {
70 workspace->table[c] = realloc(workspace->table[c], sizeof(Container*) * workspace->rows);
71 new_container(workspace, &(workspace->table[c][workspace->rows-1]), c, workspace->rows-1);
76 * Add one column to the table
79 void expand_table_cols(Workspace *workspace) {
82 workspace->table = realloc(workspace->table, sizeof(Container**) * workspace->cols);
83 workspace->table[workspace->cols-1] = calloc(sizeof(Container*) * workspace->rows, 1);
84 for (int c = 0; c < workspace->rows; c++)
85 new_container(workspace, &(workspace->table[workspace->cols-1][c]), workspace->cols-1, c);
89 * Inserts one column at the table’s head
92 void expand_table_cols_at_head(Workspace *workspace) {
95 workspace->table = realloc(workspace->table, sizeof(Container**) * workspace->cols);
96 workspace->table[workspace->cols-1] = calloc(sizeof(Container*) * workspace->rows, 1);
98 /* Move the other columns */
99 for (int rows = 0; rows < workspace->rows; rows++)
100 for (int cols = workspace->cols - 1; cols > 0; cols--) {
101 LOG("Moving col %d to %d\n", cols-1, cols);
102 workspace->table[cols][rows] = workspace->table[cols-1][rows];
103 workspace->table[cols][rows]->col = cols;
106 for (int rows = 0; rows < workspace->rows; rows++)
107 new_container(workspace, &(workspace->table[0][rows]), 0, rows);
111 * Shrinks the table by one column.
113 * The containers themselves are freed in move_columns_from() or move_rows_from(). Therefore, this
114 * function may only be called from move_*() or after making sure that the containers are freed
118 static void shrink_table_cols(Workspace *workspace) {
121 /* Free the container-pointers */
122 free(workspace->table[workspace->cols]);
124 /* Re-allocate the table */
125 workspace->table = realloc(workspace->table, sizeof(Container**) * workspace->cols);
129 * See shrink_table_cols()
132 static void shrink_table_rows(Workspace *workspace) {
134 for (int cols = 0; cols < workspace->cols; cols++)
135 workspace->table[cols] = realloc(workspace->table[cols], sizeof(Container*) * workspace->rows);
140 * Performs simple bounds checking for the given column/row
143 bool cell_exists(int col, int row) {
144 return (col >= 0 && col < c_ws->cols) &&
145 (row >= 0 && row < c_ws->rows);
148 static void free_container(xcb_connection_t *conn, Workspace *workspace, int col, int row) {
149 Container *old_container = workspace->table[col][row];
151 if (old_container->mode == MODE_STACK)
152 leave_stack_mode(conn, old_container);
157 static void move_columns_from(xcb_connection_t *conn, Workspace *workspace, int cols) {
158 LOG("firstly freeing \n");
160 /* Free the columns which are cleaned up */
161 for (int rows = 0; rows < workspace->rows; rows++)
162 free_container(conn, workspace, cols-1, rows);
164 for (; cols < workspace->cols; cols++)
165 for (int rows = 0; rows < workspace->rows; rows++) {
166 LOG("at col = %d, row = %d\n", cols, rows);
167 Container *new_container = workspace->table[cols][rows];
169 LOG("moving cols = %d to cols -1 = %d\n", cols, cols-1);
170 workspace->table[cols-1][rows] = new_container;
172 new_container->row = rows;
173 new_container->col = cols-1;
177 static void move_rows_from(xcb_connection_t *conn, Workspace *workspace, int rows) {
178 for (int cols = 0; cols < workspace->cols; cols++)
179 free_container(conn, workspace, cols, rows-1);
181 for (; rows < workspace->rows; rows++)
182 for (int cols = 0; cols < workspace->cols; cols++) {
183 Container *new_container = workspace->table[cols][rows];
185 LOG("moving rows = %d to rows -1 = %d\n", rows, rows - 1);
186 workspace->table[cols][rows-1] = new_container;
188 new_container->row = rows-1;
189 new_container->col = cols;
193 void dump_table(xcb_connection_t *conn, Workspace *workspace) {
194 LOG("dump_table()\n");
195 FOR_TABLE(workspace) {
196 Container *con = workspace->table[cols][rows];
198 LOG("at col=%d, row=%d\n", cols, rows);
199 LOG("currently_focused = %p\n", con->currently_focused);
201 CIRCLEQ_FOREACH(loop, &(con->clients), clients) {
202 LOG("got client %08x / %s\n", loop->child, loop->name);
210 * Shrinks the table by "compacting" it, that is, removing completely empty rows/columns
213 void cleanup_table(xcb_connection_t *conn, Workspace *workspace) {
214 LOG("cleanup_table()\n");
216 /* Check for empty columns if we got more than one column */
217 for (int cols = 0; (workspace->cols > 1) && (cols < workspace->cols);) {
218 bool completely_empty = true;
219 for (int rows = 0; rows < workspace->rows; rows++)
220 if (workspace->table[cols][rows]->currently_focused != NULL) {
221 completely_empty = false;
224 if (completely_empty) {
225 LOG("Removing completely empty column %d\n", cols);
226 if (cols < (workspace->cols - 1))
227 move_columns_from(conn, workspace, cols+1);
229 for (int rows = 0; rows < workspace->rows; rows++)
230 free_container(conn, workspace, cols, rows);
232 shrink_table_cols(workspace);
234 if (workspace->current_col >= workspace->cols)
235 workspace->current_col = workspace->cols - 1;
239 /* Check for empty rows if we got more than one row */
240 for (int rows = 0; (workspace->rows > 1) && (rows < workspace->rows);) {
241 bool completely_empty = true;
242 LOG("Checking row %d\n", rows);
243 for (int cols = 0; cols < workspace->cols; cols++)
244 if (workspace->table[cols][rows]->currently_focused != NULL) {
245 completely_empty = false;
248 if (completely_empty) {
249 LOG("Removing completely empty row %d\n", rows);
250 if (rows < (workspace->rows - 1))
251 move_rows_from(conn, workspace, rows+1);
253 for (int cols = 0; cols < workspace->cols; cols++)
254 free_container(conn, workspace, cols, rows);
256 shrink_table_rows(workspace);
258 if (workspace->current_row >= workspace->rows)
259 workspace->current_row = workspace->rows - 1;
263 /* Boundary checking for current_col and current_row */
264 if (current_col >= c_ws->cols)
265 current_col = c_ws->cols-1;
267 if (current_row >= c_ws->rows)
268 current_row = c_ws->rows-1;
270 if (CUR_CELL->currently_focused != NULL)
271 set_focus(conn, CUR_CELL->currently_focused);
275 * Fixes col/rowspan (makes sure there are no overlapping windows)
278 void fix_colrowspan(xcb_connection_t *conn, Workspace *workspace) {
279 LOG("Fixing col/rowspan\n");
281 FOR_TABLE(workspace) {
282 Container *con = workspace->table[cols][rows];
283 if (con->colspan > 1) {
284 LOG("gots one with colspan %d\n", con->colspan);
285 while (con->colspan > 1 &&
286 workspace->table[cols + (con->colspan - 1)][rows]->currently_focused != NULL)
288 LOG("fixed it to %d\n", con->colspan);
290 if (con->rowspan > 1) {
291 LOG("gots one with rowspan %d\n", con->rowspan);
292 while (con->rowspan > 1 &&
293 workspace->table[cols][rows + (con->rowspan - 1)]->currently_focused != NULL)
295 LOG("fixed it to %d\n", con->rowspan);