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
285
286
287
288
289
290
291
292
293
294
295
296
297
298
299
300
301
302
303
304
305
306
307
308
309
310
311
312
313
314
315
316
317
318
319
320
321
322
323
324
325
326
327
328
329
330
331
332
333
334
335
336
337
338
339
340
341
342
343
344
345
346
347
348
	BerElementBuffer berbuf;
	BerElement *ber = (BerElement *)&berbuf;
	ber_tag_t tag;
	ber_len_t len;
	ber_int_t version = SLAP_X509_V1;

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

/* X.509 certificate list validation */
Quanah Gibson-Mount's avatar
Quanah Gibson-Mount committed
349
350
351
static int
checkTime( struct berval *in, struct berval *out );

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

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

464
465
466
	return LDAP_SUCCESS;
}

Quanah Gibson-Mount's avatar
Quanah Gibson-Mount committed
467
468
469
470
471
472
473
474
475
476
477
478
479
480
481
482
483
484
485
486
487
488
489
490
491
492
493
494
495
496
497
498
499
500
501
502
503
504
505
506
507
508
509
510
511
512
513
514
/* 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 );

515
	tag = ber_peek_tag( ber, &len );
Quanah Gibson-Mount's avatar
Quanah Gibson-Mount committed
516
517
518
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

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

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

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

	return LDAP_SUCCESS;
}

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

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

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

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

594
595
596
597
	*matchp = match;
	return LDAP_SUCCESS;
}

Quanah Gibson-Mount's avatar
Quanah Gibson-Mount committed
598
/* Initialize HASHcontext from match type and schema info */
Howard Chu's avatar
Howard Chu committed
599
600
static void
hashPreset(
601
602
603
604
	HASH_CONTEXT *HASHcontext,
	struct berval *prefix,
	char pre,
	Syntax *syntax,
Howard Chu's avatar
Howard Chu committed
605
	MatchingRule *mr)
606
607
608
609
610
611
612
613
614
615
616
617
{
	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
618
/* Set HASHdigest from HASHcontext and value:len */
Howard Chu's avatar
Howard Chu committed
619
620
621
622
623
624
625
626
627
628
629
630
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
631
/* Index generation function: Attribute values -> index hash keys */
632
int octetStringIndexer(
633
634
	slap_mask_t use,
	slap_mask_t flags,
635
636
637
	Syntax *syntax,
	MatchingRule *mr,
	struct berval *prefix,
638
	BerVarray values,
Howard Chu's avatar
Howard Chu committed
639
640
	BerVarray *keysp,
	void *ctx )
641
642
643
{
	int i;
	size_t slen, mlen;
644
	BerVarray keys;
Kurt Zeilenga's avatar
cleanup    
Kurt Zeilenga committed
645
646
	HASH_CONTEXT HASHcontext;
	unsigned char HASHdigest[HASH_BYTES];
647
	struct berval digest;
648
	digest.bv_val = (char *)HASHdigest;
649
	digest.bv_len = sizeof(HASHdigest);
650

651
	for( i=0; !BER_BVISNULL( &values[i] ); i++ ) {
652
653
654
		/* just count them */
	}

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

658
	keys = slap_sl_malloc( sizeof( struct berval ) * (i+1), ctx );
659

660
661
	slen = syntax->ssyn_oidlen;
	mlen = mr->smr_oidlen;
662

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

670
	BER_BVZERO( &keys[i] );
671
672
673
674
675
676

	*keysp = keys;

	return LDAP_SUCCESS;
}

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

697
698
	slen = syntax->ssyn_oidlen;
	mlen = mr->smr_oidlen;
699

700
	keys = slap_sl_malloc( sizeof( struct berval ) * 2, ctx );
701

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

Howard Chu's avatar
Howard Chu committed
706
	ber_dupbv_x( keys, &digest, ctx );
707
	BER_BVZERO( &keys[1] );
708
709
710
711
712

	*keysp = keys;

	return LDAP_SUCCESS;
}
713

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

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

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

Kurt Zeilenga's avatar
Kurt Zeilenga committed
748
749
		match = memcmp( sub->sa_initial.bv_val, left.bv_val,
			sub->sa_initial.bv_len );
