schema_init.c 169 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/>.
 *
Quanah Gibson-Mount's avatar
Quanah Gibson-Mount committed
5
 * Copyright 1998-2020 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
 */

Quanah Gibson-Mount's avatar
Quanah Gibson-Mount committed
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
/*
 * Syntaxes - implementation notes:
 *
 * Validate function(syntax, value):
 *   Called before the other functions here to check if the value
 *   is valid according to the syntax.
 *
 * Pretty function(syntax, input value, output prettified...):
 *   If it exists, maps different notations of the same value to a
 *   unique representation which can be stored in the directory and
 *   possibly be passed to the Match/Indexer/Filter() functions.
 *
 *   E.g. DN "2.5.4.3 = foo\,bar, o = BAZ" -> "cn=foo\2Cbar,o=BAZ",
 *   but unlike DN normalization, "BAZ" is not mapped to "baz".
 */

/*
 * Matching rules - implementation notes:
 *
 * Matching rules match an attribute value (often from the directory)
 * against an asserted value (e.g. from a filter).
 *
 * Invoked with validated and commonly pretty/normalized arguments, thus
 * a number of matching rules can simply use the octetString functions.
 *
 * Normalize function(...input value, output normalized...):
 *   If it exists, maps matching values to a unique representation
 *   which is passed to the Match/Indexer/Filter() functions.
 *
 *   Different matching rules can normalize values of the same syntax
 *   differently.  E.g. caseIgnore rules normalize to lowercase,
 *   caseExact rules do not.
 *
 * Match function(*output matchp, ...value, asserted value):
 *   On success, set *matchp.  0 means match.  For ORDERING/most EQUALITY,
 *   less/greater than 0 means value less/greater than asserted.  However:
 *
 *   In extensible match filters, ORDERING rules match if value<asserted.
 *
 *   EQUALITY rules may order values differently than ORDERING rules for
 *   speed, since EQUALITY ordering is only used for SLAP_AT_SORTED_VAL.
 *   Some EQUALITY rules do not order values (ITS#6722).
 *
 * Indexer function(...attribute values, *output keysp,...):
 *   Generates index keys for the attribute values.  Backends can store
 *   them in an index, a {key->entry ID set} mapping, for the attribute.
 *
 *   A search can look up the DN/scope and asserted values in the
 *   indexes, if any, to narrow down the number of entires to check
 *   against the search criteria.
 *
 * Filter function(...asserted value, *output keysp,...):
 *   Generates index key(s) for the asserted value, to be looked up in
 *   the index from the Indexer function.  *keysp is an array because
 *   substring matching rules can generate multiple lookup keys.
 *
 * Index keys:
 *   A key is usually a hash of match type, attribute value and schema
 *   info, because one index can contain keys for many filtering types.
 *
 *   Some indexes instead have EQUALITY keys ordered so that if
 *   key(val1) < key(val2), then val1 < val2 by the ORDERING rule.
 *   That way the ORDERING rule can use the EQUALITY index.
 *
 * Substring indexing:
 *   This chops the attribute values up in small chunks and indexes all
 *   possible chunks of certain sizes.  Substring filtering looks up
 *   SOME of the asserted value's chunks, and the caller uses the
 *   intersection of the resulting entry ID sets.
 *   See the index_substr_* keywords in slapd.conf(5).
 */

89
90
91
#include "portable.h"

#include <stdio.h>
Kurt Zeilenga's avatar
Kurt Zeilenga committed
92
#ifdef HAVE_LIMITS_H
Kurt Zeilenga's avatar
Kurt Zeilenga committed
93
#include <limits.h>
Kurt Zeilenga's avatar
Kurt Zeilenga committed
94
#endif
95
96

#include <ac/ctype.h>
97
#include <ac/errno.h>
98
99
100
101
#include <ac/string.h>
#include <ac/socket.h>

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

104
105
#include "ldap_utf8.h"

106
#include "lutil.h"
107
108
109
110
111
112
#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)
113

114
115
/* approx matching rules */
#define directoryStringApproxMatchOID	"1.3.6.1.4.1.4203.666.4.4"
116
#define directoryStringApproxMatch		approxMatch
Gary Williams's avatar
Gary Williams committed
117
#define directoryStringApproxIndexer	approxIndexer
118
#define directoryStringApproxFilter		approxFilter
119
#define IA5StringApproxMatchOID			"1.3.6.1.4.1.4203.666.4.5"
Gary Williams's avatar
Gary Williams committed
120
#define IA5StringApproxMatch			approxMatch
121
#define IA5StringApproxIndexer			approxIndexer
Gary Williams's avatar
Gary Williams committed
122
#define IA5StringApproxFilter			approxFilter
123

Howard Chu's avatar
Howard Chu committed
124
125
126
127
128
129
/* Change Sequence Number (CSN) - much of this will change */
#define csnMatch				octetStringMatch
#define csnOrderingMatch		octetStringOrderingMatch
#define csnIndexer				generalizedTimeIndexer
#define csnFilter				generalizedTimeFilter

130
131
#define authzMatch				octetStringMatch

Quanah Gibson-Mount's avatar
Quanah Gibson-Mount committed
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
/* X.509 PMI ldapSyntaxes */
/* FIXME: need to create temporary OIDs under OpenLDAP's arc;
 * these are currently hijacked
 *
 *	1.3.6.1.4.1.4203.666		OpenLDAP
 *	1.3.6.1.4.1.4203.666.11		self-contained works
 *	1.3.6.1.4.1.4203.666.11.10	X.509 PMI
 *	1.3.6.1.4.1.4203.666.11.10.2	X.509 PMI ldapSyntaxes
 *	1.3.6.1.4.1.4203.666.11.10.2.1	AttributeCertificate (supported)
 *	1.3.6.1.4.1.4203.666.11.10.2.2	AttributeCertificateExactAssertion (supported)
 *	1.3.6.1.4.1.4203.666.11.10.2.3	AttributeCertificateAssertion (not supported)
 *	1.3.6.1.4.1.4203.666.11.10.2.4	AttCertPath (X-SUBST'ed right now in pmi.schema)
 *	1.3.6.1.4.1.4203.666.11.10.2.5	PolicySyntax (X-SUBST'ed right now in pmi.schema)
 *	1.3.6.1.4.1.4203.666.11.10.2.6	RoleSyntax (X-SUBST'ed right now in pmi.schema)
 */
