rev |
line source |
arg@327
|
1 /*
|
arg@327
|
2 * (C)opyright MMVI Anselm R. Garbe <garbeam at gmail dot com>
|
arg@327
|
3 * See LICENSE file for license details.
|
arg@327
|
4 */
|
arg@327
|
5 #include "dwm.h"
|
arg@327
|
6
|
arg@380
|
7 /* static */
|
arg@380
|
8
|
arg@382
|
9 static Client *
|
arg@461
|
10 minclient() {
|
arg@382
|
11 Client *c, *min;
|
arg@382
|
12
|
arg@443
|
13 if((clients && clients->isfloat) || arrange == dofloat)
|
arg@443
|
14 return clients; /* don't touch floating order */
|
arg@382
|
15 for(min = c = clients; c; c = c->next)
|
arg@382
|
16 if(c->weight < min->weight)
|
arg@382
|
17 min = c;
|
arg@382
|
18 return min;
|
arg@382
|
19 }
|
arg@382
|
20
|
arg@480
|
21 static Client *
|
arg@480
|
22 nexttiled(Client *c) {
|
arg@480
|
23 for(c = getnext(c); c && c->isfloat; c = getnext(c->next));
|
arg@480
|
24 return c;
|
arg@480
|
25 }
|
arg@480
|
26
|
arg@442
|
27 static void
|
arg@461
|
28 reorder() {
|
arg@382
|
29 Client *c, *newclients, *tail;
|
arg@380
|
30
|
arg@382
|
31 newclients = tail = NULL;
|
arg@382
|
32 while((c = minclient())) {
|
arg@381
|
33 detach(c);
|
arg@382
|
34 if(tail) {
|
arg@382
|
35 c->prev = tail;
|
arg@382
|
36 tail->next = c;
|
arg@382
|
37 tail = c;
|
arg@381
|
38 }
|
arg@381
|
39 else
|
arg@382
|
40 tail = newclients = c;
|
arg@380
|
41 }
|
arg@382
|
42 clients = newclients;
|
arg@380
|
43 }
|
arg@380
|
44
|
arg@480
|
45 static void
|
arg@480
|
46 togglemax(Client *c)
|
arg@480
|
47 {
|
arg@481
|
48 XEvent ev;
|
arg@480
|
49 if((c->ismax = !c->ismax)) {
|
arg@480
|
50 c->rx = c->x; c->x = sx;
|
arg@480
|
51 c->ry = c->y; c->y = bh;
|
arg@480
|
52 c->rw = c->w; c->w = sw;
|
arg@481
|
53 c->rh = c->h; c->h = sh - bh;
|
arg@480
|
54 }
|
arg@480
|
55 else {
|
arg@480
|
56 c->x = c->rx;
|
arg@480
|
57 c->y = c->ry;
|
arg@481
|
58 c->w = c->rw;
|
arg@481
|
59 c->h = c->rh;
|
arg@480
|
60 }
|
arg@480
|
61 resize(c, True, TopLeft);
|
arg@480
|
62 while(XCheckMaskEvent(dpy, EnterWindowMask, &ev));
|
arg@430
|
63 }
|
arg@430
|
64
|
arg@327
|
65 /* extern */
|
arg@327
|
66
|
arg@327
|
67 void (*arrange)(Arg *) = DEFMODE;
|
arg@327
|
68
|
arg@327
|
69 void
|
arg@461
|
70 detach(Client *c) {
|
arg@378
|
71 if(c->prev)
|
arg@378
|
72 c->prev->next = c->next;
|
arg@378
|
73 if(c->next)
|
arg@378
|
74 c->next->prev = c->prev;
|
arg@378
|
75 if(c == clients)
|
arg@378
|
76 clients = c->next;
|
arg@378
|
77 c->next = c->prev = NULL;
|
arg@378
|
78 }
|
arg@378
|
79
|
arg@378
|
80 void
|
arg@461
|
81 dofloat(Arg *arg) {
|
arg@402
|
82 Client *c;
|
arg@400
|
83
|
arg@327
|
84 for(c = clients; c; c = c->next) {
|
arg@327
|
85 if(isvisible(c)) {
|
arg@327
|
86 resize(c, True, TopLeft);
|
arg@327
|
87 }
|
arg@327
|
88 else
|
arg@327
|
89 ban(c);
|
arg@327
|
90 }
|
arg@446
|
91 if(!sel || !isvisible(sel)) {
|
arg@450
|
92 for(c = stack; c && !isvisible(c); c = c->snext);
|
arg@450
|
93 focus(c);
|
arg@446
|
94 }
|
arg@327
|
95 restack();
|
arg@327
|
96 }
|
arg@327
|
97
|
arg@327
|
98 void
|
arg@461
|
99 dotile(Arg *arg) {
|
arg@327
|
100 int h, i, n, w;
|
arg@402
|
101 Client *c;
|
arg@400
|
102
|
arg@327
|
103 w = sw - mw;
|
arg@430
|
104 for(n = 0, c = clients; c; c = c->next)
|
arg@480
|
105 if(isvisible(c)) {
|
arg@480
|
106 if(c->isfloat) {
|
arg@480
|
107 if(c->ismax)
|
arg@480
|
108 togglemax(c);
|
arg@480
|
109 }
|
arg@480
|
110 else
|
arg@480
|
111 n++;
|
arg@480
|
112 }
|
arg@327
|
113
|
arg@327
|
114 if(n > 1)
|
arg@327
|
115 h = (sh - bh) / (n - 1);
|
arg@327
|
116 else
|
arg@327
|
117 h = sh - bh;
|
arg@327
|
118
|
arg@327
|
119 for(i = 0, c = clients; c; c = c->next) {
|
arg@327
|
120 if(isvisible(c)) {
|
arg@327
|
121 if(c->isfloat) {
|
arg@327
|
122 resize(c, True, TopLeft);
|
arg@327
|
123 continue;
|
arg@327
|
124 }
|
arg@327
|
125 if(n == 1) {
|
arg@327
|
126 c->x = sx;
|
arg@327
|
127 c->y = sy + bh;
|
arg@327
|
128 c->w = sw - 2;
|
arg@327
|
129 c->h = sh - 2 - bh;
|
arg@327
|
130 }
|
arg@327
|
131 else if(i == 0) {
|
arg@327
|
132 c->x = sx;
|
arg@327
|
133 c->y = sy + bh;
|
arg@327
|
134 c->w = mw - 2;
|
arg@327
|
135 c->h = sh - 2 - bh;
|
arg@327
|
136 }
|
arg@327
|
137 else if(h > bh) {
|
arg@327
|
138 c->x = sx + mw;
|
arg@327
|
139 c->y = sy + (i - 1) * h + bh;
|
arg@327
|
140 c->w = w - 2;
|
arg@327
|
141 if(i + 1 == n)
|
arg@327
|
142 c->h = sh - c->y - 2;
|
arg@327
|
143 else
|
arg@327
|
144 c->h = h - 2;
|
arg@327
|
145 }
|
arg@327
|
146 else { /* fallback if h < bh */
|
arg@327
|
147 c->x = sx + mw;
|
arg@327
|
148 c->y = sy + bh;
|
arg@327
|
149 c->w = w - 2;
|
arg@327
|
150 c->h = sh - 2 - bh;
|
arg@327
|
151 }
|
arg@327
|
152 resize(c, False, TopLeft);
|
arg@327
|
153 i++;
|
arg@327
|
154 }
|
arg@327
|
155 else
|
arg@327
|
156 ban(c);
|
arg@327
|
157 }
|
arg@446
|
158 if(!sel || !isvisible(sel)) {
|
arg@450
|
159 for(c = stack; c && !isvisible(c); c = c->snext);
|
arg@450
|
160 focus(c);
|
arg@446
|
161 }
|
arg@327
|
162 restack();
|
arg@327
|
163 }
|
arg@327
|
164
|
arg@327
|
165 void
|
arg@461
|
166 focusnext(Arg *arg) {
|
arg@327
|
167 Client *c;
|
arg@327
|
168
|
arg@327
|
169 if(!sel)
|
arg@327
|
170 return;
|
arg@327
|
171
|
arg@327
|
172 if(!(c = getnext(sel->next)))
|
arg@327
|
173 c = getnext(clients);
|
arg@327
|
174 if(c) {
|
arg@327
|
175 focus(c);
|
arg@327
|
176 restack();
|
arg@327
|
177 }
|
arg@327
|
178 }
|
arg@327
|
179
|
arg@327
|
180 void
|
arg@461
|
181 focusprev(Arg *arg) {
|
arg@327
|
182 Client *c;
|
arg@327
|
183
|
arg@327
|
184 if(!sel)
|
arg@327
|
185 return;
|
arg@327
|
186
|
arg@327
|
187 if(!(c = getprev(sel->prev))) {
|
arg@327
|
188 for(c = clients; c && c->next; c = c->next);
|
arg@327
|
189 c = getprev(c);
|
arg@327
|
190 }
|
arg@327
|
191 if(c) {
|
arg@327
|
192 focus(c);
|
arg@327
|
193 restack();
|
arg@327
|
194 }
|
arg@327
|
195 }
|
arg@327
|
196
|
arg@420
|
197 Bool
|
arg@461
|
198 isvisible(Client *c) {
|
arg@420
|
199 unsigned int i;
|
arg@420
|
200
|
arg@420
|
201 for(i = 0; i < ntags; i++)
|
arg@420
|
202 if(c->tags[i] && seltag[i])
|
arg@420
|
203 return True;
|
arg@420
|
204 return False;
|
arg@420
|
205 }
|
arg@420
|
206
|
arg@415
|
207 void
|
arg@461
|
208 resizecol(Arg *arg) {
|
arg@423
|
209 unsigned int n;
|
arg@423
|
210 Client *c;
|
arg@418
|
211
|
arg@430
|
212 for(n = 0, c = clients; c; c = c->next)
|
arg@430
|
213 if(isvisible(c) && !c->isfloat)
|
arg@423
|
214 n++;
|
arg@473
|
215 if(!sel || sel->isfloat || n < 2 || (arrange != dotile))
|
arg@415
|
216 return;
|
arg@423
|
217
|
arg@415
|
218 if(sel == getnext(clients)) {
|
arg@425
|
219 if(mw + arg->i > sw - 100 || mw + arg->i < 100)
|
arg@415
|
220 return;
|
arg@415
|
221 mw += arg->i;
|
arg@415
|
222 }
|
arg@415
|
223 else {
|
arg@425
|
224 if(mw - arg->i > sw - 100 || mw - arg->i < 100)
|
arg@415
|
225 return;
|
arg@415
|
226 mw -= arg->i;
|
arg@415
|
227 }
|
arg@415
|
228 arrange(NULL);
|
arg@415
|
229 }
|
arg@415
|
230
|
arg@327
|
231 void
|
arg@461
|
232 restack() {
|
arg@327
|
233 Client *c;
|
arg@327
|
234 XEvent ev;
|
arg@481
|
235
|
arg@437
|
236 if(!sel) {
|
arg@437
|
237 drawstatus();
|
arg@436
|
238 return;
|
arg@437
|
239 }
|
arg@436
|
240 if(sel->isfloat || arrange == dofloat) {
|
arg@436
|
241 XRaiseWindow(dpy, sel->win);
|
arg@436
|
242 XRaiseWindow(dpy, sel->twin);
|
arg@436
|
243 }
|
arg@446
|
244 if(arrange != dofloat)
|
arg@436
|
245 for(c = nexttiled(clients); c; c = nexttiled(c->next)) {
|
arg@436
|
246 XLowerWindow(dpy, c->twin);
|
arg@436
|
247 XLowerWindow(dpy, c->win);
|
arg@327
|
248 }
|
arg@327
|
249 drawall();
|
arg@327
|
250 XSync(dpy, False);
|
arg@327
|
251 while(XCheckMaskEvent(dpy, EnterWindowMask, &ev));
|
arg@327
|
252 }
|
arg@327
|
253
|
arg@327
|
254 void
|
arg@461
|
255 togglemode(Arg *arg) {
|
arg@333
|
256 arrange = (arrange == dofloat) ? dotile : dofloat;
|
arg@327
|
257 if(sel)
|
arg@327
|
258 arrange(NULL);
|
arg@327
|
259 else
|
arg@327
|
260 drawstatus();
|
arg@327
|
261 }
|
arg@327
|
262
|
arg@327
|
263 void
|
arg@461
|
264 toggleview(Arg *arg) {
|
arg@327
|
265 unsigned int i;
|
arg@327
|
266
|
arg@327
|
267 seltag[arg->i] = !seltag[arg->i];
|
arg@327
|
268 for(i = 0; i < ntags && !seltag[i]; i++);
|
arg@327
|
269 if(i == ntags)
|
arg@327
|
270 seltag[arg->i] = True; /* cannot toggle last view */
|
arg@381
|
271 reorder();
|
arg@327
|
272 arrange(NULL);
|
arg@327
|
273 }
|
arg@327
|
274
|
arg@327
|
275 void
|
arg@461
|
276 view(Arg *arg) {
|
arg@327
|
277 unsigned int i;
|
arg@327
|
278
|
arg@327
|
279 for(i = 0; i < ntags; i++)
|
arg@327
|
280 seltag[i] = False;
|
arg@327
|
281 seltag[arg->i] = True;
|
arg@381
|
282 reorder();
|
arg@327
|
283 arrange(NULL);
|
arg@327
|
284 }
|
arg@327
|
285
|
arg@327
|
286 void
|
arg@461
|
287 viewall(Arg *arg) {
|
arg@395
|
288 unsigned int i;
|
arg@395
|
289
|
arg@395
|
290 for(i = 0; i < ntags; i++)
|
arg@395
|
291 seltag[i] = True;
|
arg@397
|
292 reorder();
|
arg@395
|
293 arrange(NULL);
|
arg@395
|
294 }
|
arg@395
|
295
|
arg@395
|
296 void
|
arg@461
|
297 zoom(Arg *arg) {
|
arg@423
|
298 unsigned int n;
|
arg@423
|
299 Client *c;
|
arg@473
|
300
|
arg@473
|
301 if(!sel)
|
arg@473
|
302 return;
|
arg@473
|
303
|
arg@473
|
304 if(sel->isfloat || (arrange == dofloat)) {
|
arg@480
|
305 togglemax(sel);
|
arg@473
|
306 return;
|
arg@473
|
307 }
|
arg@327
|
308
|
arg@430
|
309 for(n = 0, c = clients; c; c = c->next)
|
arg@430
|
310 if(isvisible(c) && !c->isfloat)
|
arg@423
|
311 n++;
|
arg@473
|
312 if(n < 2 || (arrange != dotile))
|
arg@327
|
313 return;
|
arg@327
|
314
|
arg@430
|
315 if((c = sel) == nexttiled(clients))
|
arg@433
|
316 if(!(c = nexttiled(c->next)))
|
arg@429
|
317 return;
|
arg@443
|
318 detach(c);
|
arg@443
|
319 if(clients)
|
arg@443
|
320 clients->prev = c;
|
arg@443
|
321 c->next = clients;
|
arg@443
|
322 clients = c;
|
arg@378
|
323 focus(c);
|
arg@327
|
324 arrange(NULL);
|
arg@327
|
325 }
|