1 /* mr.c - routines to manage matching rule definitions */
4 * Copyright 1998-2003 The OpenLDAP Foundation, All Rights Reserved.
5 * COPYING RESTRICTIONS APPLY, see COPYRIGHT file
13 #include <ac/string.h>
14 #include <ac/socket.h>
20 struct berval mir_name;
24 static Avlnode *mr_index = NULL;
25 static LDAP_SLIST_HEAD(MRList, slap_matching_rule) mr_list
26 = LDAP_SLIST_HEAD_INITIALIZER(&mr_list);
27 static LDAP_SLIST_HEAD(MRUList, slap_matching_rule_use) mru_list
28 = LDAP_SLIST_HEAD_INITIALIZER(&mru_list);
36 const struct mindexrec *mir1 = v_mir1;
37 const struct mindexrec *mir2 = v_mir2;
38 int i = mir1->mir_name.bv_len - mir2->mir_name.bv_len;
40 return (strcmp( mir1->mir_name.bv_val, mir2->mir_name.bv_val ));
49 const struct berval *name = v_name;
50 const struct mindexrec *mir = v_mir;
51 int i = name->bv_len - mir->mir_name.bv_len;
53 return (strncmp( name->bv_val, mir->mir_name.bv_val, name->bv_len ));
57 mr_find( const char *mrname )
61 bv.bv_val = (char *)mrname;
62 bv.bv_len = strlen( mrname );
63 return mr_bvfind( &bv );
67 mr_bvfind( struct berval *mrname )
69 struct mindexrec *mir = NULL;
71 if ( (mir = avl_find( mr_index, mrname, mr_index_name_cmp )) != NULL ) {
72 return( mir->mir_mr );
82 avl_free(mr_index, ldap_memfree);
83 while( !LDAP_SLIST_EMPTY(&mr_list) ) {
84 m = LDAP_SLIST_FIRST(&mr_list);
85 LDAP_SLIST_REMOVE_HEAD(&mr_list, smr_next);
86 ch_free( m->smr_str.bv_val );
87 ch_free( m->smr_compat_syntaxes );
88 ldap_matchingrule_free((LDAPMatchingRule *)m);
98 struct mindexrec *mir;
101 LDAP_SLIST_NEXT( smr, smr_next ) = NULL;
102 LDAP_SLIST_INSERT_HEAD(&mr_list, smr, smr_next);
104 if ( smr->smr_oid ) {
105 mir = (struct mindexrec *)
106 ch_calloc( 1, sizeof(struct mindexrec) );
107 mir->mir_name.bv_val = smr->smr_oid;
108 mir->mir_name.bv_len = strlen( smr->smr_oid );
110 if ( avl_insert( &mr_index, (caddr_t) mir,
111 mr_index_cmp, avl_dup_error ) ) {
114 return SLAP_SCHERR_MR_DUP;
116 /* FIX: temporal consistency check */
117 mr_bvfind(&mir->mir_name);
119 if ( (names = smr->smr_names) ) {
121 mir = (struct mindexrec *)
122 ch_calloc( 1, sizeof(struct mindexrec) );
123 mir->mir_name.bv_val = *names;
124 mir->mir_name.bv_len = strlen( *names );
126 if ( avl_insert( &mr_index, (caddr_t) mir,
127 mr_index_cmp, avl_dup_error ) ) {
130 return SLAP_SCHERR_MR_DUP;
132 /* FIX: temporal consistency check */
133 mr_bvfind(&mir->mir_name);
142 LDAPMatchingRule *mr,
143 slap_mrule_defs_rec *def,
150 Syntax **compat_syn = NULL;
153 if( def->mrd_compat_syntaxes ) {
155 for( i=0; def->mrd_compat_syntaxes[i]; i++ ) {
159 compat_syn = ch_malloc( sizeof(Syntax *) * (i+1) );
161 for( i=0; def->mrd_compat_syntaxes[i]; i++ ) {
162 compat_syn[i] = syn_find( def->mrd_compat_syntaxes[i] );
163 if( compat_syn[i] == NULL ) {
164 return SLAP_SCHERR_SYN_NOT_FOUND;
168 compat_syn[i] = NULL;
171 smr = (MatchingRule *) ch_calloc( 1, sizeof(MatchingRule) );
172 AC_MEMCPY( &smr->smr_mrule, mr, sizeof(LDAPMatchingRule));
175 * note: smr_bvoid uses the same memory of smr_mrule.mr_oid;
176 * smr_oidlen is #defined as smr_bvoid.bv_len
178 smr->smr_bvoid.bv_val = smr->smr_mrule.mr_oid;
179 smr->smr_oidlen = strlen( mr->mr_oid );
180 smr->smr_usage = def->mrd_usage;
181 smr->smr_compat_syntaxes = compat_syn;
182 smr->smr_normalize = def->mrd_normalize;
183 smr->smr_match = def->mrd_match;
184 smr->smr_indexer = def->mrd_indexer;
185 smr->smr_filter = def->mrd_filter;
186 smr->smr_associated = amr;
188 if ( smr->smr_syntax_oid ) {
189 if ( (syn = syn_find(smr->smr_syntax_oid)) ) {
190 smr->smr_syntax = syn;
192 *err = smr->smr_syntax_oid;
193 return SLAP_SCHERR_SYN_NOT_FOUND;
197 return SLAP_SCHERR_MR_INCOMPLETE;
199 code = mr_insert(smr,err);
204 register_matching_rule(
205 slap_mrule_defs_rec *def )
207 LDAPMatchingRule *mr;
208 MatchingRule *amr = NULL;
212 if( def->mrd_usage == SLAP_MR_NONE &&
213 def->mrd_compat_syntaxes == NULL )
216 LDAP_LOG( OPERATION, ERR,
217 "register_matching_rule: %s not usable\n", def->mrd_desc, 0, 0 );
219 Debug( LDAP_DEBUG_ANY, "register_matching_rule: not usable %s\n",
220 def->mrd_desc, 0, 0 );
226 if( def->mrd_associated != NULL ) {
227 amr = mr_find( def->mrd_associated );
231 LDAP_LOG( OPERATION, ERR,
232 "register_matching_rule: could not locate associated "
233 "matching rule %s for %s\n",
234 def->mrd_associated, def->mrd_desc, 0 );
236 Debug( LDAP_DEBUG_ANY, "register_matching_rule: could not locate "
237 "associated matching rule %s for %s\n",
238 def->mrd_associated, def->mrd_desc, 0 );
244 if (( def->mrd_usage & SLAP_MR_EQUALITY ) &&
245 (( def->mrd_usage & SLAP_MR_SUBTYPE_MASK ) == SLAP_MR_NONE ))
247 if (( def->mrd_usage & SLAP_MR_EQUALITY ) &&
248 (( def->mrd_usage & SLAP_MR_SUBTYPE_MASK ) != SLAP_MR_NONE ))
251 LDAP_LOG( OPERATION, ERR,
252 "register_matching_rule: inappropriate (approx) association "
254 def->mrd_associated, def->mrd_desc, 0 );
256 Debug( LDAP_DEBUG_ANY,
257 "register_matching_rule: inappropriate (approx) association "
259 def->mrd_associated, def->mrd_desc, 0 );
264 } else if (!( amr->smr_usage & SLAP_MR_EQUALITY )) {
266 LDAP_LOG( OPERATION, ERR,
267 "register_matching_rule: inappropriate (equalilty) association "
269 def->mrd_associated, def->mrd_desc, 0 );
271 Debug( LDAP_DEBUG_ANY,
272 "register_matching_rule: inappropriate (equalilty) association "
274 def->mrd_associated, def->mrd_desc, 0 );
280 mr = ldap_str2matchingrule( def->mrd_desc, &code, &err,
281 LDAP_SCHEMA_ALLOW_ALL );
284 LDAP_LOG( OPERATION, ERR,
285 "register_matching_rule: %s before %s in %s.\n",
286 ldap_scherr2str(code), err, def->mrd_desc );
288 Debug( LDAP_DEBUG_ANY,
289 "Error in register_matching_rule: %s before %s in %s\n",
290 ldap_scherr2str(code), err, def->mrd_desc );
297 code = mr_add( mr, def, amr, &err );
303 LDAP_LOG( OPERATION, ERR,
304 "register_matching_rule: %s for %s in %s.\n",
305 scherr2str(code), err, def->mrd_desc );
307 Debug( LDAP_DEBUG_ANY,
308 "Error in register_matching_rule: %s for %s in %s\n",
309 scherr2str(code), err, def->mrd_desc );
323 while( !LDAP_SLIST_EMPTY(&mru_list) ) {
324 m = LDAP_SLIST_FIRST(&mru_list);
325 LDAP_SLIST_REMOVE_HEAD(&mru_list, smru_next);
327 if ( m->smru_str.bv_val ) {
328 ch_free( m->smru_str.bv_val );
329 m->smru_str.bv_val = NULL;
331 /* memory borrowed from m->smru_mr */
333 m->smru_names = NULL;
336 /* free what's left (basically smru_mruleuse.mru_applies_oids) */
337 ldap_matchingruleuse_free((LDAPMatchingRuleUse *)m);
342 matching_rule_use_init( void )
345 MatchingRuleUse **mru_ptr = &LDAP_SLIST_FIRST(&mru_list);
348 LDAP_LOG( OPERATION, INFO, "matching_rule_use_init\n", 0, 0, 0 );
350 Debug( LDAP_DEBUG_TRACE, "matching_rule_use_init\n", 0, 0, 0 );
353 LDAP_SLIST_FOREACH( mr, &mr_list, smr_next ) {
355 MatchingRuleUse mru_storage, *mru = &mru_storage;
357 char **applies_oids = NULL;
361 /* hide rules marked as HIDE */
362 if ( mr->smr_usage & SLAP_MR_HIDE ) {
366 /* hide rules not marked as designed for extensibility */
367 /* MR_EXT means can be used any attribute type whose
368 * syntax is same as the assertion syntax.
369 * Another mechanism is needed where rule can be used
370 * with attribute of other syntaxes.
371 * Framework doesn't support this (yet).
374 if (!( ( mr->smr_usage & SLAP_MR_EXT )
375 || mr->smr_compat_syntaxes ) )
380 memset( mru, 0, sizeof( MatchingRuleUse ) );
383 * Note: we're using the same values of the corresponding
384 * MatchingRule structure; maybe we'd copy them ...
387 mru->smru_obsolete = mr->smr_obsolete;
388 mru->smru_applies_oids = NULL;
389 LDAP_SLIST_NEXT(mru, smru_next) = NULL;
390 mru->smru_oid = mr->smr_oid;
391 mru->smru_names = mr->smr_names;
392 mru->smru_desc = mr->smr_desc;
395 LDAP_LOG( OPERATION, INFO, " %s (%s): ",
397 mru->smru_names ? mru->smru_names[ 0 ] : "", 0 );
399 Debug( LDAP_DEBUG_TRACE, " %s (%s): ",
401 mru->smru_names ? mru->smru_names[ 0 ] : "", 0 );
405 for ( at_start( &at ); at; at_next( &at ) ) {
406 if( at->sat_flags & SLAP_AT_HIDE ) continue;
408 if( mr_usable_with_at( mr, at )) {
409 ldap_charray_add( &applies_oids, at->sat_cname.bv_val );
414 * Note: the matchingRules that are not used
415 * by any attributeType are not listed as
418 if ( applies_oids != NULL ) {
419 mru->smru_applies_oids = applies_oids;
422 char *str = ldap_matchingruleuse2str( &mru->smru_mruleuse );
423 LDAP_LOG( OPERATION, INFO, "matchingRuleUse: %s\n", str, 0, 0 );
428 char *str = ldap_matchingruleuse2str( &mru->smru_mruleuse );
429 Debug( LDAP_DEBUG_TRACE, "matchingRuleUse: %s\n", str, 0, 0 );
434 mru = (MatchingRuleUse *)ber_memalloc( sizeof( MatchingRuleUse ) );
435 /* call-forward from MatchingRule to MatchingRuleUse */
437 /* copy static data to newly allocated struct */
439 /* append the struct pointer to the end of the list */
441 /* update the list head pointer */
442 mru_ptr = &LDAP_SLIST_NEXT(mru,smru_next);
449 int mr_usable_with_at(
453 if( mr->smr_usage & SLAP_MR_EXT && (
454 mr->smr_syntax == at->sat_syntax ||
455 mr == at->sat_equality || mr == at->sat_approx ) )
460 if ( mr->smr_compat_syntaxes ) {
462 for( i=0; mr->smr_compat_syntaxes[i]; i++ ) {
463 if( at->sat_syntax == mr->smr_compat_syntaxes[i] ) {
471 int mr_schema_info( Entry *e )
473 AttributeDescription *ad_matchingRules = slap_schema.si_ad_matchingRules;
477 LDAP_SLIST_FOREACH(mr, &mr_list, smr_next ) {
478 if ( mr->smr_usage & SLAP_MR_HIDE ) {
479 /* skip hidden rules */
483 if ( ! mr->smr_match ) {
484 /* skip rules without matching functions */
488 if ( mr->smr_str.bv_val == NULL ) {
489 if ( ldap_matchingrule2bv( &mr->smr_mrule, &mr->smr_str ) == NULL ) {
494 Debug( LDAP_DEBUG_TRACE, "Merging mr [%lu] %s\n",
495 mr->smr_str.bv_len, mr->smr_str.bv_val, 0 );
498 nval.bv_val = mr->smr_oid;
499 nval.bv_len = strlen(mr->smr_oid);
500 if( attr_merge_one( e, ad_matchingRules, &mr->smr_str, &nval ) ) {
507 int mru_schema_info( Entry *e )
509 AttributeDescription *ad_matchingRuleUse
510 = slap_schema.si_ad_matchingRuleUse;
511 MatchingRuleUse *mru;
514 LDAP_SLIST_FOREACH( mru, &mru_list, smru_next ) {
515 assert( !( mru->smru_usage & SLAP_MR_HIDE ) );
517 if ( mru->smru_str.bv_val == NULL ) {
518 if ( ldap_matchingruleuse2bv( &mru->smru_mruleuse, &mru->smru_str )
525 Debug( LDAP_DEBUG_TRACE, "Merging mru [%lu] %s\n",
526 mru->smru_str.bv_len, mru->smru_str.bv_val, 0 );
529 nval.bv_val = mru->smru_oid;
530 nval.bv_len = strlen(mru->smru_oid);
531 if( attr_merge_one( e, ad_matchingRuleUse, &mru->smru_str, &nval ) ) {