/* limits.c - routines to handle regex-based size and time limits */ /* $OpenLDAP$ */ /* This work is part of OpenLDAP Software . * * Copyright 1998-2004 The OpenLDAP Foundation. * All rights reserved. * * Redistribution and use in source and binary forms, with or without * modification, are permitted only as authorized by the OpenLDAP * Public License. * * A copy of this license is available in the file LICENSE in the * top-level directory of the distribution or, alternatively, at * . */ #include "portable.h" #include #include #include #include "slap.h" /* define to get an error if requesting limit higher than hard */ #undef ABOVE_HARD_LIMIT_IS_ERROR static char * limits2str( unsigned i ) { switch ( i ) { case SLAP_LIMITS_UNDEFINED: return "UNDEFINED"; case SLAP_LIMITS_EXACT: return "EXACT"; case SLAP_LIMITS_ONE: return "ONELEVEL"; case SLAP_LIMITS_SUBTREE: return "SUBTREE"; case SLAP_LIMITS_CHILDREN: return "CHILDREN"; case SLAP_LIMITS_REGEX: return "REGEX"; case SLAP_LIMITS_ANONYMOUS: return "ANONYMOUS"; case SLAP_LIMITS_USERS: return "USERS"; case SLAP_LIMITS_ANY: return "ANY"; default: return "UNKNOWN"; } } int limits_get( Operation *op, struct berval *ndn, struct slap_limits_set **limit ) { struct slap_limits **lm; assert( op ); assert( limit ); Debug( LDAP_DEBUG_TRACE, "==> limits_get: conn=%lu op=%lu dn=\"%s\"\n", op->o_connid, op->o_opid, BER_BVISNULL( ndn ) ? "[anonymous]" : ndn->bv_val ); /* * default values */ *limit = &op->o_bd->be_def_limit; if ( op->o_bd->be_limits == NULL ) { return( 0 ); } for ( lm = op->o_bd->be_limits; lm[0] != NULL; lm++ ) { unsigned style = lm[0]->lm_flags & SLAP_LIMITS_MASK; unsigned type = lm[0]->lm_flags & SLAP_LIMITS_TYPE_MASK; switch ( style ) { case SLAP_LIMITS_EXACT: if ( ndn->bv_len == 0 ) { break; } if ( type == SLAP_LIMITS_TYPE_GROUP ) { int rc; rc = backend_group( op, NULL, &lm[0]->lm_pat, ndn, lm[0]->lm_group_oc, lm[0]->lm_group_ad ); if ( rc == 0 ) { *limit = &lm[0]->lm_limits; Debug( LDAP_DEBUG_TRACE, "<== limits_get: type=GROUP match=EXACT " "dn=\"%s\" oc=\"%s\" ad=\"%s\"\n", lm[0]->lm_pat.bv_val, lm[0]->lm_group_oc->soc_cname.bv_val, lm[0]->lm_group_ad->ad_cname.bv_val ); return( 0 ); } } else { if ( dn_match( &lm[0]->lm_pat, ndn ) ) { *limit = &lm[0]->lm_limits; Debug( LDAP_DEBUG_TRACE, "<== limits_get: type=DN match=EXACT dn=\"%s\"\n", lm[0]->lm_pat.bv_val, 0, 0 ); 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_pat.bv_len ) { break; } d = ndn->bv_len - lm[0]->lm_pat.bv_len; /* allow exact match for SUBTREE only */ if ( d == 0 ) { if ( style != 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_pat.bv_len == ( ndn->bv_len - d ) && strcmp( lm[0]->lm_pat.bv_val, &ndn->bv_val[d] ) == 0 ) { /* check for exactly one rdn in case of ONE */ if ( style == 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; Debug( LDAP_DEBUG_TRACE, "<== limits_get: type=DN match=%s dn=\"%s\"\n", limits2str( style ), lm[0]->lm_pat.bv_val, 0 ); return( 0 ); } break; } case SLAP_LIMITS_REGEX: if ( ndn->bv_len == 0 ) { break; } if ( regexec( &lm[0]->lm_regex, ndn->bv_val, 0, NULL, 0 ) == 0 ) { *limit = &lm[0]->lm_limits; Debug( LDAP_DEBUG_TRACE, "<== limits_get: type=DN match=%s dn=\"%s\"\n", limits2str( style ), lm[0]->lm_pat.bv_val, 0 ); return( 0 ); } break; case SLAP_LIMITS_ANONYMOUS: if ( ndn->bv_len == 0 ) { Debug( LDAP_DEBUG_TRACE, "<== limits_get: type=DN match=%s\n", limits2str( style ), 0, 0 ); *limit = &lm[0]->lm_limits; return( 0 ); } break; case SLAP_LIMITS_USERS: if ( ndn->bv_len != 0 ) { *limit = &lm[0]->lm_limits; Debug( LDAP_DEBUG_TRACE, "<== limits_get: type=DN match=%s\n", limits2str( style ), 0, 0 ); return( 0 ); } break; case SLAP_LIMITS_ANY: *limit = &lm[0]->lm_limits; return( 0 ); default: assert( 0 ); /* unreachable */ return( -1 ); } } return( 0 ); } static int limits_add( Backend *be, unsigned flags, const char *pattern, ObjectClass *group_oc, AttributeDescription *group_ad, struct slap_limits_set *limit ) { int i; struct slap_limits *lm; unsigned type, style; assert( be ); assert( limit ); type = flags & SLAP_LIMITS_TYPE_MASK; style = flags & SLAP_LIMITS_MASK; switch ( style ) { case SLAP_LIMITS_ANONYMOUS: case SLAP_LIMITS_USERS: case SLAP_LIMITS_ANY: for ( i = 0; be->be_limits && be->be_limits[ i ]; i++ ) { if ( be->be_limits[ i ]->lm_flags == style ) { return( -1 ); } } break; } lm = ( struct slap_limits * )ch_calloc( sizeof( struct slap_limits ), 1 ); switch ( style ) { case SLAP_LIMITS_UNDEFINED: style = SLAP_LIMITS_EXACT; /* continue to next cases */ case SLAP_LIMITS_EXACT: case SLAP_LIMITS_ONE: case SLAP_LIMITS_SUBTREE: case SLAP_LIMITS_CHILDREN: lm->lm_flags = style | type; { int rc; struct berval bv; bv.bv_val = (char *) pattern; bv.bv_len = strlen( pattern ); rc = dnNormalize( 0, NULL, NULL, &bv, &lm->lm_pat, NULL ); if ( rc != LDAP_SUCCESS ) { ch_free( lm ); return( -1 ); } } break; case SLAP_LIMITS_REGEX: lm->lm_flags = style | type; ber_str2bv( pattern, 0, 1, &lm->lm_pat ); if ( regcomp( &lm->lm_regex, lm->lm_pat.bv_val, REG_EXTENDED | REG_ICASE ) ) { free( lm->lm_pat.bv_val ); ch_free( lm ); return( -1 ); } break; case SLAP_LIMITS_ANONYMOUS: case SLAP_LIMITS_USERS: case SLAP_LIMITS_ANY: lm->lm_flags = style | type; lm->lm_pat.bv_val = NULL; lm->lm_pat.bv_len = 0; break; } switch ( type ) { case SLAP_LIMITS_TYPE_GROUP: assert( group_oc ); assert( group_ad ); lm->lm_group_oc = group_oc; lm->lm_group_ad = group_ad; 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 limits_parse( Backend *be, const char *fname, int lineno, int argc, char **argv ) { int flags = SLAP_LIMITS_UNDEFINED; char *pattern; struct slap_limits_set limit; int i, rc = 0; ObjectClass *group_oc = NULL; AttributeDescription *group_ad = NULL; assert( be ); if ( argc < 3 ) { Debug( LDAP_DEBUG_ANY, "%s : line %d: missing arg(s) in " "\"limits \" line.\n%s", fname, lineno, "" ); return( -1 ); } limit = be->be_def_limit; /* * syntax: * * "limits" [ ... ] * * * : * * "anonymous" * "users" * [ "dn" [ "." { "exact" | "base" | "onelevel" | "subtree" | children" * | "regex" | "anonymous" } ] "=" ] * * Note: * "exact" and "base" are the same (exact match); * "onelevel" means exactly one rdn below, NOT including pattern * "subtree" means any rdn below, including pattern * "children" means any rdn below, NOT including pattern * * "anonymous" may be deprecated in favour * of the pattern = "anonymous" form * * "group[/objectClass[/attributeType]]" "=" "" * * : * * "time" [ "." { "soft" | "hard" } ] "=" * * "size" [ "." { "soft" | "hard" | "unchecked" } ] "=" */ pattern = argv[1]; if ( strcmp( pattern, "*" ) == 0) { flags = SLAP_LIMITS_ANY; } else if ( strcasecmp( pattern, "anonymous" ) == 0 ) { flags = SLAP_LIMITS_ANONYMOUS; } else if ( strcasecmp( pattern, "users" ) == 0 ) { flags = SLAP_LIMITS_USERS; } else if ( strncasecmp( pattern, "dn", STRLENOF( "dn" ) ) == 0 ) { pattern += STRLENOF( "dn" ); if ( pattern[0] == '.' ) { pattern++; if ( strncasecmp( pattern, "exact", STRLENOF( "exact" )) == 0 ) { flags = SLAP_LIMITS_EXACT; pattern += STRLENOF( "exact" ); } else if ( strncasecmp( pattern, "base", STRLENOF( "base" ) ) == 0 ) { flags = SLAP_LIMITS_BASE; pattern += STRLENOF( "base" ); } else if ( strncasecmp( pattern, "one", STRLENOF( "one" ) ) == 0 ) { flags = SLAP_LIMITS_ONE; pattern += STRLENOF( "one" ); if ( strncasecmp( pattern, "level", STRLENOF( "level" ) ) == 0 ) { pattern += STRLENOF( "level" ); } else { Debug( LDAP_DEBUG_ANY, "%s : line %d: deprecated \"one\" style " "\"limits \" line; " "use \"onelevel\" instead.\n", fname, lineno, 0 ); } } else if ( strncasecmp( pattern, "sub", STRLENOF( "sub" ) ) == 0 ) { flags = SLAP_LIMITS_SUBTREE; pattern += STRLENOF( "sub" ); if ( strncasecmp( pattern, "tree", STRLENOF( "tree" ) ) == 0 ) { pattern += STRLENOF( "tree" ); } else { Debug( LDAP_DEBUG_ANY, "%s : line %d: deprecated \"sub\" style " "\"limits \" line; " "use \"subtree\" instead.\n", fname, lineno, 0 ); } } else if ( strncasecmp( pattern, "children", STRLENOF( "children" ) ) == 0 ) { flags = SLAP_LIMITS_CHILDREN; pattern += STRLENOF( "children" ); } else if ( strncasecmp( pattern, "regex", STRLENOF( "regex" ) ) == 0 ) { flags = SLAP_LIMITS_REGEX; pattern += STRLENOF( "regex" ); /* * this could be deprecated in favour * of the pattern = "anonymous" form */ } else if ( strncasecmp( pattern, "anonymous", STRLENOF( "anonymous" ) ) == 0 ) { flags = SLAP_LIMITS_ANONYMOUS; pattern = NULL; } } /* pre-check the data */ switch ( flags ) { case SLAP_LIMITS_ANONYMOUS: case SLAP_LIMITS_USERS: /* no need for pattern */ pattern = NULL; break; default: if ( pattern[0] != '=' ) { Debug( LDAP_DEBUG_ANY, "%s : line %d: missing '=' in " "\"dn[.{exact|base|onelevel|subtree" "|children|regex|anonymous}]" "=\" in " "\"limits \" " "line.\n%s", fname, lineno, "" ); return( -1 ); } /* skip '=' (required) */ pattern++; /* trim obvious cases */ if ( strcmp( pattern, "*" ) == 0 ) { flags = SLAP_LIMITS_ANY; pattern = NULL; } else if ( flags == SLAP_LIMITS_REGEX && strcmp( pattern, ".*" ) == 0 ) { flags = SLAP_LIMITS_ANY; pattern = NULL; } } } else if (strncasecmp( pattern, "group", STRLENOF( "group" ) ) == 0 ) { pattern += STRLENOF( "group" ); if ( pattern[0] == '/' ) { struct berval oc, ad; oc.bv_val = pattern + 1; ad.bv_val = strchr(pattern, '/'); if ( ad.bv_val != NULL ) { const char *text = NULL; int rc; oc.bv_len = ad.bv_val - oc.bv_val; ad.bv_val++; ad.bv_len = strlen( ad.bv_val ); rc = slap_bv2ad( &ad, &group_ad, &text ); if ( rc != LDAP_SUCCESS ) { goto no_ad; } pattern = ad.bv_val + ad.bv_len; } else { oc.bv_len = strlen( oc.bv_val ); pattern = oc.bv_val + oc.bv_len; } group_oc = oc_bvfind( &oc ); if ( group_oc == NULL ) { goto no_oc; } } if ( group_oc == NULL ) { group_oc = oc_find( SLAPD_GROUP_CLASS ); if ( group_oc == NULL ) { no_oc:; return( -1 ); } } if ( group_ad == NULL ) { const char *text = NULL; int rc; rc = slap_str2ad( SLAPD_GROUP_ATTR, &group_ad, &text ); if ( rc != LDAP_SUCCESS ) { no_ad:; return( -1 ); } } flags = SLAP_LIMITS_TYPE_GROUP | SLAP_LIMITS_EXACT; if ( pattern[0] != '=' ) { Debug( LDAP_DEBUG_ANY, "%s : line %d: missing '=' in " "\"group[/objectClass[/attributeType]]" "=\" in " "\"limits \" line.\n", fname, lineno, 0 ); return( -1 ); } /* skip '=' (required) */ pattern++; } /* get the limits */ for ( i = 2; i < argc; i++ ) { if ( limits_parse_one( argv[i], &limit ) ) { Debug( LDAP_DEBUG_ANY, "%s : line %d: unknown limit values \"%s\" in " "\"limits \" line.\n", fname, lineno, argv[i] ); return( 1 ); } } /* * sanity checks ... * * FIXME: add warnings? */ if ( limit.lms_t_hard > 0 && ( limit.lms_t_hard < limit.lms_t_soft || limit.lms_t_soft == -1 ) ) { 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_soft == -1 ) ) { limit.lms_s_hard = limit.lms_s_soft; } /* * defaults ... * * lms_t_hard: * -1 => no limits * 0 => same as soft * > 0 => limit (in seconds) * * lms_s_hard: * -1 => no limits * 0 0> same as soft * > 0 => limit (in entries) * * lms_s_pr_total: * -2 => disable the control * -1 => no limits * 0 => same as soft * > 0 => limit (in entries) * * lms_s_pr: * -1 => no limits * 0 => no limits? * > 0 => limit size (in entries) */ if ( limit.lms_s_pr_total > 0 && limit.lms_s_pr > limit.lms_s_pr_total ) { limit.lms_s_pr = limit.lms_s_pr_total; } rc = limits_add( be, flags, pattern, group_oc, group_ad, &limit ); if ( rc ) { Debug( LDAP_DEBUG_ANY, "%s : line %d: unable to add limit in " "\"limits \" line.\n", fname, lineno, 0 ); } return( rc ); } int limits_parse_one( const char *arg, struct slap_limits_set *limit ) { assert( arg ); assert( limit ); if ( strncasecmp( arg, "time", STRLENOF( "time" ) ) == 0 ) { arg += STRLENOF( "time" ); if ( arg[0] == '.' ) { arg++; if ( strncasecmp( arg, "soft=", STRLENOF( "soft=" ) ) == 0 ) { arg += STRLENOF( "soft=" ); if ( strcasecmp( arg, "unlimited" ) == 0 || strcasecmp( arg, "none" ) == 0 ) { limit->lms_t_soft = -1; } else { char *next = NULL; int soft = strtol( arg, &next, 10 ); if ( next == arg || next[ 0 ] != '\0' ) { return( 1 ); } if ( soft < -1 ) { return( 1 ); } if ( soft == -1 ) { /* FIXME: use "unlimited" instead; issue warning? */ } limit->lms_t_soft = soft; } } else if ( strncasecmp( arg, "hard=", STRLENOF( "hard=" ) ) == 0 ) { arg += STRLENOF( "hard=" ); if ( strcasecmp( arg, "soft" ) == 0 ) { limit->lms_t_hard = 0; } else if ( strcasecmp( arg, "unlimited" ) == 0 || strcasecmp( arg, "none" ) == 0 ) { limit->lms_t_hard = -1; } else { char *next = NULL; int hard = strtol( arg, &next, 10 ); if ( next == arg || next[ 0 ] != '\0' ) { return( 1 ); } if ( hard < -1 ) { return( 1 ); } if ( hard == -1 ) { /* FIXME: use "unlimited" instead */ } if ( hard == 0 ) { /* FIXME: use "soft" instead */ } limit->lms_t_hard = hard; } } else { return( 1 ); } } else if ( arg[0] == '=' ) { arg++; if ( strcasecmp( arg, "unlimited" ) == 0 || strcasecmp( arg, "none" ) == 0 ) { limit->lms_t_soft = -1; } else { char *next = NULL; limit->lms_t_soft = strtol( arg, &next, 10 ); if ( next == arg || limit->lms_t_soft < -1 ) { return( 1 ); } } limit->lms_t_hard = 0; } else { return( 1 ); } } else if ( strncasecmp( arg, "size", STRLENOF( "size" ) ) == 0 ) { arg += STRLENOF( "size" ); if ( arg[0] == '.' ) { arg++; if ( strncasecmp( arg, "soft=", STRLENOF( "soft=" ) ) == 0 ) { arg += STRLENOF( "soft=" ); if ( strcasecmp( arg, "unlimited" ) == 0 || strcasecmp( arg, "none" ) == 0 ) { limit->lms_s_soft = -1; } else { char *next = NULL; int soft = strtol( arg, &next, 10 ); if ( next == arg || next[ 0 ] != '\0' ) { return( 1 ); } if ( soft < -1 ) { return( 1 ); } if ( soft == -1 ) { /* FIXME: use "unlimited" instead */ } limit->lms_s_soft = soft; } } else if ( strncasecmp( arg, "hard=", STRLENOF( "hard=" ) ) == 0 ) { arg += STRLENOF( "hard=" ); if ( strcasecmp( arg, "soft" ) == 0 ) { limit->lms_s_hard = 0; } else if ( strcasecmp( arg, "unlimited" ) == 0 || strcasecmp( arg, "none" ) == 0 ) { limit->lms_s_hard = -1; } else { char *next = NULL; int hard = strtol( arg, &next, 10 ); if ( next == arg || next[ 0 ] != '\0' ) { return( 1 ); } if ( hard < -1 ) { return( 1 ); } if ( hard == -1 ) { /* FIXME: use "unlimited" instead */ } if ( hard == 0 ) { /* FIXME: use "soft" instead */ } limit->lms_s_hard = hard; } } else if ( strncasecmp( arg, "unchecked=", STRLENOF( "unchecked=" ) ) == 0 ) { arg += STRLENOF( "unchecked=" ); if ( strcasecmp( arg, "unlimited" ) == 0 || strcasecmp( arg, "none" ) == 0 ) { limit->lms_s_unchecked = -1; } else if ( strcasecmp( arg, "disabled" ) == 0 ) { limit->lms_s_unchecked = 0; } else { char *next = NULL; int unchecked = strtol( arg, &next, 10 ); if ( next == arg || next[ 0 ] != '\0' ) { return( 1 ); } if ( unchecked < -1 ) { return( 1 ); } if ( unchecked == -1 ) { /* FIXME: use "unlimited" instead */ } limit->lms_s_unchecked = unchecked; } } else if ( strncasecmp( arg, "pr=", STRLENOF( "pr=" ) ) == 0 ) { arg += STRLENOF( "pr=" ); if ( strcasecmp( arg, "noEstimate" ) == 0 ) { limit->lms_s_pr_hide = 1; } else if ( strcasecmp( arg, "unlimited" ) == 0 || strcasecmp( arg, "none" ) == 0 ) { limit->lms_s_pr = -1; } else { char *next = NULL; int pr = strtol( arg, &next, 10 ); if ( next == arg || next[ 0 ] != '\0' ) { return( 1 ); } if ( pr < -1 ) { return( 1 ); } if ( pr == -1 ) { /* FIXME: use "unlimited" instead */ } limit->lms_s_pr = pr; } } else if ( strncasecmp( arg, "prtotal=", STRLENOF( "prtotal=" ) ) == 0 ) { arg += STRLENOF( "prtotal=" ); if ( strcasecmp( arg, "unlimited" ) == 0 || strcasecmp( arg, "none" ) == 0 ) { limit->lms_s_pr_total = -1; } else if ( strcasecmp( arg, "disabled" ) == 0 ) { limit->lms_s_pr_total = -2; } else if ( strcasecmp( arg, "hard" ) == 0 ) { limit->lms_s_pr_total = 0; } else { char *next = NULL; int total; total = strtol( arg, &next, 10 ); if ( next == arg || next[ 0 ] != '\0' ) { return( 1 ); } if ( total < -1 ) { return( 1 ); } if ( total == -1 ) { /* FIXME: use "unlimited" instead */ } if ( total == 0 ) { /* FIXME: use "pr=disable" instead */ } limit->lms_s_pr_total = total; } } else { return( 1 ); } } else if ( arg[0] == '=' ) { arg++; if ( strcasecmp( arg, "unlimited" ) == 0 || strcasecmp( arg, "none" ) == 0 ) { limit->lms_s_soft = -1; } else { char *next = NULL; limit->lms_s_soft = strtol( arg, &next, 10 ); if ( next == arg || limit->lms_s_soft < -1 ) { return( 1 ); } } limit->lms_s_hard = 0; } else { return( 1 ); } } return 0; } int limits_check( Operation *op, SlapReply *rs ) { assert( op ); assert( rs ); /* FIXME: should this be always true? */ assert( op->o_tag == LDAP_REQ_SEARCH); /* protocol only allows 0..maxInt; * * internal searches: * - may use SLAP_NO_LIMIT ( = -1 ) to indicate no limits; * - should use slimit = N and tlimit = SLAP_NO_LIMIT to * indicate searches that should return exactly N matches, * and handle errors thru a callback (see for instance * slap_sasl_match() and slap_sasl2dn()) */ if ( op->ors_tlimit == SLAP_NO_LIMIT && op->ors_slimit == SLAP_NO_LIMIT ) { return 0; } /* allow root to set no limit */ if ( be_isroot( op ) ) { op->ors_limit = NULL; if ( op->ors_tlimit == 0 ) { op->ors_tlimit = SLAP_NO_LIMIT; } if ( op->ors_slimit == 0 ) { op->ors_slimit = SLAP_NO_LIMIT; } /* if not root, get appropriate limits */ } else { ( void ) limits_get( op, &op->o_ndn, &op->ors_limit ); assert( op->ors_limit != NULL ); /* if no limit is required, use soft limit */ if ( op->ors_tlimit == 0 ) { op->ors_tlimit = op->ors_limit->lms_t_soft; /* limit required: check if legal */ } else { if ( op->ors_limit->lms_t_hard == 0 ) { if ( op->ors_limit->lms_t_soft > 0 && ( op->ors_tlimit > op->ors_limit->lms_t_soft ) ) { op->ors_tlimit = op->ors_limit->lms_t_soft; } } else if ( op->ors_limit->lms_t_hard > 0 ) { #ifdef ABOVE_HARD_LIMIT_IS_ERROR if ( op->ors_tlimit == SLAP_MAX_LIMIT ) { op->ors_tlimit = op->ors_limit->lms_t_hard; } else if ( op->ors_tlimit > op->ors_limit->lms_t_hard ) { /* error if exceeding hard limit */ rs->sr_err = LDAP_ADMINLIMIT_EXCEEDED; send_ldap_result( op, rs ); rs->sr_err = LDAP_SUCCESS; return -1; } #else /* ! ABOVE_HARD_LIMIT_IS_ERROR */ if ( op->ors_tlimit > op->ors_limit->lms_t_hard ) { op->ors_tlimit = op->ors_limit->lms_t_hard; } #endif /* ! ABOVE_HARD_LIMIT_IS_ERROR */ } } /* else leave as is */ /* don't even get to backend if candidate check is disabled */ if ( op->ors_limit->lms_s_unchecked == 0 ) { rs->sr_err = LDAP_ADMINLIMIT_EXCEEDED; send_ldap_result( op, rs ); rs->sr_err = LDAP_SUCCESS; return -1; } /* if paged results is requested */ if ( get_pagedresults( op ) > SLAP_NO_CONTROL ) { int slimit = -2; int pr_total; /* paged results is not allowed */ if ( op->ors_limit->lms_s_pr_total == -2 ) { rs->sr_err = LDAP_ADMINLIMIT_EXCEEDED; rs->sr_text = "pagedResults control not allowed"; send_ldap_result( op, rs ); rs->sr_err = LDAP_SUCCESS; rs->sr_text = NULL; return -1; } if ( op->ors_limit->lms_s_pr > 0 && op->o_pagedresults_size > op->ors_limit->lms_s_pr ) { rs->sr_err = LDAP_ADMINLIMIT_EXCEEDED; rs->sr_text = "illegal pagedResults page size"; send_ldap_result( op, rs ); rs->sr_err = LDAP_SUCCESS; rs->sr_text = NULL; return -1; } if ( op->ors_limit->lms_s_pr_total == 0 ) { if ( op->ors_limit->lms_s_hard == 0 ) { pr_total = op->ors_limit->lms_s_soft; } else { pr_total = op->ors_limit->lms_s_hard; } } else { pr_total = op->ors_limit->lms_s_pr_total; } if ( pr_total == -1 ) { if ( op->ors_slimit == 0 || op->ors_slimit == SLAP_MAX_LIMIT ) { slimit = -1; } else { slimit = op->ors_slimit - op->o_pagedresults_state.ps_count; } #ifdef ABOVE_HARD_LIMIT_IS_ERROR } else if ( pr_total > 0 && op->ors_slimit != SLAP_MAX_LIMIT && ( op->ors_slimit == SLAP_NO_LIMIT || op->ors_slimit > pr_total ) ) { rs->sr_err = LDAP_ADMINLIMIT_EXCEEDED; send_ldap_result( op, rs ); rs->sr_err = LDAP_SUCCESS; return -1; #endif /* ! ABOVE_HARD_LIMIT_IS_ERROR */ } else { /* if no limit is required, use soft limit */ int total; int slimit2; /* first round of pagedResults: set count to any appropriate limit */ /* if the limit is set, check that it does not violate any server-side limit */ #ifdef ABOVE_HARD_LIMIT_IS_ERROR if ( op->ors_slimit == SLAP_MAX_LIMIT ) { slimit2 = op->ors_slimit = pr_total; #else /* ! ABOVE_HARD_LIMIT_IS_ERROR */ if ( op->ors_slimit == SLAP_MAX_LIMIT || op->ors_slimit > pr_total ) { slimit2 = op->ors_slimit = pr_total; #endif /* ! ABOVE_HARD_LIMIT_IS_ERROR */ } else if ( op->ors_slimit == 0 ) { slimit2 = pr_total; } else { slimit2 = op->ors_slimit; } total = slimit2 - op->o_pagedresults_state.ps_count; if ( total >= 0 ) { if ( op->ors_limit->lms_s_pr > 0 ) { /* use the smallest limit set by total/per page */ if ( total < op->ors_limit->lms_s_pr ) { slimit = total; } else { /* use the perpage limit if any * NOTE: + 1 because the given value must be legal */ slimit = op->ors_limit->lms_s_pr + 1; } } else { /* use the total limit if any */ slimit = total; } } else if ( op->ors_limit->lms_s_pr > 0 ) { /* use the perpage limit if any * NOTE: + 1 because the given value must be legal */ slimit = op->ors_limit->lms_s_pr + 1; } else { /* use the standard hard/soft limit if any */ slimit = op->ors_limit->lms_s_hard; } } /* if got any limit, use it */ if ( slimit != -2 ) { if ( op->ors_slimit == 0 ) { op->ors_slimit = slimit; } else if ( slimit > 0 ) { if ( op->ors_slimit - op->o_pagedresults_state.ps_count > slimit ) { rs->sr_err = LDAP_ADMINLIMIT_EXCEEDED; send_ldap_result( op, rs ); rs->sr_err = LDAP_SUCCESS; return -1; } op->ors_slimit = slimit; } } else { /* use the standard hard/soft limit if any */ op->ors_slimit = pr_total; } /* no limit requested: use soft, whatever it is */ } else if ( op->ors_slimit == 0 ) { op->ors_slimit = op->ors_limit->lms_s_soft; /* limit requested: check if legal */ } else { /* hard limit as soft (traditional behavior) */ if ( op->ors_limit->lms_s_hard == 0 ) { if ( op->ors_limit->lms_s_soft > 0 && op->ors_slimit > op->ors_limit->lms_s_soft ) { op->ors_slimit = op->ors_limit->lms_s_soft; } /* explicit hard limit: error if violated */ } else if ( op->ors_limit->lms_s_hard > 0 ) { #ifdef ABOVE_HARD_LIMIT_IS_ERROR if ( op->ors_slimit == SLAP_MAX_LIMIT ) { op->ors_slimit = op->ors_limit->lms_s_hard; } else if ( op->ors_slimit > op->ors_limit->lms_s_hard ) { /* if limit exceeds hard, error */ rs->sr_err = LDAP_ADMINLIMIT_EXCEEDED; send_ldap_result( op, rs ); rs->sr_err = LDAP_SUCCESS; return -1; } #else /* ! ABOVE_HARD_LIMIT_IS_ERROR */ if ( op->ors_slimit > op->ors_limit->lms_s_hard ) { op->ors_slimit = op->ors_limit->lms_s_hard; } #endif /* ! ABOVE_HARD_LIMIT_IS_ERROR */ } } /* else leave as is */ } return 0; }