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 * ri.c - routines used to manipulate Ri structures. An Ri (Replica
15 * information) struct contains all information about one replica
16 * instance. The Ri struct is defined in slurp.h
24 #include <ac/stdlib.h>
25 #include <ac/signal.h>
31 /* Forward references */
32 static int ismine LDAP_P(( Ri *, Re * ));
33 static int isnew LDAP_P(( Ri *, Re * ));
37 * Process any unhandled replication entries in the queue.
49 (void) SIGNAL( LDAP_SIGUSR1, do_nothing );
50 (void) SIGNAL( SIGPIPE, SIG_IGN );
52 Debug( LDAP_DEBUG_ANY, "Error: Ri_process: ri == NULL!\n", 0, 0, 0 );
57 * Startup code. See if there's any work to do. If not, wait on the
58 * rq->rq_more condition variable.
61 while ( !sglob->slurpd_shutdown &&
62 (( re = rq->rq_gethead( rq )) == NULL )) {
63 /* No work - wait on condition variable */
64 ldap_pvt_thread_cond_wait( &rq->rq_more, &rq->rq_mutex );
68 * When we get here, there's work in the queue, and we have the
69 * queue locked. re should be pointing to the head of the queue.
72 while ( !sglob->slurpd_shutdown ) {
74 if ( !ismine( ri, re )) {
75 /* The Re doesn't list my host:port */
76 Debug( LDAP_DEBUG_TRACE,
77 "Replica %s:%d, skip repl record for %s (not mine)\n",
78 ri->ri_hostname, ri->ri_port, re->re_dn );
79 } else if ( !isnew( ri, re )) {
80 /* This Re is older than my saved status information */
81 Debug( LDAP_DEBUG_TRACE,
82 "Replica %s:%d, skip repl record for %s (old)\n",
83 ri->ri_hostname, ri->ri_port, re->re_dn );
85 rc = do_ldap( ri, re, &errmsg );
87 case DO_LDAP_ERR_RETRYABLE:
88 ldap_pvt_thread_sleep( RETRY_SLEEP_TIME );
89 Debug( LDAP_DEBUG_ANY,
90 "Retrying operation for DN %s on replica %s:%d\n",
91 re->re_dn, ri->ri_hostname, ri->ri_port );
94 case DO_LDAP_ERR_FATAL: {
95 /* Non-retryable error. Write rejection log. */
97 ldap_get_option(ri->ri_ldp, LDAP_OPT_ERROR_NUMBER, &ld_errno);
98 write_reject( ri, re, ld_errno, errmsg );
99 /* Update status ... */
100 (void) sglob->st->st_update( sglob->st, ri->ri_stel, re );
101 /* ... and write to disk */
102 (void) sglob->st->st_write( sglob->st );
105 /* LDAP op completed ok - update status... */
106 (void) sglob->st->st_update( sglob->st, ri->ri_stel, re );
107 /* ... and write to disk */
108 (void) sglob->st->st_write( sglob->st );
113 Debug( LDAP_DEBUG_ANY, "Error: re is null in Ri_process\n",
117 while ( !sglob->slurpd_shutdown &&
118 ((new_re = re->re_getnext( re )) == NULL )) {
119 if ( sglob->one_shot_mode ) {
123 /* No work - wait on condition variable */
124 ldap_pvt_thread_cond_wait( &rq->rq_more, &rq->rq_mutex );
126 re->re_decrefcnt( re );
129 if ( sglob->slurpd_shutdown ) {
138 * Wake a replication thread which may be sleeping.
139 * Send it a LDAP_SIGUSR1.
149 ldap_pvt_thread_kill( ri->ri_tid, LDAP_SIGUSR1 );
150 (void) SIGNAL( LDAP_SIGUSR1, do_nothing );
156 * Allocate and initialize an Ri struct.
163 (*ri) = ( Ri * ) malloc( sizeof( Ri ));
168 /* Initialize member functions */
169 (*ri)->ri_process = Ri_process;
170 (*ri)->ri_wake = Ri_wake;
172 /* Initialize private data */
173 (*ri)->ri_hostname = NULL;
175 (*ri)->ri_ldp = NULL;
176 (*ri)->ri_bind_method = 0;
177 (*ri)->ri_bind_dn = NULL;
178 (*ri)->ri_password = NULL;
179 (*ri)->ri_principal = NULL;
180 (*ri)->ri_srvtab = NULL;
181 (*ri)->ri_curr = NULL;
190 * Return 1 if the hostname and port in re match the hostname and port
191 * in ri, otherwise return zero.
202 if ( ri == NULL || re == NULL || ri->ri_hostname == NULL ||
203 re->re_replicas == NULL ) {
206 rh = re->re_replicas;
207 for ( i = 0; rh[ i ].rh_hostname != NULL; i++ ) {
208 if ( !strcmp( rh[ i ].rh_hostname, ri->ri_hostname) &&
209 rh[ i ].rh_port == ri->ri_port ) {
220 * Return 1 if the Re's timestamp/seq combination are greater than the
221 * timestamp and seq in the Ri's ri_stel member. In other words, if we
222 * find replication entries in the log which we've already processed,
223 * don't process them. If the re is "old," return 0.
224 * No check for NULL pointers is done.
235 /* Lock the St struct to avoid a race */
236 sglob->st->st_lock( sglob->st );
237 x = strcmp( re->re_timestamp, ri->ri_stel->last );
239 /* re timestamp is newer */
241 } else if ( x < 0 ) {
244 /* timestamps were equal */
245 if ( re->re_seq > ri->ri_stel->seq ) {
246 /* re seq is newer */
252 sglob->st->st_unlock( sglob->st );