X-Git-Url: https://git.sur5r.net/?a=blobdiff_plain;f=libraries%2Flibldap_r%2Frq.c;h=ccd255949e003e70500443f85231c555b49d41d7;hb=e22dc83ac096d1239a6903199f5dc3231b0f444b;hp=e7ba0486929c41d7733757892904c32caf53c8b2;hpb=45c42630dbe026153f2d07c06982b11dcde7a428;p=openldap diff --git a/libraries/libldap_r/rq.c b/libraries/libldap_r/rq.c index e7ba048692..ccd255949e 100644 --- a/libraries/libldap_r/rq.c +++ b/libraries/libldap_r/rq.c @@ -1,8 +1,22 @@ /* $OpenLDAP$ */ -/* - * Copyright 1998-2003 The OpenLDAP Foundation, All Rights Reserved. - * COPYING RESTRICTIONS APPLY, see COPYRIGHT file +/* This work is part of OpenLDAP Software . + * + * Copyright 2003-2009 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 + * . */ +/* This work was initially developed by Jong Hyuk Choi for inclusion + * in OpenLDAP Software. + */ + #include "portable.h" #include @@ -19,24 +33,47 @@ #include "ldap_queue.h" #include "ldap_rq.h" -void +struct re_s * ldap_pvt_runqueue_insert( struct runqueue_s* rq, time_t interval, ldap_pvt_thread_start_t *routine, - void *arg + void *arg, + char *tname, + char *tspec ) { struct re_s* entry; entry = (struct re_s *) LDAP_CALLOC( 1, sizeof( struct re_s )); - 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; - LDAP_STAILQ_INSERT_HEAD( &rq->task_list, entry, tnext ); + 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 @@ -52,31 +89,26 @@ ldap_pvt_runqueue_remove( break; } - assert ( e == entry ); + 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 timeval* next_run ) { struct re_s* entry; entry = LDAP_STAILQ_FIRST( &rq->task_list ); - if ( entry == NULL ) { - *next_run = NULL; - return NULL; - } else if ( entry->next_sched.tv_sec == 0 ) { - *next_run = NULL; + if ( entry == NULL || entry->next_sched.tv_sec == 0 ) { return NULL; } else { - *next_run = &entry->next_sched; + *next_run = entry->next_sched; return entry; } } @@ -87,7 +119,7 @@ ldap_pvt_runqueue_runtask( struct re_s* entry ) { - LDAP_STAILQ_INSERT_HEAD( &rq->run_list, entry, rnext ); + LDAP_STAILQ_INSERT_TAIL( &rq->run_list, entry, rnext ); } void @@ -134,7 +166,7 @@ ldap_pvt_runqueue_resched( LDAP_STAILQ_REMOVE( &rq->task_list, entry, re_s, tnext ); - if ( entry->interval.tv_sec && !defer ) { + if ( !defer ) { entry->next_sched.tv_sec = time( NULL ) + entry->interval.tv_sec; } else { entry->next_sched.tv_sec = 0; @@ -153,17 +185,18 @@ ldap_pvt_runqueue_resched( } else { LDAP_STAILQ_INSERT_AFTER( &rq->task_list, prev, entry, tnext ); } - break; + 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 ); } - break; + return; } prev = e; } + LDAP_STAILQ_INSERT_TAIL( &rq->task_list, entry, tnext ); } }