2009-07-15 17:42:44 +00:00
|
|
|
/* $Id: layout-manual.c,v 1.4 2009-07-15 17:42:44 nicm Exp $ */
|
2009-05-18 21:01:38 +00:00
|
|
|
|
|
|
|
/*
|
|
|
|
* Copyright (c) 2009 Nicholas Marriott <nicm@users.sourceforge.net>
|
|
|
|
*
|
|
|
|
* 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 MIND, 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.
|
|
|
|
*/
|
|
|
|
|
|
|
|
#include <sys/types.h>
|
|
|
|
|
|
|
|
#include "tmux.h"
|
|
|
|
|
2009-05-18 21:29:11 +00:00
|
|
|
void layout_manual_v_update_offsets(struct window *);
|
2009-05-18 21:01:38 +00:00
|
|
|
|
|
|
|
void
|
2009-05-18 21:29:11 +00:00
|
|
|
layout_manual_v_refresh(struct window *w, unused int active_only)
|
2009-05-18 21:01:38 +00:00
|
|
|
{
|
|
|
|
struct window_pane *wp;
|
2009-07-15 17:42:44 +00:00
|
|
|
u_int npanes, total, height;
|
2009-05-18 21:01:38 +00:00
|
|
|
int left;
|
|
|
|
|
|
|
|
if (active_only)
|
|
|
|
return;
|
|
|
|
|
|
|
|
if (TAILQ_EMPTY(&w->panes))
|
|
|
|
return;
|
|
|
|
|
|
|
|
/* Check the new size. */
|
|
|
|
npanes = window_count_panes(w);
|
|
|
|
if (w->sy <= PANE_MINIMUM * npanes) {
|
2009-07-15 17:42:44 +00:00
|
|
|
/*
|
|
|
|
* Make the first pane the smaller of the minimum and total (it
|
|
|
|
* must fit to be visible) and the rest the minimum size.
|
|
|
|
*/
|
|
|
|
height = PANE_MINIMUM;
|
|
|
|
if (height > w->sy)
|
|
|
|
height = w->sy + 1;
|
|
|
|
TAILQ_FOREACH(wp, &w->panes, entry) {
|
|
|
|
if (wp == TAILQ_FIRST(&w->panes))
|
|
|
|
wp->sy = height - 1;
|
|
|
|
else
|
|
|
|
wp->sy = PANE_MINIMUM - 1;
|
2009-05-18 21:01:38 +00:00
|
|
|
}
|
2009-07-15 17:42:44 +00:00
|
|
|
/* And increase the first by the rest if possible. */
|
|
|
|
if (w->sy >= PANE_MINIMUM)
|
|
|
|
TAILQ_FIRST(&w->panes)->sy += 1 + w->sy % PANE_MINIMUM;
|
2009-05-18 21:01:38 +00:00
|
|
|
} else {
|
|
|
|
/* In theory they will all fit. Find the current total. */
|
|
|
|
total = 0;
|
|
|
|
TAILQ_FOREACH(wp, &w->panes, entry)
|
|
|
|
total += wp->sy;
|
|
|
|
total += npanes - 1;
|
|
|
|
|
|
|
|
/* Growing or shrinking? */
|
|
|
|
left = w->sy - total;
|
|
|
|
if (left > 0) {
|
|
|
|
/* Growing. Expand evenly. */
|
|
|
|
while (left > 0) {
|
|
|
|
TAILQ_FOREACH(wp, &w->panes, entry) {
|
|
|
|
wp->sy++;
|
|
|
|
if (--left == 0)
|
|
|
|
break;
|
|
|
|
}
|
|
|
|
}
|
|
|
|
} else {
|
|
|
|
/* Shrinking. Reduce evenly down to minimum. */
|
|
|
|
while (left < 0) {
|
|
|
|
TAILQ_FOREACH(wp, &w->panes, entry) {
|
|
|
|
if (wp->sy <= PANE_MINIMUM - 1)
|
|
|
|
continue;
|
|
|
|
wp->sy--;
|
|
|
|
if (++left == 0)
|
|
|
|
break;
|
|
|
|
}
|
|
|
|
}
|
|
|
|
}
|
|
|
|
}
|
|
|
|
|
|
|
|
/* Now do the resize. */
|
|
|
|
TAILQ_FOREACH(wp, &w->panes, entry) {
|
|
|
|
wp->sy--;
|
|
|
|
window_pane_resize(wp, w->sx, wp->sy + 1);
|
|
|
|
}
|
|
|
|
|
|
|
|
/* Fill in the offsets. */
|
2009-05-18 21:29:11 +00:00
|
|
|
layout_manual_v_update_offsets(w);
|
2009-05-18 21:01:38 +00:00
|
|
|
|
|
|
|
/* Switch the active window if necessary. */
|
|
|
|
window_set_active_pane(w, w->active);
|
|
|
|
}
|
|
|
|
|
|
|
|
void
|
2009-05-18 21:29:11 +00:00
|
|
|
layout_manual_v_resize(struct window_pane *wp, int adjust)
|
2009-05-18 21:01:38 +00:00
|
|
|
{
|
|
|
|
struct window *w = wp->window;
|
|
|
|
struct window_pane *wq;
|
|
|
|
|
|
|
|
if (adjust > 0) {
|
|
|
|
/*
|
|
|
|
* If this is not the last pane, keep trying to increase size
|
|
|
|
* and remove it from the next panes. If it is the last, do
|
|
|
|
* so on the previous pane.
|
|
|
|
*/
|
|
|
|
if (TAILQ_NEXT(wp, entry) == NULL) {
|
|
|
|
if (wp == TAILQ_FIRST(&w->panes)) {
|
|
|
|
/* Only one pane. */
|
|
|
|
return;
|
|
|
|
}
|
|
|
|
wp = TAILQ_PREV(wp, window_panes, entry);
|
|
|
|
}
|
|
|
|
while (adjust-- > 0) {
|
|
|
|
wq = wp;
|
|
|
|
while ((wq = TAILQ_NEXT(wq, entry)) != NULL) {
|
|
|
|
if (wq->sy <= PANE_MINIMUM)
|
|
|
|
continue;
|
|
|
|
window_pane_resize(wq, wq->sx, wq->sy - 1);
|
|
|
|
break;
|
|
|
|
}
|
|
|
|
if (wq == NULL)
|
|
|
|
break;
|
|
|
|
window_pane_resize(wp, wp->sx, wp->sy + 1);
|
|
|
|
}
|
|
|
|
} else {
|
|
|
|
adjust = -adjust;
|
|
|
|
/*
|
|
|
|
* If this is not the last pane, keep trying to reduce size
|
|
|
|
* and add to the following pane. If it is the last, do so on
|
|
|
|
* the previous pane.
|
|
|
|
*/
|
|
|
|
wq = TAILQ_NEXT(wp, entry);
|
|
|
|
if (wq == NULL) {
|
|
|
|
if (wp == TAILQ_FIRST(&w->panes)) {
|
|
|
|
/* Only one pane. */
|
|
|
|
return;
|
|
|
|
}
|
|
|
|
wq = wp;
|
|
|
|
wp = TAILQ_PREV(wq, window_panes, entry);
|
|
|
|
}
|
|
|
|
while (adjust-- > 0) {
|
|
|
|
if (wp->sy <= PANE_MINIMUM)
|
|
|
|
break;
|
|
|
|
window_pane_resize(wq, wq->sx, wq->sy + 1);
|
|
|
|
window_pane_resize(wp, wp->sx, wp->sy - 1);
|
|
|
|
}
|
|
|
|
}
|
|
|
|
|
2009-05-18 21:29:11 +00:00
|
|
|
layout_manual_v_update_offsets(w);
|
2009-05-18 21:01:38 +00:00
|
|
|
}
|
|
|
|
|
|
|
|
void
|
2009-05-18 21:29:11 +00:00
|
|
|
layout_manual_v_update_offsets(struct window *w)
|
2009-05-18 21:01:38 +00:00
|
|
|
{
|
|
|
|
struct window_pane *wp;
|
|
|
|
u_int yoff;
|
|
|
|
|
|
|
|
yoff = 0;
|
|
|
|
TAILQ_FOREACH(wp, &w->panes, entry) {
|
|
|
|
wp->xoff = 0;
|
|
|
|
wp->yoff = yoff;
|
|
|
|
yoff += wp->sy + 1;
|
|
|
|
}
|
|
|
|
}
|