schema_init.c 76 KB
Newer Older
1
2
/* schema_init.c - init builtin schema */
/* $OpenLDAP$ */
Kurt Zeilenga's avatar
Kurt Zeilenga committed
3
4
5
6
7
8
9
10
11
12
13
14
/* This work is part of OpenLDAP Software <http://www.openldap.org/>.
 *
 * Copyright 1998-2003 The OpenLDAP Foundation.
 * 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
#include <limits.h>
21
22

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

#include "slap.h"
#include "ldap_pvt.h"
Pierangelo Masarati's avatar
Pierangelo Masarati committed
29
#include "lber_pvt.h"
30

31
32
#include "ldap_utf8.h"

33
34
35
36
37
38
39
40
41
42
43
44
#ifdef HAVE_TLS
#include <openssl/x509.h>
#include <openssl/err.h>
#include <openssl/rsa.h>
#include <openssl/crypto.h>
#include <openssl/pem.h>
#include <openssl/bio.h>
#include <openssl/asn1.h>
#include <openssl/x509v3.h>
#include <openssl/ssl.h>
#endif

45
46
47
48
49
50
#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)
51

Pierangelo Masarati's avatar
Pierangelo Masarati committed
52
53
#define	OpenLDAPaciMatch			NULL

54
55
/* approx matching rules */
#define directoryStringApproxMatchOID	"1.3.6.1.4.1.4203.666.4.4"
56
#define directoryStringApproxMatch		approxMatch
Gary Williams's avatar
Gary Williams committed
57
#define directoryStringApproxIndexer	approxIndexer
58
#define directoryStringApproxFilter		approxFilter
59
#define IA5StringApproxMatchOID			"1.3.6.1.4.1.4203.666.4.5"
Gary Williams's avatar
Gary Williams committed
60
#define IA5StringApproxMatch			approxMatch
61
#define IA5StringApproxIndexer			approxIndexer
Gary Williams's avatar
Gary Williams committed
62
#define IA5StringApproxFilter			approxFilter
63

Kurt Zeilenga's avatar
Kurt Zeilenga committed
64
65
66
67
static int
inValidate(
	Syntax *syntax,
	struct berval *in )
68
{
Kurt Zeilenga's avatar
Kurt Zeilenga committed
69
70
71
	/* no value allowed */
	return LDAP_INVALID_SYNTAX;
}
72

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

Kurt Zeilenga's avatar
cleanup    
Kurt Zeilenga committed
82
83
#define berValidate blobValidate

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


#ifdef HAVE_TLS
static int certificateValidate( Syntax *syntax, struct berval *in )
{
	X509 *xcert=NULL;
	unsigned char *p = in->bv_val;
 
	xcert = d2i_X509(NULL, &p, in->bv_len);
	if ( !xcert ) return LDAP_INVALID_SYNTAX;
	X509_free(xcert);
	return LDAP_SUCCESS;
}
#else
#define certificateValidate sequenceValidate
#endif

111
112
113
static int
octetStringMatch(
	int *matchp,
114
	slap_mask_t flags,
115
116
117
118
119
	Syntax *syntax,
	MatchingRule *mr,
	struct berval *value,
	void *assertedValue )
{
Kurt Zeilenga's avatar
cleanup    
Kurt Zeilenga committed
120
121
	struct berval *asserted = (struct berval *) assertedValue;
	int match = value->bv_len - asserted->bv_len;
122
123

	if( match == 0 ) {
Kurt Zeilenga's avatar
cleanup    
Kurt Zeilenga committed
124
		match = memcmp( value->bv_val, asserted->bv_val, value->bv_len );
125
126
127
128
129
130
	}

	*matchp = match;
	return LDAP_SUCCESS;
}

131
132
133
134
135
136
137
138
139
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
140
	struct berval *asserted = (struct berval *) assertedValue;
141
	ber_len_t v_len  = value->bv_len;
Kurt Zeilenga's avatar
cleanup    
Kurt Zeilenga committed
142
	ber_len_t av_len = asserted->bv_len;
143

Kurt Zeilenga's avatar
cleanup    
Kurt Zeilenga committed
144
	int match = memcmp( value->bv_val, asserted->bv_val,
145
		(v_len < av_len ? v_len : av_len) );
146
147
148

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

149
150
151
152
	*matchp = match;
	return LDAP_SUCCESS;
}

153
/* Index generation function */
154
int octetStringIndexer(
155
156
	slap_mask_t use,
	slap_mask_t flags,
157
158
159
	Syntax *syntax,
	MatchingRule *mr,
	struct berval *prefix,
160
	BerVarray values,
Howard Chu's avatar
Howard Chu committed
161
162
	BerVarray *keysp,
	void *ctx )
