Home
last modified time | relevance | path

Searched refs:s_imap (Results 1 – 6 of 6) sorted by relevance

/fs/omfs/
Dbitmap.c15 sum += nbits - bitmap_weight(sbi->s_imap[i], nbits); in omfs_count_free()
73 set_bit(bit, sbi->s_imap[map]); in set_run()
76 clear_bit(bit, sbi->s_imap[map]); in set_run()
104 if (map >= sbi->s_imap_size || test_and_set_bit(bit, sbi->s_imap[map])) in omfs_allocate_block()
144 bit = find_next_zero_bit(sbi->s_imap[i], bits_per_entry, in omfs_allocate_range()
150 run = count_run(&sbi->s_imap[i], bits_per_entry, in omfs_allocate_range()
Dinode.c267 kfree(sbi->s_imap); in omfs_put_super()
323 sbi->s_imap = kcalloc(array_size, sizeof(unsigned long *), GFP_KERNEL); in omfs_get_imap()
324 if (!sbi->s_imap) in omfs_get_imap()
331 ptr = sbi->s_imap; in omfs_get_imap()
353 kfree(sbi->s_imap[count]); in omfs_get_imap()
355 kfree(sbi->s_imap); in omfs_get_imap()
357 sbi->s_imap = NULL; in omfs_get_imap()
Domfs.h19 unsigned long **s_imap; member
/fs/minix/
Dinode.c51 brelse(sbi->s_imap[i]); in minix_put_super()
55 kfree(sbi->s_imap); in minix_put_super()
245 sbi->s_imap = &map[0]; in minix_fill_super()
250 if (!(sbi->s_imap[i]=sb_bread(s, block))) in minix_fill_super()
260 minix_set_bit(0,sbi->s_imap[0]->b_data); in minix_fill_super()
319 brelse(sbi->s_imap[i]); in minix_fill_super()
322 kfree(sbi->s_imap); in minix_fill_super()
Dbitmap.c204 bh = sbi->s_imap[ino]; in minix_free_inode()
231 bh = sbi->s_imap[i]; in minix_new_inode()
271 return count_free(sbi->s_imap, sb->s_blocksize, bits); in minix_count_free_inodes()
Dminix.h37 struct buffer_head ** s_imap; member