#if 0 /* from <draft-ietf-pkix-ldap-schema-02.txt> (expired) */
#define attributeCertificateSyntaxOID			"1.2.826.0.1.3344810.7.5"
#define attributeCertificateExactAssertionSyntaxOID	"1.2.826.0.1.3344810.7.6"
#define attributeCertificateAssertionSyntaxOID		"1.2.826.0.1.3344810.7.7"
#else /* from OpenLDAP's experimental oid arc */
#define X509_PMI_SyntaxOID				"1.3.6.1.4.1.4203.666.11.10.2"
#define attributeCertificateSyntaxOID			X509_PMI_SyntaxOID ".1"
#define attributeCertificateExactAssertionSyntaxOID	X509_PMI_SyntaxOID ".2"
#define attributeCertificateAssertionSyntaxOID		X509_PMI_SyntaxOID ".3"
#endif

158
159
160
161
162
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;

163
unsigned int index_intlen = SLAP_INDEX_INTLEN_DEFAULT;
Howard Chu's avatar
Howard Chu committed
164
165
unsigned int index_intlen_strlen = SLAP_INDEX_INTLEN_STRLEN(
	SLAP_INDEX_INTLEN_DEFAULT );
166

Howard Chu's avatar
Howard Chu committed
167
ldap_pvt_thread_mutex_t	ad_index_mutex;
168
169
170
ldap_pvt_thread_mutex_t	ad_undef_mutex;
ldap_pvt_thread_mutex_t	oc_undef_mutex;

171
172
173
174
175
static int
generalizedTimeValidate(
	Syntax *syntax,
	struct berval *in );

Quanah Gibson-Mount's avatar
Quanah Gibson-Mount committed
176
177
178
179
180
181
182
#ifdef SUPPORT_OBSOLETE_UTC_SYNTAX
static int
utcTimeValidate(
	Syntax *syntax,
	struct berval *in );
#endif /* SUPPORT_OBSOLETE_UTC_SYNTAX */

Kurt Zeilenga's avatar
Kurt Zeilenga committed
183
184
185
186
static int
inValidate(
	Syntax *syntax,
	struct berval *in )
187
{
Kurt Zeilenga's avatar
Kurt Zeilenga committed
188
189
190
	/* no value allowed */
	return LDAP_INVALID_SYNTAX;
}
191

Kurt Zeilenga's avatar
Kurt Zeilenga committed
192
193
194
195
196
197
198
static int
blobValidate(
	Syntax *syntax,
	struct berval *in )
{
	/* any value allowed */
	return LDAP_SUCCESS;
199
}
200

Kurt Zeilenga's avatar
cleanup    
Kurt Zeilenga committed
201
202
#define berValidate blobValidate

203
204
205
206
207
208
209
210
211
212
213
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;
}

214
215
216
217
218
219
220
/* X.509 related stuff */

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

222
223
224
225
226
227
enum {
	SLAP_TAG_UTCTIME		= 0x17U,
	SLAP_TAG_GENERALIZEDTIME	= 0x18U
};


228
229
230
231
#define	SLAP_X509_OPTION	(LBER_CLASS_CONTEXT|LBER_CONSTRUCTED)

enum {
	SLAP_X509_OPT_C_VERSION		= SLAP_X509_OPTION + 0,
Quanah Gibson-Mount's avatar
Quanah Gibson-Mount committed
232
233
	SLAP_X509_OPT_C_ISSUERUNIQUEID	= LBER_CLASS_CONTEXT + 1,
	SLAP_X509_OPT_C_SUBJECTUNIQUEID	= LBER_CLASS_CONTEXT + 2,
234
235
236
237
238
239
240
	SLAP_X509_OPT_C_EXTENSIONS	= SLAP_X509_OPTION + 3
};

enum {
	SLAP_X509_OPT_CL_CRLEXTENSIONS	= SLAP_X509_OPTION + 0
};

Quanah Gibson-Mount's avatar
Quanah Gibson-Mount committed
241
242
243
244
245
246
247
248
249
250
251
252
253
254
255
256
257
258
259
260
261
262
263
264
265
266
267
268
269
270
271
272
273
274
/*
GeneralName ::= CHOICE {
  otherName                 [0] INSTANCE OF OTHER-NAME,
  rfc822Name                [1] IA5String,
  dNSName                   [2] IA5String,
  x400Address               [3] ORAddress,
  directoryName             [4] Name,
  ediPartyName              [5] EDIPartyName,
  uniformResourceIdentifier [6] IA5String,
  iPAddress                 [7] OCTET STRING,
  registeredID              [8] OBJECT IDENTIFIER }
*/
enum {
	SLAP_X509_GN_OTHERNAME		= SLAP_X509_OPTION + 0,
	SLAP_X509_GN_RFC822NAME		= SLAP_X509_OPTION + 1,
	SLAP_X509_GN_DNSNAME		= SLAP_X509_OPTION + 2,
	SLAP_X509_GN_X400ADDRESS	= SLAP_X509_OPTION + 3,
	SLAP_X509_GN_DIRECTORYNAME	= SLAP_X509_OPTION + 4,
	SLAP_X509_GN_EDIPARTYNAME	= SLAP_X509_OPTION + 5,
	SLAP_X509_GN_URI		= SLAP_X509_OPTION + 6,
	SLAP_X509_GN_IPADDRESS		= SLAP_X509_OPTION + 7,
	SLAP_X509_GN_REGISTEREDID	= SLAP_X509_OPTION + 8
};

/* X.509 PMI related stuff */
enum {
	SLAP_X509AC_V1		= 0,
	SLAP_X509AC_V2		= 1
};

enum {
	SLAP_X509AC_ISSUER	= SLAP_X509_OPTION + 0
};

