2003-05-07 10:06:01 +08:00
|
|
|
/* $OpenLDAP$ */
|
2003-11-26 15:16:36 +08:00
|
|
|
/* This work is part of OpenLDAP Software <http://www.openldap.org/>.
|
|
|
|
*
|
2005-01-02 04:49:32 +08:00
|
|
|
* Copyright 2003-2005 The OpenLDAP Foundation.
|
2003-11-26 15:16:36 +08:00
|
|
|
* Portions Copyright 2003 IBM Corporation.
|
|
|
|
* All rights reserved.
|
2003-11-12 08:25:48 +08:00
|
|
|
*
|
2003-11-26 15:16:36 +08:00
|
|
|
* Redistribution and use in source and binary forms, with or without
|
|
|
|
* modification, are permitted only as authorized by the OpenLDAP
|
|
|
|
* Public License.
|
2003-11-12 08:25:48 +08:00
|
|
|
*
|
2003-11-26 15:16:36 +08:00
|
|
|
* 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>.
|
2003-11-12 08:25:48 +08:00
|
|
|
*/
|
2003-11-27 08:33:55 +08:00
|
|
|
/* This work was initially developed by Jong Hyuk Choi for inclusion
|
|
|
|
* in OpenLDAP Software.
|
|
|
|
*/
|
2003-11-12 08:25:48 +08:00
|
|
|
|
2003-05-07 10:06:01 +08:00
|
|
|
#include "portable.h"
|
|
|
|
|
|
|
|
#include <stdio.h>
|
|
|
|
|
|
|
|
#include <ac/stdarg.h>
|
|
|
|
#include <ac/stdlib.h>
|
2003-09-27 14:48:15 +08:00
|
|
|
#include <ac/errno.h>
|
|
|
|
#include <ac/socket.h>
|
2003-05-07 10:06:01 +08:00
|
|
|
#include <ac/string.h>
|
|
|
|
#include <ac/time.h>
|
|
|
|
|
|
|
|
#include "ldap-int.h"
|
|
|
|
#include "ldap_pvt_thread.h"
|
|
|
|
#include "ldap_queue.h"
|
|
|
|
#include "ldap_rq.h"
|
|
|
|
|
|
|
|
void
|
|
|
|
ldap_pvt_runqueue_insert(
|
|
|
|
struct runqueue_s* rq,
|
|
|
|
time_t interval,
|
2003-05-08 07:52:08 +08:00
|
|
|
ldap_pvt_thread_start_t *routine,
|
|
|
|
void *arg
|
2003-05-07 10:06:01 +08:00
|
|
|
)
|
|
|
|
{
|
|
|
|
struct re_s* entry;
|
2003-05-08 06:29:26 +08:00
|
|
|
|
2003-05-15 05:30:25 +08:00
|
|
|
entry = (struct re_s *) LDAP_CALLOC( 1, sizeof( struct re_s ));
|
2003-05-07 10:06:01 +08:00
|
|
|
entry->interval.tv_sec = interval;
|
|
|
|
entry->interval.tv_usec = 0;
|
|
|
|
entry->next_sched.tv_sec = time( NULL );
|
|
|
|
entry->next_sched.tv_usec = 0;
|
2003-05-08 07:52:08 +08:00
|
|
|
entry->routine = routine;
|
|
|
|
entry->arg = arg;
|
2003-11-27 04:40:16 +08:00
|
|
|
LDAP_STAILQ_INSERT_TAIL( &rq->task_list, entry, tnext );
|
2003-05-07 10:06:01 +08:00
|
|
|
}
|
|
|
|
|
|
|
|
void
|
2003-05-08 06:29:26 +08:00
|
|
|
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;
|
|
|
|
}
|
|
|
|
|
2004-06-21 15:03:49 +08:00
|
|
|
assert( e == entry );
|
|
|
|
|
|
|
|
LDAP_STAILQ_REMOVE( &rq->task_list, entry, re_s, tnext );
|
2003-05-08 06:29:26 +08:00
|
|
|
|
2003-05-15 05:30:25 +08:00
|
|
|
LDAP_FREE( entry );
|
2003-05-08 06:29:26 +08:00
|
|
|
}
|
|
|
|
|
|
|
|
struct re_s*
|
2003-05-07 10:06:01 +08:00
|
|
|
ldap_pvt_runqueue_next_sched(
|
|
|
|
struct runqueue_s* rq,
|
2003-05-08 06:29:26 +08:00
|
|
|
struct timeval** next_run
|
2003-05-07 10:06:01 +08:00
|
|
|
)
|
|
|
|
{
|
|
|
|
struct re_s* entry;
|
2003-05-08 06:29:26 +08:00
|
|
|
|
|
|
|
entry = LDAP_STAILQ_FIRST( &rq->task_list );
|
2003-05-07 10:06:01 +08:00
|
|
|
if ( entry == NULL ) {
|
|
|
|
*next_run = NULL;
|
2003-05-08 06:29:26 +08:00
|
|
|
return NULL;
|
2003-05-21 07:52:11 +08:00
|
|
|
} else if ( entry->next_sched.tv_sec == 0 ) {
|
|
|
|
*next_run = NULL;
|
|
|
|
return NULL;
|
2003-05-07 10:06:01 +08:00
|
|
|
} else {
|
|
|
|
*next_run = &entry->next_sched;
|
2003-05-08 06:29:26 +08:00
|
|
|
return entry;
|
|
|
|
}
|
|
|
|
}
|
|
|
|
|
|
|
|
void
|
|
|
|
ldap_pvt_runqueue_runtask(
|
|
|
|
struct runqueue_s* rq,
|
|
|
|
struct re_s* entry
|
|
|
|
)
|
|
|
|
{
|
2003-11-27 04:40:16 +08:00
|
|
|
LDAP_STAILQ_INSERT_TAIL( &rq->run_list, entry, rnext );
|
2003-05-08 06:29:26 +08:00
|
|
|
}
|
|
|
|
|
|
|
|
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;
|
|
|
|
}
|
2003-05-07 10:06:01 +08:00
|
|
|
}
|
2003-05-08 06:29:26 +08:00
|
|
|
return 0;
|
2003-05-07 10:06:01 +08:00
|
|
|
}
|
|
|
|
|
|
|
|
void
|
|
|
|
ldap_pvt_runqueue_resched(
|
2003-05-08 06:29:26 +08:00
|
|
|
struct runqueue_s* rq,
|
2003-10-26 05:13:08 +08:00
|
|
|
struct re_s* entry,
|
|
|
|
int defer
|
2003-05-07 10:06:01 +08:00
|
|
|
)
|
|
|
|
{
|
|
|
|
struct re_s* prev;
|
|
|
|
struct re_s* e;
|
|
|
|
|
2003-05-08 06:29:26 +08:00
|
|
|
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 );
|
|
|
|
|
2004-06-18 13:04:03 +08:00
|
|
|
if ( !defer ) {
|
2003-05-21 07:52:11 +08:00
|
|
|
entry->next_sched.tv_sec = time( NULL ) + entry->interval.tv_sec;
|
|
|
|
} else {
|
|
|
|
entry->next_sched.tv_sec = 0;
|
|
|
|
}
|
|
|
|
|
2003-05-08 06:29:26 +08:00
|
|
|
if ( LDAP_STAILQ_EMPTY( &rq->task_list )) {
|
|
|
|
LDAP_STAILQ_INSERT_HEAD( &rq->task_list, entry, tnext );
|
2003-05-21 07:52:11 +08:00
|
|
|
} else if ( entry->next_sched.tv_sec == 0 ) {
|
|
|
|
LDAP_STAILQ_INSERT_TAIL( &rq->task_list, entry, tnext );
|
2003-05-07 10:06:01 +08:00
|
|
|
} else {
|
2003-05-08 06:29:26 +08:00
|
|
|
prev = NULL;
|
|
|
|
LDAP_STAILQ_FOREACH( e, &rq->task_list, tnext ) {
|
2003-05-21 07:52:11 +08:00
|
|
|
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 );
|
|
|
|
}
|
2003-11-27 04:40:16 +08:00
|
|
|
return;
|
2003-05-21 07:52:11 +08:00
|
|
|
} else if ( e->next_sched.tv_sec > entry->next_sched.tv_sec ) {
|
2003-05-08 06:29:26 +08:00
|
|
|
if ( prev == NULL ) {
|
|
|
|
LDAP_STAILQ_INSERT_HEAD( &rq->task_list, entry, tnext );
|
|
|
|
} else {
|
|
|
|
LDAP_STAILQ_INSERT_AFTER( &rq->task_list, prev, entry, tnext );
|
2003-05-07 10:06:01 +08:00
|
|
|
}
|
2003-11-27 04:40:16 +08:00
|
|
|
return;
|
2003-05-07 10:06:01 +08:00
|
|
|
}
|
2003-05-08 06:29:26 +08:00
|
|
|
prev = e;
|
2003-05-07 10:06:01 +08:00
|
|
|
}
|
2003-11-27 04:40:16 +08:00
|
|
|
LDAP_STAILQ_INSERT_TAIL( &rq->task_list, entry, tnext );
|
2003-05-07 10:06:01 +08:00
|
|
|
}
|
|
|
|
}
|
2003-05-08 06:29:26 +08:00
|
|
|
|
2003-05-21 07:52:11 +08:00
|
|
|
int
|
|
|
|
ldap_pvt_runqueue_persistent_backload(
|
|
|
|
struct runqueue_s* rq
|
|
|
|
)
|
|
|
|
{
|
|
|
|
struct re_s* e;
|
|
|
|
int count = 0;
|
|
|
|
|
2003-10-12 17:13:04 +08:00
|
|
|
ldap_pvt_thread_mutex_lock( &rq->rq_mutex );
|
2003-05-21 07:52:11 +08:00
|
|
|
if ( !LDAP_STAILQ_EMPTY( &rq->task_list )) {
|
|
|
|
LDAP_STAILQ_FOREACH( e, &rq->task_list, tnext ) {
|
|
|
|
if ( e->next_sched.tv_sec == 0 )
|
|
|
|
count++;
|
|
|
|
}
|
|
|
|
}
|
2003-10-12 17:13:04 +08:00
|
|
|
ldap_pvt_thread_mutex_unlock( &rq->rq_mutex );
|
2003-05-21 07:52:11 +08:00
|
|
|
return count;
|
|
|
|
}
|
|
|
|
|