wc_entry
struct wc_entry *e = &wc->entries[b];
struct wc_entry *e = &wc->entries[b];
struct wc_entry *old;
struct wc_entry *current_free;
struct wc_entry *e)
struct wc_entry *e;
struct wc_entry *e, bool search_used)
struct wc_entry *f = writecache_pop_from_freelist(wc, current_cache_sec);
struct wc_entry *f;
f = container_of(next, struct wc_entry, rb_node);
struct wc_entry *e;
struct wc_entry *entries;
struct wc_entry *e;
struct wc_entry *e;
static bool wc_add_block(struct writeback_struct *wb, struct wc_entry *e)
struct wc_entry *e, *f;
e = container_of(wbl->list.prev, struct wc_entry, lru);
wb->wc_list = kmalloc_objs(struct wc_entry *, max_pages,
f = container_of(wbl->list.prev, struct wc_entry, lru);
struct wc_entry *e, *f;
e = container_of(wbl->list.prev, struct wc_entry, lru);
f = container_of(wbl->list.prev, struct wc_entry, lru);
struct wc_entry *f, *g, *e = NULL;
(jiffies - container_of(wc->lru.prev, struct wc_entry, lru)->age >=
e = container_of(rb_first(&wc->tree), struct wc_entry, rb_node);
e = container_of(wc->lru.prev, struct wc_entry, lru);
f = container_of(node, struct wc_entry, rb_node);
g = container_of(next_node, struct wc_entry, rb_node);
g = container_of(next_node, struct wc_entry, rb_node);
struct wc_entry e;
struct wc_entry **wc_list;
struct wc_entry *wc_list_inline[WB_LIST_INLINE];
struct wc_entry *e;
static struct wc_memory_entry *memory_entry(struct dm_writecache *wc, struct wc_entry *e)
static void *memory_data(struct dm_writecache *wc, struct wc_entry *e)
static sector_t cache_sector(struct dm_writecache *wc, struct wc_entry *e)
static uint64_t read_original_sector(struct dm_writecache *wc, struct wc_entry *e)
static uint64_t read_seq_count(struct dm_writecache *wc, struct wc_entry *e)
static void clear_seq_count(struct dm_writecache *wc, struct wc_entry *e)
static void write_original_sector_seq_count(struct dm_writecache *wc, struct wc_entry *e,
static struct wc_entry *writecache_find_entry(struct dm_writecache *wc,
struct wc_entry *e;
e = container_of(node, struct wc_entry, rb_node);
e = container_of(node, struct wc_entry, rb_node);
struct wc_entry *e2;
e2 = container_of(node, struct wc_entry, rb_node);
static void writecache_insert_entry(struct dm_writecache *wc, struct wc_entry *ins)
struct wc_entry *e;
e = container_of(*node, struct wc_entry, rb_node);
static void writecache_unlink(struct dm_writecache *wc, struct wc_entry *e)
static void writecache_add_to_freelist(struct dm_writecache *wc, struct wc_entry *e)
static struct wc_entry *writecache_pop_from_freelist(struct dm_writecache *wc, sector_t expected_sector)
struct wc_entry *e;
wc->current_free = next ? container_of(next, struct wc_entry, rb_node) : NULL;
e = container_of(wc->freelist.next, struct wc_entry, lru);
static void writecache_free_entry(struct dm_writecache *wc, struct wc_entry *e)
static void writecache_flush_entry(struct dm_writecache *wc, struct wc_entry *e)
static bool writecache_entry_is_committed(struct dm_writecache *wc, struct wc_entry *e)
struct wc_entry *e, *e2;
e = container_of(wc->lru.next, struct wc_entry, lru);
e2 = container_of(e->lru.next, struct wc_entry, lru);
e2 = container_of(rb_node, struct wc_entry, rb_node);
e = container_of(e->lru.prev, struct wc_entry, lru);
struct wc_entry *e;
e = container_of(node, struct wc_entry, rb_node);
wc->entries = vmalloc_array(wc->n_blocks, sizeof(struct wc_entry));
struct wc_entry *e = &wc->entries[b];