]> Dogcows Code - chaz/openbox/blob - openbox/stacking.c
add some comments and asserts to make sure I don't ever add this bug again
[chaz/openbox] / openbox / stacking.c
1 #include "openbox.h"
2 #include "prop.h"
3 #include "focus.h"
4 #include "client.h"
5 #include "group.h"
6 #include "frame.h"
7 #include "window.h"
8 #include <glib.h>
9
10 GList *stacking_list = NULL;
11
12 void stacking_set_list()
13 {
14 Window *windows = NULL;
15 GList *it;
16 guint i = 0;
17
18 /* on shutdown, don't update the properties, so that we can read it back
19 in on startup and re-stack the windows as they were before we shut down
20 */
21 if (ob_state == State_Exiting) return;
22
23 /* create an array of the window ids (from bottom to top,
24 reverse order!) */
25 if (stacking_list) {
26 windows = g_new(Window, g_list_length(stacking_list));
27 for (it = g_list_last(stacking_list); it; it = g_list_previous(it)) {
28 if (WINDOW_IS_CLIENT(it->data))
29 windows[i++] = WINDOW_AS_CLIENT(it->data)->window;
30 }
31 }
32
33 PROP_SETA32(ob_root, net_client_list_stacking, window,
34 (guint32*)windows, i);
35
36 g_free(windows);
37 }
38
39 static void do_restack(GList *wins, GList *before)
40 {
41 GList *it, *next;
42 Window *win;
43 int i;
44
45 /* pls only restack stuff in the same layer at a time */
46 for (it = wins; it; it = next) {
47 next = g_list_next(it);
48 if (!next) break;
49 g_assert (window_layer(it->data) == window_layer(next->data));
50 }
51
52
53 win = g_new(Window, g_list_length(wins) + 1);
54
55 if (before == stacking_list)
56 win[0] = focus_backup;
57 else if (!before)
58 win[0] = window_top(g_list_last(stacking_list)->data);
59 else
60 win[0] = window_top(g_list_previous(before)->data);
61
62 for (i = 1, it = wins; it; ++i, it = g_list_next(it)) {
63 win[i] = window_top(it->data);
64 g_assert(win[i] != None); /* better not call stacking shit before
65 setting your top level window value */
66 stacking_list = g_list_insert_before(stacking_list, before, it->data);
67 }
68
69 /* XXX some debug checking of the stacking list's order */
70 for (it = stacking_list; ; it = next) {
71 next = g_list_next(it);
72 if (!next) break;
73 g_assert(window_layer(it->data) >= window_layer(next->data));
74 }
75
76 XRestackWindows(ob_display, win, i);
77 g_free(win);
78
79 stacking_set_list();
80 }
81
82 static void raise(GList *wins)
83 {
84 GList *it;
85 GList *layer[NUM_STACKLAYER] = {NULL};
86 int i;
87
88 for (it = wins; it; it = g_list_next(it)) {
89 StackLayer l;
90
91 l = window_layer(it->data);
92 layer[l] = g_list_append(layer[l], it->data);
93 }
94
95 it = stacking_list;
96 for (i = NUM_STACKLAYER - 1; i >= 0; --i) {
97 if (layer[i]) {
98 for (; it; it = g_list_next(it)) {
99 /* look for the top of the layer */
100 if (window_layer(it->data) <= (StackLayer) i)
101 break;
102 }
103 do_restack(layer[i], it);
104 g_list_free(layer[i]);
105 }
106 }
107 }
108
109 static void lower(GList *wins)
110 {
111 GList *it;
112 GList *layer[NUM_STACKLAYER] = {NULL};
113 int i;
114
115 for (it = wins; it; it = g_list_next(it)) {
116 StackLayer l;
117
118 l = window_layer(it->data);
119 layer[l] = g_list_append(layer[l], it->data);
120 }
121
122 it = stacking_list;
123 for (i = NUM_STACKLAYER - 1; i >= 0; --i) {
124 if (layer[i]) {
125 for (; it; it = g_list_next(it)) {
126 /* look for the top of the next layer down */
127 if (window_layer(it->data) < (StackLayer) i)
128 break;
129 }
130 do_restack(layer[i], it);
131 g_list_free(layer[i]);
132 }
133 }
134 }
135
136 static GList *pick_windows(ObWindow *win)
137 {
138 GList *ret = NULL;
139 GList *it, *next;
140 GSList *sit;
141 Client *c;
142 int i, n;
143
144 if (!WINDOW_IS_CLIENT(win)) {
145 ret = g_list_append(ret, win);
146 stacking_list = g_list_remove(stacking_list, win);
147 return ret;
148 }
149
150 c = WINDOW_AS_CLIENT(win);
151
152 /* remove first so we can't run into ourself */
153 stacking_list = g_list_remove(stacking_list, win);
154
155 /* add transient children in their stacking order */
156 i = 0;
157 n = g_slist_length(c->transients);
158 for (it = stacking_list; i < n && it; it = next) {
159 next = g_list_next(it);
160 if ((sit = g_slist_find(c->transients, it->data))) {
161 ++i;
162 ret = g_list_concat(ret, pick_windows(sit->data));
163 it = stacking_list;
164 }
165 }
166
167 /* add itself */
168 ret = g_list_append(ret, win);
169
170 return ret;
171 }
172
173 static GList *pick_group_windows(ObWindow *win)
174 {
175 GList *ret = NULL;
176 GList *it, *next;
177 GSList *sit;
178 Client *c;
179 int i, n;
180
181 if (!WINDOW_IS_CLIENT(win))
182 return NULL;
183
184 c = WINDOW_AS_CLIENT(win);
185
186 /* add group members in their stacking order */
187 if (c->group) {
188 i = 0;
189 n = g_slist_length(c->group->members) - 1;
190 for (it = stacking_list; i < n && it; it = next) {
191 next = g_list_next(it);
192 if ((sit = g_slist_find(c->group->members, it->data))) {
193 ++i;
194 ret = g_list_concat(ret, pick_windows(sit->data));
195 it = stacking_list;
196 }
197 }
198 }
199 return ret;
200 }
201
202 static ObWindow *top_transient(ObWindow *window)
203 {
204 Client *client;
205
206 if (!WINDOW_IS_CLIENT(window))
207 return window;
208
209 client = WINDOW_AS_CLIENT(window);
210
211 /* move up the transient chain as far as possible */
212 if (client->transient_for) {
213 if (client->transient_for != TRAN_GROUP) {
214 return top_transient(CLIENT_AS_WINDOW(client->transient_for));
215 } else {
216 GSList *it;
217
218 for (it = client->group->members; it; it = it->next) {
219 Client *c = it->data;
220
221 /* checking transient_for prevents infinate loops! */
222 if (c != client && !c->transient_for)
223 break;
224 }
225 if (it)
226 return it->data;
227 }
228 }
229
230 return window;
231 }
232
233 void stacking_raise(ObWindow *window)
234 {
235 GList *wins;
236
237 window = top_transient(window);
238 wins = pick_windows(window);
239 wins = g_list_concat(wins, pick_group_windows(window));
240 raise(wins);
241 g_list_free(wins);
242 }
243
244 void stacking_lower(ObWindow *window)
245 {
246 GList *wins;
247
248 window = top_transient(window);
249 wins = pick_windows(window);
250 wins = g_list_concat(pick_group_windows(window), wins);
251 lower(wins);
252 g_list_free(wins);
253 }
254
255 void stacking_add(ObWindow *win)
256 {
257 StackLayer l;
258 GList *wins;
259
260 g_assert(focus_backup != None); /* make sure I dont break this in the
261 future */
262
263 l = window_layer(win);
264 wins = g_list_append(NULL, win); /* list of 1 element */
265
266 stacking_list = g_list_append(stacking_list, win);
267 stacking_raise(win);
268 }
269
270 void stacking_add_nonintrusive(ObWindow *win)
271 {
272 Client *client;
273 Client *parent = NULL;
274 GList *it_before = NULL;
275
276 if (!WINDOW_IS_CLIENT(win)) {
277 stacking_add(win); /* no special rules for others */
278 return;
279 }
280
281 client = WINDOW_AS_CLIENT(win);
282
283 /* insert above its highest parent */
284 if (client->transient_for) {
285 if (client->transient_for != TRAN_GROUP) {
286 parent = client->transient_for;
287 } else {
288 GSList *sit;
289 GList *it;
290
291 if (client->group)
292 for (it = stacking_list; !parent && it; it = it->next) {
293 if ((sit = g_slist_find(client->group->members, it->data)))
294 for (sit = client->group->members; !parent && sit;
295 sit = sit->next) {
296 Client *c = sit->data;
297 /* checking transient_for prevents infinate loops! */
298 if (sit->data == it->data && !c->transient_for)
299 parent = it->data;
300 }
301 }
302 }
303 }
304
305 if (!(it_before = g_list_find(stacking_list, parent))) {
306 /* no parent to put above, try find the focused client to go
307 under */
308 if (focus_client && focus_client->layer == client->layer) {
309 if ((it_before = g_list_find(stacking_list, focus_client)))
310 it_before = it_before->next;
311 }
312 }
313 if (!it_before) {
314 /* out of ideas, just add it normally... */
315 stacking_add(win);
316 } else {
317 GList *wins = g_list_append(NULL, win);
318 do_restack(wins, it_before);
319 g_list_free(wins);
320 }
321 }
This page took 0.047153 seconds and 5 git commands to generate.