dwm/tag.c

218 lines
3.3 KiB
C
Raw Normal View History

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.
*/
#include "dwm.h"
2006-07-19 17:42:08 +02:00
#include <regex.h>
#include <stdio.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>
/* static */
2006-07-15 16:30:50 +02:00
2006-07-19 17:42:08 +02:00
typedef struct {
const char *pattern;
char *tags[TLast];
Bool isfloat;
} Rule;
TAGS
RULES
2006-07-15 16:30:50 +02:00
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
appendtag(Arg *arg)
2006-07-15 16:30:50 +02:00
{
if(!sel)
2006-07-15 16:30:50 +02:00
return;
sel->tags[arg->i] = tags[arg->i];
2006-07-15 16:30:50 +02:00
arrange(NULL);
}
void
dofloat(Arg *arg)
{
Client *c;
for(c = clients; c; c = c->next) {
c->ismax = False;
if(c->tags[tsel]) {
resize(c, True, TopLeft);
}
2006-07-15 16:30:50 +02:00
else
ban(c);
}
if(sel && !sel->tags[tsel]) {
if((sel = getnext(clients))) {
2006-07-15 16:30:50 +02:00
higher(sel);
focus(sel);
}
2006-08-01 12:32:33 +02:00
else
XSetInputFocus(dpy, root, RevertToPointerRoot, CurrentTime);
2006-07-15 16:30:50 +02:00
}
drawall();
}
void
dotile(Arg *arg)
{
int n, i, w, h;
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-07-16 00:47:40 +02:00
if(c->tags[tsel] && !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) {
c->ismax = False;
2006-07-15 16:30:50 +02:00
if(c->tags[tsel]) {
2006-07-16 00:47:40 +02:00
if(c->isfloat) {
2006-07-15 16:30:50 +02:00
higher(c);
resize(c, True, TopLeft);
2006-07-15 16:30:50 +02:00
continue;
}
if(n == 1) {
c->x = sx;
c->y = sy + bh;
c->w = sw - 2;
c->h = sh - 2 - bh;
2006-07-15 16:30:50 +02:00
}
else if(i == 0) {
c->x = sx;
c->y = sy + bh;
c->w = mw - 2;
c->h = sh - 2 - bh;
2006-07-15 16:30:50 +02:00
}
else if(h > bh) {
c->x = sx + mw;
c->y = sy + (i - 1) * h + bh;
c->w = w - 2;
c->h = h - 2;
2006-07-15 16:30:50 +02: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 16:30:50 +02:00
i++;
}
else
ban(c);
}
if(!sel || (sel && !sel->tags[tsel])) {
if((sel = getnext(clients))) {
2006-07-15 16:30:50 +02:00
higher(sel);
focus(sel);
}
2006-08-01 12:32:33 +02:00
else
XSetInputFocus(dpy, root, RevertToPointerRoot, CurrentTime);
2006-07-15 16:30:50 +02:00
}
drawall();
}
Client *
getnext(Client *c)
2006-07-15 16:30:50 +02:00
{
for(; c && !c->tags[tsel]; c = c->next);
return c;
2006-07-15 16:30:50 +02:00
}
Client *
getprev(Client *c)
{
for(; c && !c->tags[tsel]; c = c->prev);
return c;
}
2006-07-15 16:30:50 +02:00
void
replacetag(Arg *arg)
{
int i;
2006-07-20 12:18:06 +02:00
2006-07-15 16:30:50 +02:00
if(!sel)
return;
for(i = 0; i < TLast; i++)
sel->tags[i] = NULL;
appendtag(arg);
}
void
settags(Client *c)
{
2006-07-19 17:42:08 +02:00
char classinst[256];
static unsigned int len = sizeof(rule) / sizeof(rule[0]);
unsigned int i, j;
2006-07-19 17:42:08 +02:00
regex_t regex;
regmatch_t tmp;
Bool matched = False;
2006-07-19 17:42:08 +02:00
XClassHint ch;
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 : "");
for(i = 0; !matched && i < len; i++) {
if(!regcomp(&regex, rule[i].pattern, 0)) {
if(!regexec(&regex, classinst, 1, &tmp, 0)) {
for(j = 0; j < TLast; j++) {
if(rule[i].tags[j])
matched = True;
c->tags[j] = rule[i].tags[j];
2006-07-19 17:42:08 +02:00
}
2006-07-16 00:47:40 +02:00
c->isfloat = rule[i].isfloat;
}
2006-07-19 17:42:08 +02:00
regfree(&regex);
}
}
if(ch.res_class)
XFree(ch.res_class);
if(ch.res_name)
XFree(ch.res_name);
}
if(!matched)
c->tags[tsel] = tags[tsel];
}
void
togglemode(Arg *arg)
{
arrange = arrange == dofloat ? dotile : dofloat;
arrange(NULL);
}
void
view(Arg *arg)
{
tsel = arg->i;
arrange(NULL);
drawall();
}
void
viewnext(Arg *arg)
{
arg->i = (tsel < TLast-1) ? tsel+1 : 0;
view(arg);
}
void
viewprev(Arg *arg)
{
arg->i = (tsel > 0) ? tsel-1 : TLast-1;
view(arg);
}