Home
last modified time | relevance | path

Searched refs:cache_buffer (Results 1 – 3 of 3) sorted by relevance

/spdk/lib/blobfs/
H A Dcache_tree.h9 struct cache_buffer { struct
34 struct cache_buffer *buffer[CACHE_TREE_WIDTH]; argument
39 void cache_buffer_free(struct cache_buffer *cache_buffer);
41 struct cache_tree *tree_insert_buffer(struct cache_tree *root, struct cache_buffer *buffer);
43 struct cache_buffer *tree_find_buffer(struct cache_tree *tree, uint64_t offset);
44 struct cache_buffer *tree_find_filled_buffer(struct cache_tree *tree, uint64_t offset);
45 void tree_remove_buffer(struct cache_tree *tree, struct cache_buffer *buffer);
/spdk/test/unit/lib/blobfs/tree.c/
H A Dtree_ut.c11 cache_buffer_free(struct cache_buffer *cache_buffer) in cache_buffer_free() argument
13 free(cache_buffer); in cache_buffer_free()
20 struct cache_buffer *buffer[5]; in blobfs_tree_op_test()
21 struct cache_buffer *tmp_buffer; in blobfs_tree_op_test()
25 buffer[i] = calloc(1, sizeof(struct cache_buffer)); in blobfs_tree_op_test()
/spdk/test/unit/lib/blobfs/blobfs_async_ut/
H A Dblobfs_async_ut.c497 struct cache_buffer *leaf_0_0_4; in tree_find_buffer_ut()
498 struct cache_buffer *leaf_0_12_8; in tree_find_buffer_ut()
499 struct cache_buffer *leaf_9_23_15; in tree_find_buffer_ut()
500 struct cache_buffer *buffer; in tree_find_buffer_ut()
508 leaf_0_0_4 = calloc(1, sizeof(struct cache_buffer)); in tree_find_buffer_ut()
510 leaf_0_12_8 = calloc(1, sizeof(struct cache_buffer)); in tree_find_buffer_ut()
512 leaf_9_23_15 = calloc(1, sizeof(struct cache_buffer)); in tree_find_buffer_ut()