Back to index

openldap  2.4.31
Defines | Functions | Variables
dn.c File Reference
#include "portable.h"
#include <stdio.h>
#include <ac/ctype.h>
#include <ac/socket.h>
#include <ac/string.h>
#include <ac/time.h>
#include "slap.h"
#include "lutil.h"

Go to the source code of this file.

Defines

#define AVA_PRIVATE(ava)   ( ( AttributeDescription * )(ava)->la_private )

Functions

static int LDAPRDN_validate (LDAPRDN rdn)
static int LDAPDN_validate (LDAPDN dn)
int dnValidate (Syntax *syntax, struct berval *in)
int rdnValidate (Syntax *syntax, struct berval *in)
static int AVA_Sort (LDAPRDN rdn, int nAVAs)
static int LDAPRDN_rewrite (LDAPRDN rdn, unsigned flags, void *ctx)
static int LDAPDN_rewrite (LDAPDN dn, unsigned flags, void *ctx)
int dnNormalize (slap_mask_t use, Syntax *syntax, MatchingRule *mr, struct berval *val, struct berval *out, void *ctx)
int rdnNormalize (slap_mask_t use, Syntax *syntax, MatchingRule *mr, struct berval *val, struct berval *out, void *ctx)
int dnPretty (Syntax *syntax, struct berval *val, struct berval *out, void *ctx)
int rdnPretty (Syntax *syntax, struct berval *val, struct berval *out, void *ctx)
int dnPrettyNormalDN (Syntax *syntax, struct berval *val, LDAPDN *dn, int flags, void *ctx)
int dnPrettyNormal (Syntax *syntax, struct berval *val, struct berval *pretty, struct berval *normal, void *ctx)
int dnMatch (int *matchp, slap_mask_t flags, Syntax *syntax, MatchingRule *mr, struct berval *value, void *assertedValue)
int dnRelativeMatch (int *matchp, slap_mask_t flags, Syntax *syntax, MatchingRule *mr, struct berval *value, void *assertedValue)
int rdnMatch (int *matchp, slap_mask_t flags, Syntax *syntax, MatchingRule *mr, struct berval *value, void *assertedValue)
void dnParent (struct berval *dn, struct berval *pdn)
void dnRdn (struct berval *dn, struct berval *rdn)
int dnExtractRdn (struct berval *dn, struct berval *rdn, void *ctx)
ber_len_t dn_rdnlen (Backend *be, struct berval *dn_in)
int rdn_validate (struct berval *rdn)
void build_new_dn (struct berval *new_dn, struct berval *parent_dn, struct berval *newrdn, void *memctx)
int dnIsSuffix (const struct berval *dn, const struct berval *suffix)
int dnIsWithinScope (struct berval *ndn, struct berval *nbase, int scope)
int dnIsSuffixScope (struct berval *ndn, struct berval *nbase, int scope)
int dnIsOneLevelRDN (struct berval *rdn)
int register_certificate_map_function (SLAP_CERT_MAP_FN *fn)
int dnX509normalize (void *x509_name, struct berval *out)

Variables

int slap_DN_strict = SLAP_AD_NOINSERT

Define Documentation

#define AVA_PRIVATE (   ava)    ( ( AttributeDescription * )(ava)->la_private )

Definition at line 54 of file dn.c.


Function Documentation

static int AVA_Sort ( LDAPRDN  rdn,
int  nAVAs 
) [static]

Definition at line 232 of file dn.c.

{
       LDAPAVA       *ava_i;
       int           i;

       assert( rdn != NULL );

       for ( i = 1; i < nAVAs; i++ ) {
              LDAPAVA *ava_j;
              int j;

              ava_i = rdn[ i ];
              for ( j = i-1; j >=0; j-- ) {
                     int a;

                     ava_j = rdn[ j ];
                     a = strcmp( ava_i->la_attr.bv_val, ava_j->la_attr.bv_val );

                     /* RFC4512 does not allow multiple AVAs
                      * with the same attribute type in RDN (ITS#5968) */
                     if ( a == 0 )
                            return LDAP_INVALID_DN_SYNTAX;

                     if ( a > 0 )
                            break;

                     rdn[ j+1 ] = rdn[ j ];
              }
              rdn[ j+1 ] = ava_i;
       }
       return LDAP_SUCCESS;
}

Here is the caller graph for this function:

void build_new_dn ( struct berval new_dn,
struct berval parent_dn,
struct berval newrdn,
void memctx 
)

Definition at line 1141 of file dn.c.

{
       char *ptr;

       if ( parent_dn == NULL || parent_dn->bv_len == 0 ) {
              ber_dupbv_x( new_dn, newrdn, memctx );
              return;
       }

       new_dn->bv_len = parent_dn->bv_len + newrdn->bv_len + 1;
       new_dn->bv_val = (char *) slap_sl_malloc( new_dn->bv_len + 1, memctx );

       ptr = lutil_strncopy( new_dn->bv_val, newrdn->bv_val, newrdn->bv_len );
       *ptr++ = ',';
       strcpy( ptr, parent_dn->bv_val );
}

