dwm/tag.c

327 lines
5.3 KiB
C
Raw Normal View History

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