* the dispose list, removing them from LRU and hash table.
*/
start = s->ls_purge_start;
- bnr = (nr == ~0) ? -1 : nr / CFS_HASH_NBKT(s->ls_obj_hash) + 1;
+ bnr = (nr == ~0) ? -1 : nr / (int)CFS_HASH_NBKT(s->ls_obj_hash) + 1;
again:
/*
* It doesn't make any sense to make purge threads parallel, that can
/**
* Return desired hash table order.
*/
-static unsigned int lu_htable_order(struct lu_device *top)
+static unsigned long lu_htable_order(struct lu_device *top)
{
unsigned long bits_max = LU_SITE_BITS_MAX;
unsigned long cache_size;
- unsigned int bits;
+ unsigned long bits;
/*
* Calculate hash table size, assuming that we want reasonable
memset(s, 0, sizeof(*s));
mutex_init(&s->ls_purge_mutex);
- snprintf(name, 16, "lu_site_%s", top->ld_type->ldt_name);
+ snprintf(name, sizeof(name), "lu_site_%s", top->ld_type->ldt_name);
for (bits = lu_htable_order(top); bits >= LU_SITE_BITS_MIN; bits--) {
s->ls_obj_hash = cfs_hash_create(name, bits, bits,
bits - LU_SITE_BKT_BITS,