Home | History | Annotate | Download | only in libldap

Lines Matching refs:entry

54 	struct re_s* entry;
56 entry = (struct re_s *) LDAP_CALLOC( 1, sizeof( struct re_s ));
57 if ( entry ) {
58 entry->interval.tv_sec = interval;
59 entry->interval.tv_usec = 0;
60 entry->next_sched.tv_sec = time( NULL );
61 entry->next_sched.tv_usec = 0;
62 entry->routine = routine;
63 entry->arg = arg;
64 entry->tname = tname;
65 entry->tspec = tspec;
66 LDAP_STAILQ_INSERT_HEAD( &rq->task_list, entry, tnext );
68 return entry;
90 struct re_s* entry
96 if ( e == entry)
100 assert( e == entry );
102 LDAP_STAILQ_REMOVE( &rq->task_list, entry, re_s, tnext );
104 LDAP_FREE( entry );
113 struct re_s* entry;
115 entry = LDAP_STAILQ_FIRST( &rq->task_list );
116 if ( entry == NULL || entry->next_sched.tv_sec == 0 ) {
119 *next_run = entry->next_sched;
120 return entry;
127 struct re_s* entry
130 LDAP_STAILQ_INSERT_TAIL( &rq->run_list, entry, rnext );
136 struct re_s* entry
139 LDAP_STAILQ_REMOVE( &rq->run_list, entry, re_s, rnext );
145 struct re_s* entry
151 if ( e == entry ) {
161 struct re_s* entry,
169 if ( e == entry )
173 assert ( e == entry );
175 LDAP_STAILQ_REMOVE( &rq->task_list, entry, re_s, tnext );
178 entry->next_sched.tv_sec = time( NULL ) + entry->interval.tv_sec;
180 entry->next_sched.tv_sec = 0;
184 LDAP_STAILQ_INSERT_HEAD( &rq->task_list, entry, tnext );
185 } else if ( entry->next_sched.tv_sec == 0 ) {
186 LDAP_STAILQ_INSERT_TAIL( &rq->task_list, entry, tnext );
192 LDAP_STAILQ_INSERT_HEAD( &rq->task_list, entry, tnext );
194 LDAP_STAILQ_INSERT_AFTER( &rq->task_list, prev, entry, tnext );
197 } else if ( e->next_sched.tv_sec > entry->next_sched.tv_sec ) {
199 LDAP_STAILQ_INSERT_HEAD( &rq->task_list, entry, tnext );
201 LDAP_STAILQ_INSERT_AFTER( &rq->task_list, prev, entry, tnext );
207 LDAP_STAILQ_INSERT_TAIL( &rq->task_list, entry, tnext );