2003-03-16 21:11:39 +00:00
|
|
|
#include "openbox.h"
|
|
|
|
#include "prop.h"
|
|
|
|
#include "focus.h"
|
|
|
|
#include "client.h"
|
2003-04-07 08:43:33 +00:00
|
|
|
#include "group.h"
|
2003-03-16 21:11:39 +00:00
|
|
|
#include "frame.h"
|
2003-05-11 19:44:33 +00:00
|
|
|
#include "window.h"
|
2003-03-16 21:11:39 +00:00
|
|
|
#include <glib.h>
|
|
|
|
|
|
|
|
GList *stacking_list = NULL;
|
|
|
|
|
|
|
|
void stacking_set_list()
|
|
|
|
{
|
|
|
|
Window *windows, *win_it;
|
|
|
|
GList *it;
|
|
|
|
guint size = g_list_length(stacking_list);
|
|
|
|
|
2003-03-25 00:38:55 +00:00
|
|
|
/* on shutdown, don't update the properties, so that we can read it back
|
|
|
|
in on startup and re-stack the windows as they were before we shut down
|
|
|
|
*/
|
|
|
|
if (ob_state == State_Exiting) return;
|
|
|
|
|
2003-03-16 21:11:39 +00:00
|
|
|
/* create an array of the window ids (from bottom to top,
|
|
|
|
reverse order!) */
|
|
|
|
if (size > 0) {
|
|
|
|
windows = g_new(Window, size);
|
|
|
|
win_it = windows;
|
2003-03-25 00:38:55 +00:00
|
|
|
for (it = g_list_last(stacking_list); it != NULL;
|
|
|
|
it = it->prev, ++win_it)
|
2003-05-11 19:44:33 +00:00
|
|
|
if (WINDOW_IS_CLIENT(it->data))
|
|
|
|
*win_it = window_top(it->data);
|
2003-03-16 21:11:39 +00:00
|
|
|
} else
|
|
|
|
windows = NULL;
|
|
|
|
|
2003-04-16 05:36:51 +00:00
|
|
|
PROP_SETA32(ob_root, net_client_list_stacking, window,
|
|
|
|
(guint32*)windows, size);
|
2003-03-16 21:11:39 +00:00
|
|
|
|
|
|
|
if (windows)
|
|
|
|
g_free(windows);
|
|
|
|
}
|
|
|
|
|
2003-04-13 23:24:36 +00:00
|
|
|
static GList *find_lowest_transient(Client *c)
|
|
|
|
{
|
|
|
|
GList *it;
|
|
|
|
GSList *sit;
|
|
|
|
|
|
|
|
for (it = g_list_last(stacking_list); it; it = it->prev)
|
|
|
|
for (sit = c->transients; sit; sit = sit->next)
|
|
|
|
if (it->data == sit->data) /* found a transient */
|
2003-04-14 01:11:32 +00:00
|
|
|
return it;
|
2003-04-13 23:24:36 +00:00
|
|
|
return NULL;
|
|
|
|
}
|
|
|
|
|
2003-05-11 19:44:33 +00:00
|
|
|
static void raise_recursive(ObWindow *window)
|
2003-03-16 21:11:39 +00:00
|
|
|
{
|
|
|
|
Window wins[2]; /* only ever restack 2 windows. */
|
2003-05-09 16:57:17 +00:00
|
|
|
GList *it, *low;
|
2003-04-13 23:24:36 +00:00
|
|
|
GSList *sit;
|
2003-03-16 21:11:39 +00:00
|
|
|
|
|
|
|
g_assert(stacking_list != NULL); /* this would be bad */
|
|
|
|
|
2003-05-11 19:44:33 +00:00
|
|
|
/* remove the window before looking so we can't run into ourselves and our
|
2003-04-14 01:11:32 +00:00
|
|
|
transients can't either. */
|
2003-05-11 19:44:33 +00:00
|
|
|
stacking_list = g_list_remove(stacking_list, window);
|
2003-04-14 01:11:32 +00:00
|
|
|
|
|
|
|
/* raise transients first */
|
2003-05-11 19:44:33 +00:00
|
|
|
if (WINDOW_IS_CLIENT(window)) {
|
|
|
|
Client *client = WINDOW_AS_CLIENT(window);
|
|
|
|
for (sit = client->transients; sit; sit = sit->next)
|
|
|
|
raise_recursive(sit->data);
|
|
|
|
}
|
2003-04-13 23:24:36 +00:00
|
|
|
|
|
|
|
/* find 'it' where it is the positiion in the stacking order where
|
2003-05-11 19:44:33 +00:00
|
|
|
'window' will be inserted *before* */
|
2003-04-13 23:24:36 +00:00
|
|
|
|
2003-05-11 19:44:33 +00:00
|
|
|
if (WINDOW_IS_CLIENT(window))
|
|
|
|
low = find_lowest_transient(WINDOW_AS_CLIENT(window));
|
|
|
|
else
|
|
|
|
low = NULL;
|
2003-05-09 16:57:17 +00:00
|
|
|
/* the stacking list is from highest to lowest */
|
|
|
|
for (it = g_list_last(stacking_list); it; it = it->prev) {
|
2003-05-11 19:44:33 +00:00
|
|
|
if (it == low || window_layer(window) < window_layer(it->data)) {
|
2003-05-09 16:57:17 +00:00
|
|
|
it = it->next;
|
|
|
|
break;
|
2003-04-13 23:24:36 +00:00
|
|
|
}
|
2003-05-09 16:57:17 +00:00
|
|
|
if (it == stacking_list)
|
|
|
|
break;
|
2003-03-16 21:11:39 +00:00
|
|
|
}
|
|
|
|
|
|
|
|
/*
|
|
|
|
if our new position is the top, we want to stack under the focus_backup.
|
|
|
|
otherwise, we want to stack under the previous window in the stack.
|
|
|
|
*/
|
|
|
|
if (it == stacking_list)
|
|
|
|
wins[0] = focus_backup;
|
|
|
|
else if (it != NULL)
|
2003-05-11 19:44:33 +00:00
|
|
|
wins[0] = window_top(it->prev->data);
|
2003-03-16 21:11:39 +00:00
|
|
|
else
|
2003-05-11 19:44:33 +00:00
|
|
|
wins[0] = window_top(g_list_last(stacking_list)->data);
|
|
|
|
wins[1] = window_top(window);
|
2003-03-16 21:11:39 +00:00
|
|
|
|
2003-05-11 19:44:33 +00:00
|
|
|
stacking_list = g_list_insert_before(stacking_list, it, window);
|
2003-03-16 21:11:39 +00:00
|
|
|
|
2003-03-28 08:06:23 +00:00
|
|
|
XRestackWindows(ob_display, wins, 2);
|
2003-04-14 01:11:32 +00:00
|
|
|
}
|
|
|
|
|
2003-05-11 19:44:33 +00:00
|
|
|
void stacking_raise(ObWindow *window)
|
2003-04-14 01:11:32 +00:00
|
|
|
{
|
|
|
|
g_assert(stacking_list != NULL); /* this would be bad */
|
|
|
|
|
2003-05-11 19:44:33 +00:00
|
|
|
if (WINDOW_IS_CLIENT(window)) {
|
|
|
|
Client *client = WINDOW_AS_CLIENT(window);
|
|
|
|
/* move up the transient chain as far as possible first */
|
|
|
|
while (client->transient_for) {
|
|
|
|
if (client->transient_for != TRAN_GROUP) {
|
|
|
|
client = client->transient_for;
|
|
|
|
} else {
|
|
|
|
GSList *it;
|
|
|
|
|
|
|
|
/* the check for TRAN_GROUP is to prevent an infinate loop with
|
|
|
|
2 transients of the same group at the head of the group's
|
|
|
|
members list */
|
|
|
|
for (it = client->group->members; it; it = it->next) {
|
|
|
|
Client *c = it->data;
|
|
|
|
|
|
|
|
if (c != client && c->transient_for != TRAN_GROUP) {
|
|
|
|
client = it->data;
|
|
|
|
break;
|
|
|
|
}
|
2003-04-14 01:11:32 +00:00
|
|
|
}
|
2003-05-11 19:44:33 +00:00
|
|
|
if (it == NULL) break;
|
2003-04-14 01:11:32 +00:00
|
|
|
}
|
|
|
|
}
|
2003-05-11 19:44:33 +00:00
|
|
|
window = CLIENT_AS_WINDOW(client);
|
2003-04-14 01:11:32 +00:00
|
|
|
}
|
|
|
|
|
2003-05-11 19:44:33 +00:00
|
|
|
raise_recursive(window);
|
2003-03-16 21:11:39 +00:00
|
|
|
|
|
|
|
stacking_set_list();
|
|
|
|
}
|
|
|
|
|
2003-05-11 19:44:33 +00:00
|
|
|
static void lower_recursive(ObWindow *window, ObWindow *above)
|
2003-03-16 21:11:39 +00:00
|
|
|
{
|
|
|
|
Window wins[2]; /* only ever restack 2 windows. */
|
|
|
|
GList *it;
|
2003-04-13 23:24:36 +00:00
|
|
|
GSList *sit;
|
2003-03-16 21:11:39 +00:00
|
|
|
|
2003-04-13 23:24:36 +00:00
|
|
|
/* find 'it' where 'it' is the position in the stacking_list where the
|
2003-05-11 19:44:33 +00:00
|
|
|
'window' will be placed *after* */
|
2003-04-07 08:43:33 +00:00
|
|
|
|
2003-04-14 01:11:32 +00:00
|
|
|
for (it = g_list_last(stacking_list); it != stacking_list; it = it->prev)
|
2003-05-11 19:44:33 +00:00
|
|
|
if (window_layer(window) <= window_layer(it->data) &&
|
|
|
|
it->data != above)
|
2003-04-13 23:24:36 +00:00
|
|
|
break;
|
2003-04-07 08:45:52 +00:00
|
|
|
|
2003-05-11 19:44:33 +00:00
|
|
|
if (it->data != window) { /* not already the bottom */
|
|
|
|
wins[0] = window_top(it->data);
|
|
|
|
wins[1] = window_top(window);
|
2003-03-16 21:11:39 +00:00
|
|
|
|
2003-05-11 19:44:33 +00:00
|
|
|
stacking_list = g_list_remove(stacking_list, window);
|
|
|
|
stacking_list = g_list_insert_before(stacking_list, it->next, window);
|
2003-04-13 23:24:36 +00:00
|
|
|
XRestackWindows(ob_display, wins, 2);
|
|
|
|
}
|
2003-03-16 21:11:39 +00:00
|
|
|
|
2003-05-11 19:44:33 +00:00
|
|
|
if (WINDOW_IS_CLIENT(window)) {
|
|
|
|
Client *client = WINDOW_AS_CLIENT(window);
|
|
|
|
for (sit = client->transients; sit; sit = sit->next)
|
|
|
|
lower_recursive(CLIENT_AS_WINDOW(sit->data), window);
|
|
|
|
}
|
2003-04-13 23:24:36 +00:00
|
|
|
}
|
|
|
|
|
2003-05-11 19:44:33 +00:00
|
|
|
void stacking_lower(ObWindow *window)
|
2003-04-13 23:24:36 +00:00
|
|
|
{
|
|
|
|
g_assert(stacking_list != NULL); /* this would be bad */
|
2003-04-07 08:43:33 +00:00
|
|
|
|
2003-05-11 19:44:33 +00:00
|
|
|
if (WINDOW_IS_CLIENT(window)) {
|
|
|
|
Client *client = WINDOW_AS_CLIENT(window);
|
|
|
|
/* move up the transient chain as far as possible first */
|
|
|
|
while (client->transient_for) {
|
|
|
|
if (client->transient_for != TRAN_GROUP) {
|
|
|
|
client = client->transient_for;
|
|
|
|
} else {
|
|
|
|
GSList *it;
|
|
|
|
|
|
|
|
/* the check for TRAN_GROUP is to prevent an infinate loop with
|
|
|
|
2 transients of the same group at the head of the group's
|
|
|
|
members list */
|
|
|
|
for (it = client->group->members; it; it = it->next) {
|
|
|
|
Client *c = it->data;
|
|
|
|
|
|
|
|
if (c != client && c->transient_for != TRAN_GROUP) {
|
|
|
|
client = it->data;
|
|
|
|
break;
|
|
|
|
}
|
2003-04-13 23:24:36 +00:00
|
|
|
}
|
2003-05-11 19:44:33 +00:00
|
|
|
if (it == NULL) break;
|
2003-04-13 23:24:36 +00:00
|
|
|
}
|
|
|
|
}
|
2003-05-11 19:44:33 +00:00
|
|
|
window = CLIENT_AS_WINDOW(client);
|
2003-03-16 21:11:39 +00:00
|
|
|
}
|
|
|
|
|
2003-05-11 19:44:33 +00:00
|
|
|
lower_recursive(window, NULL);
|
2003-04-14 01:11:32 +00:00
|
|
|
|
|
|
|
stacking_set_list();
|
2003-03-16 21:11:39 +00:00
|
|
|
}
|