Lines Matching defs:prev
284 /* Space required for the prev pointers */
297 kfree(t->prev);
299 free_pages((unsigned long) t->prev,
310 t->prev = NULL;
335 t->prev = bset_prev_bytes(b) < PAGE_SIZE
338 if (!t->prev)
521 * bits we're going to store in bkey_float->mantissa. t->prev[j] stores the size
551 return (void *) (((uint64_t *) tree_to_bkey(t, j)) - t->prev[j]);
556 * maintain a full search tree, we just keep a simple lookup table in t->prev.
560 return cacheline_to_bkey(t, cacheline, t->prev[cacheline]);
644 t->prev = t[-1].prev + j;
661 t->prev[0] = bkey_to_cacheline_offset(t, 0, t->data->start);
693 struct bkey *prev = NULL, *k = t->data->start;
716 prev = k, k = bkey_next(k);
718 t->prev[j] = bkey_u64s(prev);
806 t->prev[j] += shift;
808 if (t->prev[j] > 7) {
814 t->prev[j] = bkey_to_cacheline_offset(t, j, k);
827 t->prev[t->size] =
879 struct bkey *m, *prev = NULL;
905 prev = m, m = bkey_next(m);
907 /* prev is in the tree, if we merge we're done */
909 if (prev &&
910 bch_bkey_try_merge(b, prev, k))