rfd_ftl.c 18 KB

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