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
586 jl = JOURNAL_LIST_ENTRY(entry->next);
807 jh = JH_ENTRY(list->next);
938 entry = entry->next;
1220 cn = cn->next;
1309 entry = journal->j_journal_list.next;
1507 cn = cn->next;
1557 cn = cn->next;
1647 goto next;
1671 next:
1672 cn = cn->next;
1710 cn = cn->next;
1753 entry = jl->j_list.next;
1813 if (tjl->j_list.next == &journal->j_journal_list)
1815 tjl = JOURNAL_LIST_ENTRY(tjl->j_list.next);
2359 * on a clean unmount, the journal header's next unflushed pointer will be
2363 * After a crash, this starts with the next unflushed transaction, and
3373 cn->next = NULL;
3377 journal->j_last->next = cn;
3442 cn->prev->next = cn->next;
3444 if (cn->next) {
3445 cn->next->prev = cn->prev;
3448 journal->j_first = cn->next;
3642 * freed blocks need to be released will be dealt with by next
3989 struct reiserfs_journal_cnode *cn, *next, *jl_cn;
4129 for (i = 0, cn = journal->j_first; cn; cn = cn->next, i++) {
4140 jl_cn->next = NULL;
4142 last_cn->next = jl_cn;
4232 next = cn->next;
4234 cn = next;
4251 /* reset journal values for the next transaction */
4315 * if the next transaction has any chance of wrapping, flush
4331 * if we don't cross into the next