schema_init.c 125 KB
Newer Older
1
2
/* schema_init.c - init builtin schema */
/* $OpenLDAP$ */
Kurt Zeilenga's avatar
Kurt Zeilenga committed
3
4
/* This work is part of OpenLDAP Software <http://www.openldap.org/>.
 *
Kurt Zeilenga's avatar
Kurt Zeilenga committed
5
 * Copyright 1998-2007 The OpenLDAP Foundation.
Kurt Zeilenga's avatar
Kurt Zeilenga committed
6
7
8
9
10
11
12
13
14
 * All rights reserved.
 *
 * Redistribution and use in source and binary forms, with or without
 * modification, are permitted only as authorized by the OpenLDAP
 * Public License.
 *
 * A copy of this license is available in the file LICENSE in the
 * top-level directory of the distribution or, alternatively, at
 * <http://www.OpenLDAP.org/license.html>.
15
16
17
18
19
 */

#include "portable.h"

#include <stdio.h>
Kurt Zeilenga's avatar
Kurt Zeilenga committed
20
#ifdef HAVE_LIMITS_H
Kurt Zeilenga's avatar
Kurt Zeilenga committed
21
#include <limits.h>
Kurt Zeilenga's avatar
Kurt Zeilenga committed
22
#endif
23
24

#include <ac/ctype.h>
25
#include <ac/errno.h>
26
27
28
29
#include <ac/string.h>
#include <ac/socket.h>

#include "slap.h"
30
#include "../../libraries/liblber/lber-int.h" /* get ber_ptrlen() */
31

32
33
#include "ldap_utf8.h"

34
#include "lutil.h"
35
36
37
38
39
40
#include "lutil_hash.h"
#define HASH_BYTES				LUTIL_HASH_BYTES
#define HASH_CONTEXT			lutil_HASH_CTX
#define HASH_Init(c)			lutil_HASHInit(c)
#define HASH_Update(c,buf,len)	lutil_HASHUpdate(c,buf,len)
#define HASH_Final(d,c)			lutil_HASHFinal(d,c)
41

42
43
/* approx matching rules */
#define directoryStringApproxMatchOID	"1.3.6.1.4.1.4203.666.4.4"
44
#define directoryStringApproxMatch		approxMatch
Gary Williams's avatar
Gary Williams committed
45
#define directoryStringApproxIndexer	approxIndexer
46
#define directoryStringApproxFilter		approxFilter
47
#define IA5StringApproxMatchOID			"1.3.6.1.4.1.4203.666.4.5"
Gary Williams's avatar
Gary Williams committed
48
#define IA5StringApproxMatch			approxMatch
49
#define IA5StringApproxIndexer			approxIndexer
Gary Williams's avatar
Gary Williams committed
50
#define IA5StringApproxFilter			approxFilter
51

Howard Chu's avatar
Howard Chu committed
52
53
54
55
56
57
/* Change Sequence Number (CSN) - much of this will change */
#define csnMatch				octetStringMatch
#define csnOrderingMatch		octetStringOrderingMatch
#define csnIndexer				generalizedTimeIndexer
#define csnFilter				generalizedTimeFilter

58
59
#define authzMatch				octetStringMatch

60
61
62
63
64
unsigned int index_substr_if_minlen = SLAP_INDEX_SUBSTR_IF_MINLEN_DEFAULT;
unsigned int index_substr_if_maxlen = SLAP_INDEX_SUBSTR_IF_MAXLEN_DEFAULT;
unsigned int index_substr_any_len = SLAP_INDEX_SUBSTR_ANY_LEN_DEFAULT;
unsigned int index_substr_any_step = SLAP_INDEX_SUBSTR_ANY_STEP_DEFAULT;

65
66
67
ldap_pvt_thread_mutex_t	ad_undef_mutex;
ldap_pvt_thread_mutex_t	oc_undef_mutex;

68
69
70
71
72
static int
generalizedTimeValidate(
	Syntax *syntax,
	struct berval *in );

Kurt Zeilenga's avatar
Kurt Zeilenga committed
73
74
75
76
static int
inValidate(
	Syntax *syntax,
	struct berval *in )
77
{
Kurt Zeilenga's avatar
Kurt Zeilenga committed
78
79
80
	/* no value allowed */
	return LDAP_INVALID_SYNTAX;
}
81

Kurt Zeilenga's avatar
Kurt Zeilenga committed
82
83
84
85
86
87
88
static int
blobValidate(
	Syntax *syntax,
	struct berval *in )
{
	/* any value allowed */
	return LDAP_SUCCESS;
89
}
90

Kurt Zeilenga's avatar
cleanup    
Kurt Zeilenga committed
91
92
#define berValidate blobValidate

93
94
95
96
97
98
99
100
101
102
103
static int
sequenceValidate(
	Syntax *syntax,
	struct berval *in )
{
	if ( in->bv_len < 2 ) return LDAP_INVALID_SYNTAX;
	if ( in->bv_val[0] != LBER_SEQUENCE ) return LDAP_INVALID_SYNTAX;

	return LDAP_SUCCESS;
}

104
105
106
107
108
109
110
/* X.509 related stuff */

enum {
	SLAP_X509_V1		= 0,
	SLAP_X509_V2		= 1,
	SLAP_X509_V3		= 2
};
111

112
113
114
115
116
117
118
119
120
121
122
123
124
125
#define	SLAP_X509_OPTION	(LBER_CLASS_CONTEXT|LBER_CONSTRUCTED)

enum {
	SLAP_X509_OPT_C_VERSION		= SLAP_X509_OPTION + 0,
	SLAP_X509_OPT_C_ISSUERUNIQUEID	= SLAP_X509_OPTION + 1,
	SLAP_X509_OPT_C_SUBJECTUNIQUEID	= SLAP_X509_OPTION + 2,
	SLAP_X509_OPT_C_EXTENSIONS	= SLAP_X509_OPTION + 3
};

enum {
	SLAP_X509_OPT_CL_CRLEXTENSIONS	= SLAP_X509_OPTION + 0
};

