Branch data Line data Source code
1 : : /* SPDX-License-Identifier: BSD-3-Clause
2 : : * Copyright (C) 2017 Intel Corporation.
3 : : * All rights reserved.
4 : : */
5 : :
6 : : #include "spdk/stdinc.h"
7 : :
8 : : #include "cache_tree.h"
9 : :
10 : : #include "spdk/assert.h"
11 : :
12 : : struct cache_buffer *
13 : 19305990 : tree_find_buffer(struct cache_tree *tree, uint64_t offset)
14 : : {
15 : : uint64_t index;
16 : :
17 [ + + ]: 38337591 : while (tree != NULL) {
18 [ - + - + : 37276189 : index = offset / CACHE_TREE_LEVEL_SIZE(tree->level);
# # # # #
# # # ]
19 [ + + # # ]: 37276189 : if (index >= CACHE_TREE_WIDTH) {
20 : 4384 : return NULL;
21 : : }
22 [ + + # # : 37271805 : if (tree->level == 0) {
# # ]
23 [ # # # # : 18240204 : return tree->u.buffer[index];
# # # # #
# ]
24 : : } else {
25 [ - + # # : 19031601 : offset &= CACHE_TREE_LEVEL_MASK(tree->level);
# # # # #
# ]
26 [ # # # # : 19031601 : tree = tree->u.tree[index];
# # # # ]
27 : : }
28 : : }
29 : :
30 : 1061402 : return NULL;
31 : 46 : }
32 : :
33 : : struct cache_buffer *
34 : 7292617 : tree_find_filled_buffer(struct cache_tree *tree, uint64_t offset)
35 : : {
36 : : struct cache_buffer *buf;
37 : :
38 : 7292617 : buf = tree_find_buffer(tree, offset);
39 [ + + + + : 7292617 : if (buf != NULL && buf->bytes_filled > 0) {
# # # # ]
40 : 6099976 : return buf;
41 : : } else {
42 : 1192641 : return NULL;
43 : : }
44 : 3 : }
45 : :
46 : : struct cache_tree *
47 : 266480 : tree_insert_buffer(struct cache_tree *root, struct cache_buffer *buffer)
48 : : {
49 : : struct cache_tree *tree;
50 : : uint64_t index, offset;
51 : :
52 [ # # # # ]: 266480 : offset = buffer->offset;
53 [ + + + + : 267704 : while (offset >= CACHE_TREE_LEVEL_SIZE(root->level + 1)) {
# # # # #
# # # #
# ]
54 [ + + # # : 1224 : if (root->present_mask != 0) {
# # ]
55 : 593 : tree = calloc(1, sizeof(*tree));
56 [ + + # # ]: 593 : assert(tree != NULL);
57 [ # # # # : 593 : tree->level = root->level + 1;
# # # # #
# ]
58 [ # # # # : 593 : tree->u.tree[0] = root;
# # # # ]
59 : 593 : root = tree;
60 [ # # # # ]: 593 : root->present_mask = 0x1ULL;
61 : 3 : } else {
62 [ # # ]: 631 : root->level++;
63 : : }
64 : : }
65 : :
66 : 266480 : tree = root;
67 [ + + # # : 495243 : while (tree->level > 0) {
# # ]
68 [ - + - + : 228763 : index = offset / CACHE_TREE_LEVEL_SIZE(tree->level);
# # # # #
# # # ]
69 [ + + # # : 228763 : assert(index < CACHE_TREE_WIDTH);
# # ]
70 [ - + # # : 228763 : offset &= CACHE_TREE_LEVEL_MASK(tree->level);
# # # # #
# ]
71 [ + + # # : 228763 : if (tree->u.tree[index] == NULL) {
# # # # #
# ]
72 [ # # # # : 6125 : tree->u.tree[index] = calloc(1, sizeof(*tree));
# # # # ]
73 [ + + # # : 6125 : assert(tree->u.tree[index] != NULL);
# # # # #
# # # ]
74 [ # # # # : 6125 : tree->u.tree[index]->level = tree->level - 1;
# # # # #
# # # # #
# # # # ]
75 [ - + # # : 6125 : tree->present_mask |= (1ULL << index);
# # ]
76 : 5 : }
77 [ # # # # : 228763 : tree = tree->u.tree[index];
# # # # ]
78 : : }
79 : :
80 [ # # # # ]: 266480 : index = offset / CACHE_BUFFER_SIZE;
81 [ + + # # : 266480 : assert(index < CACHE_TREE_WIDTH);
# # ]
82 [ + + # # : 266480 : assert(tree->u.buffer[index] == NULL);
# # # # #
# # # #
# ]
83 [ # # # # : 266480 : tree->u.buffer[index] = buffer;
# # # # #
# ]
84 [ - + # # : 266480 : tree->present_mask |= (1ULL << index);
# # ]
85 : 266480 : return root;
86 : : }
87 : :
88 : : void
89 : 188639 : tree_remove_buffer(struct cache_tree *tree, struct cache_buffer *buffer)
90 : : {
91 : : struct cache_tree *child;
92 : : uint64_t index;
93 : :
94 [ - + # # : 188639 : index = CACHE_TREE_INDEX(tree->level, buffer->offset);
# # # # #
# # # # #
# # ]
95 : :
96 [ + + # # : 188639 : if (tree->level == 0) {
# # ]
97 [ + + # # : 94646 : assert(tree->u.buffer[index] != NULL);
# # # # #
# # # #
# ]
98 [ - + # # : 94646 : assert(buffer == tree->u.buffer[index]);
# # # # #
# # # #
# ]
99 [ - + # # : 94646 : tree->present_mask &= ~(1ULL << index);
# # ]
100 [ # # # # : 94646 : tree->u.buffer[index] = NULL;
# # # # #
# ]
101 : 94646 : cache_buffer_free(buffer);
102 : 94646 : return;
103 : : }
104 : :
105 [ # # # # : 93993 : child = tree->u.tree[index];
# # # # ]
106 [ + + # # ]: 93993 : assert(child != NULL);
107 : 93993 : tree_remove_buffer(child, buffer);
108 [ + + # # : 93993 : if (child->present_mask == 0) {
# # ]
109 [ - + # # : 1272 : tree->present_mask &= ~(1ULL << index);
# # ]
110 [ # # # # : 1272 : tree->u.tree[index] = NULL;
# # # # ]
111 : 1272 : free(child);
112 : 1 : }
113 : 6 : }
114 : :
115 : : void
116 : 8614 : tree_free_buffers(struct cache_tree *tree)
117 : : {
118 : : struct cache_buffer *buffer;
119 : : struct cache_tree *child;
120 : : uint32_t i;
121 : :
122 [ + + # # : 8614 : if (tree->present_mask == 0) {
# # ]
123 : 0 : return;
124 : : }
125 : :
126 [ + + # # : 8614 : if (tree->level == 0) {
# # ]
127 [ + + # # ]: 358735 : for (i = 0; i < CACHE_TREE_WIDTH; i++) {
128 [ # # # # : 353216 : buffer = tree->u.buffer[i];
# # # # #
# ]
129 [ + + + + : 353216 : if (buffer != NULL && buffer->in_progress == false &&
+ + # # #
# # # ]
130 [ + + # # : 171845 : buffer->bytes_filled == buffer->bytes_flushed) {
# # # # ]
131 : 171842 : cache_buffer_free(buffer);
132 [ # # # # : 171842 : tree->u.buffer[i] = NULL;
# # # # #
# ]
133 [ - + # # : 171842 : tree->present_mask &= ~(1ULL << i);
# # ]
134 : 16 : }
135 : 640 : }
136 : 10 : } else {
137 [ + + # # ]: 201175 : for (i = 0; i < CACHE_TREE_WIDTH; i++) {
138 [ # # # # : 198080 : child = tree->u.tree[i];
# # # # ]
139 [ + + ]: 198080 : if (child != NULL) {
140 : 5468 : tree_free_buffers(child);
141 [ + + # # : 5468 : if (child->present_mask == 0) {
# # ]
142 : 5454 : free(child);
143 [ # # # # : 5454 : tree->u.tree[i] = NULL;
# # # # ]
144 [ - + # # : 5454 : tree->present_mask &= ~(1ULL << i);
# # ]
145 : 9 : }
146 : 9 : }
147 : 384 : }
148 : : }
149 : 16 : }
|