* 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.
* %End-Header%
*/
+#include "config.h"
#include "resize2fs.h"
struct ext2_extent_entry {
- __u32 old_loc, new_loc;
- int size;
+ __u64 old_loc, new_loc;
+ __u64 size;
};
struct _ext2_extent {
struct ext2_extent_entry *list;
- int cursor;
- int size;
- int num;
- int sorted;
+ __u64 cursor;
+ __u64 size;
+ __u64 num;
+ __u64 sorted;
};
/*
* 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, __u64 size)
{
ext2_extent extent;
errcode_t retval;
-
- retval = ext2fs_get_mem(sizeof(struct _ext2_extent),
- (void **) &extent);
+
+ retval = ext2fs_get_mem(sizeof(struct _ext2_extent), &extent);
if (retval)
return retval;
memset(extent, 0, sizeof(struct _ext2_extent));
extent->num = 0;
extent->sorted = 1;
- retval = ext2fs_get_mem(sizeof(struct ext2_extent_entry) *
- extent->size, (void **) &extent->list);
+ retval = ext2fs_get_array(sizeof(struct ext2_extent_entry),
+ extent->size, &extent->list);
if (retval) {
- ext2fs_free_mem((void **) &extent);
+ ext2fs_free_mem(&extent);
return retval;
}
memset(extent->list, 0,
void ext2fs_free_extent_table(ext2_extent extent)
{
if (extent->list)
- ext2fs_free_mem((void **) &extent->list);
+ ext2fs_free_mem(&extent->list);
extent->list = 0;
extent->size = 0;
extent->num = 0;
- ext2fs_free_mem((void **) &extent);
+ ext2fs_free_mem(&extent);
}
/*
* Add an entry to the extent table
*/
-errcode_t ext2fs_add_extent_entry(ext2_extent extent, __u32 old_loc, __u32 new_loc)
+errcode_t ext2fs_add_extent_entry(ext2_extent extent, __u64 old_loc, __u64 new_loc)
{
struct ext2_extent_entry *ent;
errcode_t retval;
- int newsize;
- int curr;
+ __u64 newsize;
+ __u64 curr;
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) *
- newsize, (void **) &extent->list);
+ retval = ext2fs_resize_mem(sizeof(struct ext2_extent_entry) *
+ extent->size,
+ sizeof(struct ext2_extent_entry) *
+ newsize, &extent->list);
if (retval)
return retval;
extent->size = newsize;
{
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
* and return the new inode number.
*/
-__u32 ext2fs_extent_translate(ext2_extent extent, __u32 old_loc)
+__u64 ext2fs_extent_translate(ext2_extent extent, __u64 old_loc)
{
- int low, high, mid;
- __u32 lowval, highval;
+ __s64 low, high, mid;
+ __u64 lowval, highval;
float range;
if (!extent->sorted) {
range = 0;
else if (old_loc > highval)
range = 1;
- else
+ else {
range = ((float) (old_loc - lowval)) /
(highval - lowval);
- mid = low + ((int) (range * (high-low)));
+ if (range > 0.9)
+ range = 0.9;
+ if (range < 0.1)
+ range = 0.1;
+ }
+ mid = low + ((__u64) (range * (high-low)));
}
#endif
if ((old_loc >= extent->list[mid].old_loc) &&
*/
void ext2fs_extent_dump(ext2_extent extent, FILE *out)
{
- int i;
+ __u64 i;
struct ext2_extent_entry *ent;
-
+
fputs(_("# Extent dump:\n"), out);
- fprintf(out, _("#\tNum=%d, Size=%d, Cursor=%d, Sorted=%d\n"),
+ fprintf(out, _("#\tNum=%llu, Size=%llu, Cursor=%llu, Sorted=%llu\n"),
extent->num, extent->size, extent->cursor, extent->sorted);
for (i=0, ent=extent->list; i < extent->num; i++, ent++) {
- fprintf(out, _("#\t\t %u -> %u (%d)\n"), ent->old_loc,
+ fprintf(out, "#\t\t %llu -> %llu (%llu)\n", ent->old_loc,
ent->new_loc, ent->size);
}
}
/*
* Iterate over the contents of the extent table
*/
-errcode_t ext2fs_iterate_extent(ext2_extent extent, __u32 *old_loc,
- __u32 *new_loc, int *size)
+errcode_t ext2fs_iterate_extent(ext2_extent extent, __u64 *old_loc,
+ __u64 *new_loc, __u64 *size)
{
struct ext2_extent_entry *ent;
-
+
if (!old_loc) {
extent->cursor = 0;
return 0;
*size = ent->size;
return 0;
}
-
-
-
-
+
+
+
+