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 "spdk/blobfs.h"
9 : : #include "cache_tree.h"
10 : :
11 : : #include "spdk/queue.h"
12 : : #include "spdk/assert.h"
13 : : #include "spdk/env.h"
14 : : #include "spdk/log.h"
15 : :
16 : : struct cache_buffer *
17 : 88761644 : tree_find_buffer(struct cache_tree *tree, uint64_t offset)
18 : : {
19 : : uint64_t index;
20 : :
21 [ + + ]: 178152286 : while (tree != NULL) {
22 [ - + - + : 175092649 : index = offset / CACHE_TREE_LEVEL_SIZE(tree->level);
# # # # #
# # # ]
23 [ + + # # ]: 175092649 : if (index >= CACHE_TREE_WIDTH) {
24 : 25114 : return NULL;
25 : : }
26 [ + + # # : 175067535 : if (tree->level == 0) {
# # ]
27 [ # # # # : 85676893 : return tree->u.buffer[index];
# # # # #
# ]
28 : : } else {
29 [ - + # # : 89390642 : offset &= CACHE_TREE_LEVEL_MASK(tree->level);
# # # # #
# ]
30 [ # # # # : 89390642 : tree = tree->u.tree[index];
# # # # ]
31 : : }
32 : : }
33 : :
34 : 3059637 : return NULL;
35 : 0 : }
36 : :
37 : : struct cache_buffer *
38 : 31879209 : tree_find_filled_buffer(struct cache_tree *tree, uint64_t offset)
39 : : {
40 : : struct cache_buffer *buf;
41 : :
42 : 31879209 : buf = tree_find_buffer(tree, offset);
43 [ + + + + : 31879209 : if (buf != NULL && buf->bytes_filled > 0) {
# # # # ]
44 : 28469457 : return buf;
45 : : } else {
46 : 3409752 : return NULL;
47 : : }
48 : 0 : }
49 : :
50 : : struct cache_tree *
51 : 1231660 : tree_insert_buffer(struct cache_tree *root, struct cache_buffer *buffer)
52 : : {
53 : : struct cache_tree *tree;
54 : : uint64_t index, offset;
55 : :
56 [ # # # # ]: 1231660 : offset = buffer->offset;
57 [ + + + + : 1237643 : while (offset >= CACHE_TREE_LEVEL_SIZE(root->level + 1)) {
# # # # #
# # # #
# ]
58 [ + + # # : 5983 : if (root->present_mask != 0) {
# # ]
59 : 2761 : tree = calloc(1, sizeof(*tree));
60 [ - + # # ]: 2761 : assert(tree != NULL);
61 [ # # # # : 2761 : tree->level = root->level + 1;
# # # # #
# ]
62 [ # # # # : 2761 : tree->u.tree[0] = root;
# # # # ]
63 : 2761 : root = tree;
64 [ # # # # ]: 2761 : root->present_mask = 0x1ULL;
65 : 0 : } else {
66 [ # # ]: 3222 : root->level++;
67 : : }
68 : : }
69 : :
70 : 1231660 : tree = root;
71 [ + + # # : 2292427 : while (tree->level > 0) {
# # ]
72 [ - + - + : 1060767 : index = offset / CACHE_TREE_LEVEL_SIZE(tree->level);
# # # # #
# # # ]
73 [ - + # # : 1060767 : assert(index < CACHE_TREE_WIDTH);
# # ]
74 [ - + # # : 1060767 : offset &= CACHE_TREE_LEVEL_MASK(tree->level);
# # # # #
# ]
75 [ + + # # : 1060767 : if (tree->u.tree[index] == NULL) {
# # # # #
# ]
76 [ # # # # : 23411 : tree->u.tree[index] = calloc(1, sizeof(*tree));
# # # # ]
77 [ - + # # : 23411 : assert(tree->u.tree[index] != NULL);
# # # # #
# # # ]
78 [ # # # # : 23411 : tree->u.tree[index]->level = tree->level - 1;
# # # # #
# # # # #
# # # # ]
79 [ - + # # : 23411 : tree->present_mask |= (1ULL << index);
# # ]
80 : 0 : }
81 [ # # # # : 1060767 : tree = tree->u.tree[index];
# # # # ]
82 : : }
83 : :
84 [ # # # # ]: 1231660 : index = offset / CACHE_BUFFER_SIZE;
85 [ - + # # : 1231660 : assert(index < CACHE_TREE_WIDTH);
# # ]
86 [ - + # # : 1231660 : assert(tree->u.buffer[index] == NULL);
# # # # #
# # # #
# ]
87 [ # # # # : 1231660 : tree->u.buffer[index] = buffer;
# # # # #
# ]
88 [ - + # # : 1231660 : tree->present_mask |= (1ULL << index);
# # ]
89 : 1231660 : return root;
90 : : }
91 : :
92 : : void
93 : 891007 : tree_remove_buffer(struct cache_tree *tree, struct cache_buffer *buffer)
94 : : {
95 : : struct cache_tree *child;
96 : : uint64_t index;
97 : :
98 [ - + # # : 891007 : index = CACHE_TREE_INDEX(tree->level, buffer->offset);
# # # # #
# # # # #
# # ]
99 : :
100 [ + + # # : 891007 : if (tree->level == 0) {
# # ]
101 [ - + # # : 442684 : assert(tree->u.buffer[index] != NULL);
# # # # #
# # # #
# ]
102 [ - + # # : 442684 : assert(buffer == tree->u.buffer[index]);
# # # # #
# # # #
# ]
103 [ - + # # : 442684 : tree->present_mask &= ~(1ULL << index);
# # ]
104 [ # # # # : 442684 : tree->u.buffer[index] = NULL;
# # # # #
# ]
105 : 442684 : cache_buffer_free(buffer);
106 : 442684 : return;
107 : : }
108 : :
109 [ # # # # : 448323 : child = tree->u.tree[index];
# # # # ]
110 [ - + # # ]: 448323 : assert(child != NULL);
111 : 448323 : tree_remove_buffer(child, buffer);
112 [ + + # # : 448323 : if (child->present_mask == 0) {
# # ]
113 [ - + # # : 6045 : tree->present_mask &= ~(1ULL << index);
# # ]
114 [ # # # # : 6045 : tree->u.tree[index] = NULL;
# # # # ]
115 : 6045 : free(child);
116 : 0 : }
117 : 0 : }
118 : :
119 : : void
120 : 29802 : tree_free_buffers(struct cache_tree *tree)
121 : : {
122 : : struct cache_buffer *buffer;
123 : : struct cache_tree *child;
124 : : uint32_t i;
125 : :
126 [ - + # # : 29802 : if (tree->present_mask == 0) {
# # ]
127 : 0 : return;
128 : : }
129 : :
130 [ + + # # : 29802 : if (tree->level == 0) {
# # ]
131 [ + + # # ]: 1321385 : for (i = 0; i < CACHE_TREE_WIDTH; i++) {
132 [ # # # # : 1301056 : buffer = tree->u.buffer[i];
# # # # #
# ]
133 [ + + + + : 1301056 : if (buffer != NULL && buffer->in_progress == false &&
+ + # # #
# # # ]
134 [ + - # # : 788982 : buffer->bytes_filled == buffer->bytes_flushed) {
# # # # ]
135 : 788982 : cache_buffer_free(buffer);
136 [ # # # # : 788982 : tree->u.buffer[i] = NULL;
# # # # #
# ]
137 [ - + # # : 788982 : tree->present_mask &= ~(1ULL << i);
# # ]
138 : 0 : }
139 : 0 : }
140 : 0 : } else {
141 [ + + # # ]: 615745 : for (i = 0; i < CACHE_TREE_WIDTH; i++) {
142 [ # # # # : 606272 : child = tree->u.tree[i];
# # # # ]
143 [ + + ]: 606272 : if (child != NULL) {
144 : 20181 : tree_free_buffers(child);
145 [ + + # # : 20181 : if (child->present_mask == 0) {
# # ]
146 : 20133 : free(child);
147 [ # # # # : 20133 : tree->u.tree[i] = NULL;
# # # # ]
148 [ - + # # : 20133 : tree->present_mask &= ~(1ULL << i);
# # ]
149 : 0 : }
150 : 0 : }
151 : 0 : }
152 : : }
153 : 0 : }
|