* See LICENSE file for license details.
*/
#include "dwm.h"
-#include <stdio.h>
/* static */
static Client *
-minclient()
-{
+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()
-{
+reorder(void) {
Client *c, *newclients, *tail;
newclients = tail = NULL;
clients = newclients;
}
+static void
+togglemax(Client *c)
+{
+ XEvent ev;
+ 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)(Arg *) = DEFMODE;
void
-detach(Client *c)
-{
+detach(Client *c) {
if(c->prev)
c->prev->next = c->next;
if(c->next)
}
void
-dofloat(Arg *arg)
-{
+dofloat(Arg *arg) {
Client *c;
- maximized = False;
-
for(c = clients; c; c = c->next) {
if(isvisible(c)) {
resize(c, True, TopLeft);
else
ban(c);
}
- if(!sel || !isvisible(sel))
- focus(getnext(clients));
+ if(!sel || !isvisible(sel)) {
+ for(c = stack; c && !isvisible(c); c = c->snext);
+ focus(c);
+ }
restack();
}
+/* This algorithm is based on a (M)aster area and a (S)tacking area.
+ * It supports following arrangements:
+ *
+ * MMMS MMMM
+ * MMMS MMMM
+ * MMMS SSSS
+ *
+ * The stacking area can be set to arrange clients vertically or horizontally.
+ * Through inverting the algorithm it can be used to achieve following setup in
+ * a dual head environment (due to running two dwm instances concurrently on
+ * the specific screen):
+ *
+ * SMM MMS MMM MMM
+ * SMM MMS MMM MMM
+ * SMM MMS SSS SSS
+ *
+ * This uses the center of the two screens for master areas.
+ */
void
-dotile(Arg *arg)
-{
+dotile(Arg *arg) {
int h, i, n, w;
Client *c;
- maximized = False;
-
w = sw - mw;
- for(n = 0, c = clients; c; c = c->next)
- if(isvisible(c) && !c->isfloat)
- n++;
+ for(n = 0, c = nexttiled(clients); c; c = nexttiled(c->next))
+ n++;
if(n > 1)
h = (sh - bh) / (n - 1);
resize(c, True, TopLeft);
continue;
}
+ c->ismax = False;
if(n == 1) {
c->x = sx;
c->y = sy + bh;
- c->w = sw - 2;
- c->h = sh - 2 - bh;
+ c->w = sw - 2 * BORDERPX;
+ c->h = sh - 2 * BORDERPX - bh;
}
else if(i == 0) {
c->x = sx;
c->y = sy + bh;
- c->w = mw - 2;
- c->h = sh - 2 - bh;
+ c->w = mw - 2 * BORDERPX;
+ c->h = sh - 2 * BORDERPX - bh;
}
else if(h > bh) {
c->x = sx + mw;
c->y = sy + (i - 1) * h + bh;
- c->w = w - 2;
+ c->w = w - 2 * BORDERPX;
if(i + 1 == n)
- c->h = sh - c->y - 2;
+ c->h = sh - c->y - 2 * BORDERPX;
else
- c->h = h - 2;
+ c->h = h - 2 * BORDERPX;
}
else { /* fallback if h < bh */
c->x = sx + mw;
c->y = sy + bh;
- c->w = w - 2;
- c->h = sh - 2 - bh;
+ c->w = w - 2 * BORDERPX;
+ c->h = sh - 2 * BORDERPX - bh;
}
resize(c, False, TopLeft);
i++;
else
ban(c);
}
- if(!sel || !isvisible(sel))
- focus(getnext(clients));
+ if(!sel || !isvisible(sel)) {
+ for(c = stack; c && !isvisible(c); c = c->snext);
+ focus(c);
+ }
restack();
}
void
-focusnext(Arg *arg)
-{
+focusnext(Arg *arg) {
Client *c;
if(!sel)
}
void
-focusprev(Arg *arg)
-{
+focusprev(Arg *arg) {
Client *c;
if(!sel)
}
Bool
-isvisible(Client *c)
-{
+isvisible(Client *c) {
unsigned int i;
for(i = 0; i < ntags; i++)
}
void
-resizetile(Arg *arg)
-{
- Client *c = getnext(clients);
+resizecol(Arg *arg) {
+ unsigned int n;
+ Client *c;
- if(!sel || !getnext(c->next) || (arrange != dotile))
+ 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(mw + arg->i > sw - 100)
+ if(mw + arg->i > sw - 100 || mw + arg->i < 100)
return;
mw += arg->i;
}
else {
- if(mw - arg->i < 100)
+ if(mw - arg->i > sw - 100 || mw - arg->i < 100)
return;
mw -= arg->i;
}
}
void
-restack()
-{
- static unsigned int nwins = 0;
- static Window *wins = NULL;
- unsigned int f, fi, m, mi, n;
+restack(void) {
Client *c;
XEvent ev;
- for(f = 0, m = 0, c = clients; c; c = c->next)
- if(isvisible(c)) {
- if(c->isfloat || arrange == dofloat)
- f++;
- else
- m++;
- }
- if(!(n = 2 * (f + m))) {
+ if(!sel) {
drawstatus();
return;
}
- if(nwins < n) {
- nwins = n;
- wins = erealloc(wins, nwins * sizeof(Window));
+ if(sel->isfloat || arrange == dofloat) {
+ XRaiseWindow(dpy, sel->win);
+ XRaiseWindow(dpy, sel->twin);
}
-
- fi = 0;
- mi = 2 * f;
- if(sel) {
- if(sel->isfloat || arrange == dofloat) {
- wins[fi++] = sel->twin;
- wins[fi++] = sel->win;
- }
- else {
- wins[mi++] = sel->twin;
- wins[mi++] = sel->win;
+ if(arrange != dofloat)
+ for(c = nexttiled(clients); c; c = nexttiled(c->next)) {
+ XLowerWindow(dpy, c->twin);
+ XLowerWindow(dpy, c->win);
}
- }
- for(c = clients; c; c = c->next)
- if(isvisible(c) && c != sel) {
- if(c->isfloat || arrange == dofloat) {
- wins[fi++] = c->twin;
- wins[fi++] = c->win;
- }
- else {
- wins[mi++] = c->twin;
- wins[mi++] = c->win;
- }
- }
- XRestackWindows(dpy, wins, n);
drawall();
XSync(dpy, False);
while(XCheckMaskEvent(dpy, EnterWindowMask, &ev));
}
void
-togglemode(Arg *arg)
-{
+togglemode(Arg *arg) {
arrange = (arrange == dofloat) ? dotile : dofloat;
if(sel)
arrange(NULL);
}
void
-toggleview(Arg *arg)
-{
+toggleview(Arg *arg) {
unsigned int i;
seltag[arg->i] = !seltag[arg->i];
}
void
-view(Arg *arg)
-{
+view(Arg *arg) {
unsigned int i;
for(i = 0; i < ntags; i++)
}
void
-viewall(Arg *arg)
-{
+viewall(Arg *arg) {
unsigned int i;
for(i = 0; i < ntags; i++)
}
void
-zoom(Arg *arg)
-{
- Client *c = sel;
+zoom(Arg *arg) {
+ unsigned int n;
+ Client *c;
+
+ if(!sel)
+ return;
+
+ if(sel->isfloat || (arrange == dofloat)) {
+ togglemax(sel);
+ return;
+ }
- if(!c || (arrange != dotile) || c->isfloat || maximized)
+ for(n = 0, c = clients; c; c = c->next)
+ if(isvisible(c) && !c->isfloat)
+ n++;
+ if(n < 2 || (arrange == dofloat))
return;
- if(c == getnext(clients))
- if(!(c = getnext(c->next)))
+ if((c = sel) == nexttiled(clients))
+ if(!(c = nexttiled(c->next)))
return;
detach(c);
+ if(clients)
+ clients->prev = c;
c->next = clients;
- clients->prev = c;
clients = c;
focus(c);
arrange(NULL);
Got questions, comments, patches, etc.? Contact Jason Woofenden