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
150
151
152
153
154
155
156
157
158
159
160
161
162
163
164
165
166
167
168
169
170
171
172
173
174
175
176
177
178
179
180
181
182
183
184
185
186
187
188
189
190
191
192
193
194
195
196
197
198
199
200
201
202
203
204
205
206
207
208
209
210
211
212
213
214
215
216
217
218
219
220
221
222
223
224
225
|
/* $OpenLDAP$ */
/* This work is part of OpenLDAP Software <http://www.openldap.org/>.
*
* Copyright 2003-2024 The OpenLDAP Foundation.
* Portions Copyright 2003 IBM Corporation.
* All rights reserved.
*
* Redistribution and use in source and binary forms, with or without
* modification, are permitted only as authorized by the OpenLDAP
* Public License.
*
* A copy of this license is available in file LICENSE in the
* top-level directory of the distribution or, alternatively, at
* <http://www.OpenLDAP.org/license.html>.
*/
/* This work was initially developed by Jong Hyuk Choi for inclusion
* in OpenLDAP Software.
*/
#include "portable.h"
#include <stdio.h>
#include <ac/stdarg.h>
#include <ac/stdlib.h>
#include <ac/errno.h>
#include <ac/socket.h>
#include <ac/string.h>
#include <ac/time.h>
#include "ldap-int.h"
#ifdef LDAP_R_COMPILE
#include "ldap_pvt_thread.h"
#include "ldap_queue.h"
#include "ldap_rq.h"
struct re_s *
ldap_pvt_runqueue_insert(
struct runqueue_s* rq,
time_t interval,
ldap_pvt_thread_start_t *routine,
void *arg,
char *tname,
char *tspec
)
{
struct re_s* entry;
entry = (struct re_s *) LDAP_CALLOC( 1, sizeof( struct re_s ));
if ( entry ) {
entry->interval.tv_sec = interval;
entry->interval.tv_usec = 0;
entry->next_sched.tv_sec = time( NULL );
entry->next_sched.tv_usec = 0;
entry->routine = routine;
entry->arg = arg;
entry->tname = tname;
entry->tspec = tspec;
LDAP_STAILQ_INSERT_HEAD( &rq->task_list, entry, tnext );
}
return entry;
}
struct re_s *
ldap_pvt_runqueue_find(
struct runqueue_s *rq,
ldap_pvt_thread_start_t *routine,
void *arg
)
{
struct re_s* e;
LDAP_STAILQ_FOREACH( e, &rq->task_list, tnext ) {
if ( e->routine == routine && e->arg == arg )
return e;
}
return NULL;
}
void
ldap_pvt_runqueue_remove(
struct runqueue_s* rq,
struct re_s* entry
)
{
struct re_s* e;
LDAP_STAILQ_FOREACH( e, &rq->task_list, tnext ) {
if ( e == entry)
break;
}
assert( e == entry );
LDAP_STAILQ_REMOVE( &rq->task_list, entry, re_s, tnext );
LDAP_FREE( entry );
}
struct re_s*
ldap_pvt_runqueue_next_sched(
struct runqueue_s* rq,
struct timeval* next_run
)
{
struct re_s* entry;
entry = LDAP_STAILQ_FIRST( &rq->task_list );
if ( entry == NULL || entry->next_sched.tv_sec == 0 ) {
return NULL;
} else {
*next_run = entry->next_sched;
return entry;
}
}
void
ldap_pvt_runqueue_runtask(
struct runqueue_s* rq,
struct re_s* entry
)
{
LDAP_STAILQ_INSERT_TAIL( &rq->run_list, entry, rnext );
}
void
ldap_pvt_runqueue_stoptask(
struct runqueue_s* rq,
struct re_s* entry
)
{
LDAP_STAILQ_REMOVE( &rq->run_list, entry, re_s, rnext );
}
int
ldap_pvt_runqueue_isrunning(
struct runqueue_s* rq,
struct re_s* entry
)
{
struct re_s* e;
LDAP_STAILQ_FOREACH( e, &rq->run_list, rnext ) {
if ( e == entry ) {
return 1;
}
}
return 0;
}
void
ldap_pvt_runqueue_resched(
struct runqueue_s* rq,
struct re_s* entry,
int defer
)
{
struct re_s* prev;
struct re_s* e;
LDAP_STAILQ_FOREACH( e, &rq->task_list, tnext ) {
if ( e == entry )
break;
}
assert ( e == entry );
LDAP_STAILQ_REMOVE( &rq->task_list, entry, re_s, tnext );
if ( !defer ) {
entry->next_sched.tv_sec = time( NULL ) + entry->interval.tv_sec;
} else {
entry->next_sched.tv_sec = 0;
}
if ( LDAP_STAILQ_EMPTY( &rq->task_list )) {
LDAP_STAILQ_INSERT_HEAD( &rq->task_list, entry, tnext );
} else if ( entry->next_sched.tv_sec == 0 ) {
LDAP_STAILQ_INSERT_TAIL( &rq->task_list, entry, tnext );
} else {
prev = NULL;
LDAP_STAILQ_FOREACH( e, &rq->task_list, tnext ) {
if ( e->next_sched.tv_sec == 0 ) {
if ( prev == NULL ) {
LDAP_STAILQ_INSERT_HEAD( &rq->task_list, entry, tnext );
} else {
LDAP_STAILQ_INSERT_AFTER( &rq->task_list, prev, entry, tnext );
}
return;
} else if ( e->next_sched.tv_sec > entry->next_sched.tv_sec ) {
if ( prev == NULL ) {
LDAP_STAILQ_INSERT_HEAD( &rq->task_list, entry, tnext );
} else {
LDAP_STAILQ_INSERT_AFTER( &rq->task_list, prev, entry, tnext );
}
return;
}
prev = e;
}
LDAP_STAILQ_INSERT_TAIL( &rq->task_list, entry, tnext );
}
}
int
ldap_pvt_runqueue_persistent_backload(
struct runqueue_s* rq
)
{
struct re_s* e;
int count = 0;
ldap_pvt_thread_mutex_lock( &rq->rq_mutex );
if ( !LDAP_STAILQ_EMPTY( &rq->task_list )) {
LDAP_STAILQ_FOREACH( e, &rq->task_list, tnext ) {
if ( e->next_sched.tv_sec == 0 )
count++;
}
}
ldap_pvt_thread_mutex_unlock( &rq->rq_mutex );
return count;
}
#endif /* LDAP_R_COMPILE */
|
