root / block / qed-cluster.c @ d6e58090
History | View | Annotate | Download (4.6 kB)
1 | 298800ca | Stefan Hajnoczi | /*
|
---|---|---|---|
2 | 298800ca | Stefan Hajnoczi | * QEMU Enhanced Disk Format Cluster functions
|
3 | 298800ca | Stefan Hajnoczi | *
|
4 | 298800ca | Stefan Hajnoczi | * Copyright IBM, Corp. 2010
|
5 | 298800ca | Stefan Hajnoczi | *
|
6 | 298800ca | Stefan Hajnoczi | * Authors:
|
7 | 298800ca | Stefan Hajnoczi | * Stefan Hajnoczi <stefanha@linux.vnet.ibm.com>
|
8 | 298800ca | Stefan Hajnoczi | * Anthony Liguori <aliguori@us.ibm.com>
|
9 | 298800ca | Stefan Hajnoczi | *
|
10 | 298800ca | Stefan Hajnoczi | * This work is licensed under the terms of the GNU LGPL, version 2 or later.
|
11 | 298800ca | Stefan Hajnoczi | * See the COPYING.LIB file in the top-level directory.
|
12 | 298800ca | Stefan Hajnoczi | *
|
13 | 298800ca | Stefan Hajnoczi | */
|
14 | 298800ca | Stefan Hajnoczi | |
15 | 298800ca | Stefan Hajnoczi | #include "qed.h" |
16 | 298800ca | Stefan Hajnoczi | |
17 | 298800ca | Stefan Hajnoczi | /**
|
18 | 298800ca | Stefan Hajnoczi | * Count the number of contiguous data clusters
|
19 | 298800ca | Stefan Hajnoczi | *
|
20 | 298800ca | Stefan Hajnoczi | * @s: QED state
|
21 | 298800ca | Stefan Hajnoczi | * @table: L2 table
|
22 | 298800ca | Stefan Hajnoczi | * @index: First cluster index
|
23 | 298800ca | Stefan Hajnoczi | * @n: Maximum number of clusters
|
24 | 298800ca | Stefan Hajnoczi | * @offset: Set to first cluster offset
|
25 | 298800ca | Stefan Hajnoczi | *
|
26 | 298800ca | Stefan Hajnoczi | * This function scans tables for contiguous allocated or free clusters.
|
27 | 298800ca | Stefan Hajnoczi | */
|
28 | 298800ca | Stefan Hajnoczi | static unsigned int qed_count_contiguous_clusters(BDRVQEDState *s, |
29 | 298800ca | Stefan Hajnoczi | QEDTable *table, |
30 | 298800ca | Stefan Hajnoczi | unsigned int index, |
31 | 298800ca | Stefan Hajnoczi | unsigned int n, |
32 | 298800ca | Stefan Hajnoczi | uint64_t *offset) |
33 | 298800ca | Stefan Hajnoczi | { |
34 | 298800ca | Stefan Hajnoczi | unsigned int end = MIN(index + n, s->table_nelems); |
35 | 298800ca | Stefan Hajnoczi | uint64_t last = table->offsets[index]; |
36 | 298800ca | Stefan Hajnoczi | unsigned int i; |
37 | 298800ca | Stefan Hajnoczi | |
38 | 298800ca | Stefan Hajnoczi | *offset = last; |
39 | 298800ca | Stefan Hajnoczi | |
40 | 298800ca | Stefan Hajnoczi | for (i = index + 1; i < end; i++) { |
41 | 298800ca | Stefan Hajnoczi | if (last == 0) { |
42 | 298800ca | Stefan Hajnoczi | /* Counting free clusters */
|
43 | 298800ca | Stefan Hajnoczi | if (table->offsets[i] != 0) { |
44 | 298800ca | Stefan Hajnoczi | break;
|
45 | 298800ca | Stefan Hajnoczi | } |
46 | 298800ca | Stefan Hajnoczi | } else {
|
47 | 298800ca | Stefan Hajnoczi | /* Counting allocated clusters */
|
48 | 298800ca | Stefan Hajnoczi | if (table->offsets[i] != last + s->header.cluster_size) {
|
49 | 298800ca | Stefan Hajnoczi | break;
|
50 | 298800ca | Stefan Hajnoczi | } |
51 | 298800ca | Stefan Hajnoczi | last = table->offsets[i]; |
52 | 298800ca | Stefan Hajnoczi | } |
53 | 298800ca | Stefan Hajnoczi | } |
54 | 298800ca | Stefan Hajnoczi | return i - index;
|
55 | 298800ca | Stefan Hajnoczi | } |
56 | 298800ca | Stefan Hajnoczi | |
57 | 298800ca | Stefan Hajnoczi | typedef struct { |
58 | 298800ca | Stefan Hajnoczi | BDRVQEDState *s; |
59 | 298800ca | Stefan Hajnoczi | uint64_t pos; |
60 | 298800ca | Stefan Hajnoczi | size_t len; |
61 | 298800ca | Stefan Hajnoczi | |
62 | 298800ca | Stefan Hajnoczi | QEDRequest *request; |
63 | 298800ca | Stefan Hajnoczi | |
64 | 298800ca | Stefan Hajnoczi | /* User callback */
|
65 | 298800ca | Stefan Hajnoczi | QEDFindClusterFunc *cb; |
66 | 298800ca | Stefan Hajnoczi | void *opaque;
|
67 | 298800ca | Stefan Hajnoczi | } QEDFindClusterCB; |
68 | 298800ca | Stefan Hajnoczi | |
69 | 298800ca | Stefan Hajnoczi | static void qed_find_cluster_cb(void *opaque, int ret) |
70 | 298800ca | Stefan Hajnoczi | { |
71 | 298800ca | Stefan Hajnoczi | QEDFindClusterCB *find_cluster_cb = opaque; |
72 | 298800ca | Stefan Hajnoczi | BDRVQEDState *s = find_cluster_cb->s; |
73 | 298800ca | Stefan Hajnoczi | QEDRequest *request = find_cluster_cb->request; |
74 | 298800ca | Stefan Hajnoczi | uint64_t offset = 0;
|
75 | 298800ca | Stefan Hajnoczi | size_t len = 0;
|
76 | 298800ca | Stefan Hajnoczi | unsigned int index; |
77 | 298800ca | Stefan Hajnoczi | unsigned int n; |
78 | 298800ca | Stefan Hajnoczi | |
79 | 298800ca | Stefan Hajnoczi | if (ret) {
|
80 | 298800ca | Stefan Hajnoczi | goto out;
|
81 | 298800ca | Stefan Hajnoczi | } |
82 | 298800ca | Stefan Hajnoczi | |
83 | 298800ca | Stefan Hajnoczi | index = qed_l2_index(s, find_cluster_cb->pos); |
84 | 298800ca | Stefan Hajnoczi | n = qed_bytes_to_clusters(s, |
85 | 298800ca | Stefan Hajnoczi | qed_offset_into_cluster(s, find_cluster_cb->pos) + |
86 | 298800ca | Stefan Hajnoczi | find_cluster_cb->len); |
87 | 298800ca | Stefan Hajnoczi | n = qed_count_contiguous_clusters(s, request->l2_table->table, |
88 | 298800ca | Stefan Hajnoczi | index, n, &offset); |
89 | 298800ca | Stefan Hajnoczi | |
90 | 298800ca | Stefan Hajnoczi | ret = offset ? QED_CLUSTER_FOUND : QED_CLUSTER_L2; |
91 | 298800ca | Stefan Hajnoczi | len = MIN(find_cluster_cb->len, n * s->header.cluster_size - |
92 | 298800ca | Stefan Hajnoczi | qed_offset_into_cluster(s, find_cluster_cb->pos)); |
93 | 298800ca | Stefan Hajnoczi | |
94 | 298800ca | Stefan Hajnoczi | if (offset && !qed_check_cluster_offset(s, offset)) {
|
95 | 298800ca | Stefan Hajnoczi | ret = -EINVAL; |
96 | 298800ca | Stefan Hajnoczi | } |
97 | 298800ca | Stefan Hajnoczi | |
98 | 298800ca | Stefan Hajnoczi | out:
|
99 | 298800ca | Stefan Hajnoczi | find_cluster_cb->cb(find_cluster_cb->opaque, ret, offset, len); |
100 | 298800ca | Stefan Hajnoczi | qemu_free(find_cluster_cb); |
101 | 298800ca | Stefan Hajnoczi | } |
102 | 298800ca | Stefan Hajnoczi | |
103 | 298800ca | Stefan Hajnoczi | /**
|
104 | 298800ca | Stefan Hajnoczi | * Find the offset of a data cluster
|
105 | 298800ca | Stefan Hajnoczi | *
|
106 | 298800ca | Stefan Hajnoczi | * @s: QED state
|
107 | 298800ca | Stefan Hajnoczi | * @request: L2 cache entry
|
108 | 298800ca | Stefan Hajnoczi | * @pos: Byte position in device
|
109 | 298800ca | Stefan Hajnoczi | * @len: Number of bytes
|
110 | 298800ca | Stefan Hajnoczi | * @cb: Completion function
|
111 | 298800ca | Stefan Hajnoczi | * @opaque: User data for completion function
|
112 | 298800ca | Stefan Hajnoczi | *
|
113 | 298800ca | Stefan Hajnoczi | * This function translates a position in the block device to an offset in the
|
114 | 298800ca | Stefan Hajnoczi | * image file. It invokes the cb completion callback to report back the
|
115 | 298800ca | Stefan Hajnoczi | * translated offset or unallocated range in the image file.
|
116 | 298800ca | Stefan Hajnoczi | *
|
117 | 298800ca | Stefan Hajnoczi | * If the L2 table exists, request->l2_table points to the L2 table cache entry
|
118 | 298800ca | Stefan Hajnoczi | * and the caller must free the reference when they are finished. The cache
|
119 | 298800ca | Stefan Hajnoczi | * entry is exposed in this way to avoid callers having to read the L2 table
|
120 | 298800ca | Stefan Hajnoczi | * again later during request processing. If request->l2_table is non-NULL it
|
121 | 298800ca | Stefan Hajnoczi | * will be unreferenced before taking on the new cache entry.
|
122 | 298800ca | Stefan Hajnoczi | */
|
123 | 298800ca | Stefan Hajnoczi | void qed_find_cluster(BDRVQEDState *s, QEDRequest *request, uint64_t pos,
|
124 | 298800ca | Stefan Hajnoczi | size_t len, QEDFindClusterFunc *cb, void *opaque)
|
125 | 298800ca | Stefan Hajnoczi | { |
126 | 298800ca | Stefan Hajnoczi | QEDFindClusterCB *find_cluster_cb; |
127 | 298800ca | Stefan Hajnoczi | uint64_t l2_offset; |
128 | 298800ca | Stefan Hajnoczi | |
129 | 298800ca | Stefan Hajnoczi | /* Limit length to L2 boundary. Requests are broken up at the L2 boundary
|
130 | 298800ca | Stefan Hajnoczi | * so that a request acts on one L2 table at a time.
|
131 | 298800ca | Stefan Hajnoczi | */
|
132 | 298800ca | Stefan Hajnoczi | len = MIN(len, (((pos >> s->l1_shift) + 1) << s->l1_shift) - pos);
|
133 | 298800ca | Stefan Hajnoczi | |
134 | 298800ca | Stefan Hajnoczi | l2_offset = s->l1_table->offsets[qed_l1_index(s, pos)]; |
135 | 298800ca | Stefan Hajnoczi | if (!l2_offset) {
|
136 | 298800ca | Stefan Hajnoczi | cb(opaque, QED_CLUSTER_L1, 0, len);
|
137 | 298800ca | Stefan Hajnoczi | return;
|
138 | 298800ca | Stefan Hajnoczi | } |
139 | 298800ca | Stefan Hajnoczi | if (!qed_check_table_offset(s, l2_offset)) {
|
140 | 298800ca | Stefan Hajnoczi | cb(opaque, -EINVAL, 0, 0); |
141 | 298800ca | Stefan Hajnoczi | return;
|
142 | 298800ca | Stefan Hajnoczi | } |
143 | 298800ca | Stefan Hajnoczi | |
144 | 298800ca | Stefan Hajnoczi | find_cluster_cb = qemu_malloc(sizeof(*find_cluster_cb));
|
145 | 298800ca | Stefan Hajnoczi | find_cluster_cb->s = s; |
146 | 298800ca | Stefan Hajnoczi | find_cluster_cb->pos = pos; |
147 | 298800ca | Stefan Hajnoczi | find_cluster_cb->len = len; |
148 | 298800ca | Stefan Hajnoczi | find_cluster_cb->cb = cb; |
149 | 298800ca | Stefan Hajnoczi | find_cluster_cb->opaque = opaque; |
150 | 298800ca | Stefan Hajnoczi | find_cluster_cb->request = request; |
151 | 298800ca | Stefan Hajnoczi | |
152 | 298800ca | Stefan Hajnoczi | qed_read_l2_table(s, request, l2_offset, |
153 | 298800ca | Stefan Hajnoczi | qed_find_cluster_cb, find_cluster_cb); |
154 | 298800ca | Stefan Hajnoczi | } |