mirror/openldap
2
0
Fork 0
mirror of https://git.openldap.org/openldap/openldap.git synced 2024-12-27 03:20:22 +08:00
Code Issues Packages Projects Releases Wiki Activity
8aee3e5113
openldap/servers/slapd/limits.c
Pierangelo Masarati 6b8828ed28 handle trivial cases
2002-04-29 19:14:42 +00:00

504 lines
10 KiB
C
Raw Blame History

/* limits.c - routines to handle regex-based size and time limits */
/*
* Copyright 1998-2002 The OpenLDAP Foundation, All Rights Reserved.
* COPYING RESTRICTIONS APPLY, see COPYRIGHT file
*/
#include "portable.h"
#include <stdio.h>
#include <ac/regex.h>
#include <ac/string.h>
#include "slap.h"
int
get_limits(
Backend *be,
struct berval *ndn,
struct slap_limits_set **limit
)
{
struct slap_limits **lm;
assert( be );
assert( limit );
/*
* default values
*/
*limit = &be->be_def_limit;
if ( be->be_limits == NULL ) {
return( 0 );
}
for ( lm = be->be_limits; lm[0] != NULL; lm++ ) {
switch ( lm[0]->lm_type ) {
case SLAP_LIMITS_EXACT:
if ( ndn->bv_len == 0 ) {
break;
}
if ( dn_match( &lm[0]->lm_dn_pat, ndn ) ) {
*limit = &lm[0]->lm_limits;
return( 0 );
}
break;
case SLAP_LIMITS_ONE:
case SLAP_LIMITS_SUBTREE:
case SLAP_LIMITS_CHILDREN: {
size_t d;
if ( ndn->bv_len == 0 ) {
break;
}
/* ndn shorter than dn_pat */
if ( ndn->bv_len < lm[0]->lm_dn_pat.bv_len ) {
break;
}
d = ndn->bv_len - lm[0]->lm_dn_pat.bv_len;
/* allow exact match for SUBTREE only */
if ( d == 0 ) {
if ( lm[0]->lm_type != SLAP_LIMITS_SUBTREE ) {
break;
}
} else {
/* check for unescaped rdn separator */
if ( !DN_SEPARATOR( ndn->bv_val[d-1] ) ) {
break;
}
}
/* in case of (sub)match ... */
if ( lm[0]->lm_dn_pat.bv_len == ( ndn->bv_len - d )
&& strcmp( lm[0]->lm_dn_pat.bv_val, &ndn->bv_val[d] ) == 0 ) {
/* check for exactly one rdn in case of ONE */
if ( lm[0]->lm_type == SLAP_LIMITS_ONE ) {
/*
* if ndn is more that one rdn
* below dn_pat, continue
*/
if ( (size_t) dn_rdnlen( NULL, ndn ) != d - 1 ) {
break;
}
}
*limit = &lm[0]->lm_limits;
return( 0 );
}
break;
}
case SLAP_LIMITS_REGEX:
if ( ndn->bv_len == 0 ) {
break;
}
if ( regexec( &lm[0]->lm_dn_regex, ndn->bv_val, 0, NULL, 0 )
== 0 )
{
*limit = &lm[0]->lm_limits;
return( 0 );
}
break;
case SLAP_LIMITS_ANONYMOUS:
if ( ndn->bv_len == 0 ) {
*limit = &lm[0]->lm_limits;
return( 0 );
}
break;
case SLAP_LIMITS_USERS:
if ( ndn->bv_len != 0 ) {
*limit = &lm[0]->lm_limits;
return( 0 );
}
break;
case SLAP_LIMITS_ANY:
*limit = &lm[0]->lm_limits;
return( 0 );
default:
assert( 0 ); /* unreachable */
return( -1 );
}
}
return( 0 );
}
static int
add_limits(
Backend *be,
int type,
const char *pattern,
struct slap_limits_set *limit
)
{
int i;
struct slap_limits *lm;
assert( be );
assert( limit );
lm = ( struct slap_limits * )ch_calloc( sizeof( struct slap_limits ), 1 );
switch ( type ) {
case SLAP_LIMITS_EXACT:
case SLAP_LIMITS_ONE:
case SLAP_LIMITS_SUBTREE:
case SLAP_LIMITS_CHILDREN:
lm->lm_type = type;
{
int rc;
struct berval bv;
bv.bv_val = (char *) pattern;
bv.bv_len = strlen( pattern );
rc = dnNormalize2( NULL, &bv, &lm->lm_dn_pat );
if ( rc != LDAP_SUCCESS ) {
ch_free( lm );
return( -1 );
}
}
break;
case SLAP_LIMITS_REGEX:
case SLAP_LIMITS_UNDEFINED:
lm->lm_type = SLAP_LIMITS_REGEX;
ber_str2bv( pattern, 0, 1, &lm->lm_dn_pat );
if ( regcomp( &lm->lm_dn_regex, lm->lm_dn_pat.bv_val,
REG_EXTENDED | REG_ICASE ) ) {
free( lm->lm_dn_pat.bv_val );
ch_free( lm );
return( -1 );
}
break;
case SLAP_LIMITS_ANONYMOUS:
case SLAP_LIMITS_USERS:
case SLAP_LIMITS_ANY:
lm->lm_type = type;
lm->lm_dn_pat.bv_val = NULL;
lm->lm_dn_pat.bv_len = 0;
break;
}
lm->lm_limits = *limit;
i = 0;
if ( be->be_limits != NULL ) {
for ( ; be->be_limits[i]; i++ );
}
be->be_limits = ( struct slap_limits ** )ch_realloc( be->be_limits,
sizeof( struct slap_limits * ) * ( i + 2 ) );
be->be_limits[i] = lm;
be->be_limits[i+1] = NULL;
return( 0 );
}
int
parse_limits(
Backend *be,
const char *fname,
int lineno,
int argc,
char **argv
)
{
int type = SLAP_LIMITS_UNDEFINED;
char *pattern;
struct slap_limits_set limit;
int i;
assert( be );
if ( argc < 3 ) {
#ifdef NEW_LOGGING
LDAP_LOG(( "config", LDAP_LEVEL_CRIT,
"%s : line %d: missing arg(s) in "
"\"limits <pattern> <limits>\" line.\n",
fname, lineno ));
#else
Debug( LDAP_DEBUG_ANY,
"%s : line %d: missing arg(s) in "
"\"limits <pattern> <limits>\" line.\n%s",
fname, lineno, "" );
#endif
return( -1 );
}
limit = be->be_def_limit;
/*
* syntax:
*
* "limits" <pattern> <limit> [ ... ]
*
*
* <pattern>:
*
* "anonymous"
* "users"
* [ "dn" [ "." { "exact" | "base" | "one" | "sub" | children"
* | "regex" | "anonymous" } ] "=" ] <dn pattern>
*
* Note:
* "exact" and "base" are the same (exact match);
* "one" means exactly one rdn below, NOT including the pattern
* "sub" means any rdn below, including the pattern
* "children" means any rdn below, NOT including the pattern
*
* "anonymous" may be deprecated in favour
* of the pattern = "anonymous" form
*
*
* <limit>:
*
* "time" [ "." { "soft" | "hard" } ] "=" <integer>
*
* "size" [ "." { "soft" | "hard" | "unchecked" } ] "=" <integer>
*/
pattern = argv[1];
if ( strcmp( pattern, "*" ) == 0) {
type = SLAP_LIMITS_ANY;
} else if ( strcasecmp( pattern, "anonymous" ) == 0 ) {
type = SLAP_LIMITS_ANONYMOUS;
} else if ( strcasecmp( pattern, "users" ) == 0 ) {
type = SLAP_LIMITS_USERS;
} else if ( strncasecmp( pattern, "dn", 2 ) == 0 ) {
pattern += 2;
if ( pattern[0] == '.' ) {
pattern++;
if ( strncasecmp( pattern, "exact", 5 ) == 0 ) {
type = SLAP_LIMITS_EXACT;
pattern += 5;
} else if ( strncasecmp( pattern, "base", 4 ) == 0 ) {
type = SLAP_LIMITS_BASE;
pattern += 4;
} else if ( strncasecmp( pattern, "one", 3 ) == 0 ) {
type = SLAP_LIMITS_ONE;
pattern += 3;
} else if ( strncasecmp( pattern, "subtree", 7 ) == 0 ) {
type = SLAP_LIMITS_SUBTREE;
pattern += 7;
} else if ( strncasecmp( pattern, "children", 8 ) == 0 ) {
type = SLAP_LIMITS_CHILDREN;
pattern += 8;
} else if ( strncasecmp( pattern, "regex", 5 ) == 0 ) {
type = SLAP_LIMITS_REGEX;
pattern += 5;
/*
* this could be deprecated in favour
* of the pattern = "anonymous" form
*/
} else if ( strncasecmp( pattern, "anonymous", 9 ) == 0 ) {
type = SLAP_LIMITS_ANONYMOUS;
pattern = NULL;
}
}
/* pre-check the data */
switch ( type ) {
case SLAP_LIMITS_ANONYMOUS:
case SLAP_LIMITS_USERS:
/* no need for pattern */
pattern = NULL;
break;
default:
if ( pattern[0] != '=' ) {
#ifdef NEW_LOGGING
LDAP_LOG(( "config", LDAP_LEVEL_CRIT,
"%s : line %d: missing '=' in "
"\"dn[.{exact|base|one|subtree"
"|children|regex|anonymous}]"
"=<pattern>\" in "
"\"limits <pattern> <limits>\" line.\n",
fname, lineno ));
#else
Debug( LDAP_DEBUG_ANY,
"%s : line %d: missing '=' in "
"\"dn[.{exact|base|one|subtree"
"|children|regex|anonymous}]"
"=<pattern>\" in "
"\"limits <pattern> <limits>\" "
"line.\n%s",
fname, lineno, "" );
#endif
return( -1 );
}
/* skip '=' (required) */
pattern++;
/* trim obvious cases */
if ( strcmp( pattern, "*" ) == 0 ) {
type = SLAP_LIMITS_ANY;
pattern = NULL;
} else if ( ( type == SLAP_LIMITS_REGEX || type == SLAP_LIMITS_UNDEFINED )
&& strcmp( pattern, ".*" ) == 0 ) {
type = SLAP_LIMITS_ANY;
pattern = NULL;
}
}
}
/* get the limits */
for ( i = 2; i < argc; i++ ) {
if ( parse_limit( argv[i], &limit ) ) {
#ifdef NEW_LOGGING
LDAP_LOG(( "config", LDAP_LEVEL_CRIT,
"%s : line %d: unknown limit type \"%s\" in "
"\"limits <pattern> <limits>\" line.\n",
fname, lineno, argv[i] ));
#else
Debug( LDAP_DEBUG_ANY,
"%s : line %d: unknown limit type \"%s\" in "
"\"limits <pattern> <limits>\" line.\n",
fname, lineno, argv[i] );
#endif
return( 1 );
}
}
/*
* sanity checks ...
*/
if ( limit.lms_t_hard > 0 && limit.lms_t_hard < limit.lms_t_soft ) {
limit.lms_t_hard = limit.lms_t_soft;
}
if ( limit.lms_s_hard > 0 && limit.lms_s_hard < limit.lms_s_soft ) {
limit.lms_s_hard = limit.lms_s_soft;
}
return( add_limits( be, type, pattern, &limit ) );
}
int
parse_limit(
const char *arg,
struct slap_limits_set *limit
)
{
assert( arg );
assert( limit );
if ( strncasecmp( arg, "time", 4 ) == 0 ) {
arg += 4;
if ( arg[0] == '.' ) {
arg++;
if ( strncasecmp( arg, "soft", 4 ) == 0 ) {
arg += 4;
if ( arg[0] != '=' ) {
return( 1 );
}
arg++;
limit->lms_t_soft = atoi( arg );
} else if ( strncasecmp( arg, "hard", 4 ) == 0 ) {
arg += 4;
if ( arg[0] != '=' ) {
return( 1 );
}
arg++;
if ( strcasecmp( arg, "soft" ) == 0 ) {
limit->lms_t_hard = 0;
} else if ( strcasecmp( arg, "none" ) == 0 ) {
limit->lms_t_hard = -1;
} else {
limit->lms_t_hard = atoi( arg );
}
} else {
return( 1 );
}
} else if ( arg[0] == '=' ) {
limit->lms_t_soft = atoi( arg );
limit->lms_t_hard = 0;
} else {
return( 1 );
}
} else if ( strncasecmp( arg, "size", 4 ) == 0 ) {
arg += 4;
if ( arg[0] == '.' ) {
arg++;
if ( strncasecmp( arg, "soft", 4 ) == 0 ) {
arg += 4;
if ( arg[0] != '=' ) {
return( 1 );
}
arg++;
limit->lms_s_soft = atoi( arg );
} else if ( strncasecmp( arg, "hard", 4 ) == 0 ) {
arg += 4;
if ( arg[0] != '=' ) {
return( 1 );
}
arg++;
if ( strcasecmp( arg, "soft" ) == 0 ) {
limit->lms_s_hard = 0;
} else if ( strcasecmp( arg, "none" ) == 0 ) {
limit->lms_s_hard = -1;
} else {
limit->lms_s_hard = atoi( arg );
}
} else if ( strncasecmp( arg, "unchecked", 9 ) == 0 ) {
arg += 9;
if ( arg[0] != '=' ) {
return( 1 );
}
arg++;
if ( strcasecmp( arg, "none" ) == 0 ) {
limit->lms_s_unchecked = -1;
} else {
limit->lms_s_unchecked = atoi( arg );
}
} else {
return( 1 );
}
} else if ( arg[0] == '=' ) {
limit->lms_s_soft = atoi( arg );
limit->lms_s_hard = 0;
} else {
return( 1 );
}
}
return 0;
}
Reference in New Issue View Git Blame Copy Permalink