Commit | Line | Data |
---|---|---|
d7e09d03 PT |
1 | /* |
2 | * GPL HEADER START | |
3 | * | |
4 | * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER. | |
5 | * | |
6 | * This program is free software; you can redistribute it and/or modify | |
7 | * it under the terms of the GNU General Public License version 2 only, | |
8 | * as published by the Free Software Foundation. | |
9 | * | |
10 | * This program is distributed in the hope that it will be useful, but | |
11 | * WITHOUT ANY WARRANTY; without even the implied warranty of | |
12 | * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU | |
13 | * General Public License version 2 for more details (a copy is included | |
14 | * in the LICENSE file that accompanied this code). | |
15 | * | |
16 | * You should have received a copy of the GNU General Public License | |
06894eed OD |
17 | * version 2 along with this program; If not, see |
18 | * http://http://www.gnu.org/licenses/gpl-2.0.html | |
d7e09d03 | 19 | * |
d7e09d03 PT |
20 | * GPL HEADER END |
21 | */ | |
22 | /* | |
23 | * Copyright (c) 2008, 2010, Oracle and/or its affiliates. All rights reserved. | |
24 | * Use is subject to license terms. | |
25 | * | |
26 | * Copyright (c) 2012, Intel Corporation. | |
27 | */ | |
28 | /* | |
29 | * This file is part of Lustre, http://www.lustre.org/ | |
30 | * Lustre is a trademark of Sun Microsystems, Inc. | |
31 | * | |
32 | * lustre/lov/lov_pool.c | |
33 | * | |
34 | * OST pool methods | |
35 | * | |
36 | * Author: Jacques-Charles LAFOUCRIERE <jc.lafoucriere@cea.fr> | |
37 | * Author: Alex Lyashkov <Alexey.Lyashkov@Sun.COM> | |
38 | * Author: Nathaniel Rutman <Nathan.Rutman@Sun.COM> | |
39 | */ | |
40 | ||
41 | #define DEBUG_SUBSYSTEM S_LOV | |
42 | ||
9fdaf8c0 | 43 | #include "../../include/linux/libcfs/libcfs.h" |
d7e09d03 | 44 | |
0cf0f7a7 | 45 | #include "../include/obd.h" |
d7e09d03 PT |
46 | #include "lov_internal.h" |
47 | ||
48 | #define pool_tgt(_p, _i) \ | |
49 | _p->pool_lobd->u.lov.lov_tgts[_p->pool_obds.op_array[_i]] | |
50 | ||
51 | static void lov_pool_getref(struct pool_desc *pool) | |
52 | { | |
53 | CDEBUG(D_INFO, "pool %p\n", pool); | |
54 | atomic_inc(&pool->pool_refcount); | |
55 | } | |
56 | ||
57 | void lov_pool_putref(struct pool_desc *pool) | |
58 | { | |
59 | CDEBUG(D_INFO, "pool %p\n", pool); | |
60 | if (atomic_dec_and_test(&pool->pool_refcount)) { | |
61 | LASSERT(hlist_unhashed(&pool->pool_hash)); | |
62 | LASSERT(list_empty(&pool->pool_list)); | |
00697c43 | 63 | LASSERT(!pool->pool_debugfs_entry); |
49880263 | 64 | lov_ost_pool_free(&pool->pool_obds); |
840c94d5 | 65 | kfree(pool); |
d7e09d03 PT |
66 | } |
67 | } | |
68 | ||
12e397cd | 69 | static void lov_pool_putref_locked(struct pool_desc *pool) |
d7e09d03 PT |
70 | { |
71 | CDEBUG(D_INFO, "pool %p\n", pool); | |
72 | LASSERT(atomic_read(&pool->pool_refcount) > 1); | |
73 | ||
74 | atomic_dec(&pool->pool_refcount); | |
75 | } | |
76 | ||
77 | /* | |
78 | * hash function using a Rotating Hash algorithm | |
79 | * Knuth, D. The Art of Computer Programming, | |
80 | * Volume 3: Sorting and Searching, | |
81 | * Chapter 6.4. | |
82 | * Addison Wesley, 1973 | |
83 | */ | |
6da6eabe | 84 | static __u32 pool_hashfn(struct cfs_hash *hash_body, const void *key, unsigned mask) |
d7e09d03 PT |
85 | { |
86 | int i; | |
87 | __u32 result; | |
88 | char *poolname; | |
89 | ||
90 | result = 0; | |
91 | poolname = (char *)key; | |
92 | for (i = 0; i < LOV_MAXPOOLNAME; i++) { | |
93 | if (poolname[i] == '\0') | |
94 | break; | |
cd94f231 | 95 | result = (result << 4) ^ (result >> 28) ^ poolname[i]; |
d7e09d03 PT |
96 | } |
97 | return (result % mask); | |
98 | } | |
99 | ||
100 | static void *pool_key(struct hlist_node *hnode) | |
101 | { | |
102 | struct pool_desc *pool; | |
103 | ||
104 | pool = hlist_entry(hnode, struct pool_desc, pool_hash); | |
e8291974 | 105 | return pool->pool_name; |
d7e09d03 PT |
106 | } |
107 | ||
108 | static int pool_hashkey_keycmp(const void *key, struct hlist_node *compared_hnode) | |
109 | { | |
110 | char *pool_name; | |
111 | struct pool_desc *pool; | |
112 | ||
113 | pool_name = (char *)key; | |
114 | pool = hlist_entry(compared_hnode, struct pool_desc, pool_hash); | |
115 | return !strncmp(pool_name, pool->pool_name, LOV_MAXPOOLNAME); | |
116 | } | |
117 | ||
118 | static void *pool_hashobject(struct hlist_node *hnode) | |
119 | { | |
120 | return hlist_entry(hnode, struct pool_desc, pool_hash); | |
121 | } | |
122 | ||
6da6eabe | 123 | static void pool_hashrefcount_get(struct cfs_hash *hs, struct hlist_node *hnode) |
d7e09d03 PT |
124 | { |
125 | struct pool_desc *pool; | |
126 | ||
127 | pool = hlist_entry(hnode, struct pool_desc, pool_hash); | |
128 | lov_pool_getref(pool); | |
129 | } | |
130 | ||
6da6eabe | 131 | static void pool_hashrefcount_put_locked(struct cfs_hash *hs, |
d7e09d03 PT |
132 | struct hlist_node *hnode) |
133 | { | |
134 | struct pool_desc *pool; | |
135 | ||
136 | pool = hlist_entry(hnode, struct pool_desc, pool_hash); | |
137 | lov_pool_putref_locked(pool); | |
138 | } | |
139 | ||
db9fc06b | 140 | struct cfs_hash_ops pool_hash_operations = { |
d7e09d03 | 141 | .hs_hash = pool_hashfn, |
db9fc06b | 142 | .hs_key = pool_key, |
d7e09d03 PT |
143 | .hs_keycmp = pool_hashkey_keycmp, |
144 | .hs_object = pool_hashobject, | |
db9fc06b | 145 | .hs_get = pool_hashrefcount_get, |
d7e09d03 PT |
146 | .hs_put_locked = pool_hashrefcount_put_locked, |
147 | ||
148 | }; | |
149 | ||
d7e09d03 | 150 | /* |
64f17a15 | 151 | * pool debugfs seq_file methods |
d7e09d03 PT |
152 | */ |
153 | /* | |
154 | * iterator is used to go through the target pool entries | |
155 | * index is the current entry index in the lp_array[] array | |
156 | * index >= pos returned to the seq_file interface | |
157 | * pos is from 0 to (pool->pool_obds.op_count - 1) | |
158 | */ | |
159 | #define POOL_IT_MAGIC 0xB001CEA0 | |
160 | struct pool_iterator { | |
161 | int magic; | |
162 | struct pool_desc *pool; | |
163 | int idx; /* from 0 to pool_tgt_size - 1 */ | |
164 | }; | |
165 | ||
166 | static void *pool_proc_next(struct seq_file *s, void *v, loff_t *pos) | |
167 | { | |
168 | struct pool_iterator *iter = (struct pool_iterator *)s->private; | |
169 | int prev_idx; | |
170 | ||
19b2056f | 171 | LASSERTF(iter->magic == POOL_IT_MAGIC, "%08X\n", iter->magic); |
d7e09d03 PT |
172 | |
173 | /* test if end of file */ | |
174 | if (*pos >= pool_tgt_count(iter->pool)) | |
175 | return NULL; | |
176 | ||
177 | /* iterate to find a non empty entry */ | |
178 | prev_idx = iter->idx; | |
179 | down_read(&pool_tgt_rw_sem(iter->pool)); | |
180 | iter->idx++; | |
181 | if (iter->idx == pool_tgt_count(iter->pool)) { | |
182 | iter->idx = prev_idx; /* we stay on the last entry */ | |
183 | up_read(&pool_tgt_rw_sem(iter->pool)); | |
184 | return NULL; | |
185 | } | |
186 | up_read(&pool_tgt_rw_sem(iter->pool)); | |
187 | (*pos)++; | |
188 | /* return != NULL to continue */ | |
189 | return iter; | |
190 | } | |
191 | ||
192 | static void *pool_proc_start(struct seq_file *s, loff_t *pos) | |
193 | { | |
194 | struct pool_desc *pool = (struct pool_desc *)s->private; | |
195 | struct pool_iterator *iter; | |
196 | ||
197 | lov_pool_getref(pool); | |
198 | if ((pool_tgt_count(pool) == 0) || | |
199 | (*pos >= pool_tgt_count(pool))) { | |
200 | /* iter is not created, so stop() has no way to | |
acb9abc1 OD |
201 | * find pool to dec ref |
202 | */ | |
d7e09d03 PT |
203 | lov_pool_putref(pool); |
204 | return NULL; | |
205 | } | |
206 | ||
840c94d5 | 207 | iter = kzalloc(sizeof(*iter), GFP_NOFS); |
d7e09d03 PT |
208 | if (!iter) |
209 | return ERR_PTR(-ENOMEM); | |
210 | iter->magic = POOL_IT_MAGIC; | |
211 | iter->pool = pool; | |
212 | iter->idx = 0; | |
213 | ||
214 | /* we use seq_file private field to memorized iterator so | |
acb9abc1 OD |
215 | * we can free it at stop() |
216 | */ | |
d7e09d03 PT |
217 | /* /!\ do not forget to restore it to pool before freeing it */ |
218 | s->private = iter; | |
219 | if (*pos > 0) { | |
220 | loff_t i; | |
221 | void *ptr; | |
222 | ||
223 | i = 0; | |
224 | do { | |
defa220f | 225 | ptr = pool_proc_next(s, &iter, &i); |
00697c43 | 226 | } while ((i < *pos) && ptr); |
d7e09d03 PT |
227 | return ptr; |
228 | } | |
229 | return iter; | |
230 | } | |
231 | ||
232 | static void pool_proc_stop(struct seq_file *s, void *v) | |
233 | { | |
234 | struct pool_iterator *iter = (struct pool_iterator *)s->private; | |
235 | ||
236 | /* in some cases stop() method is called 2 times, without | |
237 | * calling start() method (see seq_read() from fs/seq_file.c) | |
acb9abc1 OD |
238 | * we have to free only if s->private is an iterator |
239 | */ | |
d7e09d03 PT |
240 | if ((iter) && (iter->magic == POOL_IT_MAGIC)) { |
241 | /* we restore s->private so next call to pool_proc_start() | |
acb9abc1 OD |
242 | * will work |
243 | */ | |
d7e09d03 PT |
244 | s->private = iter->pool; |
245 | lov_pool_putref(iter->pool); | |
840c94d5 | 246 | kfree(iter); |
d7e09d03 | 247 | } |
d7e09d03 PT |
248 | } |
249 | ||
250 | static int pool_proc_show(struct seq_file *s, void *v) | |
251 | { | |
252 | struct pool_iterator *iter = (struct pool_iterator *)v; | |
253 | struct lov_tgt_desc *tgt; | |
254 | ||
19b2056f | 255 | LASSERTF(iter->magic == POOL_IT_MAGIC, "%08X\n", iter->magic); |
00697c43 | 256 | LASSERT(iter->pool); |
d7e09d03 PT |
257 | LASSERT(iter->idx <= pool_tgt_count(iter->pool)); |
258 | ||
259 | down_read(&pool_tgt_rw_sem(iter->pool)); | |
260 | tgt = pool_tgt(iter->pool, iter->idx); | |
261 | up_read(&pool_tgt_rw_sem(iter->pool)); | |
262 | if (tgt) | |
49880263 | 263 | seq_printf(s, "%s\n", obd_uuid2str(&tgt->ltd_uuid)); |
d7e09d03 PT |
264 | |
265 | return 0; | |
266 | } | |
267 | ||
02b31079 | 268 | static const struct seq_operations pool_proc_ops = { |
d7e09d03 PT |
269 | .start = pool_proc_start, |
270 | .next = pool_proc_next, | |
271 | .stop = pool_proc_stop, | |
272 | .show = pool_proc_show, | |
273 | }; | |
274 | ||
275 | static int pool_proc_open(struct inode *inode, struct file *file) | |
276 | { | |
277 | int rc; | |
278 | ||
279 | rc = seq_open(file, &pool_proc_ops); | |
280 | if (!rc) { | |
281 | struct seq_file *s = file->private_data; | |
50ffcb7e | 282 | |
61e87ab0 | 283 | s->private = inode->i_private; |
d7e09d03 PT |
284 | } |
285 | return rc; | |
286 | } | |
287 | ||
288 | static struct file_operations pool_proc_operations = { | |
289 | .open = pool_proc_open, | |
290 | .read = seq_read, | |
291 | .llseek = seq_lseek, | |
292 | .release = seq_release, | |
293 | }; | |
d7e09d03 | 294 | |
d7e09d03 PT |
295 | #define LOV_POOL_INIT_COUNT 2 |
296 | int lov_ost_pool_init(struct ost_pool *op, unsigned int count) | |
297 | { | |
d7e09d03 PT |
298 | if (count == 0) |
299 | count = LOV_POOL_INIT_COUNT; | |
300 | op->op_array = NULL; | |
301 | op->op_count = 0; | |
302 | init_rwsem(&op->op_rw_sem); | |
303 | op->op_size = count; | |
840c94d5 | 304 | op->op_array = kcalloc(op->op_size, sizeof(op->op_array[0]), GFP_NOFS); |
00697c43 | 305 | if (!op->op_array) { |
d7e09d03 | 306 | op->op_size = 0; |
0a3bdb00 | 307 | return -ENOMEM; |
d7e09d03 | 308 | } |
d7e09d03 PT |
309 | return 0; |
310 | } | |
311 | ||
312 | /* Caller must hold write op_rwlock */ | |
313 | int lov_ost_pool_extend(struct ost_pool *op, unsigned int min_count) | |
314 | { | |
315 | __u32 *new; | |
316 | int new_size; | |
317 | ||
318 | LASSERT(min_count != 0); | |
319 | ||
320 | if (op->op_count < op->op_size) | |
321 | return 0; | |
322 | ||
323 | new_size = max(min_count, 2 * op->op_size); | |
840c94d5 | 324 | new = kcalloc(new_size, sizeof(op->op_array[0]), GFP_NOFS); |
00697c43 | 325 | if (!new) |
d7e09d03 PT |
326 | return -ENOMEM; |
327 | ||
328 | /* copy old array to new one */ | |
329 | memcpy(new, op->op_array, op->op_size * sizeof(op->op_array[0])); | |
840c94d5 | 330 | kfree(op->op_array); |
d7e09d03 PT |
331 | op->op_array = new; |
332 | op->op_size = new_size; | |
333 | return 0; | |
334 | } | |
335 | ||
336 | int lov_ost_pool_add(struct ost_pool *op, __u32 idx, unsigned int min_count) | |
337 | { | |
338 | int rc = 0, i; | |
d7e09d03 PT |
339 | |
340 | down_write(&op->op_rw_sem); | |
341 | ||
342 | rc = lov_ost_pool_extend(op, min_count); | |
343 | if (rc) | |
18751668 | 344 | goto out; |
d7e09d03 PT |
345 | |
346 | /* search ost in pool array */ | |
347 | for (i = 0; i < op->op_count; i++) { | |
18751668 JL |
348 | if (op->op_array[i] == idx) { |
349 | rc = -EEXIST; | |
350 | goto out; | |
351 | } | |
d7e09d03 PT |
352 | } |
353 | /* ost not found we add it */ | |
354 | op->op_array[op->op_count] = idx; | |
355 | op->op_count++; | |
d7e09d03 PT |
356 | out: |
357 | up_write(&op->op_rw_sem); | |
358 | return rc; | |
359 | } | |
360 | ||
361 | int lov_ost_pool_remove(struct ost_pool *op, __u32 idx) | |
362 | { | |
363 | int i; | |
d7e09d03 PT |
364 | |
365 | down_write(&op->op_rw_sem); | |
366 | ||
367 | for (i = 0; i < op->op_count; i++) { | |
368 | if (op->op_array[i] == idx) { | |
369 | memmove(&op->op_array[i], &op->op_array[i + 1], | |
370 | (op->op_count - i - 1) * sizeof(op->op_array[0])); | |
371 | op->op_count--; | |
372 | up_write(&op->op_rw_sem); | |
d7e09d03 PT |
373 | return 0; |
374 | } | |
375 | } | |
376 | ||
377 | up_write(&op->op_rw_sem); | |
0a3bdb00 | 378 | return -EINVAL; |
d7e09d03 PT |
379 | } |
380 | ||
381 | int lov_ost_pool_free(struct ost_pool *op) | |
382 | { | |
d7e09d03 | 383 | if (op->op_size == 0) |
0a3bdb00 | 384 | return 0; |
d7e09d03 PT |
385 | |
386 | down_write(&op->op_rw_sem); | |
387 | ||
840c94d5 | 388 | kfree(op->op_array); |
d7e09d03 PT |
389 | op->op_array = NULL; |
390 | op->op_count = 0; | |
391 | op->op_size = 0; | |
392 | ||
393 | up_write(&op->op_rw_sem); | |
0a3bdb00 | 394 | return 0; |
d7e09d03 PT |
395 | } |
396 | ||
d7e09d03 PT |
397 | int lov_pool_new(struct obd_device *obd, char *poolname) |
398 | { | |
399 | struct lov_obd *lov; | |
400 | struct pool_desc *new_pool; | |
401 | int rc; | |
d7e09d03 | 402 | |
49880263 | 403 | lov = &obd->u.lov; |
d7e09d03 PT |
404 | |
405 | if (strlen(poolname) > LOV_MAXPOOLNAME) | |
0a3bdb00 | 406 | return -ENAMETOOLONG; |
d7e09d03 | 407 | |
840c94d5 | 408 | new_pool = kzalloc(sizeof(*new_pool), GFP_NOFS); |
36a86fe6 | 409 | if (!new_pool) |
0a3bdb00 | 410 | return -ENOMEM; |
d7e09d03 | 411 | |
9563fe8a | 412 | strlcpy(new_pool->pool_name, poolname, sizeof(new_pool->pool_name)); |
d7e09d03 PT |
413 | new_pool->pool_lobd = obd; |
414 | /* ref count init to 1 because when created a pool is always used | |
415 | * up to deletion | |
416 | */ | |
417 | atomic_set(&new_pool->pool_refcount, 1); | |
418 | rc = lov_ost_pool_init(&new_pool->pool_obds, 0); | |
419 | if (rc) | |
18751668 | 420 | goto out_err; |
d7e09d03 | 421 | |
d7e09d03 PT |
422 | INIT_HLIST_NODE(&new_pool->pool_hash); |
423 | ||
64f17a15 | 424 | /* get ref for debugfs file */ |
d7e09d03 | 425 | lov_pool_getref(new_pool); |
61e87ab0 DE |
426 | new_pool->pool_debugfs_entry = ldebugfs_add_simple( |
427 | lov->lov_pool_debugfs_entry, | |
428 | poolname, new_pool, | |
429 | &pool_proc_operations); | |
430 | if (IS_ERR_OR_NULL(new_pool->pool_debugfs_entry)) { | |
431 | CWARN("Cannot add debugfs pool entry "LOV_POOLNAMEF"\n", | |
432 | poolname); | |
433 | new_pool->pool_debugfs_entry = NULL; | |
d7e09d03 PT |
434 | lov_pool_putref(new_pool); |
435 | } | |
61e87ab0 | 436 | CDEBUG(D_INFO, "pool %p - proc %p\n", |
f1564f16 | 437 | new_pool, new_pool->pool_debugfs_entry); |
d7e09d03 PT |
438 | |
439 | spin_lock(&obd->obd_dev_lock); | |
440 | list_add_tail(&new_pool->pool_list, &lov->lov_pool_list); | |
441 | lov->lov_pool_count++; | |
442 | spin_unlock(&obd->obd_dev_lock); | |
443 | ||
444 | /* add to find only when it fully ready */ | |
445 | rc = cfs_hash_add_unique(lov->lov_pools_hash_body, poolname, | |
446 | &new_pool->pool_hash); | |
18751668 JL |
447 | if (rc) { |
448 | rc = -EEXIST; | |
449 | goto out_err; | |
450 | } | |
d7e09d03 PT |
451 | |
452 | CDEBUG(D_CONFIG, LOV_POOLNAMEF" is pool #%d\n", | |
453 | poolname, lov->lov_pool_count); | |
454 | ||
0a3bdb00 | 455 | return 0; |
d7e09d03 PT |
456 | |
457 | out_err: | |
458 | spin_lock(&obd->obd_dev_lock); | |
459 | list_del_init(&new_pool->pool_list); | |
460 | lov->lov_pool_count--; | |
461 | spin_unlock(&obd->obd_dev_lock); | |
61e87ab0 | 462 | ldebugfs_remove(&new_pool->pool_debugfs_entry); |
d7e09d03 | 463 | lov_ost_pool_free(&new_pool->pool_obds); |
840c94d5 | 464 | kfree(new_pool); |
ae322e05 | 465 | |
d7e09d03 PT |
466 | return rc; |
467 | } | |
468 | ||
469 | int lov_pool_del(struct obd_device *obd, char *poolname) | |
470 | { | |
471 | struct lov_obd *lov; | |
472 | struct pool_desc *pool; | |
d7e09d03 | 473 | |
49880263 | 474 | lov = &obd->u.lov; |
d7e09d03 PT |
475 | |
476 | /* lookup and kill hash reference */ | |
477 | pool = cfs_hash_del_key(lov->lov_pools_hash_body, poolname); | |
00697c43 | 478 | if (!pool) |
0a3bdb00 | 479 | return -ENOENT; |
d7e09d03 | 480 | |
61e87ab0 DE |
481 | if (!IS_ERR_OR_NULL(pool->pool_debugfs_entry)) { |
482 | CDEBUG(D_INFO, "proc entry %p\n", pool->pool_debugfs_entry); | |
483 | ldebugfs_remove(&pool->pool_debugfs_entry); | |
d7e09d03 PT |
484 | lov_pool_putref(pool); |
485 | } | |
486 | ||
487 | spin_lock(&obd->obd_dev_lock); | |
488 | list_del_init(&pool->pool_list); | |
489 | lov->lov_pool_count--; | |
490 | spin_unlock(&obd->obd_dev_lock); | |
491 | ||
492 | /* release last reference */ | |
493 | lov_pool_putref(pool); | |
494 | ||
0a3bdb00 | 495 | return 0; |
d7e09d03 PT |
496 | } |
497 | ||
d7e09d03 PT |
498 | int lov_pool_add(struct obd_device *obd, char *poolname, char *ostname) |
499 | { | |
500 | struct obd_uuid ost_uuid; | |
501 | struct lov_obd *lov; | |
502 | struct pool_desc *pool; | |
503 | unsigned int lov_idx; | |
504 | int rc; | |
d7e09d03 | 505 | |
49880263 | 506 | lov = &obd->u.lov; |
d7e09d03 PT |
507 | |
508 | pool = cfs_hash_lookup(lov->lov_pools_hash_body, poolname); | |
00697c43 | 509 | if (!pool) |
0a3bdb00 | 510 | return -ENOENT; |
d7e09d03 PT |
511 | |
512 | obd_str2uuid(&ost_uuid, ostname); | |
513 | ||
d7e09d03 PT |
514 | /* search ost in lov array */ |
515 | obd_getref(obd); | |
516 | for (lov_idx = 0; lov_idx < lov->desc.ld_tgt_count; lov_idx++) { | |
517 | if (!lov->lov_tgts[lov_idx]) | |
518 | continue; | |
519 | if (obd_uuid_equals(&ost_uuid, | |
49880263 | 520 | &lov->lov_tgts[lov_idx]->ltd_uuid)) |
d7e09d03 PT |
521 | break; |
522 | } | |
523 | /* test if ost found in lov */ | |
18751668 JL |
524 | if (lov_idx == lov->desc.ld_tgt_count) { |
525 | rc = -EINVAL; | |
526 | goto out; | |
527 | } | |
d7e09d03 PT |
528 | |
529 | rc = lov_ost_pool_add(&pool->pool_obds, lov_idx, lov->lov_tgt_size); | |
530 | if (rc) | |
18751668 | 531 | goto out; |
d7e09d03 | 532 | |
d7e09d03 PT |
533 | CDEBUG(D_CONFIG, "Added %s to "LOV_POOLNAMEF" as member %d\n", |
534 | ostname, poolname, pool_tgt_count(pool)); | |
535 | ||
d7e09d03 PT |
536 | out: |
537 | obd_putref(obd); | |
538 | lov_pool_putref(pool); | |
539 | return rc; | |
540 | } | |
541 | ||
542 | int lov_pool_remove(struct obd_device *obd, char *poolname, char *ostname) | |
543 | { | |
544 | struct obd_uuid ost_uuid; | |
545 | struct lov_obd *lov; | |
546 | struct pool_desc *pool; | |
547 | unsigned int lov_idx; | |
548 | int rc = 0; | |
d7e09d03 | 549 | |
49880263 | 550 | lov = &obd->u.lov; |
d7e09d03 PT |
551 | |
552 | pool = cfs_hash_lookup(lov->lov_pools_hash_body, poolname); | |
00697c43 | 553 | if (!pool) |
0a3bdb00 | 554 | return -ENOENT; |
d7e09d03 PT |
555 | |
556 | obd_str2uuid(&ost_uuid, ostname); | |
557 | ||
558 | obd_getref(obd); | |
559 | /* search ost in lov array, to get index */ | |
560 | for (lov_idx = 0; lov_idx < lov->desc.ld_tgt_count; lov_idx++) { | |
561 | if (!lov->lov_tgts[lov_idx]) | |
562 | continue; | |
563 | ||
564 | if (obd_uuid_equals(&ost_uuid, | |
49880263 | 565 | &lov->lov_tgts[lov_idx]->ltd_uuid)) |
d7e09d03 PT |
566 | break; |
567 | } | |
568 | ||
569 | /* test if ost found in lov */ | |
18751668 JL |
570 | if (lov_idx == lov->desc.ld_tgt_count) { |
571 | rc = -EINVAL; | |
572 | goto out; | |
573 | } | |
d7e09d03 PT |
574 | |
575 | lov_ost_pool_remove(&pool->pool_obds, lov_idx); | |
576 | ||
d7e09d03 PT |
577 | CDEBUG(D_CONFIG, "%s removed from "LOV_POOLNAMEF"\n", ostname, |
578 | poolname); | |
579 | ||
d7e09d03 PT |
580 | out: |
581 | obd_putref(obd); | |
582 | lov_pool_putref(pool); | |
583 | return rc; | |
584 | } |