Lines Matching full:list
32 struct ea_refcount_el *list;
40 if (refcount->list)
41 ext2fs_free_mem(&refcount->list);
64 retval = ext2fs_get_mem(bytes, &refcount->list);
67 memset(refcount->list, 0, bytes);
87 struct ea_refcount_el *list;
89 list = refcount->list;
91 if (list[i].ea_count) {
93 list[j] = list[i];
106 * insert_refcount_el() --- Insert a new entry into the sorted list at a
126 &refcount->list);
135 memmove(&refcount->list[pos+1], &refcount->list[pos],
139 el = &refcount->list[pos];
148 * information in the sorted list. If the create flag is set,
149 * and we can't find an entry, create one in the sorted list.
158 if (!refcount || !refcount->list)
164 (blk > refcount->list[high].ea_blk))) {
176 if (blk == refcount->list[refcount->cursor].ea_blk)
177 return &refcount->list[refcount->cursor++];
189 lowval = refcount->list[low].ea_blk;
190 highval = refcount->list[high].ea_blk;
202 if (blk == refcount->list[mid].ea_blk) {
204 return &refcount->list[mid];
206 if (blk < refcount->list[mid].ea_blk)
300 struct ea_refcount_el *list;
305 list = refcount->list;
306 if (list[refcount->cursor].ea_count) {
308 *ret = list[refcount->cursor].ea_count;
309 return list[refcount->cursor++].ea_blk;
329 if (refcount->list[i-1].ea_blk >= refcount->list[i].ea_blk) {
330 fprintf(out, "%s: list[%d].blk=%u, list[%d].blk=%u\n",
331 bad, i-1, refcount->list[i-1].ea_blk,
332 i, refcount->list[i].ea_blk);
