/*

 * (C)opyright MMVI Anselm R. Garbe <garbeam at gmail dot com>

 * See LICENSE file for license details.

 */

#include "dwm.h"

#include <stdio.h>

/* static */

static Client *

	Client *c, *min;

	if((clients && clients->isfloat) || arrange == dofloat)

		return clients; /* don't touch floating order */

	for(min = c = clients; c; c = c->next)

		if(c->weight < min->weight)

			min = c;

	return min;

}

static void

	Client *c, *newclients, *tail;

	newclients = tail = NULL;

	while((c = minclient())) {

		detach(c);

		if(tail) {

			c->prev = tail;

			tail->next = c;

			tail = c;

		}

		else

			tail = newclients = c;

	}

	clients = newclients;

}

static Client *

	for(c = getnext(c); c && c->isfloat; c = getnext(c->next));

	return c;

}

/* extern */

void (*arrange)(Arg *) = DEFMODE;

void

	if(c->prev)

		c->prev->next = c->next;

	if(c->next)

		c->next->prev = c->prev;

	if(c == clients)

		clients = c->next;

	c->next = c->prev = NULL;

}

void

	Client *c;

	maximized = False;

	for(c = clients; c; c = c->next) {

		if(isvisible(c)) {

			resize(c, True, TopLeft);

		}

		else

			ban(c);

	}

	if(!sel || !isvisible(sel)) {

		for(c = stack; c && !isvisible(c); c = c->snext);

		focus(c);

	}

	restack();

}

void

	int h, i, n, w;

	Client *c;

	maximized = False;

	w = sw - mw;

	for(n = 0, c = clients; c; c = c->next)

		if(isvisible(c) && !c->isfloat)

			n++;

	if(n > 1)

		h = (sh - bh) / (n - 1);

	else

		h = sh - bh;

	for(i = 0, c = clients; c; c = c->next) {

		if(isvisible(c)) {

			if(c->isfloat) {

				resize(c, True, TopLeft);

				continue;

			}

			if(n == 1) {

				c->x = sx;

				c->y = sy + bh;

				c->w = sw - 2;

				c->h = sh - 2 - bh;

			}

			else if(i == 0) {

				c->x = sx;

				c->y = sy + bh;

				c->w = mw - 2;

				c->h = sh - 2 - bh;

			}

			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;

			}

			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);

			i++;

		}

		else

			ban(c);

	}

	if(!sel || !isvisible(sel)) {

		for(c = stack; c && !isvisible(c); c = c->snext);

		focus(c);

	}

	restack();

}

void

	Client *c;

	if(!sel)

		return;

	if(!(c = getnext(sel->next)))

		c = getnext(clients);

	if(c) {

		focus(c);

		restack();

	}

}

void

	Client *c;

	if(!sel)

		return;

	if(!(c = getprev(sel->prev))) {

		for(c = clients; c && c->next; c = c->next);

		c = getprev(c);

	}

	if(c) {

		focus(c);

		restack();

	}

}

Bool

	unsigned int i;

	for(i = 0; i < ntags; i++)

		if(c->tags[i] && seltag[i])

			return True;

	return False;

}

void

	unsigned int n;

	Client *c;

	for(n = 0, c = clients; c; c = c->next)

		if(isvisible(c) && !c->isfloat)

			n++;

	if(!sel || sel->isfloat || n < 2 || (arrange != dotile) || maximized)

		return;

	if(sel == getnext(clients)) {

		if(mw + arg->i > sw - 100 || mw + arg->i < 100)

			return;

		mw += arg->i;

	}

	else {

		if(mw - arg->i > sw - 100 || mw - arg->i < 100)

			return;

		mw -= arg->i;

	}

	arrange(NULL);

}

void

	Client *c;

	XEvent ev;

	if(!sel) {

		drawstatus();

		return;

	}

	if(sel->isfloat || arrange == dofloat) {

		XRaiseWindow(dpy, sel->win);

		XRaiseWindow(dpy, sel->twin);

	}

	if(arrange != dofloat)

		for(c = nexttiled(clients); c; c = nexttiled(c->next)) {

			XLowerWindow(dpy, c->twin);

			XLowerWindow(dpy, c->win);

		}

	drawall();

	XSync(dpy, False);

	while(XCheckMaskEvent(dpy, EnterWindowMask, &ev));

}

void

	arrange = (arrange == dofloat) ? dotile : dofloat;

	if(sel)

		arrange(NULL);

	else

		drawstatus();

}

void

	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 */

	reorder();

	arrange(NULL);

}

void

	unsigned int i;

	for(i = 0; i < ntags; i++)

		seltag[i] = False;

	seltag[arg->i] = True;

	reorder();

	arrange(NULL);

}

void

	unsigned int i;

	for(i = 0; i < ntags; i++)

		seltag[i] = True;

	reorder();

	arrange(NULL);

}

void

	unsigned int n;

	Client *c;

	for(n = 0, c = clients; c; c = c->next)

		if(isvisible(c) && !c->isfloat)

			n++;

	if(!sel || sel->isfloat || n < 2 || (arrange != dotile) || maximized)

		return;

	if((c = sel) == nexttiled(clients))

		if(!(c = nexttiled(c->next)))

			return;

	detach(c);

	if(clients)

		clients->prev = c;

	c->next = clients;

	clients = c;

	focus(c);

	arrange(NULL);

}