/* X.509 certificate validation */
126
127
static int certificateValidate( Syntax *syntax, struct berval *in )
{
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
	BerElementBuffer berbuf;
	BerElement *ber = (BerElement *)&berbuf;
	ber_tag_t tag;
	ber_len_t len;
	ber_int_t version = SLAP_X509_V1;

	ber_init2( ber, in, LBER_USE_DER );
	tag = ber_skip_tag( ber, &len );	/* Signed wrapper */
	if ( tag != LBER_SEQUENCE ) return LDAP_INVALID_SYNTAX;
	tag = ber_skip_tag( ber, &len );	/* Sequence */
	if ( tag != LBER_SEQUENCE ) return LDAP_INVALID_SYNTAX;
	tag = ber_peek_tag( ber, &len );
	/* Optional version */
	if ( tag == SLAP_X509_OPT_C_VERSION ) {
		tag = ber_skip_tag( ber, &len );
		tag = ber_get_int( ber, &version );
		if ( tag != LBER_INTEGER ) return LDAP_INVALID_SYNTAX;
	}
	/* NOTE: don't try to parse Serial, because it might be longer
	 * than sizeof(ber_int_t); deferred to certificateExactNormalize() */
	tag = ber_skip_tag( ber, &len );	/* Serial */
	if ( tag != LBER_INTEGER ) return LDAP_INVALID_SYNTAX;
	ber_skip_data( ber, len );
	tag = ber_skip_tag( ber, &len );	/* Signature Algorithm */
	if ( tag != LBER_SEQUENCE ) return LDAP_INVALID_SYNTAX;
	ber_skip_data( ber, len );
	tag = ber_skip_tag( ber, &len );	/* Issuer DN */
	if ( tag != LBER_SEQUENCE ) return LDAP_INVALID_SYNTAX;
	ber_skip_data( ber, len );
	tag = ber_skip_tag( ber, &len );	/* Validity */
	if ( tag != LBER_SEQUENCE ) return LDAP_INVALID_SYNTAX;
	ber_skip_data( ber, len );
	tag = ber_skip_tag( ber, &len );	/* Subject DN */
	if ( tag != LBER_SEQUENCE ) return LDAP_INVALID_SYNTAX;
	ber_skip_data( ber, len );
	tag = ber_skip_tag( ber, &len );	/* Subject PublicKeyInfo */
	if ( tag != LBER_SEQUENCE ) return LDAP_INVALID_SYNTAX;
	ber_skip_data( ber, len );
	tag = ber_skip_tag( ber, &len );
	if ( tag == SLAP_X509_OPT_C_ISSUERUNIQUEID ) {	/* issuerUniqueID */
		if ( version < SLAP_X509_V2 ) return LDAP_INVALID_SYNTAX;
		ber_skip_data( ber, len );
		tag = ber_skip_tag( ber, &len );
	}
	if ( tag == SLAP_X509_OPT_C_SUBJECTUNIQUEID ) {	/* subjectUniqueID */
		if ( version < SLAP_X509_V2 ) return LDAP_INVALID_SYNTAX;
		ber_skip_data( ber, len );
		tag = ber_skip_tag( ber, &len );
	}
	if ( tag == SLAP_X509_OPT_C_EXTENSIONS ) {	/* Extensions */
		if ( version < SLAP_X509_V3 ) return LDAP_INVALID_SYNTAX;
		tag = ber_skip_tag( ber, &len );
		if ( tag != LBER_SEQUENCE ) return LDAP_INVALID_SYNTAX;
		ber_skip_data( ber, len );
		tag = ber_skip_tag( ber, &len );
	}
	/* signatureAlgorithm */
	if ( tag != LBER_SEQUENCE ) return LDAP_INVALID_SYNTAX;
	ber_skip_data( ber, len );
	tag = ber_skip_tag( ber, &len );
	/* Signature */
	if ( tag != LBER_BITSTRING ) return LDAP_INVALID_SYNTAX; 
	ber_skip_data( ber, len );
	tag = ber_skip_tag( ber, &len );
	/* Must be at end now */
	if ( len || tag != LBER_DEFAULT ) return LDAP_INVALID_SYNTAX;
	return LDAP_SUCCESS;
}

/* X.509 certificate list validation */
static int certificateListValidate( Syntax *syntax, struct berval *in )
{
	BerElementBuffer berbuf;
	BerElement *ber = (BerElement *)&berbuf;
	ber_tag_t tag;
	ber_len_t len;
	ber_int_t version = SLAP_X509_V1;

	ber_init2( ber, in, LBER_USE_DER );
	tag = ber_skip_tag( ber, &len );	/* Signed wrapper */
	if ( tag != LBER_SEQUENCE ) return LDAP_INVALID_SYNTAX;
	tag = ber_skip_tag( ber, &len );	/* Sequence */
	if ( tag != LBER_SEQUENCE ) return LDAP_INVALID_SYNTAX;
	tag = ber_peek_tag( ber, &len );
	/* Optional version */
	if ( tag == LBER_INTEGER ) {
		tag = ber_get_int( ber, &version );
		assert( tag == LBER_INTEGER );
		if ( version != SLAP_X509_V2 ) return LDAP_INVALID_SYNTAX;
	}
	tag = ber_skip_tag( ber, &len );	/* Signature Algorithm */
	if ( tag != LBER_SEQUENCE ) return LDAP_INVALID_SYNTAX;
	ber_skip_data( ber, len );
	tag = ber_skip_tag( ber, &len );	/* Issuer DN */
	if ( tag != LBER_SEQUENCE ) return LDAP_INVALID_SYNTAX;
	ber_skip_data( ber, len );
	tag = ber_skip_tag( ber, &len );	/* thisUpdate */
	/* NOTE: in the certificates I'm playing with, the time is UTC.
	 * maybe the tag is different from 0x17U for generalizedTime? */
	if ( tag != 0x17U ) return LDAP_INVALID_SYNTAX;
	ber_skip_data( ber, len );
	/* Optional nextUpdate */
	tag = ber_skip_tag( ber, &len );
	if ( tag == 0x17U ) {
		ber_skip_data( ber, len );
		tag = ber_skip_tag( ber, &len );
	}
	/* Optional revokedCertificates */
	if ( tag == LBER_SEQUENCE ) {
		/* Should NOT be empty */
		ber_skip_data( ber, len );
		tag = ber_skip_tag( ber, &len );
	}
	/* Optional Extensions */
	if ( tag == SLAP_X509_OPT_CL_CRLEXTENSIONS ) { /* ? */
		if ( version != SLAP_X509_V2 ) return LDAP_INVALID_SYNTAX;
		tag = ber_skip_tag( ber, &len );
		if ( tag != LBER_SEQUENCE ) return LDAP_INVALID_SYNTAX;
		ber_skip_data( ber, len );
		tag = ber_skip_tag( ber, &len );
	}
	/* signatureAlgorithm */
	if ( tag != LBER_SEQUENCE ) return LDAP_INVALID_SYNTAX;
	ber_skip_data( ber, len );
	tag = ber_skip_tag( ber, &len );
	/* Signature */
	if ( tag != LBER_BITSTRING ) return LDAP_INVALID_SYNTAX; 
	ber_skip_data( ber, len );
	tag = ber_skip_tag( ber, &len );
	/* Must be at end now */
	if ( len || tag != LBER_DEFAULT ) return LDAP_INVALID_SYNTAX;
259
260
261
	return LDAP_SUCCESS;
}

262
int
263
264
octetStringMatch(
	int *matchp,
265
	slap_mask_t flags,
266
267
268
269
270
	Syntax *syntax,
	MatchingRule *mr,
	struct berval *value,
	void *assertedValue )
{
Kurt Zeilenga's avatar
cleanup    
Kurt Zeilenga committed
271
272
	struct berval *asserted = (struct berval *) assertedValue;
	int match = value->bv_len - asserted->bv_len;
273
274

	if( match == 0 ) {
Kurt Zeilenga's avatar
cleanup    
Kurt Zeilenga committed
275
		match = memcmp( value->bv_val, asserted->bv_val, value->bv_len );
276
277
278
279
280
281
	}

	*matchp = match;
	return LDAP_SUCCESS;
}

