]> git.sur5r.net Git - openldap/blob - servers/slapd/mr.c
Happy new year!
[openldap] / servers / slapd / mr.c
1 /* mr.c - routines to manage matching rule definitions */
2 /* $OpenLDAP$ */
3 /* This work is part of OpenLDAP Software <http://www.openldap.org/>.
4  *
5  * Copyright 1998-2006 The OpenLDAP Foundation.
6  * All rights reserved.
7  *
8  * Redistribution and use in source and binary forms, with or without
9  * modification, are permitted only as authorized by the OpenLDAP
10  * Public License.
11  *
12  * A copy of this license is available in the file LICENSE in the
13  * top-level directory of the distribution or, alternatively, at
14  * <http://www.OpenLDAP.org/license.html>.
15  */
16
17 #include "portable.h"
18
19 #include <stdio.h>
20
21 #include <ac/ctype.h>
22 #include <ac/string.h>
23 #include <ac/socket.h>
24
25 #include "slap.h"
26
27 struct mindexrec {
28         struct berval   mir_name;
29         MatchingRule    *mir_mr;
30 };
31
32 static Avlnode  *mr_index = NULL;
33 static LDAP_SLIST_HEAD(MRList, slap_matching_rule) mr_list
34         = LDAP_SLIST_HEAD_INITIALIZER(&mr_list);
35 static LDAP_SLIST_HEAD(MRUList, slap_matching_rule_use) mru_list
36         = LDAP_SLIST_HEAD_INITIALIZER(&mru_list);
37
38 static int
39 mr_index_cmp(
40     const void  *v_mir1,
41     const void  *v_mir2
42 )
43 {
44         const struct mindexrec  *mir1 = v_mir1;
45         const struct mindexrec  *mir2 = v_mir2;
46         int i = mir1->mir_name.bv_len - mir2->mir_name.bv_len;
47         if (i) return i;
48         return (strcasecmp( mir1->mir_name.bv_val, mir2->mir_name.bv_val ));
49 }
50
51 static int
52 mr_index_name_cmp(
53     const void  *v_name,
54     const void  *v_mir
55 )
56 {
57         const struct berval    *name = v_name;
58         const struct mindexrec *mir  = v_mir;
59         int i = name->bv_len - mir->mir_name.bv_len;
60         if (i) return i;
61         return (strncasecmp( name->bv_val, mir->mir_name.bv_val, name->bv_len ));
62 }
63
64 MatchingRule *
65 mr_find( const char *mrname )
66 {
67         struct berval bv;
68
69         bv.bv_val = (char *)mrname;
70         bv.bv_len = strlen( mrname );
71         return mr_bvfind( &bv );
72 }
73
74 MatchingRule *
75 mr_bvfind( struct berval *mrname )
76 {
77         struct mindexrec        *mir = NULL;
78
79         if ( (mir = avl_find( mr_index, mrname, mr_index_name_cmp )) != NULL ) {
80                 return( mir->mir_mr );
81         }
82         return( NULL );
83 }
84
85 void
86 mr_destroy( void )
87 {
88         MatchingRule *m;
89
90         avl_free(mr_index, ldap_memfree);
91         while( !LDAP_SLIST_EMPTY(&mr_list) ) {
92                 m = LDAP_SLIST_FIRST(&mr_list);
93                 LDAP_SLIST_REMOVE_HEAD(&mr_list, smr_next);
94                 ch_free( m->smr_str.bv_val );
95                 ch_free( m->smr_compat_syntaxes );
96                 ldap_matchingrule_free((LDAPMatchingRule *)m);
97         }
98 }
99
100 static int
101 mr_insert(
102     MatchingRule        *smr,
103     const char          **err
104 )
105 {
106         struct mindexrec        *mir;
107         char                    **names;
108
109         LDAP_SLIST_NEXT( smr, smr_next ) = NULL;
110         LDAP_SLIST_INSERT_HEAD(&mr_list, smr, smr_next);
111
112         if ( smr->smr_oid ) {
113                 mir = (struct mindexrec *)
114                         ch_calloc( 1, sizeof(struct mindexrec) );
115                 mir->mir_name.bv_val = smr->smr_oid;
116                 mir->mir_name.bv_len = strlen( smr->smr_oid );
117                 mir->mir_mr = smr;
118                 if ( avl_insert( &mr_index, (caddr_t) mir,
119                                  mr_index_cmp, avl_dup_error ) ) {
120                         *err = smr->smr_oid;
121                         ldap_memfree(mir);
122                         return SLAP_SCHERR_MR_DUP;
123                 }
124                 /* FIX: temporal consistency check */
125                 mr_bvfind(&mir->mir_name);
126         }
127         if ( (names = smr->smr_names) ) {
128                 while ( *names ) {
129                         mir = (struct mindexrec *)
130                                 ch_calloc( 1, sizeof(struct mindexrec) );
131                         mir->mir_name.bv_val = *names;
132                         mir->mir_name.bv_len = strlen( *names );
133                         mir->mir_mr = smr;
134                         if ( avl_insert( &mr_index, (caddr_t) mir,
135                                          mr_index_cmp, avl_dup_error ) ) {
136                                 *err = *names;
137                                 ldap_memfree(mir);
138                                 return SLAP_SCHERR_MR_DUP;
139                         }
140                         /* FIX: temporal consistency check */
141                         mr_bvfind(&mir->mir_name);
142                         names++;
143                 }
144         }
145         return 0;
146 }
147
148 int
149 mr_add(
150     LDAPMatchingRule            *mr,
151     slap_mrule_defs_rec *def,
152         MatchingRule    *amr,
153     const char          **err
154 )
155 {
156         MatchingRule    *smr;
157         Syntax          *syn;
158         Syntax          **compat_syn = NULL;
159         int             code;
160
161         if( def->mrd_compat_syntaxes ) {
162                 int i;
163                 for( i=0; def->mrd_compat_syntaxes[i]; i++ ) {
164                         /* just count em */
165                 }
166
167                 compat_syn = ch_malloc( sizeof(Syntax *) * (i+1) );
168
169                 for( i=0; def->mrd_compat_syntaxes[i]; i++ ) {
170                         compat_syn[i] = syn_find( def->mrd_compat_syntaxes[i] );
171                         if( compat_syn[i] == NULL ) {
172                                 return SLAP_SCHERR_SYN_NOT_FOUND;
173                         }
174                 }
175
176                 compat_syn[i] = NULL;
177         }
178
179         smr = (MatchingRule *) ch_calloc( 1, sizeof(MatchingRule) );
180         AC_MEMCPY( &smr->smr_mrule, mr, sizeof(LDAPMatchingRule));
181
182         /*
183          * note: smr_bvoid uses the same memory of smr_mrule.mr_oid;
184          * smr_oidlen is #defined as smr_bvoid.bv_len
185          */
186         smr->smr_bvoid.bv_val = smr->smr_mrule.mr_oid;
187         smr->smr_oidlen = strlen( mr->mr_oid );
188         smr->smr_usage = def->mrd_usage;
189         smr->smr_compat_syntaxes = compat_syn;
190         smr->smr_normalize = def->mrd_normalize;
191         smr->smr_match = def->mrd_match;
192         smr->smr_indexer = def->mrd_indexer;
193         smr->smr_filter = def->mrd_filter;
194         smr->smr_associated = amr;
195
196         if ( smr->smr_syntax_oid ) {
197                 if ( (syn = syn_find(smr->smr_syntax_oid)) ) {
198                         smr->smr_syntax = syn;
199                 } else {
200                         *err = smr->smr_syntax_oid;
201                         return SLAP_SCHERR_SYN_NOT_FOUND;
202                 }
203         } else {
204                 *err = "";
205                 return SLAP_SCHERR_MR_INCOMPLETE;
206         }
207         code = mr_insert(smr,err);
208         return code;
209 }
210
211 int
212 register_matching_rule(
213         slap_mrule_defs_rec *def )
214 {
215         LDAPMatchingRule *mr;
216         MatchingRule *amr = NULL;
217         int             code;
218         const char      *err;
219
220         if( def->mrd_usage == SLAP_MR_NONE && def->mrd_compat_syntaxes == NULL ) {
221                 Debug( LDAP_DEBUG_ANY, "register_matching_rule: not usable %s\n",
222                     def->mrd_desc, 0, 0 );
223
224                 return -1;
225         }
226
227         if( def->mrd_associated != NULL ) {
228                 amr = mr_find( def->mrd_associated );
229                 if( amr == NULL ) {
230                         Debug( LDAP_DEBUG_ANY, "register_matching_rule: "
231                                 "could not locate associated matching rule %s for %s\n",
232                                 def->mrd_associated, def->mrd_desc, 0 );
233
234                         return -1;
235                 }
236
237                 if (( def->mrd_usage & SLAP_MR_EQUALITY ) &&
238                         (( def->mrd_usage & SLAP_MR_SUBTYPE_MASK ) == SLAP_MR_NONE ))
239                 {
240                         if (( def->mrd_usage & SLAP_MR_EQUALITY ) &&
241                                 (( def->mrd_usage & SLAP_MR_SUBTYPE_MASK ) != SLAP_MR_NONE ))
242                         {
243                                 Debug( LDAP_DEBUG_ANY, "register_matching_rule: "
244                                                 "inappropriate (approx) association %s for %s\n",
245                                         def->mrd_associated, def->mrd_desc, 0 );
246                                 return -1;
247                         }
248
249                 } else if (!( amr->smr_usage & SLAP_MR_EQUALITY )) {
250                                 Debug( LDAP_DEBUG_ANY, "register_matching_rule: "
251                                         "inappropriate (equalilty) association %s for %s\n",
252                                         def->mrd_associated, def->mrd_desc, 0 );
253                                 return -1;
254                 }
255         }
256
257         mr = ldap_str2matchingrule( def->mrd_desc, &code, &err,
258                 LDAP_SCHEMA_ALLOW_ALL );
259         if ( !mr ) {
260                 Debug( LDAP_DEBUG_ANY,
261                         "Error in register_matching_rule: %s before %s in %s\n",
262                     ldap_scherr2str(code), err, def->mrd_desc );
263
264                 return -1;
265         }
266
267
268         code = mr_add( mr, def, amr, &err );
269
270         ldap_memfree( mr );
271
272         if ( code ) {
273                 Debug( LDAP_DEBUG_ANY,
274                         "Error in register_matching_rule: %s for %s in %s\n",
275                     scherr2str(code), err, def->mrd_desc );
276
277                 return -1;
278         }
279
280         return 0;
281 }
282
283 void
284 mru_destroy( void )
285 {
286         MatchingRuleUse *m;
287
288         while( !LDAP_SLIST_EMPTY(&mru_list) ) {
289                 m = LDAP_SLIST_FIRST(&mru_list);
290                 LDAP_SLIST_REMOVE_HEAD(&mru_list, smru_next);
291
292                 if ( m->smru_str.bv_val ) {
293                         ch_free( m->smru_str.bv_val );
294                         m->smru_str.bv_val = NULL;
295                 }
296                 /* memory borrowed from m->smru_mr */
297                 m->smru_oid = NULL;
298                 m->smru_names = NULL;
299                 m->smru_desc = NULL;
300
301                 /* free what's left (basically smru_mruleuse.mru_applies_oids) */
302                 ldap_matchingruleuse_free((LDAPMatchingRuleUse *)m);
303         }
304 }
305
306 int
307 matching_rule_use_init( void )
308 {
309         MatchingRule    *mr;
310         MatchingRuleUse **mru_ptr = &LDAP_SLIST_FIRST(&mru_list);
311
312         Debug( LDAP_DEBUG_TRACE, "matching_rule_use_init\n", 0, 0, 0 );
313
314         LDAP_SLIST_FOREACH( mr, &mr_list, smr_next ) {
315                 AttributeType   *at;
316                 MatchingRuleUse mru_storage, *mru = &mru_storage;
317
318                 char            **applies_oids = NULL;
319
320                 mr->smr_mru = NULL;
321
322                 /* hide rules marked as HIDE */
323                 if ( mr->smr_usage & SLAP_MR_HIDE ) {
324                         continue;
325                 }
326
327                 /* hide rules not marked as designed for extensibility */
328                 /* MR_EXT means can be used any attribute type whose
329                  * syntax is same as the assertion syntax.
330                  * Another mechanism is needed where rule can be used
331                  * with attribute of other syntaxes.
332                  * Framework doesn't support this (yet).
333                  */
334
335                 if (!( ( mr->smr_usage & SLAP_MR_EXT )
336                         || mr->smr_compat_syntaxes ) )
337                 {
338                         continue;
339                 }
340
341                 memset( mru, 0, sizeof( MatchingRuleUse ) );
342
343                 /*
344                  * Note: we're using the same values of the corresponding 
345                  * MatchingRule structure; maybe we'd copy them ...
346                  */
347                 mru->smru_mr = mr;
348                 mru->smru_obsolete = mr->smr_obsolete;
349                 mru->smru_applies_oids = NULL;
350                 LDAP_SLIST_NEXT(mru, smru_next) = NULL;
351                 mru->smru_oid = mr->smr_oid;
352                 mru->smru_names = mr->smr_names;
353                 mru->smru_desc = mr->smr_desc;
354
355                 Debug( LDAP_DEBUG_TRACE, "    %s (%s): ", 
356                                 mru->smru_oid, 
357                                 mru->smru_names ? mru->smru_names[ 0 ] : "", 0 );
358
359                 at = NULL;
360                 for ( at_start( &at ); at; at_next( &at ) ) {
361                         if( at->sat_flags & SLAP_AT_HIDE ) continue;
362
363                         if( mr_usable_with_at( mr, at )) {
364                                 ldap_charray_add( &applies_oids, at->sat_cname.bv_val );
365                         }
366                 }
367
368                 /*
369                  * Note: the matchingRules that are not used
370                  * by any attributeType are not listed as
371                  * matchingRuleUse
372                  */
373                 if ( applies_oids != NULL ) {
374                         mru->smru_applies_oids = applies_oids;
375                         {
376                                 char *str = ldap_matchingruleuse2str( &mru->smru_mruleuse );
377                                 Debug( LDAP_DEBUG_TRACE, "matchingRuleUse: %s\n", str, 0, 0 );
378                                 ldap_memfree( str );
379                         }
380
381                         mru = (MatchingRuleUse *)ber_memalloc( sizeof( MatchingRuleUse ) );
382                         /* call-forward from MatchingRule to MatchingRuleUse */
383                         mr->smr_mru = mru;
384                         /* copy static data to newly allocated struct */
385                         *mru = mru_storage;
386                         /* append the struct pointer to the end of the list */
387                         *mru_ptr = mru;
388                         /* update the list head pointer */
389                         mru_ptr = &LDAP_SLIST_NEXT(mru,smru_next);
390                 }
391         }
392
393         return( 0 );
394 }
395
396 int mr_usable_with_at(
397         MatchingRule *mr,
398         AttributeType *at )
399 {
400         if( mr->smr_usage & SLAP_MR_EXT && ( 
401                 mr->smr_syntax == at->sat_syntax ||
402                 mr == at->sat_equality || mr == at->sat_approx ) )
403         {
404                 return 1;
405         }
406
407         if ( mr->smr_compat_syntaxes ) {
408                 int i;
409                 for( i=0; mr->smr_compat_syntaxes[i]; i++ ) {
410                         if( at->sat_syntax == mr->smr_compat_syntaxes[i] ) {
411                                 return 1;
412                         }
413                 }
414         }
415         return 0;
416 }
417
418 int mr_schema_info( Entry *e )
419 {
420         AttributeDescription *ad_matchingRules = slap_schema.si_ad_matchingRules;
421         MatchingRule *mr;
422         struct berval nval;
423
424         LDAP_SLIST_FOREACH(mr, &mr_list, smr_next ) {
425                 if ( mr->smr_usage & SLAP_MR_HIDE ) {
426                         /* skip hidden rules */
427                         continue;
428                 }
429
430                 if ( ! mr->smr_match ) {
431                         /* skip rules without matching functions */
432                         continue;
433                 }
434
435                 if ( mr->smr_str.bv_val == NULL ) {
436                         if ( ldap_matchingrule2bv( &mr->smr_mrule, &mr->smr_str ) == NULL ) {
437                                 return -1;
438                         }
439                 }
440 #if 0
441                 Debug( LDAP_DEBUG_TRACE, "Merging mr [%lu] %s\n",
442                         mr->smr_str.bv_len, mr->smr_str.bv_val, 0 );
443 #endif
444
445                 nval.bv_val = mr->smr_oid;
446                 nval.bv_len = strlen(mr->smr_oid);
447                 if( attr_merge_one( e, ad_matchingRules, &mr->smr_str, &nval ) ) {
448                         return -1;
449                 }
450         }
451         return 0;
452 }
453
454 int mru_schema_info( Entry *e )
455 {
456         AttributeDescription *ad_matchingRuleUse 
457                 = slap_schema.si_ad_matchingRuleUse;
458         MatchingRuleUse *mru;
459         struct berval nval;
460
461         LDAP_SLIST_FOREACH( mru, &mru_list, smru_next ) {
462                 assert( !( mru->smru_usage & SLAP_MR_HIDE ) );
463
464                 if ( mru->smru_str.bv_val == NULL ) {
465                         if ( ldap_matchingruleuse2bv( &mru->smru_mruleuse, &mru->smru_str )
466                                         == NULL ) {
467                                 return -1;
468                         }
469                 }
470
471 #if 0
472                 Debug( LDAP_DEBUG_TRACE, "Merging mru [%lu] %s\n",
473                         mru->smru_str.bv_len, mru->smru_str.bv_val, 0 );
474 #endif
475
476                 nval.bv_val = mru->smru_oid;
477                 nval.bv_len = strlen(mru->smru_oid);
478                 if( attr_merge_one( e, ad_matchingRuleUse, &mru->smru_str, &nval ) ) {
479                         return -1;
480                 }
481         }
482         return 0;
483 }