275
/* X.509 certificate validation */
276
277
static int
certificateValidate( Syntax *syntax, struct berval *in )
278
{
279
280
281
282
283
284
	BerElementBuffer berbuf;
	BerElement *ber = (BerElement *)&berbuf;
	ber_tag_t tag;
	ber_len_t len;
	ber_int_t version = SLAP_X509_V1;

285
286
287
	if ( BER_BVISNULL( in ) || BER_BVISEMPTY( in ))
		return LDAP_INVALID_SYNTAX;

288
289
290
291
292
293
294
295
296
297
298
299
300
301
302
303
304
305
306
307
308
309
310
311
312
313
314
315
316
317
318
319
320
321
322
323
324
325
326
327
328
329
330
331
332
333
334
335
336
337
338
339
340
341
342
343
344
345
346
347
348
349
350
351
	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 */
Quanah Gibson-Mount's avatar
Quanah Gibson-Mount committed
352
353
354
static int
checkTime( struct berval *in, struct berval *out );

355
356
static int
certificateListValidate( Syntax *syntax, struct berval *in )
357
358
359
360
{
	BerElementBuffer berbuf;
	BerElement *ber = (BerElement *)&berbuf;
	ber_tag_t tag;
Quanah Gibson-Mount's avatar
Quanah Gibson-Mount committed
361
362
363
	ber_len_t len, wrapper_len;
	char *wrapper_start;
	int wrapper_ok = 0;
364
	ber_int_t version = SLAP_X509_V1;
Quanah Gibson-Mount's avatar
Quanah Gibson-Mount committed
365
	struct berval bvdn, bvtu;
366
367

	ber_init2( ber, in, LBER_USE_DER );
Quanah Gibson-Mount's avatar
Quanah Gibson-Mount committed
368
	tag = ber_skip_tag( ber, &wrapper_len );	/* Signed wrapper */
369
	if ( tag != LBER_SEQUENCE ) return LDAP_INVALID_SYNTAX;
Quanah Gibson-Mount's avatar
Quanah Gibson-Mount committed
370
	wrapper_start = ber->ber_ptr;
371
372
373
374
375
376
	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 );
377
		if ( tag != LBER_INTEGER || version != SLAP_X509_V2 ) return LDAP_INVALID_SYNTAX;
378
379
380
381
	}
	tag = ber_skip_tag( ber, &len );	/* Signature Algorithm */
	if ( tag != LBER_SEQUENCE ) return LDAP_INVALID_SYNTAX;
	ber_skip_data( ber, len );
Quanah Gibson-Mount's avatar
Quanah Gibson-Mount committed
382
	tag = ber_peek_tag( ber, &len );	/* Issuer DN */
383
	if ( tag != LBER_SEQUENCE ) return LDAP_INVALID_SYNTAX;
Quanah Gibson-Mount's avatar
Quanah Gibson-Mount committed
384
385
386
387
	len = ber_ptrlen( ber );
	bvdn.bv_val = in->bv_val + len;
	bvdn.bv_len = in->bv_len - len;
	tag = ber_skip_tag( ber, &len );
388
389
	ber_skip_data( ber, len );
	tag = ber_skip_tag( ber, &len );	/* thisUpdate */
390
	/* Time is a CHOICE { UTCTime, GeneralizedTime } */
391
	if ( tag != SLAP_TAG_UTCTIME && tag != SLAP_TAG_GENERALIZEDTIME ) return LDAP_INVALID_SYNTAX;
Quanah Gibson-Mount's avatar
Quanah Gibson-Mount committed
392
393
	bvtu.bv_val = (char *)ber->ber_ptr;
	bvtu.bv_len = len;
394
395
396
	ber_skip_data( ber, len );
	/* Optional nextUpdate */
	tag = ber_skip_tag( ber, &len );
397
	if ( tag == SLAP_TAG_UTCTIME || tag == SLAP_TAG_GENERALIZEDTIME ) {
398
399
400
		ber_skip_data( ber, len );
		tag = ber_skip_tag( ber, &len );
	}
401
	/* revokedCertificates - Sequence of Sequence, Optional */
402
	if ( tag == LBER_SEQUENCE ) {
403
		ber_len_t seqlen;
Quanah Gibson-Mount's avatar
Quanah Gibson-Mount committed
404
405
406
407
408
409
		ber_tag_t stag;
		stag = ber_peek_tag( ber, &seqlen );
		if ( stag == LBER_SEQUENCE || !len ) {
			/* RFC5280 requires non-empty, but X.509(2005) allows empty. */
			if ( len )
				ber_skip_data( ber, len );
410
411
			tag = ber_skip_tag( ber, &len );
		}
412
	}
413
	/* Optional Extensions - Sequence of Sequence */
414
	if ( tag == SLAP_X509_OPT_CL_CRLEXTENSIONS ) { /* ? */
415
		ber_len_t seqlen;
416
		if ( version != SLAP_X509_V2 ) return LDAP_INVALID_SYNTAX;
417
		tag = ber_peek_tag( ber, &seqlen );
418
419
420
421
422
423
424
425
426
427
428
		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 );
Quanah Gibson-Mount's avatar
Quanah Gibson-Mount committed
429
	if ( ber->ber_ptr == wrapper_start + wrapper_len ) wrapper_ok = 1;
430
431
	tag = ber_skip_tag( ber, &len );
	/* Must be at end now */
Quanah Gibson-Mount's avatar
Quanah Gibson-Mount committed
432
433
434
435
436
437
438
439
440
441
442
443
444
445
446
447
448
449
450
451
452
453
454
455
456
457
458
459
460
461
462
463
464
465
466
	/* NOTE: OpenSSL tolerates CL with garbage past the end */
	if ( len || tag != LBER_DEFAULT ) {
		struct berval issuer_dn = BER_BVNULL, thisUpdate;
		char tubuf[STRLENOF("YYYYmmddHHMMSSZ") + 1];
		int rc;

		if ( ! wrapper_ok ) {
			return LDAP_INVALID_SYNTAX;
		}

		rc = dnX509normalize( &bvdn, &issuer_dn );
		if ( rc != LDAP_SUCCESS ) {
			rc = LDAP_INVALID_SYNTAX;
			goto done;
		}

		thisUpdate.bv_val = tubuf;
		thisUpdate.bv_len = sizeof(tubuf); 
		if ( checkTime( &bvtu, &thisUpdate ) ) {
			rc = LDAP_INVALID_SYNTAX;
			goto done;
		}

		Debug( LDAP_DEBUG_ANY,
			"certificateListValidate issuer=\"%s\", thisUpdate=%s: extra cruft past end of certificateList\n",
			issuer_dn.bv_val, thisUpdate.bv_val, 0 );

done:;
		if ( ! BER_BVISNULL( &issuer_dn ) ) {
			ber_memfree( issuer_dn.bv_val );
		}

		return rc;
	}

467
468
469
	return LDAP_SUCCESS;
}