163
164
165
{
	int i;
	size_t slen, mlen;
166
	BerVarray keys;
Kurt Zeilenga's avatar
cleanup    
Kurt Zeilenga committed
167
168
	HASH_CONTEXT HASHcontext;
	unsigned char HASHdigest[HASH_BYTES];
169
	struct berval digest;
170
171
	digest.bv_val = HASHdigest;
	digest.bv_len = sizeof(HASHdigest);
172

173
	for( i=0; values[i].bv_val != NULL; i++ ) {
174
175
176
		/* just count them */
	}

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

Howard Chu's avatar
Howard Chu committed
180
	keys = sl_malloc( sizeof( struct berval ) * (i+1), ctx );
181

182
183
	slen = syntax->ssyn_oidlen;
	mlen = mr->smr_oidlen;
184

185
	for( i=0; values[i].bv_val != NULL; i++ ) {
186
		HASH_Init( &HASHcontext );
187
		if( prefix != NULL && prefix->bv_len > 0 ) {
188
			HASH_Update( &HASHcontext,
189
190
				prefix->bv_val, prefix->bv_len );
		}
191
		HASH_Update( &HASHcontext,
192
			syntax->ssyn_oid, slen );
193
		HASH_Update( &HASHcontext,
194
			mr->smr_oid, mlen );
195
		HASH_Update( &HASHcontext,
196
			values[i].bv_val, values[i].bv_len );
197
		HASH_Final( HASHdigest, &HASHcontext );
198

Howard Chu's avatar
Howard Chu committed
199
		ber_dupbv_x( &keys[i], &digest, ctx );
200
201
	}

202
	keys[i].bv_val = NULL;
203
	keys[i].bv_len = 0;
204
205
206
207
208
209
210

	*keysp = keys;

	return LDAP_SUCCESS;
}

/* Index generation function */
211
int octetStringFilter(
212
213
	slap_mask_t use,
	slap_mask_t flags,
214
215
216
	Syntax *syntax,
	MatchingRule *mr,
	struct berval *prefix,
217
	void * assertedValue,
Howard Chu's avatar
Howard Chu committed
218
219
	BerVarray *keysp,
	void *ctx )
220
221
{
	size_t slen, mlen;
222
	BerVarray keys;
Kurt Zeilenga's avatar
cleanup    
Kurt Zeilenga committed
223
224
	HASH_CONTEXT HASHcontext;
	unsigned char HASHdigest[HASH_BYTES];
225
	struct berval *value = (struct berval *) assertedValue;
226
	struct berval digest;
227
228
	digest.bv_val = HASHdigest;
	digest.bv_len = sizeof(HASHdigest);
229

230
231
	slen = syntax->ssyn_oidlen;
	mlen = mr->smr_oidlen;
232

Howard Chu's avatar
Howard Chu committed
233
	keys = sl_malloc( sizeof( struct berval ) * 2, ctx );
234

235
	HASH_Init( &HASHcontext );
236
	if( prefix != NULL && prefix->bv_len > 0 ) {
237
		HASH_Update( &HASHcontext,
238
239
			prefix->bv_val, prefix->bv_len );
	}
240
	HASH_Update( &HASHcontext,
241
		syntax->ssyn_oid, slen );
242
	HASH_Update( &HASHcontext,
243
		mr->smr_oid, mlen );
244
	HASH_Update( &HASHcontext,
245
		value->bv_val, value->bv_len );
246
	HASH_Final( HASHdigest, &HASHcontext );
247

Howard Chu's avatar
Howard Chu committed
248
	ber_dupbv_x( keys, &digest, ctx );
249
	keys[1].bv_val = NULL;
250
	keys[1].bv_len = 0;
251
252
253
254
255

	*keysp = keys;

	return LDAP_SUCCESS;
}
256

257
static int
Kurt Zeilenga's avatar
cleanup    
Kurt Zeilenga committed
258
octetStringSubstringsMatch(
Kurt Zeilenga's avatar
Kurt Zeilenga committed
259
260
	int *matchp,
	slap_mask_t flags,
261
	Syntax *syntax,
Kurt Zeilenga's avatar
Kurt Zeilenga committed
262
263
264
	MatchingRule *mr,
	struct berval *value,
	void *assertedValue )
