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
|
//
// "$Id: Fl_add_idle.cxx 5190 2006-06-09 16:16:34Z mike $"
//
// Idle routine support for the Fast Light Tool Kit (FLTK).
//
// Copyright 1998-2005 by Bill Spitzak and others.
//
// 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.
//
// Please report all bugs and problems on the following page:
//
// http://www.fltk.org/str.php
//
// Allows you to manage an arbitrary set of idle() callbacks.
// Replaces the older set_idle() call (which is used to implement this)
#include <FL/Fl.H>
struct idle_cb {
void (*cb)(void*);
void* data;
idle_cb *next;
};
// the callbacks are stored linked in a ring. last points at the one
// just called, first at the next to call. last->next == first.
static idle_cb* first;
static idle_cb* last;
static idle_cb* freelist;
static void call_idle() {
idle_cb* p = first;
last = p; first = p->next;
p->cb(p->data); // this may call add_idle() or remove_idle()!
}
void Fl::add_idle(void (*cb)(void*), void* data) {
idle_cb* p = freelist;
if (p) freelist = p->next;
else p = new idle_cb;
p->cb = cb;
p->data = data;
if (first) {
last->next = p;
last = p;
p->next = first;
} else {
first = last = p;
p->next = p;
set_idle(call_idle);
}
}
int Fl::has_idle(void (*cb)(void*), void* data) {
idle_cb* p = first;
if (!p) return 0;
for (;; p = p->next) {
if (p->cb == cb && p->data == data) return 1;
if (p==last) return 0;
}
}
void Fl::remove_idle(void (*cb)(void*), void* data) {
idle_cb* p = first;
if (!p) return;
idle_cb* l = last;
for (;; p = p->next) {
if (p->cb == cb && p->data == data) break;
if (p==last) return; // not found
l = p;
}
if (l == p) { // only one
first = last = 0;
set_idle(0);
} else {
last = l;
first = l->next = p->next;
}
p->next = freelist;
freelist = p;
}
//
// End of "$Id: Fl_add_idle.cxx 5190 2006-06-09 16:16:34Z mike $".
//
|