/* if not root and candidates exceed to-be-checked entries, abort */
if ( !isroot && limit->lms_s_unchecked != -1 ) {
- if ( BDB_IDL_N(candidates) > limit->lms_s_unchecked ) {
+ if ( BDB_IDL_N(candidates) > (unsigned) limit->lms_s_unchecked ) {
send_search_result( conn, op,
LDAP_UNWILLING_TO_PERFORM,
NULL, NULL, NULL, NULL, 0 );
int i;
bv.bv_len = strlen(dn);
- bv.bv_val = dn;
+ bv.bv_val = (char *) dn;
for (i = 0; be->be_nsuffix[i]; i++) {
if (dn_issuffixbv (&bv, be->be_nsuffix[i]))
op->o_sresult = glue_back_sresult;
op->o_response = glue_back_response;
bv.bv_len = strlen(ndn);
- bv.bv_val = ndn;
+ bv.bv_val = (char *) ndn;
/*
* Execute in reverse order, most general first
#include <ac/string.h>
#include <ac/socket.h>
-#include <ldap_log.h>
-
#include "slap.h"
#include "../../libraries/liblber/lber-int.h"
#include "ldap_utf8.h"
#include "lutil_hash.h"
-/* We should replace MD5 with a faster hash */
#define HASH_BYTES LUTIL_HASH_BYTES
#define HASH_CONTEXT lutil_HASH_CTX
#define HASH_Init(c) lutil_HASHInit(c)