disk_groups.c 13 KB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130131132133134135136137138139140141142143144145146147148149150151152153154155156157158159160161162163164165166167168169170171172173174175176177178179180181182183184185186187188189190191192193194195196197198199200201202203204205206207208209210211212213214215216217218219220221222223224225226227228229230231232233234235236237238239240241242243244245246247248249250251252253254255256257258259260261262263264265266267268269270271272273274275276277278279280281282283284285286287288289290291292293294295296297298299300301302303304305306307308309310311312313314315316317318319320321322323324325326327328329330331332333334335336337338339340341342343344345346347348349350351352353354355356357358359360361362363364365366367368369370371372373374375376377378379380381382383384385386387388389390391392393394395396397398399400401402403404405406407408409410411412413414415416417418419420421422423424425426427428429430431432433434435436437438439440441442443444445446447448449450451452453454455456457458459460461462463464465466467468469470471472473474475476477478479480481482483484485486487488489490491492493494495496497498499500501502503504505506507508509510511512513514515516517518519520521522523524525526527528529530531532533534535536537538539540541542543544545546547548549550551552553554555556557558559560561562563564565566567568569570571572573574575576577578579580581582583584585586587588589590591592593594595596597598599600601602603604605606607608609610611612613614615616
  1. // SPDX-License-Identifier: GPL-2.0
  2. #include "bcachefs.h"
  3. #include "disk_groups.h"
  4. #include "sb-members.h"
  5. #include "super-io.h"
  6. #include <linux/sort.h>
  7. static int group_cmp(const void *_l, const void *_r)
  8. {
  9. const struct bch_disk_group *l = _l;
  10. const struct bch_disk_group *r = _r;
  11. return ((BCH_GROUP_DELETED(l) > BCH_GROUP_DELETED(r)) -
  12. (BCH_GROUP_DELETED(l) < BCH_GROUP_DELETED(r))) ?:
  13. ((BCH_GROUP_PARENT(l) > BCH_GROUP_PARENT(r)) -
  14. (BCH_GROUP_PARENT(l) < BCH_GROUP_PARENT(r))) ?:
  15. strncmp(l->label, r->label, sizeof(l->label));
  16. }
  17. static int bch2_sb_disk_groups_validate(struct bch_sb *sb, struct bch_sb_field *f,
  18. enum bch_validate_flags flags, struct printbuf *err)
  19. {
  20. struct bch_sb_field_disk_groups *groups =
  21. field_to_type(f, disk_groups);
  22. struct bch_disk_group *g, *sorted = NULL;
  23. unsigned nr_groups = disk_groups_nr(groups);
  24. unsigned i, len;
  25. int ret = 0;
  26. for (i = 0; i < sb->nr_devices; i++) {
  27. struct bch_member m = bch2_sb_member_get(sb, i);
  28. unsigned group_id;
  29. if (!BCH_MEMBER_GROUP(&m))
  30. continue;
  31. group_id = BCH_MEMBER_GROUP(&m) - 1;
  32. if (group_id >= nr_groups) {
  33. prt_printf(err, "disk %u has invalid label %u (have %u)",
  34. i, group_id, nr_groups);
  35. return -BCH_ERR_invalid_sb_disk_groups;
  36. }
  37. if (BCH_GROUP_DELETED(&groups->entries[group_id])) {
  38. prt_printf(err, "disk %u has deleted label %u", i, group_id);
  39. return -BCH_ERR_invalid_sb_disk_groups;
  40. }
  41. }
  42. if (!nr_groups)
  43. return 0;
  44. for (i = 0; i < nr_groups; i++) {
  45. g = groups->entries + i;
  46. if (BCH_GROUP_DELETED(g))
  47. continue;
  48. len = strnlen(g->label, sizeof(g->label));
  49. if (!len) {
  50. prt_printf(err, "label %u empty", i);
  51. return -BCH_ERR_invalid_sb_disk_groups;
  52. }
  53. }
  54. sorted = kmalloc_array(nr_groups, sizeof(*sorted), GFP_KERNEL);
  55. if (!sorted)
  56. return -BCH_ERR_ENOMEM_disk_groups_validate;
  57. memcpy(sorted, groups->entries, nr_groups * sizeof(*sorted));
  58. sort(sorted, nr_groups, sizeof(*sorted), group_cmp, NULL);
  59. for (g = sorted; g + 1 < sorted + nr_groups; g++)
  60. if (!BCH_GROUP_DELETED(g) &&
  61. !group_cmp(&g[0], &g[1])) {
  62. prt_printf(err, "duplicate label %llu.%.*s",
  63. BCH_GROUP_PARENT(g),
  64. (int) sizeof(g->label), g->label);
  65. ret = -BCH_ERR_invalid_sb_disk_groups;
  66. goto err;
  67. }
  68. err:
  69. kfree(sorted);
  70. return ret;
  71. }
  72. void bch2_disk_groups_to_text(struct printbuf *out, struct bch_fs *c)
  73. {
  74. out->atomic++;
  75. rcu_read_lock();
  76. struct bch_disk_groups_cpu *g = rcu_dereference(c->disk_groups);
  77. if (!g)
  78. goto out;
  79. for (unsigned i = 0; i < g->nr; i++) {
  80. if (i)
  81. prt_printf(out, " ");
  82. if (g->entries[i].deleted) {
  83. prt_printf(out, "[deleted]");
  84. continue;
  85. }
  86. prt_printf(out, "[parent %d devs", g->entries[i].parent);
  87. for_each_member_device_rcu(c, ca, &g->entries[i].devs)
  88. prt_printf(out, " %s", ca->name);
  89. prt_printf(out, "]");
  90. }
  91. out:
  92. rcu_read_unlock();
  93. out->atomic--;
  94. }
  95. static void bch2_sb_disk_groups_to_text(struct printbuf *out,
  96. struct bch_sb *sb,
  97. struct bch_sb_field *f)
  98. {
  99. struct bch_sb_field_disk_groups *groups =
  100. field_to_type(f, disk_groups);
  101. struct bch_disk_group *g;
  102. unsigned nr_groups = disk_groups_nr(groups);
  103. for (g = groups->entries;
  104. g < groups->entries + nr_groups;
  105. g++) {
  106. if (g != groups->entries)
  107. prt_printf(out, " ");
  108. if (BCH_GROUP_DELETED(g))
  109. prt_printf(out, "[deleted]");
  110. else
  111. prt_printf(out, "[parent %llu name %s]",
  112. BCH_GROUP_PARENT(g), g->label);
  113. }
  114. }
  115. const struct bch_sb_field_ops bch_sb_field_ops_disk_groups = {
  116. .validate = bch2_sb_disk_groups_validate,
  117. .to_text = bch2_sb_disk_groups_to_text
  118. };
  119. int bch2_sb_disk_groups_to_cpu(struct bch_fs *c)
  120. {
  121. struct bch_sb_field_disk_groups *groups;
  122. struct bch_disk_groups_cpu *cpu_g, *old_g;
  123. unsigned i, g, nr_groups;
  124. lockdep_assert_held(&c->sb_lock);
  125. groups = bch2_sb_field_get(c->disk_sb.sb, disk_groups);
  126. nr_groups = disk_groups_nr(groups);
  127. if (!groups)
  128. return 0;
  129. cpu_g = kzalloc(struct_size(cpu_g, entries, nr_groups), GFP_KERNEL);
  130. if (!cpu_g)
  131. return -BCH_ERR_ENOMEM_disk_groups_to_cpu;
  132. cpu_g->nr = nr_groups;
  133. for (i = 0; i < nr_groups; i++) {
  134. struct bch_disk_group *src = &groups->entries[i];
  135. struct bch_disk_group_cpu *dst = &cpu_g->entries[i];
  136. dst->deleted = BCH_GROUP_DELETED(src);
  137. dst->parent = BCH_GROUP_PARENT(src);
  138. memcpy(dst->label, src->label, sizeof(dst->label));
  139. }
  140. for (i = 0; i < c->disk_sb.sb->nr_devices; i++) {
  141. struct bch_member m = bch2_sb_member_get(c->disk_sb.sb, i);
  142. struct bch_disk_group_cpu *dst;
  143. if (!bch2_member_alive(&m))
  144. continue;
  145. g = BCH_MEMBER_GROUP(&m);
  146. while (g) {
  147. dst = &cpu_g->entries[g - 1];
  148. __set_bit(i, dst->devs.d);
  149. g = dst->parent;
  150. }
  151. }
  152. old_g = rcu_dereference_protected(c->disk_groups,
  153. lockdep_is_held(&c->sb_lock));
  154. rcu_assign_pointer(c->disk_groups, cpu_g);
  155. if (old_g)
  156. kfree_rcu(old_g, rcu);
  157. return 0;
  158. }
  159. const struct bch_devs_mask *bch2_target_to_mask(struct bch_fs *c, unsigned target)
  160. {
  161. struct target t = target_decode(target);
  162. struct bch_devs_mask *devs;
  163. rcu_read_lock();
  164. switch (t.type) {
  165. case TARGET_NULL:
  166. devs = NULL;
  167. break;
  168. case TARGET_DEV: {
  169. struct bch_dev *ca = t.dev < c->sb.nr_devices
  170. ? rcu_dereference(c->devs[t.dev])
  171. : NULL;
  172. devs = ca ? &ca->self : NULL;
  173. break;
  174. }
  175. case TARGET_GROUP: {
  176. struct bch_disk_groups_cpu *g = rcu_dereference(c->disk_groups);
  177. devs = g && t.group < g->nr && !g->entries[t.group].deleted
  178. ? &g->entries[t.group].devs
  179. : NULL;
  180. break;
  181. }
  182. default:
  183. BUG();
  184. }
  185. rcu_read_unlock();
  186. return devs;
  187. }
  188. bool bch2_dev_in_target(struct bch_fs *c, unsigned dev, unsigned target)
  189. {
  190. struct target t = target_decode(target);
  191. switch (t.type) {
  192. case TARGET_NULL:
  193. return false;
  194. case TARGET_DEV:
  195. return dev == t.dev;
  196. case TARGET_GROUP: {
  197. struct bch_disk_groups_cpu *g;
  198. const struct bch_devs_mask *m;
  199. bool ret;
  200. rcu_read_lock();
  201. g = rcu_dereference(c->disk_groups);
  202. m = g && t.group < g->nr && !g->entries[t.group].deleted
  203. ? &g->entries[t.group].devs
  204. : NULL;
  205. ret = m ? test_bit(dev, m->d) : false;
  206. rcu_read_unlock();
  207. return ret;
  208. }
  209. default:
  210. BUG();
  211. }
  212. }
  213. static int __bch2_disk_group_find(struct bch_sb_field_disk_groups *groups,
  214. unsigned parent,
  215. const char *name, unsigned namelen)
  216. {
  217. unsigned i, nr_groups = disk_groups_nr(groups);
  218. if (!namelen || namelen > BCH_SB_LABEL_SIZE)
  219. return -EINVAL;
  220. for (i = 0; i < nr_groups; i++) {
  221. struct bch_disk_group *g = groups->entries + i;
  222. if (BCH_GROUP_DELETED(g))
  223. continue;
  224. if (!BCH_GROUP_DELETED(g) &&
  225. BCH_GROUP_PARENT(g) == parent &&
  226. strnlen(g->label, sizeof(g->label)) == namelen &&
  227. !memcmp(name, g->label, namelen))
  228. return i;
  229. }
  230. return -1;
  231. }
  232. static int __bch2_disk_group_add(struct bch_sb_handle *sb, unsigned parent,
  233. const char *name, unsigned namelen)
  234. {
  235. struct bch_sb_field_disk_groups *groups =
  236. bch2_sb_field_get(sb->sb, disk_groups);
  237. unsigned i, nr_groups = disk_groups_nr(groups);
  238. struct bch_disk_group *g;
  239. if (!namelen || namelen > BCH_SB_LABEL_SIZE)
  240. return -EINVAL;
  241. for (i = 0;
  242. i < nr_groups && !BCH_GROUP_DELETED(&groups->entries[i]);
  243. i++)
  244. ;
  245. if (i == nr_groups) {
  246. unsigned u64s =
  247. (sizeof(struct bch_sb_field_disk_groups) +
  248. sizeof(struct bch_disk_group) * (nr_groups + 1)) /
  249. sizeof(u64);
  250. groups = bch2_sb_field_resize(sb, disk_groups, u64s);
  251. if (!groups)
  252. return -BCH_ERR_ENOSPC_disk_label_add;
  253. nr_groups = disk_groups_nr(groups);
  254. }
  255. BUG_ON(i >= nr_groups);
  256. g = &groups->entries[i];
  257. memcpy(g->label, name, namelen);
  258. if (namelen < sizeof(g->label))
  259. g->label[namelen] = '\0';
  260. SET_BCH_GROUP_DELETED(g, 0);
  261. SET_BCH_GROUP_PARENT(g, parent);
  262. SET_BCH_GROUP_DATA_ALLOWED(g, ~0);
  263. return i;
  264. }
  265. int bch2_disk_path_find(struct bch_sb_handle *sb, const char *name)
  266. {
  267. struct bch_sb_field_disk_groups *groups =
  268. bch2_sb_field_get(sb->sb, disk_groups);
  269. int v = -1;
  270. do {
  271. const char *next = strchrnul(name, '.');
  272. unsigned len = next - name;
  273. if (*next == '.')
  274. next++;
  275. v = __bch2_disk_group_find(groups, v + 1, name, len);
  276. name = next;
  277. } while (*name && v >= 0);
  278. return v;
  279. }
  280. int bch2_disk_path_find_or_create(struct bch_sb_handle *sb, const char *name)
  281. {
  282. struct bch_sb_field_disk_groups *groups;
  283. unsigned parent = 0;
  284. int v = -1;
  285. do {
  286. const char *next = strchrnul(name, '.');
  287. unsigned len = next - name;
  288. if (*next == '.')
  289. next++;
  290. groups = bch2_sb_field_get(sb->sb, disk_groups);
  291. v = __bch2_disk_group_find(groups, parent, name, len);
  292. if (v < 0)
  293. v = __bch2_disk_group_add(sb, parent, name, len);
  294. if (v < 0)
  295. return v;
  296. parent = v + 1;
  297. name = next;
  298. } while (*name && v >= 0);
  299. return v;
  300. }
  301. void bch2_disk_path_to_text(struct printbuf *out, struct bch_fs *c, unsigned v)
  302. {
  303. struct bch_disk_groups_cpu *groups;
  304. struct bch_disk_group_cpu *g;
  305. unsigned nr = 0;
  306. u16 path[32];
  307. out->atomic++;
  308. rcu_read_lock();
  309. groups = rcu_dereference(c->disk_groups);
  310. if (!groups)
  311. goto invalid;
  312. while (1) {
  313. if (nr == ARRAY_SIZE(path))
  314. goto invalid;
  315. if (v >= groups->nr)
  316. goto invalid;
  317. g = groups->entries + v;
  318. if (g->deleted)
  319. goto invalid;
  320. path[nr++] = v;
  321. if (!g->parent)
  322. break;
  323. v = g->parent - 1;
  324. }
  325. while (nr) {
  326. v = path[--nr];
  327. g = groups->entries + v;
  328. prt_printf(out, "%.*s", (int) sizeof(g->label), g->label);
  329. if (nr)
  330. prt_printf(out, ".");
  331. }
  332. out:
  333. rcu_read_unlock();
  334. out->atomic--;
  335. return;
  336. invalid:
  337. prt_printf(out, "invalid label %u", v);
  338. goto out;
  339. }
  340. void bch2_disk_path_to_text_sb(struct printbuf *out, struct bch_sb *sb, unsigned v)
  341. {
  342. struct bch_sb_field_disk_groups *groups =
  343. bch2_sb_field_get(sb, disk_groups);
  344. struct bch_disk_group *g;
  345. unsigned nr = 0;
  346. u16 path[32];
  347. while (1) {
  348. if (nr == ARRAY_SIZE(path))
  349. goto inval;
  350. if (v >= disk_groups_nr(groups))
  351. goto inval;
  352. g = groups->entries + v;
  353. if (BCH_GROUP_DELETED(g))
  354. goto inval;
  355. path[nr++] = v;
  356. if (!BCH_GROUP_PARENT(g))
  357. break;
  358. v = BCH_GROUP_PARENT(g) - 1;
  359. }
  360. while (nr) {
  361. v = path[--nr];
  362. g = groups->entries + v;
  363. prt_printf(out, "%.*s", (int) sizeof(g->label), g->label);
  364. if (nr)
  365. prt_printf(out, ".");
  366. }
  367. return;
  368. inval:
  369. prt_printf(out, "invalid label %u", v);
  370. }
  371. int __bch2_dev_group_set(struct bch_fs *c, struct bch_dev *ca, const char *name)
  372. {
  373. struct bch_member *mi;
  374. int ret, v = -1;
  375. if (!strlen(name) || !strcmp(name, "none"))
  376. return 0;
  377. v = bch2_disk_path_find_or_create(&c->disk_sb, name);
  378. if (v < 0)
  379. return v;
  380. ret = bch2_sb_disk_groups_to_cpu(c);
  381. if (ret)
  382. return ret;
  383. mi = bch2_members_v2_get_mut(c->disk_sb.sb, ca->dev_idx);
  384. SET_BCH_MEMBER_GROUP(mi, v + 1);
  385. return 0;
  386. }
  387. int bch2_dev_group_set(struct bch_fs *c, struct bch_dev *ca, const char *name)
  388. {
  389. int ret;
  390. mutex_lock(&c->sb_lock);
  391. ret = __bch2_dev_group_set(c, ca, name) ?:
  392. bch2_write_super(c);
  393. mutex_unlock(&c->sb_lock);
  394. return ret;
  395. }
  396. int bch2_opt_target_parse(struct bch_fs *c, const char *val, u64 *res,
  397. struct printbuf *err)
  398. {
  399. struct bch_dev *ca;
  400. int g;
  401. if (!val)
  402. return -EINVAL;
  403. if (!c)
  404. return -BCH_ERR_option_needs_open_fs;
  405. if (!strlen(val) || !strcmp(val, "none")) {
  406. *res = 0;
  407. return 0;
  408. }
  409. /* Is it a device? */
  410. ca = bch2_dev_lookup(c, val);
  411. if (!IS_ERR(ca)) {
  412. *res = dev_to_target(ca->dev_idx);
  413. bch2_dev_put(ca);
  414. return 0;
  415. }
  416. mutex_lock(&c->sb_lock);
  417. g = bch2_disk_path_find(&c->disk_sb, val);
  418. mutex_unlock(&c->sb_lock);
  419. if (g >= 0) {
  420. *res = group_to_target(g);
  421. return 0;
  422. }
  423. return -EINVAL;
  424. }
  425. void bch2_target_to_text(struct printbuf *out, struct bch_fs *c, unsigned v)
  426. {
  427. struct target t = target_decode(v);
  428. switch (t.type) {
  429. case TARGET_NULL:
  430. prt_printf(out, "none");
  431. break;
  432. case TARGET_DEV: {
  433. struct bch_dev *ca;
  434. out->atomic++;
  435. rcu_read_lock();
  436. ca = t.dev < c->sb.nr_devices
  437. ? rcu_dereference(c->devs[t.dev])
  438. : NULL;
  439. if (ca && percpu_ref_tryget(&ca->io_ref)) {
  440. prt_printf(out, "/dev/%s", ca->name);
  441. percpu_ref_put(&ca->io_ref);
  442. } else if (ca) {
  443. prt_printf(out, "offline device %u", t.dev);
  444. } else {
  445. prt_printf(out, "invalid device %u", t.dev);
  446. }
  447. rcu_read_unlock();
  448. out->atomic--;
  449. break;
  450. }
  451. case TARGET_GROUP:
  452. bch2_disk_path_to_text(out, c, t.group);
  453. break;
  454. default:
  455. BUG();
  456. }
  457. }
  458. static void bch2_target_to_text_sb(struct printbuf *out, struct bch_sb *sb, unsigned v)
  459. {
  460. struct target t = target_decode(v);
  461. switch (t.type) {
  462. case TARGET_NULL:
  463. prt_printf(out, "none");
  464. break;
  465. case TARGET_DEV: {
  466. struct bch_member m = bch2_sb_member_get(sb, t.dev);
  467. if (bch2_member_exists(sb, t.dev)) {
  468. prt_printf(out, "Device ");
  469. pr_uuid(out, m.uuid.b);
  470. prt_printf(out, " (%u)", t.dev);
  471. } else {
  472. prt_printf(out, "Bad device %u", t.dev);
  473. }
  474. break;
  475. }
  476. case TARGET_GROUP:
  477. bch2_disk_path_to_text_sb(out, sb, t.group);
  478. break;
  479. default:
  480. BUG();
  481. }
  482. }
  483. void bch2_opt_target_to_text(struct printbuf *out,
  484. struct bch_fs *c,
  485. struct bch_sb *sb,
  486. u64 v)
  487. {
  488. if (c)
  489. bch2_target_to_text(out, c, v);
  490. else
  491. bch2_target_to_text_sb(out, sb, v);
  492. }