Quanah Gibson-Mount's avatar
Quanah Gibson-Mount committed
470
471
472
473
474
475
476
477
478
479
480
481
482
483
484
485
486
487
488
489
490
491
492
493
494
495
496
497
498
499
500
501
502
503
504
505
506
507
508
509
510
511
512
513
514
515
516
517
/* X.509 PMI Attribute Certificate Validate */
static int
attributeCertificateValidate( Syntax *syntax, struct berval *in )
{
	BerElementBuffer berbuf;
	BerElement *ber = (BerElement *)&berbuf;
	ber_tag_t tag;
	ber_len_t len;
	ber_int_t version;
	int cont = 0;

	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 );	/* Version */
	if ( tag != LBER_INTEGER ) return LDAP_INVALID_SYNTAX;
	tag = ber_get_int( ber, &version );	/* X.509 only allows v2 */
	if ( version != SLAP_X509AC_V2 ) return LDAP_INVALID_SYNTAX;

	tag = ber_skip_tag( ber, &len );	/* Holder */
	if ( tag != LBER_SEQUENCE ) return LDAP_INVALID_SYNTAX;
	ber_skip_data( ber, len );

	tag = ber_skip_tag( ber, &len );	/* Issuer */
	if ( tag != SLAP_X509AC_ISSUER ) return LDAP_INVALID_SYNTAX;
	ber_skip_data( ber, len );

	tag = ber_skip_tag( ber, &len );	/* Signature */
	if ( tag != LBER_SEQUENCE ) return LDAP_INVALID_SYNTAX;
	ber_skip_data( ber, len );

	tag = ber_skip_tag( ber, &len );	/* Serial number */
	if ( tag != LBER_INTEGER ) return LDAP_INVALID_SYNTAX;
	ber_skip_data( ber, len );

	tag = ber_skip_tag( ber, &len );	/* AttCertValidityPeriod */
	if ( tag != LBER_SEQUENCE ) return LDAP_INVALID_SYNTAX;
	ber_skip_data( ber, len );

	tag = ber_skip_tag( ber, &len );	/* Attributes */
	if ( tag != LBER_SEQUENCE ) return LDAP_INVALID_SYNTAX;
	ber_skip_data( ber, len );

518
	tag = ber_peek_tag( ber, &len );
Quanah Gibson-Mount's avatar
Quanah Gibson-Mount committed
519
520
521
522
523
524
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
550
551
552

	if ( tag == LBER_BITSTRING ) {	/* issuerUniqueID */
		tag = ber_skip_tag( ber, &len );
		ber_skip_data( ber, len );
		tag = ber_peek_tag( ber, &len );
	}

	if ( tag == LBER_SEQUENCE ) {	/* extensions or signatureAlgorithm */
		tag = ber_skip_tag( ber, &len );
		ber_skip_data( ber, len );
		cont++;
		tag = ber_peek_tag( ber, &len );
	}

	if ( tag == LBER_SEQUENCE ) {	/* signatureAlgorithm */
		tag = ber_skip_tag( ber, &len );
		ber_skip_data( ber, len );
		cont++;
		tag = ber_peek_tag( ber, &len );
	}

	if ( tag == LBER_BITSTRING ) {	/* Signature */
		tag = ber_skip_tag( ber, &len );
		ber_skip_data( ber, len );
		cont++;
		tag = ber_peek_tag( ber, &len );
	}

	/* Must be at end now */
	if ( len != 0 || tag != LBER_DEFAULT || cont < 2 ) return LDAP_INVALID_SYNTAX;

	return LDAP_SUCCESS;
}

553
int
554
555
octetStringMatch(
	int *matchp,
556
	slap_mask_t flags,
557
558
559
560
561
	Syntax *syntax,
	MatchingRule *mr,
	struct berval *value,
	void *assertedValue )
{
Kurt Zeilenga's avatar
cleanup    
Kurt Zeilenga committed
562
	struct berval *asserted = (struct berval *) assertedValue;
Quanah Gibson-Mount's avatar
Quanah Gibson-Mount committed
563
	ber_slen_t d = (ber_slen_t) value->bv_len - (ber_slen_t) asserted->bv_len;
564

Quanah Gibson-Mount's avatar
Quanah Gibson-Mount committed
565
	/* For speed, order first by length, then by contents */
Quanah Gibson-Mount's avatar
Quanah Gibson-Mount committed
566
567
	*matchp = d ? (sizeof(d) == sizeof(int) ? d : d < 0 ? -1 : 1)
		: memcmp( value->bv_val, asserted->bv_val, value->bv_len );
568
569
570
571

	return LDAP_SUCCESS;
}

572
int
573
574
575
576
577
578
579
580
octetStringOrderingMatch(
	int *matchp,
	slap_mask_t flags,
	Syntax *syntax,
	MatchingRule *mr,
	struct berval *value,
	void *assertedValue )
{
Kurt Zeilenga's avatar
cleanup    
Kurt Zeilenga committed
581
	struct berval *asserted = (struct berval *) assertedValue;
582
	ber_len_t v_len  = value->bv_len;
Kurt Zeilenga's avatar
cleanup    
Kurt Zeilenga committed
583
	ber_len_t av_len = asserted->bv_len;
584

Kurt Zeilenga's avatar
cleanup    
Kurt Zeilenga committed
585
	int match = memcmp( value->bv_val, asserted->bv_val,
586
		(v_len < av_len ? v_len : av_len) );
587

Quanah Gibson-Mount's avatar
Quanah Gibson-Mount committed
588
589
590
591
	if( match == 0 )
		match = sizeof(v_len) == sizeof(int)
			? (int) v_len - (int) av_len
			: v_len < av_len ? -1 : v_len > av_len;
592

Quanah Gibson-Mount's avatar
Quanah Gibson-Mount committed
593
	/* If used in extensible match filter, match if value < asserted */
Quanah Gibson-Mount's avatar
Quanah Gibson-Mount committed
594
595
596
	if ( flags & SLAP_MR_EXT )
		match = (match >= 0);

597
598
599
600
	*matchp = match;
	return LDAP_SUCCESS;
}

Quanah Gibson-Mount's avatar
Quanah Gibson-Mount committed
601
/* Initialize HASHcontext from match type and schema info */
Howard Chu's avatar
Howard Chu committed
602
603
static void
hashPreset(
604
605
606
607
	HASH_CONTEXT *HASHcontext,
	struct berval *prefix,
	char pre,
	Syntax *syntax,
Howard Chu's avatar
Howard Chu committed
608
	MatchingRule *mr)
609
610
611
612
613
614
615
616
617
618
619
620
{
	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;
}

Quanah Gibson-Mount's avatar
Quanah Gibson-Mount committed
621
/* Set HASHdigest from HASHcontext and value:len */
Howard Chu's avatar
Howard Chu committed
622
623
624
625
626
627
628
629
630
631
632
633
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 );
}