750

751
		if ( match != 0 ) {
Kurt Zeilenga's avatar
Kurt Zeilenga committed
752
753
			goto done;
		}
754

Kurt Zeilenga's avatar
Kurt Zeilenga committed
755
756
757
758
		left.bv_val += sub->sa_initial.bv_len;
		left.bv_len -= sub->sa_initial.bv_len;
		inlen -= sub->sa_initial.bv_len;
	}
759

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

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

770
		if ( match != 0 ) {
Kurt Zeilenga's avatar
Kurt Zeilenga committed
771
			goto done;
772
773
		}

Kurt Zeilenga's avatar
Kurt Zeilenga committed
774
775
		left.bv_len -= sub->sa_final.bv_len;
		inlen -= sub->sa_final.bv_len;
776
777
	}

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

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

790
			if ( BER_BVISEMPTY( &sub->sa_any[i] ) ) {
Kurt Zeilenga's avatar
Kurt Zeilenga committed
791
792
				continue;
			}
793

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

Kurt Zeilenga's avatar
Kurt Zeilenga committed
796
797
798
			if( p == NULL ) {
				match = 1;
				goto done;
799
800
			}

Kurt Zeilenga's avatar
Kurt Zeilenga committed
801
			idx = p - left.bv_val;
802

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

Kurt Zeilenga's avatar
Kurt Zeilenga committed
808
809
			left.bv_val = p;
			left.bv_len -= idx;
810

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

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

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

Kurt Zeilenga's avatar
Kurt Zeilenga committed
827
828
829
			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;
830
831
832
		}
	}

Kurt Zeilenga's avatar
Kurt Zeilenga committed
833
834
done:
	*matchp = match;
835
836
837
	return LDAP_SUCCESS;
}

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

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

860
	nkeys = 0;
Kurt Zeilenga's avatar
Kurt Zeilenga committed
861

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

		if( flags & SLAP_INDEX_SUBSTR_ANY ) {
874
875
			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
876
877
878
879
			}
		}

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

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

895
	keys = slap_sl_malloc( sizeof( struct berval ) * (nkeys+1), ctx );
Kurt Zeilenga's avatar
Kurt Zeilenga committed
896
897
898
899

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

Howard Chu's avatar
Howard Chu committed
900
901
902
903
904
905
906
	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 );

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

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

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

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

927
928
		max = index_substr_if_maxlen < values[i].bv_len
			? index_substr_if_maxlen : values[i].bv_len;
929

930
		for( j=index_substr_if_minlen; j<=max; j++ ) {
Kurt Zeilenga's avatar
Kurt Zeilenga committed
931
932

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

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

		}
	}

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

	return LDAP_SUCCESS;
}

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

	sa = (SubstringsAssertion *) assertedValue;

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

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

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

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

1022
	digest.bv_val = (char *)HASHdigest;
Kurt Zeilenga's avatar
Kurt Zeilenga committed
1023
1024
1025
1026
1027
	digest.bv_len = sizeof(HASHdigest);

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

1028
	keys = slap_sl_malloc( sizeof( struct berval ) * (nkeys+1), ctx );
Kurt Zeilenga's avatar
Kurt Zeilenga committed
1029
1030
	nkeys = 0;

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

1038
1039
		klen = index_substr_if_maxlen < value->bv_len
			? index_substr_if_maxlen : value->bv_len;
Kurt Zeilenga's avatar
Kurt Zeilenga committed
1040

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

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

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

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

			value = &sa->sa_any[i];

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

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

1094
1095
		klen = index_substr_if_maxlen < value->bv_len
			? index_substr_if_maxlen : value->bv_len;
Kurt Zeilenga's avatar
Kurt Zeilenga committed
1096

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

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

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

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

	return LDAP_SUCCESS;
}

1170
/*
Kurt Zeilenga's avatar
Kurt Zeilenga committed
1171
 * Syntaxes from RFC 4517
1172
1173
1174
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
 *

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
1229
 * RFC 4512 says:
1230
1231
1232
1233
1234
1235
1236
1237
1238