2009-07-28 13:55:09 +02:00
|
|
|
|
/*
|
2010-04-13 16:43:08 +02:00
|
|
|
|
* vim:ts=4:sw=4:expandtab
|
2009-07-28 13:55:09 +02:00
|
|
|
|
*
|
|
|
|
|
* i3 - an improved dynamic tiling window manager
|
2010-04-13 16:43:08 +02:00
|
|
|
|
* © 2009-2010 Michael Stapelberg and contributors (see also: LICENSE)
|
2009-07-28 13:55:09 +02:00
|
|
|
|
*
|
|
|
|
|
* workspace.c: Functions for modifying workspaces
|
|
|
|
|
*
|
|
|
|
|
*/
|
2010-03-27 15:25:51 +01:00
|
|
|
|
#include "all.h"
|
|
|
|
|
|
2009-09-27 15:20:47 +02:00
|
|
|
|
/*
|
|
|
|
|
* Returns a pointer to the workspace with the given number (starting at 0),
|
|
|
|
|
* creating the workspace if necessary (by allocating the necessary amount of
|
|
|
|
|
* memory and initializing the data structures correctly).
|
|
|
|
|
*
|
|
|
|
|
*/
|
2011-03-14 00:56:04 +01:00
|
|
|
|
Con *workspace_get(const char *num, bool *created) {
|
2011-05-14 22:13:29 +02:00
|
|
|
|
Con *output, *workspace = NULL;
|
2010-04-13 16:43:08 +02:00
|
|
|
|
|
2011-02-21 01:55:36 +01:00
|
|
|
|
TAILQ_FOREACH(output, &(croot->nodes_head), nodes)
|
2011-05-14 22:13:29 +02:00
|
|
|
|
GREP_FIRST(workspace, output_get_content(output), !strcasecmp(child->name, num));
|
|
|
|
|
|
|
|
|
|
if (workspace == NULL) {
|
|
|
|
|
LOG("Creating new workspace \"%s\"\n", num);
|
|
|
|
|
/* unless an assignment is found, we will create this workspace on the current output */
|
|
|
|
|
output = con_get_output(focused);
|
|
|
|
|
/* look for assignments */
|
|
|
|
|
struct Workspace_Assignment *assignment;
|
|
|
|
|
TAILQ_FOREACH(assignment, &ws_assignments, ws_assignments) {
|
|
|
|
|
if (strcmp(assignment->name, num) != 0)
|
2011-01-05 00:26:23 +01:00
|
|
|
|
continue;
|
2010-04-13 16:43:08 +02:00
|
|
|
|
|
2011-05-14 22:13:29 +02:00
|
|
|
|
LOG("Found workspace assignment to output \"%s\"\n", assignment->output);
|
|
|
|
|
GREP_FIRST(output, croot, !strcmp(child->name, assignment->output));
|
2011-02-21 01:55:36 +01:00
|
|
|
|
break;
|
2010-03-27 15:25:51 +01:00
|
|
|
|
}
|
2011-02-21 01:55:36 +01:00
|
|
|
|
Con *content = output_get_content(output);
|
|
|
|
|
LOG("got output %p with content %p\n", output, content);
|
2010-11-21 23:35:49 +01:00
|
|
|
|
/* We need to attach this container after setting its type. con_attach
|
|
|
|
|
* will handle CT_WORKSPACEs differently */
|
2011-06-02 17:21:38 +02:00
|
|
|
|
workspace = con_new(NULL, NULL);
|
2010-11-14 16:41:46 +01:00
|
|
|
|
char *name;
|
|
|
|
|
asprintf(&name, "[i3 con] workspace %s", num);
|
|
|
|
|
x_set_name(workspace, name);
|
|
|
|
|
free(name);
|
2010-05-31 00:11:11 +02:00
|
|
|
|
workspace->type = CT_WORKSPACE;
|
2011-01-04 22:38:33 +01:00
|
|
|
|
FREE(workspace->name);
|
|
|
|
|
workspace->name = sstrdup(num);
|
2010-11-21 23:35:49 +01:00
|
|
|
|
/* We set ->num to the number if this workspace’s name consists only of
|
|
|
|
|
* a positive number. Otherwise it’s a named ws and num will be -1. */
|
2011-09-05 22:21:10 +02:00
|
|
|
|
char *endptr = NULL;
|
|
|
|
|
long parsed_num = strtol(num, &endptr, 10);
|
2010-11-21 23:35:49 +01:00
|
|
|
|
if (parsed_num == LONG_MIN ||
|
|
|
|
|
parsed_num == LONG_MAX ||
|
2011-09-05 22:21:10 +02:00
|
|
|
|
parsed_num < 0 ||
|
|
|
|
|
endptr == num)
|
2010-11-21 23:35:49 +01:00
|
|
|
|
workspace->num = -1;
|
|
|
|
|
else workspace->num = parsed_num;
|
|
|
|
|
LOG("num = %d\n", workspace->num);
|
2011-03-16 11:56:51 +01:00
|
|
|
|
|
|
|
|
|
/* If default_orientation is set to NO_ORIENTATION we
|
|
|
|
|
* determine workspace orientation from workspace size.
|
|
|
|
|
* Otherwise we just set the orientation to default_orientation. */
|
|
|
|
|
if (config.default_orientation == NO_ORIENTATION) {
|
|
|
|
|
workspace->orientation = (output->rect.height > output->rect.width) ? VERT : HORIZ;
|
|
|
|
|
DLOG("Auto orientation. Output resolution set to (%d,%d), setting orientation to %d.\n",
|
|
|
|
|
workspace->rect.width, workspace->rect.height, workspace->orientation);
|
|
|
|
|
} else {
|
|
|
|
|
workspace->orientation = config.default_orientation;
|
|
|
|
|
}
|
|
|
|
|
|
2011-02-20 23:43:03 +01:00
|
|
|
|
con_attach(workspace, content, false);
|
2010-03-12 21:05:05 +01:00
|
|
|
|
|
2010-04-13 16:43:08 +02:00
|
|
|
|
ipc_send_event("workspace", I3_IPC_EVENT_WORKSPACE, "{\"change\":\"init\"}");
|
2011-03-14 00:56:04 +01:00
|
|
|
|
if (created != NULL)
|
|
|
|
|
*created = true;
|
|
|
|
|
}
|
|
|
|
|
else if (created != NULL) {
|
|
|
|
|
*created = false;
|
2010-04-13 16:43:08 +02:00
|
|
|
|
}
|
2009-09-27 14:00:54 +02:00
|
|
|
|
|
2010-04-13 16:43:08 +02:00
|
|
|
|
return workspace;
|
2009-09-27 14:00:54 +02:00
|
|
|
|
}
|
|
|
|
|
|
2009-08-02 22:31:52 +02:00
|
|
|
|
/*
|
|
|
|
|
* Returns true if the workspace is currently visible. Especially important for
|
|
|
|
|
* multi-monitor environments, as they can have multiple currenlty active
|
|
|
|
|
* workspaces.
|
|
|
|
|
*
|
|
|
|
|
*/
|
2010-11-12 17:34:13 +01:00
|
|
|
|
bool workspace_is_visible(Con *ws) {
|
|
|
|
|
Con *output = con_get_output(ws);
|
|
|
|
|
if (output == NULL)
|
|
|
|
|
return false;
|
2011-06-10 18:27:20 +02:00
|
|
|
|
Con *fs = con_get_fullscreen_con(output, CF_OUTPUT);
|
2010-11-12 17:34:13 +01:00
|
|
|
|
LOG("workspace visible? fs = %p, ws = %p\n", fs, ws);
|
|
|
|
|
return (fs == ws);
|
2009-08-02 22:31:52 +02:00
|
|
|
|
}
|
2010-03-27 15:25:51 +01:00
|
|
|
|
|
2010-09-01 18:11:01 +02:00
|
|
|
|
/*
|
|
|
|
|
* XXX: we need to clean up all this recursive walking code.
|
|
|
|
|
*
|
|
|
|
|
*/
|
|
|
|
|
Con *_get_sticky(Con *con, const char *sticky_group, Con *exclude) {
|
|
|
|
|
Con *current;
|
|
|
|
|
|
|
|
|
|
TAILQ_FOREACH(current, &(con->nodes_head), nodes) {
|
|
|
|
|
if (current != exclude &&
|
|
|
|
|
current->sticky_group != NULL &&
|
|
|
|
|
current->window != NULL &&
|
|
|
|
|
strcmp(current->sticky_group, sticky_group) == 0)
|
|
|
|
|
return current;
|
|
|
|
|
|
|
|
|
|
Con *recurse = _get_sticky(current, sticky_group, exclude);
|
|
|
|
|
if (recurse != NULL)
|
|
|
|
|
return recurse;
|
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
TAILQ_FOREACH(current, &(con->floating_head), floating_windows) {
|
|
|
|
|
if (current != exclude &&
|
|
|
|
|
current->sticky_group != NULL &&
|
|
|
|
|
current->window != NULL &&
|
|
|
|
|
strcmp(current->sticky_group, sticky_group) == 0)
|
|
|
|
|
return current;
|
|
|
|
|
|
|
|
|
|
Con *recurse = _get_sticky(current, sticky_group, exclude);
|
|
|
|
|
if (recurse != NULL)
|
|
|
|
|
return recurse;
|
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
return NULL;
|
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
/*
|
|
|
|
|
* Reassigns all child windows in sticky containers. Called when the user
|
|
|
|
|
* changes workspaces.
|
|
|
|
|
*
|
|
|
|
|
* XXX: what about sticky containers which contain containers?
|
|
|
|
|
*
|
|
|
|
|
*/
|
|
|
|
|
static void workspace_reassign_sticky(Con *con) {
|
|
|
|
|
Con *current;
|
|
|
|
|
/* 1: go through all containers */
|
|
|
|
|
|
|
|
|
|
/* handle all children and floating windows of this node */
|
|
|
|
|
TAILQ_FOREACH(current, &(con->nodes_head), nodes) {
|
|
|
|
|
if (current->sticky_group == NULL) {
|
|
|
|
|
workspace_reassign_sticky(current);
|
|
|
|
|
continue;
|
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
LOG("Ah, this one is sticky: %s / %p\n", current->name, current);
|
|
|
|
|
/* 2: find a window which we can re-assign */
|
|
|
|
|
Con *output = con_get_output(current);
|
|
|
|
|
Con *src = _get_sticky(output, current->sticky_group, current);
|
|
|
|
|
|
|
|
|
|
if (src == NULL) {
|
|
|
|
|
LOG("No window found for this sticky group\n");
|
|
|
|
|
workspace_reassign_sticky(current);
|
|
|
|
|
continue;
|
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
x_move_win(src, current);
|
|
|
|
|
current->window = src->window;
|
|
|
|
|
current->mapped = true;
|
|
|
|
|
src->window = NULL;
|
|
|
|
|
src->mapped = false;
|
|
|
|
|
|
|
|
|
|
x_reparent_child(current, src);
|
|
|
|
|
|
|
|
|
|
LOG("re-assigned window from src %p to dest %p\n", src, current);
|
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
TAILQ_FOREACH(current, &(con->floating_head), floating_windows)
|
|
|
|
|
workspace_reassign_sticky(current);
|
|
|
|
|
}
|
2009-08-08 19:51:51 +02:00
|
|
|
|
|
2011-10-02 23:03:16 +02:00
|
|
|
|
|
|
|
|
|
static void _workspace_show(Con *workspace, bool changed_num_workspaces) {
|
2011-10-02 17:54:23 +02:00
|
|
|
|
Con *current, *old = NULL;
|
2011-01-08 00:38:10 +01:00
|
|
|
|
|
|
|
|
|
/* disable fullscreen for the other workspaces and get the workspace we are
|
|
|
|
|
* currently on. */
|
|
|
|
|
TAILQ_FOREACH(current, &(workspace->parent->nodes_head), nodes) {
|
|
|
|
|
if (current->fullscreen_mode == CF_OUTPUT)
|
|
|
|
|
old = current;
|
|
|
|
|
current->fullscreen_mode = CF_NONE;
|
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
/* enable fullscreen for the target workspace. If it happens to be the
|
|
|
|
|
* same one we are currently on anyways, we can stop here. */
|
|
|
|
|
workspace->fullscreen_mode = CF_OUTPUT;
|
2011-03-20 18:27:14 +01:00
|
|
|
|
if (workspace == con_get_workspace(focused)) {
|
|
|
|
|
DLOG("Not switching, already there.\n");
|
2010-05-09 23:20:49 +02:00
|
|
|
|
return;
|
2011-03-20 18:27:14 +01:00
|
|
|
|
}
|
2009-08-08 19:51:51 +02:00
|
|
|
|
|
2010-09-01 18:11:01 +02:00
|
|
|
|
workspace_reassign_sticky(workspace);
|
|
|
|
|
|
2010-04-13 16:43:08 +02:00
|
|
|
|
LOG("switching to %p\n", workspace);
|
2011-01-27 16:08:25 +01:00
|
|
|
|
Con *next = con_descend_focused(workspace);
|
2010-04-16 20:59:21 +02:00
|
|
|
|
|
2011-02-20 23:43:03 +01:00
|
|
|
|
if (old && TAILQ_EMPTY(&(old->nodes_head)) && TAILQ_EMPTY(&(old->floating_head))) {
|
2010-11-12 17:34:13 +01:00
|
|
|
|
/* check if this workspace is currently visible */
|
|
|
|
|
if (!workspace_is_visible(old)) {
|
|
|
|
|
LOG("Closing old workspace (%p / %s), it is empty\n", old, old->name);
|
2011-09-22 00:28:01 +02:00
|
|
|
|
tree_close(old, DONT_KILL_WINDOW, false, false);
|
2010-11-20 23:25:32 +01:00
|
|
|
|
ipc_send_event("workspace", I3_IPC_EVENT_WORKSPACE, "{\"change\":\"empty\"}");
|
2011-03-14 01:09:32 +01:00
|
|
|
|
changed_num_workspaces = true;
|
2010-11-12 17:34:13 +01:00
|
|
|
|
}
|
2010-04-16 20:59:21 +02:00
|
|
|
|
}
|
|
|
|
|
|
2011-08-11 21:57:22 +02:00
|
|
|
|
/* Memorize current output */
|
|
|
|
|
Con *old_output = con_get_output(focused);
|
|
|
|
|
|
2010-04-13 16:43:08 +02:00
|
|
|
|
con_focus(next);
|
|
|
|
|
workspace->fullscreen_mode = CF_OUTPUT;
|
|
|
|
|
LOG("focused now = %p / %s\n", focused, focused->name);
|
2010-11-20 23:04:01 +01:00
|
|
|
|
|
2011-08-11 21:57:22 +02:00
|
|
|
|
/* Set mouse pointer */
|
|
|
|
|
Con *new_output = con_get_output(focused);
|
|
|
|
|
if (old_output != new_output) {
|
2011-08-12 03:54:59 +02:00
|
|
|
|
x_set_warp_to(&next->rect);
|
2011-08-11 21:57:22 +02:00
|
|
|
|
}
|
|
|
|
|
|
2011-03-14 01:09:32 +01:00
|
|
|
|
/* Update the EWMH hints */
|
|
|
|
|
if (changed_num_workspaces)
|
|
|
|
|
ewmh_update_workarea();
|
|
|
|
|
ewmh_update_current_desktop();
|
|
|
|
|
|
2010-11-20 23:04:01 +01:00
|
|
|
|
ipc_send_event("workspace", I3_IPC_EVENT_WORKSPACE, "{\"change\":\"focus\"}");
|
2009-12-21 22:30:08 +01:00
|
|
|
|
}
|
|
|
|
|
|
2011-10-02 23:03:16 +02:00
|
|
|
|
/*
|
|
|
|
|
* Switches to the given workspace
|
|
|
|
|
*
|
|
|
|
|
*/
|
|
|
|
|
void workspace_show(Con *workspace) {
|
|
|
|
|
_workspace_show(workspace, false);
|
2011-10-02 17:54:23 +02:00
|
|
|
|
}
|
|
|
|
|
|
2011-10-02 23:03:16 +02:00
|
|
|
|
/*
|
|
|
|
|
* Looks up the workspace by name and switches to it.
|
|
|
|
|
*
|
|
|
|
|
*/
|
2011-10-02 17:54:23 +02:00
|
|
|
|
void workspace_show_by_name(const char *num) {
|
|
|
|
|
Con *workspace;
|
|
|
|
|
bool changed_num_workspaces;
|
|
|
|
|
workspace = workspace_get(num, &changed_num_workspaces);
|
2011-10-02 23:03:16 +02:00
|
|
|
|
_workspace_show(workspace, changed_num_workspaces);
|
2011-10-02 17:54:23 +02:00
|
|
|
|
}
|
|
|
|
|
|
2011-06-10 16:03:59 +02:00
|
|
|
|
/*
|
|
|
|
|
* Focuses the next workspace.
|
|
|
|
|
*
|
|
|
|
|
*/
|
2011-10-02 17:54:23 +02:00
|
|
|
|
Con* workspace_next() {
|
Modify workspace next/prev to account for workspaces on all outputs.
Generally, the traversal goes: numbered workspaces in order, and then
named workspaces in the order in which they appear in the tree.
Example:
Output 1: Output 2:
1 3 D C 2 4 B A
Traversal: 1, 2, 3, 4, D, C, B, A, 1, ...
Note, after the numbered workspaces, we traverse the named workspaces
from output 1, and then output 2, etc.
2011-08-03 23:41:40 +02:00
|
|
|
|
Con *current = con_get_workspace(focused);
|
|
|
|
|
Con *next = NULL;
|
|
|
|
|
Con *output;
|
|
|
|
|
|
|
|
|
|
if (current->num == -1) {
|
|
|
|
|
/* If currently a named workspace, find next named workspace. */
|
|
|
|
|
next = TAILQ_NEXT(current, nodes);
|
|
|
|
|
} else {
|
|
|
|
|
/* If currently a numbered workspace, find next numbered workspace. */
|
|
|
|
|
TAILQ_FOREACH(output, &(croot->nodes_head), nodes)
|
|
|
|
|
NODES_FOREACH(output_get_content(output)) {
|
|
|
|
|
if (child->type != CT_WORKSPACE)
|
|
|
|
|
continue;
|
|
|
|
|
if (child->num == -1)
|
|
|
|
|
break;
|
|
|
|
|
/* Need to check child against current and next because we are
|
|
|
|
|
* traversing multiple lists and thus are not guaranteed the
|
|
|
|
|
* relative order between the list of workspaces. */
|
|
|
|
|
if (current->num < child->num && (!next || child->num < next->num))
|
|
|
|
|
next = child;
|
|
|
|
|
}
|
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
/* Find next named workspace. */
|
|
|
|
|
if (!next) {
|
|
|
|
|
bool found_current = false;
|
|
|
|
|
TAILQ_FOREACH(output, &(croot->nodes_head), nodes)
|
|
|
|
|
NODES_FOREACH(output_get_content(output)) {
|
|
|
|
|
if (child->type != CT_WORKSPACE)
|
|
|
|
|
continue;
|
|
|
|
|
if (child == current) {
|
|
|
|
|
found_current = 1;
|
|
|
|
|
} else if (child->num == -1 && (current->num != -1 || found_current)) {
|
|
|
|
|
next = child;
|
2011-10-02 17:54:23 +02:00
|
|
|
|
goto workspace_next_end;
|
Modify workspace next/prev to account for workspaces on all outputs.
Generally, the traversal goes: numbered workspaces in order, and then
named workspaces in the order in which they appear in the tree.
Example:
Output 1: Output 2:
1 3 D C 2 4 B A
Traversal: 1, 2, 3, 4, D, C, B, A, 1, ...
Note, after the numbered workspaces, we traverse the named workspaces
from output 1, and then output 2, etc.
2011-08-03 23:41:40 +02:00
|
|
|
|
}
|
|
|
|
|
}
|
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
/* Find first workspace. */
|
|
|
|
|
if (!next) {
|
|
|
|
|
TAILQ_FOREACH(output, &(croot->nodes_head), nodes)
|
|
|
|
|
NODES_FOREACH(output_get_content(output)) {
|
|
|
|
|
if (child->type != CT_WORKSPACE)
|
|
|
|
|
continue;
|
|
|
|
|
if (!next || (child->num != -1 && child->num < next->num))
|
|
|
|
|
next = child;
|
|
|
|
|
}
|
|
|
|
|
}
|
2011-10-02 17:54:23 +02:00
|
|
|
|
workspace_next_end:
|
|
|
|
|
return next;
|
2011-06-10 16:03:59 +02:00
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
/*
|
|
|
|
|
* Focuses the previous workspace.
|
|
|
|
|
*
|
|
|
|
|
*/
|
2011-10-02 17:54:23 +02:00
|
|
|
|
Con* workspace_prev() {
|
Modify workspace next/prev to account for workspaces on all outputs.
Generally, the traversal goes: numbered workspaces in order, and then
named workspaces in the order in which they appear in the tree.
Example:
Output 1: Output 2:
1 3 D C 2 4 B A
Traversal: 1, 2, 3, 4, D, C, B, A, 1, ...
Note, after the numbered workspaces, we traverse the named workspaces
from output 1, and then output 2, etc.
2011-08-03 23:41:40 +02:00
|
|
|
|
Con *current = con_get_workspace(focused);
|
|
|
|
|
Con *prev = NULL;
|
|
|
|
|
Con *output;
|
|
|
|
|
|
|
|
|
|
if (current->num == -1) {
|
|
|
|
|
/* If named workspace, find previous named workspace. */
|
|
|
|
|
prev = TAILQ_PREV(current, nodes_head, nodes);
|
|
|
|
|
if (prev && prev->num != -1)
|
|
|
|
|
prev = NULL;
|
|
|
|
|
} else {
|
|
|
|
|
/* If numbered workspace, find previous numbered workspace. */
|
|
|
|
|
TAILQ_FOREACH_REVERSE(output, &(croot->nodes_head), nodes_head, nodes)
|
|
|
|
|
NODES_FOREACH_REVERSE(output_get_content(output)) {
|
|
|
|
|
if (child->type != CT_WORKSPACE || child->num == -1)
|
|
|
|
|
continue;
|
|
|
|
|
/* Need to check child against current and previous because we
|
|
|
|
|
* are traversing multiple lists and thus are not guaranteed
|
|
|
|
|
* the relative order between the list of workspaces. */
|
|
|
|
|
if (current->num > child->num && (!prev || child->num > prev->num))
|
|
|
|
|
prev = child;
|
|
|
|
|
}
|
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
/* Find previous named workspace. */
|
|
|
|
|
if (!prev) {
|
|
|
|
|
bool found_current = false;
|
|
|
|
|
TAILQ_FOREACH_REVERSE(output, &(croot->nodes_head), nodes_head, nodes)
|
|
|
|
|
NODES_FOREACH_REVERSE(output_get_content(output)) {
|
|
|
|
|
if (child->type != CT_WORKSPACE)
|
|
|
|
|
continue;
|
|
|
|
|
if (child == current) {
|
|
|
|
|
found_current = 1;
|
|
|
|
|
} else if (child->num == -1 && (current->num != -1 || found_current)) {
|
|
|
|
|
prev = child;
|
2011-10-02 17:54:23 +02:00
|
|
|
|
goto workspace_prev_end;
|
Modify workspace next/prev to account for workspaces on all outputs.
Generally, the traversal goes: numbered workspaces in order, and then
named workspaces in the order in which they appear in the tree.
Example:
Output 1: Output 2:
1 3 D C 2 4 B A
Traversal: 1, 2, 3, 4, D, C, B, A, 1, ...
Note, after the numbered workspaces, we traverse the named workspaces
from output 1, and then output 2, etc.
2011-08-03 23:41:40 +02:00
|
|
|
|
}
|
|
|
|
|
}
|
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
/* Find last workspace. */
|
|
|
|
|
if (!prev) {
|
|
|
|
|
TAILQ_FOREACH_REVERSE(output, &(croot->nodes_head), nodes_head, nodes)
|
|
|
|
|
NODES_FOREACH_REVERSE(output_get_content(output)) {
|
|
|
|
|
if (child->type != CT_WORKSPACE)
|
|
|
|
|
continue;
|
|
|
|
|
if (!prev || child->num > prev->num)
|
|
|
|
|
prev = child;
|
|
|
|
|
}
|
|
|
|
|
}
|
2011-06-10 16:03:59 +02:00
|
|
|
|
|
2011-10-02 17:54:23 +02:00
|
|
|
|
workspace_prev_end:
|
|
|
|
|
return prev;
|
2011-06-10 16:03:59 +02:00
|
|
|
|
}
|
|
|
|
|
|
2010-06-02 17:51:58 +02:00
|
|
|
|
static bool get_urgency_flag(Con *con) {
|
|
|
|
|
Con *child;
|
|
|
|
|
TAILQ_FOREACH(child, &(con->nodes_head), nodes)
|
|
|
|
|
if (child->urgent || get_urgency_flag(child))
|
|
|
|
|
return true;
|
|
|
|
|
|
|
|
|
|
TAILQ_FOREACH(child, &(con->floating_head), floating_windows)
|
|
|
|
|
if (child->urgent || get_urgency_flag(child))
|
|
|
|
|
return true;
|
|
|
|
|
|
|
|
|
|
return false;
|
|
|
|
|
}
|
2009-08-08 19:51:51 +02:00
|
|
|
|
|
2009-09-06 22:40:11 +02:00
|
|
|
|
/*
|
|
|
|
|
* Goes through all clients on the given workspace and updates the workspace’s
|
|
|
|
|
* urgent flag accordingly.
|
|
|
|
|
*
|
|
|
|
|
*/
|
2010-06-02 17:51:58 +02:00
|
|
|
|
void workspace_update_urgent_flag(Con *ws) {
|
|
|
|
|
bool old_flag = ws->urgent;
|
|
|
|
|
ws->urgent = get_urgency_flag(ws);
|
|
|
|
|
DLOG("Workspace urgency flag changed from %d to %d\n", old_flag, ws->urgent);
|
2009-09-06 22:40:11 +02:00
|
|
|
|
|
2010-06-02 17:51:58 +02:00
|
|
|
|
if (old_flag != ws->urgent)
|
|
|
|
|
ipc_send_event("workspace", I3_IPC_EVENT_WORKSPACE, "{\"change\":\"urgent\"}");
|
2009-09-06 22:40:11 +02:00
|
|
|
|
}
|
2011-02-14 23:05:20 +01:00
|
|
|
|
|
2011-02-14 23:17:30 +01:00
|
|
|
|
/*
|
|
|
|
|
* 'Forces' workspace orientation by moving all cons into a new split-con with
|
|
|
|
|
* the same orientation as the workspace and then changing the workspace
|
|
|
|
|
* orientation.
|
|
|
|
|
*
|
|
|
|
|
*/
|
2011-02-14 23:05:20 +01:00
|
|
|
|
void ws_force_orientation(Con *ws, orientation_t orientation) {
|
|
|
|
|
/* 1: create a new split container */
|
2011-06-02 17:21:38 +02:00
|
|
|
|
Con *split = con_new(NULL, NULL);
|
2011-02-14 23:05:20 +01:00
|
|
|
|
split->parent = ws;
|
|
|
|
|
|
|
|
|
|
/* 2: copy layout and orientation from workspace */
|
|
|
|
|
split->layout = ws->layout;
|
|
|
|
|
split->orientation = ws->orientation;
|
|
|
|
|
|
|
|
|
|
Con *old_focused = TAILQ_FIRST(&(ws->focus_head));
|
|
|
|
|
|
|
|
|
|
/* 3: move the existing cons of this workspace below the new con */
|
|
|
|
|
DLOG("Moving cons\n");
|
|
|
|
|
while (!TAILQ_EMPTY(&(ws->nodes_head))) {
|
|
|
|
|
Con *child = TAILQ_FIRST(&(ws->nodes_head));
|
|
|
|
|
con_detach(child);
|
|
|
|
|
con_attach(child, split, true);
|
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
/* 4: switch workspace orientation */
|
|
|
|
|
ws->orientation = orientation;
|
|
|
|
|
|
|
|
|
|
/* 5: attach the new split container to the workspace */
|
|
|
|
|
DLOG("Attaching new split to ws\n");
|
|
|
|
|
con_attach(split, ws, false);
|
|
|
|
|
|
|
|
|
|
/* 6: fix the percentages */
|
|
|
|
|
con_fix_percent(ws);
|
|
|
|
|
|
|
|
|
|
if (old_focused)
|
|
|
|
|
con_focus(old_focused);
|
|
|
|
|
}
|
2011-06-02 17:21:38 +02:00
|
|
|
|
|
|
|
|
|
/*
|
|
|
|
|
* Called when a new con (with a window, not an empty or split con) should be
|
|
|
|
|
* attached to the workspace (for example when managing a new window or when
|
|
|
|
|
* moving an existing window to the workspace level).
|
|
|
|
|
*
|
|
|
|
|
* Depending on the workspace_layout setting, this function either returns the
|
|
|
|
|
* workspace itself (default layout) or creates a new stacked/tabbed con and
|
|
|
|
|
* returns that.
|
|
|
|
|
*
|
|
|
|
|
*/
|
|
|
|
|
Con *workspace_attach_to(Con *ws) {
|
|
|
|
|
DLOG("Attaching a window to workspace %p / %s\n", ws, ws->name);
|
|
|
|
|
|
|
|
|
|
if (config.default_layout == L_DEFAULT) {
|
|
|
|
|
DLOG("Default layout, just attaching it to the workspace itself.\n");
|
|
|
|
|
return ws;
|
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
DLOG("Non-default layout, creating a new split container\n");
|
|
|
|
|
/* 1: create a new split container */
|
|
|
|
|
Con *new = con_new(NULL, NULL);
|
|
|
|
|
new->parent = ws;
|
|
|
|
|
|
|
|
|
|
/* 2: set the requested layout on the split con */
|
|
|
|
|
new->layout = config.default_layout;
|
|
|
|
|
|
|
|
|
|
/* 3: While the layout is irrelevant in stacked/tabbed mode, it needs
|
|
|
|
|
* to be set. Otherwise, this con will not be interpreted as a split
|
|
|
|
|
* container. */
|
|
|
|
|
if (config.default_orientation == NO_ORIENTATION) {
|
|
|
|
|
new->orientation = (ws->rect.height > ws->rect.width) ? VERT : HORIZ;
|
|
|
|
|
} else {
|
|
|
|
|
new->orientation = config.default_orientation;
|
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
/* 4: attach the new split container to the workspace */
|
|
|
|
|
DLOG("Attaching new split %p to workspace %p\n", new, ws);
|
|
|
|
|
con_attach(new, ws, false);
|
|
|
|
|
|
|
|
|
|
return new;
|
|
|
|
|
}
|