Here is the call graph for this function:

Here is the caller graph for this function:

ber_len_t dn_rdnlen ( Backend be,
struct berval dn_in 
)

Definition at line 1042 of file dn.c.

{
       const char    *p;

       assert( dn_in != NULL );

       if ( dn_in == NULL ) {
              return 0;
       }

       if ( !dn_in->bv_len ) {
              return 0;
       }

       if ( be != NULL && be_issuffix( be, dn_in ) ) {
              return 0;
       }

       p = ber_bvchr( dn_in, ',' );

       return p ? (ber_len_t) (p - dn_in->bv_val) : dn_in->bv_len;
}

Here is the call graph for this function:

Here is the caller graph for this function:

int dnExtractRdn ( struct berval dn,
struct berval rdn,
void ctx 
)

Definition at line 1010 of file dn.c.

{
       LDAPRDN              tmpRDN;
       const char    *p;
       int           rc;

       assert( dn != NULL );
       assert( rdn != NULL );

       if( dn->bv_len == 0 ) {
              return LDAP_OTHER;
       }

       rc = ldap_bv2rdn_x( dn, &tmpRDN, (char **)&p, LDAP_DN_FORMAT_LDAP, ctx );
       if ( rc != LDAP_SUCCESS ) {
              return rc;
       }

       rc = ldap_rdn2bv_x( tmpRDN, rdn, LDAP_DN_FORMAT_LDAPV3 | LDAP_DN_PRETTY,
              ctx );

       ldap_rdnfree_x( tmpRDN, ctx );
       return rc;
}

Here is the call graph for this function:

int dnIsOneLevelRDN ( struct berval rdn)

Definition at line 1267 of file dn.c.

{
       ber_len_t     len = rdn->bv_len;
       for ( ; len--; ) {
              if ( DN_SEPARATOR( rdn->bv_val[ len ] ) ) {
                     return 0;
              }
       }

       return 1;
}

Here is the caller graph for this function:

int dnIsSuffix ( const struct berval dn,
const struct berval suffix 
)

Definition at line 1167 of file dn.c.

{
       int    d;

       assert( dn != NULL );
       assert( suffix != NULL );

       d = dn->bv_len - suffix->bv_len;

       /* empty suffix matches any dn */
       if ( suffix->bv_len == 0 ) {
              return 1;
       }

       /* suffix longer than dn */
       if ( d < 0 ) {
              return 0;
       }

       /* no rdn separator or escaped rdn separator */
       if ( d > 1 && !DN_SEPARATOR( dn->bv_val[ d - 1 ] ) ) {
              return 0;
       }

       /* no possible match or malformed dn */
       if ( d == 1 ) {
              return 0;
       }

       /* compare */
       return( strncmp( dn->bv_val + d, suffix->bv_val, suffix->bv_len ) == 0 );
}

Here is the caller graph for this function:

int dnIsSuffixScope ( struct berval ndn,
struct berval nbase,
int  scope 
)

Definition at line 1257 of file dn.c.

{
       if ( !dnIsSuffix( ndn, nbase ) ) {
              return 0;
       }

       return dnIsWithinScope( ndn, nbase, scope );
}

Here is the call graph for this function:

Here is the caller graph for this function:

int dnIsWithinScope ( struct berval ndn,
struct berval nbase,
int  scope 
)

Definition at line 1210 of file dn.c.

{
       assert( ndn != NULL );
       assert( nbase != NULL );
       assert( !BER_BVISNULL( ndn ) );
       assert( !BER_BVISNULL( nbase ) );

       switch ( scope ) {
       case LDAP_SCOPE_DEFAULT:
       case LDAP_SCOPE_SUBTREE:
              break;

       case LDAP_SCOPE_BASE:
              if ( ndn->bv_len != nbase->bv_len ) {
                     return 0;
              }
              break;

       case LDAP_SCOPE_ONELEVEL: {
              struct berval pndn;
              dnParent( ndn, &pndn );
              if ( pndn.bv_len != nbase->bv_len ) {
                     return 0;
              }
              } break;

       case LDAP_SCOPE_SUBORDINATE:
              if ( ndn->bv_len == nbase->bv_len ) {
                     return 0;
              }
              break;

       /* unknown scope */
       default:
              return -1;
       }

       return 1;
}

Here is the call graph for this function:

Here is the caller graph for this function:

int dnMatch ( int matchp,
slap_mask_t  flags,
Syntax syntax,
MatchingRule mr,
struct berval value,
void assertedValue 
)

Definition at line 783 of file dn.c.

{
       int match;
       struct berval *asserted = (struct berval *) assertedValue;

       assert( matchp != NULL );
       assert( value != NULL );
       assert( assertedValue != NULL );
       assert( !BER_BVISNULL( value ) );
       assert( !BER_BVISNULL( asserted ) );
       
       match = value->bv_len - asserted->bv_len;

       if ( match == 0 ) {
              match = memcmp( value->bv_val, asserted->bv_val, 
                            value->bv_len );
       }

       Debug( LDAP_DEBUG_ARGS, "dnMatch %d\n\t\"%s\"\n\t\"%s\"\n",
              match, value->bv_val, asserted->bv_val );

       *matchp = match;
       return LDAP_SUCCESS;
}

