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