282
int
283
284
285
286
287
288
289
290
octetStringOrderingMatch(
	int *matchp,
	slap_mask_t flags,
	Syntax *syntax,
	MatchingRule *mr,
	struct berval *value,
	void *assertedValue )
{
Kurt Zeilenga's avatar
cleanup    
Kurt Zeilenga committed
291
	struct berval *asserted = (struct berval *) assertedValue;
292
	ber_len_t v_len  = value->bv_len;
Kurt Zeilenga's avatar
cleanup    
Kurt Zeilenga committed
293
	ber_len_t av_len = asserted->bv_len;
294

Kurt Zeilenga's avatar
cleanup    
Kurt Zeilenga committed
295
	int match = memcmp( value->bv_val, asserted->bv_val,
296
		(v_len < av_len ? v_len : av_len) );
297
298
299

	if( match == 0 ) match = v_len - av_len;

300
301
302
303
	*matchp = match;
	return LDAP_SUCCESS;
}

Howard Chu's avatar
Howard Chu committed
304
305
static void
hashPreset(
306
307
308
309
	HASH_CONTEXT *HASHcontext,
	struct berval *prefix,
	char pre,
	Syntax *syntax,
Howard Chu's avatar
Howard Chu committed
310
	MatchingRule *mr)
311
312
313
314
315
316
317
318
319
320
321
322
{
	HASH_Init(HASHcontext);
	if(prefix && prefix->bv_len > 0) {
		HASH_Update(HASHcontext,
			(unsigned char *)prefix->bv_val, prefix->bv_len);
	}
	if(pre) HASH_Update(HASHcontext, (unsigned char*)&pre, sizeof(pre));
	HASH_Update(HASHcontext, (unsigned char*)syntax->ssyn_oid, syntax->ssyn_oidlen);
	HASH_Update(HASHcontext, (unsigned char*)mr->smr_oid, mr->smr_oidlen);
	return;
}

Howard Chu's avatar
Howard Chu committed
323
324
325
326
327
328
329
330
331
332
333
334
static void
hashIter(
	HASH_CONTEXT *HASHcontext,
	unsigned char *HASHdigest,
	unsigned char *value,
	int len)
{
	HASH_CONTEXT ctx = *HASHcontext;
	HASH_Update( &ctx, value, len );
	HASH_Final( HASHdigest, &ctx );
}

335
/* Index generation function */
336
int octetStringIndexer(
337
338
	slap_mask_t use,
	slap_mask_t flags,
339
340
341
	Syntax *syntax,
	MatchingRule *mr,
	struct berval *prefix,
342
	BerVarray values,
Howard Chu's avatar
Howard Chu committed
343
344
	BerVarray *keysp,
	void *ctx )
345
346
347
{
	int i;
	size_t slen, mlen;
348
	BerVarray keys;
Kurt Zeilenga's avatar
cleanup    
Kurt Zeilenga committed
349
350
	HASH_CONTEXT HASHcontext;
	unsigned char HASHdigest[HASH_BYTES];
351
	struct berval digest;
352
	digest.bv_val = (char *)HASHdigest;
353
	digest.bv_len = sizeof(HASHdigest);
354

355
	for( i=0; !BER_BVISNULL( &values[i] ); i++ ) {
356
357
358
		/* just count them */
	}

Kurt Zeilenga's avatar
Kurt Zeilenga committed
359
360
361
	/* we should have at least one value at this point */
	assert( i > 0 );

362
	keys = slap_sl_malloc( sizeof( struct berval ) * (i+1), ctx );
363

364
365
	slen = syntax->ssyn_oidlen;
	mlen = mr->smr_oidlen;
366

Howard Chu's avatar
Howard Chu committed
367
	hashPreset( &HASHcontext, prefix, 0, syntax, mr);
368
	for( i=0; !BER_BVISNULL( &values[i] ); i++ ) {
Howard Chu's avatar
Howard Chu committed
369
370
		hashIter( &HASHcontext, HASHdigest,
			(unsigned char *)values[i].bv_val, values[i].bv_len );
Howard Chu's avatar
Howard Chu committed
371
		ber_dupbv_x( &keys[i], &digest, ctx );
372
373
	}

374
	BER_BVZERO( &keys[i] );
375
376
377
378
379
380
381

	*keysp = keys;

	return LDAP_SUCCESS;
}

/* Index generation function */
382
int octetStringFilter(
383
384
	slap_mask_t use,
	slap_mask_t flags,
385
386
387
	Syntax *syntax,
	MatchingRule *mr,
	struct berval *prefix,
388
	void * assertedValue,
Howard Chu's avatar
Howard Chu committed
389
390
	BerVarray *keysp,
	void *ctx )
391
392
{
	size_t slen, mlen;
393
	BerVarray keys;
Kurt Zeilenga's avatar
cleanup    
Kurt Zeilenga committed
394
395
	HASH_CONTEXT HASHcontext;
	unsigned char HASHdigest[HASH_BYTES];
396
	struct berval *value = (struct berval *) assertedValue;
397
	struct berval digest;
398
	digest.bv_val = (char *)HASHdigest;
399
	digest.bv_len = sizeof(HASHdigest);
400

401
402
	slen = syntax->ssyn_oidlen;
	mlen = mr->smr_oidlen;
403

404
	keys = slap_sl_malloc( sizeof( struct berval ) * 2, ctx );
405

Howard Chu's avatar
Howard Chu committed
406
407
408
	hashPreset( &HASHcontext, prefix, 0, syntax, mr );
	hashIter( &HASHcontext, HASHdigest,
		(unsigned char *)value->bv_val, value->bv_len );
409

Howard Chu's avatar
Howard Chu committed
410
	ber_dupbv_x( keys, &digest, ctx );
411
	BER_BVZERO( &keys[1] );
412
413
414
415
416

	*keysp = keys;

	return LDAP_SUCCESS;
}
417

418
static int
Kurt Zeilenga's avatar
cleanup    
Kurt Zeilenga committed
419
octetStringSubstringsMatch(
Kurt Zeilenga's avatar
Kurt Zeilenga committed
420
421
	int *matchp,
	slap_mask_t flags,
422
	Syntax *syntax,
Kurt Zeilenga's avatar
Kurt Zeilenga committed
423
424
425
	MatchingRule *mr,
	struct berval *value,
	void *assertedValue )
