Logo Search packages:      
Sourcecode: sawfish version File versions

stacking-list.c

/* stacking-list.c -- maintain the stacking-ordered window list

   $Id: stacking-list.c,v 1.6 2002/09/22 05:31:34 jsh Exp $

   Copyright (C) 2001 Eazel, Inc.

   This file is part of sawfish.

   sawfish is free software; you can redistribute it and/or modify it
   under the terms of the GNU General Public License as published by
   the Free Software Foundation; either version 2, or (at your option)
   any later version.

   sawfish is distributed in the hope that it will be useful, but
   WITHOUT ANY WARRANTY; without even the implied warranty of
   MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the
   GNU General Public License for more details.

   You should have received a copy of the GNU General Public License
   along with sawfish; see the file COPYING.   If not, write to
   the Free Software Foundation, 675 Mass Ave, Cambridge, MA 02139, USA.

   Authors: John Harper <jsh@eazel.com>  */

#include "sawmill.h"
#include <assert.h>

static Lisp_Window *lowest_window, *highest_window;


/* Assertions and consistency checking */

#if !defined (NDEBUG)
static void
assert_constraints (Lisp_Window *w)
{
    nonterminal_assert (w->above == 0 || WINDOWP (rep_VAL (w->above)));
    nonterminal_assert (w->below == 0 || WINDOWP (rep_VAL (w->below)));
    nonterminal_assert (lowest_window == 0 || WINDOWP (rep_VAL (lowest_window)));
    nonterminal_assert (highest_window == 0 || WINDOWP (rep_VAL (highest_window)));
}
#else
# define assert_constraints(w) do { ; } while (0)
#endif


/* Stacking list manipulation */

/* Return true if window W is currently in the stacking list. */
bool
window_in_stacking_list_p (Lisp_Window *w)
{
    Lisp_Window *ptr;
    for (ptr = lowest_window; ptr != 0; ptr = ptr->above)
    {
      if (ptr == w)
          return TRUE;
    }
    return FALSE;
}

/* Remove window W from the stacking list */
void
remove_from_stacking_list (Lisp_Window *w)
{
    return_if_fail (!WINDOW_IS_GONE_P (w));
    return_if_fail (window_in_stacking_list_p (w));

    /* divert the links around W */

    if (w->above != 0)
      w->above->below = w->below;
    if (w->below != 0)
      w->below->above = w->above;

    /* Fix the end points */

    if (lowest_window == w)
      lowest_window = w->above;
    if (highest_window == w)
      highest_window = w->below;

    w->above = w->below = 0;

    assert_constraints (w);
}

/* Insert W at the top of the stacking list */
void
insert_in_stacking_list_above_all (Lisp_Window *w)
{
    return_if_fail (!WINDOW_IS_GONE_P (w));
    return_if_fail (!window_in_stacking_list_p (w));

    w->above = 0;
    w->below = highest_window;
    if (highest_window != 0)
      highest_window->above = w;
    highest_window = w;
    if (lowest_window == 0)
      lowest_window = w;

    assert_constraints (w);
}

/* Insert W at the bottom of the stacking list */
void
insert_in_stacking_list_below_all (Lisp_Window *w)
{
    return_if_fail (!WINDOW_IS_GONE_P (w));
    return_if_fail (!window_in_stacking_list_p (w));

    w->below = 0;
    w->above = lowest_window;
    if (lowest_window != 0)
      lowest_window->below = w;
    lowest_window = w;
    if (highest_window == 0)
      highest_window = w;

    assert_constraints (w);
}

/* Insert W immediately above X */
void
insert_in_stacking_list_above (Lisp_Window *w, Lisp_Window *x)
{
    return_if_fail (!WINDOW_IS_GONE_P (w) && !WINDOW_IS_GONE_P (x));
    return_if_fail (!window_in_stacking_list_p (w));
    return_if_fail (window_in_stacking_list_p (x));

    if (x->above != 0)
      x->above->below = w;

    w->above = x->above;
    x->above = w;
    w->below = x;

    if (highest_window == x)
      highest_window = w;

    assert_constraints (w);
}

/* Insert W immediately below X */
void
insert_in_stacking_list_below (Lisp_Window *w, Lisp_Window *x)
{
    return_if_fail (!WINDOW_IS_GONE_P (w) && !WINDOW_IS_GONE_P (x));
    return_if_fail (!window_in_stacking_list_p (w));
    return_if_fail (window_in_stacking_list_p (x));

    if (x->below != 0)
      x->below->above = w;

    w->below = x->below;
    x->below = w;
    w->above = x;

    if (lowest_window == x)
      lowest_window = w;

    assert_constraints (w);
}


/* Making the X stacking order reflect the stacking list */

static inline Window
stackable_window_id (Lisp_Window *w)
{
    return w->reparented ? w->frame : w->id;
}

/* Make the physical stacking position of W match its current position
   in the stacking list. Tries to stack relative to the window above W
   before trying the window below W (if there's no window above W). */
void
restack_window (Lisp_Window *w)
{
    if (!WINDOW_IS_GONE_P (w))
    {
      XWindowChanges wc;
      u_int mask = 0;

      return_if_fail (window_in_stacking_list_p (w));

      if (w->above != 0)
      {
          wc.stack_mode = Below;
          wc.sibling = stackable_window_id (w->above);
          mask = CWStackMode | CWSibling;
      }
      else if (w->below != 0)
      {
          wc.stack_mode = Above;
          wc.sibling = stackable_window_id (w->below);
          mask = CWStackMode | CWSibling;
      }

      if (mask != 0)
          XConfigureWindow (dpy, stackable_window_id (w), mask, &wc);
    }
}


/* Miscellaneous public functions */

/* Return a list of windows in top->bottom order */
repv
make_stacking_list (void)
{
    repv out = Qnil;
    Lisp_Window *ptr;
    for (ptr = lowest_window; ptr != 0; ptr = ptr->above)
      out = Fcons (rep_VAL (ptr), out);
    return out;
}

Generated by  Doxygen 1.6.0   Back to index