Here is the caller graph for this function:

int dnNormalize ( slap_mask_t  use,
Syntax syntax,
MatchingRule mr,
struct berval val,
struct berval out,
void ctx 
)

Definition at line 416 of file dn.c.

{
       assert( val != NULL );
       assert( out != NULL );

       Debug( LDAP_DEBUG_TRACE, ">>> dnNormalize: <%s>\n", val->bv_val ? val->bv_val : "", 0, 0 );

       if ( val->bv_len != 0 ) {
              LDAPDN        dn = NULL;
              int           rc;

              /*
               * Go to structural representation
               */
              rc = ldap_bv2dn_x( val, &dn, LDAP_DN_FORMAT_LDAP, ctx );
              if ( rc != LDAP_SUCCESS ) {
                     return LDAP_INVALID_SYNTAX;
              }

              assert( strlen( val->bv_val ) == val->bv_len );

              /*
               * Schema-aware rewrite
               */
              if ( LDAPDN_rewrite( dn, 0, ctx ) != LDAP_SUCCESS ) {
                     ldap_dnfree_x( dn, ctx );
                     return LDAP_INVALID_SYNTAX;
              }

              /*
               * Back to string representation
               */
              rc = ldap_dn2bv_x( dn, out,
                     LDAP_DN_FORMAT_LDAPV3 | LDAP_DN_PRETTY, ctx );

              ldap_dnfree_x( dn, ctx );

              if ( rc != LDAP_SUCCESS ) {
                     return LDAP_INVALID_SYNTAX;
              }
       } else {
              ber_dupbv_x( out, val, ctx );
       }

       Debug( LDAP_DEBUG_TRACE, "<<< dnNormalize: <%s>\n", out->bv_val ? out->bv_val : "", 0, 0 );

       return LDAP_SUCCESS;
}

Here is the call graph for this function:

Here is the caller graph for this function:

void dnParent ( struct berval dn,
struct berval pdn 
)

Definition at line 957 of file dn.c.

{
       char   *p;

       p = ber_bvchr( dn, ',' );

       /* one-level dn */
       if ( p == NULL ) {
              pdn->bv_val = dn->bv_val + dn->bv_len;
              pdn->bv_len = 0;
              return;
       }

       assert( DN_SEPARATOR( p[ 0 ] ) );
       p++;

       assert( ATTR_LEADCHAR( p[ 0 ] ) );
       pdn->bv_len = dn->bv_len - (p - dn->bv_val);
       pdn->bv_val = p;

       return;
}

Here is the caller graph for this function:

int dnPretty ( Syntax syntax,
struct berval val,
struct berval out,
void ctx 
)

Definition at line 530 of file dn.c.

{
       assert( val != NULL );
       assert( out != NULL );

       Debug( LDAP_DEBUG_TRACE, ">>> dnPretty: <%s>\n", val->bv_val ? val->bv_val : "", 0, 0 );

       if ( val->bv_len == 0 ) {
              ber_dupbv_x( out, val, ctx );

       } else if ( val->bv_len > SLAP_LDAPDN_MAXLEN ) {
              return LDAP_INVALID_SYNTAX;

       } else {
              LDAPDN        dn = NULL;
              int           rc;

              /* FIXME: should be liberal in what we accept */
              rc = ldap_bv2dn_x( val, &dn, LDAP_DN_FORMAT_LDAP, ctx );
              if ( rc != LDAP_SUCCESS ) {
                     return LDAP_INVALID_SYNTAX;
              }

              assert( strlen( val->bv_val ) == val->bv_len );

              /*
               * Schema-aware rewrite
               */
              if ( LDAPDN_rewrite( dn, SLAP_LDAPDN_PRETTY, ctx ) != LDAP_SUCCESS ) {
                     ldap_dnfree_x( dn, ctx );
                     return LDAP_INVALID_SYNTAX;
              }

              /* FIXME: not sure why the default isn't pretty */
              /* RE: the default is the form that is used as
               * an internal representation; the pretty form
               * is a variant */
              rc = ldap_dn2bv_x( dn, out,
                     LDAP_DN_FORMAT_LDAPV3 | LDAP_DN_PRETTY, ctx );

              ldap_dnfree_x( dn, ctx );

              if ( rc != LDAP_SUCCESS ) {
                     return LDAP_INVALID_SYNTAX;
              }
       }

       Debug( LDAP_DEBUG_TRACE, "<<< dnPretty: <%s>\n", out->bv_val ? out->bv_val : "", 0, 0 );

       return LDAP_SUCCESS;
}

Here is the call graph for this function:

Here is the caller graph for this function:

int dnPrettyNormal ( Syntax syntax,
struct berval val,
struct berval pretty,
struct berval normal,
void ctx 
)

Definition at line 699 of file dn.c.