426
{
Kurt Zeilenga's avatar
Kurt Zeilenga committed
427
428
429
430
	int match = 0;
	SubstringsAssertion *sub = assertedValue;
	struct berval left = *value;
	int i;
Kurt Zeilenga's avatar
cleanup    
Kurt Zeilenga committed
431
	ber_len_t inlen = 0;
432

Kurt Zeilenga's avatar
Kurt Zeilenga committed
433
	/* Add up asserted input length */
434
	if ( !BER_BVISNULL( &sub->sa_initial ) ) {
Kurt Zeilenga's avatar
Kurt Zeilenga committed
435
		inlen += sub->sa_initial.bv_len;
436
	}
437
438
	if ( sub->sa_any ) {
		for ( i = 0; !BER_BVISNULL( &sub->sa_any[i] ); i++ ) {
Kurt Zeilenga's avatar
Kurt Zeilenga committed
439
440
441
			inlen += sub->sa_any[i].bv_len;
		}
	}
442
	if ( !BER_BVISNULL( &sub->sa_final ) ) {
Kurt Zeilenga's avatar
Kurt Zeilenga committed
443
		inlen += sub->sa_final.bv_len;
444
445
	}

446
447
	if ( !BER_BVISNULL( &sub->sa_initial ) ) {
		if ( inlen > left.bv_len ) {
Kurt Zeilenga's avatar
Kurt Zeilenga committed
448
449
			match = 1;
			goto done;
450
451
		}

Kurt Zeilenga's avatar
Kurt Zeilenga committed
452
453
		match = memcmp( sub->sa_initial.bv_val, left.bv_val,
			sub->sa_initial.bv_len );
454

455
		if ( match != 0 ) {
Kurt Zeilenga's avatar
Kurt Zeilenga committed
456
457
			goto done;
		}
458

Kurt Zeilenga's avatar
Kurt Zeilenga committed
459
460
461
462
		left.bv_val += sub->sa_initial.bv_len;
		left.bv_len -= sub->sa_initial.bv_len;
		inlen -= sub->sa_initial.bv_len;
	}
463

464
465
	if ( !BER_BVISNULL( &sub->sa_final ) ) {
		if ( inlen > left.bv_len ) {
Kurt Zeilenga's avatar
Kurt Zeilenga committed
466
467
468
			match = 1;
			goto done;
		}
469

Kurt Zeilenga's avatar
Kurt Zeilenga committed
470
471
472
		match = memcmp( sub->sa_final.bv_val,
			&left.bv_val[left.bv_len - sub->sa_final.bv_len],
			sub->sa_final.bv_len );
473

474
		if ( match != 0 ) {
Kurt Zeilenga's avatar
Kurt Zeilenga committed
475
			goto done;
476
477
		}

Kurt Zeilenga's avatar
Kurt Zeilenga committed
478
479
		left.bv_len -= sub->sa_final.bv_len;
		inlen -= sub->sa_final.bv_len;
480
481
	}

482
483
	if ( sub->sa_any ) {
		for ( i = 0; !BER_BVISNULL( &sub->sa_any[i] ); i++ ) {
Kurt Zeilenga's avatar
Kurt Zeilenga committed
484
485
			ber_len_t idx;
			char *p;
486

Kurt Zeilenga's avatar
Kurt Zeilenga committed
487
retry:
488
			if ( inlen > left.bv_len ) {
Kurt Zeilenga's avatar
Kurt Zeilenga committed
489
490
491
492
				/* not enough length */
				match = 1;
				goto done;
			}
493

494
			if ( BER_BVISEMPTY( &sub->sa_any[i] ) ) {
Kurt Zeilenga's avatar
Kurt Zeilenga committed
495
496
				continue;
			}
497

Kurt Zeilenga's avatar
Kurt Zeilenga committed
498
			p = memchr( left.bv_val, *sub->sa_any[i].bv_val, left.bv_len );
499

Kurt Zeilenga's avatar
Kurt Zeilenga committed
500
501
502
			if( p == NULL ) {
				match = 1;
				goto done;
503
504
			}

Kurt Zeilenga's avatar
Kurt Zeilenga committed
505
			idx = p - left.bv_val;
506

507
			if ( idx >= left.bv_len ) {
Kurt Zeilenga's avatar
Kurt Zeilenga committed
508
509
510
				/* this shouldn't happen */
				return LDAP_OTHER;
			}
511

Kurt Zeilenga's avatar
Kurt Zeilenga committed
512
513
			left.bv_val = p;
			left.bv_len -= idx;
514

515
			if ( sub->sa_any[i].bv_len > left.bv_len ) {
Kurt Zeilenga's avatar
Kurt Zeilenga committed
516
517
518
519
				/* not enough left */
				match = 1;
				goto done;
			}
520

Kurt Zeilenga's avatar
Kurt Zeilenga committed
521
522
523
			match = memcmp( left.bv_val,
				sub->sa_any[i].bv_val,
				sub->sa_any[i].bv_len );
524

525
			if ( match != 0 ) {
Kurt Zeilenga's avatar
Kurt Zeilenga committed
526
527
528
529
				left.bv_val++;
				left.bv_len--;
				goto retry;
			}
530

Kurt Zeilenga's avatar
Kurt Zeilenga committed
531
532
533
			left.bv_val += sub->sa_any[i].bv_len;
			left.bv_len -= sub->sa_any[i].bv_len;
			inlen -= sub->sa_any[i].bv_len;
534
535
536
		}
	}

Kurt Zeilenga's avatar
Kurt Zeilenga committed
537
538
done:
	*matchp = match;
539
540
541
	return LDAP_SUCCESS;
}

Kurt Zeilenga's avatar
Kurt Zeilenga committed
542
543
/* Substrings Index generation function */
static int
Kurt Zeilenga's avatar
cleanup    
Kurt Zeilenga committed
544
octetStringSubstringsIndexer(
Kurt Zeilenga's avatar
Kurt Zeilenga committed
545
546
547
548
549
550
	slap_mask_t use,
	slap_mask_t flags,
	Syntax *syntax,
	MatchingRule *mr,
	struct berval *prefix,
	BerVarray values,
Howard Chu's avatar
Howard Chu committed
551
552
	BerVarray *keysp,
	void *ctx )
