upd.c 13 KB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130131132133134135136137138139140141142143144145146147148149150151152153154155156157158159160161162163164165166167168169170171172173174175176177178179180181182183184185186187188189190191192193194195196197198199200201202203204205206207208209210211212213214215216217218219220221222223224225226227228229230231232233234235236237238239240241242243244245246247248249250251252253254255256257258259260261262263264265266267268269270271272273274275276277278279280281282283284285286287288289290291292293294295296297298299300301302303304305306307308309310311312313314315316317318319320321322323324325326327328329330331332333334335336337338339340341342343344345346347348349350351352353354355356357358359360361362363364365366367368369370371372373374375376377378379380381382383384385386387388389390391392393394395396397398399400401402403404405406407408409410411412413414415416417418419420421422423424425426427428429430431432433434435436437438439440
  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. memcpy(&vtbl_rec, &ubi->vtbl[vol->vol_id],
  62. sizeof(struct ubi_vtbl_record));
  63. vtbl_rec.upd_marker = 1;
  64. mutex_lock(&ubi->device_mutex);
  65. err = ubi_change_vtbl_record(ubi, vol->vol_id, &vtbl_rec);
  66. vol->upd_marker = 1;
  67. mutex_unlock(&ubi->device_mutex);
  68. return err;
  69. }
  70. /**
  71. * clear_update_marker - clear update marker.
  72. * @ubi: UBI device description object
  73. * @vol: volume description object
  74. * @bytes: new data size in bytes
  75. *
  76. * This function clears the update marker for volume @vol, sets new volume
  77. * data size and clears the "corrupted" flag (static volumes only). Returns
  78. * zero in case of success and a negative error code in case of failure.
  79. */
  80. static int clear_update_marker(struct ubi_device *ubi, struct ubi_volume *vol,
  81. long long bytes)
  82. {
  83. int err;
  84. struct ubi_vtbl_record vtbl_rec;
  85. dbg_gen("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 = bytes;
  93. vol->used_ebs = div_u64_rem(bytes, vol->usable_leb_size,
  94. &vol->last_eb_bytes);
  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->device_mutex);
  101. err = ubi_change_vtbl_record(ubi, vol->vol_id, &vtbl_rec);
  102. vol->upd_marker = 0;
  103. mutex_unlock(&ubi->device_mutex);
  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. dbg_gen("start update of volume %d, %llu bytes", vol->vol_id, bytes);
  121. ubi_assert(!vol->updating && !vol->changing_leb);
  122. vol->updating = 1;
  123. vol->upd_buf = vmalloc(ubi->leb_size);
  124. if (!vol->upd_buf)
  125. return -ENOMEM;
  126. err = set_update_marker(ubi, vol);
  127. if (err)
  128. return err;
  129. /* Before updating - wipe out the volume */
  130. for (i = 0; i < vol->reserved_pebs; i++) {
  131. err = ubi_eba_unmap_leb(ubi, vol, i);
  132. if (err)
  133. return err;
  134. }
  135. if (bytes == 0) {
  136. err = ubi_wl_flush(ubi);
  137. if (err)
  138. return err;
  139. err = clear_update_marker(ubi, vol, 0);
  140. if (err)
  141. return err;
  142. vfree(vol->upd_buf);
  143. vol->updating = 0;
  144. return 0;
  145. }
  146. vol->upd_ebs = div_u64(bytes + vol->usable_leb_size - 1,
  147. vol->usable_leb_size);
  148. vol->upd_bytes = bytes;
  149. vol->upd_received = 0;
  150. return 0;
  151. }
  152. /**
  153. * ubi_start_leb_change - start atomic LEB change.
  154. * @ubi: UBI device description object
  155. * @vol: volume description object
  156. * @req: operation request
  157. *
  158. * This function starts atomic LEB change operation. Returns zero in case of
  159. * success and a negative error code in case of failure.
  160. */
  161. int ubi_start_leb_change(struct ubi_device *ubi, struct ubi_volume *vol,
  162. const struct ubi_leb_change_req *req)
  163. {
  164. ubi_assert(!vol->updating && !vol->changing_leb);
  165. dbg_gen("start changing LEB %d:%d, %u bytes",
  166. vol->vol_id, req->lnum, req->bytes);
  167. if (req->bytes == 0)
  168. return ubi_eba_atomic_leb_change(ubi, vol, req->lnum, NULL, 0,
  169. req->dtype);
  170. vol->upd_bytes = req->bytes;
  171. vol->upd_received = 0;
  172. vol->changing_leb = 1;
  173. vol->ch_lnum = req->lnum;
  174. vol->ch_dtype = req->dtype;
  175. vol->upd_buf = vmalloc(req->bytes);
  176. if (!vol->upd_buf)
  177. return -ENOMEM;
  178. return 0;
  179. }
  180. /**
  181. * write_leb - write update data.
  182. * @ubi: UBI device description object
  183. * @vol: volume description object
  184. * @lnum: logical eraseblock number
  185. * @buf: data to write
  186. * @len: data size
  187. * @used_ebs: how many logical eraseblocks will this volume contain (static
  188. * volumes only)
  189. *
  190. * This function writes update data to corresponding logical eraseblock. In
  191. * case of dynamic volume, this function checks if the data contains 0xFF bytes
  192. * at the end. If yes, the 0xFF bytes are cut and not written. So if the whole
  193. * buffer contains only 0xFF bytes, the LEB is left unmapped.
  194. *
  195. * The reason why we skip the trailing 0xFF bytes in case of dynamic volume is
  196. * that we want to make sure that more data may be appended to the logical
  197. * eraseblock in future. Indeed, writing 0xFF bytes may have side effects and
  198. * this PEB won't be writable anymore. So if one writes the file-system image
  199. * to the UBI volume where 0xFFs mean free space - UBI makes sure this free
  200. * space is writable after the update.
  201. *
  202. * We do not do this for static volumes because they are read-only. But this
  203. * also cannot be done because we have to store per-LEB CRC and the correct
  204. * data length.
  205. *
  206. * This function returns zero in case of success and a negative error code in
  207. * case of failure.
  208. */
  209. static int write_leb(struct ubi_device *ubi, struct ubi_volume *vol, int lnum,
  210. void *buf, int len, int used_ebs)
  211. {
  212. int err;
  213. if (vol->vol_type == UBI_DYNAMIC_VOLUME) {
  214. int l = ALIGN(len, ubi->min_io_size);
  215. memset(buf + len, 0xFF, l - len);
  216. len = ubi_calc_data_len(ubi, buf, l);
  217. if (len == 0) {
  218. dbg_gen("all %d bytes contain 0xFF - skip", len);
  219. return 0;
  220. }
  221. err = ubi_eba_write_leb(ubi, vol, lnum, buf, 0, len,
  222. UBI_UNKNOWN);
  223. } else {
  224. /*
  225. * When writing static volume, and this is the last logical
  226. * eraseblock, the length (@len) does not have to be aligned to
  227. * the minimal flash I/O unit. The 'ubi_eba_write_leb_st()'
  228. * function accepts exact (unaligned) length and stores it in
  229. * the VID header. And it takes care of proper alignment by
  230. * padding the buffer. Here we just make sure the padding will
  231. * contain zeros, not random trash.
  232. */
  233. memset(buf + len, 0, vol->usable_leb_size - len);
  234. err = ubi_eba_write_leb_st(ubi, vol, lnum, buf, len,
  235. UBI_UNKNOWN, used_ebs);
  236. }
  237. return err;
  238. }
  239. /**
  240. * ubi_more_update_data - write more update data.
  241. * @ubi: UBI device description object
  242. * @vol: volume description object
  243. * @buf: write data (user-space memory buffer)
  244. * @count: how much bytes to write
  245. *
  246. * This function writes more data to the volume which is being updated. It may
  247. * be called arbitrary number of times until all the update data arriveis. This
  248. * function returns %0 in case of success, number of bytes written during the
  249. * last call if the whole volume update has been successfully finished, and a
  250. * negative error code in case of failure.
  251. */
  252. int ubi_more_update_data(struct ubi_device *ubi, struct ubi_volume *vol,
  253. const void __user *buf, int count)
  254. {
  255. int lnum, offs, err = 0, len, to_write = count;
  256. dbg_gen("write %d of %lld bytes, %lld already passed",
  257. count, vol->upd_bytes, vol->upd_received);
  258. if (ubi->ro_mode)
  259. return -EROFS;
  260. lnum = div_u64_rem(vol->upd_received, vol->usable_leb_size, &offs);
  261. if (vol->upd_received + count > vol->upd_bytes)
  262. to_write = count = vol->upd_bytes - vol->upd_received;
  263. /*
  264. * When updating volumes, we accumulate whole logical eraseblock of
  265. * data and write it at once.
  266. */
  267. if (offs != 0) {
  268. /*
  269. * This is a write to the middle of the logical eraseblock. We
  270. * copy the data to our update buffer and wait for more data or
  271. * flush it if the whole eraseblock is written or the update
  272. * is finished.
  273. */
  274. len = vol->usable_leb_size - offs;
  275. if (len > count)
  276. len = count;
  277. err = copy_from_user(vol->upd_buf + offs, buf, len);
  278. if (err)
  279. return -EFAULT;
  280. if (offs + len == vol->usable_leb_size ||
  281. vol->upd_received + len == vol->upd_bytes) {
  282. int flush_len = offs + len;
  283. /*
  284. * OK, we gathered either the whole eraseblock or this
  285. * is the last chunk, it's time to flush the buffer.
  286. */
  287. ubi_assert(flush_len <= vol->usable_leb_size);
  288. err = write_leb(ubi, vol, lnum, vol->upd_buf, flush_len,
  289. vol->upd_ebs);
  290. if (err)
  291. return err;
  292. }
  293. vol->upd_received += len;
  294. count -= len;
  295. buf += len;
  296. lnum += 1;
  297. }
  298. /*
  299. * If we've got more to write, let's continue. At this point we know we
  300. * are starting from the beginning of an eraseblock.
  301. */
  302. while (count) {
  303. if (count > vol->usable_leb_size)
  304. len = vol->usable_leb_size;
  305. else
  306. len = count;
  307. err = copy_from_user(vol->upd_buf, buf, len);
  308. if (err)
  309. return -EFAULT;
  310. if (len == vol->usable_leb_size ||
  311. vol->upd_received + len == vol->upd_bytes) {
  312. err = write_leb(ubi, vol, lnum, vol->upd_buf,
  313. len, vol->upd_ebs);
  314. if (err)
  315. break;
  316. }
  317. vol->upd_received += len;
  318. count -= len;
  319. lnum += 1;
  320. buf += len;
  321. }
  322. ubi_assert(vol->upd_received <= vol->upd_bytes);
  323. if (vol->upd_received == vol->upd_bytes) {
  324. err = ubi_wl_flush(ubi);
  325. if (err)
  326. return err;
  327. /* The update is finished, clear the update marker */
  328. err = clear_update_marker(ubi, vol, vol->upd_bytes);
  329. if (err)
  330. return err;
  331. vol->updating = 0;
  332. err = to_write;
  333. vfree(vol->upd_buf);
  334. }
  335. return err;
  336. }
  337. /**
  338. * ubi_more_leb_change_data - accept more data for atomic LEB change.
  339. * @ubi: UBI device description object
  340. * @vol: volume description object
  341. * @buf: write data (user-space memory buffer)
  342. * @count: how much bytes to write
  343. *
  344. * This function accepts more data to the volume which is being under the
  345. * "atomic LEB change" operation. It may be called arbitrary number of times
  346. * until all data arrives. This function returns %0 in case of success, number
  347. * of bytes written during the last call if the whole "atomic LEB change"
  348. * operation has been successfully finished, and a negative error code in case
  349. * of failure.
  350. */
  351. int ubi_more_leb_change_data(struct ubi_device *ubi, struct ubi_volume *vol,
  352. const void __user *buf, int count)
  353. {
  354. int err;
  355. dbg_gen("write %d of %lld bytes, %lld already passed",
  356. count, vol->upd_bytes, vol->upd_received);
  357. if (ubi->ro_mode)
  358. return -EROFS;
  359. if (vol->upd_received + count > vol->upd_bytes)
  360. count = vol->upd_bytes - vol->upd_received;
  361. err = copy_from_user(vol->upd_buf + vol->upd_received, buf, count);
  362. if (err)
  363. return -EFAULT;
  364. vol->upd_received += count;
  365. if (vol->upd_received == vol->upd_bytes) {
  366. int len = ALIGN((int)vol->upd_bytes, ubi->min_io_size);
  367. memset(vol->upd_buf + vol->upd_bytes, 0xFF,
  368. len - vol->upd_bytes);
  369. len = ubi_calc_data_len(ubi, vol->upd_buf, len);
  370. err = ubi_eba_atomic_leb_change(ubi, vol, vol->ch_lnum,
  371. vol->upd_buf, len, UBI_UNKNOWN);
  372. if (err)
  373. return err;
  374. }
  375. ubi_assert(vol->upd_received <= vol->upd_bytes);
  376. if (vol->upd_received == vol->upd_bytes) {
  377. vol->changing_leb = 0;
  378. err = count;
  379. vfree(vol->upd_buf);
  380. }
  381. return err;
  382. }