Quanah Gibson-Mount's avatar
Quanah Gibson-Mount committed
634
/* Index generation function: Attribute values -> index hash keys */
635
int octetStringIndexer(
636
637
	slap_mask_t use,
	slap_mask_t flags,
638
639
640
	Syntax *syntax,
	MatchingRule *mr,
	struct berval *prefix,
641
	BerVarray values,
Howard Chu's avatar
Howard Chu committed
642
643
	BerVarray *keysp,
	void *ctx )
644
645
646
{
	int i;
	size_t slen, mlen;
647
	BerVarray keys;
Kurt Zeilenga's avatar
cleanup    
Kurt Zeilenga committed
648
649
	HASH_CONTEXT HASHcontext;
	unsigned char HASHdigest[HASH_BYTES];
650
	struct berval digest;
651
	digest.bv_val = (char *)HASHdigest;
652
	digest.bv_len = sizeof(HASHdigest);
653

654
	for( i=0; !BER_BVISNULL( &values[i] ); i++ ) {
655
656
657
		/* just count them */
	}

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

661
	keys = slap_sl_malloc( sizeof( struct berval ) * (i+1), ctx );
662

663
664
	slen = syntax->ssyn_oidlen;
	mlen = mr->smr_oidlen;
665

Howard Chu's avatar
Howard Chu committed
666
	hashPreset( &HASHcontext, prefix, 0, syntax, mr);
667
	for( i=0; !BER_BVISNULL( &values[i] ); i++ ) {
Howard Chu's avatar
Howard Chu committed
668
669
		hashIter( &HASHcontext, HASHdigest,
			(unsigned char *)values[i].bv_val, values[i].bv_len );
Howard Chu's avatar
Howard Chu committed
670
		ber_dupbv_x( &keys[i], &digest, ctx );
671
672
	}

673
	BER_BVZERO( &keys[i] );
674
675
676
677
678
679

	*keysp = keys;

	return LDAP_SUCCESS;
}

Quanah Gibson-Mount's avatar
Quanah Gibson-Mount committed
680
/* Index generation function: Asserted value -> index hash key */
681
int octetStringFilter(
682
683
	slap_mask_t use,
	slap_mask_t flags,
684
685
686
	Syntax *syntax,
	MatchingRule *mr,
	struct berval *prefix,
687
	void * assertedValue,
Howard Chu's avatar
Howard Chu committed
688
689
	BerVarray *keysp,
	void *ctx )
690
691
{
	size_t slen, mlen;
692
	BerVarray keys;
Kurt Zeilenga's avatar
cleanup    
Kurt Zeilenga committed
693
694
	HASH_CONTEXT HASHcontext;
	unsigned char HASHdigest[HASH_BYTES];
695
	struct berval *value = (struct berval *) assertedValue;
696
	struct berval digest;
697
	digest.bv_val = (char *)HASHdigest;
698
	digest.bv_len = sizeof(HASHdigest);
699

700
701
	slen = syntax->ssyn_oidlen;
	mlen = mr->smr_oidlen;
702

703
	keys = slap_sl_malloc( sizeof( struct berval ) * 2, ctx );
704

Howard Chu's avatar
Howard Chu committed
705
706
707
	hashPreset( &HASHcontext, prefix, 0, syntax, mr );
	hashIter( &HASHcontext, HASHdigest,
		(unsigned char *)value->bv_val, value->bv_len );
708

Howard Chu's avatar
Howard Chu committed
709
	ber_dupbv_x( keys, &digest, ctx );
710
	BER_BVZERO( &keys[1] );
711
712
713
714
715

	*keysp = keys;

	return LDAP_SUCCESS;
}
716

717
static int
Kurt Zeilenga's avatar
cleanup    
Kurt Zeilenga committed
718
octetStringSubstringsMatch(
Kurt Zeilenga's avatar
Kurt Zeilenga committed
719
720
	int *matchp,
	slap_mask_t flags,
721
	Syntax *syntax,
Kurt Zeilenga's avatar
Kurt Zeilenga committed
722
723
724
	MatchingRule *mr,
	struct berval *value,
	void *assertedValue )
