Loading...
1// SPDX-License-Identifier: GPL-2.0
2/*
3 * fs/partitions/aix.c
4 *
5 * Copyright (C) 2012-2013 Philippe De Muyter <phdm@macqel.be>
6 */
7
8#include "check.h"
9#include "aix.h"
10
11struct lvm_rec {
12 char lvm_id[4]; /* "_LVM" */
13 char reserved4[16];
14 __be32 lvmarea_len;
15 __be32 vgda_len;
16 __be32 vgda_psn[2];
17 char reserved36[10];
18 __be16 pp_size; /* log2(pp_size) */
19 char reserved46[12];
20 __be16 version;
21 };
22
23struct vgda {
24 __be32 secs;
25 __be32 usec;
26 char reserved8[16];
27 __be16 numlvs;
28 __be16 maxlvs;
29 __be16 pp_size;
30 __be16 numpvs;
31 __be16 total_vgdas;
32 __be16 vgda_size;
33 };
34
35struct lvd {
36 __be16 lv_ix;
37 __be16 res2;
38 __be16 res4;
39 __be16 maxsize;
40 __be16 lv_state;
41 __be16 mirror;
42 __be16 mirror_policy;
43 __be16 num_lps;
44 __be16 res10[8];
45 };
46
47struct lvname {
48 char name[64];
49 };
50
51struct ppe {
52 __be16 lv_ix;
53 unsigned short res2;
54 unsigned short res4;
55 __be16 lp_ix;
56 unsigned short res8[12];
57 };
58
59struct pvd {
60 char reserved0[16];
61 __be16 pp_count;
62 char reserved18[2];
63 __be32 psn_part1;
64 char reserved24[8];
65 struct ppe ppe[1016];
66 };
67
68#define LVM_MAXLVS 256
69
70/**
71 * last_lba(): return number of last logical block of device
72 * @bdev: block device
73 *
74 * Description: Returns last LBA value on success, 0 on error.
75 * This is stored (by sd and ide-geometry) in
76 * the part[0] entry for this disk, and is the number of
77 * physical sectors available on the disk.
78 */
79static u64 last_lba(struct block_device *bdev)
80{
81 if (!bdev || !bdev->bd_inode)
82 return 0;
83 return (bdev->bd_inode->i_size >> 9) - 1ULL;
84}
85
86/**
87 * read_lba(): Read bytes from disk, starting at given LBA
88 * @state
89 * @lba
90 * @buffer
91 * @count
92 *
93 * Description: Reads @count bytes from @state->bdev into @buffer.
94 * Returns number of bytes read on success, 0 on error.
95 */
96static size_t read_lba(struct parsed_partitions *state, u64 lba, u8 *buffer,
97 size_t count)
98{
99 size_t totalreadcount = 0;
100
101 if (!buffer || lba + count / 512 > last_lba(state->bdev))
102 return 0;
103
104 while (count) {
105 int copied = 512;
106 Sector sect;
107 unsigned char *data = read_part_sector(state, lba++, §);
108 if (!data)
109 break;
110 if (copied > count)
111 copied = count;
112 memcpy(buffer, data, copied);
113 put_dev_sector(sect);
114 buffer += copied;
115 totalreadcount += copied;
116 count -= copied;
117 }
118 return totalreadcount;
119}
120
121/**
122 * alloc_pvd(): reads physical volume descriptor
123 * @state
124 * @lba
125 *
126 * Description: Returns pvd on success, NULL on error.
127 * Allocates space for pvd and fill it with disk blocks at @lba
128 * Notes: remember to free pvd when you're done!
129 */
130static struct pvd *alloc_pvd(struct parsed_partitions *state, u32 lba)
131{
132 size_t count = sizeof(struct pvd);
133 struct pvd *p;
134
135 p = kmalloc(count, GFP_KERNEL);
136 if (!p)
137 return NULL;
138
139 if (read_lba(state, lba, (u8 *) p, count) < count) {
140 kfree(p);
141 return NULL;
142 }
143 return p;
144}
145
146/**
147 * alloc_lvn(): reads logical volume names
148 * @state
149 * @lba
150 *
151 * Description: Returns lvn on success, NULL on error.
152 * Allocates space for lvn and fill it with disk blocks at @lba
153 * Notes: remember to free lvn when you're done!
154 */
155static struct lvname *alloc_lvn(struct parsed_partitions *state, u32 lba)
156{
157 size_t count = sizeof(struct lvname) * LVM_MAXLVS;
158 struct lvname *p;
159
160 p = kmalloc(count, GFP_KERNEL);
161 if (!p)
162 return NULL;
163
164 if (read_lba(state, lba, (u8 *) p, count) < count) {
165 kfree(p);
166 return NULL;
167 }
168 return p;
169}
170
171int aix_partition(struct parsed_partitions *state)
172{
173 int ret = 0;
174 Sector sect;
175 unsigned char *d;
176 u32 pp_bytes_size;
177 u32 pp_blocks_size = 0;
178 u32 vgda_sector = 0;
179 u32 vgda_len = 0;
180 int numlvs = 0;
181 struct pvd *pvd;
182 struct lv_info {
183 unsigned short pps_per_lv;
184 unsigned short pps_found;
185 unsigned char lv_is_contiguous;
186 } *lvip;
187 struct lvname *n = NULL;
188
189 d = read_part_sector(state, 7, §);
190 if (d) {
191 struct lvm_rec *p = (struct lvm_rec *)d;
192 u16 lvm_version = be16_to_cpu(p->version);
193 char tmp[64];
194
195 if (lvm_version == 1) {
196 int pp_size_log2 = be16_to_cpu(p->pp_size);
197
198 pp_bytes_size = 1 << pp_size_log2;
199 pp_blocks_size = pp_bytes_size / 512;
200 snprintf(tmp, sizeof(tmp),
201 " AIX LVM header version %u found\n",
202 lvm_version);
203 vgda_len = be32_to_cpu(p->vgda_len);
204 vgda_sector = be32_to_cpu(p->vgda_psn[0]);
205 } else {
206 snprintf(tmp, sizeof(tmp),
207 " unsupported AIX LVM version %d found\n",
208 lvm_version);
209 }
210 strlcat(state->pp_buf, tmp, PAGE_SIZE);
211 put_dev_sector(sect);
212 }
213 if (vgda_sector && (d = read_part_sector(state, vgda_sector, §))) {
214 struct vgda *p = (struct vgda *)d;
215
216 numlvs = be16_to_cpu(p->numlvs);
217 put_dev_sector(sect);
218 }
219 lvip = kcalloc(state->limit, sizeof(struct lv_info), GFP_KERNEL);
220 if (!lvip)
221 return 0;
222 if (numlvs && (d = read_part_sector(state, vgda_sector + 1, §))) {
223 struct lvd *p = (struct lvd *)d;
224 int i;
225
226 n = alloc_lvn(state, vgda_sector + vgda_len - 33);
227 if (n) {
228 int foundlvs = 0;
229
230 for (i = 0; foundlvs < numlvs && i < state->limit; i += 1) {
231 lvip[i].pps_per_lv = be16_to_cpu(p[i].num_lps);
232 if (lvip[i].pps_per_lv)
233 foundlvs += 1;
234 }
235 }
236 put_dev_sector(sect);
237 }
238 pvd = alloc_pvd(state, vgda_sector + 17);
239 if (pvd) {
240 int numpps = be16_to_cpu(pvd->pp_count);
241 int psn_part1 = be32_to_cpu(pvd->psn_part1);
242 int i;
243 int cur_lv_ix = -1;
244 int next_lp_ix = 1;
245 int lp_ix;
246
247 for (i = 0; i < numpps; i += 1) {
248 struct ppe *p = pvd->ppe + i;
249 unsigned int lv_ix;
250
251 lp_ix = be16_to_cpu(p->lp_ix);
252 if (!lp_ix) {
253 next_lp_ix = 1;
254 continue;
255 }
256 lv_ix = be16_to_cpu(p->lv_ix) - 1;
257 if (lv_ix >= state->limit) {
258 cur_lv_ix = -1;
259 continue;
260 }
261 lvip[lv_ix].pps_found += 1;
262 if (lp_ix == 1) {
263 cur_lv_ix = lv_ix;
264 next_lp_ix = 1;
265 } else if (lv_ix != cur_lv_ix || lp_ix != next_lp_ix) {
266 next_lp_ix = 1;
267 continue;
268 }
269 if (lp_ix == lvip[lv_ix].pps_per_lv) {
270 char tmp[70];
271
272 put_partition(state, lv_ix + 1,
273 (i + 1 - lp_ix) * pp_blocks_size + psn_part1,
274 lvip[lv_ix].pps_per_lv * pp_blocks_size);
275 snprintf(tmp, sizeof(tmp), " <%s>\n",
276 n[lv_ix].name);
277 strlcat(state->pp_buf, tmp, PAGE_SIZE);
278 lvip[lv_ix].lv_is_contiguous = 1;
279 ret = 1;
280 next_lp_ix = 1;
281 } else
282 next_lp_ix += 1;
283 }
284 for (i = 0; i < state->limit; i += 1)
285 if (lvip[i].pps_found && !lvip[i].lv_is_contiguous)
286 pr_warn("partition %s (%u pp's found) is "
287 "not contiguous\n",
288 n[i].name, lvip[i].pps_found);
289 kfree(pvd);
290 }
291 kfree(n);
292 kfree(lvip);
293 return ret;
294}
1// SPDX-License-Identifier: GPL-2.0
2/*
3 * fs/partitions/aix.c
4 *
5 * Copyright (C) 2012-2013 Philippe De Muyter <phdm@macqel.be>
6 */
7
8#include "check.h"
9
10struct lvm_rec {
11 char lvm_id[4]; /* "_LVM" */
12 char reserved4[16];
13 __be32 lvmarea_len;
14 __be32 vgda_len;
15 __be32 vgda_psn[2];
16 char reserved36[10];
17 __be16 pp_size; /* log2(pp_size) */
18 char reserved46[12];
19 __be16 version;
20 };
21
22struct vgda {
23 __be32 secs;
24 __be32 usec;
25 char reserved8[16];
26 __be16 numlvs;
27 __be16 maxlvs;
28 __be16 pp_size;
29 __be16 numpvs;
30 __be16 total_vgdas;
31 __be16 vgda_size;
32 };
33
34struct lvd {
35 __be16 lv_ix;
36 __be16 res2;
37 __be16 res4;
38 __be16 maxsize;
39 __be16 lv_state;
40 __be16 mirror;
41 __be16 mirror_policy;
42 __be16 num_lps;
43 __be16 res10[8];
44 };
45
46struct lvname {
47 char name[64];
48 };
49
50struct ppe {
51 __be16 lv_ix;
52 unsigned short res2;
53 unsigned short res4;
54 __be16 lp_ix;
55 unsigned short res8[12];
56 };
57
58struct pvd {
59 char reserved0[16];
60 __be16 pp_count;
61 char reserved18[2];
62 __be32 psn_part1;
63 char reserved24[8];
64 struct ppe ppe[1016];
65 };
66
67#define LVM_MAXLVS 256
68
69/**
70 * read_lba(): Read bytes from disk, starting at given LBA
71 * @state
72 * @lba
73 * @buffer
74 * @count
75 *
76 * Description: Reads @count bytes from @state->disk into @buffer.
77 * Returns number of bytes read on success, 0 on error.
78 */
79static size_t read_lba(struct parsed_partitions *state, u64 lba, u8 *buffer,
80 size_t count)
81{
82 size_t totalreadcount = 0;
83
84 if (!buffer || lba + count / 512 > get_capacity(state->disk) - 1ULL)
85 return 0;
86
87 while (count) {
88 int copied = 512;
89 Sector sect;
90 unsigned char *data = read_part_sector(state, lba++, §);
91 if (!data)
92 break;
93 if (copied > count)
94 copied = count;
95 memcpy(buffer, data, copied);
96 put_dev_sector(sect);
97 buffer += copied;
98 totalreadcount += copied;
99 count -= copied;
100 }
101 return totalreadcount;
102}
103
104/**
105 * alloc_pvd(): reads physical volume descriptor
106 * @state
107 * @lba
108 *
109 * Description: Returns pvd on success, NULL on error.
110 * Allocates space for pvd and fill it with disk blocks at @lba
111 * Notes: remember to free pvd when you're done!
112 */
113static struct pvd *alloc_pvd(struct parsed_partitions *state, u32 lba)
114{
115 size_t count = sizeof(struct pvd);
116 struct pvd *p;
117
118 p = kmalloc(count, GFP_KERNEL);
119 if (!p)
120 return NULL;
121
122 if (read_lba(state, lba, (u8 *) p, count) < count) {
123 kfree(p);
124 return NULL;
125 }
126 return p;
127}
128
129/**
130 * alloc_lvn(): reads logical volume names
131 * @state
132 * @lba
133 *
134 * Description: Returns lvn on success, NULL on error.
135 * Allocates space for lvn and fill it with disk blocks at @lba
136 * Notes: remember to free lvn when you're done!
137 */
138static struct lvname *alloc_lvn(struct parsed_partitions *state, u32 lba)
139{
140 size_t count = sizeof(struct lvname) * LVM_MAXLVS;
141 struct lvname *p;
142
143 p = kmalloc(count, GFP_KERNEL);
144 if (!p)
145 return NULL;
146
147 if (read_lba(state, lba, (u8 *) p, count) < count) {
148 kfree(p);
149 return NULL;
150 }
151 return p;
152}
153
154int aix_partition(struct parsed_partitions *state)
155{
156 int ret = 0;
157 Sector sect;
158 unsigned char *d;
159 u32 pp_bytes_size;
160 u32 pp_blocks_size = 0;
161 u32 vgda_sector = 0;
162 u32 vgda_len = 0;
163 int numlvs = 0;
164 struct pvd *pvd = NULL;
165 struct lv_info {
166 unsigned short pps_per_lv;
167 unsigned short pps_found;
168 unsigned char lv_is_contiguous;
169 } *lvip;
170 struct lvname *n = NULL;
171
172 d = read_part_sector(state, 7, §);
173 if (d) {
174 struct lvm_rec *p = (struct lvm_rec *)d;
175 u16 lvm_version = be16_to_cpu(p->version);
176 char tmp[64];
177
178 if (lvm_version == 1) {
179 int pp_size_log2 = be16_to_cpu(p->pp_size);
180
181 pp_bytes_size = 1 << pp_size_log2;
182 pp_blocks_size = pp_bytes_size / 512;
183 snprintf(tmp, sizeof(tmp),
184 " AIX LVM header version %u found\n",
185 lvm_version);
186 vgda_len = be32_to_cpu(p->vgda_len);
187 vgda_sector = be32_to_cpu(p->vgda_psn[0]);
188 } else {
189 snprintf(tmp, sizeof(tmp),
190 " unsupported AIX LVM version %d found\n",
191 lvm_version);
192 }
193 strlcat(state->pp_buf, tmp, PAGE_SIZE);
194 put_dev_sector(sect);
195 }
196 if (vgda_sector && (d = read_part_sector(state, vgda_sector, §))) {
197 struct vgda *p = (struct vgda *)d;
198
199 numlvs = be16_to_cpu(p->numlvs);
200 put_dev_sector(sect);
201 }
202 lvip = kcalloc(state->limit, sizeof(struct lv_info), GFP_KERNEL);
203 if (!lvip)
204 return 0;
205 if (numlvs && (d = read_part_sector(state, vgda_sector + 1, §))) {
206 struct lvd *p = (struct lvd *)d;
207 int i;
208
209 n = alloc_lvn(state, vgda_sector + vgda_len - 33);
210 if (n) {
211 int foundlvs = 0;
212
213 for (i = 0; foundlvs < numlvs && i < state->limit; i += 1) {
214 lvip[i].pps_per_lv = be16_to_cpu(p[i].num_lps);
215 if (lvip[i].pps_per_lv)
216 foundlvs += 1;
217 }
218 /* pvd loops depend on n[].name and lvip[].pps_per_lv */
219 pvd = alloc_pvd(state, vgda_sector + 17);
220 }
221 put_dev_sector(sect);
222 }
223 if (pvd) {
224 int numpps = be16_to_cpu(pvd->pp_count);
225 int psn_part1 = be32_to_cpu(pvd->psn_part1);
226 int i;
227 int cur_lv_ix = -1;
228 int next_lp_ix = 1;
229 int lp_ix;
230
231 for (i = 0; i < numpps; i += 1) {
232 struct ppe *p = pvd->ppe + i;
233 unsigned int lv_ix;
234
235 lp_ix = be16_to_cpu(p->lp_ix);
236 if (!lp_ix) {
237 next_lp_ix = 1;
238 continue;
239 }
240 lv_ix = be16_to_cpu(p->lv_ix) - 1;
241 if (lv_ix >= state->limit) {
242 cur_lv_ix = -1;
243 continue;
244 }
245 lvip[lv_ix].pps_found += 1;
246 if (lp_ix == 1) {
247 cur_lv_ix = lv_ix;
248 next_lp_ix = 1;
249 } else if (lv_ix != cur_lv_ix || lp_ix != next_lp_ix) {
250 next_lp_ix = 1;
251 continue;
252 }
253 if (lp_ix == lvip[lv_ix].pps_per_lv) {
254 char tmp[70];
255
256 put_partition(state, lv_ix + 1,
257 (i + 1 - lp_ix) * pp_blocks_size + psn_part1,
258 lvip[lv_ix].pps_per_lv * pp_blocks_size);
259 snprintf(tmp, sizeof(tmp), " <%s>\n",
260 n[lv_ix].name);
261 strlcat(state->pp_buf, tmp, PAGE_SIZE);
262 lvip[lv_ix].lv_is_contiguous = 1;
263 ret = 1;
264 next_lp_ix = 1;
265 } else
266 next_lp_ix += 1;
267 }
268 for (i = 0; i < state->limit; i += 1)
269 if (lvip[i].pps_found && !lvip[i].lv_is_contiguous) {
270 char tmp[sizeof(n[i].name) + 1]; // null char
271
272 snprintf(tmp, sizeof(tmp), "%s", n[i].name);
273 pr_warn("partition %s (%u pp's found) is "
274 "not contiguous\n",
275 tmp, lvip[i].pps_found);
276 }
277 kfree(pvd);
278 }
279 kfree(n);
280 kfree(lvip);
281 return ret;
282}