2 * Copyright (c) 1996 Regents of the University of Michigan.
5 * Redistribution and use in source and binary forms are permitted
6 * provided that this notice is preserved and that due credit is given
7 * to the University of Michigan at Ann Arbor. The name of the University
8 * may not be used to endorse or promote products derived from this
9 * software without specific prior written permission. This software
10 * is provided ``as is'' without express or implied warranty.
14 * rq.c - routines used to manage the queue of replication entries.
15 * An Rq (Replication queue) struct contains a linked list of Re
16 * (Replication entry) structures.
18 * Routines wishing to access the replication queue should do so through
19 * the Rq struct's member functions, e.g. rq->rq_gethead() and friends.
20 * For example, Re structs should be added to the queue by calling
21 * the rq_add() member function.
23 * Access to the queue is serialized by a mutex. Member functions which do
24 * not do their own locking should only be called after locking the queue
25 * using the rq_lock() member function. The queue should be unlocked with
26 * the rq_unlock() member function.
28 * Note that some member functions handle their own locking internally.
29 * Callers should not lock the queue before calling these functions.
30 * See the comment block for each function below.
44 extern void Re_dump LDAP_P(( Re *re ));
47 * Lock the replication queue.
54 return( pthread_mutex_lock( &rq->rq_mutex ));
59 * Unlock the replication queue.
66 return( pthread_mutex_unlock( &rq->rq_mutex ));
72 * Return the head of the queue. Callers should lock the queue before
73 * calling this routine.
80 return( rq == NULL ? NULL : rq->rq_head );
85 * Return the next item in the queue. Callers should lock the queue before
86 * calling this routine.
96 return( re->re_getnext( re ));
102 * Delete the item at the head of the list. The queue should be locked
103 * by the caller before calling this routine.
117 savedhead = rq->rq_head;
118 if ( savedhead == NULL ) {
122 if ( savedhead->re_getrefcnt( savedhead ) != 0 ) {
123 Debug( LDAP_DEBUG_ANY, "Warning: attempt to delete when refcnt != 0\n",
128 rq->rq_head = rq->rq_head->re_getnext( rq->rq_head );
129 rc = savedhead->re_free( savedhead );
130 rq->rq_nre--; /* decrement count of Re's in queue */
136 * Add an entry to the tail of the replication queue. Locking is handled
137 * internally. When items are added to the queue, this routine wakes
138 * up any threads which are waiting for more work by signaling on the
139 * rq->rq_more condition variable.
153 /* Create a new Re */
154 if ( Re_init( &re ) < 0 ) {
159 /* parse buf and fill in the re struct */
160 if ( re->re_parse( re, buf ) < 0 ) {
166 /* Insert into queue */
167 if ( rq->rq_head == NULL ) {
172 rq->rq_tail->re_next = re;
175 /* set the sequence number */
177 if ( !wasempty && !strcmp(rq->rq_tail->re_timestamp, re->re_timestamp )) {
179 * Our new re has the same timestamp as the tail's timestamp.
180 * Increment the seq number in the tail and use it as our seq number.
182 re->re_seq = rq->rq_tail->re_seq + 1;
186 /* Increment count of items in queue */
188 /* wake up any threads waiting for more work */
189 pthread_cond_broadcast( &rq->rq_more );
191 /* ... and unlock the queue */
199 * Garbage-collect the replication queue. Locking is handled internally.
207 Debug( LDAP_DEBUG_ANY, "Rq_gc: rq is NULL!\n", 0, 0, 0 );
211 while (( rq->rq_head != NULL ) &&
212 ( rq->rq_head->re_getrefcnt( rq->rq_head ) == 0 )) {
213 rq->rq_delhead( rq );
214 rq->rq_ndel++; /* increment count of deleted entries */
222 * For debugging: dump the contents of the replication queue to a file.
223 * Locking is handled internally.
234 Debug( LDAP_DEBUG_ANY, "Rq_dump: rq is NULL!\n", 0, 0, 0 );
238 if (( fp = fopen( SLURPD_DUMPFILE, "w" )) == NULL ) {
239 Debug( LDAP_DEBUG_ANY, "Rq_dump: cannot open \"%s\" for write\n",
240 SLURPD_DUMPFILE, 0, 0 );
245 for ( re = rq->rq_gethead( rq ); re != NULL; re = rq->rq_getnext( re )) {
246 re->re_dump( re, fp );
255 * Write the contents of a replication queue to a file. Returns zero if
256 * successful, -1 if not. Handles queue locking internally. Callers should
257 * provide an open file pointer, which should refer to a locked file.
272 Debug( LDAP_DEBUG_ARGS, "re-write on-disk replication log\n",
277 fseek( fp, 0L, SEEK_SET ); /* Go to beginning of file */
280 for ( re = rq->rq_gethead( rq ); re != NULL; re = rq->rq_getnext( re )) {
281 if ( re->re_write( NULL, re, fp ) < 0 ) {
288 sglob->srpos = ftell( fp ); /* update replog file position */
289 /* and truncate to correct len */
290 if ( ftruncate( fileno( fp ), sglob->srpos ) < 0 ) {
291 Debug( LDAP_DEBUG_ANY, "Error truncating replication log: %s\n",
292 sys_errlist[ errno ], 0, 0 );
294 rq->rq_ndel = 0; /* reset count of deleted re's */
296 rq->rq_lasttrim = now; /* reset last trim time */
303 * Check to see if the private slurpd replication log needs trimming.
304 * The current criteria are:
305 * - The last trim was more than 5 minutes ago, *and*
306 * - We've finished with at least 50 replication log entries since the
307 * last time we re-wrote the replication log.
309 * Return 1 if replogfile should be trimmed, 0 if not.
310 * Any different policy should be implemented by replacing this function.
319 int nzrc = 0; /* nzrc is count of entries with refcnt == 0 */
330 if ( now > ( rq->rq_lasttrim + TRIMCHECK_INTERVAL )) {
331 rc = ( rq->rq_ndel >= 50 );
341 * Return counts of Re structs in the queue.
357 if ( type == RQ_COUNT_ALL ) {
360 for ( re = rq->rq_gethead( rq ); re != NULL;
361 re = rq->rq_getnext( re )) {
362 if ( type == RQ_COUNT_NZRC ) {
363 if ( re->re_getrefcnt( re ) > 1 ) {
375 * Allocate and initialize an Rq object.
382 /* Instantiate the struct */
383 (*rq) = (Rq *) malloc( sizeof( Rq ));
388 /* Fill in all the function pointers */
389 (*rq)->rq_gethead = Rq_gethead;
390 (*rq)->rq_getnext = Rq_getnext;
391 (*rq)->rq_delhead = Rq_delhead;
392 (*rq)->rq_add = Rq_add;
393 (*rq)->rq_gc = Rq_gc;
394 (*rq)->rq_lock = Rq_lock;
395 (*rq)->rq_unlock = Rq_unlock;
396 (*rq)->rq_dump = Rq_dump;
397 (*rq)->rq_needtrim = Rq_needtrim;
398 (*rq)->rq_write = Rq_write;
399 (*rq)->rq_getcount = Rq_getcount;
401 /* Initialize private data */
402 pthread_mutex_init( &((*rq)->rq_mutex), pthread_mutexattr_default );
403 pthread_cond_init( &((*rq)->rq_more), pthread_condattr_default );
404 (*rq)->rq_head = NULL;
405 (*rq)->rq_tail = NULL;
408 (*rq)->rq_lasttrim = (time_t) 0L;