source: trunk/third/at-spi/libspi/util.c @ 21048

/*
 * AT-SPI - Assistive Technology Service Provider Interface
 * (Gnome Accessibility Project; http://developer.gnome.org/projects/gap)
 *
 * Copyright 2001, 2002 Sun Microsystems Inc.,
 * Copyright 2001, 2002 Ximian, Inc.
 *
 * This library is free software; you can redistribute it and/or
 * modify it under the terms of the GNU Library General Public
 * License as published by the Free Software Foundation; either
 * version 2 of the License, or (at your option) any later version.
 *
 * This library 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
 * Library General Public License for more details.
 *
 * You should have received a copy of the GNU Library General Public
 * License along with this library; if not, write to the
 * Free Software Foundation, Inc., 59 Temple Place - Suite 330,
 * Boston, MA 02111-1307, USA.
 */

#include <glib/gmessages.h>
#include <glib/gslist.h>
#include <Accessibility.h>

#include "spi-private.h"

typedef struct {
        GList **list;
        GList  *iterator;
} Iteration;

static GSList *working_list = NULL; /* of Iteration */

static char *spi_atk_bridge_null_string = "";

/*
 *   deletes an element from the list - in a re-entrant
 * safe fashion; advances the element pointer to the next
 * element.
 */
void
spi_re_entrant_list_delete_link (GList * const *element_ptr)
{
  GSList    *l;
  GList     *next;
  GList     *element;
  gboolean   first_item;

  g_return_if_fail (element_ptr != NULL);

  element = *element_ptr;
  g_return_if_fail (element != NULL);

  next = element->next;
  first_item = (element->prev == NULL);

  g_list_remove_link (NULL, element);

  for (l = working_list; l; l = l->next)
    {
       Iteration *i = l->data;

       if (i->iterator == element)
         {
           i->iterator = next;
         }

       if (first_item && *(i->list) == element)
         {
           *(i->list) = next;
         }
    }

  g_list_free_1 (element);
}

void
spi_re_entrant_list_foreach (GList         **list,
                             SpiReEntrantFn  func,
                             gpointer        user_data)
{
        Iteration i;

        if (!list || !*list)
          {
            return;
          }

        i.list = list;
        i.iterator = *list;

        working_list = g_slist_prepend (working_list, &i);

        while (i.iterator) {
                GList *l = i.iterator;

                func (&i.iterator, user_data);

                if (i.iterator == l)
                        i.iterator = i.iterator->next;
        }

        working_list = g_slist_remove (working_list, &i);
}

void 
spi_init_any_nil (CORBA_any *any)
{
  any->_type = TC_null;
  any->_value = NULL;
  any->_release = FALSE;
}

void 
spi_init_any_object (CORBA_any *any, CORBA_Object *o)
{
  CORBA_Environment ev;
  CORBA_exception_init (&ev);
  
  any->_type = TC_CORBA_Object;
  any->_value = o;
  any->_release = FALSE;
  CORBA_exception_free (&ev);
}

void
spi_init_any_string (CORBA_any *any, char **string_pointer)
{  
  any->_type = (CORBA_TypeCode) TC_CORBA_string;
  if (string_pointer && *string_pointer)
    any->_value = string_pointer;
  else
    any->_value = &spi_atk_bridge_null_string;
  any->_release = FALSE;
}

void
spi_init_any_rect (CORBA_any *any, AtkRectangle *rect)
{
    Accessibility_BoundingBox *box = Accessibility_BoundingBox__alloc ();
    box->x = rect->x;
    box->y = rect->y;
    box->width = rect->width;
    box->height = rect->height;
    any->_type = TC_Accessibility_BoundingBox;
    any->_value = box;
    any->_release = TRUE;
}