schema_init.c 116 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
58
/* Change Sequence Number (CSN) - much of this will change */
#define csnValidate				blobValidate
#define csnMatch				octetStringMatch
#define csnOrderingMatch		octetStringOrderingMatch
#define csnIndexer				generalizedTimeIndexer
#define csnFilter				generalizedTimeFilter

59
60
61
/* FIXME: temporary */
#define authzMatch				octetStringMatch

62
63
64
65
66
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;

67
68
69
ldap_pvt_thread_mutex_t	ad_undef_mutex;
ldap_pvt_thread_mutex_t	oc_undef_mutex;

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

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

Kurt Zeilenga's avatar
cleanup    
Kurt Zeilenga committed
88
89
#define berValidate blobValidate

90
91
92
93
94
95
96
97
98
99
100
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;
}

101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
/* X.509 related stuff */

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

#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
};

122
/* X.509 certificate validation */
123
124
static int certificateValidate( Syntax *syntax, struct berval *in )
{
125
126
127
128
	BerElementBuffer berbuf;
	BerElement *ber = (BerElement *)&berbuf;
	ber_tag_t tag;
	ber_len_t len;
129
	ber_int_t i, version = SLAP_X509_V1;
130
131
132
133
134
135

	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;
136
137
	tag = ber_peek_tag( ber, &len );
	/* Optional version */
138
	if ( tag == SLAP_X509_OPT_C_VERSION ) {
139
		tag = ber_skip_tag( ber, &len );
140
141
142
		tag = ber_get_int( ber, &version );
		if ( tag != LBER_INTEGER ) return LDAP_INVALID_SYNTAX;
	}
143
144
145
	/* 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 */
146
	if ( tag != LBER_INTEGER ) return LDAP_INVALID_SYNTAX;
147
	ber_skip_data( ber, len );
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
163
	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 );
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
	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 */
#ifdef LDAP_DEVEL
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 i, 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 ) {
230
231
232
		ber_skip_data( ber, len );
		tag = ber_skip_tag( ber, &len );
	}
233
234
235
	/* Optional revokedCertificates */
	if ( tag == LBER_SEQUENCE ) {
		/* Should NOT be empty */
236
237
238
		ber_skip_data( ber, len );
		tag = ber_skip_tag( ber, &len );
	}
239
240
241
	/* Optional Extensions */
	if ( tag == SLAP_X509_OPT_CL_CRLEXTENSIONS ) { /* ? */
		if ( version != SLAP_X509_V2 ) return LDAP_INVALID_SYNTAX;
242
243
244
245
246
247
248
249
250
251
252
253
254
255
256
		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;
257
258
	return LDAP_SUCCESS;
}
259
260
261
#else /* ! LDAP_DEVEL */
#define certificateListValidate sequenceValidate
#endif /* ! LDAP_DEVEL */
262

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

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

	*matchp = match;
	return LDAP_SUCCESS;
}

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

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

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

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

Howard Chu's avatar
Howard Chu committed
305
306
static void
hashPreset(
307
308
309
310
	HASH_CONTEXT *HASHcontext,
	struct berval *prefix,
	char pre,
	Syntax *syntax,
Howard Chu's avatar
Howard Chu committed
311
	MatchingRule *mr)
312
313
314
315
316
317
318
319
320
321
322
323
{
	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
324
325
326
327
328
329
330
331
332
333
334
335
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 );
}

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

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

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

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

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

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

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

	*keysp = keys;

	return LDAP_SUCCESS;
}

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

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

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

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

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

	*keysp = keys;

	return LDAP_SUCCESS;
}
418

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

Kurt Zeilenga's avatar
Kurt Zeilenga committed
532
533
534
			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;
535
536
537
		}
	}

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

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

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

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

567
	for ( i = 0; !BER_BVISNULL( &values[i] ); i++ ) {
Kurt Zeilenga's avatar
Kurt Zeilenga committed
568
569
		/* count number of indices to generate */
		if( flags & SLAP_INDEX_SUBSTR_INITIAL ) {
570
571
572
573
574
			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
575
576
577
578
			}
		}

		if( flags & SLAP_INDEX_SUBSTR_ANY ) {
579
580
			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
581
582
583
584
			}
		}

		if( flags & SLAP_INDEX_SUBSTR_FINAL ) {
585
586
587
588
589
			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
590
591
592
593
594
595
596
597
598
599
			}
		}
	}

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

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

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

Howard Chu's avatar
Howard Chu committed
605
606
607
608
609
610
611
	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 );

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

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

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

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

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

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

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

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

		}
	}

	if( nkeys > 0 ) {
653
		BER_BVZERO( &keys[nkeys] );
Kurt Zeilenga's avatar
Kurt Zeilenga committed
654
655
656
657
658
659
660
661
662
663
664
665
666
667
668
669
670
		*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
671
672
	BerVarray *keysp,
	void *ctx)
Kurt Zeilenga's avatar
Kurt Zeilenga committed
673
674
675
{
	SubstringsAssertion *sa;
	char pre;
Howard Chu's avatar
Howard Chu committed
676
	ber_len_t nkeys = 0;
Kurt Zeilenga's avatar
Kurt Zeilenga committed
677
678
	size_t slen, mlen, klen;
	BerVarray keys;
Kurt Zeilenga's avatar
cleanup    
Kurt Zeilenga committed
679
680
	HASH_CONTEXT HASHcontext;
	unsigned char HASHdigest[HASH_BYTES];
Kurt Zeilenga's avatar
Kurt Zeilenga committed
681
682
683
684
685
	struct berval *value;
	struct berval digest;

	sa = (SubstringsAssertion *) assertedValue;

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

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

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

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

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

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

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

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

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

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

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

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

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

			value = &sa->sa_any[i];

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

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

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

Howard Chu's avatar
Howard Chu committed
801
802
803
		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
804
		ber_dupbv_x( &keys[nkeys++], &digest, ctx );
805
806
807
808

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

	if( nkeys > 0 ) {
824
		BER_BVZERO( &keys[nkeys] );
Kurt Zeilenga's avatar
Kurt Zeilenga committed
825
826
827
828
829
830
831
832
833
834
835
836
837
838
839
840
841
842
843
844
845
846
847
		*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
848
849
850
851
852
853
854
855
	/* 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
856
857
858
	 */
	
	if( in->bv_val[0] != '\'' ||
859
860
		in->bv_val[in->bv_len - 2] != '\'' ||
		in->bv_val[in->bv_len - 1] != 'B' )
Kurt Zeilenga's avatar
Kurt Zeilenga committed
861
862
863
864
	{
		return LDAP_INVALID_SYNTAX;
	}

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

	return LDAP_SUCCESS;
}

874
/*
Kurt Zeilenga's avatar
Kurt Zeilenga committed
875
 * Syntaxes from RFC 4517
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
932
 *

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
933
 * RFC 4512 says:
934
935
936
937
938
939
940
941
942
943
944
945
946
947
948
949
950
 *

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
951
952
953
954
955
 * 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.
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
981
 *
 * 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
982
983
984
985
986
987
static int
nameUIDValidate(
	Syntax *syntax,
	struct berval *in )
{
	int rc;
988
	struct berval dn, uid;
Kurt Zeilenga's avatar
Kurt Zeilenga committed
989

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

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

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