aops.c 52 KB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130131132133134135136137138139140141142143144145146147148149150151152153154155156157158159160161162163164165166167168169170171172173174175176177178179180181182183184185186187188189190191192193194195196197198199200201202203204205206207208209210211212213214215216217218219220221222223224225226227228229230231232233234235236237238239240241242243244245246247248249250251252253254255256257258259260261262263264265266267268269270271272273274275276277278279280281282283284285286287288289290291292293294295296297298299300301302303304305306307308309310311312313314315316317318319320321322323324325326327328329330331332333334335336337338339340341342343344345346347348349350351352353354355356357358359360361362363364365366367368369370371372373374375376377378379380381382383384385386387388389390391392393394395396397398399400401402403404405406407408409410411412413414415416417418419420421422423424425426427428429430431432433434435436437438439440441442443444445446447448449450451452453454455456457458459460461462463464465466467468469470471472473474475476477478479480481482483484485486487488489490491492493494495496497498499500501502503504505506507508509510511512513514515516517518519520521522523524525526527528529530531532533534535536537538539540541542543544545546547548549550551552553554555556557558559560561562563564565566567568569570571572573574575576577578579580581582583584585586587588589590591592593594595596597598599600601602603604605606607608609610611612613614615616617618619620621622623624625626627628629630631632633634635636637638639640641642643644645646647648649650651652653654655656657658659660661662663664665666667668669670671672673674675676677678679680681682683684685686687688689690691692693694695696697698699700701702703704705706707708709710711712713714715716717718719720721722723724725726727728729730731732733734735736737738739740741742743744745746747748749750751752753754755756757758759760761762763764765766767768769770771772773774775776777778779780781782783784785786787788789790791792793794795796797798799800801802803804805806807808809810811812813814815816817818819820821822823824825826827828829830831832833834835836837838839840841842843844845846847848849850851852853854855856857858859860861862863864865866867868869870871872873874875876877878879880881882883884885886887888889890891892893894895896897898899900901902903904905906907908909910911912913914915916917918919920921922923924925926927928929930931932933934935936937938939940941942943944945946947948949950951952953954955956957958959960961962963964965966967968969970971972973974975976977978979980981982983984985986987988989990991992993994995996997998999100010011002100310041005100610071008100910101011101210131014101510161017101810191020102110221023102410251026102710281029103010311032103310341035103610371038103910401041104210431044104510461047104810491050105110521053105410551056105710581059106010611062106310641065106610671068106910701071107210731074107510761077107810791080108110821083108410851086108710881089109010911092109310941095109610971098109911001101110211031104110511061107110811091110111111121113111411151116111711181119112011211122112311241125112611271128112911301131113211331134113511361137113811391140114111421143114411451146114711481149115011511152115311541155115611571158115911601161116211631164116511661167116811691170117111721173117411751176117711781179118011811182118311841185118611871188118911901191119211931194119511961197119811991200120112021203120412051206120712081209121012111212121312141215121612171218121912201221122212231224122512261227122812291230123112321233123412351236123712381239124012411242124312441245124612471248124912501251125212531254125512561257125812591260126112621263126412651266126712681269127012711272127312741275127612771278127912801281128212831284128512861287128812891290129112921293129412951296129712981299130013011302130313041305130613071308130913101311131213131314131513161317131813191320132113221323132413251326132713281329133013311332133313341335133613371338133913401341134213431344134513461347134813491350135113521353135413551356135713581359136013611362136313641365136613671368136913701371137213731374137513761377137813791380138113821383138413851386138713881389139013911392139313941395139613971398139914001401140214031404140514061407140814091410141114121413141414151416141714181419142014211422142314241425142614271428142914301431143214331434143514361437143814391440144114421443144414451446144714481449145014511452145314541455145614571458145914601461146214631464146514661467146814691470147114721473147414751476147714781479148014811482148314841485148614871488148914901491149214931494149514961497149814991500150115021503150415051506150715081509151015111512151315141515151615171518151915201521152215231524152515261527152815291530153115321533153415351536153715381539154015411542154315441545154615471548154915501551155215531554155515561557155815591560156115621563156415651566156715681569157015711572157315741575157615771578157915801581158215831584158515861587158815891590159115921593159415951596159715981599160016011602160316041605160616071608160916101611161216131614161516161617161816191620162116221623162416251626162716281629163016311632163316341635163616371638163916401641164216431644164516461647164816491650165116521653165416551656165716581659166016611662166316641665166616671668166916701671167216731674167516761677167816791680168116821683168416851686168716881689169016911692169316941695169616971698169917001701170217031704170517061707170817091710171117121713171417151716171717181719172017211722172317241725172617271728172917301731173217331734173517361737173817391740174117421743174417451746174717481749175017511752175317541755175617571758175917601761176217631764176517661767176817691770177117721773177417751776177717781779178017811782178317841785178617871788178917901791179217931794179517961797179817991800180118021803180418051806180718081809181018111812181318141815181618171818181918201821182218231824182518261827182818291830183118321833183418351836183718381839184018411842184318441845184618471848184918501851185218531854185518561857185818591860186118621863186418651866186718681869187018711872187318741875187618771878187918801881188218831884188518861887188818891890189118921893189418951896189718981899190019011902190319041905190619071908190919101911191219131914191519161917191819191920192119221923192419251926192719281929193019311932193319341935193619371938193919401941194219431944194519461947194819491950195119521953195419551956195719581959196019611962196319641965196619671968196919701971197219731974197519761977197819791980198119821983198419851986198719881989199019911992199319941995199619971998199920002001200220032004200520062007200820092010201120122013201420152016201720182019202020212022202320242025202620272028202920302031203220332034203520362037203820392040204120422043204420452046204720482049
  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. #include <linux/mpage.h>
  29. #include <linux/quotaops.h>
  30. #include <cluster/masklog.h>
  31. #include "ocfs2.h"
  32. #include "alloc.h"
  33. #include "aops.h"
  34. #include "dlmglue.h"
  35. #include "extent_map.h"
  36. #include "file.h"
  37. #include "inode.h"
  38. #include "journal.h"
  39. #include "suballoc.h"
  40. #include "super.h"
  41. #include "symlink.h"
  42. #include "refcounttree.h"
  43. #include "ocfs2_trace.h"
  44. #include "buffer_head_io.h"
  45. static int ocfs2_symlink_get_block(struct inode *inode, sector_t iblock,
  46. struct buffer_head *bh_result, int create)
  47. {
  48. int err = -EIO;
  49. int status;
  50. struct ocfs2_dinode *fe = NULL;
  51. struct buffer_head *bh = NULL;
  52. struct buffer_head *buffer_cache_bh = NULL;
  53. struct ocfs2_super *osb = OCFS2_SB(inode->i_sb);
  54. void *kaddr;
  55. trace_ocfs2_symlink_get_block(
  56. (unsigned long long)OCFS2_I(inode)->ip_blkno,
  57. (unsigned long long)iblock, bh_result, create);
  58. BUG_ON(ocfs2_inode_is_fast_symlink(inode));
  59. if ((iblock << inode->i_sb->s_blocksize_bits) > PATH_MAX + 1) {
  60. mlog(ML_ERROR, "block offset > PATH_MAX: %llu",
  61. (unsigned long long)iblock);
  62. goto bail;
  63. }
  64. status = ocfs2_read_inode_block(inode, &bh);
  65. if (status < 0) {
  66. mlog_errno(status);
  67. goto bail;
  68. }
  69. fe = (struct ocfs2_dinode *) bh->b_data;
  70. if ((u64)iblock >= ocfs2_clusters_to_blocks(inode->i_sb,
  71. le32_to_cpu(fe->i_clusters))) {
  72. mlog(ML_ERROR, "block offset is outside the allocated size: "
  73. "%llu\n", (unsigned long long)iblock);
  74. goto bail;
  75. }
  76. /* We don't use the page cache to create symlink data, so if
  77. * need be, copy it over from the buffer cache. */
  78. if (!buffer_uptodate(bh_result) && ocfs2_inode_is_new(inode)) {
  79. u64 blkno = le64_to_cpu(fe->id2.i_list.l_recs[0].e_blkno) +
  80. iblock;
  81. buffer_cache_bh = sb_getblk(osb->sb, blkno);
  82. if (!buffer_cache_bh) {
  83. mlog(ML_ERROR, "couldn't getblock for symlink!\n");
  84. goto bail;
  85. }
  86. /* we haven't locked out transactions, so a commit
  87. * could've happened. Since we've got a reference on
  88. * the bh, even if it commits while we're doing the
  89. * copy, the data is still good. */
  90. if (buffer_jbd(buffer_cache_bh)
  91. && ocfs2_inode_is_new(inode)) {
  92. kaddr = kmap_atomic(bh_result->b_page, KM_USER0);
  93. if (!kaddr) {
  94. mlog(ML_ERROR, "couldn't kmap!\n");
  95. goto bail;
  96. }
  97. memcpy(kaddr + (bh_result->b_size * iblock),
  98. buffer_cache_bh->b_data,
  99. bh_result->b_size);
  100. kunmap_atomic(kaddr, KM_USER0);
  101. set_buffer_uptodate(bh_result);
  102. }
  103. brelse(buffer_cache_bh);
  104. }
  105. map_bh(bh_result, inode->i_sb,
  106. le64_to_cpu(fe->id2.i_list.l_recs[0].e_blkno) + iblock);
  107. err = 0;
  108. bail:
  109. brelse(bh);
  110. return err;
  111. }
  112. int ocfs2_get_block(struct inode *inode, sector_t iblock,
  113. struct buffer_head *bh_result, int create)
  114. {
  115. int err = 0;
  116. unsigned int ext_flags;
  117. u64 max_blocks = bh_result->b_size >> inode->i_blkbits;
  118. u64 p_blkno, count, past_eof;
  119. struct ocfs2_super *osb = OCFS2_SB(inode->i_sb);
  120. trace_ocfs2_get_block((unsigned long long)OCFS2_I(inode)->ip_blkno,
  121. (unsigned long long)iblock, bh_result, create);
  122. if (OCFS2_I(inode)->ip_flags & OCFS2_INODE_SYSTEM_FILE)
  123. mlog(ML_NOTICE, "get_block on system inode 0x%p (%lu)\n",
  124. inode, inode->i_ino);
  125. if (S_ISLNK(inode->i_mode)) {
  126. /* this always does I/O for some reason. */
  127. err = ocfs2_symlink_get_block(inode, iblock, bh_result, create);
  128. goto bail;
  129. }
  130. err = ocfs2_extent_map_get_blocks(inode, iblock, &p_blkno, &count,
  131. &ext_flags);
  132. if (err) {
  133. mlog(ML_ERROR, "Error %d from get_blocks(0x%p, %llu, 1, "
  134. "%llu, NULL)\n", err, inode, (unsigned long long)iblock,
  135. (unsigned long long)p_blkno);
  136. goto bail;
  137. }
  138. if (max_blocks < count)
  139. count = max_blocks;
  140. /*
  141. * ocfs2 never allocates in this function - the only time we
  142. * need to use BH_New is when we're extending i_size on a file
  143. * system which doesn't support holes, in which case BH_New
  144. * allows __block_write_begin() to zero.
  145. *
  146. * If we see this on a sparse file system, then a truncate has
  147. * raced us and removed the cluster. In this case, we clear
  148. * the buffers dirty and uptodate bits and let the buffer code
  149. * ignore it as a hole.
  150. */
  151. if (create && p_blkno == 0 && ocfs2_sparse_alloc(osb)) {
  152. clear_buffer_dirty(bh_result);
  153. clear_buffer_uptodate(bh_result);
  154. goto bail;
  155. }
  156. /* Treat the unwritten extent as a hole for zeroing purposes. */
  157. if (p_blkno && !(ext_flags & OCFS2_EXT_UNWRITTEN))
  158. map_bh(bh_result, inode->i_sb, p_blkno);
  159. bh_result->b_size = count << inode->i_blkbits;
  160. if (!ocfs2_sparse_alloc(osb)) {
  161. if (p_blkno == 0) {
  162. err = -EIO;
  163. mlog(ML_ERROR,
  164. "iblock = %llu p_blkno = %llu blkno=(%llu)\n",
  165. (unsigned long long)iblock,
  166. (unsigned long long)p_blkno,
  167. (unsigned long long)OCFS2_I(inode)->ip_blkno);
  168. mlog(ML_ERROR, "Size %llu, clusters %u\n", (unsigned long long)i_size_read(inode), OCFS2_I(inode)->ip_clusters);
  169. dump_stack();
  170. goto bail;
  171. }
  172. }
  173. past_eof = ocfs2_blocks_for_bytes(inode->i_sb, i_size_read(inode));
  174. trace_ocfs2_get_block_end((unsigned long long)OCFS2_I(inode)->ip_blkno,
  175. (unsigned long long)past_eof);
  176. if (create && (iblock >= past_eof))
  177. set_buffer_new(bh_result);
  178. bail:
  179. if (err < 0)
  180. err = -EIO;
  181. return err;
  182. }
  183. int ocfs2_read_inline_data(struct inode *inode, struct page *page,
  184. struct buffer_head *di_bh)
  185. {
  186. void *kaddr;
  187. loff_t size;
  188. struct ocfs2_dinode *di = (struct ocfs2_dinode *)di_bh->b_data;
  189. if (!(le16_to_cpu(di->i_dyn_features) & OCFS2_INLINE_DATA_FL)) {
  190. ocfs2_error(inode->i_sb, "Inode %llu lost inline data flag",
  191. (unsigned long long)OCFS2_I(inode)->ip_blkno);
  192. return -EROFS;
  193. }
  194. size = i_size_read(inode);
  195. if (size > PAGE_CACHE_SIZE ||
  196. size > ocfs2_max_inline_data_with_xattr(inode->i_sb, di)) {
  197. ocfs2_error(inode->i_sb,
  198. "Inode %llu has with inline data has bad size: %Lu",
  199. (unsigned long long)OCFS2_I(inode)->ip_blkno,
  200. (unsigned long long)size);
  201. return -EROFS;
  202. }
  203. kaddr = kmap_atomic(page, KM_USER0);
  204. if (size)
  205. memcpy(kaddr, di->id2.i_data.id_data, size);
  206. /* Clear the remaining part of the page */
  207. memset(kaddr + size, 0, PAGE_CACHE_SIZE - size);
  208. flush_dcache_page(page);
  209. kunmap_atomic(kaddr, KM_USER0);
  210. SetPageUptodate(page);
  211. return 0;
  212. }
  213. static int ocfs2_readpage_inline(struct inode *inode, struct page *page)
  214. {
  215. int ret;
  216. struct buffer_head *di_bh = NULL;
  217. BUG_ON(!PageLocked(page));
  218. BUG_ON(!(OCFS2_I(inode)->ip_dyn_features & OCFS2_INLINE_DATA_FL));
  219. ret = ocfs2_read_inode_block(inode, &di_bh);
  220. if (ret) {
  221. mlog_errno(ret);
  222. goto out;
  223. }
  224. ret = ocfs2_read_inline_data(inode, page, di_bh);
  225. out:
  226. unlock_page(page);
  227. brelse(di_bh);
  228. return ret;
  229. }
  230. static int ocfs2_readpage(struct file *file, struct page *page)
  231. {
  232. struct inode *inode = page->mapping->host;
  233. struct ocfs2_inode_info *oi = OCFS2_I(inode);
  234. loff_t start = (loff_t)page->index << PAGE_CACHE_SHIFT;
  235. int ret, unlock = 1;
  236. trace_ocfs2_readpage((unsigned long long)oi->ip_blkno,
  237. (page ? page->index : 0));
  238. ret = ocfs2_inode_lock_with_page(inode, NULL, 0, page);
  239. if (ret != 0) {
  240. if (ret == AOP_TRUNCATED_PAGE)
  241. unlock = 0;
  242. mlog_errno(ret);
  243. goto out;
  244. }
  245. if (down_read_trylock(&oi->ip_alloc_sem) == 0) {
  246. ret = AOP_TRUNCATED_PAGE;
  247. goto out_inode_unlock;
  248. }
  249. /*
  250. * i_size might have just been updated as we grabed the meta lock. We
  251. * might now be discovering a truncate that hit on another node.
  252. * block_read_full_page->get_block freaks out if it is asked to read
  253. * beyond the end of a file, so we check here. Callers
  254. * (generic_file_read, vm_ops->fault) are clever enough to check i_size
  255. * and notice that the page they just read isn't needed.
  256. *
  257. * XXX sys_readahead() seems to get that wrong?
  258. */
  259. if (start >= i_size_read(inode)) {
  260. zero_user(page, 0, PAGE_SIZE);
  261. SetPageUptodate(page);
  262. ret = 0;
  263. goto out_alloc;
  264. }
  265. if (oi->ip_dyn_features & OCFS2_INLINE_DATA_FL)
  266. ret = ocfs2_readpage_inline(inode, page);
  267. else
  268. ret = block_read_full_page(page, ocfs2_get_block);
  269. unlock = 0;
  270. out_alloc:
  271. up_read(&OCFS2_I(inode)->ip_alloc_sem);
  272. out_inode_unlock:
  273. ocfs2_inode_unlock(inode, 0);
  274. out:
  275. if (unlock)
  276. unlock_page(page);
  277. return ret;
  278. }
  279. /*
  280. * This is used only for read-ahead. Failures or difficult to handle
  281. * situations are safe to ignore.
  282. *
  283. * Right now, we don't bother with BH_Boundary - in-inode extent lists
  284. * are quite large (243 extents on 4k blocks), so most inodes don't
  285. * grow out to a tree. If need be, detecting boundary extents could
  286. * trivially be added in a future version of ocfs2_get_block().
  287. */
  288. static int ocfs2_readpages(struct file *filp, struct address_space *mapping,
  289. struct list_head *pages, unsigned nr_pages)
  290. {
  291. int ret, err = -EIO;
  292. struct inode *inode = mapping->host;
  293. struct ocfs2_inode_info *oi = OCFS2_I(inode);
  294. loff_t start;
  295. struct page *last;
  296. /*
  297. * Use the nonblocking flag for the dlm code to avoid page
  298. * lock inversion, but don't bother with retrying.
  299. */
  300. ret = ocfs2_inode_lock_full(inode, NULL, 0, OCFS2_LOCK_NONBLOCK);
  301. if (ret)
  302. return err;
  303. if (down_read_trylock(&oi->ip_alloc_sem) == 0) {
  304. ocfs2_inode_unlock(inode, 0);
  305. return err;
  306. }
  307. /*
  308. * Don't bother with inline-data. There isn't anything
  309. * to read-ahead in that case anyway...
  310. */
  311. if (oi->ip_dyn_features & OCFS2_INLINE_DATA_FL)
  312. goto out_unlock;
  313. /*
  314. * Check whether a remote node truncated this file - we just
  315. * drop out in that case as it's not worth handling here.
  316. */
  317. last = list_entry(pages->prev, struct page, lru);
  318. start = (loff_t)last->index << PAGE_CACHE_SHIFT;
  319. if (start >= i_size_read(inode))
  320. goto out_unlock;
  321. err = mpage_readpages(mapping, pages, nr_pages, ocfs2_get_block);
  322. out_unlock:
  323. up_read(&oi->ip_alloc_sem);
  324. ocfs2_inode_unlock(inode, 0);
  325. return err;
  326. }
  327. /* Note: Because we don't support holes, our allocation has
  328. * already happened (allocation writes zeros to the file data)
  329. * so we don't have to worry about ordered writes in
  330. * ocfs2_writepage.
  331. *
  332. * ->writepage is called during the process of invalidating the page cache
  333. * during blocked lock processing. It can't block on any cluster locks
  334. * to during block mapping. It's relying on the fact that the block
  335. * mapping can't have disappeared under the dirty pages that it is
  336. * being asked to write back.
  337. */
  338. static int ocfs2_writepage(struct page *page, struct writeback_control *wbc)
  339. {
  340. trace_ocfs2_writepage(
  341. (unsigned long long)OCFS2_I(page->mapping->host)->ip_blkno,
  342. page->index);
  343. return block_write_full_page(page, ocfs2_get_block, wbc);
  344. }
  345. /* Taken from ext3. We don't necessarily need the full blown
  346. * functionality yet, but IMHO it's better to cut and paste the whole
  347. * thing so we can avoid introducing our own bugs (and easily pick up
  348. * their fixes when they happen) --Mark */
  349. int walk_page_buffers( handle_t *handle,
  350. struct buffer_head *head,
  351. unsigned from,
  352. unsigned to,
  353. int *partial,
  354. int (*fn)( handle_t *handle,
  355. struct buffer_head *bh))
  356. {
  357. struct buffer_head *bh;
  358. unsigned block_start, block_end;
  359. unsigned blocksize = head->b_size;
  360. int err, ret = 0;
  361. struct buffer_head *next;
  362. for ( bh = head, block_start = 0;
  363. ret == 0 && (bh != head || !block_start);
  364. block_start = block_end, bh = next)
  365. {
  366. next = bh->b_this_page;
  367. block_end = block_start + blocksize;
  368. if (block_end <= from || block_start >= to) {
  369. if (partial && !buffer_uptodate(bh))
  370. *partial = 1;
  371. continue;
  372. }
  373. err = (*fn)(handle, bh);
  374. if (!ret)
  375. ret = err;
  376. }
  377. return ret;
  378. }
  379. static sector_t ocfs2_bmap(struct address_space *mapping, sector_t block)
  380. {
  381. sector_t status;
  382. u64 p_blkno = 0;
  383. int err = 0;
  384. struct inode *inode = mapping->host;
  385. trace_ocfs2_bmap((unsigned long long)OCFS2_I(inode)->ip_blkno,
  386. (unsigned long long)block);
  387. /* We don't need to lock journal system files, since they aren't
  388. * accessed concurrently from multiple nodes.
  389. */
  390. if (!INODE_JOURNAL(inode)) {
  391. err = ocfs2_inode_lock(inode, NULL, 0);
  392. if (err) {
  393. if (err != -ENOENT)
  394. mlog_errno(err);
  395. goto bail;
  396. }
  397. down_read(&OCFS2_I(inode)->ip_alloc_sem);
  398. }
  399. if (!(OCFS2_I(inode)->ip_dyn_features & OCFS2_INLINE_DATA_FL))
  400. err = ocfs2_extent_map_get_blocks(inode, block, &p_blkno, NULL,
  401. NULL);
  402. if (!INODE_JOURNAL(inode)) {
  403. up_read(&OCFS2_I(inode)->ip_alloc_sem);
  404. ocfs2_inode_unlock(inode, 0);
  405. }
  406. if (err) {
  407. mlog(ML_ERROR, "get_blocks() failed, block = %llu\n",
  408. (unsigned long long)block);
  409. mlog_errno(err);
  410. goto bail;
  411. }
  412. bail:
  413. status = err ? 0 : p_blkno;
  414. return status;
  415. }
  416. /*
  417. * TODO: Make this into a generic get_blocks function.
  418. *
  419. * From do_direct_io in direct-io.c:
  420. * "So what we do is to permit the ->get_blocks function to populate
  421. * bh.b_size with the size of IO which is permitted at this offset and
  422. * this i_blkbits."
  423. *
  424. * This function is called directly from get_more_blocks in direct-io.c.
  425. *
  426. * called like this: dio->get_blocks(dio->inode, fs_startblk,
  427. * fs_count, map_bh, dio->rw == WRITE);
  428. *
  429. * Note that we never bother to allocate blocks here, and thus ignore the
  430. * create argument.
  431. */
  432. static int ocfs2_direct_IO_get_blocks(struct inode *inode, sector_t iblock,
  433. struct buffer_head *bh_result, int create)
  434. {
  435. int ret;
  436. u64 p_blkno, inode_blocks, contig_blocks;
  437. unsigned int ext_flags;
  438. unsigned char blocksize_bits = inode->i_sb->s_blocksize_bits;
  439. unsigned long max_blocks = bh_result->b_size >> inode->i_blkbits;
  440. /* This function won't even be called if the request isn't all
  441. * nicely aligned and of the right size, so there's no need
  442. * for us to check any of that. */
  443. inode_blocks = ocfs2_blocks_for_bytes(inode->i_sb, i_size_read(inode));
  444. /* This figures out the size of the next contiguous block, and
  445. * our logical offset */
  446. ret = ocfs2_extent_map_get_blocks(inode, iblock, &p_blkno,
  447. &contig_blocks, &ext_flags);
  448. if (ret) {
  449. mlog(ML_ERROR, "get_blocks() failed iblock=%llu\n",
  450. (unsigned long long)iblock);
  451. ret = -EIO;
  452. goto bail;
  453. }
  454. /* We should already CoW the refcounted extent in case of create. */
  455. BUG_ON(create && (ext_flags & OCFS2_EXT_REFCOUNTED));
  456. /*
  457. * get_more_blocks() expects us to describe a hole by clearing
  458. * the mapped bit on bh_result().
  459. *
  460. * Consider an unwritten extent as a hole.
  461. */
  462. if (p_blkno && !(ext_flags & OCFS2_EXT_UNWRITTEN))
  463. map_bh(bh_result, inode->i_sb, p_blkno);
  464. else
  465. clear_buffer_mapped(bh_result);
  466. /* make sure we don't map more than max_blocks blocks here as
  467. that's all the kernel will handle at this point. */
  468. if (max_blocks < contig_blocks)
  469. contig_blocks = max_blocks;
  470. bh_result->b_size = contig_blocks << blocksize_bits;
  471. bail:
  472. return ret;
  473. }
  474. /*
  475. * ocfs2_dio_end_io is called by the dio core when a dio is finished. We're
  476. * particularly interested in the aio/dio case. Like the core uses
  477. * i_alloc_sem, we use the rw_lock DLM lock to protect io on one node from
  478. * truncation on another.
  479. */
  480. static void ocfs2_dio_end_io(struct kiocb *iocb,
  481. loff_t offset,
  482. ssize_t bytes,
  483. void *private,
  484. int ret,
  485. bool is_async)
  486. {
  487. struct inode *inode = iocb->ki_filp->f_path.dentry->d_inode;
  488. int level;
  489. /* this io's submitter should not have unlocked this before we could */
  490. BUG_ON(!ocfs2_iocb_is_rw_locked(iocb));
  491. if (ocfs2_iocb_is_sem_locked(iocb)) {
  492. up_read(&inode->i_alloc_sem);
  493. ocfs2_iocb_clear_sem_locked(iocb);
  494. }
  495. ocfs2_iocb_clear_rw_locked(iocb);
  496. level = ocfs2_iocb_rw_locked_level(iocb);
  497. ocfs2_rw_unlock(inode, level);
  498. if (is_async)
  499. aio_complete(iocb, ret, 0);
  500. }
  501. /*
  502. * ocfs2_invalidatepage() and ocfs2_releasepage() are shamelessly stolen
  503. * from ext3. PageChecked() bits have been removed as OCFS2 does not
  504. * do journalled data.
  505. */
  506. static void ocfs2_invalidatepage(struct page *page, unsigned long offset)
  507. {
  508. journal_t *journal = OCFS2_SB(page->mapping->host->i_sb)->journal->j_journal;
  509. jbd2_journal_invalidatepage(journal, page, offset);
  510. }
  511. static int ocfs2_releasepage(struct page *page, gfp_t wait)
  512. {
  513. journal_t *journal = OCFS2_SB(page->mapping->host->i_sb)->journal->j_journal;
  514. if (!page_has_buffers(page))
  515. return 0;
  516. return jbd2_journal_try_to_free_buffers(journal, page, wait);
  517. }
  518. static ssize_t ocfs2_direct_IO(int rw,
  519. struct kiocb *iocb,
  520. const struct iovec *iov,
  521. loff_t offset,
  522. unsigned long nr_segs)
  523. {
  524. struct file *file = iocb->ki_filp;
  525. struct inode *inode = file->f_path.dentry->d_inode->i_mapping->host;
  526. /*
  527. * Fallback to buffered I/O if we see an inode without
  528. * extents.
  529. */
  530. if (OCFS2_I(inode)->ip_dyn_features & OCFS2_INLINE_DATA_FL)
  531. return 0;
  532. /* Fallback to buffered I/O if we are appending. */
  533. if (i_size_read(inode) <= offset)
  534. return 0;
  535. return __blockdev_direct_IO(rw, iocb, inode, inode->i_sb->s_bdev,
  536. iov, offset, nr_segs,
  537. ocfs2_direct_IO_get_blocks,
  538. ocfs2_dio_end_io, NULL, 0);
  539. }
  540. static void ocfs2_figure_cluster_boundaries(struct ocfs2_super *osb,
  541. u32 cpos,
  542. unsigned int *start,
  543. unsigned int *end)
  544. {
  545. unsigned int cluster_start = 0, cluster_end = PAGE_CACHE_SIZE;
  546. if (unlikely(PAGE_CACHE_SHIFT > osb->s_clustersize_bits)) {
  547. unsigned int cpp;
  548. cpp = 1 << (PAGE_CACHE_SHIFT - osb->s_clustersize_bits);
  549. cluster_start = cpos % cpp;
  550. cluster_start = cluster_start << osb->s_clustersize_bits;
  551. cluster_end = cluster_start + osb->s_clustersize;
  552. }
  553. BUG_ON(cluster_start > PAGE_SIZE);
  554. BUG_ON(cluster_end > PAGE_SIZE);
  555. if (start)
  556. *start = cluster_start;
  557. if (end)
  558. *end = cluster_end;
  559. }
  560. /*
  561. * 'from' and 'to' are the region in the page to avoid zeroing.
  562. *
  563. * If pagesize > clustersize, this function will avoid zeroing outside
  564. * of the cluster boundary.
  565. *
  566. * from == to == 0 is code for "zero the entire cluster region"
  567. */
  568. static void ocfs2_clear_page_regions(struct page *page,
  569. struct ocfs2_super *osb, u32 cpos,
  570. unsigned from, unsigned to)
  571. {
  572. void *kaddr;
  573. unsigned int cluster_start, cluster_end;
  574. ocfs2_figure_cluster_boundaries(osb, cpos, &cluster_start, &cluster_end);
  575. kaddr = kmap_atomic(page, KM_USER0);
  576. if (from || to) {
  577. if (from > cluster_start)
  578. memset(kaddr + cluster_start, 0, from - cluster_start);
  579. if (to < cluster_end)
  580. memset(kaddr + to, 0, cluster_end - to);
  581. } else {
  582. memset(kaddr + cluster_start, 0, cluster_end - cluster_start);
  583. }
  584. kunmap_atomic(kaddr, KM_USER0);
  585. }
  586. /*
  587. * Nonsparse file systems fully allocate before we get to the write
  588. * code. This prevents ocfs2_write() from tagging the write as an
  589. * allocating one, which means ocfs2_map_page_blocks() might try to
  590. * read-in the blocks at the tail of our file. Avoid reading them by
  591. * testing i_size against each block offset.
  592. */
  593. static int ocfs2_should_read_blk(struct inode *inode, struct page *page,
  594. unsigned int block_start)
  595. {
  596. u64 offset = page_offset(page) + block_start;
  597. if (ocfs2_sparse_alloc(OCFS2_SB(inode->i_sb)))
  598. return 1;
  599. if (i_size_read(inode) > offset)
  600. return 1;
  601. return 0;
  602. }
  603. /*
  604. * Some of this taken from __block_write_begin(). We already have our
  605. * mapping by now though, and the entire write will be allocating or
  606. * it won't, so not much need to use BH_New.
  607. *
  608. * This will also skip zeroing, which is handled externally.
  609. */
  610. int ocfs2_map_page_blocks(struct page *page, u64 *p_blkno,
  611. struct inode *inode, unsigned int from,
  612. unsigned int to, int new)
  613. {
  614. int ret = 0;
  615. struct buffer_head *head, *bh, *wait[2], **wait_bh = wait;
  616. unsigned int block_end, block_start;
  617. unsigned int bsize = 1 << inode->i_blkbits;
  618. if (!page_has_buffers(page))
  619. create_empty_buffers(page, bsize, 0);
  620. head = page_buffers(page);
  621. for (bh = head, block_start = 0; bh != head || !block_start;
  622. bh = bh->b_this_page, block_start += bsize) {
  623. block_end = block_start + bsize;
  624. clear_buffer_new(bh);
  625. /*
  626. * Ignore blocks outside of our i/o range -
  627. * they may belong to unallocated clusters.
  628. */
  629. if (block_start >= to || block_end <= from) {
  630. if (PageUptodate(page))
  631. set_buffer_uptodate(bh);
  632. continue;
  633. }
  634. /*
  635. * For an allocating write with cluster size >= page
  636. * size, we always write the entire page.
  637. */
  638. if (new)
  639. set_buffer_new(bh);
  640. if (!buffer_mapped(bh)) {
  641. map_bh(bh, inode->i_sb, *p_blkno);
  642. unmap_underlying_metadata(bh->b_bdev, bh->b_blocknr);
  643. }
  644. if (PageUptodate(page)) {
  645. if (!buffer_uptodate(bh))
  646. set_buffer_uptodate(bh);
  647. } else if (!buffer_uptodate(bh) && !buffer_delay(bh) &&
  648. !buffer_new(bh) &&
  649. ocfs2_should_read_blk(inode, page, block_start) &&
  650. (block_start < from || block_end > to)) {
  651. ll_rw_block(READ, 1, &bh);
  652. *wait_bh++=bh;
  653. }
  654. *p_blkno = *p_blkno + 1;
  655. }
  656. /*
  657. * If we issued read requests - let them complete.
  658. */
  659. while(wait_bh > wait) {
  660. wait_on_buffer(*--wait_bh);
  661. if (!buffer_uptodate(*wait_bh))
  662. ret = -EIO;
  663. }
  664. if (ret == 0 || !new)
  665. return ret;
  666. /*
  667. * If we get -EIO above, zero out any newly allocated blocks
  668. * to avoid exposing stale data.
  669. */
  670. bh = head;
  671. block_start = 0;
  672. do {
  673. block_end = block_start + bsize;
  674. if (block_end <= from)
  675. goto next_bh;
  676. if (block_start >= to)
  677. break;
  678. zero_user(page, block_start, bh->b_size);
  679. set_buffer_uptodate(bh);
  680. mark_buffer_dirty(bh);
  681. next_bh:
  682. block_start = block_end;
  683. bh = bh->b_this_page;
  684. } while (bh != head);
  685. return ret;
  686. }
  687. #if (PAGE_CACHE_SIZE >= OCFS2_MAX_CLUSTERSIZE)
  688. #define OCFS2_MAX_CTXT_PAGES 1
  689. #else
  690. #define OCFS2_MAX_CTXT_PAGES (OCFS2_MAX_CLUSTERSIZE / PAGE_CACHE_SIZE)
  691. #endif
  692. #define OCFS2_MAX_CLUSTERS_PER_PAGE (PAGE_CACHE_SIZE / OCFS2_MIN_CLUSTERSIZE)
  693. /*
  694. * Describe the state of a single cluster to be written to.
  695. */
  696. struct ocfs2_write_cluster_desc {
  697. u32 c_cpos;
  698. u32 c_phys;
  699. /*
  700. * Give this a unique field because c_phys eventually gets
  701. * filled.
  702. */
  703. unsigned c_new;
  704. unsigned c_unwritten;
  705. unsigned c_needs_zero;
  706. };
  707. struct ocfs2_write_ctxt {
  708. /* Logical cluster position / len of write */
  709. u32 w_cpos;
  710. u32 w_clen;
  711. /* First cluster allocated in a nonsparse extend */
  712. u32 w_first_new_cpos;
  713. struct ocfs2_write_cluster_desc w_desc[OCFS2_MAX_CLUSTERS_PER_PAGE];
  714. /*
  715. * This is true if page_size > cluster_size.
  716. *
  717. * It triggers a set of special cases during write which might
  718. * have to deal with allocating writes to partial pages.
  719. */
  720. unsigned int w_large_pages;
  721. /*
  722. * Pages involved in this write.
  723. *
  724. * w_target_page is the page being written to by the user.
  725. *
  726. * w_pages is an array of pages which always contains
  727. * w_target_page, and in the case of an allocating write with
  728. * page_size < cluster size, it will contain zero'd and mapped
  729. * pages adjacent to w_target_page which need to be written
  730. * out in so that future reads from that region will get
  731. * zero's.
  732. */
  733. unsigned int w_num_pages;
  734. struct page *w_pages[OCFS2_MAX_CTXT_PAGES];
  735. struct page *w_target_page;
  736. /*
  737. * ocfs2_write_end() uses this to know what the real range to
  738. * write in the target should be.
  739. */
  740. unsigned int w_target_from;
  741. unsigned int w_target_to;
  742. /*
  743. * We could use journal_current_handle() but this is cleaner,
  744. * IMHO -Mark
  745. */
  746. handle_t *w_handle;
  747. struct buffer_head *w_di_bh;
  748. struct ocfs2_cached_dealloc_ctxt w_dealloc;
  749. };
  750. void ocfs2_unlock_and_free_pages(struct page **pages, int num_pages)
  751. {
  752. int i;
  753. for(i = 0; i < num_pages; i++) {
  754. if (pages[i]) {
  755. unlock_page(pages[i]);
  756. mark_page_accessed(pages[i]);
  757. page_cache_release(pages[i]);
  758. }
  759. }
  760. }
  761. static void ocfs2_free_write_ctxt(struct ocfs2_write_ctxt *wc)
  762. {
  763. ocfs2_unlock_and_free_pages(wc->w_pages, wc->w_num_pages);
  764. brelse(wc->w_di_bh);
  765. kfree(wc);
  766. }
  767. static int ocfs2_alloc_write_ctxt(struct ocfs2_write_ctxt **wcp,
  768. struct ocfs2_super *osb, loff_t pos,
  769. unsigned len, struct buffer_head *di_bh)
  770. {
  771. u32 cend;
  772. struct ocfs2_write_ctxt *wc;
  773. wc = kzalloc(sizeof(struct ocfs2_write_ctxt), GFP_NOFS);
  774. if (!wc)
  775. return -ENOMEM;
  776. wc->w_cpos = pos >> osb->s_clustersize_bits;
  777. wc->w_first_new_cpos = UINT_MAX;
  778. cend = (pos + len - 1) >> osb->s_clustersize_bits;
  779. wc->w_clen = cend - wc->w_cpos + 1;
  780. get_bh(di_bh);
  781. wc->w_di_bh = di_bh;
  782. if (unlikely(PAGE_CACHE_SHIFT > osb->s_clustersize_bits))
  783. wc->w_large_pages = 1;
  784. else
  785. wc->w_large_pages = 0;
  786. ocfs2_init_dealloc_ctxt(&wc->w_dealloc);
  787. *wcp = wc;
  788. return 0;
  789. }
  790. /*
  791. * If a page has any new buffers, zero them out here, and mark them uptodate
  792. * and dirty so they'll be written out (in order to prevent uninitialised
  793. * block data from leaking). And clear the new bit.
  794. */
  795. static void ocfs2_zero_new_buffers(struct page *page, unsigned from, unsigned to)
  796. {
  797. unsigned int block_start, block_end;
  798. struct buffer_head *head, *bh;
  799. BUG_ON(!PageLocked(page));
  800. if (!page_has_buffers(page))
  801. return;
  802. bh = head = page_buffers(page);
  803. block_start = 0;
  804. do {
  805. block_end = block_start + bh->b_size;
  806. if (buffer_new(bh)) {
  807. if (block_end > from && block_start < to) {
  808. if (!PageUptodate(page)) {
  809. unsigned start, end;
  810. start = max(from, block_start);
  811. end = min(to, block_end);
  812. zero_user_segment(page, start, end);
  813. set_buffer_uptodate(bh);
  814. }
  815. clear_buffer_new(bh);
  816. mark_buffer_dirty(bh);
  817. }
  818. }
  819. block_start = block_end;
  820. bh = bh->b_this_page;
  821. } while (bh != head);
  822. }
  823. /*
  824. * Only called when we have a failure during allocating write to write
  825. * zero's to the newly allocated region.
  826. */
  827. static void ocfs2_write_failure(struct inode *inode,
  828. struct ocfs2_write_ctxt *wc,
  829. loff_t user_pos, unsigned user_len)
  830. {
  831. int i;
  832. unsigned from = user_pos & (PAGE_CACHE_SIZE - 1),
  833. to = user_pos + user_len;
  834. struct page *tmppage;
  835. ocfs2_zero_new_buffers(wc->w_target_page, from, to);
  836. for(i = 0; i < wc->w_num_pages; i++) {
  837. tmppage = wc->w_pages[i];
  838. if (page_has_buffers(tmppage)) {
  839. if (ocfs2_should_order_data(inode))
  840. ocfs2_jbd2_file_inode(wc->w_handle, inode);
  841. block_commit_write(tmppage, from, to);
  842. }
  843. }
  844. }
  845. static int ocfs2_prepare_page_for_write(struct inode *inode, u64 *p_blkno,
  846. struct ocfs2_write_ctxt *wc,
  847. struct page *page, u32 cpos,
  848. loff_t user_pos, unsigned user_len,
  849. int new)
  850. {
  851. int ret;
  852. unsigned int map_from = 0, map_to = 0;
  853. unsigned int cluster_start, cluster_end;
  854. unsigned int user_data_from = 0, user_data_to = 0;
  855. ocfs2_figure_cluster_boundaries(OCFS2_SB(inode->i_sb), cpos,
  856. &cluster_start, &cluster_end);
  857. /* treat the write as new if the a hole/lseek spanned across
  858. * the page boundary.
  859. */
  860. new = new | ((i_size_read(inode) <= page_offset(page)) &&
  861. (page_offset(page) <= user_pos));
  862. if (page == wc->w_target_page) {
  863. map_from = user_pos & (PAGE_CACHE_SIZE - 1);
  864. map_to = map_from + user_len;
  865. if (new)
  866. ret = ocfs2_map_page_blocks(page, p_blkno, inode,
  867. cluster_start, cluster_end,
  868. new);
  869. else
  870. ret = ocfs2_map_page_blocks(page, p_blkno, inode,
  871. map_from, map_to, new);
  872. if (ret) {
  873. mlog_errno(ret);
  874. goto out;
  875. }
  876. user_data_from = map_from;
  877. user_data_to = map_to;
  878. if (new) {
  879. map_from = cluster_start;
  880. map_to = cluster_end;
  881. }
  882. } else {
  883. /*
  884. * If we haven't allocated the new page yet, we
  885. * shouldn't be writing it out without copying user
  886. * data. This is likely a math error from the caller.
  887. */
  888. BUG_ON(!new);
  889. map_from = cluster_start;
  890. map_to = cluster_end;
  891. ret = ocfs2_map_page_blocks(page, p_blkno, inode,
  892. cluster_start, cluster_end, new);
  893. if (ret) {
  894. mlog_errno(ret);
  895. goto out;
  896. }
  897. }
  898. /*
  899. * Parts of newly allocated pages need to be zero'd.
  900. *
  901. * Above, we have also rewritten 'to' and 'from' - as far as
  902. * the rest of the function is concerned, the entire cluster
  903. * range inside of a page needs to be written.
  904. *
  905. * We can skip this if the page is up to date - it's already
  906. * been zero'd from being read in as a hole.
  907. */
  908. if (new && !PageUptodate(page))
  909. ocfs2_clear_page_regions(page, OCFS2_SB(inode->i_sb),
  910. cpos, user_data_from, user_data_to);
  911. flush_dcache_page(page);
  912. out:
  913. return ret;
  914. }
  915. /*
  916. * This function will only grab one clusters worth of pages.
  917. */
  918. static int ocfs2_grab_pages_for_write(struct address_space *mapping,
  919. struct ocfs2_write_ctxt *wc,
  920. u32 cpos, loff_t user_pos,
  921. unsigned user_len, int new,
  922. struct page *mmap_page)
  923. {
  924. int ret = 0, i;
  925. unsigned long start, target_index, end_index, index;
  926. struct inode *inode = mapping->host;
  927. loff_t last_byte;
  928. target_index = user_pos >> PAGE_CACHE_SHIFT;
  929. /*
  930. * Figure out how many pages we'll be manipulating here. For
  931. * non allocating write, we just change the one
  932. * page. Otherwise, we'll need a whole clusters worth. If we're
  933. * writing past i_size, we only need enough pages to cover the
  934. * last page of the write.
  935. */
  936. if (new) {
  937. wc->w_num_pages = ocfs2_pages_per_cluster(inode->i_sb);
  938. start = ocfs2_align_clusters_to_page_index(inode->i_sb, cpos);
  939. /*
  940. * We need the index *past* the last page we could possibly
  941. * touch. This is the page past the end of the write or
  942. * i_size, whichever is greater.
  943. */
  944. last_byte = max(user_pos + user_len, i_size_read(inode));
  945. BUG_ON(last_byte < 1);
  946. end_index = ((last_byte - 1) >> PAGE_CACHE_SHIFT) + 1;
  947. if ((start + wc->w_num_pages) > end_index)
  948. wc->w_num_pages = end_index - start;
  949. } else {
  950. wc->w_num_pages = 1;
  951. start = target_index;
  952. }
  953. for(i = 0; i < wc->w_num_pages; i++) {
  954. index = start + i;
  955. if (index == target_index && mmap_page) {
  956. /*
  957. * ocfs2_pagemkwrite() is a little different
  958. * and wants us to directly use the page
  959. * passed in.
  960. */
  961. lock_page(mmap_page);
  962. if (mmap_page->mapping != mapping) {
  963. unlock_page(mmap_page);
  964. /*
  965. * Sanity check - the locking in
  966. * ocfs2_pagemkwrite() should ensure
  967. * that this code doesn't trigger.
  968. */
  969. ret = -EINVAL;
  970. mlog_errno(ret);
  971. goto out;
  972. }
  973. page_cache_get(mmap_page);
  974. wc->w_pages[i] = mmap_page;
  975. } else {
  976. wc->w_pages[i] = find_or_create_page(mapping, index,
  977. GFP_NOFS);
  978. if (!wc->w_pages[i]) {
  979. ret = -ENOMEM;
  980. mlog_errno(ret);
  981. goto out;
  982. }
  983. }
  984. if (index == target_index)
  985. wc->w_target_page = wc->w_pages[i];
  986. }
  987. out:
  988. return ret;
  989. }
  990. /*
  991. * Prepare a single cluster for write one cluster into the file.
  992. */
  993. static int ocfs2_write_cluster(struct address_space *mapping,
  994. u32 phys, unsigned int unwritten,
  995. unsigned int should_zero,
  996. struct ocfs2_alloc_context *data_ac,
  997. struct ocfs2_alloc_context *meta_ac,
  998. struct ocfs2_write_ctxt *wc, u32 cpos,
  999. loff_t user_pos, unsigned user_len)
  1000. {
  1001. int ret, i, new;
  1002. u64 v_blkno, p_blkno;
  1003. struct inode *inode = mapping->host;
  1004. struct ocfs2_extent_tree et;
  1005. new = phys == 0 ? 1 : 0;
  1006. if (new) {
  1007. u32 tmp_pos;
  1008. /*
  1009. * This is safe to call with the page locks - it won't take
  1010. * any additional semaphores or cluster locks.
  1011. */
  1012. tmp_pos = cpos;
  1013. ret = ocfs2_add_inode_data(OCFS2_SB(inode->i_sb), inode,
  1014. &tmp_pos, 1, 0, wc->w_di_bh,
  1015. wc->w_handle, data_ac,
  1016. meta_ac, NULL);
  1017. /*
  1018. * This shouldn't happen because we must have already
  1019. * calculated the correct meta data allocation required. The
  1020. * internal tree allocation code should know how to increase
  1021. * transaction credits itself.
  1022. *
  1023. * If need be, we could handle -EAGAIN for a
  1024. * RESTART_TRANS here.
  1025. */
  1026. mlog_bug_on_msg(ret == -EAGAIN,
  1027. "Inode %llu: EAGAIN return during allocation.\n",
  1028. (unsigned long long)OCFS2_I(inode)->ip_blkno);
  1029. if (ret < 0) {
  1030. mlog_errno(ret);
  1031. goto out;
  1032. }
  1033. } else if (unwritten) {
  1034. ocfs2_init_dinode_extent_tree(&et, INODE_CACHE(inode),
  1035. wc->w_di_bh);
  1036. ret = ocfs2_mark_extent_written(inode, &et,
  1037. wc->w_handle, cpos, 1, phys,
  1038. meta_ac, &wc->w_dealloc);
  1039. if (ret < 0) {
  1040. mlog_errno(ret);
  1041. goto out;
  1042. }
  1043. }
  1044. if (should_zero)
  1045. v_blkno = ocfs2_clusters_to_blocks(inode->i_sb, cpos);
  1046. else
  1047. v_blkno = user_pos >> inode->i_sb->s_blocksize_bits;
  1048. /*
  1049. * The only reason this should fail is due to an inability to
  1050. * find the extent added.
  1051. */
  1052. ret = ocfs2_extent_map_get_blocks(inode, v_blkno, &p_blkno, NULL,
  1053. NULL);
  1054. if (ret < 0) {
  1055. ocfs2_error(inode->i_sb, "Corrupting extend for inode %llu, "
  1056. "at logical block %llu",
  1057. (unsigned long long)OCFS2_I(inode)->ip_blkno,
  1058. (unsigned long long)v_blkno);
  1059. goto out;
  1060. }
  1061. BUG_ON(p_blkno == 0);
  1062. for(i = 0; i < wc->w_num_pages; i++) {
  1063. int tmpret;
  1064. tmpret = ocfs2_prepare_page_for_write(inode, &p_blkno, wc,
  1065. wc->w_pages[i], cpos,
  1066. user_pos, user_len,
  1067. should_zero);
  1068. if (tmpret) {
  1069. mlog_errno(tmpret);
  1070. if (ret == 0)
  1071. ret = tmpret;
  1072. }
  1073. }
  1074. /*
  1075. * We only have cleanup to do in case of allocating write.
  1076. */
  1077. if (ret && new)
  1078. ocfs2_write_failure(inode, wc, user_pos, user_len);
  1079. out:
  1080. return ret;
  1081. }
  1082. static int ocfs2_write_cluster_by_desc(struct address_space *mapping,
  1083. struct ocfs2_alloc_context *data_ac,
  1084. struct ocfs2_alloc_context *meta_ac,
  1085. struct ocfs2_write_ctxt *wc,
  1086. loff_t pos, unsigned len)
  1087. {
  1088. int ret, i;
  1089. loff_t cluster_off;
  1090. unsigned int local_len = len;
  1091. struct ocfs2_write_cluster_desc *desc;
  1092. struct ocfs2_super *osb = OCFS2_SB(mapping->host->i_sb);
  1093. for (i = 0; i < wc->w_clen; i++) {
  1094. desc = &wc->w_desc[i];
  1095. /*
  1096. * We have to make sure that the total write passed in
  1097. * doesn't extend past a single cluster.
  1098. */
  1099. local_len = len;
  1100. cluster_off = pos & (osb->s_clustersize - 1);
  1101. if ((cluster_off + local_len) > osb->s_clustersize)
  1102. local_len = osb->s_clustersize - cluster_off;
  1103. ret = ocfs2_write_cluster(mapping, desc->c_phys,
  1104. desc->c_unwritten,
  1105. desc->c_needs_zero,
  1106. data_ac, meta_ac,
  1107. wc, desc->c_cpos, pos, local_len);
  1108. if (ret) {
  1109. mlog_errno(ret);
  1110. goto out;
  1111. }
  1112. len -= local_len;
  1113. pos += local_len;
  1114. }
  1115. ret = 0;
  1116. out:
  1117. return ret;
  1118. }
  1119. /*
  1120. * ocfs2_write_end() wants to know which parts of the target page it
  1121. * should complete the write on. It's easiest to compute them ahead of
  1122. * time when a more complete view of the write is available.
  1123. */
  1124. static void ocfs2_set_target_boundaries(struct ocfs2_super *osb,
  1125. struct ocfs2_write_ctxt *wc,
  1126. loff_t pos, unsigned len, int alloc)
  1127. {
  1128. struct ocfs2_write_cluster_desc *desc;
  1129. wc->w_target_from = pos & (PAGE_CACHE_SIZE - 1);
  1130. wc->w_target_to = wc->w_target_from + len;
  1131. if (alloc == 0)
  1132. return;
  1133. /*
  1134. * Allocating write - we may have different boundaries based
  1135. * on page size and cluster size.
  1136. *
  1137. * NOTE: We can no longer compute one value from the other as
  1138. * the actual write length and user provided length may be
  1139. * different.
  1140. */
  1141. if (wc->w_large_pages) {
  1142. /*
  1143. * We only care about the 1st and last cluster within
  1144. * our range and whether they should be zero'd or not. Either
  1145. * value may be extended out to the start/end of a
  1146. * newly allocated cluster.
  1147. */
  1148. desc = &wc->w_desc[0];
  1149. if (desc->c_needs_zero)
  1150. ocfs2_figure_cluster_boundaries(osb,
  1151. desc->c_cpos,
  1152. &wc->w_target_from,
  1153. NULL);
  1154. desc = &wc->w_desc[wc->w_clen - 1];
  1155. if (desc->c_needs_zero)
  1156. ocfs2_figure_cluster_boundaries(osb,
  1157. desc->c_cpos,
  1158. NULL,
  1159. &wc->w_target_to);
  1160. } else {
  1161. wc->w_target_from = 0;
  1162. wc->w_target_to = PAGE_CACHE_SIZE;
  1163. }
  1164. }
  1165. /*
  1166. * Populate each single-cluster write descriptor in the write context
  1167. * with information about the i/o to be done.
  1168. *
  1169. * Returns the number of clusters that will have to be allocated, as
  1170. * well as a worst case estimate of the number of extent records that
  1171. * would have to be created during a write to an unwritten region.
  1172. */
  1173. static int ocfs2_populate_write_desc(struct inode *inode,
  1174. struct ocfs2_write_ctxt *wc,
  1175. unsigned int *clusters_to_alloc,
  1176. unsigned int *extents_to_split)
  1177. {
  1178. int ret;
  1179. struct ocfs2_write_cluster_desc *desc;
  1180. unsigned int num_clusters = 0;
  1181. unsigned int ext_flags = 0;
  1182. u32 phys = 0;
  1183. int i;
  1184. *clusters_to_alloc = 0;
  1185. *extents_to_split = 0;
  1186. for (i = 0; i < wc->w_clen; i++) {
  1187. desc = &wc->w_desc[i];
  1188. desc->c_cpos = wc->w_cpos + i;
  1189. if (num_clusters == 0) {
  1190. /*
  1191. * Need to look up the next extent record.
  1192. */
  1193. ret = ocfs2_get_clusters(inode, desc->c_cpos, &phys,
  1194. &num_clusters, &ext_flags);
  1195. if (ret) {
  1196. mlog_errno(ret);
  1197. goto out;
  1198. }
  1199. /* We should already CoW the refcountd extent. */
  1200. BUG_ON(ext_flags & OCFS2_EXT_REFCOUNTED);
  1201. /*
  1202. * Assume worst case - that we're writing in
  1203. * the middle of the extent.
  1204. *
  1205. * We can assume that the write proceeds from
  1206. * left to right, in which case the extent
  1207. * insert code is smart enough to coalesce the
  1208. * next splits into the previous records created.
  1209. */
  1210. if (ext_flags & OCFS2_EXT_UNWRITTEN)
  1211. *extents_to_split = *extents_to_split + 2;
  1212. } else if (phys) {
  1213. /*
  1214. * Only increment phys if it doesn't describe
  1215. * a hole.
  1216. */
  1217. phys++;
  1218. }
  1219. /*
  1220. * If w_first_new_cpos is < UINT_MAX, we have a non-sparse
  1221. * file that got extended. w_first_new_cpos tells us
  1222. * where the newly allocated clusters are so we can
  1223. * zero them.
  1224. */
  1225. if (desc->c_cpos >= wc->w_first_new_cpos) {
  1226. BUG_ON(phys == 0);
  1227. desc->c_needs_zero = 1;
  1228. }
  1229. desc->c_phys = phys;
  1230. if (phys == 0) {
  1231. desc->c_new = 1;
  1232. desc->c_needs_zero = 1;
  1233. *clusters_to_alloc = *clusters_to_alloc + 1;
  1234. }
  1235. if (ext_flags & OCFS2_EXT_UNWRITTEN) {
  1236. desc->c_unwritten = 1;
  1237. desc->c_needs_zero = 1;
  1238. }
  1239. num_clusters--;
  1240. }
  1241. ret = 0;
  1242. out:
  1243. return ret;
  1244. }
  1245. static int ocfs2_write_begin_inline(struct address_space *mapping,
  1246. struct inode *inode,
  1247. struct ocfs2_write_ctxt *wc)
  1248. {
  1249. int ret;
  1250. struct ocfs2_super *osb = OCFS2_SB(inode->i_sb);
  1251. struct page *page;
  1252. handle_t *handle;
  1253. struct ocfs2_dinode *di = (struct ocfs2_dinode *)wc->w_di_bh->b_data;
  1254. page = find_or_create_page(mapping, 0, GFP_NOFS);
  1255. if (!page) {
  1256. ret = -ENOMEM;
  1257. mlog_errno(ret);
  1258. goto out;
  1259. }
  1260. /*
  1261. * If we don't set w_num_pages then this page won't get unlocked
  1262. * and freed on cleanup of the write context.
  1263. */
  1264. wc->w_pages[0] = wc->w_target_page = page;
  1265. wc->w_num_pages = 1;
  1266. handle = ocfs2_start_trans(osb, OCFS2_INODE_UPDATE_CREDITS);
  1267. if (IS_ERR(handle)) {
  1268. ret = PTR_ERR(handle);
  1269. mlog_errno(ret);
  1270. goto out;
  1271. }
  1272. ret = ocfs2_journal_access_di(handle, INODE_CACHE(inode), wc->w_di_bh,
  1273. OCFS2_JOURNAL_ACCESS_WRITE);
  1274. if (ret) {
  1275. ocfs2_commit_trans(osb, handle);
  1276. mlog_errno(ret);
  1277. goto out;
  1278. }
  1279. if (!(OCFS2_I(inode)->ip_dyn_features & OCFS2_INLINE_DATA_FL))
  1280. ocfs2_set_inode_data_inline(inode, di);
  1281. if (!PageUptodate(page)) {
  1282. ret = ocfs2_read_inline_data(inode, page, wc->w_di_bh);
  1283. if (ret) {
  1284. ocfs2_commit_trans(osb, handle);
  1285. goto out;
  1286. }
  1287. }
  1288. wc->w_handle = handle;
  1289. out:
  1290. return ret;
  1291. }
  1292. int ocfs2_size_fits_inline_data(struct buffer_head *di_bh, u64 new_size)
  1293. {
  1294. struct ocfs2_dinode *di = (struct ocfs2_dinode *)di_bh->b_data;
  1295. if (new_size <= le16_to_cpu(di->id2.i_data.id_count))
  1296. return 1;
  1297. return 0;
  1298. }
  1299. static int ocfs2_try_to_write_inline_data(struct address_space *mapping,
  1300. struct inode *inode, loff_t pos,
  1301. unsigned len, struct page *mmap_page,
  1302. struct ocfs2_write_ctxt *wc)
  1303. {
  1304. int ret, written = 0;
  1305. loff_t end = pos + len;
  1306. struct ocfs2_inode_info *oi = OCFS2_I(inode);
  1307. struct ocfs2_dinode *di = NULL;
  1308. trace_ocfs2_try_to_write_inline_data((unsigned long long)oi->ip_blkno,
  1309. len, (unsigned long long)pos,
  1310. oi->ip_dyn_features);
  1311. /*
  1312. * Handle inodes which already have inline data 1st.
  1313. */
  1314. if (oi->ip_dyn_features & OCFS2_INLINE_DATA_FL) {
  1315. if (mmap_page == NULL &&
  1316. ocfs2_size_fits_inline_data(wc->w_di_bh, end))
  1317. goto do_inline_write;
  1318. /*
  1319. * The write won't fit - we have to give this inode an
  1320. * inline extent list now.
  1321. */
  1322. ret = ocfs2_convert_inline_data_to_extents(inode, wc->w_di_bh);
  1323. if (ret)
  1324. mlog_errno(ret);
  1325. goto out;
  1326. }
  1327. /*
  1328. * Check whether the inode can accept inline data.
  1329. */
  1330. if (oi->ip_clusters != 0 || i_size_read(inode) != 0)
  1331. return 0;
  1332. /*
  1333. * Check whether the write can fit.
  1334. */
  1335. di = (struct ocfs2_dinode *)wc->w_di_bh->b_data;
  1336. if (mmap_page ||
  1337. end > ocfs2_max_inline_data_with_xattr(inode->i_sb, di))
  1338. return 0;
  1339. do_inline_write:
  1340. ret = ocfs2_write_begin_inline(mapping, inode, wc);
  1341. if (ret) {
  1342. mlog_errno(ret);
  1343. goto out;
  1344. }
  1345. /*
  1346. * This signals to the caller that the data can be written
  1347. * inline.
  1348. */
  1349. written = 1;
  1350. out:
  1351. return written ? written : ret;
  1352. }
  1353. /*
  1354. * This function only does anything for file systems which can't
  1355. * handle sparse files.
  1356. *
  1357. * What we want to do here is fill in any hole between the current end
  1358. * of allocation and the end of our write. That way the rest of the
  1359. * write path can treat it as an non-allocating write, which has no
  1360. * special case code for sparse/nonsparse files.
  1361. */
  1362. static int ocfs2_expand_nonsparse_inode(struct inode *inode,
  1363. struct buffer_head *di_bh,
  1364. loff_t pos, unsigned len,
  1365. struct ocfs2_write_ctxt *wc)
  1366. {
  1367. int ret;
  1368. loff_t newsize = pos + len;
  1369. BUG_ON(ocfs2_sparse_alloc(OCFS2_SB(inode->i_sb)));
  1370. if (newsize <= i_size_read(inode))
  1371. return 0;
  1372. ret = ocfs2_extend_no_holes(inode, di_bh, newsize, pos);
  1373. if (ret)
  1374. mlog_errno(ret);
  1375. wc->w_first_new_cpos =
  1376. ocfs2_clusters_for_bytes(inode->i_sb, i_size_read(inode));
  1377. return ret;
  1378. }
  1379. static int ocfs2_zero_tail(struct inode *inode, struct buffer_head *di_bh,
  1380. loff_t pos)
  1381. {
  1382. int ret = 0;
  1383. BUG_ON(!ocfs2_sparse_alloc(OCFS2_SB(inode->i_sb)));
  1384. if (pos > i_size_read(inode))
  1385. ret = ocfs2_zero_extend(inode, di_bh, pos);
  1386. return ret;
  1387. }
  1388. /*
  1389. * Try to flush truncate logs if we can free enough clusters from it.
  1390. * As for return value, "< 0" means error, "0" no space and "1" means
  1391. * we have freed enough spaces and let the caller try to allocate again.
  1392. */
  1393. static int ocfs2_try_to_free_truncate_log(struct ocfs2_super *osb,
  1394. unsigned int needed)
  1395. {
  1396. tid_t target;
  1397. int ret = 0;
  1398. unsigned int truncated_clusters;
  1399. mutex_lock(&osb->osb_tl_inode->i_mutex);
  1400. truncated_clusters = osb->truncated_clusters;
  1401. mutex_unlock(&osb->osb_tl_inode->i_mutex);
  1402. /*
  1403. * Check whether we can succeed in allocating if we free
  1404. * the truncate log.
  1405. */
  1406. if (truncated_clusters < needed)
  1407. goto out;
  1408. ret = ocfs2_flush_truncate_log(osb);
  1409. if (ret) {
  1410. mlog_errno(ret);
  1411. goto out;
  1412. }
  1413. if (jbd2_journal_start_commit(osb->journal->j_journal, &target)) {
  1414. jbd2_log_wait_commit(osb->journal->j_journal, target);
  1415. ret = 1;
  1416. }
  1417. out:
  1418. return ret;
  1419. }
  1420. int ocfs2_write_begin_nolock(struct file *filp,
  1421. struct address_space *mapping,
  1422. loff_t pos, unsigned len, unsigned flags,
  1423. struct page **pagep, void **fsdata,
  1424. struct buffer_head *di_bh, struct page *mmap_page)
  1425. {
  1426. int ret, cluster_of_pages, credits = OCFS2_INODE_UPDATE_CREDITS;
  1427. unsigned int clusters_to_alloc, extents_to_split, clusters_need = 0;
  1428. struct ocfs2_write_ctxt *wc;
  1429. struct inode *inode = mapping->host;
  1430. struct ocfs2_super *osb = OCFS2_SB(inode->i_sb);
  1431. struct ocfs2_dinode *di;
  1432. struct ocfs2_alloc_context *data_ac = NULL;
  1433. struct ocfs2_alloc_context *meta_ac = NULL;
  1434. handle_t *handle;
  1435. struct ocfs2_extent_tree et;
  1436. int try_free = 1, ret1;
  1437. try_again:
  1438. ret = ocfs2_alloc_write_ctxt(&wc, osb, pos, len, di_bh);
  1439. if (ret) {
  1440. mlog_errno(ret);
  1441. return ret;
  1442. }
  1443. if (ocfs2_supports_inline_data(osb)) {
  1444. ret = ocfs2_try_to_write_inline_data(mapping, inode, pos, len,
  1445. mmap_page, wc);
  1446. if (ret == 1) {
  1447. ret = 0;
  1448. goto success;
  1449. }
  1450. if (ret < 0) {
  1451. mlog_errno(ret);
  1452. goto out;
  1453. }
  1454. }
  1455. if (ocfs2_sparse_alloc(osb))
  1456. ret = ocfs2_zero_tail(inode, di_bh, pos);
  1457. else
  1458. ret = ocfs2_expand_nonsparse_inode(inode, di_bh, pos, len,
  1459. wc);
  1460. if (ret) {
  1461. mlog_errno(ret);
  1462. goto out;
  1463. }
  1464. ret = ocfs2_check_range_for_refcount(inode, pos, len);
  1465. if (ret < 0) {
  1466. mlog_errno(ret);
  1467. goto out;
  1468. } else if (ret == 1) {
  1469. clusters_need = wc->w_clen;
  1470. ret = ocfs2_refcount_cow(inode, filp, di_bh,
  1471. wc->w_cpos, wc->w_clen, UINT_MAX);
  1472. if (ret) {
  1473. mlog_errno(ret);
  1474. goto out;
  1475. }
  1476. }
  1477. ret = ocfs2_populate_write_desc(inode, wc, &clusters_to_alloc,
  1478. &extents_to_split);
  1479. if (ret) {
  1480. mlog_errno(ret);
  1481. goto out;
  1482. }
  1483. clusters_need += clusters_to_alloc;
  1484. di = (struct ocfs2_dinode *)wc->w_di_bh->b_data;
  1485. trace_ocfs2_write_begin_nolock(
  1486. (unsigned long long)OCFS2_I(inode)->ip_blkno,
  1487. (long long)i_size_read(inode),
  1488. le32_to_cpu(di->i_clusters),
  1489. pos, len, flags, mmap_page,
  1490. clusters_to_alloc, extents_to_split);
  1491. /*
  1492. * We set w_target_from, w_target_to here so that
  1493. * ocfs2_write_end() knows which range in the target page to
  1494. * write out. An allocation requires that we write the entire
  1495. * cluster range.
  1496. */
  1497. if (clusters_to_alloc || extents_to_split) {
  1498. /*
  1499. * XXX: We are stretching the limits of
  1500. * ocfs2_lock_allocators(). It greatly over-estimates
  1501. * the work to be done.
  1502. */
  1503. ocfs2_init_dinode_extent_tree(&et, INODE_CACHE(inode),
  1504. wc->w_di_bh);
  1505. ret = ocfs2_lock_allocators(inode, &et,
  1506. clusters_to_alloc, extents_to_split,
  1507. &data_ac, &meta_ac);
  1508. if (ret) {
  1509. mlog_errno(ret);
  1510. goto out;
  1511. }
  1512. if (data_ac)
  1513. data_ac->ac_resv = &OCFS2_I(inode)->ip_la_data_resv;
  1514. credits = ocfs2_calc_extend_credits(inode->i_sb,
  1515. &di->id2.i_list,
  1516. clusters_to_alloc);
  1517. }
  1518. /*
  1519. * We have to zero sparse allocated clusters, unwritten extent clusters,
  1520. * and non-sparse clusters we just extended. For non-sparse writes,
  1521. * we know zeros will only be needed in the first and/or last cluster.
  1522. */
  1523. if (clusters_to_alloc || extents_to_split ||
  1524. (wc->w_clen && (wc->w_desc[0].c_needs_zero ||
  1525. wc->w_desc[wc->w_clen - 1].c_needs_zero)))
  1526. cluster_of_pages = 1;
  1527. else
  1528. cluster_of_pages = 0;
  1529. ocfs2_set_target_boundaries(osb, wc, pos, len, cluster_of_pages);
  1530. handle = ocfs2_start_trans(osb, credits);
  1531. if (IS_ERR(handle)) {
  1532. ret = PTR_ERR(handle);
  1533. mlog_errno(ret);
  1534. goto out;
  1535. }
  1536. wc->w_handle = handle;
  1537. if (clusters_to_alloc) {
  1538. ret = dquot_alloc_space_nodirty(inode,
  1539. ocfs2_clusters_to_bytes(osb->sb, clusters_to_alloc));
  1540. if (ret)
  1541. goto out_commit;
  1542. }
  1543. /*
  1544. * We don't want this to fail in ocfs2_write_end(), so do it
  1545. * here.
  1546. */
  1547. ret = ocfs2_journal_access_di(handle, INODE_CACHE(inode), wc->w_di_bh,
  1548. OCFS2_JOURNAL_ACCESS_WRITE);
  1549. if (ret) {
  1550. mlog_errno(ret);
  1551. goto out_quota;
  1552. }
  1553. /*
  1554. * Fill our page array first. That way we've grabbed enough so
  1555. * that we can zero and flush if we error after adding the
  1556. * extent.
  1557. */
  1558. ret = ocfs2_grab_pages_for_write(mapping, wc, wc->w_cpos, pos, len,
  1559. cluster_of_pages, mmap_page);
  1560. if (ret) {
  1561. mlog_errno(ret);
  1562. goto out_quota;
  1563. }
  1564. ret = ocfs2_write_cluster_by_desc(mapping, data_ac, meta_ac, wc, pos,
  1565. len);
  1566. if (ret) {
  1567. mlog_errno(ret);
  1568. goto out_quota;
  1569. }
  1570. if (data_ac)
  1571. ocfs2_free_alloc_context(data_ac);
  1572. if (meta_ac)
  1573. ocfs2_free_alloc_context(meta_ac);
  1574. success:
  1575. *pagep = wc->w_target_page;
  1576. *fsdata = wc;
  1577. return 0;
  1578. out_quota:
  1579. if (clusters_to_alloc)
  1580. dquot_free_space(inode,
  1581. ocfs2_clusters_to_bytes(osb->sb, clusters_to_alloc));
  1582. out_commit:
  1583. ocfs2_commit_trans(osb, handle);
  1584. out:
  1585. ocfs2_free_write_ctxt(wc);
  1586. if (data_ac)
  1587. ocfs2_free_alloc_context(data_ac);
  1588. if (meta_ac)
  1589. ocfs2_free_alloc_context(meta_ac);
  1590. if (ret == -ENOSPC && try_free) {
  1591. /*
  1592. * Try to free some truncate log so that we can have enough
  1593. * clusters to allocate.
  1594. */
  1595. try_free = 0;
  1596. ret1 = ocfs2_try_to_free_truncate_log(osb, clusters_need);
  1597. if (ret1 == 1)
  1598. goto try_again;
  1599. if (ret1 < 0)
  1600. mlog_errno(ret1);
  1601. }
  1602. return ret;
  1603. }
  1604. static int ocfs2_write_begin(struct file *file, struct address_space *mapping,
  1605. loff_t pos, unsigned len, unsigned flags,
  1606. struct page **pagep, void **fsdata)
  1607. {
  1608. int ret;
  1609. struct buffer_head *di_bh = NULL;
  1610. struct inode *inode = mapping->host;
  1611. ret = ocfs2_inode_lock(inode, &di_bh, 1);
  1612. if (ret) {
  1613. mlog_errno(ret);
  1614. return ret;
  1615. }
  1616. /*
  1617. * Take alloc sem here to prevent concurrent lookups. That way
  1618. * the mapping, zeroing and tree manipulation within
  1619. * ocfs2_write() will be safe against ->readpage(). This
  1620. * should also serve to lock out allocation from a shared
  1621. * writeable region.
  1622. */
  1623. down_write(&OCFS2_I(inode)->ip_alloc_sem);
  1624. ret = ocfs2_write_begin_nolock(file, mapping, pos, len, flags, pagep,
  1625. fsdata, di_bh, NULL);
  1626. if (ret) {
  1627. mlog_errno(ret);
  1628. goto out_fail;
  1629. }
  1630. brelse(di_bh);
  1631. return 0;
  1632. out_fail:
  1633. up_write(&OCFS2_I(inode)->ip_alloc_sem);
  1634. brelse(di_bh);
  1635. ocfs2_inode_unlock(inode, 1);
  1636. return ret;
  1637. }
  1638. static void ocfs2_write_end_inline(struct inode *inode, loff_t pos,
  1639. unsigned len, unsigned *copied,
  1640. struct ocfs2_dinode *di,
  1641. struct ocfs2_write_ctxt *wc)
  1642. {
  1643. void *kaddr;
  1644. if (unlikely(*copied < len)) {
  1645. if (!PageUptodate(wc->w_target_page)) {
  1646. *copied = 0;
  1647. return;
  1648. }
  1649. }
  1650. kaddr = kmap_atomic(wc->w_target_page, KM_USER0);
  1651. memcpy(di->id2.i_data.id_data + pos, kaddr + pos, *copied);
  1652. kunmap_atomic(kaddr, KM_USER0);
  1653. trace_ocfs2_write_end_inline(
  1654. (unsigned long long)OCFS2_I(inode)->ip_blkno,
  1655. (unsigned long long)pos, *copied,
  1656. le16_to_cpu(di->id2.i_data.id_count),
  1657. le16_to_cpu(di->i_dyn_features));
  1658. }
  1659. int ocfs2_write_end_nolock(struct address_space *mapping,
  1660. loff_t pos, unsigned len, unsigned copied,
  1661. struct page *page, void *fsdata)
  1662. {
  1663. int i;
  1664. unsigned from, to, start = pos & (PAGE_CACHE_SIZE - 1);
  1665. struct inode *inode = mapping->host;
  1666. struct ocfs2_super *osb = OCFS2_SB(inode->i_sb);
  1667. struct ocfs2_write_ctxt *wc = fsdata;
  1668. struct ocfs2_dinode *di = (struct ocfs2_dinode *)wc->w_di_bh->b_data;
  1669. handle_t *handle = wc->w_handle;
  1670. struct page *tmppage;
  1671. if (OCFS2_I(inode)->ip_dyn_features & OCFS2_INLINE_DATA_FL) {
  1672. ocfs2_write_end_inline(inode, pos, len, &copied, di, wc);
  1673. goto out_write_size;
  1674. }
  1675. if (unlikely(copied < len)) {
  1676. if (!PageUptodate(wc->w_target_page))
  1677. copied = 0;
  1678. ocfs2_zero_new_buffers(wc->w_target_page, start+copied,
  1679. start+len);
  1680. }
  1681. flush_dcache_page(wc->w_target_page);
  1682. for(i = 0; i < wc->w_num_pages; i++) {
  1683. tmppage = wc->w_pages[i];
  1684. if (tmppage == wc->w_target_page) {
  1685. from = wc->w_target_from;
  1686. to = wc->w_target_to;
  1687. BUG_ON(from > PAGE_CACHE_SIZE ||
  1688. to > PAGE_CACHE_SIZE ||
  1689. to < from);
  1690. } else {
  1691. /*
  1692. * Pages adjacent to the target (if any) imply
  1693. * a hole-filling write in which case we want
  1694. * to flush their entire range.
  1695. */
  1696. from = 0;
  1697. to = PAGE_CACHE_SIZE;
  1698. }
  1699. if (page_has_buffers(tmppage)) {
  1700. if (ocfs2_should_order_data(inode))
  1701. ocfs2_jbd2_file_inode(wc->w_handle, inode);
  1702. block_commit_write(tmppage, from, to);
  1703. }
  1704. }
  1705. out_write_size:
  1706. pos += copied;
  1707. if (pos > inode->i_size) {
  1708. i_size_write(inode, pos);
  1709. mark_inode_dirty(inode);
  1710. }
  1711. inode->i_blocks = ocfs2_inode_sector_count(inode);
  1712. di->i_size = cpu_to_le64((u64)i_size_read(inode));
  1713. inode->i_mtime = inode->i_ctime = CURRENT_TIME;
  1714. di->i_mtime = di->i_ctime = cpu_to_le64(inode->i_mtime.tv_sec);
  1715. di->i_mtime_nsec = di->i_ctime_nsec = cpu_to_le32(inode->i_mtime.tv_nsec);
  1716. ocfs2_journal_dirty(handle, wc->w_di_bh);
  1717. ocfs2_commit_trans(osb, handle);
  1718. ocfs2_run_deallocs(osb, &wc->w_dealloc);
  1719. ocfs2_free_write_ctxt(wc);
  1720. return copied;
  1721. }
  1722. static int ocfs2_write_end(struct file *file, struct address_space *mapping,
  1723. loff_t pos, unsigned len, unsigned copied,
  1724. struct page *page, void *fsdata)
  1725. {
  1726. int ret;
  1727. struct inode *inode = mapping->host;
  1728. ret = ocfs2_write_end_nolock(mapping, pos, len, copied, page, fsdata);
  1729. up_write(&OCFS2_I(inode)->ip_alloc_sem);
  1730. ocfs2_inode_unlock(inode, 1);
  1731. return ret;
  1732. }
  1733. const struct address_space_operations ocfs2_aops = {
  1734. .readpage = ocfs2_readpage,
  1735. .readpages = ocfs2_readpages,
  1736. .writepage = ocfs2_writepage,
  1737. .write_begin = ocfs2_write_begin,
  1738. .write_end = ocfs2_write_end,
  1739. .bmap = ocfs2_bmap,
  1740. .direct_IO = ocfs2_direct_IO,
  1741. .invalidatepage = ocfs2_invalidatepage,
  1742. .releasepage = ocfs2_releasepage,
  1743. .migratepage = buffer_migrate_page,
  1744. .is_partially_uptodate = block_is_partially_uptodate,
  1745. .error_remove_page = generic_error_remove_page,
  1746. };