gennvm.c 11 KB

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