upd.c 10 KB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130131132133134135136137138139140141142143144145146147148149150151152153154155156157158159160161162163164165166167168169170171172173174175176177178179180181182183184185186187188189190191192193194195196197198199200201202203204205206207208209210211212213214215216217218219220221222223224225226227228229230231232233234235236237238239240241242243244245246247248249250251252253254255256257258259260261262263264265266267268269270271272273274275276277278279280281282283284285286287288289290291292293294295296297298299300301302303304305306307308309310311312313314315316317318319320321322323324325326327328329330331332333334335336337338339340341342343344345346347348
  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 functionality.
  25. *
  26. * The update operation is based on the per-volume update marker which is
  27. * stored in the volume table. The update marker is set before the update
  28. * starts, and removed after the update has been finished. So if the update was
  29. * interrupted by an unclean re-boot or due to some other reasons, the update
  30. * marker stays on the flash media and UBI finds it when it attaches the MTD
  31. * device next time. If the update marker is set for a volume, the volume is
  32. * treated as damaged and most I/O operations are prohibited. Only a new update
  33. * operation is allowed.
  34. *
  35. * Note, in general it is possible to implement the update operation as a
  36. * transaction with a roll-back capability.
  37. */
  38. #include <linux/err.h>
  39. #include <asm/uaccess.h>
  40. #include <asm/div64.h>
  41. #include "ubi.h"
  42. /**
  43. * set_update_marker - set update marker.
  44. * @ubi: UBI device description object
  45. * @vol_id: volume ID
  46. *
  47. * This function sets the update marker flag for volume @vol_id. Returns zero
  48. * in case of success and a negative error code in case of failure.
  49. */
  50. static int set_update_marker(struct ubi_device *ubi, int vol_id)
  51. {
  52. int err;
  53. struct ubi_vtbl_record vtbl_rec;
  54. struct ubi_volume *vol = ubi->volumes[vol_id];
  55. dbg_msg("set update marker for volume %d", vol_id);
  56. if (vol->upd_marker) {
  57. ubi_assert(ubi->vtbl[vol_id].upd_marker);
  58. dbg_msg("already set");
  59. return 0;
  60. }
  61. memcpy(&vtbl_rec, &ubi->vtbl[vol_id], sizeof(struct ubi_vtbl_record));
  62. vtbl_rec.upd_marker = 1;
  63. err = ubi_change_vtbl_record(ubi, vol_id, &vtbl_rec);
  64. vol->upd_marker = 1;
  65. return err;
  66. }
  67. /**
  68. * clear_update_marker - clear update marker.
  69. * @ubi: UBI device description object
  70. * @vol_id: volume ID
  71. * @bytes: new data size in bytes
  72. *
  73. * This function clears the update marker for volume @vol_id, sets new volume
  74. * data size and clears the "corrupted" flag (static volumes only). Returns
  75. * zero in case of success and a negative error code in case of failure.
  76. */
  77. static int clear_update_marker(struct ubi_device *ubi, int vol_id, long long bytes)
  78. {
  79. int err;
  80. uint64_t tmp;
  81. struct ubi_vtbl_record vtbl_rec;
  82. struct ubi_volume *vol = ubi->volumes[vol_id];
  83. dbg_msg("clear update marker for volume %d", vol_id);
  84. memcpy(&vtbl_rec, &ubi->vtbl[vol_id], sizeof(struct ubi_vtbl_record));
  85. ubi_assert(vol->upd_marker && vtbl_rec.upd_marker);
  86. vtbl_rec.upd_marker = 0;
  87. if (vol->vol_type == UBI_STATIC_VOLUME) {
  88. vol->corrupted = 0;
  89. vol->used_bytes = tmp = bytes;
  90. vol->last_eb_bytes = do_div(tmp, vol->usable_leb_size);
  91. vol->used_ebs = tmp;
  92. if (vol->last_eb_bytes)
  93. vol->used_ebs += 1;
  94. else
  95. vol->last_eb_bytes = vol->usable_leb_size;
  96. }
  97. err = ubi_change_vtbl_record(ubi, vol_id, &vtbl_rec);
  98. vol->upd_marker = 0;
  99. return err;
  100. }
  101. /**
  102. * ubi_start_update - start volume update.
  103. * @ubi: UBI device description object
  104. * @vol_id: volume ID
  105. * @bytes: update bytes
  106. *
  107. * This function starts volume update operation. If @bytes is zero, the volume
  108. * is just wiped out. Returns zero in case of success and a negative error code
  109. * in case of failure.
  110. */
  111. int ubi_start_update(struct ubi_device *ubi, int vol_id, long long bytes)
  112. {
  113. int i, err;
  114. uint64_t tmp;
  115. struct ubi_volume *vol = ubi->volumes[vol_id];
  116. dbg_msg("start update of volume %d, %llu bytes", vol_id, bytes);
  117. vol->updating = 1;
  118. err = set_update_marker(ubi, vol_id);
  119. if (err)
  120. return err;
  121. /* Before updating - wipe out the volume */
  122. for (i = 0; i < vol->reserved_pebs; i++) {
  123. err = ubi_eba_unmap_leb(ubi, vol_id, i);
  124. if (err)
  125. return err;
  126. }
  127. if (bytes == 0) {
  128. err = clear_update_marker(ubi, vol_id, 0);
  129. if (err)
  130. return err;
  131. err = ubi_wl_flush(ubi);
  132. if (!err)
  133. vol->updating = 0;
  134. }
  135. vol->upd_buf = kmalloc(ubi->leb_size, GFP_KERNEL);
  136. if (!vol->upd_buf)
  137. return -ENOMEM;
  138. tmp = bytes;
  139. vol->upd_ebs = !!do_div(tmp, vol->usable_leb_size);
  140. vol->upd_ebs += tmp;
  141. vol->upd_bytes = bytes;
  142. vol->upd_received = 0;
  143. return 0;
  144. }
  145. /**
  146. * write_leb - write update data.
  147. * @ubi: UBI device description object
  148. * @vol_id: volume ID
  149. * @lnum: logical eraseblock number
  150. * @buf: data to write
  151. * @len: data size
  152. * @used_ebs: how many logical eraseblocks will this volume contain (static
  153. * volumes only)
  154. *
  155. * This function writes update data to corresponding logical eraseblock. In
  156. * case of dynamic volume, this function checks if the data contains 0xFF bytes
  157. * at the end. If yes, the 0xFF bytes are cut and not written. So if the whole
  158. * buffer contains only 0xFF bytes, the LEB is left unmapped.
  159. *
  160. * The reason why we skip the trailing 0xFF bytes in case of dynamic volume is
  161. * that we want to make sure that more data may be appended to the logical
  162. * eraseblock in future. Indeed, writing 0xFF bytes may have side effects and
  163. * this PEB won't be writable anymore. So if one writes the file-system image
  164. * to the UBI volume where 0xFFs mean free space - UBI makes sure this free
  165. * space is writable after the update.
  166. *
  167. * We do not do this for static volumes because they are read-only. But this
  168. * also cannot be done because we have to store per-LEB CRC and the correct
  169. * data length.
  170. *
  171. * This function returns zero in case of success and a negative error code in
  172. * case of failure.
  173. */
  174. static int write_leb(struct ubi_device *ubi, int vol_id, int lnum, void *buf,
  175. int len, int used_ebs)
  176. {
  177. int err, l;
  178. struct ubi_volume *vol = ubi->volumes[vol_id];
  179. if (vol->vol_type == UBI_DYNAMIC_VOLUME) {
  180. l = ALIGN(len, ubi->min_io_size);
  181. memset(buf + len, 0xFF, l - len);
  182. l = ubi_calc_data_len(ubi, buf, l);
  183. if (l == 0) {
  184. dbg_msg("all %d bytes contain 0xFF - skip", len);
  185. return 0;
  186. }
  187. if (len != l)
  188. dbg_msg("skip last %d bytes (0xFF)", len - l);
  189. err = ubi_eba_write_leb(ubi, vol_id, lnum, buf, 0, l,
  190. UBI_UNKNOWN);
  191. } else {
  192. /*
  193. * When writing static volume, and this is the last logical
  194. * eraseblock, the length (@len) does not have to be aligned to
  195. * the minimal flash I/O unit. The 'ubi_eba_write_leb_st()'
  196. * function accepts exact (unaligned) length and stores it in
  197. * the VID header. And it takes care of proper alignment by
  198. * padding the buffer. Here we just make sure the padding will
  199. * contain zeros, not random trash.
  200. */
  201. memset(buf + len, 0, vol->usable_leb_size - len);
  202. err = ubi_eba_write_leb_st(ubi, vol_id, lnum, buf, len,
  203. UBI_UNKNOWN, used_ebs);
  204. }
  205. return err;
  206. }
  207. /**
  208. * ubi_more_update_data - write more update data.
  209. * @vol: volume description object
  210. * @buf: write data (user-space memory buffer)
  211. * @count: how much bytes to write
  212. *
  213. * This function writes more data to the volume which is being updated. It may
  214. * be called arbitrary number of times until all of the update data arrive.
  215. * This function returns %0 in case of success, number of bytes written during
  216. * the last call if the whole volume update was successfully finished, and a
  217. * negative error code in case of failure.
  218. */
  219. int ubi_more_update_data(struct ubi_device *ubi, int vol_id,
  220. const void __user *buf, int count)
  221. {
  222. uint64_t tmp;
  223. struct ubi_volume *vol = ubi->volumes[vol_id];
  224. int lnum, offs, err = 0, len, to_write = count;
  225. dbg_msg("write %d of %lld bytes, %lld already passed",
  226. count, vol->upd_bytes, vol->upd_received);
  227. if (ubi->ro_mode)
  228. return -EROFS;
  229. tmp = vol->upd_received;
  230. offs = do_div(tmp, vol->usable_leb_size);
  231. lnum = tmp;
  232. if (vol->upd_received + count > vol->upd_bytes)
  233. to_write = count = vol->upd_bytes - vol->upd_received;
  234. /*
  235. * When updating volumes, we accumulate whole logical eraseblock of
  236. * data and write it at once.
  237. */
  238. if (offs != 0) {
  239. /*
  240. * This is a write to the middle of the logical eraseblock. We
  241. * copy the data to our update buffer and wait for more data or
  242. * flush it if the whole eraseblock is written or the update
  243. * is finished.
  244. */
  245. len = vol->usable_leb_size - offs;
  246. if (len > count)
  247. len = count;
  248. err = copy_from_user(vol->upd_buf + offs, buf, len);
  249. if (err)
  250. return -EFAULT;
  251. if (offs + len == vol->usable_leb_size ||
  252. vol->upd_received + len == vol->upd_bytes) {
  253. int flush_len = offs + len;
  254. /*
  255. * OK, we gathered either the whole eraseblock or this
  256. * is the last chunk, it's time to flush the buffer.
  257. */
  258. ubi_assert(flush_len <= vol->usable_leb_size);
  259. err = write_leb(ubi, vol_id, lnum, vol->upd_buf,
  260. flush_len, vol->upd_ebs);
  261. if (err)
  262. return err;
  263. }
  264. vol->upd_received += len;
  265. count -= len;
  266. buf += len;
  267. lnum += 1;
  268. }
  269. /*
  270. * If we've got more to write, let's continue. At this point we know we
  271. * are starting from the beginning of an eraseblock.
  272. */
  273. while (count) {
  274. if (count > vol->usable_leb_size)
  275. len = vol->usable_leb_size;
  276. else
  277. len = count;
  278. err = copy_from_user(vol->upd_buf, buf, len);
  279. if (err)
  280. return -EFAULT;
  281. if (len == vol->usable_leb_size ||
  282. vol->upd_received + len == vol->upd_bytes) {
  283. err = write_leb(ubi, vol_id, lnum, vol->upd_buf, len,
  284. vol->upd_ebs);
  285. if (err)
  286. break;
  287. }
  288. vol->upd_received += len;
  289. count -= len;
  290. lnum += 1;
  291. buf += len;
  292. }
  293. ubi_assert(vol->upd_received <= vol->upd_bytes);
  294. if (vol->upd_received == vol->upd_bytes) {
  295. /* The update is finished, clear the update marker */
  296. err = clear_update_marker(ubi, vol_id, vol->upd_bytes);
  297. if (err)
  298. return err;
  299. err = ubi_wl_flush(ubi);
  300. if (err == 0) {
  301. err = to_write;
  302. kfree(vol->upd_buf);
  303. vol->updating = 0;
  304. }
  305. }
  306. return err;
  307. }