schema_init.c 168 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-2019 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
374
375
376
377
378
379
	tag = ber_skip_tag( ber, &len );	/* Sequence */
	if ( tag != LBER_SEQUENCE ) return LDAP_INVALID_SYNTAX;
	tag = ber_peek_tag( ber, &len );
	/* Optional version */
	if ( tag == LBER_INTEGER ) {
		tag = ber_get_int( ber, &version );
		assert( tag == LBER_INTEGER );
		if ( version != SLAP_X509_V2 ) return LDAP_INVALID_SYNTAX;
	}
	tag = ber_skip_tag( ber, &len );	/* Signature Algorithm */
	if ( tag != LBER_SEQUENCE ) return LDAP_INVALID_SYNTAX;
	ber_skip_data( ber, len );
Quanah Gibson-Mount's avatar
Quanah Gibson-Mount committed
380
	tag = ber_peek_tag( ber, &len );	/* Issuer DN */
381
	if ( tag != LBER_SEQUENCE ) return LDAP_INVALID_SYNTAX;
Quanah Gibson-Mount's avatar
Quanah Gibson-Mount committed
382
383
384
385
	len = ber_ptrlen( ber );
	bvdn.bv_val = in->bv_val + len;
	bvdn.bv_len = in->bv_len - len;
	tag = ber_skip_tag( ber, &len );
386
387
	ber_skip_data( ber, len );
	tag = ber_skip_tag( ber, &len );	/* thisUpdate */
388
	/* Time is a CHOICE { UTCTime, GeneralizedTime } */
389
	if ( tag != SLAP_TAG_UTCTIME && tag != SLAP_TAG_GENERALIZEDTIME ) return LDAP_INVALID_SYNTAX;
Quanah Gibson-Mount's avatar
Quanah Gibson-Mount committed
390
391
	bvtu.bv_val = (char *)ber->ber_ptr;
	bvtu.bv_len = len;
392
393
394
	ber_skip_data( ber, len );
	/* Optional nextUpdate */
	tag = ber_skip_tag( ber, &len );
395
	if ( tag == SLAP_TAG_UTCTIME || tag == SLAP_TAG_GENERALIZEDTIME ) {
396
397
398
		ber_skip_data( ber, len );
		tag = ber_skip_tag( ber, &len );
	}
399
	/* revokedCertificates - Sequence of Sequence, Optional */
400
	if ( tag == LBER_SEQUENCE ) {
401
		ber_len_t seqlen;
Quanah Gibson-Mount's avatar
Quanah Gibson-Mount committed
402
403
404
405
406
407
		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 );
408
409
			tag = ber_skip_tag( ber, &len );
		}
410
	}
411
	/* Optional Extensions - Sequence of Sequence */
412
	if ( tag == SLAP_X509_OPT_CL_CRLEXTENSIONS ) { /* ? */
413
		ber_len_t seqlen;
414
		if ( version != SLAP_X509_V2 ) return LDAP_INVALID_SYNTAX;
415
		tag = ber_peek_tag( ber, &seqlen );
416
417
418
419
420
421
422
423
424
425
426
		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
427
	if ( ber->ber_ptr == wrapper_start + wrapper_len ) wrapper_ok = 1;
428
429
	tag = ber_skip_tag( ber, &len );
	/* Must be at end now */
Quanah Gibson-Mount's avatar
Quanah Gibson-Mount committed
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
464
	/* 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;
	}

465
466
467
	return LDAP_SUCCESS;
}

Quanah Gibson-Mount's avatar
Quanah Gibson-Mount committed
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
515
/* 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 );

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

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

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

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

	return LDAP_SUCCESS;
}

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

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

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

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

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

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

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

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

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

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

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

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

	*keysp = keys;

	return LDAP_SUCCESS;
}

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

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

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

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

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

	*keysp = keys;

	return LDAP_SUCCESS;
}
714

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

		}
	}

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

	return LDAP_SUCCESS;
}

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

	sa = (SubstringsAssertion *) assertedValue;

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

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

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

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

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

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

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

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

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

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

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

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

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

			value = &sa->sa_any[i];

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

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

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

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

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

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

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

	return LDAP_SUCCESS;
}

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

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

1.4. Common ABNF Productions

  ...
      SHARP   = %x23 ; octothorpe (or sharp sign) ("#")
  ...
      SQUOTE  = %x27 ; single quote ("'")
  ...
      
 *
Quanah Gibson-Mount's avatar
Quanah Gibson-Mount committed