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.
42 extern void Re_dump( Re *re );
43 #else /* NEEDPROTOS */
44 extern void Re_dump();
45 #endif /* NEEDPROTOS */
47 #if !(defined(BSD) && (BSD >= 199306))
48 extern char *sys_errlist[];
52 * Lock the replication queue.
59 return( pthread_mutex_lock( &rq->rq_mutex ));
67 * Unlock the replication queue.
74 return( pthread_mutex_unlock( &rq->rq_mutex ));
80 * Return the head of the queue. Callers should lock the queue before
81 * calling this routine.
88 return( rq == NULL ? NULL : rq->rq_head );
95 * Return the next item in the queue. Callers should lock the queue before
96 * calling this routine.
106 return( re->re_getnext( re ));
114 * Delete the item at the head of the list. The queue should be locked
115 * by the caller before calling this routine.
129 savedhead = rq->rq_head;
130 if ( savedhead == NULL ) {
134 if ( savedhead->re_getrefcnt( savedhead ) != 0 ) {
135 Debug( LDAP_DEBUG_ANY, "Warning: attempt to delete when refcnt != 0\n",
140 rq->rq_head = rq->rq_head->re_getnext( rq->rq_head );
141 rc = savedhead->re_free( savedhead );
142 rq->rq_nre--; /* decrement count of Re's in queue */
150 * Add an entry to the tail of the replication queue. Locking is handled
151 * internally. When items are added to the queue, this routine wakes
152 * up any threads which are waiting for more work by signaling on the
153 * rq->rq_more condition variable.
167 /* Create a new Re */
168 if ( Re_init( &re ) < 0 ) {
173 /* parse buf and fill in the re struct */
174 if ( re->re_parse( re, buf ) < 0 ) {
180 /* Insert into queue */
181 if ( rq->rq_head == NULL ) {
186 rq->rq_tail->re_next = re;
189 /* set the sequence number */
191 if ( !wasempty && !strcmp(rq->rq_tail->re_timestamp, re->re_timestamp )) {
193 * Our new re has the same timestamp as the tail's timestamp.
194 * Increment the seq number in the tail and use it as our seq number.
196 re->re_seq = rq->rq_tail->re_seq + 1;
200 /* Increment count of items in queue */
202 /* wake up any threads waiting for more work */
203 pthread_cond_broadcast( &rq->rq_more );
205 /* ... and unlock the queue */
215 * Garbage-collect the replication queue. Locking is handled internally.
223 Debug( LDAP_DEBUG_ANY, "Rq_gc: rq is NULL!\n", 0, 0, 0 );
227 while (( rq->rq_head != NULL ) &&
228 ( rq->rq_head->re_getrefcnt( rq->rq_head ) == 0 )) {
229 rq->rq_delhead( rq );
230 rq->rq_ndel++; /* increment count of deleted entries */
239 * For debugging: dump the contents of the replication queue to a file.
240 * Locking is handled internally.
251 Debug( LDAP_DEBUG_ANY, "Rq_dump: rq is NULL!\n", 0, 0, 0 );
255 if (( fp = fopen( SLURPD_DUMPFILE, "w" )) == NULL ) {
256 Debug( LDAP_DEBUG_ANY, "Rq_dump: cannot open \"%s\" for write\n",
257 SLURPD_DUMPFILE, 0, 0 );
262 for ( re = rq->rq_gethead( rq ); re != NULL; re = rq->rq_getnext( re )) {
263 re->re_dump( re, fp );
273 * Write the contents of a replication queue to a file. Returns zero if
274 * successful, -1 if not. Handles queue locking internally. Callers should
275 * provide an open file pointer, which should refer to a locked file.
290 Debug( LDAP_DEBUG_ARGS, "re-write on-disk replication log\n",
295 fseek( fp, 0L, SEEK_SET ); /* Go to beginning of file */
298 for ( re = rq->rq_gethead( rq ); re != NULL; re = rq->rq_getnext( re )) {
299 if ( re->re_write( NULL, re, fp ) < 0 ) {
306 sglob->srpos = ftell( fp ); /* update replog file position */
307 /* and truncate to correct len */
308 if ( ftruncate( fileno( fp ), sglob->srpos ) < 0 ) {
309 Debug( LDAP_DEBUG_ANY, "Error truncating replication log: %s\n",
310 sys_errlist[ errno ], 0, 0 );
312 rq->rq_ndel = 0; /* reset count of deleted re's */
314 rq->rq_lasttrim = now; /* reset last trim time */
323 * Check to see if the private slurpd replication log needs trimming.
324 * The current criteria are:
325 * - The last trim was more than 5 minutes ago, *and*
326 * - We've finished with at least 50 replication log entries since the
327 * last time we re-wrote the replication log.
329 * Return 1 if replogfile should be trimmed, 0 if not.
330 * Any different policy should be implemented by replacing this function.
339 int nzrc = 0; /* nzrc is count of entries with refcnt == 0 */
350 if ( now > ( rq->rq_lasttrim + TRIMCHECK_INTERVAL )) {
351 rc = ( rq->rq_ndel >= 50 );
361 * Return counts of Re structs in the queue.
377 if ( type == RQ_COUNT_ALL ) {
380 for ( re = rq->rq_gethead( rq ); re != NULL;
381 re = rq->rq_getnext( re )) {
382 if ( type == RQ_COUNT_NZRC ) {
383 if ( re->re_getrefcnt( re ) > 1 ) {
397 * Allocate and initialize an Rq object.
404 /* Instantiate the struct */
405 (*rq) = (Rq *) malloc( sizeof( Rq ));
410 /* Fill in all the function pointers */
411 (*rq)->rq_gethead = Rq_gethead;
412 (*rq)->rq_getnext = Rq_getnext;
413 (*rq)->rq_delhead = Rq_delhead;
414 (*rq)->rq_add = Rq_add;
415 (*rq)->rq_gc = Rq_gc;
416 (*rq)->rq_lock = Rq_lock;
417 (*rq)->rq_unlock = Rq_unlock;
418 (*rq)->rq_dump = Rq_dump;
419 (*rq)->rq_needtrim = Rq_needtrim;
420 (*rq)->rq_write = Rq_write;
421 (*rq)->rq_getcount = Rq_getcount;
423 /* Initialize private data */
424 pthread_mutex_init( &((*rq)->rq_mutex), pthread_mutexattr_default );
425 pthread_cond_init( &((*rq)->rq_more), pthread_condattr_default );
426 (*rq)->rq_head = NULL;
427 (*rq)->rq_tail = NULL;
430 (*rq)->rq_lasttrim = (time_t) 0L;