1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
163
164
165
166
167
168
169
170
171
172
173
174
175
176
177
178
179
180
181
182
183
184
185
186
187
188
189
190
191
192
193
194
195
196
197
198
199
200
201
202
203
204
205
206
207
208
209
210
211
212
213
214
215
216
217
218
219
220
221
222
223
224
225
226
227
228
229
230
231
232
233
234
235
236
237
238
239
240
241
242
243
244
245
246
247
248
249
250
251
252
253
254
255
256
257
258
259
260
261
262
263
264
265
266
267
268
269
270
271
272
273
274
275
276
277
278
279
280
281
282
283
284
285
286
287
288
289
290
291
292
293
294
295
296
297
298
299
300
301
302
303
304
305
306
307
308
309
310
311
312
313
314
315
316
317
318
319
320
321
322
323
324
325
326
327
328
329
330
331
332
333
334
335
336
337
338
339
340
341
342
343
344
345
346
347
348
349
350
351
352
353
354
355
356
357
358
359
360
361
362
363
364
365
366
367
368
369
370
371
372
373
374
375
376
377
378
379
380
381
382
383
384
385
386
387
388
389
390
391
392
393
394
395
396
397
398
399
400
401
402
403
404
405
406
407
408
409
410
411
412
413
414
415
416
417
418
419
420
421
422
423
424
425
426
427
428
429
430
431
432
433
434
435
436
437
438
439
440
441
442
443
444
445
446
447
448
449
450
451
452
453
454
455
456
457
458
459
460
461
462
463
464
465
466
467
468
469
470
471
472
473
474
475
476
477
478
479
480
481
482
483
484
485
486
487
488
489
490
491
492
493
494
495
496
497
498
499
500
501
502
503
504
505
506
507
508
509
510
511
512
513
514
515
516
517
518
|
/** BEGIN COPYRIGHT BLOCK
* Copyright (C) 2001 Sun Microsystems, Inc. Used by permission.
* Copyright (C) 2005 Red Hat, Inc.
* All rights reserved.
* END COPYRIGHT BLOCK **/
/*
* referrals.c - LDAP referral-related routines.
* a) manage in-memory copiedfrom and copyingfrom referrals.
* b) function to adjust smart referrals to match operation parameters.
*/
#include <stdio.h>
#include "slap.h"
/* Forward Decls */
static void adjust_referral_basedn( char **urlp, const Slapi_DN *refcontainerdn, char *opdn_norm, int isreference );
static int dn_is_below( const char *dn_norm, const char *ancestor_norm );
static Ref_Array *g_get_global_referrals(void);
static void ref_free (Ref **goner);
static Ref_Array global_referrals;
#define SLAPD_DEFAULT_REFARRAY_SIZE 10
/*
* Function: g_get_global_referrals
*
* Returns: nothing
*
* Description: Fills the global_referrals referral array.
* The size is set to "size". The mutex is created.
* The array is calloc'd.
*/
static Ref_Array *
g_get_global_referrals(void)
{
if (global_referrals.ra_rwlock == NULL)
{
/* Make a new lock */
global_referrals.ra_rwlock = rwl_new();
if (global_referrals.ra_rwlock == NULL) {
LDAPDebug( LDAP_DEBUG_ANY,
"ref_array_init: new lock creation failed\n", 0, 0, 0);
exit (-1);
}
/* Initialize all the fields. */
global_referrals.ra_size = SLAPD_DEFAULT_REFARRAY_SIZE;
global_referrals.ra_nextindex = 0;
global_referrals.ra_readcount = 0;
global_referrals.ra_refs = (Ref **) slapi_ch_calloc(SLAPD_DEFAULT_REFARRAY_SIZE, sizeof( Ref * ));
}
return( &global_referrals );
}
/*
* Function: ref_free
*
* Returns: nothing
*
* Description: frees up "goner"
*
* Author: RJP
*
*/
static void
ref_free (Ref **goner)
{
slapi_ch_free((void**) &((*goner)->ref_dn));
ber_bvfree( (*goner)->ref_referral );
slapi_ch_free((void**) goner);
}
/*
* Function: referrals_free
*
* Returns: nothing
*
* Description: frees up everything.
*
* Author: RJP
*
*/
void
referrals_free (void)
{
int walker;
Ref_Array *grefs = NULL;
grefs = g_get_global_referrals();
GR_LOCK_WRITE();
/* Walk down the array, deleting each referral */
for (walker = 0; walker < grefs->ra_nextindex; walker++){
ref_free (&grefs->ra_refs[walker]);
}
slapi_ch_free ((void **) &grefs->ra_refs);
GR_UNLOCK_WRITE();
rwl_free( &grefs->ra_rwlock );
}
/*
* ref_adjust() -- adjust referrals based on operation-specific data.
* The general idea is for us (the server) to be smart so LDAP clients
* can be as dumb as possible.
*
* XXXmcs: We always duplicate the referrals even if no adjustments need to
* be made. It would be more efficient but more complicated to avoid making
* a copy if we don't need to change anything. If that were done, the
* interface to this function would need to change since the caller would
* need to know whether the returned memory needed to be freed or not.
*
* Parameters:
* pb is the pblock for the operation we are working on.
* urls is a list of referrals.
* refsdn is the Slapi_DN of the entry where the referral is stored.
* is_reference is true if a searchResultReference is being returned.
*
* Returns:
* a (possibly modified) copy of the urls. It should be freed by
* calling ber_bvecfree().
*
*
* First we strip off any labels from the referral URLs. For example, a
* referral like this:
*
* ldap://directory.airius.com/ou=people,o=airius.com Ref to people tree
*
* is changed to:
*
* ldap://directory.airius.com/ou=people,o=airius.com
*
* Next, if the referral includes a baseDN we potentially modify it or strip
* it off entirely. If the referral doesn't include a baseDN and we're
* processing a continuation reference, we add a baseDN.
*
* Finally, if we are processing a continuation reference that resulted from
* a one-level search, we append "??base" to the referral so the client will
* use the correct scope when chasing the reference.
*/
struct berval **
ref_adjust( Slapi_PBlock *pb, struct berval **urls, const Slapi_DN *refsdn,
int is_reference )
{
int i, len, scope;
char *p, *opdn_norm;
struct berval **urlscopy;
Operation *op;
if ( NULL == urls || NULL == urls[0] ) {
return( NULL );
}
PR_ASSERT( pb != NULL );
/*
* grab the operation target DN and operation structure.
* if the operation is a search, get the scope as well.
*/
if ( slapi_pblock_get( pb, SLAPI_TARGET_DN, &p ) != 0 || p == NULL ||
slapi_pblock_get( pb, SLAPI_OPERATION, &op ) != 0 || op == NULL ||
( operation_get_type(op) == SLAPI_OPERATION_SEARCH && slapi_pblock_get( pb,
SLAPI_SEARCH_SCOPE, &scope ) != 0 )) {
LDAPDebug( LDAP_DEBUG_ANY, "ref_adjust: referrals suppressed "
"(could not get target DN, operation, or scope from pblock)\n",
0, 0, 0 );
return( NULL );
}
/*
* normalize the DNs we plan to compare with others later.
*/
opdn_norm = slapi_dn_normalize( slapi_ch_strdup( p ));
/*
* count referrals and duplicate the array
*/
for ( i = 0; urls[i] != NULL; ++i ) {
;
}
urlscopy = (struct berval **) slapi_ch_malloc(( i + 1 ) *
sizeof( struct berval * ));
for ( i = 0; urls[i] != NULL; ++i ) {
/*
* duplicate the URL, stripping off the label if there is one and
* leaving extra room for "??base" in case we need to append that.
*/
urlscopy[i] = (struct berval *)slapi_ch_malloc(
sizeof( struct berval ));
if (( p = strchr( urls[i]->bv_val, ' ' )) == NULL ) {
len = strlen( urls[i]->bv_val );
} else {
len = p - urls[i]->bv_val;
}
urlscopy[i]->bv_val = (char *)slapi_ch_malloc( len + 7 );
memcpy( urlscopy[i]->bv_val, urls[i]->bv_val, len );
urlscopy[i]->bv_val[len] = '\0';
/*
* adjust the baseDN as needed and set the length
*/
adjust_referral_basedn( &urlscopy[i]->bv_val, refsdn,
opdn_norm, is_reference );
urlscopy[i]->bv_len = strlen( urlscopy[i]->bv_val );
/*
* if we are dealing with a continuation reference that resulted
* from a one-level search, add a scope of base to the URL.
*/
if ( is_reference && operation_get_type(op) == SLAPI_OPERATION_SEARCH &&
scope == LDAP_SCOPE_ONELEVEL ) {
strcat( urlscopy[i]->bv_val, "??base" );
urlscopy[i]->bv_len += 6;
}
}
urlscopy[i] = NULL; /* NULL terminate the new referrals array */
/*
* log what we did (for debugging purposes)
*/
if ( LDAPDebugLevelIsSet( LDAP_DEBUG_ARGS )) {
for ( i = 0; urlscopy[i] != NULL; ++i ) {
LDAPDebug( LDAP_DEBUG_ARGS, "ref_adjust: \"%s\" -> \"%s\"\n",
urls[i]->bv_val, urlscopy[i]->bv_val, 0 );
}
}
/*
* done -- clean up and return the new referrals array
*/
slapi_ch_free( (void **)&opdn_norm );
return( urlscopy );
}
/*
* adjust_referral_basedn() -- pull the referral apart and modify the
* baseDN contained in the referral if appropriate not.
* If the referral does not have baseDN and we're not processing a
* continuation reference, we do not need to do anything. If we're
* processing a continuation reference, we need to add a baseDN.
*
* If it does have one, there are two special cases we deal with:
*
* 1) The referral's baseDN is an ancestor of the operation's baseDN,
* which means that the LDAP client already has a more specific
* baseDN than is contained in the referral. If so, we strip off
* the baseDN so the client will re-use its operation DN when
* chasing the referral.
*
* 2) The referral's baseDN is not an ancestor of the operation's
* baseDN and the DN of the entry that contains the referral is
* an ancestor of the operation DN. If so, we remove the portion
* of the operation DN that matches the DN of the entry containing
* the referral and prepend what's left to the referral base DN.
*
* We assume that the baseDN is the right-most piece of the URL, i.e., there
* is no attribute list, scope, or options after the baseDN.
*
* The code also assumes that the baseDN doesn't contain any '/' character.
* This later assumption NEED to be removed and code changed appropriately.
*/
static void
adjust_referral_basedn( char **urlp, const Slapi_DN *refsdn,
char *opdn_norm, int isreference )
{
LDAPURLDesc *ludp = NULL;
char *p, *refdn_norm;
int rc = 0;
PR_ASSERT( urlp != NULL );
PR_ASSERT( *urlp != NULL );
PR_ASSERT( refsdn != NULL );
PR_ASSERT( opdn_norm != NULL );
if (opdn_norm == NULL){
/* Be safe but this should never ever happen */
return;
}
rc = ldap_url_parse( *urlp, &ludp );
if ((rc != 0) &&
(rc != LDAP_URL_ERR_NODN))
/*
* rc != LDAP_URL_ERR_NODN is to circumvent a pb in the C-SDK
* in ldap_url_parse. The function will return an error if the
* URL contains no DN (though it is a valid URL according to
* RFC 2255.
*/
{
/* Nothing to do, just return */
return;
}
if (ludp && (ludp->lud_dn != NULL)) {
refdn_norm = slapi_dn_normalize( slapi_ch_strdup( ludp->lud_dn ));
if ( dn_is_below( opdn_norm, refdn_norm )) {
/*
* Strip off the baseDN.
*/
if (( p = strrchr( *urlp, '/' )) != NULL ) {
*p = '\0';
}
} else if ( dn_is_below( opdn_norm, slapi_sdn_get_ndn(refsdn) )) {
int cur_len, add_len;
/*
* Prepend the portion of the operation DN that does not match
* the ref container DN to the referral baseDN.
*/
add_len = strlen( opdn_norm ) - strlen( slapi_sdn_get_ndn(refsdn) );
cur_len = strlen( *urlp );
/* + 7 because we keep extra space in case we add ??base */
*urlp = slapi_ch_realloc( *urlp, cur_len + add_len + 7 );
if (( p = strrchr( *urlp, '/' )) != NULL ) {
++p;
memmove( p + add_len, p, strlen( p ) + 1 );
memmove( p, opdn_norm, add_len );
}
} /* else: leave the original referral baseDN intact. */
slapi_ch_free( (void **)&refdn_norm );
} else if (isreference) {
int cur_len, add_len;
/* If ludp->lud_dn == NULL and isreference : Add the DN of the ref entry*/
if ( dn_is_below( opdn_norm, slapi_sdn_get_ndn(refsdn) )){
add_len = strlen(opdn_norm);
p = opdn_norm;
} else {
add_len = strlen(slapi_sdn_get_ndn(refsdn));
p = (char *)slapi_sdn_get_ndn(refsdn);
}
cur_len = strlen( *urlp );
/* + 8 because we keep extra space in case we add a / and/or ??base */
*urlp = slapi_ch_realloc( *urlp, cur_len + add_len + 8 );
if ((*urlp)[cur_len - 1] != '/'){
/* The URL is not ending with a /, let's add one */
strcat(*urlp, "/");
}
strcat(*urlp, p);
}
if ( ludp != NULL ) {
ldap_free_urldesc( ludp );
}
return;
}
/*
* dn_is_below(): return non-zero if "dn_norm" is below "ancestor_norm" in
* the DIT and return zero if not.
*/
static int
dn_is_below( const char *dn_norm, const char *ancestor_norm )
{
PR_ASSERT( dn_norm != NULL );
PR_ASSERT( ancestor_norm != NULL );
if ( 0 == strcasecmp( dn_norm, ancestor_norm )) {
return( 0 ); /* same DN --> not an ancestor relationship */
}
return( slapi_dn_issuffix( dn_norm, ancestor_norm ));
}
/*
* This function is useful to discover the source of data and provide
* this as a referral. It is also useful if someone simply wants
* to know if a dn is mastered somewhere else.
*
* For a given dn, traverse the referral list and look for the copiedFrom
* attribute. If such an attribute is found get the server hostname
* and port in the form "ldap://hostname:port".
* Else return NULL.
*
* ORC extension: if orc == 1, this function will search for copyingFrom
* which will refer searches and compares on trees that are half-baked.
*
* ORC extension: if cf_refs is NULL, then global_referrals is consulted,
* otherwise, cf_refs is consulted.
*/
struct berval **
get_data_source(Slapi_PBlock *pb, const Slapi_DN *sdn, int orc, void *cfrp)
{
int walker;
struct berval **bvp;
struct berval *bv;
int found_it;
Ref_Array *grefs = NULL;
Ref_Array *the_refs = NULL;
Ref_Array *cf_refs = (Ref_Array *)cfrp;
/* If no Ref_Array is given, use global_referrals */
if (cf_refs == NULL) {
grefs = g_get_global_referrals();
the_refs = grefs;
GR_LOCK_READ();
} else {
the_refs = cf_refs;
}
/* optimization: if orc is 1 (a read), then check the readcount*/
if (orc && the_refs->ra_readcount == 0) {
if (cf_refs == NULL) {
GR_UNLOCK_READ();
}
return (NULL);
}
bvp = NULL;
bv = NULL;
found_it = 0;
/* Walk down the array, testing each dn to make see if it's a parent of "dn" */
for (walker = 0; walker < the_refs->ra_nextindex; walker++){
if ( slapi_dn_issuffix(slapi_sdn_get_ndn(sdn), the_refs->ra_refs[walker]->ref_dn)) {
found_it = 1;
break;
}
}
/* no referral, so return NULL */
if (!found_it) {
if (cf_refs == NULL) {
GR_UNLOCK_READ();
}
return (NULL);
}
/*
* Gotta make sure we're returning the right one. If orc is 1, then
* only return a read referral. if orc is 0, then only return a
* write referral.
*/
if (orc && the_refs->ra_refs[walker]->ref_reads != 1) {
if (cf_refs == NULL) {
GR_UNLOCK_READ();
}
return (NULL);
}
if (!orc && the_refs->ra_refs[walker]->ref_writes != 1) {
if (cf_refs == NULL) {
GR_UNLOCK_READ();
}
return (NULL);
}
/* Fix for 310968 --- return an SSL referral to an SSL client */
if ( 0 != ( pb->pb_conn->c_flags & CONN_FLAG_SSL )) {
/* SSL connection */
char * old_referral_string = NULL;
char * new_referral_string = NULL;
char *p = NULL;
/* Get the basic referral */
bv = slapi_ch_bvdup(the_refs->ra_refs[walker]->ref_referral);
old_referral_string = bv->bv_val;
/* Re-write it to replace ldap with ldaps, and remove the port information */
/* The original string will look like this: ldap://host:port */
/* We need to make it look like this: ldaps://host */
/* Potentially the ":port" part might be missing from the original */
new_referral_string = slapi_ch_smprintf("%s%s" , LDAPS_URL_PREFIX, old_referral_string + strlen(LDAP_URL_PREFIX) );
/* Go looking for the port */
p = new_referral_string + (strlen(LDAPS_URL_PREFIX) + 1);
while (*p != '\0' && *p != ':') p++;
if (':' == *p) {
/* It had a port, zap it */
*p = '\0';
}
/* Fix the bv to point to this new string */
bv->bv_val = new_referral_string;
/* Fix its length */
bv->bv_len = strlen(bv->bv_val);
/* Free the copy we made of the original */
slapi_ch_free((void**)&old_referral_string);
} else {
/* regular connection */
bv = (struct berval *) slapi_ch_bvdup(the_refs->ra_refs[walker]->ref_referral);
}
/* Package it up and send that puppy. */
bvp = (struct berval **) slapi_ch_malloc( 2 * sizeof(struct berval *) );
bvp[0] = bv;
bvp[1] = NULL;
if (cf_refs == NULL) {
GR_UNLOCK_READ();
}
return(bvp);
}
|