aops.c 40 KB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130131132133134135136137138139140141142143144145146147148149150151152153154155156157158159160161162163164165166167168169170171172173174175176177178179180181182183184185186187188189190191192193194195196197198199200201202203204205206207208209210211212213214215216217218219220221222223224225226227228229230231232233234235236237238239240241242243244245246247248249250251252253254255256257258259260261262263264265266267268269270271272273274275276277278279280281282283284285286287288289290291292293294295296297298299300301302303304305306307308309310311312313314315316317318319320321322323324325326327328329330331332333334335336337338339340341342343344345346347348349350351352353354355356357358359360361362363364365366367368369370371372373374375376377378379380381382383384385386387388389390391392393394395396397398399400401402403404405406407408409410411412413414415416417418419420421422423424425426427428429430431432433434435436437438439440441442443444445446447448449450451452453454455456457458459460461462463464465466467468469470471472473474475476477478479480481482483484485486487488489490491492493494495496497498499500501502503504505506507508509510511512513514515516517518519520521522523524525526527528529530531532533534535536537538539540541542543544545546547548549550551552553554555556557558559560561562563564565566567568569570571572573574575576577578579580581582583584585586587588589590591592593594595596597598599600601602603604605606607608609610611612613614615616617618619620621622623624625626627628629630631632633634635636637638639640641642643644645646647648649650651652653654655656657658659660661662663664665666667668669670671672673674675676677678679680681682683684685686687688689690691692693694695696697698699700701702703704705706707708709710711712713714715716717718719720721722723724725726727728729730731732733734735736737738739740741742743744745746747748749750751752753754755756757758759760761762763764765766767768769770771772773774775776777778779780781782783784785786787788789790791792793794795796797798799800801802803804805806807808809810811812813814815816817818819820821822823824825826827828829830831832833834835836837838839840841842843844845846847848849850851852853854855856857858859860861862863864865866867868869870871872873874875876877878879880881882883884885886887888889890891892893894895896897898899900901902903904905906907908909910911912913914915916917918919920921922923924925926927928929930931932933934935936937938939940941942943944945946947948949950951952953954955956957958959960961962963964965966967968969970971972973974975976977978979980981982983984985986987988989990991992993994995996997998999100010011002100310041005100610071008100910101011101210131014101510161017101810191020102110221023102410251026102710281029103010311032103310341035103610371038103910401041104210431044104510461047104810491050105110521053105410551056105710581059106010611062106310641065106610671068106910701071107210731074107510761077107810791080108110821083108410851086108710881089109010911092109310941095109610971098109911001101110211031104110511061107110811091110111111121113111411151116111711181119112011211122112311241125112611271128112911301131113211331134113511361137113811391140114111421143114411451146114711481149115011511152115311541155115611571158115911601161116211631164116511661167116811691170117111721173117411751176117711781179118011811182118311841185118611871188118911901191119211931194119511961197119811991200120112021203120412051206120712081209121012111212121312141215121612171218121912201221122212231224122512261227122812291230123112321233123412351236123712381239124012411242124312441245124612471248124912501251125212531254125512561257125812591260126112621263126412651266126712681269127012711272127312741275127612771278127912801281128212831284128512861287128812891290129112921293129412951296129712981299130013011302130313041305130613071308130913101311131213131314131513161317131813191320132113221323132413251326132713281329133013311332133313341335133613371338133913401341134213431344134513461347134813491350135113521353135413551356135713581359136013611362136313641365136613671368136913701371137213731374137513761377137813791380138113821383138413851386138713881389139013911392139313941395139613971398139914001401140214031404140514061407140814091410141114121413141414151416141714181419142014211422142314241425142614271428142914301431143214331434143514361437143814391440144114421443144414451446144714481449145014511452145314541455145614571458145914601461146214631464146514661467146814691470147114721473147414751476147714781479148014811482148314841485148614871488148914901491149214931494149514961497149814991500150115021503150415051506150715081509151015111512151315141515151615171518151915201521152215231524152515261527152815291530153115321533153415351536153715381539154015411542154315441545154615471548154915501551155215531554155515561557155815591560156115621563156415651566156715681569157015711572157315741575157615771578157915801581158215831584158515861587158815891590159115921593159415951596159715981599160016011602160316041605160616071608160916101611161216131614161516161617161816191620162116221623
  1. /* -*- mode: c; c-basic-offset: 8; -*-
  2. * vim: noexpandtab sw=8 ts=8 sts=0:
  3. *
  4. * Copyright (C) 2002, 2004 Oracle. All rights reserved.
  5. *
  6. * This program is free software; you can redistribute it and/or
  7. * modify it under the terms of the GNU General Public
  8. * License as published by the Free Software Foundation; either
  9. * version 2 of the License, or (at your option) any later version.
  10. *
  11. * This program is distributed in the hope that it will be useful,
  12. * but WITHOUT ANY WARRANTY; without even the implied warranty of
  13. * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU
  14. * General Public License for more details.
  15. *
  16. * You should have received a copy of the GNU General Public
  17. * License along with this program; if not, write to the
  18. * Free Software Foundation, Inc., 59 Temple Place - Suite 330,
  19. * Boston, MA 021110-1307, USA.
  20. */
  21. #include <linux/fs.h>
  22. #include <linux/slab.h>
  23. #include <linux/highmem.h>
  24. #include <linux/pagemap.h>
  25. #include <asm/byteorder.h>
  26. #include <linux/swap.h>
  27. #include <linux/pipe_fs_i.h>
  28. #define MLOG_MASK_PREFIX ML_FILE_IO
  29. #include <cluster/masklog.h>
  30. #include "ocfs2.h"
  31. #include "alloc.h"
  32. #include "aops.h"
  33. #include "dlmglue.h"
  34. #include "extent_map.h"
  35. #include "file.h"
  36. #include "inode.h"
  37. #include "journal.h"
  38. #include "suballoc.h"
  39. #include "super.h"
  40. #include "symlink.h"
  41. #include "buffer_head_io.h"
  42. static int ocfs2_symlink_get_block(struct inode *inode, sector_t iblock,
  43. struct buffer_head *bh_result, int create)
  44. {
  45. int err = -EIO;
  46. int status;
  47. struct ocfs2_dinode *fe = NULL;
  48. struct buffer_head *bh = NULL;
  49. struct buffer_head *buffer_cache_bh = NULL;
  50. struct ocfs2_super *osb = OCFS2_SB(inode->i_sb);
  51. void *kaddr;
  52. mlog_entry("(0x%p, %llu, 0x%p, %d)\n", inode,
  53. (unsigned long long)iblock, bh_result, create);
  54. BUG_ON(ocfs2_inode_is_fast_symlink(inode));
  55. if ((iblock << inode->i_sb->s_blocksize_bits) > PATH_MAX + 1) {
  56. mlog(ML_ERROR, "block offset > PATH_MAX: %llu",
  57. (unsigned long long)iblock);
  58. goto bail;
  59. }
  60. status = ocfs2_read_block(OCFS2_SB(inode->i_sb),
  61. OCFS2_I(inode)->ip_blkno,
  62. &bh, OCFS2_BH_CACHED, inode);
  63. if (status < 0) {
  64. mlog_errno(status);
  65. goto bail;
  66. }
  67. fe = (struct ocfs2_dinode *) bh->b_data;
  68. if (!OCFS2_IS_VALID_DINODE(fe)) {
  69. mlog(ML_ERROR, "Invalid dinode #%llu: signature = %.*s\n",
  70. (unsigned long long)le64_to_cpu(fe->i_blkno), 7,
  71. fe->i_signature);
  72. goto bail;
  73. }
  74. if ((u64)iblock >= ocfs2_clusters_to_blocks(inode->i_sb,
  75. le32_to_cpu(fe->i_clusters))) {
  76. mlog(ML_ERROR, "block offset is outside the allocated size: "
  77. "%llu\n", (unsigned long long)iblock);
  78. goto bail;
  79. }
  80. /* We don't use the page cache to create symlink data, so if
  81. * need be, copy it over from the buffer cache. */
  82. if (!buffer_uptodate(bh_result) && ocfs2_inode_is_new(inode)) {
  83. u64 blkno = le64_to_cpu(fe->id2.i_list.l_recs[0].e_blkno) +
  84. iblock;
  85. buffer_cache_bh = sb_getblk(osb->sb, blkno);
  86. if (!buffer_cache_bh) {
  87. mlog(ML_ERROR, "couldn't getblock for symlink!\n");
  88. goto bail;
  89. }
  90. /* we haven't locked out transactions, so a commit
  91. * could've happened. Since we've got a reference on
  92. * the bh, even if it commits while we're doing the
  93. * copy, the data is still good. */
  94. if (buffer_jbd(buffer_cache_bh)
  95. && ocfs2_inode_is_new(inode)) {
  96. kaddr = kmap_atomic(bh_result->b_page, KM_USER0);
  97. if (!kaddr) {
  98. mlog(ML_ERROR, "couldn't kmap!\n");
  99. goto bail;
  100. }
  101. memcpy(kaddr + (bh_result->b_size * iblock),
  102. buffer_cache_bh->b_data,
  103. bh_result->b_size);
  104. kunmap_atomic(kaddr, KM_USER0);
  105. set_buffer_uptodate(bh_result);
  106. }
  107. brelse(buffer_cache_bh);
  108. }
  109. map_bh(bh_result, inode->i_sb,
  110. le64_to_cpu(fe->id2.i_list.l_recs[0].e_blkno) + iblock);
  111. err = 0;
  112. bail:
  113. if (bh)
  114. brelse(bh);
  115. mlog_exit(err);
  116. return err;
  117. }
  118. static int ocfs2_get_block(struct inode *inode, sector_t iblock,
  119. struct buffer_head *bh_result, int create)
  120. {
  121. int err = 0;
  122. unsigned int ext_flags;
  123. u64 p_blkno, past_eof;
  124. struct ocfs2_super *osb = OCFS2_SB(inode->i_sb);
  125. mlog_entry("(0x%p, %llu, 0x%p, %d)\n", inode,
  126. (unsigned long long)iblock, bh_result, create);
  127. if (OCFS2_I(inode)->ip_flags & OCFS2_INODE_SYSTEM_FILE)
  128. mlog(ML_NOTICE, "get_block on system inode 0x%p (%lu)\n",
  129. inode, inode->i_ino);
  130. if (S_ISLNK(inode->i_mode)) {
  131. /* this always does I/O for some reason. */
  132. err = ocfs2_symlink_get_block(inode, iblock, bh_result, create);
  133. goto bail;
  134. }
  135. err = ocfs2_extent_map_get_blocks(inode, iblock, &p_blkno, NULL,
  136. &ext_flags);
  137. if (err) {
  138. mlog(ML_ERROR, "Error %d from get_blocks(0x%p, %llu, 1, "
  139. "%llu, NULL)\n", err, inode, (unsigned long long)iblock,
  140. (unsigned long long)p_blkno);
  141. goto bail;
  142. }
  143. /*
  144. * ocfs2 never allocates in this function - the only time we
  145. * need to use BH_New is when we're extending i_size on a file
  146. * system which doesn't support holes, in which case BH_New
  147. * allows block_prepare_write() to zero.
  148. */
  149. mlog_bug_on_msg(create && p_blkno == 0 && ocfs2_sparse_alloc(osb),
  150. "ino %lu, iblock %llu\n", inode->i_ino,
  151. (unsigned long long)iblock);
  152. /* Treat the unwritten extent as a hole for zeroing purposes. */
  153. if (p_blkno && !(ext_flags & OCFS2_EXT_UNWRITTEN))
  154. map_bh(bh_result, inode->i_sb, p_blkno);
  155. if (!ocfs2_sparse_alloc(osb)) {
  156. if (p_blkno == 0) {
  157. err = -EIO;
  158. mlog(ML_ERROR,
  159. "iblock = %llu p_blkno = %llu blkno=(%llu)\n",
  160. (unsigned long long)iblock,
  161. (unsigned long long)p_blkno,
  162. (unsigned long long)OCFS2_I(inode)->ip_blkno);
  163. mlog(ML_ERROR, "Size %llu, clusters %u\n", (unsigned long long)i_size_read(inode), OCFS2_I(inode)->ip_clusters);
  164. dump_stack();
  165. }
  166. past_eof = ocfs2_blocks_for_bytes(inode->i_sb, i_size_read(inode));
  167. mlog(0, "Inode %lu, past_eof = %llu\n", inode->i_ino,
  168. (unsigned long long)past_eof);
  169. if (create && (iblock >= past_eof))
  170. set_buffer_new(bh_result);
  171. }
  172. bail:
  173. if (err < 0)
  174. err = -EIO;
  175. mlog_exit(err);
  176. return err;
  177. }
  178. static int ocfs2_readpage(struct file *file, struct page *page)
  179. {
  180. struct inode *inode = page->mapping->host;
  181. loff_t start = (loff_t)page->index << PAGE_CACHE_SHIFT;
  182. int ret, unlock = 1;
  183. mlog_entry("(0x%p, %lu)\n", file, (page ? page->index : 0));
  184. ret = ocfs2_meta_lock_with_page(inode, NULL, 0, page);
  185. if (ret != 0) {
  186. if (ret == AOP_TRUNCATED_PAGE)
  187. unlock = 0;
  188. mlog_errno(ret);
  189. goto out;
  190. }
  191. if (down_read_trylock(&OCFS2_I(inode)->ip_alloc_sem) == 0) {
  192. ret = AOP_TRUNCATED_PAGE;
  193. goto out_meta_unlock;
  194. }
  195. /*
  196. * i_size might have just been updated as we grabed the meta lock. We
  197. * might now be discovering a truncate that hit on another node.
  198. * block_read_full_page->get_block freaks out if it is asked to read
  199. * beyond the end of a file, so we check here. Callers
  200. * (generic_file_read, vm_ops->fault) are clever enough to check i_size
  201. * and notice that the page they just read isn't needed.
  202. *
  203. * XXX sys_readahead() seems to get that wrong?
  204. */
  205. if (start >= i_size_read(inode)) {
  206. zero_user_page(page, 0, PAGE_SIZE, KM_USER0);
  207. SetPageUptodate(page);
  208. ret = 0;
  209. goto out_alloc;
  210. }
  211. ret = ocfs2_data_lock_with_page(inode, 0, page);
  212. if (ret != 0) {
  213. if (ret == AOP_TRUNCATED_PAGE)
  214. unlock = 0;
  215. mlog_errno(ret);
  216. goto out_alloc;
  217. }
  218. ret = block_read_full_page(page, ocfs2_get_block);
  219. unlock = 0;
  220. ocfs2_data_unlock(inode, 0);
  221. out_alloc:
  222. up_read(&OCFS2_I(inode)->ip_alloc_sem);
  223. out_meta_unlock:
  224. ocfs2_meta_unlock(inode, 0);
  225. out:
  226. if (unlock)
  227. unlock_page(page);
  228. mlog_exit(ret);
  229. return ret;
  230. }
  231. /* Note: Because we don't support holes, our allocation has
  232. * already happened (allocation writes zeros to the file data)
  233. * so we don't have to worry about ordered writes in
  234. * ocfs2_writepage.
  235. *
  236. * ->writepage is called during the process of invalidating the page cache
  237. * during blocked lock processing. It can't block on any cluster locks
  238. * to during block mapping. It's relying on the fact that the block
  239. * mapping can't have disappeared under the dirty pages that it is
  240. * being asked to write back.
  241. */
  242. static int ocfs2_writepage(struct page *page, struct writeback_control *wbc)
  243. {
  244. int ret;
  245. mlog_entry("(0x%p)\n", page);
  246. ret = block_write_full_page(page, ocfs2_get_block, wbc);
  247. mlog_exit(ret);
  248. return ret;
  249. }
  250. /*
  251. * This is called from ocfs2_write_zero_page() which has handled it's
  252. * own cluster locking and has ensured allocation exists for those
  253. * blocks to be written.
  254. */
  255. int ocfs2_prepare_write_nolock(struct inode *inode, struct page *page,
  256. unsigned from, unsigned to)
  257. {
  258. int ret;
  259. down_read(&OCFS2_I(inode)->ip_alloc_sem);
  260. ret = block_prepare_write(page, from, to, ocfs2_get_block);
  261. up_read(&OCFS2_I(inode)->ip_alloc_sem);
  262. return ret;
  263. }
  264. /* Taken from ext3. We don't necessarily need the full blown
  265. * functionality yet, but IMHO it's better to cut and paste the whole
  266. * thing so we can avoid introducing our own bugs (and easily pick up
  267. * their fixes when they happen) --Mark */
  268. int walk_page_buffers( handle_t *handle,
  269. struct buffer_head *head,
  270. unsigned from,
  271. unsigned to,
  272. int *partial,
  273. int (*fn)( handle_t *handle,
  274. struct buffer_head *bh))
  275. {
  276. struct buffer_head *bh;
  277. unsigned block_start, block_end;
  278. unsigned blocksize = head->b_size;
  279. int err, ret = 0;
  280. struct buffer_head *next;
  281. for ( bh = head, block_start = 0;
  282. ret == 0 && (bh != head || !block_start);
  283. block_start = block_end, bh = next)
  284. {
  285. next = bh->b_this_page;
  286. block_end = block_start + blocksize;
  287. if (block_end <= from || block_start >= to) {
  288. if (partial && !buffer_uptodate(bh))
  289. *partial = 1;
  290. continue;
  291. }
  292. err = (*fn)(handle, bh);
  293. if (!ret)
  294. ret = err;
  295. }
  296. return ret;
  297. }
  298. handle_t *ocfs2_start_walk_page_trans(struct inode *inode,
  299. struct page *page,
  300. unsigned from,
  301. unsigned to)
  302. {
  303. struct ocfs2_super *osb = OCFS2_SB(inode->i_sb);
  304. handle_t *handle = NULL;
  305. int ret = 0;
  306. handle = ocfs2_start_trans(osb, OCFS2_INODE_UPDATE_CREDITS);
  307. if (!handle) {
  308. ret = -ENOMEM;
  309. mlog_errno(ret);
  310. goto out;
  311. }
  312. if (ocfs2_should_order_data(inode)) {
  313. ret = walk_page_buffers(handle,
  314. page_buffers(page),
  315. from, to, NULL,
  316. ocfs2_journal_dirty_data);
  317. if (ret < 0)
  318. mlog_errno(ret);
  319. }
  320. out:
  321. if (ret) {
  322. if (handle)
  323. ocfs2_commit_trans(osb, handle);
  324. handle = ERR_PTR(ret);
  325. }
  326. return handle;
  327. }
  328. static sector_t ocfs2_bmap(struct address_space *mapping, sector_t block)
  329. {
  330. sector_t status;
  331. u64 p_blkno = 0;
  332. int err = 0;
  333. struct inode *inode = mapping->host;
  334. mlog_entry("(block = %llu)\n", (unsigned long long)block);
  335. /* We don't need to lock journal system files, since they aren't
  336. * accessed concurrently from multiple nodes.
  337. */
  338. if (!INODE_JOURNAL(inode)) {
  339. err = ocfs2_meta_lock(inode, NULL, 0);
  340. if (err) {
  341. if (err != -ENOENT)
  342. mlog_errno(err);
  343. goto bail;
  344. }
  345. down_read(&OCFS2_I(inode)->ip_alloc_sem);
  346. }
  347. err = ocfs2_extent_map_get_blocks(inode, block, &p_blkno, NULL, NULL);
  348. if (!INODE_JOURNAL(inode)) {
  349. up_read(&OCFS2_I(inode)->ip_alloc_sem);
  350. ocfs2_meta_unlock(inode, 0);
  351. }
  352. if (err) {
  353. mlog(ML_ERROR, "get_blocks() failed, block = %llu\n",
  354. (unsigned long long)block);
  355. mlog_errno(err);
  356. goto bail;
  357. }
  358. bail:
  359. status = err ? 0 : p_blkno;
  360. mlog_exit((int)status);
  361. return status;
  362. }
  363. /*
  364. * TODO: Make this into a generic get_blocks function.
  365. *
  366. * From do_direct_io in direct-io.c:
  367. * "So what we do is to permit the ->get_blocks function to populate
  368. * bh.b_size with the size of IO which is permitted at this offset and
  369. * this i_blkbits."
  370. *
  371. * This function is called directly from get_more_blocks in direct-io.c.
  372. *
  373. * called like this: dio->get_blocks(dio->inode, fs_startblk,
  374. * fs_count, map_bh, dio->rw == WRITE);
  375. */
  376. static int ocfs2_direct_IO_get_blocks(struct inode *inode, sector_t iblock,
  377. struct buffer_head *bh_result, int create)
  378. {
  379. int ret;
  380. u64 p_blkno, inode_blocks, contig_blocks;
  381. unsigned int ext_flags;
  382. unsigned char blocksize_bits = inode->i_sb->s_blocksize_bits;
  383. unsigned long max_blocks = bh_result->b_size >> inode->i_blkbits;
  384. /* This function won't even be called if the request isn't all
  385. * nicely aligned and of the right size, so there's no need
  386. * for us to check any of that. */
  387. inode_blocks = ocfs2_blocks_for_bytes(inode->i_sb, i_size_read(inode));
  388. /*
  389. * Any write past EOF is not allowed because we'd be extending.
  390. */
  391. if (create && (iblock + max_blocks) > inode_blocks) {
  392. ret = -EIO;
  393. goto bail;
  394. }
  395. /* This figures out the size of the next contiguous block, and
  396. * our logical offset */
  397. ret = ocfs2_extent_map_get_blocks(inode, iblock, &p_blkno,
  398. &contig_blocks, &ext_flags);
  399. if (ret) {
  400. mlog(ML_ERROR, "get_blocks() failed iblock=%llu\n",
  401. (unsigned long long)iblock);
  402. ret = -EIO;
  403. goto bail;
  404. }
  405. if (!ocfs2_sparse_alloc(OCFS2_SB(inode->i_sb)) && !p_blkno) {
  406. ocfs2_error(inode->i_sb,
  407. "Inode %llu has a hole at block %llu\n",
  408. (unsigned long long)OCFS2_I(inode)->ip_blkno,
  409. (unsigned long long)iblock);
  410. ret = -EROFS;
  411. goto bail;
  412. }
  413. /*
  414. * get_more_blocks() expects us to describe a hole by clearing
  415. * the mapped bit on bh_result().
  416. *
  417. * Consider an unwritten extent as a hole.
  418. */
  419. if (p_blkno && !(ext_flags & OCFS2_EXT_UNWRITTEN))
  420. map_bh(bh_result, inode->i_sb, p_blkno);
  421. else {
  422. /*
  423. * ocfs2_prepare_inode_for_write() should have caught
  424. * the case where we'd be filling a hole and triggered
  425. * a buffered write instead.
  426. */
  427. if (create) {
  428. ret = -EIO;
  429. mlog_errno(ret);
  430. goto bail;
  431. }
  432. clear_buffer_mapped(bh_result);
  433. }
  434. /* make sure we don't map more than max_blocks blocks here as
  435. that's all the kernel will handle at this point. */
  436. if (max_blocks < contig_blocks)
  437. contig_blocks = max_blocks;
  438. bh_result->b_size = contig_blocks << blocksize_bits;
  439. bail:
  440. return ret;
  441. }
  442. /*
  443. * ocfs2_dio_end_io is called by the dio core when a dio is finished. We're
  444. * particularly interested in the aio/dio case. Like the core uses
  445. * i_alloc_sem, we use the rw_lock DLM lock to protect io on one node from
  446. * truncation on another.
  447. */
  448. static void ocfs2_dio_end_io(struct kiocb *iocb,
  449. loff_t offset,
  450. ssize_t bytes,
  451. void *private)
  452. {
  453. struct inode *inode = iocb->ki_filp->f_path.dentry->d_inode;
  454. int level;
  455. /* this io's submitter should not have unlocked this before we could */
  456. BUG_ON(!ocfs2_iocb_is_rw_locked(iocb));
  457. ocfs2_iocb_clear_rw_locked(iocb);
  458. level = ocfs2_iocb_rw_locked_level(iocb);
  459. if (!level)
  460. up_read(&inode->i_alloc_sem);
  461. ocfs2_rw_unlock(inode, level);
  462. }
  463. /*
  464. * ocfs2_invalidatepage() and ocfs2_releasepage() are shamelessly stolen
  465. * from ext3. PageChecked() bits have been removed as OCFS2 does not
  466. * do journalled data.
  467. */
  468. static void ocfs2_invalidatepage(struct page *page, unsigned long offset)
  469. {
  470. journal_t *journal = OCFS2_SB(page->mapping->host->i_sb)->journal->j_journal;
  471. journal_invalidatepage(journal, page, offset);
  472. }
  473. static int ocfs2_releasepage(struct page *page, gfp_t wait)
  474. {
  475. journal_t *journal = OCFS2_SB(page->mapping->host->i_sb)->journal->j_journal;
  476. if (!page_has_buffers(page))
  477. return 0;
  478. return journal_try_to_free_buffers(journal, page, wait);
  479. }
  480. static ssize_t ocfs2_direct_IO(int rw,
  481. struct kiocb *iocb,
  482. const struct iovec *iov,
  483. loff_t offset,
  484. unsigned long nr_segs)
  485. {
  486. struct file *file = iocb->ki_filp;
  487. struct inode *inode = file->f_path.dentry->d_inode->i_mapping->host;
  488. int ret;
  489. mlog_entry_void();
  490. if (!ocfs2_sparse_alloc(OCFS2_SB(inode->i_sb))) {
  491. /*
  492. * We get PR data locks even for O_DIRECT. This
  493. * allows concurrent O_DIRECT I/O but doesn't let
  494. * O_DIRECT with extending and buffered zeroing writes
  495. * race. If they did race then the buffered zeroing
  496. * could be written back after the O_DIRECT I/O. It's
  497. * one thing to tell people not to mix buffered and
  498. * O_DIRECT writes, but expecting them to understand
  499. * that file extension is also an implicit buffered
  500. * write is too much. By getting the PR we force
  501. * writeback of the buffered zeroing before
  502. * proceeding.
  503. */
  504. ret = ocfs2_data_lock(inode, 0);
  505. if (ret < 0) {
  506. mlog_errno(ret);
  507. goto out;
  508. }
  509. ocfs2_data_unlock(inode, 0);
  510. }
  511. ret = blockdev_direct_IO_no_locking(rw, iocb, inode,
  512. inode->i_sb->s_bdev, iov, offset,
  513. nr_segs,
  514. ocfs2_direct_IO_get_blocks,
  515. ocfs2_dio_end_io);
  516. out:
  517. mlog_exit(ret);
  518. return ret;
  519. }
  520. static void ocfs2_figure_cluster_boundaries(struct ocfs2_super *osb,
  521. u32 cpos,
  522. unsigned int *start,
  523. unsigned int *end)
  524. {
  525. unsigned int cluster_start = 0, cluster_end = PAGE_CACHE_SIZE;
  526. if (unlikely(PAGE_CACHE_SHIFT > osb->s_clustersize_bits)) {
  527. unsigned int cpp;
  528. cpp = 1 << (PAGE_CACHE_SHIFT - osb->s_clustersize_bits);
  529. cluster_start = cpos % cpp;
  530. cluster_start = cluster_start << osb->s_clustersize_bits;
  531. cluster_end = cluster_start + osb->s_clustersize;
  532. }
  533. BUG_ON(cluster_start > PAGE_SIZE);
  534. BUG_ON(cluster_end > PAGE_SIZE);
  535. if (start)
  536. *start = cluster_start;
  537. if (end)
  538. *end = cluster_end;
  539. }
  540. /*
  541. * 'from' and 'to' are the region in the page to avoid zeroing.
  542. *
  543. * If pagesize > clustersize, this function will avoid zeroing outside
  544. * of the cluster boundary.
  545. *
  546. * from == to == 0 is code for "zero the entire cluster region"
  547. */
  548. static void ocfs2_clear_page_regions(struct page *page,
  549. struct ocfs2_super *osb, u32 cpos,
  550. unsigned from, unsigned to)
  551. {
  552. void *kaddr;
  553. unsigned int cluster_start, cluster_end;
  554. ocfs2_figure_cluster_boundaries(osb, cpos, &cluster_start, &cluster_end);
  555. kaddr = kmap_atomic(page, KM_USER0);
  556. if (from || to) {
  557. if (from > cluster_start)
  558. memset(kaddr + cluster_start, 0, from - cluster_start);
  559. if (to < cluster_end)
  560. memset(kaddr + to, 0, cluster_end - to);
  561. } else {
  562. memset(kaddr + cluster_start, 0, cluster_end - cluster_start);
  563. }
  564. kunmap_atomic(kaddr, KM_USER0);
  565. }
  566. /*
  567. * Some of this taken from block_prepare_write(). We already have our
  568. * mapping by now though, and the entire write will be allocating or
  569. * it won't, so not much need to use BH_New.
  570. *
  571. * This will also skip zeroing, which is handled externally.
  572. */
  573. int ocfs2_map_page_blocks(struct page *page, u64 *p_blkno,
  574. struct inode *inode, unsigned int from,
  575. unsigned int to, int new)
  576. {
  577. int ret = 0;
  578. struct buffer_head *head, *bh, *wait[2], **wait_bh = wait;
  579. unsigned int block_end, block_start;
  580. unsigned int bsize = 1 << inode->i_blkbits;
  581. if (!page_has_buffers(page))
  582. create_empty_buffers(page, bsize, 0);
  583. head = page_buffers(page);
  584. for (bh = head, block_start = 0; bh != head || !block_start;
  585. bh = bh->b_this_page, block_start += bsize) {
  586. block_end = block_start + bsize;
  587. clear_buffer_new(bh);
  588. /*
  589. * Ignore blocks outside of our i/o range -
  590. * they may belong to unallocated clusters.
  591. */
  592. if (block_start >= to || block_end <= from) {
  593. if (PageUptodate(page))
  594. set_buffer_uptodate(bh);
  595. continue;
  596. }
  597. /*
  598. * For an allocating write with cluster size >= page
  599. * size, we always write the entire page.
  600. */
  601. if (new)
  602. set_buffer_new(bh);
  603. if (!buffer_mapped(bh)) {
  604. map_bh(bh, inode->i_sb, *p_blkno);
  605. unmap_underlying_metadata(bh->b_bdev, bh->b_blocknr);
  606. }
  607. if (PageUptodate(page)) {
  608. if (!buffer_uptodate(bh))
  609. set_buffer_uptodate(bh);
  610. } else if (!buffer_uptodate(bh) && !buffer_delay(bh) &&
  611. !buffer_new(bh) &&
  612. (block_start < from || block_end > to)) {
  613. ll_rw_block(READ, 1, &bh);
  614. *wait_bh++=bh;
  615. }
  616. *p_blkno = *p_blkno + 1;
  617. }
  618. /*
  619. * If we issued read requests - let them complete.
  620. */
  621. while(wait_bh > wait) {
  622. wait_on_buffer(*--wait_bh);
  623. if (!buffer_uptodate(*wait_bh))
  624. ret = -EIO;
  625. }
  626. if (ret == 0 || !new)
  627. return ret;
  628. /*
  629. * If we get -EIO above, zero out any newly allocated blocks
  630. * to avoid exposing stale data.
  631. */
  632. bh = head;
  633. block_start = 0;
  634. do {
  635. block_end = block_start + bsize;
  636. if (block_end <= from)
  637. goto next_bh;
  638. if (block_start >= to)
  639. break;
  640. zero_user_page(page, block_start, bh->b_size, KM_USER0);
  641. set_buffer_uptodate(bh);
  642. mark_buffer_dirty(bh);
  643. next_bh:
  644. block_start = block_end;
  645. bh = bh->b_this_page;
  646. } while (bh != head);
  647. return ret;
  648. }
  649. #if (PAGE_CACHE_SIZE >= OCFS2_MAX_CLUSTERSIZE)
  650. #define OCFS2_MAX_CTXT_PAGES 1
  651. #else
  652. #define OCFS2_MAX_CTXT_PAGES (OCFS2_MAX_CLUSTERSIZE / PAGE_CACHE_SIZE)
  653. #endif
  654. #define OCFS2_MAX_CLUSTERS_PER_PAGE (PAGE_CACHE_SIZE / OCFS2_MIN_CLUSTERSIZE)
  655. /*
  656. * Describe the state of a single cluster to be written to.
  657. */
  658. struct ocfs2_write_cluster_desc {
  659. u32 c_cpos;
  660. u32 c_phys;
  661. /*
  662. * Give this a unique field because c_phys eventually gets
  663. * filled.
  664. */
  665. unsigned c_new;
  666. unsigned c_unwritten;
  667. };
  668. static inline int ocfs2_should_zero_cluster(struct ocfs2_write_cluster_desc *d)
  669. {
  670. return d->c_new || d->c_unwritten;
  671. }
  672. struct ocfs2_write_ctxt {
  673. /* Logical cluster position / len of write */
  674. u32 w_cpos;
  675. u32 w_clen;
  676. struct ocfs2_write_cluster_desc w_desc[OCFS2_MAX_CLUSTERS_PER_PAGE];
  677. /*
  678. * This is true if page_size > cluster_size.
  679. *
  680. * It triggers a set of special cases during write which might
  681. * have to deal with allocating writes to partial pages.
  682. */
  683. unsigned int w_large_pages;
  684. /*
  685. * Pages involved in this write.
  686. *
  687. * w_target_page is the page being written to by the user.
  688. *
  689. * w_pages is an array of pages which always contains
  690. * w_target_page, and in the case of an allocating write with
  691. * page_size < cluster size, it will contain zero'd and mapped
  692. * pages adjacent to w_target_page which need to be written
  693. * out in so that future reads from that region will get
  694. * zero's.
  695. */
  696. struct page *w_pages[OCFS2_MAX_CTXT_PAGES];
  697. unsigned int w_num_pages;
  698. struct page *w_target_page;
  699. /*
  700. * ocfs2_write_end() uses this to know what the real range to
  701. * write in the target should be.
  702. */
  703. unsigned int w_target_from;
  704. unsigned int w_target_to;
  705. /*
  706. * We could use journal_current_handle() but this is cleaner,
  707. * IMHO -Mark
  708. */
  709. handle_t *w_handle;
  710. struct buffer_head *w_di_bh;
  711. struct ocfs2_cached_dealloc_ctxt w_dealloc;
  712. };
  713. static void ocfs2_free_write_ctxt(struct ocfs2_write_ctxt *wc)
  714. {
  715. int i;
  716. for(i = 0; i < wc->w_num_pages; i++) {
  717. if (wc->w_pages[i] == NULL)
  718. continue;
  719. unlock_page(wc->w_pages[i]);
  720. mark_page_accessed(wc->w_pages[i]);
  721. page_cache_release(wc->w_pages[i]);
  722. }
  723. brelse(wc->w_di_bh);
  724. kfree(wc);
  725. }
  726. static int ocfs2_alloc_write_ctxt(struct ocfs2_write_ctxt **wcp,
  727. struct ocfs2_super *osb, loff_t pos,
  728. unsigned len, struct buffer_head *di_bh)
  729. {
  730. u32 cend;
  731. struct ocfs2_write_ctxt *wc;
  732. wc = kzalloc(sizeof(struct ocfs2_write_ctxt), GFP_NOFS);
  733. if (!wc)
  734. return -ENOMEM;
  735. wc->w_cpos = pos >> osb->s_clustersize_bits;
  736. cend = (pos + len - 1) >> osb->s_clustersize_bits;
  737. wc->w_clen = cend - wc->w_cpos + 1;
  738. get_bh(di_bh);
  739. wc->w_di_bh = di_bh;
  740. if (unlikely(PAGE_CACHE_SHIFT > osb->s_clustersize_bits))
  741. wc->w_large_pages = 1;
  742. else
  743. wc->w_large_pages = 0;
  744. ocfs2_init_dealloc_ctxt(&wc->w_dealloc);
  745. *wcp = wc;
  746. return 0;
  747. }
  748. /*
  749. * If a page has any new buffers, zero them out here, and mark them uptodate
  750. * and dirty so they'll be written out (in order to prevent uninitialised
  751. * block data from leaking). And clear the new bit.
  752. */
  753. static void ocfs2_zero_new_buffers(struct page *page, unsigned from, unsigned to)
  754. {
  755. unsigned int block_start, block_end;
  756. struct buffer_head *head, *bh;
  757. BUG_ON(!PageLocked(page));
  758. if (!page_has_buffers(page))
  759. return;
  760. bh = head = page_buffers(page);
  761. block_start = 0;
  762. do {
  763. block_end = block_start + bh->b_size;
  764. if (buffer_new(bh)) {
  765. if (block_end > from && block_start < to) {
  766. if (!PageUptodate(page)) {
  767. unsigned start, end;
  768. start = max(from, block_start);
  769. end = min(to, block_end);
  770. zero_user_page(page, start, end - start, KM_USER0);
  771. set_buffer_uptodate(bh);
  772. }
  773. clear_buffer_new(bh);
  774. mark_buffer_dirty(bh);
  775. }
  776. }
  777. block_start = block_end;
  778. bh = bh->b_this_page;
  779. } while (bh != head);
  780. }
  781. /*
  782. * Only called when we have a failure during allocating write to write
  783. * zero's to the newly allocated region.
  784. */
  785. static void ocfs2_write_failure(struct inode *inode,
  786. struct ocfs2_write_ctxt *wc,
  787. loff_t user_pos, unsigned user_len)
  788. {
  789. int i;
  790. unsigned from, to;
  791. struct page *tmppage;
  792. ocfs2_zero_new_buffers(wc->w_target_page, user_pos, user_len);
  793. if (wc->w_large_pages) {
  794. from = wc->w_target_from;
  795. to = wc->w_target_to;
  796. } else {
  797. from = 0;
  798. to = PAGE_CACHE_SIZE;
  799. }
  800. for(i = 0; i < wc->w_num_pages; i++) {
  801. tmppage = wc->w_pages[i];
  802. if (ocfs2_should_order_data(inode))
  803. walk_page_buffers(wc->w_handle, page_buffers(tmppage),
  804. from, to, NULL,
  805. ocfs2_journal_dirty_data);
  806. block_commit_write(tmppage, from, to);
  807. }
  808. }
  809. static int ocfs2_prepare_page_for_write(struct inode *inode, u64 *p_blkno,
  810. struct ocfs2_write_ctxt *wc,
  811. struct page *page, u32 cpos,
  812. loff_t user_pos, unsigned user_len,
  813. int new)
  814. {
  815. int ret;
  816. unsigned int map_from = 0, map_to = 0;
  817. unsigned int cluster_start, cluster_end;
  818. unsigned int user_data_from = 0, user_data_to = 0;
  819. ocfs2_figure_cluster_boundaries(OCFS2_SB(inode->i_sb), cpos,
  820. &cluster_start, &cluster_end);
  821. if (page == wc->w_target_page) {
  822. map_from = user_pos & (PAGE_CACHE_SIZE - 1);
  823. map_to = map_from + user_len;
  824. if (new)
  825. ret = ocfs2_map_page_blocks(page, p_blkno, inode,
  826. cluster_start, cluster_end,
  827. new);
  828. else
  829. ret = ocfs2_map_page_blocks(page, p_blkno, inode,
  830. map_from, map_to, new);
  831. if (ret) {
  832. mlog_errno(ret);
  833. goto out;
  834. }
  835. user_data_from = map_from;
  836. user_data_to = map_to;
  837. if (new) {
  838. map_from = cluster_start;
  839. map_to = cluster_end;
  840. }
  841. wc->w_target_from = map_from;
  842. wc->w_target_to = map_to;
  843. } else {
  844. /*
  845. * If we haven't allocated the new page yet, we
  846. * shouldn't be writing it out without copying user
  847. * data. This is likely a math error from the caller.
  848. */
  849. BUG_ON(!new);
  850. map_from = cluster_start;
  851. map_to = cluster_end;
  852. ret = ocfs2_map_page_blocks(page, p_blkno, inode,
  853. cluster_start, cluster_end, new);
  854. if (ret) {
  855. mlog_errno(ret);
  856. goto out;
  857. }
  858. }
  859. /*
  860. * Parts of newly allocated pages need to be zero'd.
  861. *
  862. * Above, we have also rewritten 'to' and 'from' - as far as
  863. * the rest of the function is concerned, the entire cluster
  864. * range inside of a page needs to be written.
  865. *
  866. * We can skip this if the page is up to date - it's already
  867. * been zero'd from being read in as a hole.
  868. */
  869. if (new && !PageUptodate(page))
  870. ocfs2_clear_page_regions(page, OCFS2_SB(inode->i_sb),
  871. cpos, user_data_from, user_data_to);
  872. flush_dcache_page(page);
  873. out:
  874. return ret;
  875. }
  876. /*
  877. * This function will only grab one clusters worth of pages.
  878. */
  879. static int ocfs2_grab_pages_for_write(struct address_space *mapping,
  880. struct ocfs2_write_ctxt *wc,
  881. u32 cpos, loff_t user_pos, int new,
  882. struct page *mmap_page)
  883. {
  884. int ret = 0, i;
  885. unsigned long start, target_index, index;
  886. struct inode *inode = mapping->host;
  887. target_index = user_pos >> PAGE_CACHE_SHIFT;
  888. /*
  889. * Figure out how many pages we'll be manipulating here. For
  890. * non allocating write, we just change the one
  891. * page. Otherwise, we'll need a whole clusters worth.
  892. */
  893. if (new) {
  894. wc->w_num_pages = ocfs2_pages_per_cluster(inode->i_sb);
  895. start = ocfs2_align_clusters_to_page_index(inode->i_sb, cpos);
  896. } else {
  897. wc->w_num_pages = 1;
  898. start = target_index;
  899. }
  900. for(i = 0; i < wc->w_num_pages; i++) {
  901. index = start + i;
  902. if (index == target_index && mmap_page) {
  903. /*
  904. * ocfs2_pagemkwrite() is a little different
  905. * and wants us to directly use the page
  906. * passed in.
  907. */
  908. lock_page(mmap_page);
  909. if (mmap_page->mapping != mapping) {
  910. unlock_page(mmap_page);
  911. /*
  912. * Sanity check - the locking in
  913. * ocfs2_pagemkwrite() should ensure
  914. * that this code doesn't trigger.
  915. */
  916. ret = -EINVAL;
  917. mlog_errno(ret);
  918. goto out;
  919. }
  920. page_cache_get(mmap_page);
  921. wc->w_pages[i] = mmap_page;
  922. } else {
  923. wc->w_pages[i] = find_or_create_page(mapping, index,
  924. GFP_NOFS);
  925. if (!wc->w_pages[i]) {
  926. ret = -ENOMEM;
  927. mlog_errno(ret);
  928. goto out;
  929. }
  930. }
  931. if (index == target_index)
  932. wc->w_target_page = wc->w_pages[i];
  933. }
  934. out:
  935. return ret;
  936. }
  937. /*
  938. * Prepare a single cluster for write one cluster into the file.
  939. */
  940. static int ocfs2_write_cluster(struct address_space *mapping,
  941. u32 phys, unsigned int unwritten,
  942. struct ocfs2_alloc_context *data_ac,
  943. struct ocfs2_alloc_context *meta_ac,
  944. struct ocfs2_write_ctxt *wc, u32 cpos,
  945. loff_t user_pos, unsigned user_len)
  946. {
  947. int ret, i, new, should_zero = 0;
  948. u64 v_blkno, p_blkno;
  949. struct inode *inode = mapping->host;
  950. new = phys == 0 ? 1 : 0;
  951. if (new || unwritten)
  952. should_zero = 1;
  953. if (new) {
  954. u32 tmp_pos;
  955. /*
  956. * This is safe to call with the page locks - it won't take
  957. * any additional semaphores or cluster locks.
  958. */
  959. tmp_pos = cpos;
  960. ret = ocfs2_do_extend_allocation(OCFS2_SB(inode->i_sb), inode,
  961. &tmp_pos, 1, 0, wc->w_di_bh,
  962. wc->w_handle, data_ac,
  963. meta_ac, NULL);
  964. /*
  965. * This shouldn't happen because we must have already
  966. * calculated the correct meta data allocation required. The
  967. * internal tree allocation code should know how to increase
  968. * transaction credits itself.
  969. *
  970. * If need be, we could handle -EAGAIN for a
  971. * RESTART_TRANS here.
  972. */
  973. mlog_bug_on_msg(ret == -EAGAIN,
  974. "Inode %llu: EAGAIN return during allocation.\n",
  975. (unsigned long long)OCFS2_I(inode)->ip_blkno);
  976. if (ret < 0) {
  977. mlog_errno(ret);
  978. goto out;
  979. }
  980. } else if (unwritten) {
  981. ret = ocfs2_mark_extent_written(inode, wc->w_di_bh,
  982. wc->w_handle, cpos, 1, phys,
  983. meta_ac, &wc->w_dealloc);
  984. if (ret < 0) {
  985. mlog_errno(ret);
  986. goto out;
  987. }
  988. }
  989. if (should_zero)
  990. v_blkno = ocfs2_clusters_to_blocks(inode->i_sb, cpos);
  991. else
  992. v_blkno = user_pos >> inode->i_sb->s_blocksize_bits;
  993. /*
  994. * The only reason this should fail is due to an inability to
  995. * find the extent added.
  996. */
  997. ret = ocfs2_extent_map_get_blocks(inode, v_blkno, &p_blkno, NULL,
  998. NULL);
  999. if (ret < 0) {
  1000. ocfs2_error(inode->i_sb, "Corrupting extend for inode %llu, "
  1001. "at logical block %llu",
  1002. (unsigned long long)OCFS2_I(inode)->ip_blkno,
  1003. (unsigned long long)v_blkno);
  1004. goto out;
  1005. }
  1006. BUG_ON(p_blkno == 0);
  1007. for(i = 0; i < wc->w_num_pages; i++) {
  1008. int tmpret;
  1009. tmpret = ocfs2_prepare_page_for_write(inode, &p_blkno, wc,
  1010. wc->w_pages[i], cpos,
  1011. user_pos, user_len,
  1012. should_zero);
  1013. if (tmpret) {
  1014. mlog_errno(tmpret);
  1015. if (ret == 0)
  1016. tmpret = ret;
  1017. }
  1018. }
  1019. /*
  1020. * We only have cleanup to do in case of allocating write.
  1021. */
  1022. if (ret && new)
  1023. ocfs2_write_failure(inode, wc, user_pos, user_len);
  1024. out:
  1025. return ret;
  1026. }
  1027. static int ocfs2_write_cluster_by_desc(struct address_space *mapping,
  1028. struct ocfs2_alloc_context *data_ac,
  1029. struct ocfs2_alloc_context *meta_ac,
  1030. struct ocfs2_write_ctxt *wc,
  1031. loff_t pos, unsigned len)
  1032. {
  1033. int ret, i;
  1034. struct ocfs2_write_cluster_desc *desc;
  1035. for (i = 0; i < wc->w_clen; i++) {
  1036. desc = &wc->w_desc[i];
  1037. ret = ocfs2_write_cluster(mapping, desc->c_phys,
  1038. desc->c_unwritten, data_ac, meta_ac,
  1039. wc, desc->c_cpos, pos, len);
  1040. if (ret) {
  1041. mlog_errno(ret);
  1042. goto out;
  1043. }
  1044. }
  1045. ret = 0;
  1046. out:
  1047. return ret;
  1048. }
  1049. /*
  1050. * ocfs2_write_end() wants to know which parts of the target page it
  1051. * should complete the write on. It's easiest to compute them ahead of
  1052. * time when a more complete view of the write is available.
  1053. */
  1054. static void ocfs2_set_target_boundaries(struct ocfs2_super *osb,
  1055. struct ocfs2_write_ctxt *wc,
  1056. loff_t pos, unsigned len, int alloc)
  1057. {
  1058. struct ocfs2_write_cluster_desc *desc;
  1059. wc->w_target_from = pos & (PAGE_CACHE_SIZE - 1);
  1060. wc->w_target_to = wc->w_target_from + len;
  1061. if (alloc == 0)
  1062. return;
  1063. /*
  1064. * Allocating write - we may have different boundaries based
  1065. * on page size and cluster size.
  1066. *
  1067. * NOTE: We can no longer compute one value from the other as
  1068. * the actual write length and user provided length may be
  1069. * different.
  1070. */
  1071. if (wc->w_large_pages) {
  1072. /*
  1073. * We only care about the 1st and last cluster within
  1074. * our range and whether they should be zero'd or not. Either
  1075. * value may be extended out to the start/end of a
  1076. * newly allocated cluster.
  1077. */
  1078. desc = &wc->w_desc[0];
  1079. if (ocfs2_should_zero_cluster(desc))
  1080. ocfs2_figure_cluster_boundaries(osb,
  1081. desc->c_cpos,
  1082. &wc->w_target_from,
  1083. NULL);
  1084. desc = &wc->w_desc[wc->w_clen - 1];
  1085. if (ocfs2_should_zero_cluster(desc))
  1086. ocfs2_figure_cluster_boundaries(osb,
  1087. desc->c_cpos,
  1088. NULL,
  1089. &wc->w_target_to);
  1090. } else {
  1091. wc->w_target_from = 0;
  1092. wc->w_target_to = PAGE_CACHE_SIZE;
  1093. }
  1094. }
  1095. /*
  1096. * Populate each single-cluster write descriptor in the write context
  1097. * with information about the i/o to be done.
  1098. *
  1099. * Returns the number of clusters that will have to be allocated, as
  1100. * well as a worst case estimate of the number of extent records that
  1101. * would have to be created during a write to an unwritten region.
  1102. */
  1103. static int ocfs2_populate_write_desc(struct inode *inode,
  1104. struct ocfs2_write_ctxt *wc,
  1105. unsigned int *clusters_to_alloc,
  1106. unsigned int *extents_to_split)
  1107. {
  1108. int ret;
  1109. struct ocfs2_write_cluster_desc *desc;
  1110. unsigned int num_clusters = 0;
  1111. unsigned int ext_flags = 0;
  1112. u32 phys = 0;
  1113. int i;
  1114. *clusters_to_alloc = 0;
  1115. *extents_to_split = 0;
  1116. for (i = 0; i < wc->w_clen; i++) {
  1117. desc = &wc->w_desc[i];
  1118. desc->c_cpos = wc->w_cpos + i;
  1119. if (num_clusters == 0) {
  1120. /*
  1121. * Need to look up the next extent record.
  1122. */
  1123. ret = ocfs2_get_clusters(inode, desc->c_cpos, &phys,
  1124. &num_clusters, &ext_flags);
  1125. if (ret) {
  1126. mlog_errno(ret);
  1127. goto out;
  1128. }
  1129. /*
  1130. * Assume worst case - that we're writing in
  1131. * the middle of the extent.
  1132. *
  1133. * We can assume that the write proceeds from
  1134. * left to right, in which case the extent
  1135. * insert code is smart enough to coalesce the
  1136. * next splits into the previous records created.
  1137. */
  1138. if (ext_flags & OCFS2_EXT_UNWRITTEN)
  1139. *extents_to_split = *extents_to_split + 2;
  1140. } else if (phys) {
  1141. /*
  1142. * Only increment phys if it doesn't describe
  1143. * a hole.
  1144. */
  1145. phys++;
  1146. }
  1147. desc->c_phys = phys;
  1148. if (phys == 0) {
  1149. desc->c_new = 1;
  1150. *clusters_to_alloc = *clusters_to_alloc + 1;
  1151. }
  1152. if (ext_flags & OCFS2_EXT_UNWRITTEN)
  1153. desc->c_unwritten = 1;
  1154. num_clusters--;
  1155. }
  1156. ret = 0;
  1157. out:
  1158. return ret;
  1159. }
  1160. int ocfs2_write_begin_nolock(struct address_space *mapping,
  1161. loff_t pos, unsigned len, unsigned flags,
  1162. struct page **pagep, void **fsdata,
  1163. struct buffer_head *di_bh, struct page *mmap_page)
  1164. {
  1165. int ret, credits = OCFS2_INODE_UPDATE_CREDITS;
  1166. unsigned int clusters_to_alloc, extents_to_split;
  1167. struct ocfs2_write_ctxt *wc;
  1168. struct inode *inode = mapping->host;
  1169. struct ocfs2_super *osb = OCFS2_SB(inode->i_sb);
  1170. struct ocfs2_dinode *di;
  1171. struct ocfs2_alloc_context *data_ac = NULL;
  1172. struct ocfs2_alloc_context *meta_ac = NULL;
  1173. handle_t *handle;
  1174. ret = ocfs2_alloc_write_ctxt(&wc, osb, pos, len, di_bh);
  1175. if (ret) {
  1176. mlog_errno(ret);
  1177. return ret;
  1178. }
  1179. ret = ocfs2_populate_write_desc(inode, wc, &clusters_to_alloc,
  1180. &extents_to_split);
  1181. if (ret) {
  1182. mlog_errno(ret);
  1183. goto out;
  1184. }
  1185. di = (struct ocfs2_dinode *)wc->w_di_bh->b_data;
  1186. /*
  1187. * We set w_target_from, w_target_to here so that
  1188. * ocfs2_write_end() knows which range in the target page to
  1189. * write out. An allocation requires that we write the entire
  1190. * cluster range.
  1191. */
  1192. if (clusters_to_alloc || extents_to_split) {
  1193. /*
  1194. * XXX: We are stretching the limits of
  1195. * ocfs2_lock_allocators(). It greatly over-estimates
  1196. * the work to be done.
  1197. */
  1198. ret = ocfs2_lock_allocators(inode, di, clusters_to_alloc,
  1199. extents_to_split, &data_ac, &meta_ac);
  1200. if (ret) {
  1201. mlog_errno(ret);
  1202. goto out;
  1203. }
  1204. credits = ocfs2_calc_extend_credits(inode->i_sb, di,
  1205. clusters_to_alloc);
  1206. }
  1207. ocfs2_set_target_boundaries(osb, wc, pos, len,
  1208. clusters_to_alloc + extents_to_split);
  1209. handle = ocfs2_start_trans(osb, credits);
  1210. if (IS_ERR(handle)) {
  1211. ret = PTR_ERR(handle);
  1212. mlog_errno(ret);
  1213. goto out;
  1214. }
  1215. wc->w_handle = handle;
  1216. /*
  1217. * We don't want this to fail in ocfs2_write_end(), so do it
  1218. * here.
  1219. */
  1220. ret = ocfs2_journal_access(handle, inode, wc->w_di_bh,
  1221. OCFS2_JOURNAL_ACCESS_WRITE);
  1222. if (ret) {
  1223. mlog_errno(ret);
  1224. goto out_commit;
  1225. }
  1226. /*
  1227. * Fill our page array first. That way we've grabbed enough so
  1228. * that we can zero and flush if we error after adding the
  1229. * extent.
  1230. */
  1231. ret = ocfs2_grab_pages_for_write(mapping, wc, wc->w_cpos, pos,
  1232. clusters_to_alloc + extents_to_split,
  1233. mmap_page);
  1234. if (ret) {
  1235. mlog_errno(ret);
  1236. goto out_commit;
  1237. }
  1238. ret = ocfs2_write_cluster_by_desc(mapping, data_ac, meta_ac, wc, pos,
  1239. len);
  1240. if (ret) {
  1241. mlog_errno(ret);
  1242. goto out_commit;
  1243. }
  1244. if (data_ac)
  1245. ocfs2_free_alloc_context(data_ac);
  1246. if (meta_ac)
  1247. ocfs2_free_alloc_context(meta_ac);
  1248. *pagep = wc->w_target_page;
  1249. *fsdata = wc;
  1250. return 0;
  1251. out_commit:
  1252. ocfs2_commit_trans(osb, handle);
  1253. out:
  1254. ocfs2_free_write_ctxt(wc);
  1255. if (data_ac)
  1256. ocfs2_free_alloc_context(data_ac);
  1257. if (meta_ac)
  1258. ocfs2_free_alloc_context(meta_ac);
  1259. return ret;
  1260. }
  1261. int ocfs2_write_begin(struct file *file, struct address_space *mapping,
  1262. loff_t pos, unsigned len, unsigned flags,
  1263. struct page **pagep, void **fsdata)
  1264. {
  1265. int ret;
  1266. struct buffer_head *di_bh = NULL;
  1267. struct inode *inode = mapping->host;
  1268. ret = ocfs2_meta_lock(inode, &di_bh, 1);
  1269. if (ret) {
  1270. mlog_errno(ret);
  1271. return ret;
  1272. }
  1273. /*
  1274. * Take alloc sem here to prevent concurrent lookups. That way
  1275. * the mapping, zeroing and tree manipulation within
  1276. * ocfs2_write() will be safe against ->readpage(). This
  1277. * should also serve to lock out allocation from a shared
  1278. * writeable region.
  1279. */
  1280. down_write(&OCFS2_I(inode)->ip_alloc_sem);
  1281. ret = ocfs2_data_lock(inode, 1);
  1282. if (ret) {
  1283. mlog_errno(ret);
  1284. goto out_fail;
  1285. }
  1286. ret = ocfs2_write_begin_nolock(mapping, pos, len, flags, pagep,
  1287. fsdata, di_bh, NULL);
  1288. if (ret) {
  1289. mlog_errno(ret);
  1290. goto out_fail_data;
  1291. }
  1292. brelse(di_bh);
  1293. return 0;
  1294. out_fail_data:
  1295. ocfs2_data_unlock(inode, 1);
  1296. out_fail:
  1297. up_write(&OCFS2_I(inode)->ip_alloc_sem);
  1298. brelse(di_bh);
  1299. ocfs2_meta_unlock(inode, 1);
  1300. return ret;
  1301. }
  1302. int ocfs2_write_end_nolock(struct address_space *mapping,
  1303. loff_t pos, unsigned len, unsigned copied,
  1304. struct page *page, void *fsdata)
  1305. {
  1306. int i;
  1307. unsigned from, to, start = pos & (PAGE_CACHE_SIZE - 1);
  1308. struct inode *inode = mapping->host;
  1309. struct ocfs2_super *osb = OCFS2_SB(inode->i_sb);
  1310. struct ocfs2_write_ctxt *wc = fsdata;
  1311. struct ocfs2_dinode *di = (struct ocfs2_dinode *)wc->w_di_bh->b_data;
  1312. handle_t *handle = wc->w_handle;
  1313. struct page *tmppage;
  1314. if (unlikely(copied < len)) {
  1315. if (!PageUptodate(wc->w_target_page))
  1316. copied = 0;
  1317. ocfs2_zero_new_buffers(wc->w_target_page, start+copied,
  1318. start+len);
  1319. }
  1320. flush_dcache_page(wc->w_target_page);
  1321. for(i = 0; i < wc->w_num_pages; i++) {
  1322. tmppage = wc->w_pages[i];
  1323. if (tmppage == wc->w_target_page) {
  1324. from = wc->w_target_from;
  1325. to = wc->w_target_to;
  1326. BUG_ON(from > PAGE_CACHE_SIZE ||
  1327. to > PAGE_CACHE_SIZE ||
  1328. to < from);
  1329. } else {
  1330. /*
  1331. * Pages adjacent to the target (if any) imply
  1332. * a hole-filling write in which case we want
  1333. * to flush their entire range.
  1334. */
  1335. from = 0;
  1336. to = PAGE_CACHE_SIZE;
  1337. }
  1338. if (ocfs2_should_order_data(inode))
  1339. walk_page_buffers(wc->w_handle, page_buffers(tmppage),
  1340. from, to, NULL,
  1341. ocfs2_journal_dirty_data);
  1342. block_commit_write(tmppage, from, to);
  1343. }
  1344. pos += copied;
  1345. if (pos > inode->i_size) {
  1346. i_size_write(inode, pos);
  1347. mark_inode_dirty(inode);
  1348. }
  1349. inode->i_blocks = ocfs2_inode_sector_count(inode);
  1350. di->i_size = cpu_to_le64((u64)i_size_read(inode));
  1351. inode->i_mtime = inode->i_ctime = CURRENT_TIME;
  1352. di->i_mtime = di->i_ctime = cpu_to_le64(inode->i_mtime.tv_sec);
  1353. di->i_mtime_nsec = di->i_ctime_nsec = cpu_to_le32(inode->i_mtime.tv_nsec);
  1354. ocfs2_journal_dirty(handle, wc->w_di_bh);
  1355. ocfs2_commit_trans(osb, handle);
  1356. ocfs2_run_deallocs(osb, &wc->w_dealloc);
  1357. ocfs2_free_write_ctxt(wc);
  1358. return copied;
  1359. }
  1360. int ocfs2_write_end(struct file *file, struct address_space *mapping,
  1361. loff_t pos, unsigned len, unsigned copied,
  1362. struct page *page, void *fsdata)
  1363. {
  1364. int ret;
  1365. struct inode *inode = mapping->host;
  1366. ret = ocfs2_write_end_nolock(mapping, pos, len, copied, page, fsdata);
  1367. ocfs2_data_unlock(inode, 1);
  1368. up_write(&OCFS2_I(inode)->ip_alloc_sem);
  1369. ocfs2_meta_unlock(inode, 1);
  1370. return ret;
  1371. }
  1372. const struct address_space_operations ocfs2_aops = {
  1373. .readpage = ocfs2_readpage,
  1374. .writepage = ocfs2_writepage,
  1375. .bmap = ocfs2_bmap,
  1376. .sync_page = block_sync_page,
  1377. .direct_IO = ocfs2_direct_IO,
  1378. .invalidatepage = ocfs2_invalidatepage,
  1379. .releasepage = ocfs2_releasepage,
  1380. .migratepage = buffer_migrate_page,
  1381. };