btree.h (e5451c8f8330e03ad3cfa16048b4daf961af434f) btree.h (be628be09563f8f6e81929efbd7cf3f45c344416)
1#ifndef _BCACHE_BTREE_H
2#define _BCACHE_BTREE_H
3
4/*
5 * THE BTREE:
6 *
7 * At a high level, bcache's btree is relatively standard b+ tree. All keys and
8 * pointers are in the leaves; interior nodes only have pointers to the child

--- 246 unchanged lines hidden (view full) ---

255int bch_gc_thread_start(struct cache_set *);
256void bch_initial_gc_finish(struct cache_set *);
257void bch_moving_gc(struct cache_set *);
258int bch_btree_check(struct cache_set *);
259void bch_initial_mark_key(struct cache_set *, int, struct bkey *);
260
261static inline void wake_up_gc(struct cache_set *c)
262{
1#ifndef _BCACHE_BTREE_H
2#define _BCACHE_BTREE_H
3
4/*
5 * THE BTREE:
6 *
7 * At a high level, bcache's btree is relatively standard b+ tree. All keys and
8 * pointers are in the leaves; interior nodes only have pointers to the child

--- 246 unchanged lines hidden (view full) ---

255int bch_gc_thread_start(struct cache_set *);
256void bch_initial_gc_finish(struct cache_set *);
257void bch_moving_gc(struct cache_set *);
258int bch_btree_check(struct cache_set *);
259void bch_initial_mark_key(struct cache_set *, int, struct bkey *);
260
261static inline void wake_up_gc(struct cache_set *c)
262{
263 if (c->gc_thread)
264 wake_up_process(c->gc_thread);
263 wake_up(&c->gc_wait);
265}
266
267#define MAP_DONE 0
268#define MAP_CONTINUE 1
269
270#define MAP_ALL_NODES 0
271#define MAP_LEAF_NODES 1
272

--- 38 unchanged lines hidden --- 		264}
265
266#define MAP_DONE 0
267#define MAP_CONTINUE 1
268
269#define MAP_ALL_NODES 0
270#define MAP_LEAF_NODES 1
271

--- 38 unchanged lines hidden ---