725
{
Kurt Zeilenga's avatar
Kurt Zeilenga committed
726
727
728
729
	int match = 0;
	SubstringsAssertion *sub = assertedValue;
	struct berval left = *value;
	int i;
Kurt Zeilenga's avatar
cleanup    
Kurt Zeilenga committed
730
	ber_len_t inlen = 0;
731

Kurt Zeilenga's avatar
Kurt Zeilenga committed
732
	/* Add up asserted input length */
733
	if ( !BER_BVISNULL( &sub->sa_initial ) ) {
Kurt Zeilenga's avatar
Kurt Zeilenga committed
734
		inlen += sub->sa_initial.bv_len;
735
	}
736
737
	if ( sub->sa_any ) {
		for ( i = 0; !BER_BVISNULL( &sub->sa_any[i] ); i++ ) {
Kurt Zeilenga's avatar
Kurt Zeilenga committed
738
739
740
			inlen += sub->sa_any[i].bv_len;
		}
	}
741
	if ( !BER_BVISNULL( &sub->sa_final ) ) {
Kurt Zeilenga's avatar
Kurt Zeilenga committed
742
		inlen += sub->sa_final.bv_len;
743
744
	}

745
746
	if ( !BER_BVISNULL( &sub->sa_initial ) ) {
		if ( inlen > left.bv_len ) {
Kurt Zeilenga's avatar
Kurt Zeilenga committed
747
748
			match = 1;
			goto done;
749
750
		}

Kurt Zeilenga's avatar
Kurt Zeilenga committed
751
752
		match = memcmp( sub->sa_initial.bv_val, left.bv_val,
			sub->sa_initial.bv_len );
753

754
		if ( match != 0 ) {
Kurt Zeilenga's avatar
Kurt Zeilenga committed
755
756
			goto done;
		}
757

Kurt Zeilenga's avatar
Kurt Zeilenga committed
758
759
760
761
		left.bv_val += sub->sa_initial.bv_len;
		left.bv_len -= sub->sa_initial.bv_len;
		inlen -= sub->sa_initial.bv_len;
	}
762

763
764
	if ( !BER_BVISNULL( &sub->sa_final ) ) {
		if ( inlen > left.bv_len ) {
Kurt Zeilenga's avatar
Kurt Zeilenga committed
765
766
767
			match = 1;
			goto done;
		}
768

Kurt Zeilenga's avatar
Kurt Zeilenga committed
769
770
771
		match = memcmp( sub->sa_final.bv_val,
			&left.bv_val[left.bv_len - sub->sa_final.bv_len],
			sub->sa_final.bv_len );
772

773
		if ( match != 0 ) {
Kurt Zeilenga's avatar
Kurt Zeilenga committed
774
			goto done;
775
776
		}

Kurt Zeilenga's avatar
Kurt Zeilenga committed
777
778
		left.bv_len -= sub->sa_final.bv_len;
		inlen -= sub->sa_final.bv_len;
779
780
	}

781
782
	if ( sub->sa_any ) {
		for ( i = 0; !BER_BVISNULL( &sub->sa_any[i] ); i++ ) {
Kurt Zeilenga's avatar
Kurt Zeilenga committed
783
784
			ber_len_t idx;
			char *p;
785

Kurt Zeilenga's avatar
Kurt Zeilenga committed
786
retry:
787
			if ( inlen > left.bv_len ) {
Kurt Zeilenga's avatar
Kurt Zeilenga committed
788
789
790
791
				/* not enough length */
				match = 1;
				goto done;
			}
792

793
			if ( BER_BVISEMPTY( &sub->sa_any[i] ) ) {
Kurt Zeilenga's avatar
Kurt Zeilenga committed
794
795
				continue;
			}
796

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

Kurt Zeilenga's avatar
Kurt Zeilenga committed
799
800
801
			if( p == NULL ) {
				match = 1;
				goto done;
802
803
			}

Kurt Zeilenga's avatar
Kurt Zeilenga committed
804
			idx = p - left.bv_val;
805

806
			if ( idx >= left.bv_len ) {
Kurt Zeilenga's avatar
Kurt Zeilenga committed
807
808
809
				/* this shouldn't happen */
				return LDAP_OTHER;
			}
810

Kurt Zeilenga's avatar
Kurt Zeilenga committed
811
812
			left.bv_val = p;
			left.bv_len -= idx;
813

814
			if ( sub->sa_any[i].bv_len > left.bv_len ) {
Kurt Zeilenga's avatar
Kurt Zeilenga committed
815
816
817
818
				/* not enough left */
				match = 1;
				goto done;
			}
819

Kurt Zeilenga's avatar
Kurt Zeilenga committed
820
821
822
			match = memcmp( left.bv_val,
				sub->sa_any[i].bv_val,
				sub->sa_any[i].bv_len );
823

824
			if ( match != 0 ) {
Kurt Zeilenga's avatar
Kurt Zeilenga committed
825
826
827
828
				left.bv_val++;
				left.bv_len--;
				goto retry;
			}
829

Kurt Zeilenga's avatar
Kurt Zeilenga committed
830
831
832
			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;
833
834
835
		}
	}

Kurt Zeilenga's avatar
Kurt Zeilenga committed
836
837
done:
	*matchp = match;
838
839
840
	return LDAP_SUCCESS;
}

Quanah Gibson-Mount's avatar
Quanah Gibson-Mount committed
841
/* Substring index generation function: Attribute values -> index hash keys */
Kurt Zeilenga's avatar
Kurt Zeilenga committed
842
static int
Kurt Zeilenga's avatar
cleanup    
Kurt Zeilenga committed
843
octetStringSubstringsIndexer(
Kurt Zeilenga's avatar
Kurt Zeilenga committed
844
845
846
847
848
849
	slap_mask_t use,
	slap_mask_t flags,
	Syntax *syntax,
	MatchingRule *mr,
	struct berval *prefix,
	BerVarray values,
Howard Chu's avatar
Howard Chu committed
850
851
	BerVarray *keysp,
	void *ctx )
Kurt Zeilenga's avatar
Kurt Zeilenga committed
852
{
Howard Chu's avatar
Howard Chu committed
853
	ber_len_t i, nkeys;
Kurt Zeilenga's avatar
Kurt Zeilenga committed
854
855
856
	size_t slen, mlen;
	BerVarray keys;

Howard Chu's avatar
Howard Chu committed
857
	HASH_CONTEXT HCany, HCini, HCfin;
Kurt Zeilenga's avatar
cleanup    
Kurt Zeilenga committed
858
	unsigned char HASHdigest[HASH_BYTES];
Kurt Zeilenga's avatar
Kurt Zeilenga committed
859
	struct berval digest;
860
	digest.bv_val = (char *)HASHdigest;
Kurt Zeilenga's avatar
Kurt Zeilenga committed
861
862
	digest.bv_len = sizeof(HASHdigest);

863
	nkeys = 0;
Kurt Zeilenga's avatar
Kurt Zeilenga committed
864

865
	for ( i = 0; !BER_BVISNULL( &values[i] ); i++ ) {
Kurt Zeilenga's avatar
Kurt Zeilenga committed
866
867
		/* count number of indices to generate */
		if( flags & SLAP_INDEX_SUBSTR_INITIAL ) {
868
869
870
871
872
			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
873
874
875
876
			}
		}

		if( flags & SLAP_INDEX_SUBSTR_ANY ) {
877
878
			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
879
880
881
882
			}
		}

		if( flags & SLAP_INDEX_SUBSTR_FINAL ) {
883
884
885
886
887
			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
888
889
890
891
892
893
894
895
896
897
			}
		}
	}

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

898
	keys = slap_sl_malloc( sizeof( struct berval ) * (nkeys+1), ctx );
Kurt Zeilenga's avatar
Kurt Zeilenga committed
899
900
901
902

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

Howard Chu's avatar
Howard Chu committed
903
904
905
906
907
908
909
	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 );

