]> git.sur5r.net Git - openldap/blobdiff - servers/slapd/mr.c
cleanup comments
[openldap] / servers / slapd / mr.c
index 34dae23bc0acf6bfe89cd2065e386816d250a1bb..ee69d0b535e78045001626a2a954d1f7c485203c 100644 (file)
@@ -1,7 +1,7 @@
 /* mr.c - routines to manage matching rule definitions */
 /* $OpenLDAP$ */
 /*
- * Copyright 1998-2000 The OpenLDAP Foundation, All Rights Reserved.
+ * Copyright 1998-2002 The OpenLDAP Foundation, All Rights Reserved.
  * COPYING RESTRICTIONS APPLY, see COPYRIGHT file
  */
 
@@ -16,7 +16,6 @@
 #include "slap.h"
 #include "ldap_pvt.h"
 
-
 struct mindexrec {
        struct berval   mir_name;
        MatchingRule    *mir_mr;
@@ -52,7 +51,7 @@ mr_find( const char *mrname )
 {
        struct berval bv;
 
-       bv.bv_val = mrname;
+       bv.bv_val = (char *)mrname;
        bv.bv_len = strlen( mrname );
        return mr_bvfind( &bv );
 }
@@ -108,7 +107,7 @@ mr_insert(
                                 (AVL_DUP) avl_dup_error ) ) {
                        *err = smr->smr_oid;
                        ldap_memfree(mir);
-                       return SLAP_SCHERR_DUP_RULE;
+                       return SLAP_SCHERR_MR_DUP;
                }
                /* FIX: temporal consistency check */
                mr_bvfind(&mir->mir_name);
@@ -125,7 +124,7 @@ mr_insert(
                                         (AVL_DUP) avl_dup_error ) ) {
                                *err = *names;
                                ldap_memfree(mir);
-                               return SLAP_SCHERR_DUP_RULE;
+                               return SLAP_SCHERR_MR_DUP;
                        }
                        /* FIX: temporal consistency check */
                        mr_bvfind(&mir->mir_name);