265
{
Kurt Zeilenga's avatar
Kurt Zeilenga committed
266
267
268
269
	int match = 0;
	SubstringsAssertion *sub = assertedValue;
	struct berval left = *value;
	int i;
Kurt Zeilenga's avatar
cleanup    
Kurt Zeilenga committed
270
	ber_len_t inlen = 0;
271

Kurt Zeilenga's avatar
Kurt Zeilenga committed
272
273
274
	/* Add up asserted input length */
	if( sub->sa_initial.bv_val ) {
		inlen += sub->sa_initial.bv_len;
275
	}
Kurt Zeilenga's avatar
Kurt Zeilenga committed
276
277
278
279
280
281
282
	if( sub->sa_any ) {
		for(i=0; sub->sa_any[i].bv_val != NULL; i++) {
			inlen += sub->sa_any[i].bv_len;
		}
	}
	if( sub->sa_final.bv_val ) {
		inlen += sub->sa_final.bv_len;
283
284
	}

Kurt Zeilenga's avatar
Kurt Zeilenga committed
285
286
287
288
	if( sub->sa_initial.bv_val ) {
		if( inlen > left.bv_len ) {
			match = 1;
			goto done;
289
290
		}

Kurt Zeilenga's avatar
Kurt Zeilenga committed
291
292
		match = memcmp( sub->sa_initial.bv_val, left.bv_val,
			sub->sa_initial.bv_len );
293

Kurt Zeilenga's avatar
Kurt Zeilenga committed
294
295
296
		if( match != 0 ) {
			goto done;
		}
297

Kurt Zeilenga's avatar
Kurt Zeilenga committed
298
299
300
301
		left.bv_val += sub->sa_initial.bv_len;
		left.bv_len -= sub->sa_initial.bv_len;
		inlen -= sub->sa_initial.bv_len;
	}
302

Kurt Zeilenga's avatar
Kurt Zeilenga committed
303
304
305
306
307
	if( sub->sa_final.bv_val ) {
		if( inlen > left.bv_len ) {
			match = 1;
			goto done;
		}
308

Kurt Zeilenga's avatar
Kurt Zeilenga committed
309
310
311
		match = memcmp( sub->sa_final.bv_val,
			&left.bv_val[left.bv_len - sub->sa_final.bv_len],
			sub->sa_final.bv_len );
312

Kurt Zeilenga's avatar
Kurt Zeilenga committed
313
314
		if( match != 0 ) {
			goto done;
315
316
		}

Kurt Zeilenga's avatar
Kurt Zeilenga committed
317
318
		left.bv_len -= sub->sa_final.bv_len;
		inlen -= sub->sa_final.bv_len;
319
320
	}

Kurt Zeilenga's avatar
Kurt Zeilenga committed
321
322
323
324
	if( sub->sa_any ) {
		for(i=0; sub->sa_any[i].bv_val; i++) {
			ber_len_t idx;
			char *p;
325

Kurt Zeilenga's avatar
Kurt Zeilenga committed
326
327
328
329
330
331
retry:
			if( inlen > left.bv_len ) {
				/* not enough length */
				match = 1;
				goto done;
			}
332

Kurt Zeilenga's avatar
Kurt Zeilenga committed
333
334
335
			if( sub->sa_any[i].bv_len == 0 ) {
				continue;
			}
336

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

Kurt Zeilenga's avatar
Kurt Zeilenga committed
339
340
341
			if( p == NULL ) {
				match = 1;
				goto done;
342
343
			}

Kurt Zeilenga's avatar
Kurt Zeilenga committed
344
			idx = p - left.bv_val;
345

Kurt Zeilenga's avatar
Kurt Zeilenga committed
346
347
348
349
			if( idx >= left.bv_len ) {
				/* this shouldn't happen */
				return LDAP_OTHER;
			}
350

Kurt Zeilenga's avatar
Kurt Zeilenga committed
351
352
			left.bv_val = p;
			left.bv_len -= idx;
353

Kurt Zeilenga's avatar
Kurt Zeilenga committed
354
355
356
357
358
			if( sub->sa_any[i].bv_len > left.bv_len ) {
				/* not enough left */
				match = 1;
				goto done;
			}
359

Kurt Zeilenga's avatar
Kurt Zeilenga committed
360
361
362
			match = memcmp( left.bv_val,
				sub->sa_any[i].bv_val,
				sub->sa_any[i].bv_len );
363

Kurt Zeilenga's avatar
Kurt Zeilenga committed
364
365
366
367
368
			if( match != 0 ) {
				left.bv_val++;
				left.bv_len--;
				goto retry;
			}
369

Kurt Zeilenga's avatar
Kurt Zeilenga committed
370
371
372
			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;
373
374
375
		}
	}

Kurt Zeilenga's avatar
Kurt Zeilenga committed
376
377
done:
	*matchp = match;
378
379
380
	return LDAP_SUCCESS;
}

Kurt Zeilenga's avatar
Kurt Zeilenga committed
381
382
/* Substrings Index generation function */
static int
Kurt Zeilenga's avatar
cleanup    
Kurt Zeilenga committed
383
octetStringSubstringsIndexer(
Kurt Zeilenga's avatar
Kurt Zeilenga committed
384
385
386
387
388
389
	slap_mask_t use,
	slap_mask_t flags,
	Syntax *syntax,
	MatchingRule *mr,
	struct berval *prefix,
	BerVarray values,
Howard Chu's avatar
Howard Chu committed
390
391
	BerVarray *keysp,
	void *ctx )