910
911
	nkeys = 0;
	for ( i = 0; !BER_BVISNULL( &values[i] ); i++ ) {
Kurt Zeilenga's avatar
Kurt Zeilenga committed
912
913
914
		ber_len_t j,max;

		if( ( flags & SLAP_INDEX_SUBSTR_ANY ) &&
915
			( values[i].bv_len >= index_substr_any_len ) )
Kurt Zeilenga's avatar
Kurt Zeilenga committed
916
		{
917
			max = values[i].bv_len - (index_substr_any_len - 1);
Kurt Zeilenga's avatar
Kurt Zeilenga committed
918
919

			for( j=0; j<max; j++ ) {
Howard Chu's avatar
Howard Chu committed
920
921
922
				hashIter( &HCany, HASHdigest,
					(unsigned char *)&values[i].bv_val[j],
					index_substr_any_len );
Howard Chu's avatar
Howard Chu committed
923
				ber_dupbv_x( &keys[nkeys++], &digest, ctx );
Kurt Zeilenga's avatar
Kurt Zeilenga committed
924
925
926
			}
		}

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

930
931
		max = index_substr_if_maxlen < values[i].bv_len
			? index_substr_if_maxlen : values[i].bv_len;
932

933
		for( j=index_substr_if_minlen; j<=max; j++ ) {
Kurt Zeilenga's avatar
Kurt Zeilenga committed
934
935

			if( flags & SLAP_INDEX_SUBSTR_INITIAL ) {
Howard Chu's avatar
Howard Chu committed
936
937
				hashIter( &HCini, HASHdigest,
					(unsigned char *)values[i].bv_val, j );
Howard Chu's avatar
Howard Chu committed
938
				ber_dupbv_x( &keys[nkeys++], &digest, ctx );
Kurt Zeilenga's avatar
Kurt Zeilenga committed
939
940
941
			}

			if( flags & SLAP_INDEX_SUBSTR_FINAL ) {
Howard Chu's avatar
Howard Chu committed
942
943
				hashIter( &HCfin, HASHdigest,
					(unsigned char *)&values[i].bv_val[values[i].bv_len-j], j );
Howard Chu's avatar
Howard Chu committed
944
				ber_dupbv_x( &keys[nkeys++], &digest, ctx );
Kurt Zeilenga's avatar
Kurt Zeilenga committed
945
946
947
948
949
950
			}

		}
	}

	if( nkeys > 0 ) {
951
		BER_BVZERO( &keys[nkeys] );
Kurt Zeilenga's avatar
Kurt Zeilenga committed
952
953
954
955
956
957
958
959
960
		*keysp = keys;
	} else {
		ch_free( keys );
		*keysp = NULL;
	}

	return LDAP_SUCCESS;
}

Quanah Gibson-Mount's avatar
Quanah Gibson-Mount committed
961
/* Substring index generation function: Assertion value -> index hash keys */
Kurt Zeilenga's avatar
Kurt Zeilenga committed
962
963
964
965
966
967
968
969
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
970
971
	BerVarray *keysp,
	void *ctx)
Kurt Zeilenga's avatar
Kurt Zeilenga committed
972
973
974
{
	SubstringsAssertion *sa;
	char pre;
Howard Chu's avatar
Howard Chu committed
975
	ber_len_t nkeys = 0;
Kurt Zeilenga's avatar
Kurt Zeilenga committed
976
977
	size_t slen, mlen, klen;
	BerVarray keys;
Kurt Zeilenga's avatar
cleanup    
Kurt Zeilenga committed
978
979
	HASH_CONTEXT HASHcontext;
	unsigned char HASHdigest[HASH_BYTES];
Kurt Zeilenga's avatar
Kurt Zeilenga committed
980
981
982
983
984
	struct berval *value;
	struct berval digest;

	sa = (SubstringsAssertion *) assertedValue;

985
	if( flags & SLAP_INDEX_SUBSTR_INITIAL &&
986
		!BER_BVISNULL( &sa->sa_initial ) &&
987
		sa->sa_initial.bv_len >= index_substr_if_minlen )
Kurt Zeilenga's avatar
Kurt Zeilenga committed
988
989
	{
		nkeys++;
990
		if ( sa->sa_initial.bv_len > index_substr_if_maxlen &&
991
992
			( flags & SLAP_INDEX_SUBSTR_ANY ))
		{
993
			nkeys += 1 + (sa->sa_initial.bv_len - index_substr_if_maxlen) / index_substr_any_step;
994
		}
Kurt Zeilenga's avatar
Kurt Zeilenga committed
995
996
	}

997
	if ( flags & SLAP_INDEX_SUBSTR_ANY && sa->sa_any != NULL ) {
Kurt Zeilenga's avatar
Kurt Zeilenga committed
998
		ber_len_t i;
999
		for( i=0; !BER_BVISNULL( &sa->sa_any[i] ); i++ ) {
1000
			if( sa->sa_any[i].bv_len >= index_substr_any_len ) {
1001
				/* don't bother accounting with stepping */
Kurt Zeilenga's avatar
Kurt Zeilenga committed
1002
				nkeys += sa->sa_any[i].bv_len -
1003
					( index_substr_any_len - 1 );
Kurt Zeilenga's avatar
Kurt Zeilenga committed
1004
1005
1006
1007
			}
		}
	}

1008
	if( flags & SLAP_INDEX_SUBSTR_FINAL &&
1009
		!BER_BVISNULL( &sa->sa_final ) &&
1010
		sa->sa_final.bv_len >= index_substr_if_minlen )
Kurt Zeilenga's avatar
Kurt Zeilenga committed
1011
1012
	{
		nkeys++;
1013
		if ( sa->sa_final.bv_len > index_substr_if_maxlen &&
1014
1015
			( flags & SLAP_INDEX_SUBSTR_ANY ))
		{
1016
			nkeys += 1 + (sa->sa_final.bv_len - index_substr_if_maxlen) / index_substr_any_step;
1017
		}
Kurt Zeilenga's avatar
Kurt Zeilenga committed
1018
1019
1020
1021
1022
1023
1024
	}

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

1025
	digest.bv_val = (char *)HASHdigest;
Kurt Zeilenga's avatar
Kurt Zeilenga committed
1026
1027
1028
1029
1030
	digest.bv_len = sizeof(HASHdigest);

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

1031
	keys = slap_sl_malloc( sizeof( struct berval ) * (nkeys+1), ctx );
Kurt Zeilenga's avatar
Kurt Zeilenga committed
1032
1033
	nkeys = 0;

1034
	if( flags & SLAP_INDEX_SUBSTR_INITIAL &&
1035
		!BER_BVISNULL( &sa->sa_initial ) &&
1036
		sa->sa_initial.bv_len >= index_substr_if_minlen )
Kurt Zeilenga's avatar
Kurt Zeilenga committed
1037
1038
1039
1040
	{
		pre = SLAP_INDEX_SUBSTR_INITIAL_PREFIX;
		value = &sa->sa_initial;

1041
1042
		klen = index_substr_if_maxlen < value->bv_len
			? index_substr_if_maxlen : value->bv_len;
Kurt Zeilenga's avatar
Kurt Zeilenga committed
1043

Howard Chu's avatar
Howard Chu committed
1044
1045
1046
		hashPreset( &HASHcontext, prefix, pre, syntax, mr );
		hashIter( &HASHcontext, HASHdigest,
			(unsigned char *)value->bv_val, klen );
Howard Chu's avatar
Howard Chu committed
1047
		ber_dupbv_x( &keys[nkeys++], &digest, ctx );
1048
1049
1050
1051

		/* If initial is too long and we have subany indexed, use it
		 * to match the excess...
		 */
1052
		if (value->bv_len > index_substr_if_maxlen && (flags & SLAP_INDEX_SUBSTR_ANY))
1053
1054
1055
		{
			ber_len_t j;
			pre = SLAP_INDEX_SUBSTR_PREFIX;
Howard Chu's avatar
Howard Chu committed
1056
			hashPreset( &HASHcontext, prefix, pre, syntax, mr);
1057
			for ( j=index_substr_if_maxlen-1; j <= value->bv_len - index_substr_any_len; j+=index_substr_any_step )
1058
			{
Howard Chu's avatar
Howard Chu committed
1059
1060
				hashIter( &HASHcontext, HASHdigest,
					(unsigned char *)&value->bv_val[j], index_substr_any_len );
1061
1062
1063
				ber_dupbv_x( &keys[nkeys++], &digest, ctx );
			}
		}
Kurt Zeilenga's avatar
Kurt Zeilenga committed
1064
1065
1066
1067
1068
	}

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

1071
		for( i=0; !BER_BVISNULL( &sa->sa_any[i] ); i++ ) {
1072
			if( sa->sa_any[i].bv_len < index_substr_any_len ) {
Kurt Zeilenga's avatar
Kurt Zeilenga committed
1073
1074
1075
1076
1077
				continue;
			}

			value = &sa->sa_any[i];

Howard Chu's avatar
Howard Chu committed
1078
			hashPreset( &HASHcontext, prefix, pre, syntax, mr);
Kurt Zeilenga's avatar
Kurt Zeilenga committed
1079
			for(j=0;
1080
1081
				j <= value->bv_len - index_substr_any_len;
				j += index_substr_any_step )
Kurt Zeilenga's avatar
Kurt Zeilenga committed
1082
			{
Howard Chu's avatar
Howard Chu committed
1083
1084
				hashIter( &HASHcontext, HASHdigest,
					(unsigned char *)&value->bv_val[j], klen ); 
Howard Chu's avatar
Howard Chu committed
1085
				ber_dupbv_x( &keys[nkeys++], &digest, ctx );
Kurt Zeilenga's avatar
Kurt Zeilenga committed
1086
1087
1088
1089
			}
		}
	}