@@ -138,12 +137,7 @@ mr_insert(
 int
 mr_add(
     LDAPMatchingRule           *mr,
-       unsigned usage,
-       slap_mr_convert_func *convert,
-       slap_mr_normalize_func *normalize,
-    slap_mr_match_func *match,
-       slap_mr_indexer_func *indexer,
-    slap_mr_filter_func        *filter,
+    slap_mrule_defs_rec        *def,
        MatchingRule    *amr,
     const char         **err
 )
@@ -156,12 +150,12 @@ mr_add(
        AC_MEMCPY( &smr->smr_mrule, mr, sizeof(LDAPMatchingRule));
 
        smr->smr_oidlen = strlen( mr->mr_oid );
-       smr->smr_usage = usage;
-       smr->smr_convert = convert;
-       smr->smr_normalize = normalize;
-       smr->smr_match = match;
-       smr->smr_indexer = indexer;
-       smr->smr_filter = filter;
+       smr->smr_usage = def->mrd_usage;
+       smr->smr_convert = def->mrd_convert;
+       smr->smr_normalize = def->mrd_normalize;
+       smr->smr_match = def->mrd_match;
+       smr->smr_indexer = def->mrd_indexer;
+       smr->smr_filter = def->mrd_filter;
        smr->smr_associated = amr;
 
        if ( smr->smr_syntax_oid ) {
@@ -182,47 +176,40 @@ mr_add(
 
 int
 register_matching_rule(
-       const char * desc,
-       unsigned usage,
-       slap_mr_convert_func *convert,
-       slap_mr_normalize_func *normalize,
-       slap_mr_match_func *match,
-       slap_mr_indexer_func *indexer,
-       slap_mr_filter_func *filter,
-       const char* associated )
+       slap_mrule_defs_rec *def )
 {
        LDAPMatchingRule *mr;
        MatchingRule *amr = NULL;
        int             code;
        const char      *err;
 
-       if( usage == SLAP_MR_NONE ) {
+       if( def->mrd_usage == SLAP_MR_NONE ) {
 #ifdef NEW_LOGGING
-               LDAP_LOG(( "operation", LDAP_LEVEL_ERR,
-                          "register_matching_rule: %s not usable\n", desc ));
+               LDAP_LOG( OPERATION, ERR, 
+                       "register_matching_rule: %s not usable\n", def->mrd_desc, 0, 0 );
 #else
                Debug( LDAP_DEBUG_ANY, "register_matching_rule: not usable %s\n",
-                   desc, 0, 0 );
+                   def->mrd_desc, 0, 0 );
 #endif
 
                return -1;
        }
 
-       if( associated != NULL ) {
-               amr = mr_find( associated );
+       if( def->mrd_associated != NULL ) {
+               amr = mr_find( def->mrd_associated );
 
 #if 0
                /* ignore for now */
 
                if( amr == NULL ) {
 #ifdef NEW_LOGGING
-                       LDAP_LOG(( "operation", LDAP_LEVEL_ERR,
-                                  "register_matching_rule: could not locate associated matching rule %s for %s\n",
-                                  associated, desc ));
+                       LDAP_LOG( OPERATION, ERR,
+                          "register_matching_rule: could not locate associated "
+                          "matching rule %s for %s\n",  def->mrd_associated, def->mrd_desc, 0 );
 #else
                        Debug( LDAP_DEBUG_ANY, "register_matching_rule: could not locate "
                                "associated matching rule %s for %s\n",
-                               associated, desc, 0 );
+                               def->mrd_associated, def->mrd_desc, 0 );
 #endif
 
                        return -1;
@@ -231,34 +218,32 @@ register_matching_rule(
 
        }
 
-       mr = ldap_str2matchingrule( desc, &code, &err, LDAP_SCHEMA_ALLOW_ALL);
+       mr = ldap_str2matchingrule( def->mrd_desc, &code, &err, LDAP_SCHEMA_ALLOW_ALL);
        if ( !mr ) {
 #ifdef NEW_LOGGING
-               LDAP_LOG(( "operation", LDAP_LEVEL_ERR,
-                          "register_matching_rule: %s before %s in %s.\n",
-                          ldap_scherr2str(code), err, desc ));
+               LDAP_LOG( OPERATION, ERR, 
+                       "register_matching_rule: %s before %s in %s.\n",
+                       ldap_scherr2str(code), err, def->mrd_desc );
 #else
                Debug( LDAP_DEBUG_ANY, "Error in register_matching_rule: %s before %s in %s\n",
-                   ldap_scherr2str(code), err, desc );
+                   ldap_scherr2str(code), err, def->mrd_desc );
 #endif
 
                return( -1 );
        }
 
-       code = mr_add( mr, usage,
-               convert, normalize, match, indexer, filter, amr,
-               &err );
+       code = mr_add( mr, def, amr, &err );
 
        ldap_memfree( mr );
 
        if ( code ) {
 #ifdef NEW_LOGGING
-               LDAP_LOG(( "operation", LDAP_LEVEL_ERR,
-                          "register_matching_rule: %s for %s in %s.\n",
-                          scherr2str(code), err, desc ));
+               LDAP_LOG( OPERATION, ERR, 
+                       "register_matching_rule: %s for %s in %s.\n",
+                       scherr2str(code), err, def->mrd_desc );
 #else
                Debug( LDAP_DEBUG_ANY, "Error in register_matching_rule: %s for %s in %s\n",
-                   scherr2str(code), err, desc );
+                   scherr2str(code), err, def->mrd_desc );
 #endif
 
                return( -1 );
@@ -272,32 +257,40 @@ register_matching_rule(
 
 int mr_schema_info( Entry *e )
 {
-       struct berval   val;
-       struct berval   *vals[2];
+       struct berval   vals[2];
        MatchingRule    *mr;
 
        AttributeDescription *ad_matchingRules = slap_schema.si_ad_matchingRules;
 
-       vals[0] = &val;
-       vals[1] = NULL;
+       vals[1].bv_val = NULL;
 
        for ( mr = mr_list; mr; mr = mr->smr_next ) {
+               if ( mr->smr_usage & SLAP_MR_HIDE ) {
+                       /* skip hidden rules */
+                       continue;
+               }
+
                if ( ! mr->smr_match ) {
                        /* skip rules without matching functions */
                        continue;
                }
 
-               if ( ldap_matchingrule2bv( &mr->smr_mrule, &val ) == NULL ) {
+               if ( ldap_matchingrule2bv( &mr->smr_mrule, vals ) == NULL ) {
                        return -1;
                }
 #if 0
                Debug( LDAP_DEBUG_TRACE, "Merging mr [%ld] %s\n",
-              (long) val.bv_len, val.bv_val, 0 );
+              (long) vals[0].bv_len, vals[0].bv_val, 0 );
 #endif
                attr_merge( e, ad_matchingRules, vals );
-               ldap_memfree( val.bv_val );
+               ldap_memfree( vals[0].bv_val );
        }
        return 0;
 }
 
+int mru_schema_info( Entry *e )
+{
+       return 0;
+}
+
 #endif