gennvm.c 14 KB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130131132133134135136137138139140141142143144145146147148149150151152153154155156157158159160161162163164165166167168169170171172173174175176177178179180181182183184185186187188189190191192193194195196197198199200201202203204205206207208209210211212213214215216217218219220221222223224225226227228229230231232233234235236237238239240241242243244245246247248249250251252253254255256257258259260261262263264265266267268269270271272273274275276277278279280281282283284285286287288289290291292293294295296297298299300301302303304305306307308309310311312313314315316317318319320321322323324325326327328329330331332333334335336337338339340341342343344345346347348349350351352353354355356357358359360361362363364365366367368369370371372373374375376377378379380381382383384385386387388389390391392393394395396397398399400401402403404405406407408409410411412413414415416417418419420421422423424425426427428429430431432433434435436437438439440441442443444445446447448449450451452453454455456457458459460461462463464465466467468469470471472473474475476477478479480481482483484485486487488489490491492493494495496497498499500501502503504505506507508509510511512513514515516517518519520521522523524525526527528529530531532533534535536537538539540541542543544545546547548549550551552553554555556557558559560561562563564565566567568569570571572573574575576577578579580581582583584585586587588589590591592593594595596597598599600601602603604605606607608609610611612613614615616617618619620621622623624625626627628629630631632633634635636637638639640641642643644645646647648649650651652653654655656657658
  1. /*
  2. * Copyright (C) 2015 Matias Bjorling <m@bjorling.me>
  3. *
  4. * This program is free software; you can redistribute it and/or
  5. * modify it under the terms of the GNU General Public License version
  6. * 2 as published by the Free Software Foundation.
  7. *
  8. * This program is distributed in the hope that it will be useful, but
  9. * WITHOUT ANY WARRANTY; without even the implied warranty of
  10. * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU
  11. * General Public License for more details.
  12. *
  13. * You should have received a copy of the GNU General Public License
  14. * along with this program; see the file COPYING. If not, write to
  15. * the Free Software Foundation, 675 Mass Ave, Cambridge, MA 02139,
  16. * USA.
  17. *
  18. * Implementation of a general nvm manager for Open-Channel SSDs.
  19. */
  20. #include "gennvm.h"
  21. static struct nvm_target *gen_find_target(struct gen_dev *gn, const char *name)
  22. {
  23. struct nvm_target *tgt;
  24. list_for_each_entry(tgt, &gn->targets, list)
  25. if (!strcmp(name, tgt->disk->disk_name))
  26. return tgt;
  27. return NULL;
  28. }
  29. static const struct block_device_operations gen_fops = {
  30. .owner = THIS_MODULE,
  31. };
  32. static int gen_reserve_luns(struct nvm_dev *dev, struct nvm_target *t,
  33. int lun_begin, int lun_end)
  34. {
  35. int i;
  36. for (i = lun_begin; i <= lun_end; i++) {
  37. if (test_and_set_bit(i, dev->lun_map)) {
  38. pr_err("nvm: lun %d already allocated\n", i);
  39. goto err;
  40. }
  41. }
  42. return 0;
  43. err:
  44. while (--i > lun_begin)
  45. clear_bit(i, dev->lun_map);
  46. return -EBUSY;
  47. }
  48. static void gen_release_luns_err(struct nvm_dev *dev, int lun_begin,
  49. int lun_end)
  50. {
  51. int i;
  52. for (i = lun_begin; i <= lun_end; i++)
  53. WARN_ON(!test_and_clear_bit(i, dev->lun_map));
  54. }
  55. static void gen_remove_tgt_dev(struct nvm_tgt_dev *tgt_dev)
  56. {
  57. struct nvm_dev *dev = tgt_dev->parent;
  58. struct gen_dev_map *dev_map = tgt_dev->map;
  59. int i, j;
  60. for (i = 0; i < dev_map->nr_chnls; i++) {
  61. struct gen_ch_map *ch_map = &dev_map->chnls[i];
  62. int *lun_offs = ch_map->lun_offs;
  63. int ch = i + ch_map->ch_off;
  64. for (j = 0; j < ch_map->nr_luns; j++) {
  65. int lun = j + lun_offs[j];
  66. int lunid = (ch * dev->geo.luns_per_chnl) + lun;
  67. WARN_ON(!test_and_clear_bit(lunid, dev->lun_map));
  68. }
  69. kfree(ch_map->lun_offs);
  70. }
  71. kfree(dev_map->chnls);
  72. kfree(dev_map);
  73. kfree(tgt_dev->luns);
  74. kfree(tgt_dev);
  75. }
  76. static struct nvm_tgt_dev *gen_create_tgt_dev(struct nvm_dev *dev,
  77. int lun_begin, int lun_end)
  78. {
  79. struct nvm_tgt_dev *tgt_dev = NULL;
  80. struct gen_dev_map *dev_rmap = dev->rmap;
  81. struct gen_dev_map *dev_map;
  82. struct ppa_addr *luns;
  83. int nr_luns = lun_end - lun_begin + 1;
  84. int luns_left = nr_luns;
  85. int nr_chnls = nr_luns / dev->geo.luns_per_chnl;
  86. int nr_chnls_mod = nr_luns % dev->geo.luns_per_chnl;
  87. int bch = lun_begin / dev->geo.luns_per_chnl;
  88. int blun = lun_begin % dev->geo.luns_per_chnl;
  89. int lunid = 0;
  90. int lun_balanced = 1;
  91. int prev_nr_luns;
  92. int i, j;
  93. nr_chnls = nr_luns / dev->geo.luns_per_chnl;
  94. nr_chnls = (nr_chnls_mod == 0) ? nr_chnls : nr_chnls + 1;
  95. dev_map = kmalloc(sizeof(struct gen_dev_map), GFP_KERNEL);
  96. if (!dev_map)
  97. goto err_dev;
  98. dev_map->chnls = kcalloc(nr_chnls, sizeof(struct gen_ch_map),
  99. GFP_KERNEL);
  100. if (!dev_map->chnls)
  101. goto err_chnls;
  102. luns = kcalloc(nr_luns, sizeof(struct ppa_addr), GFP_KERNEL);
  103. if (!luns)
  104. goto err_luns;
  105. prev_nr_luns = (luns_left > dev->geo.luns_per_chnl) ?
  106. dev->geo.luns_per_chnl : luns_left;
  107. for (i = 0; i < nr_chnls; i++) {
  108. struct gen_ch_map *ch_rmap = &dev_rmap->chnls[i + bch];
  109. int *lun_roffs = ch_rmap->lun_offs;
  110. struct gen_ch_map *ch_map = &dev_map->chnls[i];
  111. int *lun_offs;
  112. int luns_in_chnl = (luns_left > dev->geo.luns_per_chnl) ?
  113. dev->geo.luns_per_chnl : luns_left;
  114. if (lun_balanced && prev_nr_luns != luns_in_chnl)
  115. lun_balanced = 0;
  116. ch_map->ch_off = ch_rmap->ch_off = bch;
  117. ch_map->nr_luns = luns_in_chnl;
  118. lun_offs = kcalloc(luns_in_chnl, sizeof(int), GFP_KERNEL);
  119. if (!lun_offs)
  120. goto err_ch;
  121. for (j = 0; j < luns_in_chnl; j++) {
  122. luns[lunid].ppa = 0;
  123. luns[lunid].g.ch = i;
  124. luns[lunid++].g.lun = j;
  125. lun_offs[j] = blun;
  126. lun_roffs[j + blun] = blun;
  127. }
  128. ch_map->lun_offs = lun_offs;
  129. /* when starting a new channel, lun offset is reset */
  130. blun = 0;
  131. luns_left -= luns_in_chnl;
  132. }
  133. dev_map->nr_chnls = nr_chnls;
  134. tgt_dev = kmalloc(sizeof(struct nvm_tgt_dev), GFP_KERNEL);
  135. if (!tgt_dev)
  136. goto err_ch;
  137. memcpy(&tgt_dev->geo, &dev->geo, sizeof(struct nvm_geo));
  138. /* Target device only owns a portion of the physical device */
  139. tgt_dev->geo.nr_chnls = nr_chnls;
  140. tgt_dev->geo.nr_luns = nr_luns;
  141. tgt_dev->geo.luns_per_chnl = (lun_balanced) ? prev_nr_luns : -1;
  142. tgt_dev->total_secs = nr_luns * tgt_dev->geo.sec_per_lun;
  143. tgt_dev->q = dev->q;
  144. tgt_dev->map = dev_map;
  145. tgt_dev->luns = luns;
  146. memcpy(&tgt_dev->identity, &dev->identity, sizeof(struct nvm_id));
  147. tgt_dev->parent = dev;
  148. return tgt_dev;
  149. err_ch:
  150. while (--i > 0)
  151. kfree(dev_map->chnls[i].lun_offs);
  152. kfree(luns);
  153. err_luns:
  154. kfree(dev_map->chnls);
  155. err_chnls:
  156. kfree(dev_map);
  157. err_dev:
  158. return tgt_dev;
  159. }
  160. static int gen_create_tgt(struct nvm_dev *dev, struct nvm_ioctl_create *create)
  161. {
  162. struct gen_dev *gn = dev->mp;
  163. struct nvm_ioctl_create_simple *s = &create->conf.s;
  164. struct request_queue *tqueue;
  165. struct gendisk *tdisk;
  166. struct nvm_tgt_type *tt;
  167. struct nvm_target *t;
  168. struct nvm_tgt_dev *tgt_dev;
  169. void *targetdata;
  170. tt = nvm_find_target_type(create->tgttype, 1);
  171. if (!tt) {
  172. pr_err("nvm: target type %s not found\n", create->tgttype);
  173. return -EINVAL;
  174. }
  175. mutex_lock(&gn->lock);
  176. t = gen_find_target(gn, create->tgtname);
  177. if (t) {
  178. pr_err("nvm: target name already exists.\n");
  179. mutex_unlock(&gn->lock);
  180. return -EINVAL;
  181. }
  182. mutex_unlock(&gn->lock);
  183. t = kmalloc(sizeof(struct nvm_target), GFP_KERNEL);
  184. if (!t)
  185. return -ENOMEM;
  186. if (gen_reserve_luns(dev, t, s->lun_begin, s->lun_end))
  187. goto err_t;
  188. tgt_dev = gen_create_tgt_dev(dev, s->lun_begin, s->lun_end);
  189. if (!tgt_dev) {
  190. pr_err("nvm: could not create target device\n");
  191. goto err_reserve;
  192. }
  193. tqueue = blk_alloc_queue_node(GFP_KERNEL, dev->q->node);
  194. if (!tqueue)
  195. goto err_dev;
  196. blk_queue_make_request(tqueue, tt->make_rq);
  197. tdisk = alloc_disk(0);
  198. if (!tdisk)
  199. goto err_queue;
  200. sprintf(tdisk->disk_name, "%s", create->tgtname);
  201. tdisk->flags = GENHD_FL_EXT_DEVT;
  202. tdisk->major = 0;
  203. tdisk->first_minor = 0;
  204. tdisk->fops = &gen_fops;
  205. tdisk->queue = tqueue;
  206. targetdata = tt->init(tgt_dev, tdisk);
  207. if (IS_ERR(targetdata))
  208. goto err_init;
  209. tdisk->private_data = targetdata;
  210. tqueue->queuedata = targetdata;
  211. blk_queue_max_hw_sectors(tqueue, 8 * dev->ops->max_phys_sect);
  212. set_capacity(tdisk, tt->capacity(targetdata));
  213. add_disk(tdisk);
  214. t->type = tt;
  215. t->disk = tdisk;
  216. t->dev = tgt_dev;
  217. mutex_lock(&gn->lock);
  218. list_add_tail(&t->list, &gn->targets);
  219. mutex_unlock(&gn->lock);
  220. return 0;
  221. err_init:
  222. put_disk(tdisk);
  223. err_queue:
  224. blk_cleanup_queue(tqueue);
  225. err_dev:
  226. kfree(tgt_dev);
  227. err_reserve:
  228. gen_release_luns_err(dev, s->lun_begin, s->lun_end);
  229. err_t:
  230. kfree(t);
  231. return -ENOMEM;
  232. }
  233. static void __gen_remove_target(struct nvm_target *t)
  234. {
  235. struct nvm_tgt_type *tt = t->type;
  236. struct gendisk *tdisk = t->disk;
  237. struct request_queue *q = tdisk->queue;
  238. del_gendisk(tdisk);
  239. blk_cleanup_queue(q);
  240. if (tt->exit)
  241. tt->exit(tdisk->private_data);
  242. gen_remove_tgt_dev(t->dev);
  243. put_disk(tdisk);
  244. list_del(&t->list);
  245. kfree(t);
  246. }
  247. /**
  248. * gen_remove_tgt - Removes a target from the media manager
  249. * @dev: device
  250. * @remove: ioctl structure with target name to remove.
  251. *
  252. * Returns:
  253. * 0: on success
  254. * 1: on not found
  255. * <0: on error
  256. */
  257. static int gen_remove_tgt(struct nvm_dev *dev, struct nvm_ioctl_remove *remove)
  258. {
  259. struct gen_dev *gn = dev->mp;
  260. struct nvm_target *t;
  261. if (!gn)
  262. return 1;
  263. mutex_lock(&gn->lock);
  264. t = gen_find_target(gn, remove->tgtname);
  265. if (!t) {
  266. mutex_unlock(&gn->lock);
  267. return 1;
  268. }
  269. __gen_remove_target(t);
  270. mutex_unlock(&gn->lock);
  271. return 0;
  272. }
  273. static int gen_get_area(struct nvm_dev *dev, sector_t *lba, sector_t len)
  274. {
  275. struct nvm_geo *geo = &dev->geo;
  276. struct gen_dev *gn = dev->mp;
  277. struct gen_area *area, *prev, *next;
  278. sector_t begin = 0;
  279. sector_t max_sectors = (geo->sec_size * dev->total_secs) >> 9;
  280. if (len > max_sectors)
  281. return -EINVAL;
  282. area = kmalloc(sizeof(struct gen_area), GFP_KERNEL);
  283. if (!area)
  284. return -ENOMEM;
  285. prev = NULL;
  286. spin_lock(&dev->lock);
  287. list_for_each_entry(next, &gn->area_list, list) {
  288. if (begin + len > next->begin) {
  289. begin = next->end;
  290. prev = next;
  291. continue;
  292. }
  293. break;
  294. }
  295. if ((begin + len) > max_sectors) {
  296. spin_unlock(&dev->lock);
  297. kfree(area);
  298. return -EINVAL;
  299. }
  300. area->begin = *lba = begin;
  301. area->end = begin + len;
  302. if (prev) /* insert into sorted order */
  303. list_add(&area->list, &prev->list);
  304. else
  305. list_add(&area->list, &gn->area_list);
  306. spin_unlock(&dev->lock);
  307. return 0;
  308. }
  309. static void gen_put_area(struct nvm_dev *dev, sector_t begin)
  310. {
  311. struct gen_dev *gn = dev->mp;
  312. struct gen_area *area;
  313. spin_lock(&dev->lock);
  314. list_for_each_entry(area, &gn->area_list, list) {
  315. if (area->begin != begin)
  316. continue;
  317. list_del(&area->list);
  318. spin_unlock(&dev->lock);
  319. kfree(area);
  320. return;
  321. }
  322. spin_unlock(&dev->lock);
  323. }
  324. static void gen_free(struct nvm_dev *dev)
  325. {
  326. kfree(dev->mp);
  327. kfree(dev->rmap);
  328. dev->mp = NULL;
  329. }
  330. static int gen_register(struct nvm_dev *dev)
  331. {
  332. struct gen_dev *gn;
  333. struct gen_dev_map *dev_rmap;
  334. int i, j;
  335. if (!try_module_get(THIS_MODULE))
  336. return -ENODEV;
  337. gn = kzalloc(sizeof(struct gen_dev), GFP_KERNEL);
  338. if (!gn)
  339. goto err_gn;
  340. dev_rmap = kmalloc(sizeof(struct gen_dev_map), GFP_KERNEL);
  341. if (!dev_rmap)
  342. goto err_rmap;
  343. dev_rmap->chnls = kcalloc(dev->geo.nr_chnls, sizeof(struct gen_ch_map),
  344. GFP_KERNEL);
  345. if (!dev_rmap->chnls)
  346. goto err_chnls;
  347. for (i = 0; i < dev->geo.nr_chnls; i++) {
  348. struct gen_ch_map *ch_rmap;
  349. int *lun_roffs;
  350. int luns_in_chnl = dev->geo.luns_per_chnl;
  351. ch_rmap = &dev_rmap->chnls[i];
  352. ch_rmap->ch_off = -1;
  353. ch_rmap->nr_luns = luns_in_chnl;
  354. lun_roffs = kcalloc(luns_in_chnl, sizeof(int), GFP_KERNEL);
  355. if (!lun_roffs)
  356. goto err_ch;
  357. for (j = 0; j < luns_in_chnl; j++)
  358. lun_roffs[j] = -1;
  359. ch_rmap->lun_offs = lun_roffs;
  360. }
  361. gn->dev = dev;
  362. gn->nr_luns = dev->geo.nr_luns;
  363. INIT_LIST_HEAD(&gn->area_list);
  364. mutex_init(&gn->lock);
  365. INIT_LIST_HEAD(&gn->targets);
  366. dev->mp = gn;
  367. dev->rmap = dev_rmap;
  368. return 1;
  369. err_ch:
  370. while (--i >= 0)
  371. kfree(dev_rmap->chnls[i].lun_offs);
  372. err_chnls:
  373. kfree(dev_rmap);
  374. err_rmap:
  375. gen_free(dev);
  376. err_gn:
  377. module_put(THIS_MODULE);
  378. return -ENOMEM;
  379. }
  380. static void gen_unregister(struct nvm_dev *dev)
  381. {
  382. struct gen_dev *gn = dev->mp;
  383. struct nvm_target *t, *tmp;
  384. mutex_lock(&gn->lock);
  385. list_for_each_entry_safe(t, tmp, &gn->targets, list) {
  386. if (t->dev->parent != dev)
  387. continue;
  388. __gen_remove_target(t);
  389. }
  390. mutex_unlock(&gn->lock);
  391. gen_free(dev);
  392. module_put(THIS_MODULE);
  393. }
  394. static int gen_map_to_dev(struct nvm_tgt_dev *tgt_dev, struct ppa_addr *p)
  395. {
  396. struct gen_dev_map *dev_map = tgt_dev->map;
  397. struct gen_ch_map *ch_map = &dev_map->chnls[p->g.ch];
  398. int lun_off = ch_map->lun_offs[p->g.lun];
  399. struct nvm_dev *dev = tgt_dev->parent;
  400. struct gen_dev_map *dev_rmap = dev->rmap;
  401. struct gen_ch_map *ch_rmap;
  402. int lun_roff;
  403. p->g.ch += ch_map->ch_off;
  404. p->g.lun += lun_off;
  405. ch_rmap = &dev_rmap->chnls[p->g.ch];
  406. lun_roff = ch_rmap->lun_offs[p->g.lun];
  407. if (unlikely(ch_rmap->ch_off < 0 || lun_roff < 0)) {
  408. pr_err("nvm: corrupted device partition table\n");
  409. return -EINVAL;
  410. }
  411. return 0;
  412. }
  413. static int gen_map_to_tgt(struct nvm_tgt_dev *tgt_dev, struct ppa_addr *p)
  414. {
  415. struct nvm_dev *dev = tgt_dev->parent;
  416. struct gen_dev_map *dev_rmap = dev->rmap;
  417. struct gen_ch_map *ch_rmap = &dev_rmap->chnls[p->g.ch];
  418. int lun_roff = ch_rmap->lun_offs[p->g.lun];
  419. p->g.ch -= ch_rmap->ch_off;
  420. p->g.lun -= lun_roff;
  421. return 0;
  422. }
  423. static int gen_trans_rq(struct nvm_tgt_dev *tgt_dev, struct nvm_rq *rqd,
  424. int flag)
  425. {
  426. gen_trans_fn *f;
  427. int i;
  428. int ret = 0;
  429. f = (flag == TRANS_TGT_TO_DEV) ? gen_map_to_dev : gen_map_to_tgt;
  430. if (rqd->nr_ppas == 1)
  431. return f(tgt_dev, &rqd->ppa_addr);
  432. for (i = 0; i < rqd->nr_ppas; i++) {
  433. ret = f(tgt_dev, &rqd->ppa_list[i]);
  434. if (ret)
  435. goto out;
  436. }
  437. out:
  438. return ret;
  439. }
  440. static void gen_end_io(struct nvm_rq *rqd)
  441. {
  442. struct nvm_tgt_dev *tgt_dev = rqd->dev;
  443. struct nvm_tgt_instance *ins = rqd->ins;
  444. /* Convert address space */
  445. if (tgt_dev)
  446. gen_trans_rq(tgt_dev, rqd, TRANS_DEV_TO_TGT);
  447. ins->tt->end_io(rqd);
  448. }
  449. static int gen_submit_io(struct nvm_tgt_dev *tgt_dev, struct nvm_rq *rqd)
  450. {
  451. struct nvm_dev *dev = tgt_dev->parent;
  452. if (!dev->ops->submit_io)
  453. return -ENODEV;
  454. /* Convert address space */
  455. gen_trans_rq(tgt_dev, rqd, TRANS_TGT_TO_DEV);
  456. nvm_generic_to_addr_mode(dev, rqd);
  457. rqd->dev = tgt_dev;
  458. rqd->end_io = gen_end_io;
  459. return dev->ops->submit_io(dev, rqd);
  460. }
  461. static int gen_erase_blk(struct nvm_tgt_dev *tgt_dev, struct ppa_addr *p,
  462. int flags)
  463. {
  464. /* Convert address space */
  465. gen_map_to_dev(tgt_dev, p);
  466. return nvm_erase_ppa(tgt_dev->parent, p, 1, flags);
  467. }
  468. static struct ppa_addr gen_trans_ppa(struct nvm_tgt_dev *tgt_dev,
  469. struct ppa_addr p, int direction)
  470. {
  471. gen_trans_fn *f;
  472. struct ppa_addr ppa = p;
  473. f = (direction == TRANS_TGT_TO_DEV) ? gen_map_to_dev : gen_map_to_tgt;
  474. f(tgt_dev, &ppa);
  475. return ppa;
  476. }
  477. static void gen_part_to_tgt(struct nvm_dev *dev, sector_t *entries,
  478. int len)
  479. {
  480. struct nvm_geo *geo = &dev->geo;
  481. struct gen_dev_map *dev_rmap = dev->rmap;
  482. u64 i;
  483. for (i = 0; i < len; i++) {
  484. struct gen_ch_map *ch_rmap;
  485. int *lun_roffs;
  486. struct ppa_addr gaddr;
  487. u64 pba = le64_to_cpu(entries[i]);
  488. int off;
  489. u64 diff;
  490. if (!pba)
  491. continue;
  492. gaddr = linear_to_generic_addr(geo, pba);
  493. ch_rmap = &dev_rmap->chnls[gaddr.g.ch];
  494. lun_roffs = ch_rmap->lun_offs;
  495. off = gaddr.g.ch * geo->luns_per_chnl + gaddr.g.lun;
  496. diff = ((ch_rmap->ch_off * geo->luns_per_chnl) +
  497. (lun_roffs[gaddr.g.lun])) * geo->sec_per_lun;
  498. entries[i] -= cpu_to_le64(diff);
  499. }
  500. }
  501. static struct nvmm_type gen = {
  502. .name = "gennvm",
  503. .version = {0, 1, 0},
  504. .register_mgr = gen_register,
  505. .unregister_mgr = gen_unregister,
  506. .create_tgt = gen_create_tgt,
  507. .remove_tgt = gen_remove_tgt,
  508. .submit_io = gen_submit_io,
  509. .erase_blk = gen_erase_blk,
  510. .get_area = gen_get_area,
  511. .put_area = gen_put_area,
  512. .trans_ppa = gen_trans_ppa,
  513. .part_to_tgt = gen_part_to_tgt,
  514. };
  515. static int __init gen_module_init(void)
  516. {
  517. return nvm_register_mgr(&gen);
  518. }
  519. static void gen_module_exit(void)
  520. {
  521. nvm_unregister_mgr(&gen);
  522. }
  523. module_init(gen_module_init);
  524. module_exit(gen_module_exit);
  525. MODULE_LICENSE("GPL v2");
  526. MODULE_DESCRIPTION("General media manager for Open-Channel SSDs");