max_i = nmemb-1;
while (min_i < max_i) {
- size_t test_t;
int r;
test_i = (min_i + max_i) / 2;
r = comp_fn(needle, *(void * const *)(base_p + (size * test_i)));
if (r == 0) {
/* scan back for first element */
- while (test_t > 0 &&
+ while (test_i > 0 &&
comp_fn(needle, *(void * const *)(base_p + (size * (test_i-1)))) == 0) {
test_i--;
}
const struct ldb_message *index_list,
struct dn_list *list)
{
- int ret;
+ int ret = -1;
switch (tree->operation) {
case LDB_OP_SIMPLE:
static int process_file(struct ldb_context *ldb, FILE *f)
{
struct ldb_ldif *ldif;
- int ret, count = 0;
+ int ret = -1, count = 0;
while ((ldif = ldif_read_file(f))) {
switch (ldif->changetype) {