Lines Matching refs:size
8 * by align size, should provide fast enough search while maintaining low
46 if (align < 0 || align >= t->size)
48 if (len <= 0 || len > t->size)
59 off_new = find_next_zero_bit(t->map, t->size, offset);
63 if (offset >= t->size)
65 if (count + len > t->size) {
68 "bitmap out: size %d used %d off %d len %d align %d count %d\n",
69 t->size, t->used, offset, len, align, count);
73 if (offset + len > t->size) {
74 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)
124 if ((size & 07) != 0)
126 memset(map, 0, size>>3);
131 t->size = size;