Kurt Zeilenga's avatar
Kurt Zeilenga committed
553
{
Howard Chu's avatar
Howard Chu committed
554
	ber_len_t i, nkeys;
Kurt Zeilenga's avatar
Kurt Zeilenga committed
555
556
557
	size_t slen, mlen;
	BerVarray keys;

Howard Chu's avatar
Howard Chu committed
558
	HASH_CONTEXT HCany, HCini, HCfin;
Kurt Zeilenga's avatar
cleanup    
Kurt Zeilenga committed
559
	unsigned char HASHdigest[HASH_BYTES];
Kurt Zeilenga's avatar
Kurt Zeilenga committed
560
	struct berval digest;
561
	digest.bv_val = (char *)HASHdigest;
Kurt Zeilenga's avatar
Kurt Zeilenga committed
562
563
	digest.bv_len = sizeof(HASHdigest);

564
	nkeys = 0;
Kurt Zeilenga's avatar
Kurt Zeilenga committed
565

566
	for ( i = 0; !BER_BVISNULL( &values[i] ); i++ ) {
Kurt Zeilenga's avatar
Kurt Zeilenga committed
567
568
		/* count number of indices to generate */
		if( flags & SLAP_INDEX_SUBSTR_INITIAL ) {
569
570
571
572
573
			if( values[i].bv_len >= index_substr_if_maxlen ) {
				nkeys += index_substr_if_maxlen -
					(index_substr_if_minlen - 1);
			} else if( values[i].bv_len >= index_substr_if_minlen ) {
				nkeys += values[i].bv_len - (index_substr_if_minlen - 1);
Kurt Zeilenga's avatar
Kurt Zeilenga committed
574
575
576
577
			}
		}

		if( flags & SLAP_INDEX_SUBSTR_ANY ) {
578
579
			if( values[i].bv_len >= index_substr_any_len ) {
				nkeys += values[i].bv_len - (index_substr_any_len - 1);
Kurt Zeilenga's avatar
Kurt Zeilenga committed
580
581
582
583
			}
		}

		if( flags & SLAP_INDEX_SUBSTR_FINAL ) {
584
585
586
587
588
			if( values[i].bv_len >= index_substr_if_maxlen ) {
				nkeys += index_substr_if_maxlen -
					(index_substr_if_minlen - 1);
			} else if( values[i].bv_len >= index_substr_if_minlen ) {
				nkeys += values[i].bv_len - (index_substr_if_minlen - 1);
Kurt Zeilenga's avatar
Kurt Zeilenga committed
589
590
591
592
593
594
595
596
597
598
			}
		}
	}

	if( nkeys == 0 ) {
		/* no keys to generate */
		*keysp = NULL;
		return LDAP_SUCCESS;
	}

599
	keys = slap_sl_malloc( sizeof( struct berval ) * (nkeys+1), ctx );
Kurt Zeilenga's avatar
Kurt Zeilenga committed
600
601
602
603

	slen = syntax->ssyn_oidlen;
	mlen = mr->smr_oidlen;

Howard Chu's avatar
Howard Chu committed
604
605
606
607
608
609
610
	if ( flags & SLAP_INDEX_SUBSTR_ANY )
		hashPreset( &HCany, prefix, SLAP_INDEX_SUBSTR_PREFIX, syntax, mr );
	if( flags & SLAP_INDEX_SUBSTR_INITIAL )
		hashPreset( &HCini, prefix, SLAP_INDEX_SUBSTR_INITIAL_PREFIX, syntax, mr );
	if( flags & SLAP_INDEX_SUBSTR_FINAL )
		hashPreset( &HCfin, prefix, SLAP_INDEX_SUBSTR_FINAL_PREFIX, syntax, mr );

611
612
	nkeys = 0;
	for ( i = 0; !BER_BVISNULL( &values[i] ); i++ ) {
Kurt Zeilenga's avatar
Kurt Zeilenga committed
613
614
615
		ber_len_t j,max;

		if( ( flags & SLAP_INDEX_SUBSTR_ANY ) &&
616
			( values[i].bv_len >= index_substr_any_len ) )
Kurt Zeilenga's avatar
Kurt Zeilenga committed
617
		{
618
			max = values[i].bv_len - (index_substr_any_len - 1);
Kurt Zeilenga's avatar
Kurt Zeilenga committed
619
620

			for( j=0; j<max; j++ ) {
Howard Chu's avatar
Howard Chu committed
621
622
623
				hashIter( &HCany, HASHdigest,
					(unsigned char *)&values[i].bv_val[j],
					index_substr_any_len );
Howard Chu's avatar
Howard Chu committed
624
				ber_dupbv_x( &keys[nkeys++], &digest, ctx );
Kurt Zeilenga's avatar
Kurt Zeilenga committed
625
626
627
			}
		}

628
		/* skip if too short */ 
629
		if( values[i].bv_len < index_substr_if_minlen ) continue;
Kurt Zeilenga's avatar
Kurt Zeilenga committed
630

631
632
		max = index_substr_if_maxlen < values[i].bv_len
			? index_substr_if_maxlen : values[i].bv_len;
633

634
		for( j=index_substr_if_minlen; j<=max; j++ ) {
Kurt Zeilenga's avatar
Kurt Zeilenga committed
635
636

			if( flags & SLAP_INDEX_SUBSTR_INITIAL ) {
Howard Chu's avatar
Howard Chu committed
637
638
				hashIter( &HCini, HASHdigest,
					(unsigned char *)values[i].bv_val, j );
Howard Chu's avatar
Howard Chu committed
639
				ber_dupbv_x( &keys[nkeys++], &digest, ctx );
Kurt Zeilenga's avatar
Kurt Zeilenga committed
640
641
642
			}

			if( flags & SLAP_INDEX_SUBSTR_FINAL ) {
Howard Chu's avatar
Howard Chu committed
643
644
				hashIter( &HCfin, HASHdigest,
					(unsigned char *)&values[i].bv_val[values[i].bv_len-j], j );
Howard Chu's avatar
Howard Chu committed
645
				ber_dupbv_x( &keys[nkeys++], &digest, ctx );
Kurt Zeilenga's avatar
Kurt Zeilenga committed
646
647
648
649
650
651
			}

		}
	}

	if( nkeys > 0 ) {
652
		BER_BVZERO( &keys[nkeys] );
Kurt Zeilenga's avatar
Kurt Zeilenga committed
653
654
655
656
657
658
659
660
661
662
663
664
665
666
667
668
669
		*keysp = keys;
	} else {
		ch_free( keys );
		*keysp = NULL;
	}

	return LDAP_SUCCESS;
}

static int
octetStringSubstringsFilter (
	slap_mask_t use,
	slap_mask_t flags,
	Syntax *syntax,
	MatchingRule *mr,
	struct berval *prefix,
	void * assertedValue,
Howard Chu's avatar
Howard Chu committed
670
671
	BerVarray *keysp,
	void *ctx)
