e2fsprogs/lib/ext2fs/alloc.c

128 lines
2.6 KiB
C
Raw Normal View History

1997-04-26 17:21:57 +04:00
/*
* alloc.c --- allocate new inodes, blocks for ext2fs
*
1997-04-29 20:15:03 +04:00
* Copyright (C) 1993, 1994, 1995, 1996 Theodore Ts'o.
*
* %Begin-Header%
* This file may be redistributed under the terms of the GNU Public
* License.
* %End-Header%
*
1997-04-26 17:21:57 +04:00
*/
#include <stdio.h>
#include <unistd.h>
#include <stdlib.h>
#include <time.h>
#include <sys/stat.h>
#include <sys/types.h>
1997-04-26 17:58:21 +04:00
#if HAVE_ERRNO_H
#include <errno.h>
#endif
1997-04-26 17:21:57 +04:00
#include <linux/ext2_fs.h>
#include "ext2fs.h"
/*
* Right now, just search forward from the parent directory's block
* group to find the next free inode.
*
* Should have a special policy for directories.
*/
1997-04-26 17:34:30 +04:00
errcode_t ext2fs_new_inode(ext2_filsys fs, ino_t dir, int mode,
ext2fs_inode_bitmap map, ino_t *ret)
1997-04-26 17:21:57 +04:00
{
int dir_group = 0;
ino_t i;
ino_t start_inode;
1997-04-26 17:34:30 +04:00
EXT2_CHECK_MAGIC(fs, EXT2_ET_MAGIC_EXT2FS_FILSYS);
1997-04-26 17:21:57 +04:00
if (!map)
map = fs->inode_map;
if (!map)
return EXT2_ET_NO_INODE_BITMAP;
if (dir > 0)
dir_group = (dir - 1) / EXT2_INODES_PER_GROUP(fs->super);
start_inode = (dir_group * EXT2_INODES_PER_GROUP(fs->super)) + 1;
1997-04-26 18:48:50 +04:00
if (start_inode < EXT2_FIRST_INODE(fs->super))
start_inode = EXT2_FIRST_INODE(fs->super);
1997-04-26 17:21:57 +04:00
i = start_inode;
do {
1997-04-26 17:34:30 +04:00
if (!ext2fs_test_inode_bitmap(map, i))
1997-04-26 17:21:57 +04:00
break;
i++;
if (i > fs->super->s_inodes_count)
1997-04-26 18:48:50 +04:00
i = EXT2_FIRST_INODE(fs->super);
1997-04-26 17:21:57 +04:00
} while (i != start_inode);
1997-04-26 17:34:30 +04:00
if (ext2fs_test_inode_bitmap(map, i))
1997-04-26 17:21:57 +04:00
return ENOSPC;
*ret = i;
return 0;
}
/*
* Stupid algorithm --- we now just search forward starting from the
* goal. Should put in a smarter one someday....
*/
1997-04-26 17:34:30 +04:00
errcode_t ext2fs_new_block(ext2_filsys fs, blk_t goal,
ext2fs_block_bitmap map, blk_t *ret)
1997-04-26 17:21:57 +04:00
{
1997-04-30 01:26:48 +04:00
blk_t i;
1997-04-26 17:21:57 +04:00
1997-04-26 17:34:30 +04:00
EXT2_CHECK_MAGIC(fs, EXT2_ET_MAGIC_EXT2FS_FILSYS);
1997-04-26 17:21:57 +04:00
if (!map)
map = fs->block_map;
if (!map)
return EXT2_ET_NO_BLOCK_BITMAP;
1997-04-30 01:26:48 +04:00
if (!goal || (goal >= fs->super->s_blocks_count))
goal = fs->super->s_first_data_block;
i = goal;
1997-04-26 17:21:57 +04:00
do {
1997-04-26 17:34:30 +04:00
if (!ext2fs_test_block_bitmap(map, i)) {
1997-04-26 17:21:57 +04:00
*ret = i;
return 0;
}
i++;
1997-04-29 20:15:03 +04:00
if (i >= fs->super->s_blocks_count)
1997-04-26 17:21:57 +04:00
i = fs->super->s_first_data_block;
} while (i != goal);
return ENOSPC;
}
errcode_t ext2fs_get_free_blocks(ext2_filsys fs, blk_t start, blk_t finish,
1997-04-26 17:34:30 +04:00
int num, ext2fs_block_bitmap map, blk_t *ret)
1997-04-26 17:21:57 +04:00
{
blk_t b = start;
1997-04-26 17:34:30 +04:00
EXT2_CHECK_MAGIC(fs, EXT2_ET_MAGIC_EXT2FS_FILSYS);
1997-04-26 17:21:57 +04:00
if (!map)
map = fs->block_map;
if (!map)
return EXT2_ET_NO_BLOCK_BITMAP;
if (!b)
b = fs->super->s_first_data_block;
if (!finish)
finish = start;
if (!num)
num = 1;
do {
1997-04-29 20:15:03 +04:00
if (b+num-1 > fs->super->s_blocks_count)
b = fs->super->s_first_data_block;
if (ext2fs_fast_test_block_bitmap_range(map, b, num)) {
1997-04-26 17:21:57 +04:00
*ret = b;
return 0;
}
b++;
} while (b != finish);
return ENOSPC;
}