You can not select more than 25 topics
Topics must start with a letter or number, can include dashes ('-') and can be up to 35 characters long.
319 lines
5.3 KiB
319 lines
5.3 KiB
/* (C)opyright MMVI Anselm R. Garbe <garbeam at gmail dot com>
|
|
* See LICENSE file for license details.
|
|
*/
|
|
#include "dwm.h"
|
|
|
|
/* static */
|
|
|
|
static Client *
|
|
minclient(void) {
|
|
Client *c, *min;
|
|
|
|
if((clients && clients->isfloat) || arrange == dofloat)
|
|
return clients; /* don't touch floating order */
|
|
for(min = c = clients; c; c = c->next)
|
|
if(c->weight < min->weight)
|
|
min = c;
|
|
return min;
|
|
}
|
|
|
|
static Client *
|
|
nexttiled(Client *c) {
|
|
for(c = getnext(c); c && c->isfloat; c = getnext(c->next));
|
|
return c;
|
|
}
|
|
|
|
static void
|
|
reorder(void) {
|
|
Client *c, *newclients, *tail;
|
|
|
|
newclients = tail = NULL;
|
|
while((c = minclient())) {
|
|
detach(c);
|
|
if(tail) {
|
|
c->prev = tail;
|
|
tail->next = c;
|
|
tail = c;
|
|
}
|
|
else
|
|
tail = newclients = c;
|
|
}
|
|
clients = newclients;
|
|
}
|
|
|
|
static void
|
|
togglemax(Client *c) {
|
|
XEvent ev;
|
|
|
|
if (x->maxw && x->minw && x->maxh && x->minh &&
|
|
x->maxw == x->minw && x->maxh == x->minh)
|
|
return;
|
|
|
|
if((c->ismax = !c->ismax)) {
|
|
c->rx = c->x; c->x = sx;
|
|
c->ry = c->y; c->y = bh;
|
|
c->rw = c->w; c->w = sw - 2 * BORDERPX;
|
|
c->rh = c->h; c->h = sh - bh - 2 * BORDERPX;
|
|
}
|
|
else {
|
|
c->x = c->rx;
|
|
c->y = c->ry;
|
|
c->w = c->rw;
|
|
c->h = c->rh;
|
|
}
|
|
resize(c, True, TopLeft);
|
|
while(XCheckMaskEvent(dpy, EnterWindowMask, &ev));
|
|
}
|
|
|
|
/* extern */
|
|
|
|
void (*arrange)(void) = DEFMODE;
|
|
|
|
void
|
|
detach(Client *c) {
|
|
if(c->prev)
|
|
c->prev->next = c->next;
|
|
if(c->next)
|
|
c->next->prev = c->prev;
|
|
if(c == clients)
|
|
clients = c->next;
|
|
c->next = c->prev = NULL;
|
|
}
|
|
|
|
void
|
|
dofloat(void) {
|
|
Client *c;
|
|
|
|
for(c = clients; c; c = c->next) {
|
|
if(isvisible(c)) {
|
|
resize(c, True, TopLeft);
|
|
}
|
|
else
|
|
ban(c);
|
|
}
|
|
if(!sel || !isvisible(sel)) {
|
|
for(c = stack; c && !isvisible(c); c = c->snext);
|
|
focus(c);
|
|
}
|
|
restack();
|
|
}
|
|
|
|
void
|
|
dotile(void) {
|
|
unsigned int i, n, mpx, stackw, stackh, th;
|
|
Client *c;
|
|
|
|
for(n = 0, c = nexttiled(clients); c; c = nexttiled(c->next))
|
|
n++;
|
|
mpx = (sw * master) / 1000;
|
|
stackw = sw - mpx;
|
|
stackh = sh - bh;
|
|
th = stackh;
|
|
if(n > 1)
|
|
th /= (n - 1);
|
|
|
|
for(i = 0, c = clients; c; c = c->next)
|
|
if(isvisible(c)) {
|
|
if(c->isfloat) {
|
|
resize(c, True, TopLeft);
|
|
continue;
|
|
}
|
|
c->ismax = False;
|
|
c->x = sx;
|
|
c->y = sy + bh;
|
|
if(n == 1) { /* only 1 window */
|
|
c->w = sw - 2 * BORDERPX;
|
|
c->h = sh - 2 * BORDERPX - bh;
|
|
}
|
|
else if(i == 0) { /* master window */
|
|
c->w = mpx - 2 * BORDERPX;
|
|
c->h = sh - bh - 2 * BORDERPX;
|
|
}
|
|
else { /* tile window */
|
|
c->x += mpx;
|
|
c->w = stackw - 2 * BORDERPX;
|
|
if(th > bh) {
|
|
c->y = sy + (i - 1) * th + bh;
|
|
if(i + 1 == n)
|
|
c->h = sh - c->y - 2 * BORDERPX;
|
|
else
|
|
c->h = th - 2 * BORDERPX;
|
|
}
|
|
else /* fallback if th < bh */
|
|
c->h = stackh - 2 * BORDERPX;
|
|
}
|
|
resize(c, False, TopLeft);
|
|
i++;
|
|
}
|
|
else
|
|
ban(c);
|
|
|
|
if(!sel || !isvisible(sel)) {
|
|
for(c = stack; c && !isvisible(c); c = c->snext);
|
|
focus(c);
|
|
}
|
|
restack();
|
|
}
|
|
|
|
void
|
|
focusnext(Arg *arg) {
|
|
Client *c;
|
|
|
|
if(!sel)
|
|
return;
|
|
if(!(c = getnext(sel->next)))
|
|
c = getnext(clients);
|
|
if(c) {
|
|
focus(c);
|
|
restack();
|
|
}
|
|
}
|
|
|
|
void
|
|
focusprev(Arg *arg) {
|
|
Client *c;
|
|
|
|
if(!sel)
|
|
return;
|
|
if(!(c = getprev(sel->prev))) {
|
|
for(c = clients; c && c->next; c = c->next);
|
|
c = getprev(c);
|
|
}
|
|
if(c) {
|
|
focus(c);
|
|
restack();
|
|
}
|
|
}
|
|
|
|
Bool
|
|
isvisible(Client *c) {
|
|
unsigned int i;
|
|
|
|
for(i = 0; i < ntags; i++)
|
|
if(c->tags[i] && seltag[i])
|
|
return True;
|
|
return False;
|
|
}
|
|
|
|
void
|
|
resizecol(Arg *arg) {
|
|
unsigned int n;
|
|
Client *c;
|
|
|
|
for(n = 0, c = clients; c; c = c->next)
|
|
if(isvisible(c) && !c->isfloat)
|
|
n++;
|
|
if(!sel || sel->isfloat || n < 2 || (arrange == dofloat))
|
|
return;
|
|
if(sel == getnext(clients)) {
|
|
if(master + arg->i > 950 || master + arg->i < 50)
|
|
return;
|
|
master += arg->i;
|
|
}
|
|
else {
|
|
if(master - arg->i > 950 || master - arg->i < 50)
|
|
return;
|
|
master -= arg->i;
|
|
}
|
|
arrange();
|
|
}
|
|
|
|
void
|
|
restack(void) {
|
|
Client *c;
|
|
XEvent ev;
|
|
|
|
if(!sel) {
|
|
drawstatus();
|
|
return;
|
|
}
|
|
if(sel->isfloat || arrange == dofloat) {
|
|
XRaiseWindow(dpy, sel->win);
|
|
XRaiseWindow(dpy, sel->twin);
|
|
}
|
|
if(arrange != dofloat) {
|
|
if(!sel->isfloat) {
|
|
XLowerWindow(dpy, sel->twin);
|
|
XLowerWindow(dpy, sel->win);
|
|
}
|
|
for(c = nexttiled(clients); c; c = nexttiled(c->next)) {
|
|
if(c == sel)
|
|
continue;
|
|
XLowerWindow(dpy, c->twin);
|
|
XLowerWindow(dpy, c->win);
|
|
}
|
|
}
|
|
drawall();
|
|
XSync(dpy, False);
|
|
while(XCheckMaskEvent(dpy, EnterWindowMask, &ev));
|
|
}
|
|
|
|
void
|
|
togglemode(Arg *arg) {
|
|
arrange = (arrange == dofloat) ? dotile : dofloat;
|
|
if(sel)
|
|
arrange();
|
|
else
|
|
drawstatus();
|
|
}
|
|
|
|
void
|
|
toggleview(Arg *arg) {
|
|
unsigned int i;
|
|
|
|
seltag[arg->i] = !seltag[arg->i];
|
|
for(i = 0; i < ntags && !seltag[i]; i++);
|
|
if(i == ntags)
|
|
seltag[arg->i] = True; /* cannot toggle last view */
|
|
reorder();
|
|
arrange();
|
|
}
|
|
|
|
void
|
|
view(Arg *arg) {
|
|
unsigned int i;
|
|
|
|
for(i = 0; i < ntags; i++)
|
|
seltag[i] = False;
|
|
seltag[arg->i] = True;
|
|
reorder();
|
|
arrange();
|
|
}
|
|
|
|
void
|
|
viewall(Arg *arg) {
|
|
unsigned int i;
|
|
|
|
for(i = 0; i < ntags; i++)
|
|
seltag[i] = True;
|
|
reorder();
|
|
arrange();
|
|
}
|
|
|
|
void
|
|
zoom(Arg *arg) {
|
|
unsigned int n;
|
|
Client *c;
|
|
|
|
if(!sel)
|
|
return;
|
|
if(sel->isfloat || (arrange == dofloat)) {
|
|
togglemax(sel);
|
|
return;
|
|
}
|
|
for(n = 0, c = clients; c; c = c->next)
|
|
if(isvisible(c) && !c->isfloat)
|
|
n++;
|
|
if(n < 2 || (arrange == dofloat))
|
|
return;
|
|
if((c = sel) == nexttiled(clients))
|
|
if(!(c = nexttiled(c->next)))
|
|
return;
|
|
detach(c);
|
|
if(clients)
|
|
clients->prev = c;
|
|
c->next = clients;
|
|
clients = c;
|
|
focus(c);
|
|
arrange();
|
|
}
|