upd.c 10 KB

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