f062e958e0
respectively. ok okan.
352 lines
7.0 KiB
C
352 lines
7.0 KiB
C
/*
|
|
* calmwm - the calm window manager
|
|
*
|
|
* Copyright (c) 2004 Andy Adamson <dros@monkey.org>
|
|
* Copyright (c) 2004,2005 Marius Aamodt Eriksen <marius@monkey.org>
|
|
*
|
|
* Permission to use, copy, modify, and distribute this software for any
|
|
* purpose with or without fee is hereby granted, provided that the above
|
|
* copyright notice and this permission notice appear in all copies.
|
|
*
|
|
* THE SOFTWARE IS PROVIDED "AS IS" AND THE AUTHOR DISCLAIMS ALL WARRANTIES
|
|
* WITH REGARD TO THIS SOFTWARE INCLUDING ALL IMPLIED WARRANTIES OF
|
|
* MERCHANTABILITY AND FITNESS. IN NO EVENT SHALL THE AUTHOR BE LIABLE FOR
|
|
* ANY SPECIAL, DIRECT, INDIRECT, OR CONSEQUENTIAL DAMAGES OR ANY DAMAGES
|
|
* WHATSOEVER RESULTING FROM LOSS OF USE, DATA OR PROFITS, WHETHER IN AN
|
|
* ACTION OF CONTRACT, NEGLIGENCE OR OTHER TORTIOUS ACTION, ARISING OUT OF
|
|
* OR IN CONNECTION WITH THE USE OR PERFORMANCE OF THIS SOFTWARE.
|
|
*
|
|
* $Id: group.c,v 1.11 2008/04/16 13:38:09 oga Exp $
|
|
*/
|
|
|
|
#include "headers.h"
|
|
#include "calmwm.h"
|
|
|
|
#define CALMWM_NGROUPS 9
|
|
|
|
int Groupnamemode = 0;
|
|
struct group_ctx *Group_active = NULL;
|
|
struct group_ctx Groups[CALMWM_NGROUPS];
|
|
char Group_name[256];
|
|
int Grouphideall = 0;
|
|
struct group_ctx_q Groupq;
|
|
|
|
static void
|
|
_group_add(struct group_ctx *gc, struct client_ctx *cc)
|
|
{
|
|
if (cc == NULL || gc == NULL)
|
|
errx(1, "_group_add: a ctx is NULL");
|
|
|
|
if (cc->group == gc)
|
|
return;
|
|
|
|
if (cc->group != NULL)
|
|
TAILQ_REMOVE(&cc->group->clients, cc, group_entry);
|
|
|
|
TAILQ_INSERT_TAIL(&gc->clients, cc, group_entry);
|
|
cc->group = gc;
|
|
}
|
|
|
|
static void
|
|
_group_remove(struct client_ctx *cc)
|
|
{
|
|
if (cc == NULL || cc->group == NULL)
|
|
errx(1, "_group_remove: a ctx is NULL");
|
|
|
|
TAILQ_REMOVE(&cc->group->clients, cc, group_entry);
|
|
cc->group = NULL;
|
|
cc->highlight = 0;
|
|
client_draw_border(cc);
|
|
}
|
|
|
|
static void
|
|
_group_hide(struct group_ctx *gc)
|
|
{
|
|
struct client_ctx *cc;
|
|
|
|
screen_updatestackingorder();
|
|
|
|
gc->nhidden = 0;
|
|
gc->highstack = 0;
|
|
TAILQ_FOREACH(cc, &gc->clients, group_entry) {
|
|
client_hide(cc);
|
|
gc->nhidden++;
|
|
if (cc->stackingorder > gc->highstack)
|
|
gc->highstack = cc->stackingorder;
|
|
}
|
|
gc->hidden = 1; /* XXX: equivalent to gc->nhidden > 0 */
|
|
}
|
|
|
|
static void
|
|
_group_show(struct group_ctx *gc)
|
|
{
|
|
struct client_ctx *cc;
|
|
Window *winlist;
|
|
u_int i;
|
|
int lastempty = -1;
|
|
|
|
winlist = (Window *) xcalloc(sizeof(*winlist), (gc->highstack + 1));
|
|
|
|
/*
|
|
* Invert the stacking order as XRestackWindows() expects them
|
|
* top-to-bottom.
|
|
*/
|
|
TAILQ_FOREACH(cc, &gc->clients, group_entry) {
|
|
winlist[gc->highstack - cc->stackingorder] = cc->pwin;
|
|
client_unhide(cc);
|
|
}
|
|
|
|
/* Un-sparseify */
|
|
for (i = 0; i <= gc->highstack; i++) {
|
|
if (!winlist[i] && lastempty == -1)
|
|
lastempty = i;
|
|
else if (winlist[i] && lastempty != -1) {
|
|
winlist[lastempty] = winlist[i];
|
|
if (++lastempty == i)
|
|
lastempty = -1;
|
|
}
|
|
}
|
|
|
|
XRestackWindows(X_Dpy, winlist, gc->nhidden);
|
|
xfree(winlist);
|
|
|
|
gc->hidden = 0;
|
|
Group_active = gc;
|
|
}
|
|
|
|
void
|
|
group_init(void)
|
|
{
|
|
int i;
|
|
|
|
TAILQ_INIT(&Groupq);
|
|
|
|
for (i = 0; i < CALMWM_NGROUPS; i++) {
|
|
TAILQ_INIT(&Groups[i].clients);
|
|
Groups[i].hidden = 0;
|
|
Groups[i].shortcut = i + 1;
|
|
TAILQ_INSERT_TAIL(&Groupq, &Groups[i], entry);
|
|
}
|
|
|
|
Group_active = &Groups[0];
|
|
}
|
|
|
|
/*
|
|
* Colouring for groups upon add/remove.
|
|
*/
|
|
void
|
|
group_sticky_toggle_enter(struct client_ctx *cc)
|
|
{
|
|
struct group_ctx *gc = Group_active;
|
|
|
|
if (gc == cc->group) {
|
|
_group_remove(cc);
|
|
cc->highlight = CLIENT_HIGHLIGHT_RED;
|
|
} else {
|
|
_group_add(gc, cc);
|
|
cc->highlight = CLIENT_HIGHLIGHT_BLUE;
|
|
}
|
|
|
|
client_draw_border(cc);
|
|
}
|
|
|
|
void
|
|
group_sticky_toggle_exit(struct client_ctx *cc)
|
|
{
|
|
cc->highlight = 0;
|
|
client_draw_border(cc);
|
|
}
|
|
|
|
/*
|
|
* selection list display
|
|
*/
|
|
|
|
/* if group_hidetoggle would produce no effect, toggle the group's hidden state
|
|
*/
|
|
void
|
|
_group_fix_hidden_state(struct group_ctx *gc)
|
|
{
|
|
struct client_ctx *cc;
|
|
int same = 0;
|
|
|
|
TAILQ_FOREACH(cc, &gc->clients, group_entry) {
|
|
if (gc->hidden == ((cc->flags & CLIENT_HIDDEN) ? 1 : 0))
|
|
same++;
|
|
}
|
|
|
|
if (same == 0)
|
|
gc->hidden = !gc->hidden;
|
|
}
|
|
|
|
void
|
|
group_hidetoggle(int idx)
|
|
{
|
|
struct group_ctx *gc;
|
|
|
|
if (idx < 0 || idx >= CALMWM_NGROUPS)
|
|
err(1, "group_hidetoggle: index out of range (%d)", idx);
|
|
|
|
gc = &Groups[idx];
|
|
|
|
_group_fix_hidden_state(gc);
|
|
|
|
if (gc->hidden)
|
|
_group_show(gc);
|
|
else {
|
|
_group_hide(gc);
|
|
if (TAILQ_EMPTY(&gc->clients))
|
|
Group_active = gc;
|
|
}
|
|
}
|
|
|
|
#define GROUP_NEXT(gc, fwd) (fwd) ? \
|
|
TAILQ_NEXT(gc, entry) : TAILQ_PREV(gc, group_ctx_q, entry)
|
|
|
|
/*
|
|
* Jump to the next/previous active group. If none exist, then just
|
|
* stay put.
|
|
*/
|
|
void
|
|
group_slide(int fwd)
|
|
{
|
|
struct group_ctx *gc, *showgroup = NULL;
|
|
|
|
assert(Group_active != NULL);
|
|
|
|
gc = Group_active;
|
|
for (;;) {
|
|
gc = GROUP_NEXT(gc, fwd);
|
|
if (gc == NULL)
|
|
gc = fwd ? TAILQ_FIRST(&Groupq) :
|
|
TAILQ_LAST(&Groupq, group_ctx_q);
|
|
if (gc == Group_active)
|
|
break;
|
|
|
|
if (!TAILQ_EMPTY(&gc->clients) && showgroup == NULL)
|
|
showgroup = gc;
|
|
else if (!gc->hidden)
|
|
_group_hide(gc);
|
|
}
|
|
|
|
if (showgroup == NULL)
|
|
return;
|
|
|
|
_group_hide(Group_active);
|
|
|
|
if (showgroup->hidden)
|
|
_group_show(showgroup);
|
|
else
|
|
Group_active = showgroup;
|
|
}
|
|
|
|
/* called when a client is deleted */
|
|
void
|
|
group_client_delete(struct client_ctx *cc)
|
|
{
|
|
if (cc->group == NULL)
|
|
return;
|
|
|
|
TAILQ_REMOVE(&cc->group->clients, cc, group_entry);
|
|
cc->group = NULL; /* he he */
|
|
}
|
|
|
|
void
|
|
group_menu(XButtonEvent *e)
|
|
{
|
|
struct menu_q menuq;
|
|
struct menu *mi;
|
|
int i;
|
|
struct group_ctx *gc;
|
|
|
|
TAILQ_INIT(&menuq);
|
|
|
|
for (i = 0; i < CALMWM_NGROUPS; i++) {
|
|
gc = &Groups[i];
|
|
|
|
if (TAILQ_EMPTY(&gc->clients))
|
|
continue;
|
|
|
|
if (gc->name == NULL)
|
|
gc->name = xstrdup(shortcut_to_name[gc->shortcut]);
|
|
|
|
XCALLOC(mi, struct menu);
|
|
if (gc->hidden)
|
|
snprintf(mi->text, sizeof(mi->text), "%d: [%s]",
|
|
gc->shortcut, gc->name);
|
|
else
|
|
snprintf(mi->text, sizeof(mi->text), "%d: %s",
|
|
gc->shortcut, gc->name);
|
|
mi->ctx = gc;
|
|
TAILQ_INSERT_TAIL(&menuq, mi, entry);
|
|
}
|
|
|
|
if (TAILQ_EMPTY(&menuq))
|
|
return;
|
|
|
|
mi = (struct menu *)grab_menu(e, &menuq);
|
|
|
|
if (mi == NULL || mi->ctx == NULL)
|
|
goto cleanup;
|
|
|
|
gc = (struct group_ctx *)mi->ctx;
|
|
|
|
if (gc->hidden)
|
|
_group_show(gc);
|
|
else
|
|
_group_hide(gc);
|
|
|
|
cleanup:
|
|
while ((mi = TAILQ_FIRST(&menuq)) != NULL) {
|
|
TAILQ_REMOVE(&menuq, mi, entry);
|
|
xfree(mi);
|
|
}
|
|
}
|
|
|
|
void
|
|
group_alltoggle(void)
|
|
{
|
|
int i;
|
|
|
|
for (i = 0; i < CALMWM_NGROUPS; i++) {
|
|
if (Grouphideall)
|
|
_group_show(&Groups[i]);
|
|
else
|
|
_group_hide(&Groups[i]);
|
|
}
|
|
|
|
if (Grouphideall)
|
|
Grouphideall = 0;
|
|
else
|
|
Grouphideall = 1;
|
|
}
|
|
|
|
void
|
|
group_autogroup(struct client_ctx *cc)
|
|
{
|
|
struct autogroupwin *aw;
|
|
struct group_ctx *gc;
|
|
char group[CALMWM_MAXNAMELEN];
|
|
|
|
if (cc->app_class == NULL || cc->app_name == NULL)
|
|
return;
|
|
|
|
TAILQ_FOREACH(aw, &Conf.autogroupq, entry) {
|
|
if (strcmp(aw->class, cc->app_class) == 0 &&
|
|
(aw->name == NULL || strcmp(aw->name, cc->app_name) == 0)) {
|
|
strlcpy(group, aw->group, sizeof(group));
|
|
break;
|
|
}
|
|
}
|
|
|
|
TAILQ_FOREACH(gc, &Groupq, entry) {
|
|
if (strcmp(shortcut_to_name[gc->shortcut], group) == 0) {
|
|
_group_add(gc, cc);
|
|
return;
|
|
}
|
|
}
|
|
|
|
if (Conf.flags & CONF_STICKY_GROUPS)
|
|
_group_add(Group_active, cc);
|
|
|
|
}
|