dwm-custom/view.c

440 lines
7.5 KiB
C
Raw Normal View History

/*
* (C)opyright MMVI Anselm R. Garbe <garbeam at gmail dot com>
* See LICENSE file for license details.
*/
#include "dwm.h"
/* static */
2006-08-29 13:28:29 +00:00
static Client *
2006-09-25 06:21:51 +00:00
minclient(void) {
2006-08-29 13:28:29 +00:00
Client *c, *min;
if((clients && clients->isfloat) || arrange == dofloat)
return clients; /* don't touch floating order */
2006-08-29 13:28:29 +00:00
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;
}
2006-08-29 11:40:09 +00:00
static void
2006-09-25 06:21:51 +00:00
reorder(void) {
2006-08-29 13:28:29 +00:00
Client *c, *newclients, *tail;
2006-08-29 13:28:29 +00:00
newclients = tail = NULL;
while((c = minclient())) {
2006-08-29 11:40:09 +00:00
detach(c);
2006-08-29 13:28:29 +00:00
if(tail) {
c->prev = tail;
tail->next = c;
tail = c;
2006-08-29 11:40:09 +00:00
}
else
2006-08-29 13:28:29 +00:00
tail = newclients = c;
}
2006-08-29 13:28:29 +00:00
clients = newclients;
}
static void
togglemax(Client *c)
{
2006-09-22 11:58:21 +00:00
XEvent ev;
if((c->ismax = !c->ismax)) {
c->rx = c->x; c->x = sx;
c->ry = c->y; c->y = bh;
2006-09-28 12:03:39 +00:00
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;
2006-09-22 11:58:21 +00:00
c->w = c->rw;
c->h = c->rh;
}
resize(c, True, TopLeft);
while(XCheckMaskEvent(dpy, EnterWindowMask, &ev));
}
2006-08-29 11:40:09 +00:00
/* extern */
void (*arrange)(Arg *) = DEFMODE;
Bool isvertical = VERTICALSTACK;
StackPos stackpos = STACKPOS;
2006-08-29 11:40:09 +00:00
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(Arg *arg) {
2006-09-04 10:23:41 +00:00
Client *c;
2006-09-04 06:55:49 +00:00
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();
}
2006-09-28 19:29:20 +00:00
/* This algorithm is based on a (M)aster area and a (S)tacking area.
* It supports following arrangements:
2006-09-29 12:39:03 +00:00
* SSMMM MMMMM MMMSS
* SSMMM SSSSS MMMSS
2006-09-28 19:29:20 +00:00
*/
void
dotile(Arg *arg) {
2006-09-29 12:39:03 +00:00
int i, n, stackw, stackh, tw, th;
2006-09-04 10:23:41 +00:00
Client *c;
2006-09-04 06:55:49 +00:00
2006-09-25 18:38:30 +00:00
for(n = 0, c = nexttiled(clients); c; c = nexttiled(c->next))
n++;
2006-09-29 12:39:03 +00:00
if(stackpos == StackBottom) {
stackw = sw;
stackh = sh - bh - master;
}
else {
stackw = sw - master;
stackh = sh - bh;
}
2006-09-29 12:39:03 +00:00
if(isvertical) {
tw = stackw;
if(n > 1)
th = stackh / (n - 1);
else
th = stackh;
}
else {
th = stackh;
if(n > 1)
tw = stackw / (n - 1);
else
tw = stackw;
}
for(i = 0, c = clients; c; c = c->next) {
if(isvisible(c)) {
if(c->isfloat) {
resize(c, True, TopLeft);
continue;
}
2006-09-25 18:38:30 +00:00
c->ismax = False;
2006-09-29 12:39:03 +00:00
if(n == 1) { /* only 1 window */
c->x = sx;
c->y = sy + bh;
2006-09-28 12:03:39 +00:00
c->w = sw - 2 * BORDERPX;
c->h = sh - 2 * BORDERPX - bh;
}
2006-09-29 12:39:03 +00:00
else if(i == 0) { /* master window */
switch(stackpos) {
case StackLeft:
c->x = sx + stackw;
c->y = sy + bh;
2006-09-29 12:39:03 +00:00
c->w = master - 2 * BORDERPX;
c->h = sh - bh - 2 * BORDERPX;
break;
case StackBottom:
c->x = sx;
c->y = sy + bh;
c->w = sw - 2 * BORDERPX;
2006-09-29 12:39:03 +00:00
c->h = master - 2 * BORDERPX;
break;
case StackRight:
c->x = sx;
c->y = sy + bh;
c->w = master - 2 * BORDERPX;
c->h = sh - bh - 2 * BORDERPX;
break;
2006-09-29 12:39:03 +00:00
}
}
2006-09-29 12:39:03 +00:00
else if((isvertical && th > bh) || (!isvertical && tw > MINW)) {
/* tile window */
c->w = tw - 2 * BORDERPX;
c->h = th - 2 * BORDERPX;
switch(stackpos) {
case StackLeft:
if(isvertical) {
c->x = sx;
c->y = sy + (i - 1) * th + bh;
if(i + 1 == n)
c->h = sh - c->y - 2 * BORDERPX;
}
2006-09-29 12:39:03 +00:00
else {
c->x = sx + (i - 1) * tw;
c->y = sy + bh;
if(i + 1 == n)
c->w = sx + stackw - c->x - 2 * BORDERPX;
}
break;
case StackBottom:
if(isvertical) {
c->x = sx;
c->y = sy + master + (i - 1) * th + bh;
if(i + 1 == n)
c->h = sh - c->y - 2 * BORDERPX;
}
else {
c->x = sx + (i - 1) * tw;
c->y = sy + bh + master;
if(i + 1 == n)
2006-09-29 12:39:03 +00:00
c->w = sw - c->x - 2 * BORDERPX;
}
break;
case StackRight:
if(isvertical) {
c->x = sx + master;
c->y = sy + (i - 1) * th + bh;
if(i + 1 == n)
c->h = sh - c->y - 2 * BORDERPX;
}
else {
c->x = sx + master + (i - 1) * tw;
c->y = sy + bh;
if(i + 1 == n)
2006-09-29 14:54:15 +00:00
c->w = sw - c->x - 2 * BORDERPX;
}
break;
2006-09-29 12:39:03 +00:00
}
}
2006-09-29 12:39:03 +00:00
else { /* fallback if th < bh resp. tw < MINW */
c->w = stackw - 2 * BORDERPX;
c->h = stackh - 2 * BORDERPX;
switch(stackpos) {
case StackLeft:
c->x = sx;
c->y = sy + bh;
break;
case StackBottom:
c->x = sx;
c->y = sy + master;
break;
case StackRight:
c->x = sx + master;
c->y = sy + bh;
break;
}
}
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();
}
}
2006-09-05 11:25:42 +00:00
Bool
isvisible(Client *c) {
2006-09-05 11:25:42 +00:00
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;
2006-09-05 11:20:29 +00:00
for(n = 0, c = clients; c; c = c->next)
if(isvisible(c) && !c->isfloat)
n++;
2006-09-22 16:48:35 +00:00
if(!sel || sel->isfloat || n < 2 || (arrange == dofloat))
return;
if(sel == getnext(clients)) {
2006-09-29 12:39:03 +00:00
if(master + arg->i > sw - MINW || master + arg->i < MINW)
return;
master += arg->i;
}
else {
2006-09-29 12:39:03 +00:00
if(master - arg->i > sw - MINW || master - arg->i < MINW)
return;
master -= arg->i;
}
arrange(NULL);
}
void
2006-09-25 06:21:51 +00:00
restack(void) {
Client *c;
XEvent ev;
2006-09-22 11:58:21 +00:00
2006-09-06 10:10:43 +00:00
if(!sel) {
drawstatus();
return;
2006-09-06 10:10:43 +00:00
}
if(sel->isfloat || arrange == dofloat) {
XRaiseWindow(dpy, sel->win);
XRaiseWindow(dpy, sel->twin);
}
if(arrange != dofloat)
for(c = nexttiled(clients); c; c = nexttiled(c->next)) {
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(NULL);
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 */
2006-08-29 11:40:09 +00:00
reorder();
arrange(NULL);
}
void
togglestackdir(Arg *arg) {
if(arrange == dofloat)
return;
isvertical = !isvertical;
arrange(NULL);
}
void
togglestackpos(Arg *arg) {
if(arrange == dofloat)
return;
if(stackpos == StackBottom)
stackpos = STACKPOS;
else
stackpos = StackBottom;
updatemaster();
arrange(NULL);
}
void
updatemaster(void) {
master = ((stackpos == StackBottom ? sh - bh : sw) * MASTER) / 100;
}
void
view(Arg *arg) {
unsigned int i;
for(i = 0; i < ntags; i++)
seltag[i] = False;
seltag[arg->i] = True;
2006-08-29 11:40:09 +00:00
reorder();
arrange(NULL);
}
void
viewall(Arg *arg) {
unsigned int i;
for(i = 0; i < ntags; i++)
seltag[i] = True;
reorder();
arrange(NULL);
}
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++;
2006-09-22 16:48:35 +00:00
if(n < 2 || (arrange == dofloat))
return;
if((c = sel) == nexttiled(clients))
2006-09-06 08:03:21 +00:00
if(!(c = nexttiled(c->next)))
return;
detach(c);
if(clients)
clients->prev = c;
c->next = clients;
clients = c;
focus(c);
arrange(NULL);
}