* PowerQuest, Inc.
*
* Copyright (C) 1999, 2000 by Theosore Ts'o
- *
+ *
* %Begin-Header%
* This file may be redistributed under the terms of the GNU Public
* License.
/*
* Create an extent table
*/
-errcode_t ext2fs_create_extent_table(ext2_extent *ret_extent, int size)
+errcode_t ext2fs_create_extent_table(ext2_extent *ret_extent, int size)
{
ext2_extent extent;
errcode_t retval;
-
+
retval = ext2fs_get_mem(sizeof(struct _ext2_extent), &extent);
if (retval)
return retval;
if (extent->num >= extent->size) {
newsize = extent->size + 100;
- retval = ext2fs_resize_mem(sizeof(struct ext2_extent_entry) *
- extent->size,
- sizeof(struct ext2_extent_entry) *
+ retval = ext2fs_resize_mem(sizeof(struct ext2_extent_entry) *
+ extent->size,
+ sizeof(struct ext2_extent_entry) *
newsize, &extent->list);
if (retval)
return retval;
{
const struct ext2_extent_entry *db_a;
const struct ext2_extent_entry *db_b;
-
+
db_a = (const struct ext2_extent_entry *) a;
db_b = (const struct ext2_extent_entry *) b;
-
+
return (db_a->old_loc - db_b->old_loc);
-}
+}
/*
* Given an inode map and inode number, look up the old inode number
range = 0;
else if (old_loc > highval)
range = 1;
- else
+ else
range = ((float) (old_loc - lowval)) /
(highval - lowval);
mid = low + ((int) (range * (high-low)));
{
int i;
struct ext2_extent_entry *ent;
-
+
fputs(_("# Extent dump:\n"), out);
fprintf(out, _("#\tNum=%d, Size=%d, Cursor=%d, Sorted=%d\n"),
extent->num, extent->size, extent->cursor, extent->sorted);
__u32 *new_loc, int *size)
{
struct ext2_extent_entry *ent;
-
+
if (!old_loc) {
extent->cursor = 0;
return 0;
*size = ent->size;
return 0;
}
-
-
-
-
+
+
+
+