Kurt Zeilenga's avatar
Kurt Zeilenga committed
392
393
394
395
396
{
	ber_len_t i, j, nkeys;
	size_t slen, mlen;
	BerVarray keys;

Kurt Zeilenga's avatar
cleanup    
Kurt Zeilenga committed
397
398
	HASH_CONTEXT HASHcontext;
	unsigned char HASHdigest[HASH_BYTES];
Kurt Zeilenga's avatar
Kurt Zeilenga committed
399
400
401
402
403
404
405
406
407
408
409
410
411
412
413
	struct berval digest;
	digest.bv_val = HASHdigest;
	digest.bv_len = sizeof(HASHdigest);

	nkeys=0;

	for( i=0; values[i].bv_val != NULL; i++ ) {
		/* count number of indices to generate */
		if( values[i].bv_len < SLAP_INDEX_SUBSTR_MINLEN ) {
			continue;
		}

		if( flags & SLAP_INDEX_SUBSTR_INITIAL ) {
			if( values[i].bv_len >= SLAP_INDEX_SUBSTR_MAXLEN ) {
				nkeys += SLAP_INDEX_SUBSTR_MAXLEN -
Kurt Zeilenga's avatar
cleanup    
Kurt Zeilenga committed
414
					(SLAP_INDEX_SUBSTR_MINLEN - 1);
Kurt Zeilenga's avatar
Kurt Zeilenga committed
415
			} else {
Kurt Zeilenga's avatar
cleanup    
Kurt Zeilenga committed
416
				nkeys += values[i].bv_len - (SLAP_INDEX_SUBSTR_MINLEN - 1);
Kurt Zeilenga's avatar
Kurt Zeilenga committed
417
418
419
420
421
			}
		}

		if( flags & SLAP_INDEX_SUBSTR_ANY ) {
			if( values[i].bv_len >= SLAP_INDEX_SUBSTR_MAXLEN ) {
Kurt Zeilenga's avatar
cleanup    
Kurt Zeilenga committed
422
				nkeys += values[i].bv_len - (SLAP_INDEX_SUBSTR_MAXLEN - 1);
Kurt Zeilenga's avatar
Kurt Zeilenga committed
423
424
425
426
427
428
429
430
			}
		}

		if( flags & SLAP_INDEX_SUBSTR_FINAL ) {
			if( values[i].bv_len >= SLAP_INDEX_SUBSTR_MAXLEN ) {
				nkeys += SLAP_INDEX_SUBSTR_MAXLEN -
					( SLAP_INDEX_SUBSTR_MINLEN - 1);
			} else {
Kurt Zeilenga's avatar
cleanup    
Kurt Zeilenga committed
431
				nkeys += values[i].bv_len - (SLAP_INDEX_SUBSTR_MINLEN - 1);
Kurt Zeilenga's avatar
Kurt Zeilenga committed
432
433
434
435
436
437
438
439
440
441
			}
		}
	}

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

Howard Chu's avatar
Howard Chu committed
442
	keys = sl_malloc( sizeof( struct berval ) * (nkeys+1), ctx );
Kurt Zeilenga's avatar
Kurt Zeilenga committed
443
444
445
446
447
448
449
450
451
452
453
454
455
456

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

	nkeys=0;
	for( i=0; values[i].bv_val != NULL; i++ ) {
		ber_len_t j,max;

		if( values[i].bv_len < SLAP_INDEX_SUBSTR_MINLEN ) continue;

		if( ( flags & SLAP_INDEX_SUBSTR_ANY ) &&
			( values[i].bv_len >= SLAP_INDEX_SUBSTR_MAXLEN ) )
		{
			char pre = SLAP_INDEX_SUBSTR_PREFIX;
Kurt Zeilenga's avatar
cleanup    
Kurt Zeilenga committed
457
			max = values[i].bv_len - (SLAP_INDEX_SUBSTR_MAXLEN - 1);
Kurt Zeilenga's avatar
Kurt Zeilenga committed
458
459
460
461
462
463
464
465
466
467
468
469
470
471
472
473
474
475
476

			for( j=0; j<max; j++ ) {
				HASH_Init( &HASHcontext );
				if( prefix != NULL && prefix->bv_len > 0 ) {
					HASH_Update( &HASHcontext,
						prefix->bv_val, prefix->bv_len );
				}

				HASH_Update( &HASHcontext,
					&pre, sizeof( pre ) );
				HASH_Update( &HASHcontext,
					syntax->ssyn_oid, slen );
				HASH_Update( &HASHcontext,
					mr->smr_oid, mlen );
				HASH_Update( &HASHcontext,
					&values[i].bv_val[j],
					SLAP_INDEX_SUBSTR_MAXLEN );
				HASH_Final( HASHdigest, &HASHcontext );

Howard Chu's avatar
Howard Chu committed
477
				ber_dupbv_x( &keys[nkeys++], &digest, ctx );
Kurt Zeilenga's avatar
Kurt Zeilenga committed
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
			}
		}

		max = SLAP_INDEX_SUBSTR_MAXLEN < values[i].bv_len
			? SLAP_INDEX_SUBSTR_MAXLEN : values[i].bv_len;

		for( j=SLAP_INDEX_SUBSTR_MINLEN; j<=max; j++ ) {
			char pre;

			if( flags & SLAP_INDEX_SUBSTR_INITIAL ) {
				pre = SLAP_INDEX_SUBSTR_INITIAL_PREFIX;
				HASH_Init( &HASHcontext );
				if( prefix != NULL && prefix->bv_len > 0 ) {
					HASH_Update( &HASHcontext,
						prefix->bv_val, prefix->bv_len );
				}
				HASH_Update( &HASHcontext,
					&pre, sizeof( pre ) );
				HASH_Update( &HASHcontext,
					syntax->ssyn_oid, slen );
				HASH_Update( &HASHcontext,
					mr->smr_oid, mlen );
				HASH_Update( &HASHcontext,
					values[i].bv_val, j );
				HASH_Final( HASHdigest, &HASHcontext );

Howard Chu's avatar
Howard Chu committed
504
				ber_dupbv_x( &keys[nkeys++], &digest, ctx );
Kurt Zeilenga's avatar
Kurt Zeilenga committed
505
506
507
508
509
510
511
512
513
514
515
516
517
518
519
520
521
522
523
			}

			if( flags & SLAP_INDEX_SUBSTR_FINAL ) {
				pre = SLAP_INDEX_SUBSTR_FINAL_PREFIX;
				HASH_Init( &HASHcontext );
				if( prefix != NULL && prefix->bv_len > 0 ) {
					HASH_Update( &HASHcontext,
						prefix->bv_val, prefix->bv_len );
				}
				HASH_Update( &HASHcontext,
					&pre, sizeof( pre ) );
				HASH_Update( &HASHcontext,
					syntax->ssyn_oid, slen );
				HASH_Update( &HASHcontext,
					mr->smr_oid, mlen );
				HASH_Update( &HASHcontext,
					&values[i].bv_val[values[i].bv_len-j], j );
				HASH_Final( HASHdigest, &HASHcontext );

Howard Chu's avatar
Howard Chu committed
524
				ber_dupbv_x( &keys[nkeys++], &digest, ctx );
Kurt Zeilenga's avatar
Kurt Zeilenga committed
525
526
527
528
529
530
531
532
533
534
535
536
537
538
539
540
541
542
543
544
545
546
547
548
549
			}

		}

	}

	if( nkeys > 0 ) {
		keys[nkeys].bv_val = NULL;
		*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
550
551
	BerVarray *keysp,
	void *ctx)
Kurt Zeilenga's avatar
Kurt Zeilenga committed
552
553
554
555
556
557
{
	SubstringsAssertion *sa;
	char pre;
	ber_len_t nkeys = 0;
	size_t slen, mlen, klen;
	BerVarray keys;
Kurt Zeilenga's avatar
cleanup    
Kurt Zeilenga committed
558
559
	HASH_CONTEXT HASHcontext;
	unsigned char HASHdigest[HASH_BYTES];
Kurt Zeilenga's avatar
Kurt Zeilenga committed
560
561
562
563
564
565
566
567
568
569
570
571
572
573
574
575
576
577
578
579
580
581
582
583
584
585
586
587
588
589
590
591
592
593
594
595
596
597
598
	struct berval *value;
	struct berval digest;

	sa = (SubstringsAssertion *) assertedValue;

	if( flags & SLAP_INDEX_SUBSTR_INITIAL && sa->sa_initial.bv_val != NULL
		&& sa->sa_initial.bv_len >= SLAP_INDEX_SUBSTR_MINLEN )
	{
		nkeys++;
	}

	if( flags & SLAP_INDEX_SUBSTR_ANY && sa->sa_any != NULL ) {
		ber_len_t i;
		for( i=0; sa->sa_any[i].bv_val != NULL; i++ ) {
			if( sa->sa_any[i].bv_len >= SLAP_INDEX_SUBSTR_MAXLEN ) {
				/* don't bother accounting for stepping */
				nkeys += sa->sa_any[i].bv_len -
					( SLAP_INDEX_SUBSTR_MAXLEN - 1 );
			}
		}
	}

	if( flags & SLAP_INDEX_SUBSTR_FINAL && sa->sa_final.bv_val != NULL &&
		sa->sa_final.bv_len >= SLAP_INDEX_SUBSTR_MINLEN )
	{
		nkeys++;
	}

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

	digest.bv_val = HASHdigest;
	digest.bv_len = sizeof(HASHdigest);

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

Howard Chu's avatar
Howard Chu committed
599
	keys = sl_malloc( sizeof( struct berval ) * (nkeys+1), ctx );
Kurt Zeilenga's avatar
Kurt Zeilenga committed
600
601
602
603
604
605
606
607
608
609
610
611
612
613
614
615
616
617
618
619
620
621
622
623
624
625
	nkeys = 0;

	if( flags & SLAP_INDEX_SUBSTR_INITIAL && sa->sa_initial.bv_val != NULL &&
		sa->sa_initial.bv_len >= SLAP_INDEX_SUBSTR_MINLEN )
	{
		pre = SLAP_INDEX_SUBSTR_INITIAL_PREFIX;
		value = &sa->sa_initial;

		klen = SLAP_INDEX_SUBSTR_MAXLEN < value->bv_len
			? SLAP_INDEX_SUBSTR_MAXLEN : value->bv_len;

		HASH_Init( &HASHcontext );
		if( prefix != NULL && prefix->bv_len > 0 ) {
			HASH_Update( &HASHcontext,
				prefix->bv_val, prefix->bv_len );
		}
		HASH_Update( &HASHcontext,
			&pre, sizeof( pre ) );
		HASH_Update( &HASHcontext,
			syntax->ssyn_oid, slen );
		HASH_Update( &HASHcontext,
			mr->smr_oid, mlen );
		HASH_Update( &HASHcontext,
			value->bv_val, klen );
		HASH_Final( HASHdigest, &HASHcontext );

Howard Chu's avatar
Howard Chu committed
626
		ber_dupbv_x( &keys[nkeys++], &digest, ctx );
Kurt Zeilenga's avatar
Kurt Zeilenga committed
627
628
629
630
631
632
633
634
635
636
637
638
639
640
641
642
643
644
645
646
647
648
649
650
651
652
653
654
655
656
657
658
659
	}

	if( flags & SLAP_INDEX_SUBSTR_ANY && sa->sa_any != NULL ) {
		ber_len_t i, j;
		pre = SLAP_INDEX_SUBSTR_PREFIX;
		klen = SLAP_INDEX_SUBSTR_MAXLEN;

		for( i=0; sa->sa_any[i].bv_val != NULL; i++ ) {
			if( sa->sa_any[i].bv_len < SLAP_INDEX_SUBSTR_MAXLEN ) {
				continue;
			}

			value = &sa->sa_any[i];

			for(j=0;
				j <= value->bv_len - SLAP_INDEX_SUBSTR_MAXLEN;
				j += SLAP_INDEX_SUBSTR_STEP )
			{
				HASH_Init( &HASHcontext );
				if( prefix != NULL && prefix->bv_len > 0 ) {
					HASH_Update( &HASHcontext,
						prefix->bv_val, prefix->bv_len );
				}
				HASH_Update( &HASHcontext,
					&pre, sizeof( pre ) );
				HASH_Update( &HASHcontext,
					syntax->ssyn_oid, slen );
				HASH_Update( &HASHcontext,
					mr->smr_oid, mlen );
				HASH_Update( &HASHcontext,
					&value->bv_val[j], klen ); 
				HASH_Final( HASHdigest, &HASHcontext );

Howard Chu's avatar
Howard Chu committed
660
				ber_dupbv_x( &keys[nkeys++], &digest, ctx );
Kurt Zeilenga's avatar
Kurt Zeilenga committed
661
662
663
664
665
666
667
668
669
670
671
672
673
674
675
676
677
678
679
680
681
682
683
684
685
686
687
688
			}
		}
	}

	if( flags & SLAP_INDEX_SUBSTR_FINAL && sa->sa_final.bv_val != NULL &&
		sa->sa_final.bv_len >= SLAP_INDEX_SUBSTR_MINLEN )
	{
		pre = SLAP_INDEX_SUBSTR_FINAL_PREFIX;
		value = &sa->sa_final;

		klen = SLAP_INDEX_SUBSTR_MAXLEN < value->bv_len
			? SLAP_INDEX_SUBSTR_MAXLEN : value->bv_len;

		HASH_Init( &HASHcontext );
		if( prefix != NULL && prefix->bv_len > 0 ) {
			HASH_Update( &HASHcontext,
				prefix->bv_val, prefix->bv_len );
		}
		HASH_Update( &HASHcontext,
			&pre, sizeof( pre ) );
		HASH_Update( &HASHcontext,
			syntax->ssyn_oid, slen );
		HASH_Update( &HASHcontext,
			mr->smr_oid, mlen );
		HASH_Update( &HASHcontext,
			&value->bv_val[value->bv_len-klen], klen );
		HASH_Final( HASHdigest, &HASHcontext );

Howard Chu's avatar
Howard Chu committed
689
		ber_dupbv_x( &keys[nkeys++], &digest, ctx );
Kurt Zeilenga's avatar
Kurt Zeilenga committed
690
691
692
693
694
695
696
697
698
699
700
701
702
703
704
705
706
707
708
709
710
711
712
713
714
715
716
717
	}

	if( nkeys > 0 ) {
		keys[nkeys].bv_val = NULL;
		*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
cleanup    
Kurt Zeilenga committed
718
719
720
	 * RFC 2252 section 6.3 Bit String
	 *	bitstring = "'" *binary-digit "'B"
	 *	binary-digit = "0" / "1"
Kurt Zeilenga's avatar
Kurt Zeilenga committed
721
722
723
724
725
726
727
728
729
730
731
732
733
734
735
736
737
738
739
740
741
742
743
744
745
746
747
748
749
750
751
752
753
754
755
756
757
758
759
	 * example: '0101111101'B
	 */
	
	if( in->bv_val[0] != '\'' ||
		in->bv_val[in->bv_len-2] != '\'' ||
		in->bv_val[in->bv_len-1] != 'B' )
	{
		return LDAP_INVALID_SYNTAX;
	}

	for( i=in->bv_len-3; i>0; i-- ) {
		if( in->bv_val[i] != '0' && in->bv_val[i] != '1' ) {
			return LDAP_INVALID_SYNTAX;
		}
	}

	return LDAP_SUCCESS;
}

static int
nameUIDValidate(
	Syntax *syntax,
	struct berval *in )
{
	int rc;
	struct berval dn;

	if( in->bv_len == 0 ) return LDAP_SUCCESS;

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

	if( dn.bv_val[dn.bv_len-1] == 'B'
		&& dn.bv_val[dn.bv_len-2] == '\'' )
	{
		/* assume presence of optional UID */
		ber_len_t i;

		for(i=dn.bv_len-3; i>1; i--) {
Kurt Zeilenga's avatar
cleanup    
Kurt Zeilenga committed
760
			if( dn.bv_val[i] != '0' && dn.bv_val[i] != '1' ) {
Kurt Zeilenga's avatar
Kurt Zeilenga committed
761
762
763
764
765
766
767
768
769
770
771
772
773
774
775
776
777
778
779
				break;
			}
		}
		if( dn.bv_val[i] != '\'' || dn.bv_val[i-1] != '#' ) {
			ber_memfree( dn.bv_val );
			return LDAP_INVALID_SYNTAX;
		}

		/* trim the UID to allow use of dnValidate */
		dn.bv_val[i-1] = '\0';
		dn.bv_len = i-1;
	}

	rc = dnValidate( NULL, &dn );

	ber_memfree( dn.bv_val );
	return rc;
}

780
781
782
783
784
785
786
787
788
789
790
791
792
793
794
795
796
797
798
799
800
801
802
803
804
805
806
807
808
809
810
811
812
813
814
815
816
817
818
819
820
821
822
823
824
825
826
827
828
829
830
int
nameUIDPretty(
	Syntax *syntax,
	struct berval *val,
	struct berval *out,
	void *ctx )
{
	assert( val );
	assert( out );


#ifdef NEW_LOGGING
	LDAP_LOG( OPERATION, ARGS, ">>> nameUIDPretty: <%s>\n", val->bv_val, 0, 0 );
#else
	Debug( LDAP_DEBUG_TRACE, ">>> nameUIDPretty: <%s>\n", val->bv_val, 0, 0 );
#endif

	if( val->bv_len == 0 ) {
		ber_dupbv_x( out, val, ctx );

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

	} else {
		int rc;
		struct berval dnval = *val;
		struct berval uidval = { 0, NULL };

		if( val->bv_val[val->bv_len-1] == 'B'
			&& val->bv_val[val->bv_len-2] == '\'' )
		{
			uidval.bv_val=strrchr( val->bv_val, '#' );
			if( uidval.bv_val ) {
				dnval.bv_len = uidval.bv_val - dnval.bv_val;
				uidval.bv_len = val->bv_len - dnval.bv_len;

				uidval.bv_len--;
				uidval.bv_val++;
			}
		}

		rc = dnPretty( syntax, &dnval, out, ctx );
		if( rc != LDAP_SUCCESS ) return rc;

		if( uidval.bv_val ) {
			char *tmp = sl_realloc( out->bv_val, out->bv_len + uidval.bv_len + 2, ctx );
			int i, c, got1;
			if( tmp == NULL ) {
				ber_memfree_x( out->bv_val, ctx );
				return LDAP_OTHER;
			}
831
			out->bv_val = tmp;
832
833
834
835
836
837
838
839
840
841
842
843
844
845
846
847
848
849
850
851
852
853
854
855
856
857
858
859
860
			out->bv_val[out->bv_len++] = '#';

			got1 = uidval.bv_len < sizeof("'0'B"); 
			for(i=0; i<uidval.bv_len; i++) {
				c = uidval.bv_val[i];
				switch(c) {
					case '0':
						if( got1 ) out->bv_val[out->bv_len++] = c;
						break;
					case '1':
						got1 = 1;
					default:
						out->bv_val[out->bv_len++] = c;
				}
			}

			out->bv_val[out->bv_len] = '\0';
		}
	}

#ifdef NEW_LOGGING
	LDAP_LOG( OPERATION, ARGS, "<<< nameUIDPretty: <%s>\n", out->bv_val, 0, 0 );
#else
	Debug( LDAP_DEBUG_TRACE, "<<< nameUIDPretty: <%s>\n", out->bv_val, 0, 0 );
#endif

	return LDAP_SUCCESS;
}

Kurt Zeilenga's avatar
Kurt Zeilenga committed
861
862
863
864
865
866
static int
uniqueMemberNormalize(
	slap_mask_t usage,
	Syntax *syntax,
	MatchingRule *mr,
	struct berval *val,
Howard Chu's avatar
Howard Chu committed
867
868
	struct berval *normalized,
	void *ctx )
Kurt Zeilenga's avatar
Kurt Zeilenga committed
869
870
871
872
{
	struct berval out;
	int rc;

873
874
	assert( SLAP_MR_IS_VALUE_OF_SYNTAX( usage ));

Kurt Zeilenga's avatar
Kurt Zeilenga committed
875
876
877
878
879
880
881
882
883
884
885
886
887
888
889
890
891
892
893
894
895
896
	ber_dupbv( &out, val );
	if( out.bv_len != 0 ) {
		struct berval uid = { 0, NULL };

		if( out.bv_val[out.bv_len-1] == 'B'
			&& out.bv_val[out.bv_len-2] == '\'' )
		{
			/* assume presence of optional UID */
			uid.bv_val = strrchr( out.bv_val, '#' );

			if( uid.bv_val == NULL ) {
				free( out.bv_val );
				return LDAP_INVALID_SYNTAX;
			}

			uid.bv_len = out.bv_len - (uid.bv_val - out.bv_val);
			out.bv_len -= uid.bv_len--;

			/* temporarily trim the UID */
			*(uid.bv_val++) = '\0';
		}

Kurt Zeilenga's avatar
Kurt Zeilenga committed
897
		rc = dnNormalize( 0, NULL, NULL, &out, normalized, ctx );
Kurt Zeilenga's avatar
Kurt Zeilenga committed
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

		if( rc != LDAP_SUCCESS ) {
			free( out.bv_val );
			return LDAP_INVALID_SYNTAX;
		}

		if( uid.bv_len ) {
			normalized->bv_val = ch_realloc( normalized->bv_val,
				normalized->bv_len + uid.bv_len + sizeof("#") );

			/* 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';
		}

		free( out.bv_val );
	}

	return LDAP_SUCCESS;
}

926
927
928
929
930
931
932
933
934
935
936
937
938
939
940
941
942
943
944
945
946
947
948
949
950
951
952
953
954
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
981
982
983
984
985
986
987
988
989
990
991
992
993
994
995
996
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;
	struct berval assertedDN = { 0, NULL };
	struct berval assertedUID = { 0, NULL };
	struct berval valueDN = { 0, NULL };
	struct berval valueUID = { 0, NULL };

	if( asserted->bv_len != 0 ) {
		assertedDN = *asserted;

		if( assertedDN.bv_val[assertedDN.bv_len-1] == 'B'
			&& assertedDN.bv_val[assertedDN.bv_len-2] == '\'' )
		{
			/* assume presence of optional UID */
			assertedUID.bv_val = strrchr( assertedDN.bv_val, '#' );

			if( assertedUID.bv_val == NULL ) {
				return LDAP_INVALID_SYNTAX;
			}

			assertedUID.bv_len = assertedDN.bv_len -
				(assertedUID.bv_val - assertedDN.bv_val);
			assertedDN.bv_len -= assertedUID.bv_len--;

			/* trim the separator */
			assertedUID.bv_val++;
		}
	}

	if( value->bv_len != 0 ) {
		valueDN = *value;

		if( valueDN.bv_val[valueDN.bv_len-1] == 'B'
			&& valueDN.bv_val[valueDN.bv_len-2] == '\'' )
		{
			/* assume presence of optional UID */
			valueUID.bv_val = strrchr( valueDN.bv_val, '#' );

			if( valueUID.bv_val == NULL ) {
				return LDAP_INVALID_SYNTAX;
			}

			valueUID.bv_len = valueDN.bv_len -
				(assertedUID.bv_val - assertedDN.bv_val);
			valueDN.bv_len -= valueUID.bv_len--;

			/* trim the separator */
			valueUID.bv_val++;
		}
	}

	if( valueUID.bv_len && assertedUID.bv_len ) {
		match = memcmp( valueUID.bv_val, assertedUID.bv_val, valueUID.bv_len );
		if( match ) {
			*matchp = match;
			return LDAP_SUCCESS;
		}
	}

	return dnMatch( matchp, flags, syntax, mr, &valueDN, &assertedDN );
}

Kurt Zeilenga's avatar
Kurt Zeilenga committed
997
998
999
1000
/*
 * Handling boolean syntax and matching is quite rigid.
 * A more flexible approach would be to allow a variety
 * of strings to be normalized and prettied into TRUE