{
       assert( val != NULL );
       assert( pretty != NULL );
       assert( normal != NULL );
       Debug( LDAP_DEBUG_TRACE, ">>> dnPrettyNormal: <%s>\n", val->bv_val ? val->bv_val : "", 0, 0 );

       if ( val->bv_len == 0 ) {
              ber_dupbv_x( pretty, val, ctx );
              ber_dupbv_x( normal, val, ctx );

       } else if ( val->bv_len > SLAP_LDAPDN_MAXLEN ) {
              /* too big */
              return LDAP_INVALID_SYNTAX;

       } else {
              LDAPDN        dn = NULL;
              int           rc;

              pretty->bv_val = NULL;
              normal->bv_val = NULL;
              pretty->bv_len = 0;
              normal->bv_len = 0;

              /* FIXME: should be liberal in what we accept */
              rc = ldap_bv2dn_x( val, &dn, LDAP_DN_FORMAT_LDAP, ctx );
              if ( rc != LDAP_SUCCESS ) {
                     return LDAP_INVALID_SYNTAX;
              }

              assert( strlen( val->bv_val ) == val->bv_len );

              /*
               * Schema-aware rewrite
               */
              if ( LDAPDN_rewrite( dn, SLAP_LDAPDN_PRETTY, ctx ) != LDAP_SUCCESS ) {
                     ldap_dnfree_x( dn, ctx );
                     return LDAP_INVALID_SYNTAX;
              }

              rc = ldap_dn2bv_x( dn, pretty,
                     LDAP_DN_FORMAT_LDAPV3 | LDAP_DN_PRETTY, ctx );

              if ( rc != LDAP_SUCCESS ) {
                     ldap_dnfree_x( dn, ctx );
                     return LDAP_INVALID_SYNTAX;
              }

              if ( LDAPDN_rewrite( dn, 0, ctx ) != LDAP_SUCCESS ) {
                     ldap_dnfree_x( dn, ctx );
                     ber_memfree_x( pretty->bv_val, ctx );
                     pretty->bv_val = NULL;
                     pretty->bv_len = 0;
                     return LDAP_INVALID_SYNTAX;
              }

              rc = ldap_dn2bv_x( dn, normal,
                     LDAP_DN_FORMAT_LDAPV3 | LDAP_DN_PRETTY, ctx );

              ldap_dnfree_x( dn, ctx );
              if ( rc != LDAP_SUCCESS ) {
                     ber_memfree_x( pretty->bv_val, ctx );
                     pretty->bv_val = NULL;
                     pretty->bv_len = 0;
                     return LDAP_INVALID_SYNTAX;
              }
       }

       Debug( LDAP_DEBUG_TRACE, "<<< dnPrettyNormal: <%s>, <%s>\n",
              pretty->bv_val ? pretty->bv_val : "",
              normal->bv_val ? normal->bv_val : "", 0 );

       return LDAP_SUCCESS;
}

Here is the call graph for this function:

Here is the caller graph for this function:

int dnPrettyNormalDN ( Syntax syntax,
struct berval val,
LDAPDN dn,
int  flags,
void ctx 
)

Definition at line 647 of file dn.c.

{
       assert( val != NULL );
       assert( dn != NULL );

       Debug( LDAP_DEBUG_TRACE, ">>> dn%sDN: <%s>\n", 
                     flags == SLAP_LDAPDN_PRETTY ? "Pretty" : "Normal", 
                     val->bv_val ? val->bv_val : "", 0 );

       if ( val->bv_len == 0 ) {
              return LDAP_SUCCESS;

       } else if ( val->bv_len > SLAP_LDAPDN_MAXLEN ) {
              return LDAP_INVALID_SYNTAX;

       } else {
              int           rc;

              /* FIXME: should be liberal in what we accept */
              rc = ldap_bv2dn_x( val, dn, LDAP_DN_FORMAT_LDAP, ctx );
              if ( rc != LDAP_SUCCESS ) {
                     return LDAP_INVALID_SYNTAX;
              }

              assert( strlen( val->bv_val ) == val->bv_len );

              /*
               * Schema-aware rewrite
               */
              if ( LDAPDN_rewrite( *dn, flags, ctx ) != LDAP_SUCCESS ) {
                     ldap_dnfree_x( *dn, ctx );
                     *dn = NULL;
                     return LDAP_INVALID_SYNTAX;
              }
       }

       Debug( LDAP_DEBUG_TRACE, "<<< dn%sDN\n", 
                     flags == SLAP_LDAPDN_PRETTY ? "Pretty" : "Normal",
                     0, 0 );

       return LDAP_SUCCESS;
}

Here is the call graph for this function:

void dnRdn ( struct berval dn,
struct berval rdn 
)

Definition at line 988 of file dn.c.

{
       char   *p;

       *rdn = *dn;
       p = ber_bvchr( dn, ',' );

       /* one-level dn */
       if ( p == NULL ) {
              return;
       }

       assert( DN_SEPARATOR( p[ 0 ] ) );
       assert( ATTR_LEADCHAR( p[ 1 ] ) );
       rdn->bv_len = p - dn->bv_val;

       return;
}

