2006-07-15 16:30:50 +02:00
|
|
|
/*
|
|
|
|
* (C)opyright MMVI Anselm R. Garbe <garbeam at gmail dot com>
|
|
|
|
* See LICENSE file for license details.
|
|
|
|
*/
|
2006-07-15 17:00:56 +02:00
|
|
|
#include "dwm.h"
|
2006-07-19 17:42:08 +02:00
|
|
|
#include <regex.h>
|
|
|
|
#include <stdio.h>
|
2006-08-04 14:40:32 +02:00
|
|
|
#include <stdlib.h>
|
2006-07-15 16:30:50 +02:00
|
|
|
#include <string.h>
|
2006-07-19 17:42:08 +02:00
|
|
|
#include <sys/types.h>
|
2006-07-15 16:30:50 +02:00
|
|
|
#include <X11/Xutil.h>
|
|
|
|
|
|
|
|
|
2006-07-19 17:42:08 +02:00
|
|
|
typedef struct {
|
2006-08-04 14:40:32 +02:00
|
|
|
const char *clpattern;
|
|
|
|
const char *tpattern;
|
2006-07-19 17:42:08 +02:00
|
|
|
Bool isfloat;
|
|
|
|
} Rule;
|
|
|
|
|
2006-08-04 14:40:32 +02:00
|
|
|
typedef struct {
|
|
|
|
regex_t *clregex;
|
|
|
|
regex_t *tregex;
|
|
|
|
} RReg;
|
|
|
|
|
|
|
|
/* static */
|
|
|
|
|
2006-08-01 13:59:13 +02:00
|
|
|
TAGS
|
|
|
|
RULES
|
2006-07-15 16:30:50 +02:00
|
|
|
|
2006-08-04 14:40:32 +02:00
|
|
|
static RReg *rreg = NULL;
|
|
|
|
static unsigned int len = 0;
|
|
|
|
|
2006-08-01 16:39:20 +02:00
|
|
|
void (*arrange)(Arg *) = DEFMODE;
|
2006-07-20 15:17:52 +02:00
|
|
|
|
|
|
|
/* extern */
|
|
|
|
|
2006-07-15 16:30:50 +02:00
|
|
|
void
|
|
|
|
dofloat(Arg *arg)
|
|
|
|
{
|
|
|
|
Client *c;
|
|
|
|
|
|
|
|
for(c = clients; c; c = c->next) {
|
2006-07-20 15:07:35 +02:00
|
|
|
c->ismax = False;
|
2006-08-11 18:37:41 +02:00
|
|
|
if(isvisible(c)) {
|
2006-07-19 11:31:04 +02:00
|
|
|
resize(c, True, TopLeft);
|
2006-07-18 12:36:57 +02:00
|
|
|
}
|
2006-07-15 16:30:50 +02:00
|
|
|
else
|
|
|
|
ban(c);
|
|
|
|
}
|
2006-08-14 18:46:07 +02:00
|
|
|
if(!sel || !isvisible(sel))
|
|
|
|
sel = getnext(clients);
|
|
|
|
if(sel) {
|
2006-08-04 18:17:02 +02:00
|
|
|
focus(sel);
|
2006-08-14 10:18:24 +02:00
|
|
|
restack();
|
2006-07-15 16:30:50 +02:00
|
|
|
}
|
2006-08-04 18:17:02 +02:00
|
|
|
else
|
|
|
|
XSetInputFocus(dpy, root, RevertToPointerRoot, CurrentTime);
|
2006-07-15 16:30:50 +02:00
|
|
|
}
|
|
|
|
|
|
|
|
void
|
|
|
|
dotile(Arg *arg)
|
|
|
|
{
|
2006-08-14 10:18:24 +02:00
|
|
|
int h, i, n, w;
|
2006-07-20 12:18:06 +02:00
|
|
|
Client *c;
|
2006-07-15 16:30:50 +02:00
|
|
|
|
|
|
|
w = sw - mw;
|
|
|
|
for(n = 0, c = clients; c; c = c->next)
|
2006-08-11 18:37:41 +02:00
|
|
|
if(isvisible(c) && !c->isfloat)
|
2006-07-15 16:30:50 +02:00
|
|
|
n++;
|
|
|
|
|
|
|
|
if(n > 1)
|
|
|
|
h = (sh - bh) / (n - 1);
|
|
|
|
else
|
|
|
|
h = sh - bh;
|
|
|
|
|
|
|
|
for(i = 0, c = clients; c; c = c->next) {
|
2006-07-20 15:07:35 +02:00
|
|
|
c->ismax = False;
|
2006-08-11 18:37:41 +02:00
|
|
|
if(isvisible(c)) {
|
2006-07-16 00:47:40 +02:00
|
|
|
if(c->isfloat) {
|
2006-07-19 11:31:04 +02:00
|
|
|
resize(c, True, TopLeft);
|
2006-07-15 16:30:50 +02:00
|
|
|
continue;
|
|
|
|
}
|
|
|
|
if(n == 1) {
|
2006-07-20 07:26:23 +02:00
|
|
|
c->x = sx;
|
|
|
|
c->y = sy + bh;
|
2006-08-02 16:32:05 +02:00
|
|
|
c->w = sw - 2;
|
|
|
|
c->h = sh - 2 - bh;
|
2006-07-15 16:30:50 +02:00
|
|
|
}
|
|
|
|
else if(i == 0) {
|
2006-07-20 07:26:23 +02:00
|
|
|
c->x = sx;
|
|
|
|
c->y = sy + bh;
|
2006-08-02 16:32:05 +02:00
|
|
|
c->w = mw - 2;
|
|
|
|
c->h = sh - 2 - bh;
|
2006-07-15 16:30:50 +02:00
|
|
|
}
|
2006-07-19 13:36:04 +02:00
|
|
|
else if(h > bh) {
|
2006-07-20 07:26:23 +02:00
|
|
|
c->x = sx + mw;
|
|
|
|
c->y = sy + (i - 1) * h + bh;
|
2006-08-02 16:32:05 +02:00
|
|
|
c->w = w - 2;
|
2006-08-10 12:33:44 +02:00
|
|
|
if(i + 1 == n)
|
|
|
|
c->h = sh - c->y - 2;
|
|
|
|
else
|
|
|
|
c->h = h - 2;
|
2006-07-15 16:30:50 +02:00
|
|
|
}
|
2006-07-19 13:36:04 +02:00
|
|
|
else { /* fallback if h < bh */
|
2006-07-20 07:26:23 +02:00
|
|
|
c->x = sx + mw;
|
|
|
|
c->y = sy + bh;
|
2006-08-02 16:32:05 +02:00
|
|
|
c->w = w - 2;
|
|
|
|
c->h = sh - 2 - bh;
|
2006-07-19 13:36:04 +02:00
|
|
|
}
|
2006-07-19 11:31:04 +02:00
|
|
|
resize(c, False, TopLeft);
|
2006-07-15 16:30:50 +02:00
|
|
|
i++;
|
|
|
|
}
|
|
|
|
else
|
|
|
|
ban(c);
|
|
|
|
}
|
2006-08-14 18:46:07 +02:00
|
|
|
if(!sel || !isvisible(sel))
|
|
|
|
sel = getnext(clients);
|
|
|
|
if(sel)
|
2006-08-04 18:17:02 +02:00
|
|
|
focus(sel);
|
|
|
|
else
|
|
|
|
XSetInputFocus(dpy, root, RevertToPointerRoot, CurrentTime);
|
2006-08-14 10:18:24 +02:00
|
|
|
restack();
|
2006-07-15 16:30:50 +02:00
|
|
|
}
|
|
|
|
|
2006-07-15 17:00:56 +02:00
|
|
|
Client *
|
2006-08-01 11:49:19 +02:00
|
|
|
getnext(Client *c)
|
2006-07-15 16:30:50 +02:00
|
|
|
{
|
2006-08-11 18:37:41 +02:00
|
|
|
for(; c && !isvisible(c); c = c->next);
|
2006-07-15 17:00:56 +02:00
|
|
|
return c;
|
2006-07-15 16:30:50 +02:00
|
|
|
}
|
|
|
|
|
2006-07-20 16:54:20 +02:00
|
|
|
Client *
|
|
|
|
getprev(Client *c)
|
|
|
|
{
|
2006-08-11 18:37:41 +02:00
|
|
|
for(; c && !isvisible(c); c = c->prev);
|
2006-07-20 16:54:20 +02:00
|
|
|
return c;
|
|
|
|
}
|
|
|
|
|
2006-08-04 14:40:32 +02:00
|
|
|
void
|
|
|
|
initrregs()
|
|
|
|
{
|
|
|
|
unsigned int i;
|
|
|
|
regex_t *reg;
|
|
|
|
|
|
|
|
if(rreg)
|
|
|
|
return;
|
|
|
|
len = sizeof(rule) / sizeof(rule[0]);
|
|
|
|
rreg = emallocz(len * sizeof(RReg));
|
|
|
|
|
|
|
|
for(i = 0; i < len; i++) {
|
|
|
|
if(rule[i].clpattern) {
|
|
|
|
reg = emallocz(sizeof(regex_t));
|
|
|
|
if(regcomp(reg, rule[i].clpattern, 0))
|
|
|
|
free(reg);
|
|
|
|
else
|
|
|
|
rreg[i].clregex = reg;
|
|
|
|
}
|
|
|
|
if(rule[i].tpattern) {
|
|
|
|
reg = emallocz(sizeof(regex_t));
|
|
|
|
if(regcomp(reg, rule[i].tpattern, 0))
|
|
|
|
free(reg);
|
|
|
|
else
|
|
|
|
rreg[i].tregex = reg;
|
|
|
|
}
|
|
|
|
}
|
|
|
|
}
|
|
|
|
|
2006-08-11 18:37:41 +02:00
|
|
|
Bool
|
|
|
|
isvisible(Client *c)
|
|
|
|
{
|
|
|
|
unsigned int i;
|
|
|
|
|
|
|
|
for(i = 0; i < ntags; i++)
|
2006-08-11 19:26:12 +02:00
|
|
|
if(c->tags[i] && seltag[i])
|
2006-08-11 18:37:41 +02:00
|
|
|
return True;
|
|
|
|
return False;
|
|
|
|
}
|
|
|
|
|
2006-08-14 10:18:24 +02:00
|
|
|
void
|
|
|
|
restack()
|
|
|
|
{
|
|
|
|
static unsigned int nwins = 0;
|
|
|
|
static Window *wins = NULL;
|
|
|
|
unsigned int f, fi, m, mi, n;
|
|
|
|
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++;
|
|
|
|
}
|
2006-08-14 10:49:22 +02:00
|
|
|
if(!(n = 2 * (f + m))) {
|
|
|
|
drawstatus();
|
|
|
|
return;
|
|
|
|
}
|
2006-08-14 10:18:24 +02:00
|
|
|
if(nwins < n) {
|
|
|
|
nwins = n;
|
|
|
|
wins = erealloc(wins, nwins * sizeof(Window));
|
|
|
|
}
|
|
|
|
|
|
|
|
fi = 0;
|
|
|
|
mi = 2 * f;
|
|
|
|
if(sel->isfloat || arrange == dofloat) {
|
|
|
|
wins[fi++] = sel->title;
|
|
|
|
wins[fi++] = sel->win;
|
|
|
|
}
|
|
|
|
else {
|
|
|
|
wins[mi++] = sel->title;
|
|
|
|
wins[mi++] = sel->win;
|
|
|
|
}
|
|
|
|
for(c = clients; c; c = c->next)
|
|
|
|
if(isvisible(c) && c != sel) {
|
|
|
|
if(c->isfloat || arrange == dofloat) {
|
|
|
|
wins[fi++] = c->title;
|
|
|
|
wins[fi++] = c->win;
|
|
|
|
}
|
|
|
|
else {
|
|
|
|
wins[mi++] = c->title;
|
|
|
|
wins[mi++] = c->win;
|
|
|
|
}
|
|
|
|
}
|
|
|
|
XRestackWindows(dpy, wins, n);
|
|
|
|
drawall();
|
|
|
|
XSync(dpy, False);
|
|
|
|
while(XCheckMaskEvent(dpy, EnterWindowMask, &ev));
|
|
|
|
}
|
|
|
|
|
2006-07-15 17:00:56 +02:00
|
|
|
void
|
|
|
|
settags(Client *c)
|
|
|
|
{
|
2006-07-19 17:42:08 +02:00
|
|
|
char classinst[256];
|
2006-08-04 14:40:32 +02:00
|
|
|
unsigned int i, j;
|
2006-07-19 17:42:08 +02:00
|
|
|
regmatch_t tmp;
|
2006-07-15 17:00:56 +02:00
|
|
|
Bool matched = False;
|
2006-07-19 17:42:08 +02:00
|
|
|
XClassHint ch;
|
2006-07-15 17:00:56 +02:00
|
|
|
|
|
|
|
if(XGetClassHint(dpy, c->win, &ch)) {
|
2006-07-19 17:42:08 +02:00
|
|
|
snprintf(classinst, sizeof(classinst), "%s:%s",
|
|
|
|
ch.res_class ? ch.res_class : "",
|
|
|
|
ch.res_name ? ch.res_name : "");
|
2006-08-04 14:40:32 +02:00
|
|
|
for(i = 0; !matched && i < len; i++)
|
|
|
|
if(rreg[i].clregex && !regexec(rreg[i].clregex, classinst, 1, &tmp, 0)) {
|
|
|
|
c->isfloat = rule[i].isfloat;
|
|
|
|
for(j = 0; rreg[i].tregex && j < ntags; j++) {
|
|
|
|
if(!regexec(rreg[i].tregex, tags[j], 1, &tmp, 0)) {
|
|
|
|
matched = True;
|
|
|
|
c->tags[j] = True;
|
|
|
|
}
|
2006-07-15 17:00:56 +02:00
|
|
|
}
|
2006-07-19 17:42:08 +02:00
|
|
|
}
|
2006-07-15 17:00:56 +02:00
|
|
|
if(ch.res_class)
|
|
|
|
XFree(ch.res_class);
|
|
|
|
if(ch.res_name)
|
|
|
|
XFree(ch.res_name);
|
|
|
|
}
|
|
|
|
if(!matched)
|
2006-08-11 18:37:41 +02:00
|
|
|
for(i = 0; i < ntags; i++)
|
2006-08-11 19:26:12 +02:00
|
|
|
c->tags[i] = seltag[i];
|
2006-07-15 17:00:56 +02:00
|
|
|
}
|
|
|
|
|
2006-08-14 16:59:18 +02:00
|
|
|
void
|
|
|
|
tag(Arg *arg)
|
|
|
|
{
|
|
|
|
unsigned int i;
|
|
|
|
|
|
|
|
if(!sel)
|
|
|
|
return;
|
|
|
|
|
|
|
|
for(i = 0; i < ntags; i++)
|
|
|
|
sel->tags[i] = False;
|
|
|
|
sel->tags[arg->i] = True;
|
|
|
|
settitle(sel);
|
2006-08-14 17:50:48 +02:00
|
|
|
if(!isvisible(sel))
|
|
|
|
arrange(NULL);
|
2006-08-14 16:59:18 +02:00
|
|
|
}
|
|
|
|
|
2006-07-20 15:07:35 +02:00
|
|
|
void
|
|
|
|
togglemode(Arg *arg)
|
|
|
|
{
|
|
|
|
arrange = arrange == dofloat ? dotile : dofloat;
|
|
|
|
arrange(NULL);
|
|
|
|
}
|
|
|
|
|
2006-07-15 17:00:56 +02:00
|
|
|
void
|
2006-08-14 16:59:18 +02:00
|
|
|
toggletag(Arg *arg)
|
2006-07-15 17:00:56 +02:00
|
|
|
{
|
2006-08-11 18:37:41 +02:00
|
|
|
unsigned int i;
|
|
|
|
|
2006-08-14 16:59:18 +02:00
|
|
|
if(!sel)
|
|
|
|
return;
|
|
|
|
|
|
|
|
sel->tags[arg->i] = !sel->tags[arg->i];
|
|
|
|
for(i = 0; i < ntags && !sel->tags[i]; i++);
|
|
|
|
if(i == ntags)
|
|
|
|
sel->tags[arg->i] = True;
|
|
|
|
settitle(sel);
|
2006-08-14 17:50:48 +02:00
|
|
|
if(!isvisible(sel))
|
|
|
|
arrange(NULL);
|
2006-08-11 19:26:12 +02:00
|
|
|
}
|
|
|
|
|
2006-08-14 16:59:18 +02:00
|
|
|
|
2006-08-11 19:26:12 +02:00
|
|
|
void
|
2006-08-13 17:58:06 +02:00
|
|
|
toggleview(Arg *arg)
|
2006-08-11 19:26:12 +02:00
|
|
|
{
|
|
|
|
unsigned int i;
|
|
|
|
|
|
|
|
seltag[arg->i] = !seltag[arg->i];
|
2006-08-14 16:59:18 +02:00
|
|
|
for(i = 0; i < ntags && !seltag[i]; i++);
|
2006-08-11 19:26:12 +02:00
|
|
|
if(i == ntags)
|
|
|
|
seltag[arg->i] = True; /* cannot toggle last view */
|
2006-07-15 17:00:56 +02:00
|
|
|
arrange(NULL);
|
|
|
|
}
|
2006-08-14 16:59:18 +02:00
|
|
|
|
|
|
|
void
|
|
|
|
view(Arg *arg)
|
|
|
|
{
|
|
|
|
unsigned int i;
|
|
|
|
|
|
|
|
for(i = 0; i < ntags; i++)
|
|
|
|
seltag[i] = False;
|
|
|
|
seltag[arg->i] = True;
|
|
|
|
arrange(NULL);
|
|
|
|
}
|