rfd_ftl.c 18 KB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130131132133134135136137138139140141142143144145146147148149150151152153154155156157158159160161162163164165166167168169170171172173174175176177178179180181182183184185186187188189190191192193194195196197198199200201202203204205206207208209210211212213214215216217218219220221222223224225226227228229230231232233234235236237238239240241242243244245246247248249250251252253254255256257258259260261262263264265266267268269270271272273274275276277278279280281282283284285286287288289290291292293294295296297298299300301302303304305306307308309310311312313314315316317318319320321322323324325326327328329330331332333334335336337338339340341342343344345346347348349350351352353354355356357358359360361362363364365366367368369370371372373374375376377378379380381382383384385386387388389390391392393394395396397398399400401402403404405406407408409410411412413414415416417418419420421422423424425426427428429430431432433434435436437438439440441442443444445446447448449450451452453454455456457458459460461462463464465466467468469470471472473474475476477478479480481482483484485486487488489490491492493494495496497498499500501502503504505506507508509510511512513514515516517518519520521522523524525526527528529530531532533534535536537538539540541542543544545546547548549550551552553554555556557558559560561562563564565566567568569570571572573574575576577578579580581582583584585586587588589590591592593594595596597598599600601602603604605606607608609610611612613614615616617618619620621622623624625626627628629630631632633634635636637638639640641642643644645646647648649650651652653654655656657658659660661662663664665666667668669670671672673674675676677678679680681682683684685686687688689690691692693694695696697698699700701702703704705706707708709710711712713714715716717718719720721722723724725726727728729730731732733734735736737738739740741742743744745746747748749750751752753754755756757758759760761762763764765766767768769770771772773774775776777778779780781782783784785786787788789790791792793794795796797798799800801802803804805806807808809810811812
  1. /*
  2. * rfd_ftl.c -- resident flash disk (flash translation layer)
  3. *
  4. * Copyright © 2005 Sean Young <sean@mess.org>
  5. *
  6. * This type of flash translation layer (FTL) is used by the Embedded BIOS
  7. * by General Software. It is known as the Resident Flash Disk (RFD), see:
  8. *
  9. * http://www.gensw.com/pages/prod/bios/rfd.htm
  10. *
  11. * based on ftl.c
  12. */
  13. #include <linux/hdreg.h>
  14. #include <linux/init.h>
  15. #include <linux/mtd/blktrans.h>
  16. #include <linux/mtd/mtd.h>
  17. #include <linux/vmalloc.h>
  18. #include <linux/slab.h>
  19. #include <linux/jiffies.h>
  20. #include <linux/module.h>
  21. #include <asm/types.h>
  22. static int block_size = 0;
  23. module_param(block_size, int, 0);
  24. MODULE_PARM_DESC(block_size, "Block size to use by RFD, defaults to erase unit size");
  25. #define PREFIX "rfd_ftl: "
  26. /* This major has been assigned by device@lanana.org */
  27. #ifndef RFD_FTL_MAJOR
  28. #define RFD_FTL_MAJOR 256
  29. #endif
  30. /* Maximum number of partitions in an FTL region */
  31. #define PART_BITS 4
  32. /* An erase unit should start with this value */
  33. #define RFD_MAGIC 0x9193
  34. /* the second value is 0xffff or 0xffc8; function unknown */
  35. /* the third value is always 0xffff, ignored */
  36. /* next is an array of mapping for each corresponding sector */
  37. #define HEADER_MAP_OFFSET 3
  38. #define SECTOR_DELETED 0x0000
  39. #define SECTOR_ZERO 0xfffe
  40. #define SECTOR_FREE 0xffff
  41. #define SECTOR_SIZE 512
  42. #define SECTORS_PER_TRACK 63
  43. struct block {
  44. enum {
  45. BLOCK_OK,
  46. BLOCK_ERASING,
  47. BLOCK_ERASED,
  48. BLOCK_UNUSED,
  49. BLOCK_FAILED
  50. } state;
  51. int free_sectors;
  52. int used_sectors;
  53. int erases;
  54. u_long offset;
  55. };
  56. struct partition {
  57. struct mtd_blktrans_dev mbd;
  58. u_int block_size; /* size of erase unit */
  59. u_int total_blocks; /* number of erase units */
  60. u_int header_sectors_per_block; /* header sectors in erase unit */
  61. u_int data_sectors_per_block; /* data sectors in erase unit */
  62. u_int sector_count; /* sectors in translated disk */
  63. u_int header_size; /* bytes in header sector */
  64. int reserved_block; /* block next up for reclaim */
  65. int current_block; /* block to write to */
  66. u16 *header_cache; /* cached header */
  67. int is_reclaiming;
  68. int cylinders;
  69. int errors;
  70. u_long *sector_map;
  71. struct block *blocks;
  72. };
  73. static int rfd_ftl_writesect(struct mtd_blktrans_dev *dev, u_long sector, char *buf);
  74. static int build_block_map(struct partition *part, int block_no)
  75. {
  76. struct block *block = &part->blocks[block_no];
  77. int i;
  78. block->offset = part->block_size * block_no;
  79. if (le16_to_cpu(part->header_cache[0]) != RFD_MAGIC) {
  80. block->state = BLOCK_UNUSED;
  81. return -ENOENT;
  82. }
  83. block->state = BLOCK_OK;
  84. for (i=0; i<part->data_sectors_per_block; i++) {
  85. u16 entry;
  86. entry = le16_to_cpu(part->header_cache[HEADER_MAP_OFFSET + i]);
  87. if (entry == SECTOR_DELETED)
  88. continue;
  89. if (entry == SECTOR_FREE) {
  90. block->free_sectors++;
  91. continue;
  92. }
  93. if (entry == SECTOR_ZERO)
  94. entry = 0;
  95. if (entry >= part->sector_count) {
  96. printk(KERN_WARNING PREFIX
  97. "'%s': unit #%d: entry %d corrupt, "
  98. "sector %d out of range\n",
  99. part->mbd.mtd->name, block_no, i, entry);
  100. continue;
  101. }
  102. if (part->sector_map[entry] != -1) {
  103. printk(KERN_WARNING PREFIX
  104. "'%s': more than one entry for sector %d\n",
  105. part->mbd.mtd->name, entry);
  106. part->errors = 1;
  107. continue;
  108. }
  109. part->sector_map[entry] = block->offset +
  110. (i + part->header_sectors_per_block) * SECTOR_SIZE;
  111. block->used_sectors++;
  112. }
  113. if (block->free_sectors == part->data_sectors_per_block)
  114. part->reserved_block = block_no;
  115. return 0;
  116. }
  117. static int scan_header(struct partition *part)
  118. {
  119. int sectors_per_block;
  120. int i, rc = -ENOMEM;
  121. int blocks_found;
  122. size_t retlen;
  123. sectors_per_block = part->block_size / SECTOR_SIZE;
  124. part->total_blocks = (u32)part->mbd.mtd->size / part->block_size;
  125. if (part->total_blocks < 2)
  126. return -ENOENT;
  127. /* each erase block has three bytes header, followed by the map */
  128. part->header_sectors_per_block =
  129. ((HEADER_MAP_OFFSET + sectors_per_block) *
  130. sizeof(u16) + SECTOR_SIZE - 1) / SECTOR_SIZE;
  131. part->data_sectors_per_block = sectors_per_block -
  132. part->header_sectors_per_block;
  133. part->header_size = (HEADER_MAP_OFFSET +
  134. part->data_sectors_per_block) * sizeof(u16);
  135. part->cylinders = (part->data_sectors_per_block *
  136. (part->total_blocks - 1) - 1) / SECTORS_PER_TRACK;
  137. part->sector_count = part->cylinders * SECTORS_PER_TRACK;
  138. part->current_block = -1;
  139. part->reserved_block = -1;
  140. part->is_reclaiming = 0;
  141. part->header_cache = kmalloc(part->header_size, GFP_KERNEL);
  142. if (!part->header_cache)
  143. goto err;
  144. part->blocks = kcalloc(part->total_blocks, sizeof(struct block),
  145. GFP_KERNEL);
  146. if (!part->blocks)
  147. goto err;
  148. part->sector_map = vmalloc(part->sector_count * sizeof(u_long));
  149. if (!part->sector_map) {
  150. printk(KERN_ERR PREFIX "'%s': unable to allocate memory for "
  151. "sector map", part->mbd.mtd->name);
  152. goto err;
  153. }
  154. for (i=0; i<part->sector_count; i++)
  155. part->sector_map[i] = -1;
  156. for (i=0, blocks_found=0; i<part->total_blocks; i++) {
  157. rc = mtd_read(part->mbd.mtd, i * part->block_size,
  158. part->header_size, &retlen,
  159. (u_char *)part->header_cache);
  160. if (!rc && retlen != part->header_size)
  161. rc = -EIO;
  162. if (rc)
  163. goto err;
  164. if (!build_block_map(part, i))
  165. blocks_found++;
  166. }
  167. if (blocks_found == 0) {
  168. printk(KERN_NOTICE PREFIX "no RFD magic found in '%s'\n",
  169. part->mbd.mtd->name);
  170. rc = -ENOENT;
  171. goto err;
  172. }
  173. if (part->reserved_block == -1) {
  174. printk(KERN_WARNING PREFIX "'%s': no empty erase unit found\n",
  175. part->mbd.mtd->name);
  176. part->errors = 1;
  177. }
  178. return 0;
  179. err:
  180. vfree(part->sector_map);
  181. kfree(part->header_cache);
  182. kfree(part->blocks);
  183. return rc;
  184. }
  185. static int rfd_ftl_readsect(struct mtd_blktrans_dev *dev, u_long sector, char *buf)
  186. {
  187. struct partition *part = (struct partition*)dev;
  188. u_long addr;
  189. size_t retlen;
  190. int rc;
  191. if (sector >= part->sector_count)
  192. return -EIO;
  193. addr = part->sector_map[sector];
  194. if (addr != -1) {
  195. rc = mtd_read(part->mbd.mtd, addr, SECTOR_SIZE, &retlen,
  196. (u_char *)buf);
  197. if (!rc && retlen != SECTOR_SIZE)
  198. rc = -EIO;
  199. if (rc) {
  200. printk(KERN_WARNING PREFIX "error reading '%s' at "
  201. "0x%lx\n", part->mbd.mtd->name, addr);
  202. return rc;
  203. }
  204. } else
  205. memset(buf, 0, SECTOR_SIZE);
  206. return 0;
  207. }
  208. static int erase_block(struct partition *part, int block)
  209. {
  210. struct erase_info *erase;
  211. int rc;
  212. erase = kmalloc(sizeof(struct erase_info), GFP_KERNEL);
  213. if (!erase)
  214. return -ENOMEM;
  215. erase->addr = part->blocks[block].offset;
  216. erase->len = part->block_size;
  217. part->blocks[block].state = BLOCK_ERASING;
  218. part->blocks[block].free_sectors = 0;
  219. rc = mtd_erase(part->mbd.mtd, erase);
  220. if (rc) {
  221. printk(KERN_ERR PREFIX "erase of region %llx,%llx on '%s' "
  222. "failed\n", (unsigned long long)erase->addr,
  223. (unsigned long long)erase->len, part->mbd.mtd->name);
  224. part->blocks[block].state = BLOCK_FAILED;
  225. part->blocks[block].free_sectors = 0;
  226. part->blocks[block].used_sectors = 0;
  227. } else {
  228. u16 magic = cpu_to_le16(RFD_MAGIC);
  229. size_t retlen;
  230. part->blocks[block].state = BLOCK_ERASED;
  231. part->blocks[block].free_sectors = part->data_sectors_per_block;
  232. part->blocks[block].used_sectors = 0;
  233. part->blocks[block].erases++;
  234. rc = mtd_write(part->mbd.mtd, part->blocks[block].offset,
  235. sizeof(magic), &retlen, (u_char *)&magic);
  236. if (!rc && retlen != sizeof(magic))
  237. rc = -EIO;
  238. if (rc) {
  239. pr_err(PREFIX "'%s': unable to write RFD header at 0x%lx\n",
  240. part->mbd.mtd->name, part->blocks[block].offset);
  241. part->blocks[block].state = BLOCK_FAILED;
  242. } else {
  243. part->blocks[block].state = BLOCK_OK;
  244. }
  245. }
  246. kfree(erase);
  247. return rc;
  248. }
  249. static int move_block_contents(struct partition *part, int block_no, u_long *old_sector)
  250. {
  251. void *sector_data;
  252. u16 *map;
  253. size_t retlen;
  254. int i, rc = -ENOMEM;
  255. part->is_reclaiming = 1;
  256. sector_data = kmalloc(SECTOR_SIZE, GFP_KERNEL);
  257. if (!sector_data)
  258. goto err3;
  259. map = kmalloc(part->header_size, GFP_KERNEL);
  260. if (!map)
  261. goto err2;
  262. rc = mtd_read(part->mbd.mtd, part->blocks[block_no].offset,
  263. part->header_size, &retlen, (u_char *)map);
  264. if (!rc && retlen != part->header_size)
  265. rc = -EIO;
  266. if (rc) {
  267. printk(KERN_ERR PREFIX "error reading '%s' at "
  268. "0x%lx\n", part->mbd.mtd->name,
  269. part->blocks[block_no].offset);
  270. goto err;
  271. }
  272. for (i=0; i<part->data_sectors_per_block; i++) {
  273. u16 entry = le16_to_cpu(map[HEADER_MAP_OFFSET + i]);
  274. u_long addr;
  275. if (entry == SECTOR_FREE || entry == SECTOR_DELETED)
  276. continue;
  277. if (entry == SECTOR_ZERO)
  278. entry = 0;
  279. /* already warned about and ignored in build_block_map() */
  280. if (entry >= part->sector_count)
  281. continue;
  282. addr = part->blocks[block_no].offset +
  283. (i + part->header_sectors_per_block) * SECTOR_SIZE;
  284. if (*old_sector == addr) {
  285. *old_sector = -1;
  286. if (!part->blocks[block_no].used_sectors--) {
  287. rc = erase_block(part, block_no);
  288. break;
  289. }
  290. continue;
  291. }
  292. rc = mtd_read(part->mbd.mtd, addr, SECTOR_SIZE, &retlen,
  293. sector_data);
  294. if (!rc && retlen != SECTOR_SIZE)
  295. rc = -EIO;
  296. if (rc) {
  297. printk(KERN_ERR PREFIX "'%s': Unable to "
  298. "read sector for relocation\n",
  299. part->mbd.mtd->name);
  300. goto err;
  301. }
  302. rc = rfd_ftl_writesect((struct mtd_blktrans_dev*)part,
  303. entry, sector_data);
  304. if (rc)
  305. goto err;
  306. }
  307. err:
  308. kfree(map);
  309. err2:
  310. kfree(sector_data);
  311. err3:
  312. part->is_reclaiming = 0;
  313. return rc;
  314. }
  315. static int reclaim_block(struct partition *part, u_long *old_sector)
  316. {
  317. int block, best_block, score, old_sector_block;
  318. int rc;
  319. /* we have a race if sync doesn't exist */
  320. mtd_sync(part->mbd.mtd);
  321. score = 0x7fffffff; /* MAX_INT */
  322. best_block = -1;
  323. if (*old_sector != -1)
  324. old_sector_block = *old_sector / part->block_size;
  325. else
  326. old_sector_block = -1;
  327. for (block=0; block<part->total_blocks; block++) {
  328. int this_score;
  329. if (block == part->reserved_block)
  330. continue;
  331. /*
  332. * Postpone reclaiming if there is a free sector as
  333. * more removed sectors is more efficient (have to move
  334. * less).
  335. */
  336. if (part->blocks[block].free_sectors)
  337. return 0;
  338. this_score = part->blocks[block].used_sectors;
  339. if (block == old_sector_block)
  340. this_score--;
  341. else {
  342. /* no point in moving a full block */
  343. if (part->blocks[block].used_sectors ==
  344. part->data_sectors_per_block)
  345. continue;
  346. }
  347. this_score += part->blocks[block].erases;
  348. if (this_score < score) {
  349. best_block = block;
  350. score = this_score;
  351. }
  352. }
  353. if (best_block == -1)
  354. return -ENOSPC;
  355. part->current_block = -1;
  356. part->reserved_block = best_block;
  357. pr_debug("reclaim_block: reclaiming block #%d with %d used "
  358. "%d free sectors\n", best_block,
  359. part->blocks[best_block].used_sectors,
  360. part->blocks[best_block].free_sectors);
  361. if (part->blocks[best_block].used_sectors)
  362. rc = move_block_contents(part, best_block, old_sector);
  363. else
  364. rc = erase_block(part, best_block);
  365. return rc;
  366. }
  367. /*
  368. * IMPROVE: It would be best to choose the block with the most deleted sectors,
  369. * because if we fill that one up first it'll have the most chance of having
  370. * the least live sectors at reclaim.
  371. */
  372. static int find_free_block(struct partition *part)
  373. {
  374. int block, stop;
  375. block = part->current_block == -1 ?
  376. jiffies % part->total_blocks : part->current_block;
  377. stop = block;
  378. do {
  379. if (part->blocks[block].free_sectors &&
  380. block != part->reserved_block)
  381. return block;
  382. if (part->blocks[block].state == BLOCK_UNUSED)
  383. erase_block(part, block);
  384. if (++block >= part->total_blocks)
  385. block = 0;
  386. } while (block != stop);
  387. return -1;
  388. }
  389. static int find_writable_block(struct partition *part, u_long *old_sector)
  390. {
  391. int rc, block;
  392. size_t retlen;
  393. block = find_free_block(part);
  394. if (block == -1) {
  395. if (!part->is_reclaiming) {
  396. rc = reclaim_block(part, old_sector);
  397. if (rc)
  398. goto err;
  399. block = find_free_block(part);
  400. }
  401. if (block == -1) {
  402. rc = -ENOSPC;
  403. goto err;
  404. }
  405. }
  406. rc = mtd_read(part->mbd.mtd, part->blocks[block].offset,
  407. part->header_size, &retlen,
  408. (u_char *)part->header_cache);
  409. if (!rc && retlen != part->header_size)
  410. rc = -EIO;
  411. if (rc) {
  412. printk(KERN_ERR PREFIX "'%s': unable to read header at "
  413. "0x%lx\n", part->mbd.mtd->name,
  414. part->blocks[block].offset);
  415. goto err;
  416. }
  417. part->current_block = block;
  418. err:
  419. return rc;
  420. }
  421. static int mark_sector_deleted(struct partition *part, u_long old_addr)
  422. {
  423. int block, offset, rc;
  424. u_long addr;
  425. size_t retlen;
  426. u16 del = cpu_to_le16(SECTOR_DELETED);
  427. block = old_addr / part->block_size;
  428. offset = (old_addr % part->block_size) / SECTOR_SIZE -
  429. part->header_sectors_per_block;
  430. addr = part->blocks[block].offset +
  431. (HEADER_MAP_OFFSET + offset) * sizeof(u16);
  432. rc = mtd_write(part->mbd.mtd, addr, sizeof(del), &retlen,
  433. (u_char *)&del);
  434. if (!rc && retlen != sizeof(del))
  435. rc = -EIO;
  436. if (rc) {
  437. printk(KERN_ERR PREFIX "error writing '%s' at "
  438. "0x%lx\n", part->mbd.mtd->name, addr);
  439. goto err;
  440. }
  441. if (block == part->current_block)
  442. part->header_cache[offset + HEADER_MAP_OFFSET] = del;
  443. part->blocks[block].used_sectors--;
  444. if (!part->blocks[block].used_sectors &&
  445. !part->blocks[block].free_sectors)
  446. rc = erase_block(part, block);
  447. err:
  448. return rc;
  449. }
  450. static int find_free_sector(const struct partition *part, const struct block *block)
  451. {
  452. int i, stop;
  453. i = stop = part->data_sectors_per_block - block->free_sectors;
  454. do {
  455. if (le16_to_cpu(part->header_cache[HEADER_MAP_OFFSET + i])
  456. == SECTOR_FREE)
  457. return i;
  458. if (++i == part->data_sectors_per_block)
  459. i = 0;
  460. }
  461. while(i != stop);
  462. return -1;
  463. }
  464. static int do_writesect(struct mtd_blktrans_dev *dev, u_long sector, char *buf, ulong *old_addr)
  465. {
  466. struct partition *part = (struct partition*)dev;
  467. struct block *block;
  468. u_long addr;
  469. int i;
  470. int rc;
  471. size_t retlen;
  472. u16 entry;
  473. if (part->current_block == -1 ||
  474. !part->blocks[part->current_block].free_sectors) {
  475. rc = find_writable_block(part, old_addr);
  476. if (rc)
  477. goto err;
  478. }
  479. block = &part->blocks[part->current_block];
  480. i = find_free_sector(part, block);
  481. if (i < 0) {
  482. rc = -ENOSPC;
  483. goto err;
  484. }
  485. addr = (i + part->header_sectors_per_block) * SECTOR_SIZE +
  486. block->offset;
  487. rc = mtd_write(part->mbd.mtd, addr, SECTOR_SIZE, &retlen,
  488. (u_char *)buf);
  489. if (!rc && retlen != SECTOR_SIZE)
  490. rc = -EIO;
  491. if (rc) {
  492. printk(KERN_ERR PREFIX "error writing '%s' at 0x%lx\n",
  493. part->mbd.mtd->name, addr);
  494. goto err;
  495. }
  496. part->sector_map[sector] = addr;
  497. entry = cpu_to_le16(sector == 0 ? SECTOR_ZERO : sector);
  498. part->header_cache[i + HEADER_MAP_OFFSET] = entry;
  499. addr = block->offset + (HEADER_MAP_OFFSET + i) * sizeof(u16);
  500. rc = mtd_write(part->mbd.mtd, addr, sizeof(entry), &retlen,
  501. (u_char *)&entry);
  502. if (!rc && retlen != sizeof(entry))
  503. rc = -EIO;
  504. if (rc) {
  505. printk(KERN_ERR PREFIX "error writing '%s' at 0x%lx\n",
  506. part->mbd.mtd->name, addr);
  507. goto err;
  508. }
  509. block->used_sectors++;
  510. block->free_sectors--;
  511. err:
  512. return rc;
  513. }
  514. static int rfd_ftl_writesect(struct mtd_blktrans_dev *dev, u_long sector, char *buf)
  515. {
  516. struct partition *part = (struct partition*)dev;
  517. u_long old_addr;
  518. int i;
  519. int rc = 0;
  520. pr_debug("rfd_ftl_writesect(sector=0x%lx)\n", sector);
  521. if (part->reserved_block == -1) {
  522. rc = -EACCES;
  523. goto err;
  524. }
  525. if (sector >= part->sector_count) {
  526. rc = -EIO;
  527. goto err;
  528. }
  529. old_addr = part->sector_map[sector];
  530. for (i=0; i<SECTOR_SIZE; i++) {
  531. if (!buf[i])
  532. continue;
  533. rc = do_writesect(dev, sector, buf, &old_addr);
  534. if (rc)
  535. goto err;
  536. break;
  537. }
  538. if (i == SECTOR_SIZE)
  539. part->sector_map[sector] = -1;
  540. if (old_addr != -1)
  541. rc = mark_sector_deleted(part, old_addr);
  542. err:
  543. return rc;
  544. }
  545. static int rfd_ftl_getgeo(struct mtd_blktrans_dev *dev, struct hd_geometry *geo)
  546. {
  547. struct partition *part = (struct partition*)dev;
  548. geo->heads = 1;
  549. geo->sectors = SECTORS_PER_TRACK;
  550. geo->cylinders = part->cylinders;
  551. return 0;
  552. }
  553. static void rfd_ftl_add_mtd(struct mtd_blktrans_ops *tr, struct mtd_info *mtd)
  554. {
  555. struct partition *part;
  556. if (mtd->type != MTD_NORFLASH || mtd->size > UINT_MAX)
  557. return;
  558. part = kzalloc(sizeof(struct partition), GFP_KERNEL);
  559. if (!part)
  560. return;
  561. part->mbd.mtd = mtd;
  562. if (block_size)
  563. part->block_size = block_size;
  564. else {
  565. if (!mtd->erasesize) {
  566. printk(KERN_WARNING PREFIX "please provide block_size");
  567. goto out;
  568. } else
  569. part->block_size = mtd->erasesize;
  570. }
  571. if (scan_header(part) == 0) {
  572. part->mbd.size = part->sector_count;
  573. part->mbd.tr = tr;
  574. part->mbd.devnum = -1;
  575. if (!(mtd->flags & MTD_WRITEABLE))
  576. part->mbd.readonly = 1;
  577. else if (part->errors) {
  578. printk(KERN_WARNING PREFIX "'%s': errors found, "
  579. "setting read-only\n", mtd->name);
  580. part->mbd.readonly = 1;
  581. }
  582. printk(KERN_INFO PREFIX "name: '%s' type: %d flags %x\n",
  583. mtd->name, mtd->type, mtd->flags);
  584. if (!add_mtd_blktrans_dev((void*)part))
  585. return;
  586. }
  587. out:
  588. kfree(part);
  589. }
  590. static void rfd_ftl_remove_dev(struct mtd_blktrans_dev *dev)
  591. {
  592. struct partition *part = (struct partition*)dev;
  593. int i;
  594. for (i=0; i<part->total_blocks; i++) {
  595. pr_debug("rfd_ftl_remove_dev:'%s': erase unit #%02d: %d erases\n",
  596. part->mbd.mtd->name, i, part->blocks[i].erases);
  597. }
  598. del_mtd_blktrans_dev(dev);
  599. vfree(part->sector_map);
  600. kfree(part->header_cache);
  601. kfree(part->blocks);
  602. }
  603. static struct mtd_blktrans_ops rfd_ftl_tr = {
  604. .name = "rfd",
  605. .major = RFD_FTL_MAJOR,
  606. .part_bits = PART_BITS,
  607. .blksize = SECTOR_SIZE,
  608. .readsect = rfd_ftl_readsect,
  609. .writesect = rfd_ftl_writesect,
  610. .getgeo = rfd_ftl_getgeo,
  611. .add_mtd = rfd_ftl_add_mtd,
  612. .remove_dev = rfd_ftl_remove_dev,
  613. .owner = THIS_MODULE,
  614. };
  615. static int __init init_rfd_ftl(void)
  616. {
  617. return register_mtd_blktrans(&rfd_ftl_tr);
  618. }
  619. static void __exit cleanup_rfd_ftl(void)
  620. {
  621. deregister_mtd_blktrans(&rfd_ftl_tr);
  622. }
  623. module_init(init_rfd_ftl);
  624. module_exit(cleanup_rfd_ftl);
  625. MODULE_LICENSE("GPL");
  626. MODULE_AUTHOR("Sean Young <sean@mess.org>");
  627. MODULE_DESCRIPTION("Support code for RFD Flash Translation Layer, "
  628. "used by General Software's Embedded BIOS");