Here is the caller graph for this function:

int dnRelativeMatch ( int matchp,
slap_mask_t  flags,
Syntax syntax,
MatchingRule mr,
struct berval value,
void assertedValue 
)

Definition at line 818 of file dn.c.

{
       int match;
       struct berval *asserted = (struct berval *) assertedValue;

       assert( matchp != NULL );
       assert( value != NULL );
       assert( assertedValue != NULL );
       assert( !BER_BVISNULL( value ) );
       assert( !BER_BVISNULL( asserted ) );

       if( mr == slap_schema.si_mr_dnSubtreeMatch ) {
              if( asserted->bv_len > value->bv_len ) {
                     match = -1;
              } else if ( asserted->bv_len == value->bv_len ) {
                     match = memcmp( value->bv_val, asserted->bv_val, 
                            value->bv_len );
              } else {
                     if( DN_SEPARATOR(
                            value->bv_val[value->bv_len - asserted->bv_len - 1] ))
                     {
                            match = memcmp(
                                   &value->bv_val[value->bv_len - asserted->bv_len],
                                   asserted->bv_val, 
                                   asserted->bv_len );
                     } else {
                            match = 1;
                     }
              }

              *matchp = match;
              return LDAP_SUCCESS;
       }

       if( mr == slap_schema.si_mr_dnSuperiorMatch ) {
              asserted = value;
              value = (struct berval *) assertedValue;
              mr = slap_schema.si_mr_dnSubordinateMatch;
       }

       if( mr == slap_schema.si_mr_dnSubordinateMatch ) {
              if( asserted->bv_len >= value->bv_len ) {
                     match = -1;
              } else {
                     if( DN_SEPARATOR(
                            value->bv_val[value->bv_len - asserted->bv_len - 1] ))
                     {
                            match = memcmp(
                                   &value->bv_val[value->bv_len - asserted->bv_len],
                                   asserted->bv_val, 
                                   asserted->bv_len );
                     } else {
                            match = 1;
                     }
              }

              *matchp = match;
              return LDAP_SUCCESS;
       }

       if( mr == slap_schema.si_mr_dnOneLevelMatch ) {
              if( asserted->bv_len >= value->bv_len ) {
                     match = -1;
              } else {
                     if( DN_SEPARATOR(
                            value->bv_val[value->bv_len - asserted->bv_len - 1] ))
                     {
                            match = memcmp(
                                   &value->bv_val[value->bv_len - asserted->bv_len],
                                   asserted->bv_val, 
                                   asserted->bv_len );

                            if( !match ) {
                                   struct berval rdn;
                                   rdn.bv_val = value->bv_val;
                                   rdn.bv_len = value->bv_len - asserted->bv_len - 1;
                                   match = dnIsOneLevelRDN( &rdn ) ? 0 : 1;
                            }
                     } else {
                            match = 1;
                     }
              }

              *matchp = match;
              return LDAP_SUCCESS;
       }

       /* should not be reachable */
       assert( 0 );
       return LDAP_OTHER;
}

Here is the call graph for this function:

Here is the caller graph for this function:

int dnValidate ( Syntax syntax,
struct berval in 
)

Definition at line 145 of file dn.c.

{
       int           rc;
       LDAPDN        dn = NULL;

       assert( in != NULL );

       if ( in->bv_len == 0 ) {
              return LDAP_SUCCESS;

       } else if ( in->bv_len > SLAP_LDAPDN_MAXLEN ) {
              return LDAP_INVALID_SYNTAX;
       }

       rc = ldap_bv2dn( in, &dn, LDAP_DN_FORMAT_LDAP );
       if ( rc != LDAP_SUCCESS ) {
              return LDAP_INVALID_SYNTAX;
       }

       assert( strlen( in->bv_val ) == in->bv_len );

       /*
        * Schema-aware validate
        */
       rc = LDAPDN_validate( dn );
       ldap_dnfree( dn );

       if ( rc != LDAP_SUCCESS ) {
              return LDAP_INVALID_SYNTAX;
       }

       return LDAP_SUCCESS;
}

Here is the call graph for this function:

Here is the caller graph for this function:

int dnX509normalize ( void x509_name,
struct berval out 
)

Definition at line 1299 of file dn.c.

{
       /* Invoke the LDAP library's converter with our schema-rewriter */
       int rc = ldap_X509dn2bv( x509_name, out, LDAPDN_rewrite, 0 );

       Debug( LDAP_DEBUG_TRACE,
              "dnX509Normalize: <%s> (%d)\n",
              BER_BVISNULL( out ) ? "(null)" : out->bv_val, rc, 0 );

       return rc;
}

Here is the call graph for this function:

Here is the caller graph for this function:

static int LDAPDN_rewrite ( LDAPDN  dn,
unsigned  flags,
void ctx 
) [static]

Definition at line 398 of file dn.c.

