upd.c 13 KB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130131132133134135136137138139140141142143144145146147148149150151152153154155156157158159160161162163164165166167168169170171172173174175176177178179180181182183184185186187188189190191192193194195196197198199200201202203204205206207208209210211212213214215216217218219220221222223224225226227228229230231232233234235236237238239240241242243244245246247248249250251252253254255256257258259260261262263264265266267268269270271272273274275276277278279280281282283284285286287288289290291292293294295296297298299300301302303304305306307308309310311312313314315316317318319320321322323324325326327328329330331332333334335336337338339340341342343344345346347348349350351352353354355356357358359360361362363364365366367368369370371372373374375376377378379380381382383384385386387388389390391392393394395396397398399400401402403404405406407408409410411412413414415416417418419420421422423424425426427428429430431432433
  1. /*
  2. * Copyright (c) International Business Machines Corp., 2006
  3. * Copyright (c) Nokia Corporation, 2006
  4. *
  5. * This program is free software; you can redistribute it and/or modify
  6. * it under the terms of the GNU General Public License as published by
  7. * the Free Software Foundation; either version 2 of the License, or
  8. * (at your option) any later version.
  9. *
  10. * This program is distributed in the hope that it will be useful,
  11. * but WITHOUT ANY WARRANTY; without even the implied warranty of
  12. * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See
  13. * the GNU General Public License for more details.
  14. *
  15. * You should have received a copy of the GNU General Public License
  16. * along with this program; if not, write to the Free Software
  17. * Foundation, Inc., 59 Temple Place, Suite 330, Boston, MA 02111-1307 USA
  18. *
  19. * Author: Artem Bityutskiy (Битюцкий Артём)
  20. *
  21. * Jan 2007: Alexander Schmidt, hacked per-volume update.
  22. */
  23. /*
  24. * This file contains implementation of the volume update and atomic LEB change
  25. * functionality.
  26. *
  27. * The update operation is based on the per-volume update marker which is
  28. * stored in the volume table. The update marker is set before the update
  29. * starts, and removed after the update has been finished. So if the update was
  30. * interrupted by an unclean re-boot or due to some other reasons, the update
  31. * marker stays on the flash media and UBI finds it when it attaches the MTD
  32. * device next time. If the update marker is set for a volume, the volume is
  33. * treated as damaged and most I/O operations are prohibited. Only a new update
  34. * operation is allowed.
  35. *
  36. * Note, in general it is possible to implement the update operation as a
  37. * transaction with a roll-back capability.
  38. */
  39. #include <linux/err.h>
  40. #include <linux/uaccess.h>
  41. #include <linux/math64.h>
  42. #include "ubi.h"
  43. /**
  44. * set_update_marker - set update marker.
  45. * @ubi: UBI device description object
  46. * @vol: volume description object
  47. *
  48. * This function sets the update marker flag for volume @vol. Returns zero
  49. * in case of success and a negative error code in case of failure.
  50. */
  51. static int set_update_marker(struct ubi_device *ubi, struct ubi_volume *vol)
  52. {
  53. int err;
  54. struct ubi_vtbl_record vtbl_rec;
  55. dbg_gen("set update marker for volume %d", vol->vol_id);
  56. if (vol->upd_marker) {
  57. ubi_assert(ubi->vtbl[vol->vol_id].upd_marker);
  58. dbg_gen("already set");
  59. return 0;
  60. }
  61. vtbl_rec = ubi->vtbl[vol->vol_id];
  62. vtbl_rec.upd_marker = 1;
  63. mutex_lock(&ubi->device_mutex);
  64. err = ubi_change_vtbl_record(ubi, vol->vol_id, &vtbl_rec);
  65. vol->upd_marker = 1;
  66. mutex_unlock(&ubi->device_mutex);
  67. return err;
  68. }
  69. /**
  70. * clear_update_marker - clear update marker.
  71. * @ubi: UBI device description object
  72. * @vol: volume description object
  73. * @bytes: new data size in bytes
  74. *
  75. * This function clears the update marker for volume @vol, sets new volume
  76. * data size and clears the "corrupted" flag (static volumes only). Returns
  77. * zero in case of success and a negative error code in case of failure.
  78. */
  79. static int clear_update_marker(struct ubi_device *ubi, struct ubi_volume *vol,
  80. long long bytes)
  81. {
  82. int err;
  83. struct ubi_vtbl_record vtbl_rec;
  84. dbg_gen("clear update marker for volume %d", vol->vol_id);
  85. vtbl_rec = ubi->vtbl[vol->vol_id];
  86. ubi_assert(vol->upd_marker && vtbl_rec.upd_marker);
  87. vtbl_rec.upd_marker = 0;
  88. if (vol->vol_type == UBI_STATIC_VOLUME) {
  89. vol->corrupted = 0;
  90. vol->used_bytes = bytes;
  91. vol->used_ebs = div_u64_rem(bytes, vol->usable_leb_size,
  92. &vol->last_eb_bytes);
  93. if (vol->last_eb_bytes)
  94. vol->used_ebs += 1;
  95. else
  96. vol->last_eb_bytes = vol->usable_leb_size;
  97. }
  98. mutex_lock(&ubi->device_mutex);
  99. err = ubi_change_vtbl_record(ubi, vol->vol_id, &vtbl_rec);
  100. vol->upd_marker = 0;
  101. mutex_unlock(&ubi->device_mutex);
  102. return err;
  103. }
  104. /**
  105. * ubi_start_update - start volume update.
  106. * @ubi: UBI device description object
  107. * @vol: volume description object
  108. * @bytes: update bytes
  109. *
  110. * This function starts volume update operation. If @bytes is zero, the volume
  111. * is just wiped out. Returns zero in case of success and a negative error code
  112. * in case of failure.
  113. */
  114. int ubi_start_update(struct ubi_device *ubi, struct ubi_volume *vol,
  115. long long bytes)
  116. {
  117. int i, err;
  118. dbg_gen("start update of volume %d, %llu bytes", vol->vol_id, bytes);
  119. ubi_assert(!vol->updating && !vol->changing_leb);
  120. vol->updating = 1;
  121. vol->upd_buf = vmalloc(ubi->leb_size);
  122. if (!vol->upd_buf)
  123. return -ENOMEM;
  124. err = set_update_marker(ubi, vol);
  125. if (err)
  126. return err;
  127. /* Before updating - wipe out the volume */
  128. for (i = 0; i < vol->reserved_pebs; i++) {
  129. err = ubi_eba_unmap_leb(ubi, vol, i);
  130. if (err)
  131. return err;
  132. }
  133. err = ubi_wl_flush(ubi, UBI_ALL, UBI_ALL);
  134. if (err)
  135. return err;
  136. if (bytes == 0) {
  137. err = clear_update_marker(ubi, vol, 0);
  138. if (err)
  139. return err;
  140. vfree(vol->upd_buf);
  141. vol->updating = 0;
  142. return 0;
  143. }
  144. vol->upd_ebs = div_u64(bytes + vol->usable_leb_size - 1,
  145. vol->usable_leb_size);
  146. vol->upd_bytes = bytes;
  147. vol->upd_received = 0;
  148. return 0;
  149. }
  150. /**
  151. * ubi_start_leb_change - start atomic LEB change.
  152. * @ubi: UBI device description object
  153. * @vol: volume description object
  154. * @req: operation request
  155. *
  156. * This function starts atomic LEB change operation. Returns zero in case of
  157. * success and a negative error code in case of failure.
  158. */
  159. int ubi_start_leb_change(struct ubi_device *ubi, struct ubi_volume *vol,
  160. const struct ubi_leb_change_req *req)
  161. {
  162. ubi_assert(!vol->updating && !vol->changing_leb);
  163. dbg_gen("start changing LEB %d:%d, %u bytes",
  164. vol->vol_id, req->lnum, req->bytes);
  165. if (req->bytes == 0)
  166. return ubi_eba_atomic_leb_change(ubi, vol, req->lnum, NULL, 0);
  167. vol->upd_bytes = req->bytes;
  168. vol->upd_received = 0;
  169. vol->changing_leb = 1;
  170. vol->ch_lnum = req->lnum;
  171. vol->upd_buf = vmalloc(ALIGN((int)req->bytes, ubi->min_io_size));
  172. if (!vol->upd_buf)
  173. return -ENOMEM;
  174. return 0;
  175. }
  176. /**
  177. * write_leb - write update data.
  178. * @ubi: UBI device description object
  179. * @vol: volume description object
  180. * @lnum: logical eraseblock number
  181. * @buf: data to write
  182. * @len: data size
  183. * @used_ebs: how many logical eraseblocks will this volume contain (static
  184. * volumes only)
  185. *
  186. * This function writes update data to corresponding logical eraseblock. In
  187. * case of dynamic volume, this function checks if the data contains 0xFF bytes
  188. * at the end. If yes, the 0xFF bytes are cut and not written. So if the whole
  189. * buffer contains only 0xFF bytes, the LEB is left unmapped.
  190. *
  191. * The reason why we skip the trailing 0xFF bytes in case of dynamic volume is
  192. * that we want to make sure that more data may be appended to the logical
  193. * eraseblock in future. Indeed, writing 0xFF bytes may have side effects and
  194. * this PEB won't be writable anymore. So if one writes the file-system image
  195. * to the UBI volume where 0xFFs mean free space - UBI makes sure this free
  196. * space is writable after the update.
  197. *
  198. * We do not do this for static volumes because they are read-only. But this
  199. * also cannot be done because we have to store per-LEB CRC and the correct
  200. * data length.
  201. *
  202. * This function returns zero in case of success and a negative error code in
  203. * case of failure.
  204. */
  205. static int write_leb(struct ubi_device *ubi, struct ubi_volume *vol, int lnum,
  206. void *buf, int len, int used_ebs)
  207. {
  208. int err;
  209. if (vol->vol_type == UBI_DYNAMIC_VOLUME) {
  210. int l = ALIGN(len, ubi->min_io_size);
  211. memset(buf + len, 0xFF, l - len);
  212. len = ubi_calc_data_len(ubi, buf, l);
  213. if (len == 0) {
  214. dbg_gen("all %d bytes contain 0xFF - skip", len);
  215. return 0;
  216. }
  217. err = ubi_eba_write_leb(ubi, vol, lnum, buf, 0, len);
  218. } else {
  219. /*
  220. * When writing static volume, and this is the last logical
  221. * eraseblock, the length (@len) does not have to be aligned to
  222. * the minimal flash I/O unit. The 'ubi_eba_write_leb_st()'
  223. * function accepts exact (unaligned) length and stores it in
  224. * the VID header. And it takes care of proper alignment by
  225. * padding the buffer. Here we just make sure the padding will
  226. * contain zeros, not random trash.
  227. */
  228. memset(buf + len, 0, vol->usable_leb_size - len);
  229. err = ubi_eba_write_leb_st(ubi, vol, lnum, buf, len, used_ebs);
  230. }
  231. return err;
  232. }
  233. /**
  234. * ubi_more_update_data - write more update data.
  235. * @ubi: UBI device description object
  236. * @vol: volume description object
  237. * @buf: write data (user-space memory buffer)
  238. * @count: how much bytes to write
  239. *
  240. * This function writes more data to the volume which is being updated. It may
  241. * be called arbitrary number of times until all the update data arriveis. This
  242. * function returns %0 in case of success, number of bytes written during the
  243. * last call if the whole volume update has been successfully finished, and a
  244. * negative error code in case of failure.
  245. */
  246. int ubi_more_update_data(struct ubi_device *ubi, struct ubi_volume *vol,
  247. const void __user *buf, int count)
  248. {
  249. int lnum, offs, err = 0, len, to_write = count;
  250. dbg_gen("write %d of %lld bytes, %lld already passed",
  251. count, vol->upd_bytes, vol->upd_received);
  252. if (ubi->ro_mode)
  253. return -EROFS;
  254. lnum = div_u64_rem(vol->upd_received, vol->usable_leb_size, &offs);
  255. if (vol->upd_received + count > vol->upd_bytes)
  256. to_write = count = vol->upd_bytes - vol->upd_received;
  257. /*
  258. * When updating volumes, we accumulate whole logical eraseblock of
  259. * data and write it at once.
  260. */
  261. if (offs != 0) {
  262. /*
  263. * This is a write to the middle of the logical eraseblock. We
  264. * copy the data to our update buffer and wait for more data or
  265. * flush it if the whole eraseblock is written or the update
  266. * is finished.
  267. */
  268. len = vol->usable_leb_size - offs;
  269. if (len > count)
  270. len = count;
  271. err = copy_from_user(vol->upd_buf + offs, buf, len);
  272. if (err)
  273. return -EFAULT;
  274. if (offs + len == vol->usable_leb_size ||
  275. vol->upd_received + len == vol->upd_bytes) {
  276. int flush_len = offs + len;
  277. /*
  278. * OK, we gathered either the whole eraseblock or this
  279. * is the last chunk, it's time to flush the buffer.
  280. */
  281. ubi_assert(flush_len <= vol->usable_leb_size);
  282. err = write_leb(ubi, vol, lnum, vol->upd_buf, flush_len,
  283. vol->upd_ebs);
  284. if (err)
  285. return err;
  286. }
  287. vol->upd_received += len;
  288. count -= len;
  289. buf += len;
  290. lnum += 1;
  291. }
  292. /*
  293. * If we've got more to write, let's continue. At this point we know we
  294. * are starting from the beginning of an eraseblock.
  295. */
  296. while (count) {
  297. if (count > vol->usable_leb_size)
  298. len = vol->usable_leb_size;
  299. else
  300. len = count;
  301. err = copy_from_user(vol->upd_buf, buf, len);
  302. if (err)
  303. return -EFAULT;
  304. if (len == vol->usable_leb_size ||
  305. vol->upd_received + len == vol->upd_bytes) {
  306. err = write_leb(ubi, vol, lnum, vol->upd_buf,
  307. len, vol->upd_ebs);
  308. if (err)
  309. break;
  310. }
  311. vol->upd_received += len;
  312. count -= len;
  313. lnum += 1;
  314. buf += len;
  315. }
  316. ubi_assert(vol->upd_received <= vol->upd_bytes);
  317. if (vol->upd_received == vol->upd_bytes) {
  318. err = ubi_wl_flush(ubi, UBI_ALL, UBI_ALL);
  319. if (err)
  320. return err;
  321. /* The update is finished, clear the update marker */
  322. err = clear_update_marker(ubi, vol, vol->upd_bytes);
  323. if (err)
  324. return err;
  325. vol->updating = 0;
  326. err = to_write;
  327. vfree(vol->upd_buf);
  328. }
  329. return err;
  330. }
  331. /**
  332. * ubi_more_leb_change_data - accept more data for atomic LEB change.
  333. * @ubi: UBI device description object
  334. * @vol: volume description object
  335. * @buf: write data (user-space memory buffer)
  336. * @count: how much bytes to write
  337. *
  338. * This function accepts more data to the volume which is being under the
  339. * "atomic LEB change" operation. It may be called arbitrary number of times
  340. * until all data arrives. This function returns %0 in case of success, number
  341. * of bytes written during the last call if the whole "atomic LEB change"
  342. * operation has been successfully finished, and a negative error code in case
  343. * of failure.
  344. */
  345. int ubi_more_leb_change_data(struct ubi_device *ubi, struct ubi_volume *vol,
  346. const void __user *buf, int count)
  347. {
  348. int err;
  349. dbg_gen("write %d of %lld bytes, %lld already passed",
  350. count, vol->upd_bytes, vol->upd_received);
  351. if (ubi->ro_mode)
  352. return -EROFS;
  353. if (vol->upd_received + count > vol->upd_bytes)
  354. count = vol->upd_bytes - vol->upd_received;
  355. err = copy_from_user(vol->upd_buf + vol->upd_received, buf, count);
  356. if (err)
  357. return -EFAULT;
  358. vol->upd_received += count;
  359. if (vol->upd_received == vol->upd_bytes) {
  360. int len = ALIGN((int)vol->upd_bytes, ubi->min_io_size);
  361. memset(vol->upd_buf + vol->upd_bytes, 0xFF,
  362. len - vol->upd_bytes);
  363. len = ubi_calc_data_len(ubi, vol->upd_buf, len);
  364. err = ubi_eba_atomic_leb_change(ubi, vol, vol->ch_lnum,
  365. vol->upd_buf, len);
  366. if (err)
  367. return err;
  368. }
  369. ubi_assert(vol->upd_received <= vol->upd_bytes);
  370. if (vol->upd_received == vol->upd_bytes) {
  371. vol->changing_leb = 0;
  372. err = count;
  373. vfree(vol->upd_buf);
  374. }
  375. return err;
  376. }