Kurt Zeilenga's avatar
Kurt Zeilenga committed
672
673
674
{
	SubstringsAssertion *sa;
	char pre;
Howard Chu's avatar
Howard Chu committed
675
	ber_len_t nkeys = 0;
Kurt Zeilenga's avatar
Kurt Zeilenga committed
676
677
	size_t slen, mlen, klen;
	BerVarray keys;
Kurt Zeilenga's avatar
cleanup    
Kurt Zeilenga committed
678
679
	HASH_CONTEXT HASHcontext;
	unsigned char HASHdigest[HASH_BYTES];
Kurt Zeilenga's avatar
Kurt Zeilenga committed
680
681
682
683
684
	struct berval *value;
	struct berval digest;

	sa = (SubstringsAssertion *) assertedValue;

685
	if( flags & SLAP_INDEX_SUBSTR_INITIAL &&
686
		!BER_BVISNULL( &sa->sa_initial ) &&
687
		sa->sa_initial.bv_len >= index_substr_if_minlen )
Kurt Zeilenga's avatar
Kurt Zeilenga committed
688
689
	{
		nkeys++;
690
		if ( sa->sa_initial.bv_len > index_substr_if_maxlen &&
691
692
			( flags & SLAP_INDEX_SUBSTR_ANY ))
		{
693
			nkeys += 1 + (sa->sa_initial.bv_len - index_substr_if_maxlen) / index_substr_any_step;
694
		}
Kurt Zeilenga's avatar
Kurt Zeilenga committed
695
696
	}

697
	if ( flags & SLAP_INDEX_SUBSTR_ANY && sa->sa_any != NULL ) {
Kurt Zeilenga's avatar
Kurt Zeilenga committed
698
		ber_len_t i;
699
		for( i=0; !BER_BVISNULL( &sa->sa_any[i] ); i++ ) {
700
			if( sa->sa_any[i].bv_len >= index_substr_any_len ) {
701
				/* don't bother accounting with stepping */
Kurt Zeilenga's avatar
Kurt Zeilenga committed
702
				nkeys += sa->sa_any[i].bv_len -
703
					( index_substr_any_len - 1 );
Kurt Zeilenga's avatar
Kurt Zeilenga committed
704
705
706
707
			}
		}
	}

708
	if( flags & SLAP_INDEX_SUBSTR_FINAL &&
709
		!BER_BVISNULL( &sa->sa_final ) &&
710
		sa->sa_final.bv_len >= index_substr_if_minlen )
Kurt Zeilenga's avatar
Kurt Zeilenga committed
711
712
	{
		nkeys++;
713
		if ( sa->sa_final.bv_len > index_substr_if_maxlen &&
714
715
			( flags & SLAP_INDEX_SUBSTR_ANY ))
		{
716
			nkeys += 1 + (sa->sa_final.bv_len - index_substr_if_maxlen) / index_substr_any_step;
717
		}
Kurt Zeilenga's avatar
Kurt Zeilenga committed
718
719
720
721
722
723
724
	}

	if( nkeys == 0 ) {
		*keysp = NULL;
		return LDAP_SUCCESS;
	}

725
	digest.bv_val = (char *)HASHdigest;
Kurt Zeilenga's avatar
Kurt Zeilenga committed
726
727
728
729
730
	digest.bv_len = sizeof(HASHdigest);

	slen = syntax->ssyn_oidlen;
	mlen = mr->smr_oidlen;

731
	keys = slap_sl_malloc( sizeof( struct berval ) * (nkeys+1), ctx );
Kurt Zeilenga's avatar
Kurt Zeilenga committed
732
733
	nkeys = 0;

734
	if( flags & SLAP_INDEX_SUBSTR_INITIAL &&
735
		!BER_BVISNULL( &sa->sa_initial ) &&
736
		sa->sa_initial.bv_len >= index_substr_if_minlen )
Kurt Zeilenga's avatar
Kurt Zeilenga committed
737
738
739
740
	{
		pre = SLAP_INDEX_SUBSTR_INITIAL_PREFIX;
		value = &sa->sa_initial;

741
742
		klen = index_substr_if_maxlen < value->bv_len
			? index_substr_if_maxlen : value->bv_len;
Kurt Zeilenga's avatar
Kurt Zeilenga committed
743

Howard Chu's avatar
Howard Chu committed
744
745
746
		hashPreset( &HASHcontext, prefix, pre, syntax, mr );
		hashIter( &HASHcontext, HASHdigest,
			(unsigned char *)value->bv_val, klen );
Howard Chu's avatar
Howard Chu committed
747
		ber_dupbv_x( &keys[nkeys++], &digest, ctx );
748
749
750
751

		/* If initial is too long and we have subany indexed, use it
		 * to match the excess...
		 */
752
		if (value->bv_len > index_substr_if_maxlen && (flags & SLAP_INDEX_SUBSTR_ANY))
753
754
755
		{
			ber_len_t j;
			pre = SLAP_INDEX_SUBSTR_PREFIX;
Howard Chu's avatar
Howard Chu committed
756
			hashPreset( &HASHcontext, prefix, pre, syntax, mr);
757
			for ( j=index_substr_if_maxlen-1; j <= value->bv_len - index_substr_any_len; j+=index_substr_any_step )
758
			{
Howard Chu's avatar
Howard Chu committed
759
760
				hashIter( &HASHcontext, HASHdigest,
					(unsigned char *)&value->bv_val[j], index_substr_any_len );
761
762
763
				ber_dupbv_x( &keys[nkeys++], &digest, ctx );
			}
		}
Kurt Zeilenga's avatar
Kurt Zeilenga committed
764
765
766
767
768
	}

	if( flags & SLAP_INDEX_SUBSTR_ANY && sa->sa_any != NULL ) {
		ber_len_t i, j;
		pre = SLAP_INDEX_SUBSTR_PREFIX;
769
		klen = index_substr_any_len;
Kurt Zeilenga's avatar
Kurt Zeilenga committed
770

771
		for( i=0; !BER_BVISNULL( &sa->sa_any[i] ); i++ ) {
772
			if( sa->sa_any[i].bv_len < index_substr_any_len ) {
Kurt Zeilenga's avatar
Kurt Zeilenga committed
773
774
775
776
777
				continue;
			}

			value = &sa->sa_any[i];

Howard Chu's avatar
Howard Chu committed
778
			hashPreset( &HASHcontext, prefix, pre, syntax, mr);
Kurt Zeilenga's avatar
Kurt Zeilenga committed
779
			for(j=0;
780
781
				j <= value->bv_len - index_substr_any_len;
				j += index_substr_any_step )
Kurt Zeilenga's avatar
Kurt Zeilenga committed
782
			{
Howard Chu's avatar
Howard Chu committed
783
784
				hashIter( &HASHcontext, HASHdigest,
					(unsigned char *)&value->bv_val[j], klen ); 
Howard Chu's avatar
Howard Chu committed
785
				ber_dupbv_x( &keys[nkeys++], &digest, ctx );
Kurt Zeilenga's avatar
Kurt Zeilenga committed
786
787
788
789
			}
		}
	}

790
	if( flags & SLAP_INDEX_SUBSTR_FINAL &&
791
		!BER_BVISNULL( &sa->sa_final ) &&
792
		sa->sa_final.bv_len >= index_substr_if_minlen )
Kurt Zeilenga's avatar
Kurt Zeilenga committed
793
794
795
796
	{
		pre = SLAP_INDEX_SUBSTR_FINAL_PREFIX;
		value = &sa->sa_final;

797
798
		klen = index_substr_if_maxlen < value->bv_len
			? index_substr_if_maxlen : value->bv_len;
Kurt Zeilenga's avatar
Kurt Zeilenga committed
799

Howard Chu's avatar
Howard Chu committed
800
801
802
		hashPreset( &HASHcontext, prefix, pre, syntax, mr );
		hashIter( &HASHcontext, HASHdigest,
			(unsigned char *)&value->bv_val[value->bv_len-klen], klen );
Howard Chu's avatar
Howard Chu committed
803
		ber_dupbv_x( &keys[nkeys++], &digest, ctx );
804
805
806
807

		/* If final is too long and we have subany indexed, use it
		 * to match the excess...
		 */
808
		if (value->bv_len > index_substr_if_maxlen && (flags & SLAP_INDEX_SUBSTR_ANY))
809
810
811
		{
			ber_len_t j;
			pre = SLAP_INDEX_SUBSTR_PREFIX;
Howard Chu's avatar
Howard Chu committed
812
			hashPreset( &HASHcontext, prefix, pre, syntax, mr);
813
			for ( j=0; j <= value->bv_len - index_substr_if_maxlen; j+=index_substr_any_step )
814
			{
Howard Chu's avatar
Howard Chu committed
815
816
				hashIter( &HASHcontext, HASHdigest,
					(unsigned char *)&value->bv_val[j], index_substr_any_len );
817
818
819
				ber_dupbv_x( &keys[nkeys++], &digest, ctx );
			}
		}
Kurt Zeilenga's avatar
Kurt Zeilenga committed
820
821
822
	}

	if( nkeys > 0 ) {
823
		BER_BVZERO( &keys[nkeys] );
Kurt Zeilenga's avatar
Kurt Zeilenga committed
824
825
826
827
828
829
830
831
832
833
834
835
836
837
838
839
840
841
842
843
844
845
846
		*keysp = keys;
	} else {
		ch_free( keys );
		*keysp = NULL;
	}

	return LDAP_SUCCESS;
}

static int
bitStringValidate(
	Syntax *syntax,
	struct berval *in )
{
	ber_len_t i;

	/* very unforgiving validation, requires no normalization
	 * before simplistic matching
	 */
	if( in->bv_len < 3 ) {
		return LDAP_INVALID_SYNTAX;
	}

Kurt Zeilenga's avatar
Kurt Zeilenga committed
847
848
849
850
851
852
853
854
	/* RFC 4517 Section 3.3.2 Bit String:
     *	BitString    = SQUOTE *binary-digit SQUOTE "B"
     *	binary-digit = "0" / "1"
	 *
	 * where SQUOTE [RFC4512] is
	 *	SQUOTE  = %x27 ; single quote ("'")
	 *
	 * Example: '0101111101'B
Kurt Zeilenga's avatar
Kurt Zeilenga committed
855
856
857
	 */
	