{
       int           iRDN;
       int           rc;

       assert( dn != NULL );

       for ( iRDN = 0; dn[ iRDN ]; iRDN++ ) {
              rc = LDAPRDN_rewrite( dn[ iRDN ], flags, ctx );
              if ( rc != LDAP_SUCCESS ) {
                     return rc;
              }
       }

       return LDAP_SUCCESS;
}

Here is the call graph for this function:

Here is the caller graph for this function:

static int LDAPDN_validate ( LDAPDN  dn) [static]

Definition at line 124 of file dn.c.

{
       int           iRDN;
       int           rc;

       assert( dn != NULL );

       for ( iRDN = 0; dn[ iRDN ]; iRDN++ ) {
              rc = LDAPRDN_validate( dn[ iRDN ] );
              if ( rc != LDAP_SUCCESS ) {
                     return rc;
              }
       }

       return LDAP_SUCCESS;
}

Here is the call graph for this function:

Here is the caller graph for this function:

static int LDAPRDN_rewrite ( LDAPRDN  rdn,
unsigned  flags,
void ctx 
) [static]

Definition at line 266 of file dn.c.

{

       int rc, iAVA, do_sort = 0;

       for ( iAVA = 0; rdn[ iAVA ]; iAVA++ ) {
              LDAPAVA                     *ava = rdn[ iAVA ];
              AttributeDescription *ad;
              slap_syntax_validate_func *validf = NULL;
              slap_mr_normalize_func *normf = NULL;
              slap_syntax_transform_func *transf = NULL;
              MatchingRule *mr = NULL;
              struct berval        bv = BER_BVNULL;

              assert( ava != NULL );

              if ( ( ad = AVA_PRIVATE( ava ) ) == NULL ) {
                     const char    *text = NULL;

                     rc = slap_bv2ad( &ava->la_attr, &ad, &text );
                     if ( rc != LDAP_SUCCESS ) {
                            rc = slap_bv2undef_ad( &ava->la_attr,
                                   &ad, &text,
                                   SLAP_AD_PROXIED|slap_DN_strict );
                            if ( rc != LDAP_SUCCESS ) {
                                   return LDAP_INVALID_SYNTAX;
                            }
                     }
                     
                     ava->la_private = ( void * )ad;
                     do_sort = 1;
              }

              /* 
               * Replace attr oid/name with the canonical name
               */
              ava->la_attr = ad->ad_cname;

              if( ava->la_flags & LDAP_AVA_BINARY ) {
                     /* AVA is binary encoded, not supported */
                     return LDAP_INVALID_SYNTAX;

                     /* Do not allow X-ORDERED 'VALUES' naming attributes */
              } else if( ad->ad_type->sat_flags & SLAP_AT_ORDERED_VAL ) {
                     return LDAP_INVALID_SYNTAX;

              } else if( flags & SLAP_LDAPDN_PRETTY ) {
                     transf = ad->ad_type->sat_syntax->ssyn_pretty;
                     if( !transf ) {
                            validf = ad->ad_type->sat_syntax->ssyn_validate;
                     }
              } else { /* normalization */
                     validf = ad->ad_type->sat_syntax->ssyn_validate;
                     mr = ad->ad_type->sat_equality;
                     if( mr && (!( mr->smr_usage & SLAP_MR_MUTATION_NORMALIZER ))) {
                            normf = mr->smr_normalize;
                     }
              }

              if ( validf ) {
                     /* validate value before normalization */
                     rc = ( *validf )( ad->ad_type->sat_syntax,
                            ava->la_value.bv_len
                                   ? &ava->la_value
                                   : (struct berval *) &slap_empty_bv );

                     if ( rc != LDAP_SUCCESS ) {
                            return LDAP_INVALID_SYNTAX;
                     }
              }

              if ( transf ) {
                     /*
                      * transform value by pretty function
                      *     if value is empty, use empty_bv
                      */
                     rc = ( *transf )( ad->ad_type->sat_syntax,
                            ava->la_value.bv_len
                                   ? &ava->la_value
                                   : (struct berval *) &slap_empty_bv,
                            &bv, ctx );
              
                     if ( rc != LDAP_SUCCESS ) {
                            return LDAP_INVALID_SYNTAX;
                     }
              }

              if ( normf ) {
                     /*
                      * normalize value
                      *     if value is empty, use empty_bv
                      */
                     rc = ( *normf )(
                            SLAP_MR_VALUE_OF_ASSERTION_SYNTAX,
                            ad->ad_type->sat_syntax,
                            mr,
                            ava->la_value.bv_len
                                   ? &ava->la_value
                                   : (struct berval *) &slap_empty_bv,
                            &bv, ctx );
              
                     if ( rc != LDAP_SUCCESS ) {
                            return LDAP_INVALID_SYNTAX;
                     }
              }


              if( bv.bv_val ) {
                     if ( ava->la_flags & LDAP_AVA_FREE_VALUE )
                            ber_memfree_x( ava->la_value.bv_val, ctx );
                     ava->la_value = bv;
                     ava->la_flags |= LDAP_AVA_FREE_VALUE;
              }
              /* reject empty values */
              if (!ava->la_value.bv_len) {
                     return LDAP_INVALID_SYNTAX;
              }
       }
       rc = LDAP_SUCCESS;

       if ( do_sort ) {
              rc = AVA_Sort( rdn, iAVA );
       }

       return rc;
}