1090
	if( flags & SLAP_INDEX_SUBSTR_FINAL &&
1091
		!BER_BVISNULL( &sa->sa_final ) &&
1092
		sa->sa_final.bv_len >= index_substr_if_minlen )
Kurt Zeilenga's avatar
Kurt Zeilenga committed
1093
1094
1095
1096
	{
		pre = SLAP_INDEX_SUBSTR_FINAL_PREFIX;
		value = &sa->sa_final;

1097
1098
		klen = index_substr_if_maxlen < value->bv_len
			? index_substr_if_maxlen : value->bv_len;
Kurt Zeilenga's avatar
Kurt Zeilenga committed
1099

Howard Chu's avatar
Howard Chu committed
1100
1101
1102
		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
1103
		ber_dupbv_x( &keys[nkeys++], &digest, ctx );
1104
1105
1106
1107

		/* If final is too long and we have subany indexed, use it
		 * to match the excess...
		 */
1108
		if (value->bv_len > index_substr_if_maxlen && (flags & SLAP_INDEX_SUBSTR_ANY))
1109
1110
1111
		{
			ber_len_t j;
			pre = SLAP_INDEX_SUBSTR_PREFIX;
Howard Chu's avatar
Howard Chu committed
1112
			hashPreset( &HASHcontext, prefix, pre, syntax, mr);
1113
			for ( j=0; j <= value->bv_len - index_substr_if_maxlen; j+=index_substr_any_step )
1114
			{
Howard Chu's avatar
Howard Chu committed
1115
1116
				hashIter( &HASHcontext, HASHdigest,
					(unsigned char *)&value->bv_val[j], index_substr_any_len );
1117
1118
1119
				ber_dupbv_x( &keys[nkeys++], &digest, ctx );
			}
		}
Kurt Zeilenga's avatar
Kurt Zeilenga committed
1120
1121
1122
	}

	if( nkeys > 0 ) {
1123
		BER_BVZERO( &keys[nkeys] );
Kurt Zeilenga's avatar
Kurt Zeilenga committed
1124
1125
1126
1127
1128
1129
1130
1131
1132
1133
1134
1135
1136
1137
1138
1139
1140
1141
1142
1143
1144
1145
1146
		*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
1147
	/* RFC 4517 Section 3.3.2 Bit String:
1148
1149
	 *	BitString    = SQUOTE *binary-digit SQUOTE "B"
	 *	binary-digit = "0" / "1"
Kurt Zeilenga's avatar
Kurt Zeilenga committed
1150
1151
1152
1153
1154
	 *
	 * where SQUOTE [RFC4512] is
	 *	SQUOTE  = %x27 ; single quote ("'")
	 *
	 * Example: '0101111101'B
Kurt Zeilenga's avatar
Kurt Zeilenga committed
1155
1156
1157
	 */
	
	if( in->bv_val[0] != '\'' ||
1158
1159
		in->bv_val[in->bv_len - 2] != '\'' ||
		in->bv_val[in->bv_len - 1] != 'B' )
Kurt Zeilenga's avatar
Kurt Zeilenga committed
1160
1161
1162
1163
	{
		return LDAP_INVALID_SYNTAX;
	}

1164
	for( i = in->bv_len - 3; i > 0; i-- ) {
Kurt Zeilenga's avatar
Kurt Zeilenga committed
1165
1166
1167
1168
1169
1170
1171
1172
		if( in->bv_val[i] != '0' && in->bv_val[i] != '1' ) {
			return LDAP_INVALID_SYNTAX;
		}
	}

	return LDAP_SUCCESS;
}

1173
/*
Kurt Zeilenga's avatar
Kurt Zeilenga committed
1174
 * Syntaxes from RFC 4517
1175
1176
1177
1178
1179
1180
1181
1182
1183
1184
1185
1186
1187
1188
1189
1190
1191
1192
1193
1194
1195
1196
1197
1198
1199
1200
1201
1202
1203
1204
1205
1206
1207
1208
1209
1210
1211
1212
1213
1214
1215
1216
1217
1218
1219
1220
1221
1222
1223
1224
1225
1226
1227
1228
1229
1230
1231
 *

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