Lines Matching defs:extent
2 * extent.c --- ext2 extent abstraction
36 * Create an extent table
40 ext2_extent extent;
43 retval = ext2fs_get_mem(sizeof(struct _ext2_extent), &extent);
46 memset(extent, 0, sizeof(struct _ext2_extent));
48 extent->size = size ? size : 50;
49 extent->cursor = 0;
50 extent->num = 0;
51 extent->sorted = 1;
54 extent->size, &extent->list);
56 ext2fs_free_mem(&extent);
59 memset(extent->list, 0,
60 sizeof(struct ext2_extent_entry) * extent->size);
61 *ret_extent = extent;
66 * Free an extent table
68 void ext2fs_free_extent_table(ext2_extent extent)
70 if (extent->list)
71 ext2fs_free_mem(&extent->list);
72 extent->list = 0;
73 extent->size = 0;
74 extent->num = 0;
75 ext2fs_free_mem(&extent);
79 * Add an entry to the extent table
81 errcode_t ext2fs_add_extent_entry(ext2_extent extent, __u64 old_loc, __u64 new_loc)
88 if (extent->num >= extent->size) {
89 newsize = extent->size + 100;
91 extent->size,
93 newsize, &extent->list);
96 extent->size = newsize;
98 curr = extent->num;
99 ent = extent->list + curr;
103 * extent
115 extent->sorted = 0;
121 extent->num++;
143 __u64 ext2fs_extent_translate(ext2_extent extent, __u64 old_loc)
149 if (!extent->sorted) {
150 qsort(extent->list, extent->num,
152 extent->sorted = 1;
155 high = extent->num-1;
164 lowval = extent->list[low].old_loc;
165 highval = extent->list[high].old_loc;
182 if ((old_loc >= extent->list[mid].old_loc) &&
183 (old_loc < extent->list[mid].old_loc + extent->list[mid].size))
184 return (extent->list[mid].new_loc +
185 (old_loc - extent->list[mid].old_loc));
186 if (old_loc < extent->list[mid].old_loc)
197 void ext2fs_extent_dump(ext2_extent extent, FILE *out)
204 extent->num, extent->size, extent->cursor, extent->sorted);
205 for (i=0, ent=extent->list; i < extent->num; i++, ent++) {
212 * Iterate over the contents of the extent table
214 errcode_t ext2fs_iterate_extent(ext2_extent extent, __u64 *old_loc,
220 extent->cursor = 0;
224 if (extent->cursor >= extent->num) {
231 ent = extent->list + extent->cursor++;