Lines Matching defs:size
9 * by align size, should provide fast enough search while maintaining low
47 if (align < 0 || align >= t->size)
49 if (len <= 0 || len > t->size)
60 off_new = find_next_zero_bit(t->map, t->size, offset);
64 if (offset >= t->size)
66 if (count + len > t->size) {
69 "bitmap out: size %d used %d off %d len %d align %d count %d\n",
70 t->size, t->used, offset, len, align, count);
74 if (offset + len > t->size) {
75 count += t->size - offset;
87 (t->map, t->size,
89 if ((t->last_off = offset + len) >= t->size)
98 if ((offset += i + 1) >= t->size)
121 void bit_map_init(struct bit_map *t, unsigned long *map, int size)
123 bitmap_zero(map, size);
127 t->size = size;