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 ldap_matchingrule_free((LDAPMatchingRule *)m);
97 struct mindexrec *mir;
100 LDAP_SLIST_NEXT( smr, smr_next ) = NULL;
101 LDAP_SLIST_INSERT_HEAD(&mr_list, smr, smr_next);
103 if ( smr->smr_oid ) {
104 mir = (struct mindexrec *)
105 ch_calloc( 1, sizeof(struct mindexrec) );
106 mir->mir_name.bv_val = smr->smr_oid;
107 mir->mir_name.bv_len = strlen( smr->smr_oid );
109 if ( avl_insert( &mr_index, (caddr_t) mir,
110 mr_index_cmp, avl_dup_error ) ) {
113 return SLAP_SCHERR_MR_DUP;
115 /* FIX: temporal consistency check */
116 mr_bvfind(&mir->mir_name);
118 if ( (names = smr->smr_names) ) {
120 mir = (struct mindexrec *)
121 ch_calloc( 1, sizeof(struct mindexrec) );
122 mir->mir_name.bv_val = *names;
123 mir->mir_name.bv_len = strlen( *names );
125 if ( avl_insert( &mr_index, (caddr_t) mir,
126 mr_index_cmp, avl_dup_error ) ) {
129 return SLAP_SCHERR_MR_DUP;
131 /* FIX: temporal consistency check */
132 mr_bvfind(&mir->mir_name);
141 LDAPMatchingRule *mr,
142 slap_mrule_defs_rec *def,
149 Syntax **compat_syn = NULL;
152 if( def->mrd_compat_syntaxes ) {
154 for( i=0; def->mrd_compat_syntaxes[i]; i++ ) {
158 compat_syn = ch_malloc( sizeof(Syntax *) * (i+1) );
160 for( i=0; def->mrd_compat_syntaxes[i]; i++ ) {
161 compat_syn[i] = syn_find( def->mrd_compat_syntaxes[i] );
162 if( compat_syn[i] == NULL ) {
163 return SLAP_SCHERR_SYN_NOT_FOUND;
167 compat_syn[i] = NULL;
170 smr = (MatchingRule *) ch_calloc( 1, sizeof(MatchingRule) );
171 AC_MEMCPY( &smr->smr_mrule, mr, sizeof(LDAPMatchingRule));
174 * note: smr_bvoid uses the same memory of smr_mrule.mr_oid;
175 * smr_oidlen is #defined as smr_bvoid.bv_len
177 smr->smr_bvoid.bv_val = smr->smr_mrule.mr_oid;
178 smr->smr_oidlen = strlen( mr->mr_oid );
179 smr->smr_usage = def->mrd_usage;
180 smr->smr_compat_syntaxes = compat_syn;
181 smr->smr_normalize = def->mrd_normalize;
182 smr->smr_match = def->mrd_match;
184 /* disable indexing for now */
186 smr->smr_convert = def->mrd_convert;
187 smr->smr_indexer = def->mrd_indexer;
188 smr->smr_filter = def->mrd_filter;
190 smr->smr_associated = amr;
192 if ( smr->smr_syntax_oid ) {
193 if ( (syn = syn_find(smr->smr_syntax_oid)) ) {
194 smr->smr_syntax = syn;
196 *err = smr->smr_syntax_oid;
197 return SLAP_SCHERR_SYN_NOT_FOUND;
201 return SLAP_SCHERR_MR_INCOMPLETE;
203 code = mr_insert(smr,err);
208 register_matching_rule(
209 slap_mrule_defs_rec *def )
211 LDAPMatchingRule *mr;
212 MatchingRule *amr = NULL;
216 if( def->mrd_usage == SLAP_MR_NONE &&
217 def->mrd_compat_syntaxes == NULL )
220 LDAP_LOG( OPERATION, ERR,
221 "register_matching_rule: %s not usable\n", def->mrd_desc, 0, 0 );
223 Debug( LDAP_DEBUG_ANY, "register_matching_rule: not usable %s\n",
224 def->mrd_desc, 0, 0 );
230 if( def->mrd_associated != NULL ) {
231 amr = mr_find( def->mrd_associated );
238 LDAP_LOG( OPERATION, ERR,
239 "register_matching_rule: could not locate associated "
240 "matching rule %s for %s\n",
241 def->mrd_associated, def->mrd_desc, 0 );
243 Debug( LDAP_DEBUG_ANY, "register_matching_rule: could not locate "
244 "associated matching rule %s for %s\n",
245 def->mrd_associated, def->mrd_desc, 0 );
253 mr = ldap_str2matchingrule( def->mrd_desc, &code, &err,
254 LDAP_SCHEMA_ALLOW_ALL );
257 LDAP_LOG( OPERATION, ERR,
258 "register_matching_rule: %s before %s in %s.\n",
259 ldap_scherr2str(code), err, def->mrd_desc );
261 Debug( LDAP_DEBUG_ANY,
262 "Error in register_matching_rule: %s before %s in %s\n",
263 ldap_scherr2str(code), err, def->mrd_desc );
269 code = mr_add( mr, def, amr, &err );
275 LDAP_LOG( OPERATION, ERR,
276 "register_matching_rule: %s for %s in %s.\n",
277 scherr2str(code), err, def->mrd_desc );
279 Debug( LDAP_DEBUG_ANY,
280 "Error in register_matching_rule: %s for %s in %s\n",
281 scherr2str(code), err, def->mrd_desc );
295 while( !LDAP_SLIST_EMPTY(&mru_list) ) {
296 m = LDAP_SLIST_FIRST(&mru_list);
297 LDAP_SLIST_REMOVE_HEAD(&mru_list, smru_next);
299 if ( m->smru_str.bv_val ) {
300 ch_free( m->smru_str.bv_val );
302 /* memory borrowed from m->smru_mr */
304 m->smru_names = NULL;
307 /* free what's left (basically
308 * smru_mruleuse.mru_applies_oids) */
309 ldap_matchingruleuse_free((LDAPMatchingRuleUse *)m);
314 matching_rule_use_init( void )
317 MatchingRuleUse **mru_ptr = &LDAP_SLIST_FIRST(&mru_list);
320 LDAP_LOG( OPERATION, INFO, "matching_rule_use_init\n", 0, 0, 0 );
322 Debug( LDAP_DEBUG_TRACE, "matching_rule_use_init\n", 0, 0, 0 );
325 LDAP_SLIST_FOREACH( mr, &mr_list, smr_next ) {
327 MatchingRuleUse mru_storage, *mru = &mru_storage;
329 char **applies_oids = NULL;
333 /* hide rules marked as HIDE */
334 if ( mr->smr_usage & SLAP_MR_HIDE ) {
338 /* hide rules not marked as designed for extensibility */
339 /* MR_EXT means can be used any attribute type whose
340 * syntax is same as the assertion syntax.
341 * Another mechanism is needed where rule can be used
342 * with attribute of other syntaxes.
343 * Framework doesn't support this (yet).
346 if (!( ( mr->smr_usage & SLAP_MR_EXT )
347 || mr->smr_compat_syntaxes ) )
352 memset( mru, 0, sizeof( MatchingRuleUse ) );
355 * Note: we're using the same values of the corresponding
356 * MatchingRule structure; maybe we'd copy them ...
359 mru->smru_obsolete = mr->smr_obsolete;
360 mru->smru_applies_oids = NULL;
361 LDAP_SLIST_NEXT(mru, smru_next) = NULL;
362 mru->smru_oid = mr->smr_oid;
363 mru->smru_names = mr->smr_names;
364 mru->smru_desc = mr->smr_desc;
367 LDAP_LOG( OPERATION, INFO, " %s (%s): ",
369 mru->smru_names ? mru->smru_names[ 0 ] : "", 0 );
371 Debug( LDAP_DEBUG_TRACE, " %s (%s): ",
373 mru->smru_names ? mru->smru_names[ 0 ] : "", 0 );
377 for ( at_start( &at ); at; at_next( &at ) ) {
378 if( at->sat_flags & SLAP_AT_HIDE ) continue;
380 if( mr_usable_with_at( mr, at )) {
381 ldap_charray_add( &applies_oids, at->sat_cname.bv_val );
386 * Note: the matchingRules that are not used
387 * by any attributeType are not listed as
390 if ( applies_oids != NULL ) {
391 mru->smru_applies_oids = applies_oids;
394 char *str = ldap_matchingruleuse2str( &mru->smru_mruleuse );
395 LDAP_LOG( OPERATION, INFO, "matchingRuleUse: %s\n", str, 0, 0 );
400 char *str = ldap_matchingruleuse2str( &mru->smru_mruleuse );
401 Debug( LDAP_DEBUG_TRACE, "matchingRuleUse: %s\n", str, 0, 0 );
406 mru = (MatchingRuleUse *)ber_memalloc( sizeof( MatchingRuleUse ) );
407 /* call-forward from MatchingRule to MatchingRuleUse */
409 /* copy static data to newly allocated struct */
411 /* append the struct pointer to the end of the list */
413 /* update the list head pointer */
414 mru_ptr = &LDAP_SLIST_NEXT(mru,smru_next);
421 int mr_usable_with_at(
425 if( mr->smr_usage & SLAP_MR_EXT && (
426 mr->smr_syntax == at->sat_syntax ||
427 mr == at->sat_equality || mr == at->sat_approx ) )
432 if ( mr->smr_compat_syntaxes ) {
434 for( i=0; mr->smr_compat_syntaxes[i]; i++ ) {
435 if( at->sat_syntax == mr->smr_compat_syntaxes[i] ) {
443 int mr_schema_info( Entry *e )
445 AttributeDescription *ad_matchingRules = slap_schema.si_ad_matchingRules;
451 LDAP_SLIST_FOREACH(mr, &mr_list, smr_next ) {
452 if ( mr->smr_usage & SLAP_MR_HIDE ) {
453 /* skip hidden rules */
457 if ( ! mr->smr_match ) {
458 /* skip rules without matching functions */
462 if ( mr->smr_str.bv_val == NULL ) {
463 if ( ldap_matchingrule2bv( &mr->smr_mrule, &mr->smr_str ) == NULL ) {
468 Debug( LDAP_DEBUG_TRACE, "Merging mr [%lu] %s\n",
469 mr->smr_str.bv_len, mr->smr_str.bv_val, 0 );
472 nval.bv_val = mr->smr_oid;
473 nval.bv_len = strlen(mr->smr_oid);
474 if( attr_merge_one( e, ad_matchingRules, &mr->smr_str, &nval ) )
476 if( attr_merge_one( e, ad_matchingRules, &mr->smr_str ) )
485 int mru_schema_info( Entry *e )
487 AttributeDescription *ad_matchingRuleUse
488 = slap_schema.si_ad_matchingRuleUse;
489 MatchingRuleUse *mru;
494 LDAP_SLIST_FOREACH( mru, &mru_list, smru_next ) {
496 assert( !( mru->smru_usage & SLAP_MR_HIDE ) );
498 if ( mru->smru_str.bv_val == NULL ) {
499 if ( ldap_matchingruleuse2bv( &mru->smru_mruleuse, &mru->smru_str )
506 Debug( LDAP_DEBUG_TRACE, "Merging mru [%lu] %s\n",
507 mru->smru_str.bv_len, mru->smru_str.bv_val, 0 );
510 nval.bv_val = mru->smru_oid;
511 nval.bv_len = strlen(mru->smru_oid);
512 if( attr_merge_one( e, ad_matchingRuleUse, &mru->smru_str, &nval ) )
514 if( attr_merge_one( e, ad_matchingRuleUse, &mru->smru_str ) )