1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
|
/*
* 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 Lesser General Public
* License as published by the Free Software Foundation; either
* version 2.1 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
* Lesser General Public License for more details.
*
* You should have received a copy of the GNU Lesser General Public
* License along with this library; if not, write to the
* Free Software Foundation, Inc., 51 Franklin Street, Fifth Floor,
* Boston, MA 02110-1301, USA.
*/
#include <config.h>
#include <glib.h>
#include "reentrant-list.h"
typedef struct
{
GList **list;
GList *iterator;
} Iteration;
static GSList *working_list = NULL; /* of Iteration */
/*
* 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;
GList *dummy G_GNUC_UNUSED;
g_return_if_fail (element_ptr != NULL);
element = *element_ptr;
g_return_if_fail (element != NULL);
next = element->next;
first_item = (element->prev == NULL);
dummy = 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);
}
|
