Lines Matching refs:next
159 struct list_head *entry = journal->j_bitmap_nodes.next;
259 struct list_head *next = journal->j_bitmap_nodes.next;
262 while (next != &journal->j_bitmap_nodes) {
263 bn = list_entry(next, struct reiserfs_bitmap_node, list);
264 list_del(next);
267 next = journal->j_bitmap_nodes.next;
341 * Uses the cnode->next and cnode->prev pointers
357 head[0].next = head + 1;
360 head[i].next = head + (i + 1); /* if last one, overwrite it after the if */
362 head[num_cnodes - 1].next = NULL;
383 if (cn->next) {
384 cn->next->prev = NULL;
386 journal->j_cnode_free_list = cn->next;
404 cn->next = journal->j_cnode_free_list;
451 * next_zero_bit is a suggestion about the next block to try for find_forward.
453 * for the next zero bit in the bitmap that rejected bl. Then, we return
457 * reject it on the next call to reiserfs_in_journal
584 jl = JOURNAL_LIST_ENTRY(entry->next);
805 jh = JH_ENTRY(list->next);
936 entry = entry->next;
1221 cn = cn->next;
1310 entry = journal->j_journal_list.next;
1508 cn = cn->next;
1558 cn = cn->next;
1648 goto next;
1672 next:
1673 cn = cn->next;
1711 cn = cn->next;
1754 entry = jl->j_list.next;
1814 if (tjl->j_list.next == &journal->j_journal_list)
1816 tjl = JOURNAL_LIST_ENTRY(tjl->j_list.next);
2361 * on a clean unmount, the journal header's next unflushed pointer will be
2365 * After a crash, this starts with the next unflushed transaction, and
3378 cn->next = NULL;
3382 journal->j_last->next = cn;
3447 cn->prev->next = cn->next;
3449 if (cn->next) {
3450 cn->next->prev = cn->prev;
3453 journal->j_first = cn->next;
3647 * freed blocks need to be released will be dealt with by next
3994 struct reiserfs_journal_cnode *cn, *next, *jl_cn;
4134 for (i = 0, cn = journal->j_first; cn; cn = cn->next, i++) {
4145 jl_cn->next = NULL;
4147 last_cn->next = jl_cn;
4237 next = cn->next;
4239 cn = next;
4256 /* reset journal values for the next transaction */
4320 * if the next transaction has any chance of wrapping, flush
4336 * if we don't cross into the next