gennvm.c 12 KB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130131132133134135136137138139140141142143144145146147148149150151152153154155156157158159160161162163164165166167168169170171172173174175176177178179180181182183184185186187188189190191192193194195196197198199200201202203204205206207208209210211212213214215216217218219220221222223224225226227228229230231232233234235236237238239240241242243244245246247248249250251252253254255256257258259260261262263264265266267268269270271272273274275276277278279280281282283284285286287288289290291292293294295296297298299300301302303304305306307308309310311312313314315316317318319320321322323324325326327328329330331332333334335336337338339340341342343344345346347348349350351352353354355356357358359360361362363364365366367368369370371372373374375376377378379380381382383384385386387388389390391392393394395396397398399400401402403404405406407408409410411412413414415416417418419420421422423424425426427428429430431432433434435436437438439440441442443444445446447448449450451452453454455456457458459460461462463464465466467468469470471472473474475476477478479480481482483484485486487488489490491492493494495496497498499500501502503504505506507508509510511512513514515516517518519520521522523524525
  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 generic nvm manager for Open-Channel SSDs.
  19. */
  20. #include "gennvm.h"
  21. static void gennvm_blocks_free(struct nvm_dev *dev)
  22. {
  23. struct gen_nvm *gn = dev->mp;
  24. struct gen_lun *lun;
  25. int i;
  26. gennvm_for_each_lun(gn, lun, i) {
  27. if (!lun->vlun.blocks)
  28. break;
  29. vfree(lun->vlun.blocks);
  30. }
  31. }
  32. static void gennvm_luns_free(struct nvm_dev *dev)
  33. {
  34. struct gen_nvm *gn = dev->mp;
  35. kfree(gn->luns);
  36. }
  37. static int gennvm_luns_init(struct nvm_dev *dev, struct gen_nvm *gn)
  38. {
  39. struct gen_lun *lun;
  40. int i;
  41. gn->luns = kcalloc(dev->nr_luns, sizeof(struct gen_lun), GFP_KERNEL);
  42. if (!gn->luns)
  43. return -ENOMEM;
  44. gennvm_for_each_lun(gn, lun, i) {
  45. spin_lock_init(&lun->vlun.lock);
  46. INIT_LIST_HEAD(&lun->free_list);
  47. INIT_LIST_HEAD(&lun->used_list);
  48. INIT_LIST_HEAD(&lun->bb_list);
  49. lun->reserved_blocks = 2; /* for GC only */
  50. lun->vlun.id = i;
  51. lun->vlun.lun_id = i % dev->luns_per_chnl;
  52. lun->vlun.chnl_id = i / dev->luns_per_chnl;
  53. lun->vlun.nr_free_blocks = dev->blks_per_lun;
  54. lun->vlun.nr_inuse_blocks = 0;
  55. lun->vlun.nr_bad_blocks = 0;
  56. }
  57. return 0;
  58. }
  59. static int gennvm_block_bb(struct ppa_addr ppa, int nr_blocks, u8 *blks,
  60. void *private)
  61. {
  62. struct gen_nvm *gn = private;
  63. struct nvm_dev *dev = gn->dev;
  64. struct gen_lun *lun;
  65. struct nvm_block *blk;
  66. int i;
  67. lun = &gn->luns[(dev->luns_per_chnl * ppa.g.ch) + ppa.g.lun];
  68. for (i = 0; i < nr_blocks; i++) {
  69. if (blks[i] == 0)
  70. continue;
  71. blk = &lun->vlun.blocks[i];
  72. if (!blk) {
  73. pr_err("gennvm: BB data is out of bounds.\n");
  74. return -EINVAL;
  75. }
  76. list_move_tail(&blk->list, &lun->bb_list);
  77. lun->vlun.nr_bad_blocks++;
  78. lun->vlun.nr_free_blocks--;
  79. }
  80. return 0;
  81. }
  82. static int gennvm_block_map(u64 slba, u32 nlb, __le64 *entries, void *private)
  83. {
  84. struct nvm_dev *dev = private;
  85. struct gen_nvm *gn = dev->mp;
  86. sector_t max_pages = dev->total_pages * (dev->sec_size >> 9);
  87. u64 elba = slba + nlb;
  88. struct gen_lun *lun;
  89. struct nvm_block *blk;
  90. u64 i;
  91. int lun_id;
  92. if (unlikely(elba > dev->total_pages)) {
  93. pr_err("gennvm: L2P data from device is out of bounds!\n");
  94. return -EINVAL;
  95. }
  96. for (i = 0; i < nlb; i++) {
  97. u64 pba = le64_to_cpu(entries[i]);
  98. if (unlikely(pba >= max_pages && pba != U64_MAX)) {
  99. pr_err("gennvm: L2P data entry is out of bounds!\n");
  100. return -EINVAL;
  101. }
  102. /* Address zero is a special one. The first page on a disk is
  103. * protected. It often holds internal device boot
  104. * information.
  105. */
  106. if (!pba)
  107. continue;
  108. /* resolve block from physical address */
  109. lun_id = div_u64(pba, dev->sec_per_lun);
  110. lun = &gn->luns[lun_id];
  111. /* Calculate block offset into lun */
  112. pba = pba - (dev->sec_per_lun * lun_id);
  113. blk = &lun->vlun.blocks[div_u64(pba, dev->sec_per_blk)];
  114. if (!blk->type) {
  115. /* at this point, we don't know anything about the
  116. * block. It's up to the FTL on top to re-etablish the
  117. * block state
  118. */
  119. list_move_tail(&blk->list, &lun->used_list);
  120. blk->type = 1;
  121. lun->vlun.nr_free_blocks--;
  122. lun->vlun.nr_inuse_blocks++;
  123. }
  124. }
  125. return 0;
  126. }
  127. static int gennvm_blocks_init(struct nvm_dev *dev, struct gen_nvm *gn)
  128. {
  129. struct gen_lun *lun;
  130. struct nvm_block *block;
  131. sector_t lun_iter, blk_iter, cur_block_id = 0;
  132. int ret;
  133. gennvm_for_each_lun(gn, lun, lun_iter) {
  134. lun->vlun.blocks = vzalloc(sizeof(struct nvm_block) *
  135. dev->blks_per_lun);
  136. if (!lun->vlun.blocks)
  137. return -ENOMEM;
  138. for (blk_iter = 0; blk_iter < dev->blks_per_lun; blk_iter++) {
  139. block = &lun->vlun.blocks[blk_iter];
  140. INIT_LIST_HEAD(&block->list);
  141. block->lun = &lun->vlun;
  142. block->id = cur_block_id++;
  143. /* First block is reserved for device */
  144. if (unlikely(lun_iter == 0 && blk_iter == 0)) {
  145. lun->vlun.nr_free_blocks--;
  146. continue;
  147. }
  148. list_add_tail(&block->list, &lun->free_list);
  149. }
  150. if (dev->ops->get_bb_tbl) {
  151. struct ppa_addr ppa;
  152. ppa.ppa = 0;
  153. ppa.g.ch = lun->vlun.chnl_id;
  154. ppa.g.lun = lun->vlun.id;
  155. ppa = generic_to_dev_addr(dev, ppa);
  156. ret = dev->ops->get_bb_tbl(dev, ppa,
  157. dev->blks_per_lun,
  158. gennvm_block_bb, gn);
  159. if (ret)
  160. pr_err("gennvm: could not read BB table\n");
  161. }
  162. }
  163. if (dev->ops->get_l2p_tbl) {
  164. ret = dev->ops->get_l2p_tbl(dev, 0, dev->total_pages,
  165. gennvm_block_map, dev);
  166. if (ret) {
  167. pr_err("gennvm: could not read L2P table.\n");
  168. pr_warn("gennvm: default block initialization");
  169. }
  170. }
  171. return 0;
  172. }
  173. static void gennvm_free(struct nvm_dev *dev)
  174. {
  175. gennvm_blocks_free(dev);
  176. gennvm_luns_free(dev);
  177. kfree(dev->mp);
  178. dev->mp = NULL;
  179. }
  180. static int gennvm_register(struct nvm_dev *dev)
  181. {
  182. struct gen_nvm *gn;
  183. int ret;
  184. if (!try_module_get(THIS_MODULE))
  185. return -ENODEV;
  186. gn = kzalloc(sizeof(struct gen_nvm), GFP_KERNEL);
  187. if (!gn)
  188. return -ENOMEM;
  189. gn->dev = dev;
  190. gn->nr_luns = dev->nr_luns;
  191. dev->mp = gn;
  192. ret = gennvm_luns_init(dev, gn);
  193. if (ret) {
  194. pr_err("gennvm: could not initialize luns\n");
  195. goto err;
  196. }
  197. ret = gennvm_blocks_init(dev, gn);
  198. if (ret) {
  199. pr_err("gennvm: could not initialize blocks\n");
  200. goto err;
  201. }
  202. return 1;
  203. err:
  204. gennvm_free(dev);
  205. module_put(THIS_MODULE);
  206. return ret;
  207. }
  208. static void gennvm_unregister(struct nvm_dev *dev)
  209. {
  210. gennvm_free(dev);
  211. module_put(THIS_MODULE);
  212. }
  213. static struct nvm_block *gennvm_get_blk(struct nvm_dev *dev,
  214. struct nvm_lun *vlun, unsigned long flags)
  215. {
  216. struct gen_lun *lun = container_of(vlun, struct gen_lun, vlun);
  217. struct nvm_block *blk = NULL;
  218. int is_gc = flags & NVM_IOTYPE_GC;
  219. spin_lock(&vlun->lock);
  220. if (list_empty(&lun->free_list)) {
  221. pr_err_ratelimited("gennvm: lun %u have no free pages available",
  222. lun->vlun.id);
  223. goto out;
  224. }
  225. if (!is_gc && lun->vlun.nr_free_blocks < lun->reserved_blocks)
  226. goto out;
  227. blk = list_first_entry(&lun->free_list, struct nvm_block, list);
  228. list_move_tail(&blk->list, &lun->used_list);
  229. blk->type = 1;
  230. lun->vlun.nr_free_blocks--;
  231. lun->vlun.nr_inuse_blocks++;
  232. out:
  233. spin_unlock(&vlun->lock);
  234. return blk;
  235. }
  236. static void gennvm_put_blk(struct nvm_dev *dev, struct nvm_block *blk)
  237. {
  238. struct nvm_lun *vlun = blk->lun;
  239. struct gen_lun *lun = container_of(vlun, struct gen_lun, vlun);
  240. spin_lock(&vlun->lock);
  241. switch (blk->type) {
  242. case 1:
  243. list_move_tail(&blk->list, &lun->free_list);
  244. lun->vlun.nr_free_blocks++;
  245. lun->vlun.nr_inuse_blocks--;
  246. blk->type = 0;
  247. break;
  248. case 2:
  249. list_move_tail(&blk->list, &lun->bb_list);
  250. lun->vlun.nr_bad_blocks++;
  251. lun->vlun.nr_inuse_blocks--;
  252. break;
  253. default:
  254. WARN_ON_ONCE(1);
  255. pr_err("gennvm: erroneous block type (%lu -> %u)\n",
  256. blk->id, blk->type);
  257. list_move_tail(&blk->list, &lun->bb_list);
  258. lun->vlun.nr_bad_blocks++;
  259. lun->vlun.nr_inuse_blocks--;
  260. }
  261. spin_unlock(&vlun->lock);
  262. }
  263. static void gennvm_addr_to_generic_mode(struct nvm_dev *dev, struct nvm_rq *rqd)
  264. {
  265. int i;
  266. if (rqd->nr_pages > 1) {
  267. for (i = 0; i < rqd->nr_pages; i++)
  268. rqd->ppa_list[i] = dev_to_generic_addr(dev,
  269. rqd->ppa_list[i]);
  270. } else {
  271. rqd->ppa_addr = dev_to_generic_addr(dev, rqd->ppa_addr);
  272. }
  273. }
  274. static void gennvm_generic_to_addr_mode(struct nvm_dev *dev, struct nvm_rq *rqd)
  275. {
  276. int i;
  277. if (rqd->nr_pages > 1) {
  278. for (i = 0; i < rqd->nr_pages; i++)
  279. rqd->ppa_list[i] = generic_to_dev_addr(dev,
  280. rqd->ppa_list[i]);
  281. } else {
  282. rqd->ppa_addr = generic_to_dev_addr(dev, rqd->ppa_addr);
  283. }
  284. }
  285. static int gennvm_submit_io(struct nvm_dev *dev, struct nvm_rq *rqd)
  286. {
  287. if (!dev->ops->submit_io)
  288. return -ENODEV;
  289. /* Convert address space */
  290. gennvm_generic_to_addr_mode(dev, rqd);
  291. rqd->dev = dev;
  292. return dev->ops->submit_io(dev, rqd);
  293. }
  294. static void gennvm_blk_set_type(struct nvm_dev *dev, struct ppa_addr *ppa,
  295. int type)
  296. {
  297. struct gen_nvm *gn = dev->mp;
  298. struct gen_lun *lun;
  299. struct nvm_block *blk;
  300. if (unlikely(ppa->g.ch > dev->nr_chnls ||
  301. ppa->g.lun > dev->luns_per_chnl ||
  302. ppa->g.blk > dev->blks_per_lun)) {
  303. WARN_ON_ONCE(1);
  304. pr_err("gennvm: ppa broken (ch: %u > %u lun: %u > %u blk: %u > %u",
  305. ppa->g.ch, dev->nr_chnls,
  306. ppa->g.lun, dev->luns_per_chnl,
  307. ppa->g.blk, dev->blks_per_lun);
  308. return;
  309. }
  310. lun = &gn->luns[ppa->g.lun * ppa->g.ch];
  311. blk = &lun->vlun.blocks[ppa->g.blk];
  312. /* will be moved to bb list on put_blk from target */
  313. blk->type = type;
  314. }
  315. /* mark block bad. It is expected the target recover from the error. */
  316. static void gennvm_mark_blk_bad(struct nvm_dev *dev, struct nvm_rq *rqd)
  317. {
  318. int i;
  319. if (!dev->ops->set_bb_tbl)
  320. return;
  321. if (dev->ops->set_bb_tbl(dev, rqd, 1))
  322. return;
  323. gennvm_addr_to_generic_mode(dev, rqd);
  324. /* look up blocks and mark them as bad */
  325. if (rqd->nr_pages > 1)
  326. for (i = 0; i < rqd->nr_pages; i++)
  327. gennvm_blk_set_type(dev, &rqd->ppa_list[i], 2);
  328. else
  329. gennvm_blk_set_type(dev, &rqd->ppa_addr, 2);
  330. }
  331. static int gennvm_end_io(struct nvm_rq *rqd, int error)
  332. {
  333. struct nvm_tgt_instance *ins = rqd->ins;
  334. int ret = 0;
  335. switch (error) {
  336. case NVM_RSP_SUCCESS:
  337. break;
  338. case NVM_RSP_ERR_EMPTYPAGE:
  339. break;
  340. case NVM_RSP_ERR_FAILWRITE:
  341. gennvm_mark_blk_bad(rqd->dev, rqd);
  342. default:
  343. ret++;
  344. }
  345. ret += ins->tt->end_io(rqd, error);
  346. return ret;
  347. }
  348. static int gennvm_erase_blk(struct nvm_dev *dev, struct nvm_block *blk,
  349. unsigned long flags)
  350. {
  351. int plane_cnt = 0, pl_idx, ret;
  352. struct ppa_addr addr;
  353. struct nvm_rq rqd;
  354. if (!dev->ops->erase_block)
  355. return 0;
  356. addr = block_to_ppa(dev, blk);
  357. if (dev->plane_mode == NVM_PLANE_SINGLE) {
  358. rqd.nr_pages = 1;
  359. rqd.ppa_addr = addr;
  360. } else {
  361. plane_cnt = (1 << dev->plane_mode);
  362. rqd.nr_pages = plane_cnt;
  363. rqd.ppa_list = nvm_dev_dma_alloc(dev, GFP_KERNEL,
  364. &rqd.dma_ppa_list);
  365. if (!rqd.ppa_list) {
  366. pr_err("gennvm: failed to allocate dma memory\n");
  367. return -ENOMEM;
  368. }
  369. for (pl_idx = 0; pl_idx < plane_cnt; pl_idx++) {
  370. addr.g.pl = pl_idx;
  371. rqd.ppa_list[pl_idx] = addr;
  372. }
  373. }
  374. gennvm_generic_to_addr_mode(dev, &rqd);
  375. ret = dev->ops->erase_block(dev, &rqd);
  376. if (plane_cnt)
  377. nvm_dev_dma_free(dev, rqd.ppa_list, rqd.dma_ppa_list);
  378. return ret;
  379. }
  380. static struct nvm_lun *gennvm_get_lun(struct nvm_dev *dev, int lunid)
  381. {
  382. struct gen_nvm *gn = dev->mp;
  383. return &gn->luns[lunid].vlun;
  384. }
  385. static void gennvm_lun_info_print(struct nvm_dev *dev)
  386. {
  387. struct gen_nvm *gn = dev->mp;
  388. struct gen_lun *lun;
  389. unsigned int i;
  390. gennvm_for_each_lun(gn, lun, i) {
  391. spin_lock(&lun->vlun.lock);
  392. pr_info("%s: lun%8u\t%u\t%u\t%u\n",
  393. dev->name, i,
  394. lun->vlun.nr_free_blocks,
  395. lun->vlun.nr_inuse_blocks,
  396. lun->vlun.nr_bad_blocks);
  397. spin_unlock(&lun->vlun.lock);
  398. }
  399. }
  400. static struct nvmm_type gennvm = {
  401. .name = "gennvm",
  402. .version = {0, 1, 0},
  403. .register_mgr = gennvm_register,
  404. .unregister_mgr = gennvm_unregister,
  405. .get_blk = gennvm_get_blk,
  406. .put_blk = gennvm_put_blk,
  407. .submit_io = gennvm_submit_io,
  408. .end_io = gennvm_end_io,
  409. .erase_blk = gennvm_erase_blk,
  410. .get_lun = gennvm_get_lun,
  411. .lun_info_print = gennvm_lun_info_print,
  412. };
  413. static int __init gennvm_module_init(void)
  414. {
  415. return nvm_register_mgr(&gennvm);
  416. }
  417. static void gennvm_module_exit(void)
  418. {
  419. nvm_unregister_mgr(&gennvm);
  420. }
  421. module_init(gennvm_module_init);
  422. module_exit(gennvm_module_exit);
  423. MODULE_LICENSE("GPL v2");
  424. MODULE_DESCRIPTION("Generic media manager for Open-Channel SSDs");