4 changed files with 160 additions and 152 deletions
@ -0,0 +1,149 @@ |
|||
/* (C)opyright MMVI-MMVII Anselm R. Garbe <garbeam at gmail dot com>
|
|||
* See LICENSE file for license details. |
|||
*/ |
|||
#include "dwm.h" |
|||
#include <regex.h> |
|||
#include <stdio.h> |
|||
#include <X11/Xutil.h> |
|||
|
|||
/* static */ |
|||
|
|||
typedef struct { |
|||
const char *prop; |
|||
const char *tags; |
|||
Bool isversatile; |
|||
} Rule; |
|||
|
|||
typedef struct { |
|||
regex_t *propregex; |
|||
regex_t *tagregex; |
|||
} Regs; |
|||
|
|||
TAGS |
|||
RULES |
|||
|
|||
static Regs *regs = NULL; |
|||
static unsigned int nrules = 0; |
|||
|
|||
/* extern */ |
|||
|
|||
void |
|||
compileregs(void) { |
|||
unsigned int i; |
|||
regex_t *reg; |
|||
|
|||
if(regs) |
|||
return; |
|||
nrules = sizeof rule / sizeof rule[0]; |
|||
regs = emallocz(nrules * sizeof(Regs)); |
|||
for(i = 0; i < nrules; i++) { |
|||
if(rule[i].prop) { |
|||
reg = emallocz(sizeof(regex_t)); |
|||
if(regcomp(reg, rule[i].prop, REG_EXTENDED)) |
|||
free(reg); |
|||
else |
|||
regs[i].propregex = reg; |
|||
} |
|||
if(rule[i].tags) { |
|||
reg = emallocz(sizeof(regex_t)); |
|||
if(regcomp(reg, rule[i].tags, REG_EXTENDED)) |
|||
free(reg); |
|||
else |
|||
regs[i].tagregex = reg; |
|||
} |
|||
} |
|||
} |
|||
|
|||
Bool |
|||
isvisible(Client *c) { |
|||
unsigned int i; |
|||
|
|||
for(i = 0; i < ntags; i++) |
|||
if(c->tags[i] && seltag[i]) |
|||
return True; |
|||
return False; |
|||
} |
|||
|
|||
void |
|||
settags(Client *c, Client *trans) { |
|||
char prop[512]; |
|||
unsigned int i, j; |
|||
regmatch_t tmp; |
|||
Bool matched = trans != NULL; |
|||
XClassHint ch = { 0 }; |
|||
|
|||
if(matched) |
|||
for(i = 0; i < ntags; i++) |
|||
c->tags[i] = trans->tags[i]; |
|||
else { |
|||
XGetClassHint(dpy, c->win, &ch); |
|||
snprintf(prop, sizeof prop, "%s:%s:%s", |
|||
ch.res_class ? ch.res_class : "", |
|||
ch.res_name ? ch.res_name : "", c->name); |
|||
for(i = 0; i < nrules; i++) |
|||
if(regs[i].propregex && !regexec(regs[i].propregex, prop, 1, &tmp, 0)) { |
|||
c->isversatile = rule[i].isversatile; |
|||
for(j = 0; regs[i].tagregex && j < ntags; j++) { |
|||
if(!regexec(regs[i].tagregex, tags[j], 1, &tmp, 0)) { |
|||
matched = True; |
|||
c->tags[j] = True; |
|||
} |
|||
} |
|||
} |
|||
if(ch.res_class) |
|||
XFree(ch.res_class); |
|||
if(ch.res_name) |
|||
XFree(ch.res_name); |
|||
} |
|||
if(!matched) |
|||
for(i = 0; i < ntags; i++) |
|||
c->tags[i] = seltag[i]; |
|||
} |
|||
|
|||
void |
|||
tag(Arg *arg) { |
|||
unsigned int i; |
|||
|
|||
if(!sel) |
|||
return; |
|||
for(i = 0; i < ntags; i++) |
|||
sel->tags[i] = (arg->i == -1) ? True : False; |
|||
if(arg->i >= 0 && arg->i < ntags) |
|||
sel->tags[arg->i] = True; |
|||
lt->arrange(); |
|||
} |
|||
|
|||
void |
|||
toggletag(Arg *arg) { |
|||
unsigned int i; |
|||
|
|||
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; |
|||
lt->arrange(); |
|||
} |
|||
|
|||
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 */ |
|||
lt->arrange(); |
|||
} |
|||
|
|||
void |
|||
view(Arg *arg) { |
|||
unsigned int i; |
|||
|
|||
for(i = 0; i < ntags; i++) |
|||
seltag[i] = (arg->i == -1) ? True : False; |
|||
if(arg->i >= 0 && arg->i < ntags) |
|||
seltag[arg->i] = True; |
|||
lt->arrange(); |
|||
} |
|||
Loading…
Reference in new issue