/* (C)opyright MMVI-MMVII Anselm R. Garbe <garbeam at gmail dot com> * See LICENSE file for license details. */ #include "dwm.h" unsigned int blw = 0; Layout *lt = NULL; /* static */ static unsigned int nlayouts = 0; static unsigned int masterw = MASTERWIDTH; static unsigned int nmaster = NMASTER; static void tile(void) { unsigned int i, n, nx, ny, nw, nh, mw, mh, tw, th; Client *c; for(n = 0, c = nexttiled(clients); c; c = nexttiled(c->next)) n++; /* window geoms */ mh = (n > nmaster) ? wah / nmaster : wah / (n > 0 ? n : 1); mw = (n > nmaster) ? (waw * masterw) / 1000 : waw; th = (n > nmaster) ? wah / (n - nmaster) : 0; tw = waw - mw; for(i = 0, c = clients; c; c = c->next) if(isvisible(c)) { if(c->isbanned) XMoveWindow(dpy, c->win, c->x, c->y); c->isbanned = False; if(c->isversatile) continue; c->ismax = False; nx = wax; ny = way; if(i < nmaster) { ny += i * mh; nw = mw - 2 * BORDERPX; nh = mh - 2 * BORDERPX; } else { /* tile window */ nx += mw; nw = tw - 2 * BORDERPX; if(th > 2 * BORDERPX) { ny += (i - nmaster) * th; nh = th - 2 * BORDERPX; } else /* fallback if th <= 2 * BORDERPX */ nh = wah - 2 * BORDERPX; } resize(c, nx, ny, nw, nh, False); i++; } else { c->isbanned = True; XMoveWindow(dpy, c->win, c->x + 2 * sw, c->y); } if(!sel || !isvisible(sel)) { for(c = stack; c && !isvisible(c); c = c->snext); focus(c); } restack(); } LAYOUTS /* extern */ void focusnext(Arg arg) { Client *c; if(!sel) return; for(c = sel->next; c && !isvisible(c); c = c->next); if(!c) for(c = clients; c && !isvisible(c); c = c->next); if(c) { focus(c); restack(); } } void focusprev(Arg arg) { Client *c; if(!sel) return; for(c = sel->prev; c && !isvisible(c); c = c->prev); if(!c) { for(c = clients; c && c->next; c = c->next); for(; c && !isvisible(c); c = c->prev); } if(c) { focus(c); restack(); } } void incmasterw(Arg arg) { if(lt->arrange != tile) return; if(arg.i == 0) masterw = MASTERWIDTH; else { if(waw * (masterw + arg.i) / 1000 >= waw - 2 * BORDERPX || waw * (masterw + arg.i) / 1000 <= 2 * BORDERPX) return; masterw += arg.i; } lt->arrange(); } void incnmaster(Arg arg) { if((lt->arrange != tile) || (nmaster + arg.i < 1) || (wah / (nmaster + arg.i) <= 2 * BORDERPX)) return; nmaster += arg.i; if(sel) lt->arrange(); else drawstatus(); } void initlayouts(void) { unsigned int i, w; lt = &layout[0]; nlayouts = sizeof layout / sizeof layout[0]; for(blw = i = 0; i < nlayouts; i++) { w = textw(layout[i].symbol); if(w > blw) blw = w; } } Client * nexttiled(Client *c) { for(; c && (c->isversatile || !isvisible(c)); c = c->next); return c; } void restack(void) { Client *c; XEvent ev; drawstatus(); if(!sel) return; if(sel->isversatile || lt->arrange == versatile) XRaiseWindow(dpy, sel->win); if(lt->arrange != versatile) { if(!sel->isversatile) XLowerWindow(dpy, sel->win); for(c = nexttiled(clients); c; c = nexttiled(c->next)) { if(c == sel) continue; XLowerWindow(dpy, c->win); } } XSync(dpy, False); while(XCheckMaskEvent(dpy, EnterWindowMask, &ev)); } void setlayout(Arg arg) { unsigned int i; if(arg.i == -1) { for(i = 0; i < nlayouts && lt != &layout[i]; i++); if(i == nlayouts - 1) lt = &layout[0]; else lt = &layout[++i]; } else { if(arg.i < 0 || arg.i >= nlayouts) return; lt = &layout[arg.i]; } if(sel) lt->arrange(); else drawstatus(); } void togglemax(Arg arg) { XEvent ev; if(!sel || !sel->isversatile || sel->isfixed || lt->arrange != versatile) return; if((sel->ismax = !sel->ismax)) { sel->rx = sel->x; sel->ry = sel->y; sel->rw = sel->w; sel->rh = sel->h; resize(sel, wax, way, waw - 2 * BORDERPX, wah - 2 * BORDERPX, True); } else resize(sel, sel->rx, sel->ry, sel->rw, sel->rh, True); while(XCheckMaskEvent(dpy, EnterWindowMask, &ev)); } void versatile(void) { Client *c; for(c = clients; c; c = c->next) { if(isvisible(c)) { if(c->isbanned) XMoveWindow(dpy, c->win, c->x, c->y); c->isbanned = False; resize(c, c->x, c->y, c->w, c->h, True); } else { c->isbanned = True; XMoveWindow(dpy, c->win, c->x + 2 * sw, c->y); } } if(!sel || !isvisible(sel)) { for(c = stack; c && !isvisible(c); c = c->snext); focus(c); } restack(); } void zoom(Arg arg) { unsigned int n; Client *c; if(!sel || lt->arrange != tile || sel->isversatile) return; for(n = 0, c = nexttiled(clients); c; c = nexttiled(c->next)) n++; if((c = sel) == nexttiled(clients)) if(!(c = nexttiled(c->next))) return; detach(c); attach(c); focus(c); lt->arrange(); }