1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
163
164
165
166
167
168
169
170
171
172
173
174
175
176
177
178
179
180
181
182
183
184
185
186
187
188
189
190
191
192
193
194
195
196
197
198
199
200
201
202
203
204
205
206
207
208
209
210
211
212
213
214
215
216
217
218
219
220
221
222
223
224
225
226
227
228
229
230
231
232
233
234
235
236
237
238
239
240
|
/*
* mdadm - manage Linux "md" devices aka RAID arrays.
*
* Copyright (C) 2011 Neil Brown <neilb@suse.de>
*
*
* This program is free software; you can redistribute it and/or modify
* it under the terms of the GNU General Public License as published by
* the Free Software Foundation; either version 2 of the License, or
* (at your option) any later version.
*
* This program is distributed in the hope that it will be useful,
* but WITHOUT ANY WARRANTY; without even the implied warranty of
* MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
* GNU General Public License for more details.
*
* You should have received a copy of the GNU General Public License
* along with this program; if not, write to the Free Software
* Foundation, Inc., 59 Temple Place, Suite 330, Boston, MA 02111-1307 USA
*
* Author: Neil Brown
* Email: <neilb@suse.de>
*/
#include "mdadm.h"
/* name/number mappings */
mapping_t r5layout[] = {
{ "left-asymmetric", ALGORITHM_LEFT_ASYMMETRIC},
{ "right-asymmetric", ALGORITHM_RIGHT_ASYMMETRIC},
{ "left-symmetric", ALGORITHM_LEFT_SYMMETRIC},
{ "right-symmetric", ALGORITHM_RIGHT_SYMMETRIC},
{ "default", ALGORITHM_LEFT_SYMMETRIC},
{ "la", ALGORITHM_LEFT_ASYMMETRIC},
{ "ra", ALGORITHM_RIGHT_ASYMMETRIC},
{ "ls", ALGORITHM_LEFT_SYMMETRIC},
{ "rs", ALGORITHM_RIGHT_SYMMETRIC},
{ "parity-first", ALGORITHM_PARITY_0},
{ "parity-last", ALGORITHM_PARITY_N},
{ "ddf-zero-restart", ALGORITHM_RIGHT_ASYMMETRIC},
{ "ddf-N-restart", ALGORITHM_LEFT_ASYMMETRIC},
{ "ddf-N-continue", ALGORITHM_LEFT_SYMMETRIC},
{ NULL, UnSet }
};
mapping_t r6layout[] = {
{ "left-asymmetric", ALGORITHM_LEFT_ASYMMETRIC},
{ "right-asymmetric", ALGORITHM_RIGHT_ASYMMETRIC},
{ "left-symmetric", ALGORITHM_LEFT_SYMMETRIC},
{ "right-symmetric", ALGORITHM_RIGHT_SYMMETRIC},
{ "default", ALGORITHM_LEFT_SYMMETRIC},
{ "la", ALGORITHM_LEFT_ASYMMETRIC},
{ "ra", ALGORITHM_RIGHT_ASYMMETRIC},
{ "ls", ALGORITHM_LEFT_SYMMETRIC},
{ "rs", ALGORITHM_RIGHT_SYMMETRIC},
{ "parity-first", ALGORITHM_PARITY_0},
{ "parity-last", ALGORITHM_PARITY_N},
{ "ddf-zero-restart", ALGORITHM_ROTATING_ZERO_RESTART},
{ "ddf-N-restart", ALGORITHM_ROTATING_N_RESTART},
{ "ddf-N-continue", ALGORITHM_ROTATING_N_CONTINUE},
{ "left-asymmetric-6", ALGORITHM_LEFT_ASYMMETRIC_6},
{ "right-asymmetric-6", ALGORITHM_RIGHT_ASYMMETRIC_6},
{ "left-symmetric-6", ALGORITHM_LEFT_SYMMETRIC_6},
{ "right-symmetric-6", ALGORITHM_RIGHT_SYMMETRIC_6},
{ "parity-first-6", ALGORITHM_PARITY_0_6},
{ NULL, UnSet }
};
/* raid0 layout is only needed because of a bug in 3.14 which changed
* the effective layout of raid0 arrays with varying device sizes.
*/
mapping_t r0layout[] = {
{ "original", RAID0_ORIG_LAYOUT},
{ "alternate", RAID0_ALT_MULTIZONE_LAYOUT},
{ "1", 1}, /* aka ORIG */
{ "2", 2}, /* aka ALT */
{ "dangerous", 0},
{ NULL, UnSet},
};
mapping_t pers[] = {
{ "linear", LEVEL_LINEAR},
{ "raid0", 0},
{ "0", 0},
{ "stripe", 0},
{ "raid1", 1},
{ "1", 1},
{ "mirror", 1},
{ "raid4", 4},
{ "4", 4},
{ "raid5", 5},
{ "5", 5},
{ "multipath", LEVEL_MULTIPATH},
{ "mp", LEVEL_MULTIPATH},
{ "raid6", 6},
{ "6", 6},
{ "raid10", 10},
{ "10", 10},
{ "faulty", LEVEL_FAULTY},
{ "container", LEVEL_CONTAINER},
{ NULL, UnSet }
};
mapping_t modes[] = {
{ "assemble", ASSEMBLE},
{ "build", BUILD},
{ "create", CREATE},
{ "manage", MANAGE},
{ "misc", MISC},
{ "monitor", MONITOR},
{ "grow", GROW},
{ "incremental", INCREMENTAL},
{ "auto-detect", AUTODETECT},
{ NULL, UnSet }
};
mapping_t faultylayout[] = {
{ "write-transient", WriteTransient },
{ "wt", WriteTransient },
{ "read-transient", ReadTransient },
{ "rt", ReadTransient },
{ "write-persistent", WritePersistent },
{ "wp", WritePersistent },
{ "read-persistent", ReadPersistent },
{ "rp", ReadPersistent },
{ "write-all", WriteAll },
{ "wa", WriteAll },
{ "read-fixable", ReadFixable },
{ "rf", ReadFixable },
{ "clear", ClearErrors},
{ "flush", ClearFaults},
{ "none", ClearErrors},
{ "default", ClearErrors},
{ NULL, UnSet }
};
mapping_t consistency_policies[] = {
{ "unknown", CONSISTENCY_POLICY_UNKNOWN},
{ "none", CONSISTENCY_POLICY_NONE},
{ "resync", CONSISTENCY_POLICY_RESYNC},
{ "bitmap", CONSISTENCY_POLICY_BITMAP},
{ "journal", CONSISTENCY_POLICY_JOURNAL},
{ "ppl", CONSISTENCY_POLICY_PPL},
{ NULL, CONSISTENCY_POLICY_UNKNOWN }
};
mapping_t sysfs_array_states[] = {
{ "active-idle", ARRAY_ACTIVE_IDLE },
{ "active", ARRAY_ACTIVE },
{ "clear", ARRAY_CLEAR },
{ "inactive", ARRAY_INACTIVE },
{ "suspended", ARRAY_SUSPENDED },
{ "readonly", ARRAY_READONLY },
{ "read-auto", ARRAY_READ_AUTO },
{ "clean", ARRAY_CLEAN },
{ "write-pending", ARRAY_WRITE_PENDING },
{ "broken", ARRAY_BROKEN },
{ NULL, ARRAY_UNKNOWN_STATE }
};
/**
* mapping_t update_options - stores supported update options.
*/
mapping_t update_options[] = {
{ "name", UOPT_NAME },
{ "ppl", UOPT_PPL },
{ "no-ppl", UOPT_NO_PPL },
{ "bitmap", UOPT_BITMAP },
{ "no-bitmap", UOPT_NO_BITMAP },
{ "sparc2.2", UOPT_SPARC22 },
{ "super-minor", UOPT_SUPER_MINOR },
{ "summaries", UOPT_SUMMARIES },
{ "resync", UOPT_RESYNC },
{ "uuid", UOPT_UUID },
{ "homehost", UOPT_HOMEHOST },
{ "home-cluster", UOPT_HOME_CLUSTER },
{ "nodes", UOPT_NODES },
{ "devicesize", UOPT_DEVICESIZE },
{ "bbl", UOPT_BBL },
{ "no-bbl", UOPT_NO_BBL },
{ "force-no-bbl", UOPT_FORCE_NO_BBL },
{ "metadata", UOPT_METADATA },
{ "revert-reshape", UOPT_REVERT_RESHAPE },
{ "layout-original", UOPT_LAYOUT_ORIGINAL },
{ "layout-alternate", UOPT_LAYOUT_ALTERNATE },
{ "layout-unspecified", UOPT_LAYOUT_UNSPECIFIED },
{ "byteorder", UOPT_BYTEORDER },
{ "help", UOPT_HELP },
{ "?", UOPT_HELP },
{ NULL, UOPT_UNDEFINED}
};
/**
* map_num_s() - Safer alternative of map_num() function.
* @map: map to search.
* @num: key to match.
*
* Shall be used only if key existence is quaranted.
*
* Return: Pointer to name of the element.
*/
char *map_num_s(mapping_t *map, int num)
{
char *ret = map_num(map, num);
assert(ret);
return ret;
}
/**
* map_num() - get element name by key.
* @map: map to search.
* @num: key to match.
*
* Return: Pointer to name of the element or NULL.
*/
char *map_num(mapping_t *map, int num)
{
while (map->name) {
if (map->num == num)
return map->name;
map++;
}
return NULL;
}
int map_name(mapping_t *map, char *name)
{
while (map->name && strcmp(map->name, name) != 0)
map++;
return map->num;
}
|
