Lines Matching refs:list
35 struct ea_refcount_el *list;
43 if (refcount->list)
44 ext2fs_free_mem(&refcount->list);
67 retval = ext2fs_get_mem(bytes, &refcount->list);
70 memset(refcount->list, 0, bytes);
90 struct ea_refcount_el *list;
92 list = refcount->list;
94 if (list[i].ea_count) {
96 list[j] = list[i];
109 * insert_refcount_el() --- Insert a new entry into the sorted list at a
129 &refcount->list);
138 memmove(&refcount->list[pos+1], &refcount->list[pos],
142 el = &refcount->list[pos];
151 * information in the sorted list. If the create flag is set,
152 * and we can't find an entry, create one in the sorted list.
161 if (!refcount || !refcount->list)
167 (blk > refcount->list[high].ea_blk))) {
179 if (blk == refcount->list[refcount->cursor].ea_blk)
180 return &refcount->list[refcount->cursor++];
192 lowval = refcount->list[low].ea_blk;
193 highval = refcount->list[high].ea_blk;
205 if (blk == refcount->list[mid].ea_blk) {
207 return &refcount->list[mid];
209 if (blk < refcount->list[mid].ea_blk)
303 struct ea_refcount_el *list;
308 list = refcount->list;
309 if (list[refcount->cursor].ea_count) {
311 *ret = list[refcount->cursor].ea_count;
312 return list[refcount->cursor++].ea_blk;
332 if (refcount->list[i-1].ea_blk >= refcount->list[i].ea_blk) {
333 fprintf(out, "%s: list[%d].blk=%u, list[%d].blk=%u\n",
334 bad, i-1, refcount->list[i-1].ea_blk,
335 i, refcount->list[i].ea_blk);
