return NULL;
}
- i = abs(self->hash_fn(obj_new, OBJ_SEARCH_OBJECT));
- i %= self->n_buckets;
+ i = abs(self->hash_fn(obj_new, OBJ_SEARCH_OBJECT) % self->n_buckets);
__ao2_ref(obj_new, +1, tag ?: "Container node creation", file, line, func);
node->common.obj = obj_new;
case OBJ_SEARCH_OBJECT:
case OBJ_SEARCH_KEY:
/* we know hash can handle this case */
- bucket_cur = abs(self->hash_fn(arg, flags & OBJ_SEARCH_MASK));
- bucket_cur %= self->n_buckets;
+ bucket_cur = abs(self->hash_fn(arg, flags & OBJ_SEARCH_MASK)
+ % self->n_buckets);
state->sort_fn = self->common.sort_fn;
break;
case OBJ_SEARCH_PARTIAL_KEY:
++count_obj;
/* Check container hash key for expected bucket. */
- bucket_exp = abs(self->hash_fn(node->common.obj, OBJ_SEARCH_OBJECT));
- bucket_exp %= self->n_buckets;
+ bucket_exp = abs(self->hash_fn(node->common.obj, OBJ_SEARCH_OBJECT)
+ % self->n_buckets);
if (bucket != bucket_exp) {
ast_log(LOG_ERROR, "Bucket %d node hashes to bucket %d!\n",
bucket, bucket_exp);