	if( in->bv_val[0] != '\'' ||
858
859
		in->bv_val[in->bv_len - 2] != '\'' ||
		in->bv_val[in->bv_len - 1] != 'B' )
Kurt Zeilenga's avatar
Kurt Zeilenga committed
860
861
862
863
	{
		return LDAP_INVALID_SYNTAX;
	}

864
	for( i = in->bv_len - 3; i > 0; i-- ) {
Kurt Zeilenga's avatar
Kurt Zeilenga committed
865
866
867
868
869
870
871
872
		if( in->bv_val[i] != '0' && in->bv_val[i] != '1' ) {
			return LDAP_INVALID_SYNTAX;
		}
	}

	return LDAP_SUCCESS;
}

873
/*
Kurt Zeilenga's avatar
Kurt Zeilenga committed
874
 * Syntaxes from RFC 4517
875
876
877
878
879
880
881
882
883
884
885
886
887
888
889
890
891
892
893
894
895
896
897
898
899
900
901
902
903
904
905
906
907
908
909
910
911
912
913
914
915
916
917
918
919
920
921
922
923
924
925
926
927
928
929
930
931
 *

3.3.2.  Bit String

   A value of the Bit String syntax is a sequence of binary digits.  The
   LDAP-specific encoding of a value of this syntax is defined by the
   following ABNF:

      BitString    = SQUOTE *binary-digit SQUOTE "B"

      binary-digit = "0" / "1"

   The <SQUOTE> rule is defined in [MODELS].

      Example:
         '0101111101'B

   The LDAP definition for the Bit String syntax is:

      ( 1.3.6.1.4.1.1466.115.121.1.6 DESC 'Bit String' )

   This syntax corresponds to the BIT STRING ASN.1 type from [ASN.1].

   ...

3.3.21.  Name and Optional UID

   A value of the Name and Optional UID syntax is the distinguished name
   [MODELS] of an entity optionally accompanied by a unique identifier
   that serves to differentiate the entity from others with an identical
   distinguished name.

   The LDAP-specific encoding of a value of this syntax is defined by
   the following ABNF:

       NameAndOptionalUID = distinguishedName [ SHARP BitString ]

   The <BitString> rule is defined in Section 3.3.2.  The
   <distinguishedName> rule is defined in [LDAPDN].  The <SHARP> rule is
   defined in [MODELS].

   Note that although the '#' character may occur in the string
   representation of a distinguished name, no additional escaping of
   this character is performed when a <distinguishedName> is encoded in
   a <NameAndOptionalUID>.

      Example:
         1.3.6.1.4.1.1466.0=#04024869,O=Test,C=GB#'0101'B

   The LDAP definition for the Name and Optional UID syntax is:

      ( 1.3.6.1.4.1.1466.115.121.1.34 DESC 'Name And Optional UID' )

   This syntax corresponds to the NameAndOptionalUID ASN.1 type from
   [X.520].

 *
Kurt Zeilenga's avatar
Kurt Zeilenga committed
932
 * RFC 4512 says:
933
934
935
936
937
938
939
940
941
942
943
944
945
946
947
948
949
 *

1.4. Common ABNF Productions

  ...
      SHARP   = %x23 ; octothorpe (or sharp sign) ("#")
  ...
      SQUOTE  = %x27 ; single quote ("'")
  ...
      
 *
 * Note: normalization strips any leading "0"s, unless the
 * bit string is exactly "'0'B", so the normalized example,
 * in slapd, would result in
 * 
 * 1.3.6.1.4.1.1466.0=#04024869,o=test,c=gb#'101'B
 * 
Kurt Zeilenga's avatar
Kurt Zeilenga committed
950
951
952
953
954
 * RFC 4514 clarifies that SHARP, i.e. "#", doesn't have to
 * be escaped except when at the beginning of a value, the
 * definition of Name and Optional UID appears to be flawed,
 * because there is no clear means to determine whether the
 * UID part is present or not.
955
956
957
958
959
960
961
962
963
964
965
966
967
968
969
970
971
972
973
974
975
976
977
978
979
980
 *
 * Example:
 *
 * 	cn=Someone,dc=example,dc=com#'1'B
 *
 * could be either a NameAndOptionalUID with trailing UID, i.e.
 *
 * 	DN = "cn=Someone,dc=example,dc=com"
 * 	UID = "'1'B"
 * 
 * or a NameAndOptionalUID with no trailing UID, and the AVA
 * in the last RDN made of
 *
 * 	attributeType = dc 
 * 	attributeValue = com#'1'B
 *
 * in fact "com#'1'B" is a valid IA5 string.
 *
 * As a consequence, current slapd code assumes that the
 * presence of portions of a BitString at the end of the string 
 * representation of a NameAndOptionalUID means a BitString
 * is expected, and cause an error otherwise.  This is quite
 * arbitrary, and might change in the future.
 */


Kurt Zeilenga's avatar
Kurt Zeilenga committed
981
982
983
984
985
986
static int
nameUIDValidate(
	Syntax *syntax,
	struct berval *in )
{
	int rc;
987
	struct berval dn, uid;
Kurt Zeilenga's avatar
Kurt Zeilenga committed
988

989
	if( BER_BVISEMPTY( in ) ) return LDAP_SUCCESS;
Kurt Zeilenga's avatar
Kurt Zeilenga committed
990
991
992
993

	ber_dupbv( &dn, in );
	if( !dn.bv_val ) return LDAP_OTHER;

994
995
	/* if there's a "#", try bitStringValidate()... */
	uid.bv_val = strrchr( dn.bv_val, '#' );
996
	if ( !BER_BVISNULL( &uid ) ) {
997
998
999
1000
1001
1002
1003
1004
1005
		uid.bv_val++;
		uid.bv_len = dn.bv_len - ( uid.bv_val - dn.bv_val );

		rc = bitStringValidate( NULL, &uid );
		if ( rc == LDAP_SUCCESS ) {
			/* in case of success, trim the UID,
			 * otherwise treat it as part of the DN */
			dn.bv_len -= uid.bv_len + 1;
			uid.bv_val[-1] = '\0';
Kurt Zeilenga's avatar
Kurt Zeilenga committed
1006
1007
1008
1009
1010
1011
1012
1013
1014
		}
	}

	rc = dnValidate( NULL, &dn );

	ber_memfree( dn.bv_val );
	return rc;
}

