Lines Matching refs:seq
103 * i->j.seq, the node on head has the smallest (oldest)
104 * journal seq, the node on tail has the biggest
105 * (latest) journal seq.
110 * i->j.seq < j->last_seq, it means the oldest jset
118 if (i->j.seq >= j->last_seq)
126 if (j->seq == i->j.seq)
130 * if j->seq is less than any i->j.last_seq
133 if (j->seq < i->j.last_seq)
140 if (j->seq > i->j.seq) {
158 if (j->seq > ja->seq[bucket_index])
159 ja->seq[bucket_index] = j->seq;
186 uint64_t seq;
232 seq = list_entry(list->prev, struct journal_replay,
233 list)->j.seq;
238 if (seq != list_entry(list->prev, struct journal_replay,
239 list)->j.seq)
267 seq = 0;
270 if (ja->seq[i] > seq) {
271 seq = ja->seq[i];
285 c->journal.seq = list_entry(list->prev,
287 list)->j.seq;
299 uint64_t last = j->seq;
309 BUG_ON(last < i->j.seq);
312 while (last-- != i->j.seq)
356 uint64_t start = i->j.last_seq, end = i->j.seq, n = start;
362 if (n != i->j.seq) {
365 n, i->j.seq - 1, start, end);
368 n, i->j.seq - 1, start, end);
393 n = i->j.seq + 1;
397 pr_info("journal replay done, %i keys in %i entries, seq %llu\n",
569 #define last_seq(j) ((j)->seq - fifo_used(&(j)->pin) + 1)
667 ja->seq[ja->last_idx] < last_seq)
703 * The fifo_push() needs to happen at the same time as j->seq is
709 j->cur->data->seq = ++j->seq;
808 ca->journal.seq[ca->journal.cur_idx] = w->data->seq;