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.
13 /* slurp.h - Standalone Ldap Update Replication Daemon (slurpd) */
23 #include <ac/signal.h>
24 #include <ac/syslog.h>
26 #include <sys/param.h>
31 #define ldap_debug slurp_debug
34 #include "ldap_pvt_thread.h"
35 #include "ldapconfig.h"
39 /* Default directory for slurpd's private copy of replication logs */
40 #define DEFAULT_SLURPD_REPLICA_DIR "/usr/tmp"
42 /* Default name for slurpd's private copy of the replication log */
43 #define DEFAULT_SLURPD_REPLOGFILE "slurpd.replog"
45 /* Name of file which stores saved slurpd state info, for restarting */
46 #define DEFAULT_SLURPD_STATUS_FILE "slurpd.status"
48 /* slurpd dump file - contents of rq struct are written here (debugging) */
49 #define SLURPD_DUMPFILE "/tmp/slurpd.dump"
51 /* default srvtab file. Can be overridden */
52 #define SRVTAB "/etc/srvtab"
54 /* Amount of time to sleep if no more work to do */
55 #define DEFAULT_NO_WORK_INTERVAL 3
57 /* The time we wait between checks to see if the replog file needs trimming */
58 #define TRIMCHECK_INTERVAL ( 60 * 5 )
60 /* Only try to trim slurpd replica files larger than this size */
61 #define MIN_TRIM_FILESIZE ( 10L * 1024L )
63 /* Maximum line length we can read from replication log */
64 #define REPLBUFLEN 256
66 /* We support simple (plaintext password) and kerberos authentication */
68 #define AUTH_KERBEROS 2
70 /* Rejection records are prefaced with this string */
71 #define ERROR_STR "ERROR"
73 /* Strings found in replication entries */
74 #define T_CHANGETYPESTR "changetype"
75 #define T_CHANGETYPE 1
76 #define T_TIMESTR "time"
81 #define T_ADDCTSTR "add"
83 #define T_MODIFYCTSTR "modify"
85 #define T_DELETECTSTR "delete"
87 #define T_MODRDNCTSTR "modrdn"
90 #define T_MODOPADDSTR "add"
92 #define T_MODOPREPLACESTR "replace"
93 #define T_MODOPREPLACE 9
94 #define T_MODOPDELETESTR "delete"
95 #define T_MODOPDELETE 10
96 #define T_MODSEPSTR "-"
99 #define T_NEWRDNSTR "newrdn"
100 #define T_DRDNFLAGSTR "deleteoldrdn"
104 /* Config file keywords */
105 #define HOSTSTR "host"
106 #define BINDDNSTR "binddn"
107 #define BINDMETHSTR "bindmethod"
108 #define KERBEROSSTR "kerberos"
109 #define SIMPLESTR "simple"
110 #define CREDSTR "credentials"
111 #define BINDPSTR "bindprincipal"
112 #define SRVTABSTR "srvtab"
114 #define REPLICA_SLEEP_TIME ( 10 )
116 /* Enumeration of various types of bind failures */
118 #define BIND_ERR_BADLDP 1
119 #define BIND_ERR_OPEN 2
120 #define BIND_ERR_BAD_ATYPE 3
121 #define BIND_ERR_SIMPLE_FAILED 4
122 #define BIND_ERR_KERBEROS_FAILED 5
123 #define BIND_ERR_BADRI 6
125 /* Return codes for do_ldap() */
127 #define DO_LDAP_ERR_RETRYABLE 1
128 #define DO_LDAP_ERR_FATAL 2
131 * Types of counts one can request from the Rq rq_getcount()
135 #define RQ_COUNT_ALL 1
136 /* all elements with nonzero refcnt */
137 #define RQ_COUNT_NZRC 2
139 /* Amount of time, in seconds, for a thread to sleep when it encounters
140 * a retryable error in do_ldap().
142 #define RETRY_SLEEP_TIME 60
148 * ****************************************************************************
149 * Data types for replication queue and queue elements.
150 * ****************************************************************************
155 * Replica host information. An Ri struct will contain an array of these,
156 * with one entry for each replica. The end of the array is signaled
157 * by a NULL value in the rh_hostname field.
160 char *rh_hostname; /* replica hostname */
161 int rh_port; /* replica port */
166 * Per-replica information.
169 * - Private data should not be manipulated expect by Ri member functions.
171 typedef struct ri Ri;
175 char *ri_hostname; /* canonical hostname of replica */
176 int ri_port; /* port where slave slapd running */
177 LDAP *ri_ldp; /* LDAP struct for this replica */
178 int ri_bind_method; /* AUTH_SIMPLE or AUTH_KERBEROS */
179 char *ri_bind_dn; /* DN to bind as when replicating */
180 char *ri_password; /* Password for AUTH_SIMPLE */
181 char *ri_principal; /* principal for kerberos bind */
182 char *ri_srvtab; /* srvtab file for kerberos bind */
183 struct re *ri_curr; /* current repl entry being processed */
184 struct stel *ri_stel; /* pointer to Stel for this replica */
186 ri_seq; /* seq number of last repl */
187 ldap_pvt_thread_t ri_tid; /* ID of thread for this replica */
189 /* Member functions */
190 int (*ri_process) LDAP_P(( Ri * )); /* process the next repl entry */
191 void (*ri_wake) LDAP_P(( Ri * )); /* wake up a sleeping thread */
198 * Information about one particular modification to make. This data should
199 * be considered private to routines in re.c, and to routines in ri.c.
204 char *mi_type; /* attr or type */
205 char *mi_val; /* value */
206 int mi_len; /* length of mi_val */
213 * Information about one particular replication entry. Only routines in
214 * re.c and rq.c should touch the private data. Other routines should
215 * only use member functions.
217 typedef struct re Re;
221 ldap_pvt_thread_mutex_t
222 re_mutex; /* mutex for this Re */
223 int re_refcnt; /* ref count, 0 = done */
224 char *re_timestamp; /* timestamp of this re */
225 int re_seq; /* sequence number */
226 Rh *re_replicas; /* array of replica info */
227 char *re_dn; /* dn of entry being modified */
228 int re_changetype; /* type of modification */
229 Mi *re_mods; /* array of modifications to make */
230 struct re *re_next; /* pointer to next element */
232 /* Public functions */
233 int (*re_free) LDAP_P(( Re * )); /* free an re struct */
234 Re *(*re_getnext) LDAP_P(( Re * )); /* return next Re in linked list */
235 int (*re_parse) LDAP_P(( Re *, char * )); /* parse replication log entry */
236 int (*re_write) LDAP_P(( Ri *, Re *, FILE * )); /* write repl. log entry */
237 void (*re_dump) LDAP_P(( Re *, FILE * )); /* debugging - print contents */
238 int (*re_lock) LDAP_P(( Re * )); /* lock this re */
239 int (*re_unlock) LDAP_P(( Re * )); /* unlock this re */
240 int (*re_decrefcnt) LDAP_P(( Re * )); /* decrement the refcnt */
241 int (*re_getrefcnt) LDAP_P(( Re * )); /* get the refcnt */
248 * Definition for the queue of replica information. Private data is
249 * private to rq.c. Other routines should only touch public data or
250 * use member functions. Note that although we have a member function
251 * for locking the queue's mutex, we need to expose the rq_mutex
252 * variable so routines in ri.c can use it as a mutex for the
253 * rq_more condition variable.
255 typedef struct rq Rq;
259 Re *rq_head; /* pointer to head */
260 Re *rq_tail; /* pointer to tail */
261 int rq_nre; /* total number of Re's in queue */
262 int rq_ndel; /* number of deleted Re's in queue */
263 time_t rq_lasttrim; /* Last time we trimmed file */
266 ldap_pvt_thread_mutex_t
267 rq_mutex; /* mutex for whole queue */
268 ldap_pvt_thread_cond_t
269 rq_more; /* condition var - more work added */
271 /* Member functions */
272 Re * (*rq_gethead) LDAP_P(( Rq * )); /* get the element at head */
273 Re * (*rq_getnext) LDAP_P(( Re * )); /* get the next element */
274 int (*rq_delhead) LDAP_P(( Rq * )); /* delete the element at head */
275 int (*rq_add) LDAP_P(( Rq *, char * )); /* add at tail */
276 void (*rq_gc) LDAP_P(( Rq * )); /* garbage-collect queue */
277 int (*rq_lock) LDAP_P(( Rq * )); /* lock the queue */
278 int (*rq_unlock) LDAP_P(( Rq * )); /* unlock the queue */
279 int (*rq_needtrim) LDAP_P(( Rq * )); /* see if queue needs trimming */
280 int (*rq_write) LDAP_P(( Rq *, FILE * )); /*write Rq contents to file*/
281 int (*rq_getcount) LDAP_P(( Rq *, int )); /* return queue counts */
282 void (*rq_dump) LDAP_P(( Rq * )); /* debugging - print contents */
287 * An Stel (status element) contains information about one replica.
288 * Stel structs are associated with the St (status) struct, defined
291 typedef struct stel {
292 char *hostname; /* host name of replica */
293 int port; /* port number of replica */
294 char last[ 64 ]; /* timestamp of last successful repl */
295 int seq; /* Sequence number of last repl */
300 * An St struct in an in-core structure which contains the current
301 * slurpd state. Most importantly, it contains an array of Stel
302 * structs which contain the timestamp and sequence number of the last
303 * successful replication for each replica. The st_write() member
304 * function is called periodically to flush status information to
305 * disk. At startup time, slurpd checks for the status file, and
306 * if present, uses the timestamps to avoid "replaying" replications
307 * which have already been sent to a given replica.
309 typedef struct st St;
312 ldap_pvt_thread_mutex_t
313 st_mutex; /* mutex to serialize access */
314 Stel **st_data; /* array of pointers to Stel structs */
315 int st_nreplicas; /* number of repl hosts */
316 int st_err_logged; /* 1 if fopen err logged */
317 FILE *st_fp; /* st file kept open */
318 FILE *st_lfp; /* lockfile fp */
320 /* Public member functions */
321 int (*st_update) LDAP_P(( St *, Stel*, Re* ));/*update entry for a host*/
322 Stel*(*st_add) LDAP_P(( St *, Ri * )); /*add a new repl host*/
323 int (*st_write) LDAP_P(( St * )); /* write status to disk */
324 int (*st_read) LDAP_P(( St * )); /* read status info from disk */
325 int (*st_lock) LDAP_P(( St * )); /* read status info from disk */
326 int (*st_unlock) LDAP_P(( St * )); /* read status info from disk */
329 #if defined( HAVE_LWP )
331 thread_t tl_tid; /* thread being managed */
332 time_t tl_wake; /* time thread should be resumed */
333 struct tl *tl_next; /* next node in list */
340 #endif /* HAVE_LWP */
343 * Public functions used to instantiate and initialize queue objects.
345 extern int Ri_init LDAP_P(( Ri **ri ));
346 extern int Rq_init LDAP_P(( Rq **rq ));
347 extern int Re_init LDAP_P(( Re **re ));
349 #include "proto-slurp.h"
353 #endif /* _SLURPD_H_ */