Lines Matching defs:wc_entry
79 struct wc_entry {
116 struct wc_entry *current_free;
153 struct wc_entry *entries;
207 struct wc_entry **wc_list;
209 struct wc_entry *wc_list_inline[WB_LIST_INLINE];
216 struct wc_entry *e;
371 static struct wc_memory_entry *memory_entry(struct dm_writecache *wc, struct wc_entry *e)
376 static void *memory_data(struct dm_writecache *wc, struct wc_entry *e)
381 static sector_t cache_sector(struct dm_writecache *wc, struct wc_entry *e)
387 static uint64_t read_original_sector(struct dm_writecache *wc, struct wc_entry *e)
396 static uint64_t read_seq_count(struct dm_writecache *wc, struct wc_entry *e)
405 static void clear_seq_count(struct dm_writecache *wc, struct wc_entry *e)
413 static void write_original_sector_seq_count(struct dm_writecache *wc, struct wc_entry *e,
587 static struct wc_entry *writecache_find_entry(struct dm_writecache *wc,
590 struct wc_entry *e;
597 e = container_of(node, struct wc_entry, rb_node);
612 e = container_of(node, struct wc_entry, rb_node);
619 struct wc_entry *e2;
626 e2 = container_of(node, struct wc_entry, rb_node);
633 static void writecache_insert_entry(struct dm_writecache *wc, struct wc_entry *ins)
635 struct wc_entry *e;
639 e = container_of(*node, struct wc_entry, rb_node);
652 static void writecache_unlink(struct dm_writecache *wc, struct wc_entry *e)
658 static void writecache_add_to_freelist(struct dm_writecache *wc, struct wc_entry *e)
695 static struct wc_entry *writecache_pop_from_freelist(struct dm_writecache *wc, sector_t expected_sector)
697 struct wc_entry *e;
710 wc->current_free = next ? container_of(next, struct wc_entry, rb_node) : NULL;
714 e = container_of(wc->freelist.next, struct wc_entry, lru);
726 static void writecache_free_entry(struct dm_writecache *wc, struct wc_entry *e)
759 static void writecache_flush_entry(struct dm_writecache *wc, struct wc_entry *e)
766 static bool writecache_entry_is_committed(struct dm_writecache *wc, struct wc_entry *e)
773 struct wc_entry *e, *e2;
782 e = container_of(wc->lru.next, struct wc_entry, lru);
795 e2 = container_of(e->lru.next, struct wc_entry, lru);
818 e2 = container_of(rb_node, struct wc_entry, rb_node);
827 e = container_of(e->lru.prev, struct wc_entry, lru);
859 struct wc_entry *e;
885 e = container_of(node, struct wc_entry, rb_node);
940 wc->entries = vmalloc(array_size(sizeof(struct wc_entry), wc->n_blocks));
944 struct wc_entry *e = &wc->entries[b];
1016 struct wc_entry *e = &wc->entries[b];
1038 struct wc_entry *e = &wc->entries[b];
1047 struct wc_entry *old;
1290 struct wc_entry *e;
1416 struct wc_entry *f = writecache_pop_from_freelist(wc, current_cache_sec);
1424 struct wc_entry *f;
1428 f = container_of(next, struct wc_entry, rb_node);
1560 struct wc_entry *e;
1598 struct wc_entry *e;
1671 static bool wc_add_block(struct writeback_struct *wb, struct wc_entry *e, gfp_t gfp)
1706 struct wc_entry *e, *f;
1713 e = container_of(wbl->list.prev, struct wc_entry, lru);
1725 unlikely(!(wb->wc_list = kmalloc_array(max_pages, sizeof(struct wc_entry *),
1738 f = container_of(wbl->list.prev, struct wc_entry, lru);
1766 struct wc_entry *e, *f;
1774 e = container_of(wbl->list.prev, struct wc_entry, lru);
1793 f = container_of(wbl->list.prev, struct wc_entry, lru);
1817 struct wc_entry *f, *g, *e = NULL;
1846 (jiffies - container_of(wc->lru.prev, struct wc_entry, lru)->age >=
1859 e = container_of(rb_first(&wc->tree), struct wc_entry, rb_node);
1863 e = container_of(wc->lru.prev, struct wc_entry, lru);
1870 f = container_of(node, struct wc_entry, rb_node);
1893 g = container_of(next_node, struct wc_entry, rb_node);
1928 g = container_of(next_node, struct wc_entry, rb_node);
1968 struct wc_entry e;