Lines Matching defs:wc_entry
82 struct wc_entry {
116 struct wc_entry *current_free;
154 struct wc_entry *entries;
226 struct wc_entry **wc_list;
228 struct wc_entry *wc_list_inline[WB_LIST_INLINE];
235 struct wc_entry *e;
393 static struct wc_memory_entry *memory_entry(struct dm_writecache *wc, struct wc_entry *e)
398 static void *memory_data(struct dm_writecache *wc, struct wc_entry *e)
403 static sector_t cache_sector(struct dm_writecache *wc, struct wc_entry *e)
409 static uint64_t read_original_sector(struct dm_writecache *wc, struct wc_entry *e)
418 static uint64_t read_seq_count(struct dm_writecache *wc, struct wc_entry *e)
427 static void clear_seq_count(struct dm_writecache *wc, struct wc_entry *e)
435 static void write_original_sector_seq_count(struct dm_writecache *wc, struct wc_entry *e,
607 static struct wc_entry *writecache_find_entry(struct dm_writecache *wc,
610 struct wc_entry *e;
617 e = container_of(node, struct wc_entry, rb_node);
633 e = container_of(node, struct wc_entry, rb_node);
639 struct wc_entry *e2;
647 e2 = container_of(node, struct wc_entry, rb_node);
654 static void writecache_insert_entry(struct dm_writecache *wc, struct wc_entry *ins)
656 struct wc_entry *e;
660 e = container_of(*node, struct wc_entry, rb_node);
673 static void writecache_unlink(struct dm_writecache *wc, struct wc_entry *e)
679 static void writecache_add_to_freelist(struct dm_writecache *wc, struct wc_entry *e)
717 static struct wc_entry *writecache_pop_from_freelist(struct dm_writecache *wc, sector_t expected_sector)
719 struct wc_entry *e;
733 wc->current_free = next ? container_of(next, struct wc_entry, rb_node) : NULL;
737 e = container_of(wc->freelist.next, struct wc_entry, lru);
749 static void writecache_free_entry(struct dm_writecache *wc, struct wc_entry *e)
782 static void writecache_flush_entry(struct dm_writecache *wc, struct wc_entry *e)
789 static bool writecache_entry_is_committed(struct dm_writecache *wc, struct wc_entry *e)
796 struct wc_entry *e, *e2;
805 e = container_of(wc->lru.next, struct wc_entry, lru);
818 e2 = container_of(e->lru.next, struct wc_entry, lru);
841 e2 = container_of(rb_node, struct wc_entry, rb_node);
850 e = container_of(e->lru.prev, struct wc_entry, lru);
883 struct wc_entry *e;
909 e = container_of(node, struct wc_entry, rb_node);
965 wc->entries = vmalloc(array_size(sizeof(struct wc_entry), wc->n_blocks));
969 struct wc_entry *e = &wc->entries[b];
1042 struct wc_entry *e = &wc->entries[b];
1065 struct wc_entry *e = &wc->entries[b];
1075 struct wc_entry *old;
1340 struct wc_entry *e)
1353 struct wc_entry *e;
1383 struct wc_entry *e, bool search_used)
1391 struct wc_entry *f = writecache_pop_from_freelist(wc, current_cache_sec);
1400 struct wc_entry *f;
1405 f = container_of(next, struct wc_entry, rb_node);
1438 struct wc_entry *e;
1686 struct wc_entry *e;
1724 struct wc_entry *e;
1797 static bool wc_add_block(struct writeback_struct *wb, struct wc_entry *e)
1832 struct wc_entry *e, *f;
1839 e = container_of(wbl->list.prev, struct wc_entry, lru);
1852 wb->wc_list = kmalloc_array(max_pages, sizeof(struct wc_entry *),
1867 f = container_of(wbl->list.prev, struct wc_entry, lru);
1896 struct wc_entry *e, *f;
1904 e = container_of(wbl->list.prev, struct wc_entry, lru);
1923 f = container_of(wbl->list.prev, struct wc_entry, lru);
1947 struct wc_entry *f, *g, *e = NULL;
1997 (jiffies - container_of(wc->lru.prev, struct wc_entry, lru)->age >=
2011 e = container_of(rb_first(&wc->tree), struct wc_entry, rb_node);
2015 e = container_of(wc->lru.prev, struct wc_entry, lru);
2022 f = container_of(node, struct wc_entry, rb_node);
2043 g = container_of(next_node, struct wc_entry, rb_node);
2077 g = container_of(next_node, struct wc_entry, rb_node);
2118 struct wc_entry e;