Here is the call graph for this function:

Here is the caller graph for this function:

static int LDAPRDN_validate ( LDAPRDN  rdn) [static]

Definition at line 59 of file dn.c.

{
       int           iAVA;
       int           rc;

       assert( rdn != NULL );

       for ( iAVA = 0; rdn[ iAVA ]; iAVA++ ) {
              LDAPAVA                     *ava = rdn[ iAVA ];
              AttributeDescription *ad;
              slap_syntax_validate_func *validate = NULL;

              assert( ava != NULL );
              
              if ( ( ad = AVA_PRIVATE( ava ) ) == NULL ) {
                     const char    *text = NULL;

                     rc = slap_bv2ad( &ava->la_attr, &ad, &text );
                     if ( rc != LDAP_SUCCESS ) {
                            rc = slap_bv2undef_ad( &ava->la_attr,
                                   &ad, &text,
                                   SLAP_AD_PROXIED|slap_DN_strict );
                            if ( rc != LDAP_SUCCESS ) {
                                   return LDAP_INVALID_SYNTAX;
                            }
                     }

                     ava->la_private = ( void * )ad;
              }

              /*
               * Do not allow X-ORDERED 'VALUES' naming attributes
               */
              if ( ad->ad_type->sat_flags & SLAP_AT_ORDERED_VAL ) {
                     return LDAP_INVALID_SYNTAX;
              }

              /* 
               * Replace attr oid/name with the canonical name
               */
              ava->la_attr = ad->ad_cname;

              validate = ad->ad_type->sat_syntax->ssyn_validate;

              if ( validate ) {
                     /*
                      * validate value by validate function
                      */
                     rc = ( *validate )( ad->ad_type->sat_syntax,
                            &ava->la_value );
                     
                     if ( rc != LDAP_SUCCESS ) {
                            return LDAP_INVALID_SYNTAX;
                     }
              }
       }

       return LDAP_SUCCESS;
}

Here is the call graph for this function:

Here is the caller graph for this function:

int rdn_validate ( struct berval rdn)

Definition at line 1074 of file dn.c.

{
#if 1
       /* Major cheat!
        * input is a pretty or normalized DN
        * hence, we can just search for ','
        */
       if( rdn == NULL || rdn->bv_len == 0 ||
              rdn->bv_len > SLAP_LDAPDN_MAXLEN )
       {
              return LDAP_INVALID_SYNTAX;
       }
       return ber_bvchr( rdn, ',' ) == NULL
              ? LDAP_SUCCESS : LDAP_INVALID_SYNTAX;

#else
       LDAPRDN              *RDN, **DN[ 2 ] = { &RDN, NULL };
       const char    *p;
       int           rc;

       /*
        * must be non-empty
        */
       if ( rdn == NULL || rdn == '\0' ) {
              return 0;
       }

       /*
        * must be parsable
        */
       rc = ldap_bv2rdn( rdn, &RDN, (char **)&p, LDAP_DN_FORMAT_LDAP );
       if ( rc != LDAP_SUCCESS ) {
              return 0;
       }

       /*
        * Must be one-level
        */
       if ( p[ 0 ] != '\0' ) {
              return 0;
       }

       /*
        * Schema-aware validate
        */
       if ( rc == LDAP_SUCCESS ) {
              rc = LDAPDN_validate( DN );
       }
       ldap_rdnfree( RDN );

       /*
        * Must validate (there's a repeated parsing ...)
        */
       return ( rc == LDAP_SUCCESS );
#endif
}

Here is the call graph for this function:

Here is the caller graph for this function:

int rdnMatch ( int matchp,
slap_mask_t  flags,
Syntax syntax,
MatchingRule mr,
struct berval value,
void assertedValue 
)

Definition at line 917 of file dn.c.

{
       int match;
       struct berval *asserted = (struct berval *) assertedValue;

       assert( matchp != NULL );
       assert( value != NULL );
       assert( assertedValue != NULL );
       
       match = value->bv_len - asserted->bv_len;

       if ( match == 0 ) {
              match = memcmp( value->bv_val, asserted->bv_val, 
                            value->bv_len );
       }

       Debug( LDAP_DEBUG_ARGS, "rdnMatch %d\n\t\"%s\"\n\t\"%s\"\n",
              match, value->bv_val, asserted->bv_val );

       *matchp = match;
       return LDAP_SUCCESS;
}
int rdnNormalize ( slap_mask_t  use,
Syntax syntax,
MatchingRule mr,
struct berval val,
struct berval out,
void ctx 
)

Definition at line 472 of file dn.c.