1015
1016
1017
1018
1019
1020
1021
int
nameUIDPretty(
	Syntax *syntax,
	struct berval *val,
	struct berval *out,
	void *ctx )
{
1022
1023
	assert( val != NULL );
	assert( out != NULL );
1024
1025
1026
1027


	Debug( LDAP_DEBUG_TRACE, ">>> nameUIDPretty: <%s>\n", val->bv_val, 0, 0 );

1028
	if( BER_BVISEMPTY( val ) ) {
1029
1030
1031
1032
1033
1034
		ber_dupbv_x( out, val, ctx );

	} else if ( val->bv_len > SLAP_LDAPDN_MAXLEN ) {
		return LDAP_INVALID_SYNTAX;

	} else {
1035
1036
1037
		int		rc;
		struct berval	dnval = *val;
		struct berval	uidval = BER_BVNULL;
1038

1039
		uidval.bv_val = strrchr( val->bv_val, '#' );
1040
		if ( !BER_BVISNULL( &uidval ) ) {
1041
1042
			uidval.bv_val++;
			uidval.bv_len = val->bv_len - ( uidval.bv_val - val->bv_val );
1043

1044
			rc = bitStringValidate( NULL, &uidval );
1045

1046
1047
1048
1049
			if ( rc == LDAP_SUCCESS ) {
				ber_dupbv_x( &dnval, val, ctx );
				dnval.bv_len -= uidval.bv_len + 1;
				dnval.bv_val[dnval.bv_len] = '\0';
1050

1051
			} else {
1052
				BER_BVZERO( &uidval );
1053
			}
1054
1055
1056
		}

		rc = dnPretty( syntax, &dnval, out, ctx );
1057
1058
1059
1060
1061
1062
		if ( dnval.bv_val != val->bv_val ) {
			slap_sl_free( dnval.bv_val, ctx );
		}
		if( rc != LDAP_SUCCESS ) {
			return rc;
		}
1063

1064
		if( !BER_BVISNULL( &uidval ) ) {
1065
1066
1067
			int	i, c, got1;
			char	*tmp;

1068
1069
			tmp = slap_sl_realloc( out->bv_val, out->bv_len 
				+ STRLENOF( "#" ) + uidval.bv_len + 1,
Kurt Zeilenga's avatar
cleanup    
Kurt Zeilenga committed
1070
				ctx );
1071
1072
1073
1074
			if( tmp == NULL ) {
				ber_memfree_x( out->bv_val, ctx );
				return LDAP_OTHER;
			}
1075
			out->bv_val = tmp;
1076
			out->bv_val[out->bv_len++] = '#';
1077
			out->bv_val[out->bv_len++] = '\'';
1078
1079

			got1 = uidval.bv_len < sizeof("'0'B"); 
1080
			for( i = 1; i < uidval.bv_len - 2; i++ ) {
1081
1082
1083
1084
1085
1086
1087
1088
				c = uidval.bv_val[i];
				switch(c) {
					case '0':
						if( got1 ) out->bv_val[out->bv_len++] = c;
						break;
					case '1':
						got1 = 1;
						out->bv_val[out->bv_len++] = c;
1089
						break;
1090
1091
1092
				}
			}

1093
1094
			out->bv_val[out->bv_len++] = '\'';
			out->bv_val[out->bv_len++] = 'B';
1095
1096
1097
1098
1099
1100
1101
1102
1103
			out->bv_val[out->bv_len] = '\0';
		}
	}

	Debug( LDAP_DEBUG_TRACE, "<<< nameUIDPretty: <%s>\n", out->bv_val, 0, 0 );

	return LDAP_SUCCESS;
}

Kurt Zeilenga's avatar
Kurt Zeilenga committed
1104
1105
1106
1107
1108
1109
static int
uniqueMemberNormalize(
	slap_mask_t usage,
	Syntax *syntax,
	MatchingRule *mr,
	struct berval *val,
Howard Chu's avatar
Howard Chu committed
1110
1111
	struct berval *normalized,
	void *ctx )
Kurt Zeilenga's avatar
Kurt Zeilenga committed
1112
1113
1114
1115
{
	struct berval out;
	int rc;

1116
	assert( SLAP_MR_IS_VALUE_OF_SYNTAX( usage ) != 0 );
1117

Pierangelo Masarati's avatar
Pierangelo Masarati committed
1118
1119
	ber_dupbv_x( &out, val, ctx );
	if ( BER_BVISEMPTY( &out ) ) {
1120
1121
1122
		*normalized = out;

	} else {
Kurt Zeilenga's avatar
Kurt Zeilenga committed
1123
		struct berval uid = BER_BVNULL;
Kurt Zeilenga's avatar
Kurt Zeilenga committed
1124

1125
		uid.bv_val = strrchr( out.bv_val, '#' );
1126
		if ( !BER_BVISNULL( &uid ) ) {
1127
1128
1129
1130
1131
1132
1133
1134
			uid.bv_val++;
			uid.bv_len = out.bv_len - ( uid.bv_val - out.bv_val );

			rc = bitStringValidate( NULL, &uid );
			if ( rc == LDAP_SUCCESS ) {
				uid.bv_val[-1] = '\0';
				out.bv_len -= uid.bv_len + 1;
			} else {
1135
				BER_BVZERO( &uid );
Kurt Zeilenga's avatar
Kurt Zeilenga committed
1136
1137
1138
			}
		}

Kurt Zeilenga's avatar
Kurt Zeilenga committed
1139
		rc = dnNormalize( 0, NULL, NULL, &out, normalized, ctx );
Kurt Zeilenga's avatar
Kurt Zeilenga committed
1140
1141

		if( rc != LDAP_SUCCESS ) {
Pierangelo Masarati's avatar
Pierangelo Masarati committed
1142
			slap_sl_free( out.bv_val, ctx );
Kurt Zeilenga's avatar
Kurt Zeilenga committed
1143
1144
1145
			return LDAP_INVALID_SYNTAX;
		}

1146
		if( !BER_BVISNULL( &uid ) ) {
1147
1148
1149
			char	*tmp;

			tmp = ch_realloc( normalized->bv_val,
1150
1151
				normalized->bv_len + uid.bv_len
				+ STRLENOF("#") + 1 );
1152
1153
1154
1155
1156
1157
			if ( tmp == NULL ) {
				ber_memfree_x( normalized->bv_val, ctx );
				return LDAP_OTHER;
			}

			normalized->bv_val = tmp;
Kurt Zeilenga's avatar
Kurt Zeilenga committed
1158
1159
1160
1161
1162
1163
1164
1165
1166
1167
1168
1169
1170

			/* insert the separator */
			normalized->bv_val[normalized->bv_len++] = '#';

			/* append the UID */
			AC_MEMCPY( &normalized->bv_val[normalized->bv_len],
				uid.bv_val, uid.bv_len );
			normalized->bv_len += uid.bv_len;

			/* terminate */
			normalized->bv_val[normalized->bv_len] = '\0';
		}

Pierangelo Masarati's avatar
Pierangelo Masarati committed
1171
		slap_sl_free( out.bv_val, ctx );
Kurt Zeilenga's avatar
Kurt Zeilenga committed
1172
1173
1174
1175
1176
	}

	return LDAP_SUCCESS;
}

1177
1178
1179
1180
1181
1182
1183
1184
1185
1186
1187
static int
uniqueMemberMatch(
	int *matchp,
	slap_mask_t flags,
	Syntax *syntax,
	MatchingRule *mr,
	struct berval *value,
	void *assertedValue )
{
	int match;
	struct berval *asserted = (struct berval *) assertedValue;
1188
	struct berval assertedDN = *asserted;
Kurt Zeilenga's avatar
Kurt Zeilenga committed
1189
	struct berval assertedUID = BER_BVNULL;
Howard Chu's avatar
Howard Chu committed
1190
	struct berval