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@487
|
10 minclient(void) {
|
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@487
|
28 reorder(void) {
|
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@502
|
52 c->rw = c->w; c->w = sw - 2 * BORDERPX;
|
arg@502
|
53 c->rh = c->h; c->h = sh - bh - 2 * BORDERPX;
|
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@488
|
104 for(n = 0, c = nexttiled(clients); c; c = nexttiled(c->next))
|
arg@488
|
105 n++;
|
arg@327
|
106
|
arg@327
|
107 if(n > 1)
|
arg@327
|
108 h = (sh - bh) / (n - 1);
|
arg@327
|
109 else
|
arg@327
|
110 h = sh - bh;
|
arg@327
|
111
|
arg@327
|
112 for(i = 0, c = clients; c; c = c->next) {
|
arg@327
|
113 if(isvisible(c)) {
|
arg@327
|
114 if(c->isfloat) {
|
arg@327
|
115 resize(c, True, TopLeft);
|
arg@327
|
116 continue;
|
arg@327
|
117 }
|
arg@488
|
118 c->ismax = False;
|
arg@327
|
119 if(n == 1) {
|
arg@327
|
120 c->x = sx;
|
arg@327
|
121 c->y = sy + bh;
|
arg@502
|
122 c->w = sw - 2 * BORDERPX;
|
arg@502
|
123 c->h = sh - 2 * BORDERPX - bh;
|
arg@327
|
124 }
|
arg@327
|
125 else if(i == 0) {
|
arg@327
|
126 c->x = sx;
|
arg@327
|
127 c->y = sy + bh;
|
arg@502
|
128 c->w = mw - 2 * BORDERPX;
|
arg@502
|
129 c->h = sh - 2 * BORDERPX - bh;
|
arg@327
|
130 }
|
arg@327
|
131 else if(h > bh) {
|
arg@327
|
132 c->x = sx + mw;
|
arg@327
|
133 c->y = sy + (i - 1) * h + bh;
|
arg@502
|
134 c->w = w - 2 * BORDERPX;
|
arg@327
|
135 if(i + 1 == n)
|
arg@502
|
136 c->h = sh - c->y - 2 * BORDERPX;
|
arg@327
|
137 else
|
arg@502
|
138 c->h = h - 2 * BORDERPX;
|
arg@327
|
139 }
|
arg@327
|
140 else { /* fallback if h < bh */
|
arg@327
|
141 c->x = sx + mw;
|
arg@327
|
142 c->y = sy + bh;
|
arg@502
|
143 c->w = w - 2 * BORDERPX;
|
arg@502
|
144 c->h = sh - 2 * BORDERPX - bh;
|
arg@327
|
145 }
|
arg@327
|
146 resize(c, False, TopLeft);
|
arg@327
|
147 i++;
|
arg@327
|
148 }
|
arg@327
|
149 else
|
arg@327
|
150 ban(c);
|
arg@327
|
151 }
|
arg@446
|
152 if(!sel || !isvisible(sel)) {
|
arg@450
|
153 for(c = stack; c && !isvisible(c); c = c->snext);
|
arg@450
|
154 focus(c);
|
arg@446
|
155 }
|
arg@327
|
156 restack();
|
arg@327
|
157 }
|
arg@327
|
158
|
arg@327
|
159 void
|
arg@461
|
160 focusnext(Arg *arg) {
|
arg@327
|
161 Client *c;
|
arg@327
|
162
|
arg@327
|
163 if(!sel)
|
arg@327
|
164 return;
|
arg@327
|
165
|
arg@327
|
166 if(!(c = getnext(sel->next)))
|
arg@327
|
167 c = getnext(clients);
|
arg@327
|
168 if(c) {
|
arg@327
|
169 focus(c);
|
arg@327
|
170 restack();
|
arg@327
|
171 }
|
arg@327
|
172 }
|
arg@327
|
173
|
arg@327
|
174 void
|
arg@461
|
175 focusprev(Arg *arg) {
|
arg@327
|
176 Client *c;
|
arg@327
|
177
|
arg@327
|
178 if(!sel)
|
arg@327
|
179 return;
|
arg@327
|
180
|
arg@327
|
181 if(!(c = getprev(sel->prev))) {
|
arg@327
|
182 for(c = clients; c && c->next; c = c->next);
|
arg@327
|
183 c = getprev(c);
|
arg@327
|
184 }
|
arg@327
|
185 if(c) {
|
arg@327
|
186 focus(c);
|
arg@327
|
187 restack();
|
arg@327
|
188 }
|
arg@327
|
189 }
|
arg@327
|
190
|
arg@420
|
191 Bool
|
arg@461
|
192 isvisible(Client *c) {
|
arg@420
|
193 unsigned int i;
|
arg@420
|
194
|
arg@420
|
195 for(i = 0; i < ntags; i++)
|
arg@420
|
196 if(c->tags[i] && seltag[i])
|
arg@420
|
197 return True;
|
arg@420
|
198 return False;
|
arg@420
|
199 }
|
arg@420
|
200
|
arg@415
|
201 void
|
arg@461
|
202 resizecol(Arg *arg) {
|
arg@423
|
203 unsigned int n;
|
arg@423
|
204 Client *c;
|
arg@418
|
205
|
arg@430
|
206 for(n = 0, c = clients; c; c = c->next)
|
arg@430
|
207 if(isvisible(c) && !c->isfloat)
|
arg@423
|
208 n++;
|
arg@486
|
209 if(!sel || sel->isfloat || n < 2 || (arrange == dofloat))
|
arg@415
|
210 return;
|
arg@423
|
211
|
arg@415
|
212 if(sel == getnext(clients)) {
|
arg@425
|
213 if(mw + arg->i > sw - 100 || mw + arg->i < 100)
|
arg@415
|
214 return;
|
arg@415
|
215 mw += arg->i;
|
arg@415
|
216 }
|
arg@415
|
217 else {
|
arg@425
|
218 if(mw - arg->i > sw - 100 || mw - arg->i < 100)
|
arg@415
|
219 return;
|
arg@415
|
220 mw -= arg->i;
|
arg@415
|
221 }
|
arg@415
|
222 arrange(NULL);
|
arg@415
|
223 }
|
arg@415
|
224
|
arg@327
|
225 void
|
arg@487
|
226 restack(void) {
|
arg@327
|
227 Client *c;
|
arg@327
|
228 XEvent ev;
|
arg@481
|
229
|
arg@437
|
230 if(!sel) {
|
arg@437
|
231 drawstatus();
|
arg@436
|
232 return;
|
arg@437
|
233 }
|
arg@436
|
234 if(sel->isfloat || arrange == dofloat) {
|
arg@436
|
235 XRaiseWindow(dpy, sel->win);
|
arg@436
|
236 XRaiseWindow(dpy, sel->twin);
|
arg@436
|
237 }
|
arg@446
|
238 if(arrange != dofloat)
|
arg@436
|
239 for(c = nexttiled(clients); c; c = nexttiled(c->next)) {
|
arg@436
|
240 XLowerWindow(dpy, c->twin);
|
arg@436
|
241 XLowerWindow(dpy, c->win);
|
arg@327
|
242 }
|
arg@327
|
243 drawall();
|
arg@327
|
244 XSync(dpy, False);
|
arg@327
|
245 while(XCheckMaskEvent(dpy, EnterWindowMask, &ev));
|
arg@327
|
246 }
|
arg@327
|
247
|
arg@327
|
248 void
|
arg@461
|
249 togglemode(Arg *arg) {
|
arg@333
|
250 arrange = (arrange == dofloat) ? dotile : dofloat;
|
arg@327
|
251 if(sel)
|
arg@327
|
252 arrange(NULL);
|
arg@327
|
253 else
|
arg@327
|
254 drawstatus();
|
arg@327
|
255 }
|
arg@327
|
256
|
arg@327
|
257 void
|
arg@461
|
258 toggleview(Arg *arg) {
|
arg@327
|
259 unsigned int i;
|
arg@327
|
260
|
arg@327
|
261 seltag[arg->i] = !seltag[arg->i];
|
arg@327
|
262 for(i = 0; i < ntags && !seltag[i]; i++);
|
arg@327
|
263 if(i == ntags)
|
arg@327
|
264 seltag[arg->i] = True; /* cannot toggle last view */
|
arg@381
|
265 reorder();
|
arg@327
|
266 arrange(NULL);
|
arg@327
|
267 }
|
arg@327
|
268
|
arg@327
|
269 void
|
arg@461
|
270 view(Arg *arg) {
|
arg@327
|
271 unsigned int i;
|
arg@327
|
272
|
arg@327
|
273 for(i = 0; i < ntags; i++)
|
arg@327
|
274 seltag[i] = False;
|
arg@327
|
275 seltag[arg->i] = True;
|
arg@381
|
276 reorder();
|
arg@327
|
277 arrange(NULL);
|
arg@327
|
278 }
|
arg@327
|
279
|
arg@327
|
280 void
|
arg@461
|
281 viewall(Arg *arg) {
|
arg@395
|
282 unsigned int i;
|
arg@395
|
283
|
arg@395
|
284 for(i = 0; i < ntags; i++)
|
arg@395
|
285 seltag[i] = True;
|
arg@397
|
286 reorder();
|
arg@395
|
287 arrange(NULL);
|
arg@395
|
288 }
|
arg@395
|
289
|
arg@395
|
290 void
|
arg@461
|
291 zoom(Arg *arg) {
|
arg@423
|
292 unsigned int n;
|
arg@423
|
293 Client *c;
|
arg@473
|
294
|
arg@473
|
295 if(!sel)
|
arg@473
|
296 return;
|
arg@473
|
297
|
arg@473
|
298 if(sel->isfloat || (arrange == dofloat)) {
|
arg@480
|
299 togglemax(sel);
|
arg@473
|
300 return;
|
arg@473
|
301 }
|
arg@327
|
302
|
arg@430
|
303 for(n = 0, c = clients; c; c = c->next)
|
arg@430
|
304 if(isvisible(c) && !c->isfloat)
|
arg@423
|
305 n++;
|
arg@486
|
306 if(n < 2 || (arrange == dofloat))
|
arg@327
|
307 return;
|
arg@327
|
308
|
arg@430
|
309 if((c = sel) == nexttiled(clients))
|
arg@433
|
310 if(!(c = nexttiled(c->next)))
|
arg@429
|
311 return;
|
arg@443
|
312 detach(c);
|
arg@443
|
313 if(clients)
|
arg@443
|
314 clients->prev = c;
|
arg@443
|
315 c->next = clients;
|
arg@443
|
316 clients = c;
|
arg@378
|
317 focus(c);
|
arg@327
|
318 arrange(NULL);
|
arg@327
|
319 }
|