{
       assert( val != NULL );
       assert( out != NULL );

       Debug( LDAP_DEBUG_TRACE, ">>> dnNormalize: <%s>\n", val->bv_val ? val->bv_val : "", 0, 0 );
       if ( val->bv_len != 0 ) {
              LDAPRDN              rdn = NULL;
              int           rc;
              char*         p;

              /*
               * Go to structural representation
               */
              rc = ldap_bv2rdn_x( val , &rdn, (char **) &p,
                                   LDAP_DN_FORMAT_LDAP, ctx);

              if ( rc != LDAP_SUCCESS ) {
                     return LDAP_INVALID_SYNTAX;
              }

              assert( strlen( val->bv_val ) == val->bv_len );

              /*
               * Schema-aware rewrite
               */
              if ( LDAPRDN_rewrite( rdn, 0, ctx ) != LDAP_SUCCESS ) {
                     ldap_rdnfree_x( rdn, ctx );
                     return LDAP_INVALID_SYNTAX;
              }

              /*
               * Back to string representation
               */
              rc = ldap_rdn2bv_x( rdn, out,
                     LDAP_DN_FORMAT_LDAPV3 | LDAP_DN_PRETTY, ctx );

              ldap_rdnfree_x( rdn, ctx );

              if ( rc != LDAP_SUCCESS ) {
                     return LDAP_INVALID_SYNTAX;
              }
       } else {
              ber_dupbv_x( out, val, ctx );
       }

       Debug( LDAP_DEBUG_TRACE, "<<< dnNormalize: <%s>\n", out->bv_val ? out->bv_val : "", 0, 0 );

       return LDAP_SUCCESS;
}

Here is the call graph for this function:

Here is the caller graph for this function:

int rdnPretty ( Syntax syntax,
struct berval val,
struct berval out,
void ctx 
)

Definition at line 587 of file dn.c.

{
       assert( val != NULL );
       assert( out != NULL );

       Debug( LDAP_DEBUG_TRACE, ">>> rdnPretty: <%s>\n", val->bv_val ? val->bv_val : "", 0, 0 );

       if ( val->bv_len == 0 ) {
              ber_dupbv_x( out, val, ctx );

       } else if ( val->bv_len > SLAP_LDAPDN_MAXLEN ) {
              return LDAP_INVALID_SYNTAX;

       } else {
              LDAPRDN              rdn = NULL;
              int           rc;
              char*         p;

              /* FIXME: should be liberal in what we accept */
              rc = ldap_bv2rdn_x( val , &rdn, (char **) &p,
                                   LDAP_DN_FORMAT_LDAP, ctx);
              if ( rc != LDAP_SUCCESS ) {
                     return LDAP_INVALID_SYNTAX;
              }

              assert( strlen( val->bv_val ) == val->bv_len );

              /*
               * Schema-aware rewrite
               */
              if ( LDAPRDN_rewrite( rdn, SLAP_LDAPDN_PRETTY, ctx ) != LDAP_SUCCESS ) {
                     ldap_rdnfree_x( rdn, ctx );
                     return LDAP_INVALID_SYNTAX;
              }

              /* FIXME: not sure why the default isn't pretty */
              /* RE: the default is the form that is used as
               * an internal representation; the pretty form
               * is a variant */
              rc = ldap_rdn2bv_x( rdn, out,
                     LDAP_DN_FORMAT_LDAPV3 | LDAP_DN_PRETTY, ctx );

              ldap_rdnfree_x( rdn, ctx );

              if ( rc != LDAP_SUCCESS ) {
                     return LDAP_INVALID_SYNTAX;
              }
       }

       Debug( LDAP_DEBUG_TRACE, "<<< dnPretty: <%s>\n", out->bv_val ? out->bv_val : "", 0, 0 );

       return LDAP_SUCCESS;
}

Here is the call graph for this function:

Here is the caller graph for this function:

int rdnValidate ( Syntax syntax,
struct berval in 
)

Definition at line 182 of file dn.c.

{
       int           rc;
       LDAPRDN              rdn;
       char*         p;

       assert( in != NULL );
       if ( in->bv_len == 0 ) {
              return LDAP_SUCCESS;

       } else if ( in->bv_len > SLAP_LDAPDN_MAXLEN ) {
              return LDAP_INVALID_SYNTAX;
       }

       rc = ldap_bv2rdn_x( in , &rdn, (char **) &p,
                            LDAP_DN_FORMAT_LDAP, NULL);
       if ( rc != LDAP_SUCCESS ) {
              return LDAP_INVALID_SYNTAX;
       }

       assert( strlen( in->bv_val ) == in->bv_len );

       /*
        * Schema-aware validate
        */
       rc = LDAPRDN_validate( rdn );
       ldap_rdnfree( rdn );

       if ( rc != LDAP_SUCCESS ) {
              return LDAP_INVALID_SYNTAX;
       }

       return LDAP_SUCCESS;
}

Here is the call graph for this function:

int register_certificate_map_function ( SLAP_CERT_MAP_FN *  fn)

Definition at line 1283 of file dn.c.

{
#ifdef HAVE_TLS
       if ( DNX509PeerNormalizeCertMap == NULL ) {
              DNX509PeerNormalizeCertMap = fn;
              return 0;
       }
#endif

       return -1;
}

Variable Documentation

Definition at line 56 of file dn.c.