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
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
|
/*
Window Update routines
Gaby Databases Builder
Copyright (C) 1998 Ron Bessems
Contact me via email at R.E.M.W.Bessems@stud.tue.nl
This program 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 of the License, or
(at your option) any later version.
This program 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 this program; if not, write to the Free Software
Foundation, Inc., 675 Mass Ave, Cambridge, MA 02139, USA.
We get an update in version 0.7 (or somewhat later :)
*/
#include "main.h"
struct update
{
GtkWidget *widget;
gpointer data;
void (*update_func) (GtkWidget * widget, gpointer data);
};
static GList *update_list = NULL;
void
add_update (GtkWidget * widget, gpointer data,
void (*update_func) (GtkWidget * widget, gpointer data))
{
struct update *ud;
#ifdef DEBUG_GABY
debug_print ("Add update\n");
debug_print ("Number of items in list after addition : %d\n",
g_list_length (update_list) + 1);
#endif
ud = g_malloc (sizeof (struct update));
ud->widget = widget;
ud->data = data;
ud->update_func = update_func;
update_list = g_list_append (update_list, ud);
}
void
remove_update (GtkWidget * widget)
{
GList *ul = NULL;
struct update *ud;
#ifdef DEBUG_GABY
debug_print ("Remove update\n");
#endif
ul = update_list;
ul = g_list_first (ul);
while (ul != NULL)
{
ud = ul->data;
if (ud->widget == widget)
{
#ifdef DEBUG_GABY
debug_print ("Remove !\n");
#endif
update_list = g_list_remove (update_list, ud);
ul = g_list_first (update_list);
g_free (ud);
}
if (ul != NULL)
ul = ul->next;
}
}
void
update_widget (GtkWidget * widget)
{
GList *ul = NULL;
struct update *ud;
#ifdef DEBUG_GABY
debug_print ("Widget update\n");
#endif
ul = update_list;
ul = g_list_first (ul);
while (ul != NULL)
{
ud = ul->data;
if (ud->widget == widget)
{
#ifdef DEBUG_GABY
debug_print ("Callback !\n");
#endif
ud->update_func (ud->widget, ud->data);
}
ul = ul->next;
}
}
void
update_all ()
{
GList *ul = NULL;
struct update *ud;
#ifdef DEBUG_GABY
debug_print ("Update all\n");
#endif /* DEBUG_GABY */
ul = update_list;
ul = g_list_first (ul);
while (ul != NULL)
{
ud = ul->data;
ud->update_func (ud->widget, ud->data);
ul = ul->next;
}
}
/* Update all widget expect for e Needed to avoid endless recursive
updates */
void
update_all_e (GtkWidget *e)
{
GList *ul = NULL;
struct update *ud;
#ifdef DEBUG_GABY
debug_print ("Update all\n");
#endif /* DEBUG_GABY */
ul = update_list;
ul = g_list_first (ul);
while (ul != NULL)
{
ud = ul->data;
if (ud->widget != e)
ud->update_func (ud->widget, ud->data);
ul = ul->next;
}
}
|
