xfs_inode.c 100 KB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130131132133134135136137138139140141142143144145146147148149150151152153154155156157158159160161162163164165166167168169170171172173174175176177178179180181182183184185186187188189190191192193194195196197198199200201202203204205206207208209210211212213214215216217218219220221222223224225226227228229230231232233234235236237238239240241242243244245246247248249250251252253254255256257258259260261262263264265266267268269270271272273274275276277278279280281282283284285286287288289290291292293294295296297298299300301302303304305306307308309310311312313314315316317318319320321322323324325326327328329330331332333334335336337338339340341342343344345346347348349350351352353354355356357358359360361362363364365366367368369370371372373374375376377378379380381382383384385386387388389390391392393394395396397398399400401402403404405406407408409410411412413414415416417418419420421422423424425426427428429430431432433434435436437438439440441442443444445446447448449450451452453454455456457458459460461462463464465466467468469470471472473474475476477478479480481482483484485486487488489490491492493494495496497498499500501502503504505506507508509510511512513514515516517518519520521522523524525526527528529530531532533534535536537538539540541542543544545546547548549550551552553554555556557558559560561562563564565566567568569570571572573574575576577578579580581582583584585586587588589590591592593594595596597598599600601602603604605606607608609610611612613614615616617618619620621622623624625626627628629630631632633634635636637638639640641642643644645646647648649650651652653654655656657658659660661662663664665666667668669670671672673674675676677678679680681682683684685686687688689690691692693694695696697698699700701702703704705706707708709710711712713714715716717718719720721722723724725726727728729730731732733734735736737738739740741742743744745746747748749750751752753754755756757758759760761762763764765766767768769770771772773774775776777778779780781782783784785786787788789790791792793794795796797798799800801802803804805806807808809810811812813814815816817818819820821822823824825826827828829830831832833834835836837838839840841842843844845846847848849850851852853854855856857858859860861862863864865866867868869870871872873874875876877878879880881882883884885886887888889890891892893894895896897898899900901902903904905906907908909910911912913914915916917918919920921922923924925926927928929930931932933934935936937938939940941942943944945946947948949950951952953954955956957958959960961962963964965966967968969970971972973974975976977978979980981982983984985986987988989990991992993994995996997998999100010011002100310041005100610071008100910101011101210131014101510161017101810191020102110221023102410251026102710281029103010311032103310341035103610371038103910401041104210431044104510461047104810491050105110521053105410551056105710581059106010611062106310641065106610671068106910701071107210731074107510761077107810791080108110821083108410851086108710881089109010911092109310941095109610971098109911001101110211031104110511061107110811091110111111121113111411151116111711181119112011211122112311241125112611271128112911301131113211331134113511361137113811391140114111421143114411451146114711481149115011511152115311541155115611571158115911601161116211631164116511661167116811691170117111721173117411751176117711781179118011811182118311841185118611871188118911901191119211931194119511961197119811991200120112021203120412051206120712081209121012111212121312141215121612171218121912201221122212231224122512261227122812291230123112321233123412351236123712381239124012411242124312441245124612471248124912501251125212531254125512561257125812591260126112621263126412651266126712681269127012711272127312741275127612771278127912801281128212831284128512861287128812891290129112921293129412951296129712981299130013011302130313041305130613071308130913101311131213131314131513161317131813191320132113221323132413251326132713281329133013311332133313341335133613371338133913401341134213431344134513461347134813491350135113521353135413551356135713581359136013611362136313641365136613671368136913701371137213731374137513761377137813791380138113821383138413851386138713881389139013911392139313941395139613971398139914001401140214031404140514061407140814091410141114121413141414151416141714181419142014211422142314241425142614271428142914301431143214331434143514361437143814391440144114421443144414451446144714481449145014511452145314541455145614571458145914601461146214631464146514661467146814691470147114721473147414751476147714781479148014811482148314841485148614871488148914901491149214931494149514961497149814991500150115021503150415051506150715081509151015111512151315141515151615171518151915201521152215231524152515261527152815291530153115321533153415351536153715381539154015411542154315441545154615471548154915501551155215531554155515561557155815591560156115621563156415651566156715681569157015711572157315741575157615771578157915801581158215831584158515861587158815891590159115921593159415951596159715981599160016011602160316041605160616071608160916101611161216131614161516161617161816191620162116221623162416251626162716281629163016311632163316341635163616371638163916401641164216431644164516461647164816491650165116521653165416551656165716581659166016611662166316641665166616671668166916701671167216731674167516761677167816791680168116821683168416851686168716881689169016911692169316941695169616971698169917001701170217031704170517061707170817091710171117121713171417151716171717181719172017211722172317241725172617271728172917301731173217331734173517361737173817391740174117421743174417451746174717481749175017511752175317541755175617571758175917601761176217631764176517661767176817691770177117721773177417751776177717781779178017811782178317841785178617871788178917901791179217931794179517961797179817991800180118021803180418051806180718081809181018111812181318141815181618171818181918201821182218231824182518261827182818291830183118321833183418351836183718381839184018411842184318441845184618471848184918501851185218531854185518561857185818591860186118621863186418651866186718681869187018711872187318741875187618771878187918801881188218831884188518861887188818891890189118921893189418951896189718981899190019011902190319041905190619071908190919101911191219131914191519161917191819191920192119221923192419251926192719281929193019311932193319341935193619371938193919401941194219431944194519461947194819491950195119521953195419551956195719581959196019611962196319641965196619671968196919701971197219731974197519761977197819791980198119821983198419851986198719881989199019911992199319941995199619971998199920002001200220032004200520062007200820092010201120122013201420152016201720182019202020212022202320242025202620272028202920302031203220332034203520362037203820392040204120422043204420452046204720482049205020512052205320542055205620572058205920602061206220632064206520662067206820692070207120722073207420752076207720782079208020812082208320842085208620872088208920902091209220932094209520962097209820992100210121022103210421052106210721082109211021112112211321142115211621172118211921202121212221232124212521262127212821292130213121322133213421352136213721382139214021412142214321442145214621472148214921502151215221532154215521562157215821592160216121622163216421652166216721682169217021712172217321742175217621772178217921802181218221832184218521862187218821892190219121922193219421952196219721982199220022012202220322042205220622072208220922102211221222132214221522162217221822192220222122222223222422252226222722282229223022312232223322342235223622372238223922402241224222432244224522462247224822492250225122522253225422552256225722582259226022612262226322642265226622672268226922702271227222732274227522762277227822792280228122822283228422852286228722882289229022912292229322942295229622972298229923002301230223032304230523062307230823092310231123122313231423152316231723182319232023212322232323242325232623272328232923302331233223332334233523362337233823392340234123422343234423452346234723482349235023512352235323542355235623572358235923602361236223632364236523662367236823692370237123722373237423752376237723782379238023812382238323842385238623872388238923902391239223932394239523962397239823992400240124022403240424052406240724082409241024112412241324142415241624172418241924202421242224232424242524262427242824292430243124322433243424352436243724382439244024412442244324442445244624472448244924502451245224532454245524562457245824592460246124622463246424652466246724682469247024712472247324742475247624772478247924802481248224832484248524862487248824892490249124922493249424952496249724982499250025012502250325042505250625072508250925102511251225132514251525162517251825192520252125222523252425252526252725282529253025312532253325342535253625372538253925402541254225432544254525462547254825492550255125522553255425552556255725582559256025612562256325642565256625672568256925702571257225732574257525762577257825792580258125822583258425852586258725882589259025912592259325942595259625972598259926002601260226032604260526062607260826092610261126122613261426152616261726182619262026212622262326242625262626272628262926302631263226332634263526362637263826392640264126422643264426452646264726482649265026512652265326542655265626572658265926602661266226632664266526662667266826692670267126722673267426752676267726782679268026812682268326842685268626872688268926902691269226932694269526962697269826992700270127022703270427052706270727082709271027112712271327142715271627172718271927202721272227232724272527262727272827292730273127322733273427352736273727382739274027412742274327442745274627472748274927502751275227532754275527562757275827592760276127622763276427652766276727682769277027712772277327742775277627772778277927802781278227832784278527862787278827892790279127922793279427952796279727982799280028012802280328042805280628072808280928102811281228132814281528162817281828192820282128222823282428252826282728282829283028312832283328342835283628372838283928402841284228432844284528462847284828492850285128522853285428552856285728582859286028612862286328642865286628672868286928702871287228732874287528762877287828792880288128822883288428852886288728882889289028912892289328942895289628972898289929002901290229032904290529062907290829092910291129122913291429152916291729182919292029212922292329242925292629272928292929302931293229332934293529362937293829392940294129422943294429452946294729482949295029512952295329542955295629572958295929602961296229632964296529662967296829692970297129722973297429752976297729782979298029812982298329842985298629872988298929902991299229932994299529962997299829993000300130023003300430053006300730083009301030113012301330143015301630173018301930203021302230233024302530263027302830293030303130323033303430353036303730383039304030413042304330443045304630473048304930503051305230533054305530563057305830593060306130623063306430653066306730683069307030713072307330743075307630773078307930803081308230833084308530863087308830893090309130923093309430953096309730983099310031013102310331043105310631073108310931103111311231133114311531163117311831193120312131223123312431253126312731283129313031313132313331343135313631373138313931403141314231433144314531463147314831493150315131523153315431553156315731583159316031613162316331643165316631673168316931703171317231733174317531763177317831793180318131823183318431853186318731883189319031913192319331943195319631973198319932003201320232033204320532063207320832093210321132123213321432153216321732183219322032213222322332243225322632273228322932303231323232333234323532363237323832393240324132423243324432453246324732483249325032513252325332543255325632573258325932603261326232633264326532663267326832693270327132723273327432753276327732783279328032813282328332843285328632873288328932903291329232933294329532963297329832993300330133023303330433053306330733083309331033113312331333143315331633173318331933203321332233233324332533263327332833293330333133323333333433353336333733383339334033413342334333443345334633473348334933503351335233533354335533563357335833593360336133623363336433653366336733683369337033713372337333743375337633773378337933803381338233833384338533863387338833893390339133923393339433953396339733983399340034013402340334043405340634073408340934103411341234133414341534163417341834193420342134223423342434253426342734283429343034313432343334343435343634373438343934403441344234433444344534463447344834493450345134523453345434553456345734583459346034613462346334643465346634673468346934703471347234733474347534763477347834793480348134823483348434853486348734883489349034913492349334943495349634973498349935003501350235033504350535063507350835093510351135123513351435153516351735183519352035213522352335243525352635273528352935303531353235333534353535363537353835393540354135423543354435453546354735483549355035513552355335543555355635573558355935603561356235633564356535663567356835693570357135723573357435753576357735783579358035813582358335843585358635873588358935903591359235933594359535963597359835993600360136023603360436053606360736083609361036113612361336143615361636173618361936203621362236233624362536263627362836293630363136323633363436353636363736383639364036413642364336443645364636473648364936503651365236533654365536563657365836593660366136623663366436653666366736683669367036713672367336743675
  1. /*
  2. * Copyright (c) 2000-2006 Silicon Graphics, Inc.
  3. * All Rights Reserved.
  4. *
  5. * This program is free software; you can redistribute it and/or
  6. * modify it under the terms of the GNU General Public License as
  7. * published by the Free Software Foundation.
  8. *
  9. * This program is distributed in the hope that it would be useful,
  10. * but WITHOUT ANY WARRANTY; without even the implied warranty of
  11. * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
  12. * GNU General Public License for more details.
  13. *
  14. * You should have received a copy of the GNU General Public License
  15. * along with this program; if not, write the Free Software Foundation,
  16. * Inc., 51 Franklin St, Fifth Floor, Boston, MA 02110-1301 USA
  17. */
  18. #include <linux/log2.h>
  19. #include <linux/iversion.h>
  20. #include "xfs.h"
  21. #include "xfs_fs.h"
  22. #include "xfs_shared.h"
  23. #include "xfs_format.h"
  24. #include "xfs_log_format.h"
  25. #include "xfs_trans_resv.h"
  26. #include "xfs_sb.h"
  27. #include "xfs_mount.h"
  28. #include "xfs_defer.h"
  29. #include "xfs_inode.h"
  30. #include "xfs_da_format.h"
  31. #include "xfs_da_btree.h"
  32. #include "xfs_dir2.h"
  33. #include "xfs_attr_sf.h"
  34. #include "xfs_attr.h"
  35. #include "xfs_trans_space.h"
  36. #include "xfs_trans.h"
  37. #include "xfs_buf_item.h"
  38. #include "xfs_inode_item.h"
  39. #include "xfs_ialloc.h"
  40. #include "xfs_bmap.h"
  41. #include "xfs_bmap_util.h"
  42. #include "xfs_errortag.h"
  43. #include "xfs_error.h"
  44. #include "xfs_quota.h"
  45. #include "xfs_filestream.h"
  46. #include "xfs_cksum.h"
  47. #include "xfs_trace.h"
  48. #include "xfs_icache.h"
  49. #include "xfs_symlink.h"
  50. #include "xfs_trans_priv.h"
  51. #include "xfs_log.h"
  52. #include "xfs_bmap_btree.h"
  53. #include "xfs_reflink.h"
  54. #include "xfs_dir2_priv.h"
  55. kmem_zone_t *xfs_inode_zone;
  56. /*
  57. * Used in xfs_itruncate_extents(). This is the maximum number of extents
  58. * freed from a file in a single transaction.
  59. */
  60. #define XFS_ITRUNC_MAX_EXTENTS 2
  61. STATIC int xfs_iflush_int(struct xfs_inode *, struct xfs_buf *);
  62. STATIC int xfs_iunlink(struct xfs_trans *, struct xfs_inode *);
  63. STATIC int xfs_iunlink_remove(struct xfs_trans *, struct xfs_inode *);
  64. /*
  65. * helper function to extract extent size hint from inode
  66. */
  67. xfs_extlen_t
  68. xfs_get_extsz_hint(
  69. struct xfs_inode *ip)
  70. {
  71. if ((ip->i_d.di_flags & XFS_DIFLAG_EXTSIZE) && ip->i_d.di_extsize)
  72. return ip->i_d.di_extsize;
  73. if (XFS_IS_REALTIME_INODE(ip))
  74. return ip->i_mount->m_sb.sb_rextsize;
  75. return 0;
  76. }
  77. /*
  78. * Helper function to extract CoW extent size hint from inode.
  79. * Between the extent size hint and the CoW extent size hint, we
  80. * return the greater of the two. If the value is zero (automatic),
  81. * use the default size.
  82. */
  83. xfs_extlen_t
  84. xfs_get_cowextsz_hint(
  85. struct xfs_inode *ip)
  86. {
  87. xfs_extlen_t a, b;
  88. a = 0;
  89. if (ip->i_d.di_flags2 & XFS_DIFLAG2_COWEXTSIZE)
  90. a = ip->i_d.di_cowextsize;
  91. b = xfs_get_extsz_hint(ip);
  92. a = max(a, b);
  93. if (a == 0)
  94. return XFS_DEFAULT_COWEXTSZ_HINT;
  95. return a;
  96. }
  97. /*
  98. * These two are wrapper routines around the xfs_ilock() routine used to
  99. * centralize some grungy code. They are used in places that wish to lock the
  100. * inode solely for reading the extents. The reason these places can't just
  101. * call xfs_ilock(ip, XFS_ILOCK_SHARED) is that the inode lock also guards to
  102. * bringing in of the extents from disk for a file in b-tree format. If the
  103. * inode is in b-tree format, then we need to lock the inode exclusively until
  104. * the extents are read in. Locking it exclusively all the time would limit
  105. * our parallelism unnecessarily, though. What we do instead is check to see
  106. * if the extents have been read in yet, and only lock the inode exclusively
  107. * if they have not.
  108. *
  109. * The functions return a value which should be given to the corresponding
  110. * xfs_iunlock() call.
  111. */
  112. uint
  113. xfs_ilock_data_map_shared(
  114. struct xfs_inode *ip)
  115. {
  116. uint lock_mode = XFS_ILOCK_SHARED;
  117. if (ip->i_d.di_format == XFS_DINODE_FMT_BTREE &&
  118. (ip->i_df.if_flags & XFS_IFEXTENTS) == 0)
  119. lock_mode = XFS_ILOCK_EXCL;
  120. xfs_ilock(ip, lock_mode);
  121. return lock_mode;
  122. }
  123. uint
  124. xfs_ilock_attr_map_shared(
  125. struct xfs_inode *ip)
  126. {
  127. uint lock_mode = XFS_ILOCK_SHARED;
  128. if (ip->i_d.di_aformat == XFS_DINODE_FMT_BTREE &&
  129. (ip->i_afp->if_flags & XFS_IFEXTENTS) == 0)
  130. lock_mode = XFS_ILOCK_EXCL;
  131. xfs_ilock(ip, lock_mode);
  132. return lock_mode;
  133. }
  134. /*
  135. * In addition to i_rwsem in the VFS inode, the xfs inode contains 2
  136. * multi-reader locks: i_mmap_lock and the i_lock. This routine allows
  137. * various combinations of the locks to be obtained.
  138. *
  139. * The 3 locks should always be ordered so that the IO lock is obtained first,
  140. * the mmap lock second and the ilock last in order to prevent deadlock.
  141. *
  142. * Basic locking order:
  143. *
  144. * i_rwsem -> i_mmap_lock -> page_lock -> i_ilock
  145. *
  146. * mmap_sem locking order:
  147. *
  148. * i_rwsem -> page lock -> mmap_sem
  149. * mmap_sem -> i_mmap_lock -> page_lock
  150. *
  151. * The difference in mmap_sem locking order mean that we cannot hold the
  152. * i_mmap_lock over syscall based read(2)/write(2) based IO. These IO paths can
  153. * fault in pages during copy in/out (for buffered IO) or require the mmap_sem
  154. * in get_user_pages() to map the user pages into the kernel address space for
  155. * direct IO. Similarly the i_rwsem cannot be taken inside a page fault because
  156. * page faults already hold the mmap_sem.
  157. *
  158. * Hence to serialise fully against both syscall and mmap based IO, we need to
  159. * take both the i_rwsem and the i_mmap_lock. These locks should *only* be both
  160. * taken in places where we need to invalidate the page cache in a race
  161. * free manner (e.g. truncate, hole punch and other extent manipulation
  162. * functions).
  163. */
  164. void
  165. xfs_ilock(
  166. xfs_inode_t *ip,
  167. uint lock_flags)
  168. {
  169. trace_xfs_ilock(ip, lock_flags, _RET_IP_);
  170. /*
  171. * You can't set both SHARED and EXCL for the same lock,
  172. * and only XFS_IOLOCK_SHARED, XFS_IOLOCK_EXCL, XFS_ILOCK_SHARED,
  173. * and XFS_ILOCK_EXCL are valid values to set in lock_flags.
  174. */
  175. ASSERT((lock_flags & (XFS_IOLOCK_SHARED | XFS_IOLOCK_EXCL)) !=
  176. (XFS_IOLOCK_SHARED | XFS_IOLOCK_EXCL));
  177. ASSERT((lock_flags & (XFS_MMAPLOCK_SHARED | XFS_MMAPLOCK_EXCL)) !=
  178. (XFS_MMAPLOCK_SHARED | XFS_MMAPLOCK_EXCL));
  179. ASSERT((lock_flags & (XFS_ILOCK_SHARED | XFS_ILOCK_EXCL)) !=
  180. (XFS_ILOCK_SHARED | XFS_ILOCK_EXCL));
  181. ASSERT((lock_flags & ~(XFS_LOCK_MASK | XFS_LOCK_SUBCLASS_MASK)) == 0);
  182. if (lock_flags & XFS_IOLOCK_EXCL) {
  183. down_write_nested(&VFS_I(ip)->i_rwsem,
  184. XFS_IOLOCK_DEP(lock_flags));
  185. } else if (lock_flags & XFS_IOLOCK_SHARED) {
  186. down_read_nested(&VFS_I(ip)->i_rwsem,
  187. XFS_IOLOCK_DEP(lock_flags));
  188. }
  189. if (lock_flags & XFS_MMAPLOCK_EXCL)
  190. mrupdate_nested(&ip->i_mmaplock, XFS_MMAPLOCK_DEP(lock_flags));
  191. else if (lock_flags & XFS_MMAPLOCK_SHARED)
  192. mraccess_nested(&ip->i_mmaplock, XFS_MMAPLOCK_DEP(lock_flags));
  193. if (lock_flags & XFS_ILOCK_EXCL)
  194. mrupdate_nested(&ip->i_lock, XFS_ILOCK_DEP(lock_flags));
  195. else if (lock_flags & XFS_ILOCK_SHARED)
  196. mraccess_nested(&ip->i_lock, XFS_ILOCK_DEP(lock_flags));
  197. }
  198. /*
  199. * This is just like xfs_ilock(), except that the caller
  200. * is guaranteed not to sleep. It returns 1 if it gets
  201. * the requested locks and 0 otherwise. If the IO lock is
  202. * obtained but the inode lock cannot be, then the IO lock
  203. * is dropped before returning.
  204. *
  205. * ip -- the inode being locked
  206. * lock_flags -- this parameter indicates the inode's locks to be
  207. * to be locked. See the comment for xfs_ilock() for a list
  208. * of valid values.
  209. */
  210. int
  211. xfs_ilock_nowait(
  212. xfs_inode_t *ip,
  213. uint lock_flags)
  214. {
  215. trace_xfs_ilock_nowait(ip, lock_flags, _RET_IP_);
  216. /*
  217. * You can't set both SHARED and EXCL for the same lock,
  218. * and only XFS_IOLOCK_SHARED, XFS_IOLOCK_EXCL, XFS_ILOCK_SHARED,
  219. * and XFS_ILOCK_EXCL are valid values to set in lock_flags.
  220. */
  221. ASSERT((lock_flags & (XFS_IOLOCK_SHARED | XFS_IOLOCK_EXCL)) !=
  222. (XFS_IOLOCK_SHARED | XFS_IOLOCK_EXCL));
  223. ASSERT((lock_flags & (XFS_MMAPLOCK_SHARED | XFS_MMAPLOCK_EXCL)) !=
  224. (XFS_MMAPLOCK_SHARED | XFS_MMAPLOCK_EXCL));
  225. ASSERT((lock_flags & (XFS_ILOCK_SHARED | XFS_ILOCK_EXCL)) !=
  226. (XFS_ILOCK_SHARED | XFS_ILOCK_EXCL));
  227. ASSERT((lock_flags & ~(XFS_LOCK_MASK | XFS_LOCK_SUBCLASS_MASK)) == 0);
  228. if (lock_flags & XFS_IOLOCK_EXCL) {
  229. if (!down_write_trylock(&VFS_I(ip)->i_rwsem))
  230. goto out;
  231. } else if (lock_flags & XFS_IOLOCK_SHARED) {
  232. if (!down_read_trylock(&VFS_I(ip)->i_rwsem))
  233. goto out;
  234. }
  235. if (lock_flags & XFS_MMAPLOCK_EXCL) {
  236. if (!mrtryupdate(&ip->i_mmaplock))
  237. goto out_undo_iolock;
  238. } else if (lock_flags & XFS_MMAPLOCK_SHARED) {
  239. if (!mrtryaccess(&ip->i_mmaplock))
  240. goto out_undo_iolock;
  241. }
  242. if (lock_flags & XFS_ILOCK_EXCL) {
  243. if (!mrtryupdate(&ip->i_lock))
  244. goto out_undo_mmaplock;
  245. } else if (lock_flags & XFS_ILOCK_SHARED) {
  246. if (!mrtryaccess(&ip->i_lock))
  247. goto out_undo_mmaplock;
  248. }
  249. return 1;
  250. out_undo_mmaplock:
  251. if (lock_flags & XFS_MMAPLOCK_EXCL)
  252. mrunlock_excl(&ip->i_mmaplock);
  253. else if (lock_flags & XFS_MMAPLOCK_SHARED)
  254. mrunlock_shared(&ip->i_mmaplock);
  255. out_undo_iolock:
  256. if (lock_flags & XFS_IOLOCK_EXCL)
  257. up_write(&VFS_I(ip)->i_rwsem);
  258. else if (lock_flags & XFS_IOLOCK_SHARED)
  259. up_read(&VFS_I(ip)->i_rwsem);
  260. out:
  261. return 0;
  262. }
  263. /*
  264. * xfs_iunlock() is used to drop the inode locks acquired with
  265. * xfs_ilock() and xfs_ilock_nowait(). The caller must pass
  266. * in the flags given to xfs_ilock() or xfs_ilock_nowait() so
  267. * that we know which locks to drop.
  268. *
  269. * ip -- the inode being unlocked
  270. * lock_flags -- this parameter indicates the inode's locks to be
  271. * to be unlocked. See the comment for xfs_ilock() for a list
  272. * of valid values for this parameter.
  273. *
  274. */
  275. void
  276. xfs_iunlock(
  277. xfs_inode_t *ip,
  278. uint lock_flags)
  279. {
  280. /*
  281. * You can't set both SHARED and EXCL for the same lock,
  282. * and only XFS_IOLOCK_SHARED, XFS_IOLOCK_EXCL, XFS_ILOCK_SHARED,
  283. * and XFS_ILOCK_EXCL are valid values to set in lock_flags.
  284. */
  285. ASSERT((lock_flags & (XFS_IOLOCK_SHARED | XFS_IOLOCK_EXCL)) !=
  286. (XFS_IOLOCK_SHARED | XFS_IOLOCK_EXCL));
  287. ASSERT((lock_flags & (XFS_MMAPLOCK_SHARED | XFS_MMAPLOCK_EXCL)) !=
  288. (XFS_MMAPLOCK_SHARED | XFS_MMAPLOCK_EXCL));
  289. ASSERT((lock_flags & (XFS_ILOCK_SHARED | XFS_ILOCK_EXCL)) !=
  290. (XFS_ILOCK_SHARED | XFS_ILOCK_EXCL));
  291. ASSERT((lock_flags & ~(XFS_LOCK_MASK | XFS_LOCK_SUBCLASS_MASK)) == 0);
  292. ASSERT(lock_flags != 0);
  293. if (lock_flags & XFS_IOLOCK_EXCL)
  294. up_write(&VFS_I(ip)->i_rwsem);
  295. else if (lock_flags & XFS_IOLOCK_SHARED)
  296. up_read(&VFS_I(ip)->i_rwsem);
  297. if (lock_flags & XFS_MMAPLOCK_EXCL)
  298. mrunlock_excl(&ip->i_mmaplock);
  299. else if (lock_flags & XFS_MMAPLOCK_SHARED)
  300. mrunlock_shared(&ip->i_mmaplock);
  301. if (lock_flags & XFS_ILOCK_EXCL)
  302. mrunlock_excl(&ip->i_lock);
  303. else if (lock_flags & XFS_ILOCK_SHARED)
  304. mrunlock_shared(&ip->i_lock);
  305. trace_xfs_iunlock(ip, lock_flags, _RET_IP_);
  306. }
  307. /*
  308. * give up write locks. the i/o lock cannot be held nested
  309. * if it is being demoted.
  310. */
  311. void
  312. xfs_ilock_demote(
  313. xfs_inode_t *ip,
  314. uint lock_flags)
  315. {
  316. ASSERT(lock_flags & (XFS_IOLOCK_EXCL|XFS_MMAPLOCK_EXCL|XFS_ILOCK_EXCL));
  317. ASSERT((lock_flags &
  318. ~(XFS_IOLOCK_EXCL|XFS_MMAPLOCK_EXCL|XFS_ILOCK_EXCL)) == 0);
  319. if (lock_flags & XFS_ILOCK_EXCL)
  320. mrdemote(&ip->i_lock);
  321. if (lock_flags & XFS_MMAPLOCK_EXCL)
  322. mrdemote(&ip->i_mmaplock);
  323. if (lock_flags & XFS_IOLOCK_EXCL)
  324. downgrade_write(&VFS_I(ip)->i_rwsem);
  325. trace_xfs_ilock_demote(ip, lock_flags, _RET_IP_);
  326. }
  327. #if defined(DEBUG) || defined(XFS_WARN)
  328. int
  329. xfs_isilocked(
  330. xfs_inode_t *ip,
  331. uint lock_flags)
  332. {
  333. if (lock_flags & (XFS_ILOCK_EXCL|XFS_ILOCK_SHARED)) {
  334. if (!(lock_flags & XFS_ILOCK_SHARED))
  335. return !!ip->i_lock.mr_writer;
  336. return rwsem_is_locked(&ip->i_lock.mr_lock);
  337. }
  338. if (lock_flags & (XFS_MMAPLOCK_EXCL|XFS_MMAPLOCK_SHARED)) {
  339. if (!(lock_flags & XFS_MMAPLOCK_SHARED))
  340. return !!ip->i_mmaplock.mr_writer;
  341. return rwsem_is_locked(&ip->i_mmaplock.mr_lock);
  342. }
  343. if (lock_flags & (XFS_IOLOCK_EXCL|XFS_IOLOCK_SHARED)) {
  344. if (!(lock_flags & XFS_IOLOCK_SHARED))
  345. return !debug_locks ||
  346. lockdep_is_held_type(&VFS_I(ip)->i_rwsem, 0);
  347. return rwsem_is_locked(&VFS_I(ip)->i_rwsem);
  348. }
  349. ASSERT(0);
  350. return 0;
  351. }
  352. #endif
  353. /*
  354. * xfs_lockdep_subclass_ok() is only used in an ASSERT, so is only called when
  355. * DEBUG or XFS_WARN is set. And MAX_LOCKDEP_SUBCLASSES is then only defined
  356. * when CONFIG_LOCKDEP is set. Hence the complex define below to avoid build
  357. * errors and warnings.
  358. */
  359. #if (defined(DEBUG) || defined(XFS_WARN)) && defined(CONFIG_LOCKDEP)
  360. static bool
  361. xfs_lockdep_subclass_ok(
  362. int subclass)
  363. {
  364. return subclass < MAX_LOCKDEP_SUBCLASSES;
  365. }
  366. #else
  367. #define xfs_lockdep_subclass_ok(subclass) (true)
  368. #endif
  369. /*
  370. * Bump the subclass so xfs_lock_inodes() acquires each lock with a different
  371. * value. This can be called for any type of inode lock combination, including
  372. * parent locking. Care must be taken to ensure we don't overrun the subclass
  373. * storage fields in the class mask we build.
  374. */
  375. static inline int
  376. xfs_lock_inumorder(int lock_mode, int subclass)
  377. {
  378. int class = 0;
  379. ASSERT(!(lock_mode & (XFS_ILOCK_PARENT | XFS_ILOCK_RTBITMAP |
  380. XFS_ILOCK_RTSUM)));
  381. ASSERT(xfs_lockdep_subclass_ok(subclass));
  382. if (lock_mode & (XFS_IOLOCK_SHARED|XFS_IOLOCK_EXCL)) {
  383. ASSERT(subclass <= XFS_IOLOCK_MAX_SUBCLASS);
  384. class += subclass << XFS_IOLOCK_SHIFT;
  385. }
  386. if (lock_mode & (XFS_MMAPLOCK_SHARED|XFS_MMAPLOCK_EXCL)) {
  387. ASSERT(subclass <= XFS_MMAPLOCK_MAX_SUBCLASS);
  388. class += subclass << XFS_MMAPLOCK_SHIFT;
  389. }
  390. if (lock_mode & (XFS_ILOCK_SHARED|XFS_ILOCK_EXCL)) {
  391. ASSERT(subclass <= XFS_ILOCK_MAX_SUBCLASS);
  392. class += subclass << XFS_ILOCK_SHIFT;
  393. }
  394. return (lock_mode & ~XFS_LOCK_SUBCLASS_MASK) | class;
  395. }
  396. /*
  397. * The following routine will lock n inodes in exclusive mode. We assume the
  398. * caller calls us with the inodes in i_ino order.
  399. *
  400. * We need to detect deadlock where an inode that we lock is in the AIL and we
  401. * start waiting for another inode that is locked by a thread in a long running
  402. * transaction (such as truncate). This can result in deadlock since the long
  403. * running trans might need to wait for the inode we just locked in order to
  404. * push the tail and free space in the log.
  405. *
  406. * xfs_lock_inodes() can only be used to lock one type of lock at a time -
  407. * the iolock, the mmaplock or the ilock, but not more than one at a time. If we
  408. * lock more than one at a time, lockdep will report false positives saying we
  409. * have violated locking orders.
  410. */
  411. static void
  412. xfs_lock_inodes(
  413. xfs_inode_t **ips,
  414. int inodes,
  415. uint lock_mode)
  416. {
  417. int attempts = 0, i, j, try_lock;
  418. xfs_log_item_t *lp;
  419. /*
  420. * Currently supports between 2 and 5 inodes with exclusive locking. We
  421. * support an arbitrary depth of locking here, but absolute limits on
  422. * inodes depend on the the type of locking and the limits placed by
  423. * lockdep annotations in xfs_lock_inumorder. These are all checked by
  424. * the asserts.
  425. */
  426. ASSERT(ips && inodes >= 2 && inodes <= 5);
  427. ASSERT(lock_mode & (XFS_IOLOCK_EXCL | XFS_MMAPLOCK_EXCL |
  428. XFS_ILOCK_EXCL));
  429. ASSERT(!(lock_mode & (XFS_IOLOCK_SHARED | XFS_MMAPLOCK_SHARED |
  430. XFS_ILOCK_SHARED)));
  431. ASSERT(!(lock_mode & XFS_MMAPLOCK_EXCL) ||
  432. inodes <= XFS_MMAPLOCK_MAX_SUBCLASS + 1);
  433. ASSERT(!(lock_mode & XFS_ILOCK_EXCL) ||
  434. inodes <= XFS_ILOCK_MAX_SUBCLASS + 1);
  435. if (lock_mode & XFS_IOLOCK_EXCL) {
  436. ASSERT(!(lock_mode & (XFS_MMAPLOCK_EXCL | XFS_ILOCK_EXCL)));
  437. } else if (lock_mode & XFS_MMAPLOCK_EXCL)
  438. ASSERT(!(lock_mode & XFS_ILOCK_EXCL));
  439. try_lock = 0;
  440. i = 0;
  441. again:
  442. for (; i < inodes; i++) {
  443. ASSERT(ips[i]);
  444. if (i && (ips[i] == ips[i - 1])) /* Already locked */
  445. continue;
  446. /*
  447. * If try_lock is not set yet, make sure all locked inodes are
  448. * not in the AIL. If any are, set try_lock to be used later.
  449. */
  450. if (!try_lock) {
  451. for (j = (i - 1); j >= 0 && !try_lock; j--) {
  452. lp = (xfs_log_item_t *)ips[j]->i_itemp;
  453. if (lp && (lp->li_flags & XFS_LI_IN_AIL))
  454. try_lock++;
  455. }
  456. }
  457. /*
  458. * If any of the previous locks we have locked is in the AIL,
  459. * we must TRY to get the second and subsequent locks. If
  460. * we can't get any, we must release all we have
  461. * and try again.
  462. */
  463. if (!try_lock) {
  464. xfs_ilock(ips[i], xfs_lock_inumorder(lock_mode, i));
  465. continue;
  466. }
  467. /* try_lock means we have an inode locked that is in the AIL. */
  468. ASSERT(i != 0);
  469. if (xfs_ilock_nowait(ips[i], xfs_lock_inumorder(lock_mode, i)))
  470. continue;
  471. /*
  472. * Unlock all previous guys and try again. xfs_iunlock will try
  473. * to push the tail if the inode is in the AIL.
  474. */
  475. attempts++;
  476. for (j = i - 1; j >= 0; j--) {
  477. /*
  478. * Check to see if we've already unlocked this one. Not
  479. * the first one going back, and the inode ptr is the
  480. * same.
  481. */
  482. if (j != (i - 1) && ips[j] == ips[j + 1])
  483. continue;
  484. xfs_iunlock(ips[j], lock_mode);
  485. }
  486. if ((attempts % 5) == 0) {
  487. delay(1); /* Don't just spin the CPU */
  488. }
  489. i = 0;
  490. try_lock = 0;
  491. goto again;
  492. }
  493. }
  494. /*
  495. * xfs_lock_two_inodes() can only be used to lock one type of lock at a time -
  496. * the mmaplock or the ilock, but not more than one type at a time. If we lock
  497. * more than one at a time, lockdep will report false positives saying we have
  498. * violated locking orders. The iolock must be double-locked separately since
  499. * we use i_rwsem for that. We now support taking one lock EXCL and the other
  500. * SHARED.
  501. */
  502. void
  503. xfs_lock_two_inodes(
  504. struct xfs_inode *ip0,
  505. uint ip0_mode,
  506. struct xfs_inode *ip1,
  507. uint ip1_mode)
  508. {
  509. struct xfs_inode *temp;
  510. uint mode_temp;
  511. int attempts = 0;
  512. xfs_log_item_t *lp;
  513. ASSERT(hweight32(ip0_mode) == 1);
  514. ASSERT(hweight32(ip1_mode) == 1);
  515. ASSERT(!(ip0_mode & (XFS_IOLOCK_SHARED|XFS_IOLOCK_EXCL)));
  516. ASSERT(!(ip1_mode & (XFS_IOLOCK_SHARED|XFS_IOLOCK_EXCL)));
  517. ASSERT(!(ip0_mode & (XFS_MMAPLOCK_SHARED|XFS_MMAPLOCK_EXCL)) ||
  518. !(ip0_mode & (XFS_ILOCK_SHARED|XFS_ILOCK_EXCL)));
  519. ASSERT(!(ip1_mode & (XFS_MMAPLOCK_SHARED|XFS_MMAPLOCK_EXCL)) ||
  520. !(ip1_mode & (XFS_ILOCK_SHARED|XFS_ILOCK_EXCL)));
  521. ASSERT(!(ip1_mode & (XFS_MMAPLOCK_SHARED|XFS_MMAPLOCK_EXCL)) ||
  522. !(ip0_mode & (XFS_ILOCK_SHARED|XFS_ILOCK_EXCL)));
  523. ASSERT(!(ip0_mode & (XFS_MMAPLOCK_SHARED|XFS_MMAPLOCK_EXCL)) ||
  524. !(ip1_mode & (XFS_ILOCK_SHARED|XFS_ILOCK_EXCL)));
  525. ASSERT(ip0->i_ino != ip1->i_ino);
  526. if (ip0->i_ino > ip1->i_ino) {
  527. temp = ip0;
  528. ip0 = ip1;
  529. ip1 = temp;
  530. mode_temp = ip0_mode;
  531. ip0_mode = ip1_mode;
  532. ip1_mode = mode_temp;
  533. }
  534. again:
  535. xfs_ilock(ip0, xfs_lock_inumorder(ip0_mode, 0));
  536. /*
  537. * If the first lock we have locked is in the AIL, we must TRY to get
  538. * the second lock. If we can't get it, we must release the first one
  539. * and try again.
  540. */
  541. lp = (xfs_log_item_t *)ip0->i_itemp;
  542. if (lp && (lp->li_flags & XFS_LI_IN_AIL)) {
  543. if (!xfs_ilock_nowait(ip1, xfs_lock_inumorder(ip1_mode, 1))) {
  544. xfs_iunlock(ip0, ip0_mode);
  545. if ((++attempts % 5) == 0)
  546. delay(1); /* Don't just spin the CPU */
  547. goto again;
  548. }
  549. } else {
  550. xfs_ilock(ip1, xfs_lock_inumorder(ip1_mode, 1));
  551. }
  552. }
  553. void
  554. __xfs_iflock(
  555. struct xfs_inode *ip)
  556. {
  557. wait_queue_head_t *wq = bit_waitqueue(&ip->i_flags, __XFS_IFLOCK_BIT);
  558. DEFINE_WAIT_BIT(wait, &ip->i_flags, __XFS_IFLOCK_BIT);
  559. do {
  560. prepare_to_wait_exclusive(wq, &wait.wq_entry, TASK_UNINTERRUPTIBLE);
  561. if (xfs_isiflocked(ip))
  562. io_schedule();
  563. } while (!xfs_iflock_nowait(ip));
  564. finish_wait(wq, &wait.wq_entry);
  565. }
  566. STATIC uint
  567. _xfs_dic2xflags(
  568. uint16_t di_flags,
  569. uint64_t di_flags2,
  570. bool has_attr)
  571. {
  572. uint flags = 0;
  573. if (di_flags & XFS_DIFLAG_ANY) {
  574. if (di_flags & XFS_DIFLAG_REALTIME)
  575. flags |= FS_XFLAG_REALTIME;
  576. if (di_flags & XFS_DIFLAG_PREALLOC)
  577. flags |= FS_XFLAG_PREALLOC;
  578. if (di_flags & XFS_DIFLAG_IMMUTABLE)
  579. flags |= FS_XFLAG_IMMUTABLE;
  580. if (di_flags & XFS_DIFLAG_APPEND)
  581. flags |= FS_XFLAG_APPEND;
  582. if (di_flags & XFS_DIFLAG_SYNC)
  583. flags |= FS_XFLAG_SYNC;
  584. if (di_flags & XFS_DIFLAG_NOATIME)
  585. flags |= FS_XFLAG_NOATIME;
  586. if (di_flags & XFS_DIFLAG_NODUMP)
  587. flags |= FS_XFLAG_NODUMP;
  588. if (di_flags & XFS_DIFLAG_RTINHERIT)
  589. flags |= FS_XFLAG_RTINHERIT;
  590. if (di_flags & XFS_DIFLAG_PROJINHERIT)
  591. flags |= FS_XFLAG_PROJINHERIT;
  592. if (di_flags & XFS_DIFLAG_NOSYMLINKS)
  593. flags |= FS_XFLAG_NOSYMLINKS;
  594. if (di_flags & XFS_DIFLAG_EXTSIZE)
  595. flags |= FS_XFLAG_EXTSIZE;
  596. if (di_flags & XFS_DIFLAG_EXTSZINHERIT)
  597. flags |= FS_XFLAG_EXTSZINHERIT;
  598. if (di_flags & XFS_DIFLAG_NODEFRAG)
  599. flags |= FS_XFLAG_NODEFRAG;
  600. if (di_flags & XFS_DIFLAG_FILESTREAM)
  601. flags |= FS_XFLAG_FILESTREAM;
  602. }
  603. if (di_flags2 & XFS_DIFLAG2_ANY) {
  604. if (di_flags2 & XFS_DIFLAG2_DAX)
  605. flags |= FS_XFLAG_DAX;
  606. if (di_flags2 & XFS_DIFLAG2_COWEXTSIZE)
  607. flags |= FS_XFLAG_COWEXTSIZE;
  608. }
  609. if (has_attr)
  610. flags |= FS_XFLAG_HASATTR;
  611. return flags;
  612. }
  613. uint
  614. xfs_ip2xflags(
  615. struct xfs_inode *ip)
  616. {
  617. struct xfs_icdinode *dic = &ip->i_d;
  618. return _xfs_dic2xflags(dic->di_flags, dic->di_flags2, XFS_IFORK_Q(ip));
  619. }
  620. /*
  621. * Lookups up an inode from "name". If ci_name is not NULL, then a CI match
  622. * is allowed, otherwise it has to be an exact match. If a CI match is found,
  623. * ci_name->name will point to a the actual name (caller must free) or
  624. * will be set to NULL if an exact match is found.
  625. */
  626. int
  627. xfs_lookup(
  628. xfs_inode_t *dp,
  629. struct xfs_name *name,
  630. xfs_inode_t **ipp,
  631. struct xfs_name *ci_name)
  632. {
  633. xfs_ino_t inum;
  634. int error;
  635. trace_xfs_lookup(dp, name);
  636. if (XFS_FORCED_SHUTDOWN(dp->i_mount))
  637. return -EIO;
  638. error = xfs_dir_lookup(NULL, dp, name, &inum, ci_name);
  639. if (error)
  640. goto out_unlock;
  641. error = xfs_iget(dp->i_mount, NULL, inum, 0, 0, ipp);
  642. if (error)
  643. goto out_free_name;
  644. return 0;
  645. out_free_name:
  646. if (ci_name)
  647. kmem_free(ci_name->name);
  648. out_unlock:
  649. *ipp = NULL;
  650. return error;
  651. }
  652. /*
  653. * Allocate an inode on disk and return a copy of its in-core version.
  654. * The in-core inode is locked exclusively. Set mode, nlink, and rdev
  655. * appropriately within the inode. The uid and gid for the inode are
  656. * set according to the contents of the given cred structure.
  657. *
  658. * Use xfs_dialloc() to allocate the on-disk inode. If xfs_dialloc()
  659. * has a free inode available, call xfs_iget() to obtain the in-core
  660. * version of the allocated inode. Finally, fill in the inode and
  661. * log its initial contents. In this case, ialloc_context would be
  662. * set to NULL.
  663. *
  664. * If xfs_dialloc() does not have an available inode, it will replenish
  665. * its supply by doing an allocation. Since we can only do one
  666. * allocation within a transaction without deadlocks, we must commit
  667. * the current transaction before returning the inode itself.
  668. * In this case, therefore, we will set ialloc_context and return.
  669. * The caller should then commit the current transaction, start a new
  670. * transaction, and call xfs_ialloc() again to actually get the inode.
  671. *
  672. * To ensure that some other process does not grab the inode that
  673. * was allocated during the first call to xfs_ialloc(), this routine
  674. * also returns the [locked] bp pointing to the head of the freelist
  675. * as ialloc_context. The caller should hold this buffer across
  676. * the commit and pass it back into this routine on the second call.
  677. *
  678. * If we are allocating quota inodes, we do not have a parent inode
  679. * to attach to or associate with (i.e. pip == NULL) because they
  680. * are not linked into the directory structure - they are attached
  681. * directly to the superblock - and so have no parent.
  682. */
  683. static int
  684. xfs_ialloc(
  685. xfs_trans_t *tp,
  686. xfs_inode_t *pip,
  687. umode_t mode,
  688. xfs_nlink_t nlink,
  689. dev_t rdev,
  690. prid_t prid,
  691. xfs_buf_t **ialloc_context,
  692. xfs_inode_t **ipp)
  693. {
  694. struct xfs_mount *mp = tp->t_mountp;
  695. xfs_ino_t ino;
  696. xfs_inode_t *ip;
  697. uint flags;
  698. int error;
  699. struct timespec tv;
  700. struct inode *inode;
  701. /*
  702. * Call the space management code to pick
  703. * the on-disk inode to be allocated.
  704. */
  705. error = xfs_dialloc(tp, pip ? pip->i_ino : 0, mode,
  706. ialloc_context, &ino);
  707. if (error)
  708. return error;
  709. if (*ialloc_context || ino == NULLFSINO) {
  710. *ipp = NULL;
  711. return 0;
  712. }
  713. ASSERT(*ialloc_context == NULL);
  714. /*
  715. * Get the in-core inode with the lock held exclusively.
  716. * This is because we're setting fields here we need
  717. * to prevent others from looking at until we're done.
  718. */
  719. error = xfs_iget(mp, tp, ino, XFS_IGET_CREATE,
  720. XFS_ILOCK_EXCL, &ip);
  721. if (error)
  722. return error;
  723. ASSERT(ip != NULL);
  724. inode = VFS_I(ip);
  725. /*
  726. * We always convert v1 inodes to v2 now - we only support filesystems
  727. * with >= v2 inode capability, so there is no reason for ever leaving
  728. * an inode in v1 format.
  729. */
  730. if (ip->i_d.di_version == 1)
  731. ip->i_d.di_version = 2;
  732. inode->i_mode = mode;
  733. set_nlink(inode, nlink);
  734. ip->i_d.di_uid = xfs_kuid_to_uid(current_fsuid());
  735. ip->i_d.di_gid = xfs_kgid_to_gid(current_fsgid());
  736. inode->i_rdev = rdev;
  737. xfs_set_projid(ip, prid);
  738. if (pip && XFS_INHERIT_GID(pip)) {
  739. ip->i_d.di_gid = pip->i_d.di_gid;
  740. if ((VFS_I(pip)->i_mode & S_ISGID) && S_ISDIR(mode))
  741. inode->i_mode |= S_ISGID;
  742. }
  743. /*
  744. * If the group ID of the new file does not match the effective group
  745. * ID or one of the supplementary group IDs, the S_ISGID bit is cleared
  746. * (and only if the irix_sgid_inherit compatibility variable is set).
  747. */
  748. if ((irix_sgid_inherit) &&
  749. (inode->i_mode & S_ISGID) &&
  750. (!in_group_p(xfs_gid_to_kgid(ip->i_d.di_gid))))
  751. inode->i_mode &= ~S_ISGID;
  752. ip->i_d.di_size = 0;
  753. ip->i_d.di_nextents = 0;
  754. ASSERT(ip->i_d.di_nblocks == 0);
  755. tv = current_time(inode);
  756. inode->i_mtime = tv;
  757. inode->i_atime = tv;
  758. inode->i_ctime = tv;
  759. ip->i_d.di_extsize = 0;
  760. ip->i_d.di_dmevmask = 0;
  761. ip->i_d.di_dmstate = 0;
  762. ip->i_d.di_flags = 0;
  763. if (ip->i_d.di_version == 3) {
  764. inode_set_iversion(inode, 1);
  765. ip->i_d.di_flags2 = 0;
  766. ip->i_d.di_cowextsize = 0;
  767. ip->i_d.di_crtime.t_sec = (int32_t)tv.tv_sec;
  768. ip->i_d.di_crtime.t_nsec = (int32_t)tv.tv_nsec;
  769. }
  770. flags = XFS_ILOG_CORE;
  771. switch (mode & S_IFMT) {
  772. case S_IFIFO:
  773. case S_IFCHR:
  774. case S_IFBLK:
  775. case S_IFSOCK:
  776. ip->i_d.di_format = XFS_DINODE_FMT_DEV;
  777. ip->i_df.if_flags = 0;
  778. flags |= XFS_ILOG_DEV;
  779. break;
  780. case S_IFREG:
  781. case S_IFDIR:
  782. if (pip && (pip->i_d.di_flags & XFS_DIFLAG_ANY)) {
  783. uint di_flags = 0;
  784. if (S_ISDIR(mode)) {
  785. if (pip->i_d.di_flags & XFS_DIFLAG_RTINHERIT)
  786. di_flags |= XFS_DIFLAG_RTINHERIT;
  787. if (pip->i_d.di_flags & XFS_DIFLAG_EXTSZINHERIT) {
  788. di_flags |= XFS_DIFLAG_EXTSZINHERIT;
  789. ip->i_d.di_extsize = pip->i_d.di_extsize;
  790. }
  791. if (pip->i_d.di_flags & XFS_DIFLAG_PROJINHERIT)
  792. di_flags |= XFS_DIFLAG_PROJINHERIT;
  793. } else if (S_ISREG(mode)) {
  794. if (pip->i_d.di_flags & XFS_DIFLAG_RTINHERIT)
  795. di_flags |= XFS_DIFLAG_REALTIME;
  796. if (pip->i_d.di_flags & XFS_DIFLAG_EXTSZINHERIT) {
  797. di_flags |= XFS_DIFLAG_EXTSIZE;
  798. ip->i_d.di_extsize = pip->i_d.di_extsize;
  799. }
  800. }
  801. if ((pip->i_d.di_flags & XFS_DIFLAG_NOATIME) &&
  802. xfs_inherit_noatime)
  803. di_flags |= XFS_DIFLAG_NOATIME;
  804. if ((pip->i_d.di_flags & XFS_DIFLAG_NODUMP) &&
  805. xfs_inherit_nodump)
  806. di_flags |= XFS_DIFLAG_NODUMP;
  807. if ((pip->i_d.di_flags & XFS_DIFLAG_SYNC) &&
  808. xfs_inherit_sync)
  809. di_flags |= XFS_DIFLAG_SYNC;
  810. if ((pip->i_d.di_flags & XFS_DIFLAG_NOSYMLINKS) &&
  811. xfs_inherit_nosymlinks)
  812. di_flags |= XFS_DIFLAG_NOSYMLINKS;
  813. if ((pip->i_d.di_flags & XFS_DIFLAG_NODEFRAG) &&
  814. xfs_inherit_nodefrag)
  815. di_flags |= XFS_DIFLAG_NODEFRAG;
  816. if (pip->i_d.di_flags & XFS_DIFLAG_FILESTREAM)
  817. di_flags |= XFS_DIFLAG_FILESTREAM;
  818. ip->i_d.di_flags |= di_flags;
  819. }
  820. if (pip &&
  821. (pip->i_d.di_flags2 & XFS_DIFLAG2_ANY) &&
  822. pip->i_d.di_version == 3 &&
  823. ip->i_d.di_version == 3) {
  824. uint64_t di_flags2 = 0;
  825. if (pip->i_d.di_flags2 & XFS_DIFLAG2_COWEXTSIZE) {
  826. di_flags2 |= XFS_DIFLAG2_COWEXTSIZE;
  827. ip->i_d.di_cowextsize = pip->i_d.di_cowextsize;
  828. }
  829. if (pip->i_d.di_flags2 & XFS_DIFLAG2_DAX)
  830. di_flags2 |= XFS_DIFLAG2_DAX;
  831. ip->i_d.di_flags2 |= di_flags2;
  832. }
  833. /* FALLTHROUGH */
  834. case S_IFLNK:
  835. ip->i_d.di_format = XFS_DINODE_FMT_EXTENTS;
  836. ip->i_df.if_flags = XFS_IFEXTENTS;
  837. ip->i_df.if_bytes = ip->i_df.if_real_bytes = 0;
  838. ip->i_df.if_u1.if_root = NULL;
  839. break;
  840. default:
  841. ASSERT(0);
  842. }
  843. /*
  844. * Attribute fork settings for new inode.
  845. */
  846. ip->i_d.di_aformat = XFS_DINODE_FMT_EXTENTS;
  847. ip->i_d.di_anextents = 0;
  848. /*
  849. * Log the new values stuffed into the inode.
  850. */
  851. xfs_trans_ijoin(tp, ip, XFS_ILOCK_EXCL);
  852. xfs_trans_log_inode(tp, ip, flags);
  853. /* now that we have an i_mode we can setup the inode structure */
  854. xfs_setup_inode(ip);
  855. *ipp = ip;
  856. return 0;
  857. }
  858. /*
  859. * Allocates a new inode from disk and return a pointer to the
  860. * incore copy. This routine will internally commit the current
  861. * transaction and allocate a new one if the Space Manager needed
  862. * to do an allocation to replenish the inode free-list.
  863. *
  864. * This routine is designed to be called from xfs_create and
  865. * xfs_create_dir.
  866. *
  867. */
  868. int
  869. xfs_dir_ialloc(
  870. xfs_trans_t **tpp, /* input: current transaction;
  871. output: may be a new transaction. */
  872. xfs_inode_t *dp, /* directory within whose allocate
  873. the inode. */
  874. umode_t mode,
  875. xfs_nlink_t nlink,
  876. dev_t rdev,
  877. prid_t prid, /* project id */
  878. xfs_inode_t **ipp) /* pointer to inode; it will be
  879. locked. */
  880. {
  881. xfs_trans_t *tp;
  882. xfs_inode_t *ip;
  883. xfs_buf_t *ialloc_context = NULL;
  884. int code;
  885. void *dqinfo;
  886. uint tflags;
  887. tp = *tpp;
  888. ASSERT(tp->t_flags & XFS_TRANS_PERM_LOG_RES);
  889. /*
  890. * xfs_ialloc will return a pointer to an incore inode if
  891. * the Space Manager has an available inode on the free
  892. * list. Otherwise, it will do an allocation and replenish
  893. * the freelist. Since we can only do one allocation per
  894. * transaction without deadlocks, we will need to commit the
  895. * current transaction and start a new one. We will then
  896. * need to call xfs_ialloc again to get the inode.
  897. *
  898. * If xfs_ialloc did an allocation to replenish the freelist,
  899. * it returns the bp containing the head of the freelist as
  900. * ialloc_context. We will hold a lock on it across the
  901. * transaction commit so that no other process can steal
  902. * the inode(s) that we've just allocated.
  903. */
  904. code = xfs_ialloc(tp, dp, mode, nlink, rdev, prid, &ialloc_context,
  905. &ip);
  906. /*
  907. * Return an error if we were unable to allocate a new inode.
  908. * This should only happen if we run out of space on disk or
  909. * encounter a disk error.
  910. */
  911. if (code) {
  912. *ipp = NULL;
  913. return code;
  914. }
  915. if (!ialloc_context && !ip) {
  916. *ipp = NULL;
  917. return -ENOSPC;
  918. }
  919. /*
  920. * If the AGI buffer is non-NULL, then we were unable to get an
  921. * inode in one operation. We need to commit the current
  922. * transaction and call xfs_ialloc() again. It is guaranteed
  923. * to succeed the second time.
  924. */
  925. if (ialloc_context) {
  926. /*
  927. * Normally, xfs_trans_commit releases all the locks.
  928. * We call bhold to hang on to the ialloc_context across
  929. * the commit. Holding this buffer prevents any other
  930. * processes from doing any allocations in this
  931. * allocation group.
  932. */
  933. xfs_trans_bhold(tp, ialloc_context);
  934. /*
  935. * We want the quota changes to be associated with the next
  936. * transaction, NOT this one. So, detach the dqinfo from this
  937. * and attach it to the next transaction.
  938. */
  939. dqinfo = NULL;
  940. tflags = 0;
  941. if (tp->t_dqinfo) {
  942. dqinfo = (void *)tp->t_dqinfo;
  943. tp->t_dqinfo = NULL;
  944. tflags = tp->t_flags & XFS_TRANS_DQ_DIRTY;
  945. tp->t_flags &= ~(XFS_TRANS_DQ_DIRTY);
  946. }
  947. code = xfs_trans_roll(&tp);
  948. /*
  949. * Re-attach the quota info that we detached from prev trx.
  950. */
  951. if (dqinfo) {
  952. tp->t_dqinfo = dqinfo;
  953. tp->t_flags |= tflags;
  954. }
  955. if (code) {
  956. xfs_buf_relse(ialloc_context);
  957. *tpp = tp;
  958. *ipp = NULL;
  959. return code;
  960. }
  961. xfs_trans_bjoin(tp, ialloc_context);
  962. /*
  963. * Call ialloc again. Since we've locked out all
  964. * other allocations in this allocation group,
  965. * this call should always succeed.
  966. */
  967. code = xfs_ialloc(tp, dp, mode, nlink, rdev, prid,
  968. &ialloc_context, &ip);
  969. /*
  970. * If we get an error at this point, return to the caller
  971. * so that the current transaction can be aborted.
  972. */
  973. if (code) {
  974. *tpp = tp;
  975. *ipp = NULL;
  976. return code;
  977. }
  978. ASSERT(!ialloc_context && ip);
  979. }
  980. *ipp = ip;
  981. *tpp = tp;
  982. return 0;
  983. }
  984. /*
  985. * Decrement the link count on an inode & log the change. If this causes the
  986. * link count to go to zero, move the inode to AGI unlinked list so that it can
  987. * be freed when the last active reference goes away via xfs_inactive().
  988. */
  989. static int /* error */
  990. xfs_droplink(
  991. xfs_trans_t *tp,
  992. xfs_inode_t *ip)
  993. {
  994. xfs_trans_ichgtime(tp, ip, XFS_ICHGTIME_CHG);
  995. drop_nlink(VFS_I(ip));
  996. xfs_trans_log_inode(tp, ip, XFS_ILOG_CORE);
  997. if (VFS_I(ip)->i_nlink)
  998. return 0;
  999. return xfs_iunlink(tp, ip);
  1000. }
  1001. /*
  1002. * Increment the link count on an inode & log the change.
  1003. */
  1004. static int
  1005. xfs_bumplink(
  1006. xfs_trans_t *tp,
  1007. xfs_inode_t *ip)
  1008. {
  1009. xfs_trans_ichgtime(tp, ip, XFS_ICHGTIME_CHG);
  1010. ASSERT(ip->i_d.di_version > 1);
  1011. inc_nlink(VFS_I(ip));
  1012. xfs_trans_log_inode(tp, ip, XFS_ILOG_CORE);
  1013. return 0;
  1014. }
  1015. int
  1016. xfs_create(
  1017. xfs_inode_t *dp,
  1018. struct xfs_name *name,
  1019. umode_t mode,
  1020. dev_t rdev,
  1021. xfs_inode_t **ipp)
  1022. {
  1023. int is_dir = S_ISDIR(mode);
  1024. struct xfs_mount *mp = dp->i_mount;
  1025. struct xfs_inode *ip = NULL;
  1026. struct xfs_trans *tp = NULL;
  1027. int error;
  1028. struct xfs_defer_ops dfops;
  1029. xfs_fsblock_t first_block;
  1030. bool unlock_dp_on_error = false;
  1031. prid_t prid;
  1032. struct xfs_dquot *udqp = NULL;
  1033. struct xfs_dquot *gdqp = NULL;
  1034. struct xfs_dquot *pdqp = NULL;
  1035. struct xfs_trans_res *tres;
  1036. uint resblks;
  1037. trace_xfs_create(dp, name);
  1038. if (XFS_FORCED_SHUTDOWN(mp))
  1039. return -EIO;
  1040. prid = xfs_get_initial_prid(dp);
  1041. /*
  1042. * Make sure that we have allocated dquot(s) on disk.
  1043. */
  1044. error = xfs_qm_vop_dqalloc(dp, xfs_kuid_to_uid(current_fsuid()),
  1045. xfs_kgid_to_gid(current_fsgid()), prid,
  1046. XFS_QMOPT_QUOTALL | XFS_QMOPT_INHERIT,
  1047. &udqp, &gdqp, &pdqp);
  1048. if (error)
  1049. return error;
  1050. if (is_dir) {
  1051. resblks = XFS_MKDIR_SPACE_RES(mp, name->len);
  1052. tres = &M_RES(mp)->tr_mkdir;
  1053. } else {
  1054. resblks = XFS_CREATE_SPACE_RES(mp, name->len);
  1055. tres = &M_RES(mp)->tr_create;
  1056. }
  1057. /*
  1058. * Initially assume that the file does not exist and
  1059. * reserve the resources for that case. If that is not
  1060. * the case we'll drop the one we have and get a more
  1061. * appropriate transaction later.
  1062. */
  1063. error = xfs_trans_alloc(mp, tres, resblks, 0, 0, &tp);
  1064. if (error == -ENOSPC) {
  1065. /* flush outstanding delalloc blocks and retry */
  1066. xfs_flush_inodes(mp);
  1067. error = xfs_trans_alloc(mp, tres, resblks, 0, 0, &tp);
  1068. }
  1069. if (error)
  1070. goto out_release_inode;
  1071. xfs_ilock(dp, XFS_ILOCK_EXCL | XFS_ILOCK_PARENT);
  1072. unlock_dp_on_error = true;
  1073. xfs_defer_init(&dfops, &first_block);
  1074. /*
  1075. * Reserve disk quota and the inode.
  1076. */
  1077. error = xfs_trans_reserve_quota(tp, mp, udqp, gdqp,
  1078. pdqp, resblks, 1, 0);
  1079. if (error)
  1080. goto out_trans_cancel;
  1081. /*
  1082. * A newly created regular or special file just has one directory
  1083. * entry pointing to them, but a directory also the "." entry
  1084. * pointing to itself.
  1085. */
  1086. error = xfs_dir_ialloc(&tp, dp, mode, is_dir ? 2 : 1, rdev, prid, &ip);
  1087. if (error)
  1088. goto out_trans_cancel;
  1089. /*
  1090. * Now we join the directory inode to the transaction. We do not do it
  1091. * earlier because xfs_dir_ialloc might commit the previous transaction
  1092. * (and release all the locks). An error from here on will result in
  1093. * the transaction cancel unlocking dp so don't do it explicitly in the
  1094. * error path.
  1095. */
  1096. xfs_trans_ijoin(tp, dp, XFS_ILOCK_EXCL);
  1097. unlock_dp_on_error = false;
  1098. error = xfs_dir_createname(tp, dp, name, ip->i_ino,
  1099. &first_block, &dfops, resblks ?
  1100. resblks - XFS_IALLOC_SPACE_RES(mp) : 0);
  1101. if (error) {
  1102. ASSERT(error != -ENOSPC);
  1103. goto out_trans_cancel;
  1104. }
  1105. xfs_trans_ichgtime(tp, dp, XFS_ICHGTIME_MOD | XFS_ICHGTIME_CHG);
  1106. xfs_trans_log_inode(tp, dp, XFS_ILOG_CORE);
  1107. if (is_dir) {
  1108. error = xfs_dir_init(tp, ip, dp);
  1109. if (error)
  1110. goto out_bmap_cancel;
  1111. error = xfs_bumplink(tp, dp);
  1112. if (error)
  1113. goto out_bmap_cancel;
  1114. }
  1115. /*
  1116. * If this is a synchronous mount, make sure that the
  1117. * create transaction goes to disk before returning to
  1118. * the user.
  1119. */
  1120. if (mp->m_flags & (XFS_MOUNT_WSYNC|XFS_MOUNT_DIRSYNC))
  1121. xfs_trans_set_sync(tp);
  1122. /*
  1123. * Attach the dquot(s) to the inodes and modify them incore.
  1124. * These ids of the inode couldn't have changed since the new
  1125. * inode has been locked ever since it was created.
  1126. */
  1127. xfs_qm_vop_create_dqattach(tp, ip, udqp, gdqp, pdqp);
  1128. error = xfs_defer_finish(&tp, &dfops);
  1129. if (error)
  1130. goto out_bmap_cancel;
  1131. error = xfs_trans_commit(tp);
  1132. if (error)
  1133. goto out_release_inode;
  1134. xfs_qm_dqrele(udqp);
  1135. xfs_qm_dqrele(gdqp);
  1136. xfs_qm_dqrele(pdqp);
  1137. *ipp = ip;
  1138. return 0;
  1139. out_bmap_cancel:
  1140. xfs_defer_cancel(&dfops);
  1141. out_trans_cancel:
  1142. xfs_trans_cancel(tp);
  1143. out_release_inode:
  1144. /*
  1145. * Wait until after the current transaction is aborted to finish the
  1146. * setup of the inode and release the inode. This prevents recursive
  1147. * transactions and deadlocks from xfs_inactive.
  1148. */
  1149. if (ip) {
  1150. xfs_finish_inode_setup(ip);
  1151. IRELE(ip);
  1152. }
  1153. xfs_qm_dqrele(udqp);
  1154. xfs_qm_dqrele(gdqp);
  1155. xfs_qm_dqrele(pdqp);
  1156. if (unlock_dp_on_error)
  1157. xfs_iunlock(dp, XFS_ILOCK_EXCL);
  1158. return error;
  1159. }
  1160. int
  1161. xfs_create_tmpfile(
  1162. struct xfs_inode *dp,
  1163. umode_t mode,
  1164. struct xfs_inode **ipp)
  1165. {
  1166. struct xfs_mount *mp = dp->i_mount;
  1167. struct xfs_inode *ip = NULL;
  1168. struct xfs_trans *tp = NULL;
  1169. int error;
  1170. prid_t prid;
  1171. struct xfs_dquot *udqp = NULL;
  1172. struct xfs_dquot *gdqp = NULL;
  1173. struct xfs_dquot *pdqp = NULL;
  1174. struct xfs_trans_res *tres;
  1175. uint resblks;
  1176. if (XFS_FORCED_SHUTDOWN(mp))
  1177. return -EIO;
  1178. prid = xfs_get_initial_prid(dp);
  1179. /*
  1180. * Make sure that we have allocated dquot(s) on disk.
  1181. */
  1182. error = xfs_qm_vop_dqalloc(dp, xfs_kuid_to_uid(current_fsuid()),
  1183. xfs_kgid_to_gid(current_fsgid()), prid,
  1184. XFS_QMOPT_QUOTALL | XFS_QMOPT_INHERIT,
  1185. &udqp, &gdqp, &pdqp);
  1186. if (error)
  1187. return error;
  1188. resblks = XFS_IALLOC_SPACE_RES(mp);
  1189. tres = &M_RES(mp)->tr_create_tmpfile;
  1190. error = xfs_trans_alloc(mp, tres, resblks, 0, 0, &tp);
  1191. if (error)
  1192. goto out_release_inode;
  1193. error = xfs_trans_reserve_quota(tp, mp, udqp, gdqp,
  1194. pdqp, resblks, 1, 0);
  1195. if (error)
  1196. goto out_trans_cancel;
  1197. error = xfs_dir_ialloc(&tp, dp, mode, 1, 0, prid, &ip);
  1198. if (error)
  1199. goto out_trans_cancel;
  1200. if (mp->m_flags & XFS_MOUNT_WSYNC)
  1201. xfs_trans_set_sync(tp);
  1202. /*
  1203. * Attach the dquot(s) to the inodes and modify them incore.
  1204. * These ids of the inode couldn't have changed since the new
  1205. * inode has been locked ever since it was created.
  1206. */
  1207. xfs_qm_vop_create_dqattach(tp, ip, udqp, gdqp, pdqp);
  1208. error = xfs_iunlink(tp, ip);
  1209. if (error)
  1210. goto out_trans_cancel;
  1211. error = xfs_trans_commit(tp);
  1212. if (error)
  1213. goto out_release_inode;
  1214. xfs_qm_dqrele(udqp);
  1215. xfs_qm_dqrele(gdqp);
  1216. xfs_qm_dqrele(pdqp);
  1217. *ipp = ip;
  1218. return 0;
  1219. out_trans_cancel:
  1220. xfs_trans_cancel(tp);
  1221. out_release_inode:
  1222. /*
  1223. * Wait until after the current transaction is aborted to finish the
  1224. * setup of the inode and release the inode. This prevents recursive
  1225. * transactions and deadlocks from xfs_inactive.
  1226. */
  1227. if (ip) {
  1228. xfs_finish_inode_setup(ip);
  1229. IRELE(ip);
  1230. }
  1231. xfs_qm_dqrele(udqp);
  1232. xfs_qm_dqrele(gdqp);
  1233. xfs_qm_dqrele(pdqp);
  1234. return error;
  1235. }
  1236. int
  1237. xfs_link(
  1238. xfs_inode_t *tdp,
  1239. xfs_inode_t *sip,
  1240. struct xfs_name *target_name)
  1241. {
  1242. xfs_mount_t *mp = tdp->i_mount;
  1243. xfs_trans_t *tp;
  1244. int error;
  1245. struct xfs_defer_ops dfops;
  1246. xfs_fsblock_t first_block;
  1247. int resblks;
  1248. trace_xfs_link(tdp, target_name);
  1249. ASSERT(!S_ISDIR(VFS_I(sip)->i_mode));
  1250. if (XFS_FORCED_SHUTDOWN(mp))
  1251. return -EIO;
  1252. error = xfs_qm_dqattach(sip, 0);
  1253. if (error)
  1254. goto std_return;
  1255. error = xfs_qm_dqattach(tdp, 0);
  1256. if (error)
  1257. goto std_return;
  1258. resblks = XFS_LINK_SPACE_RES(mp, target_name->len);
  1259. error = xfs_trans_alloc(mp, &M_RES(mp)->tr_link, resblks, 0, 0, &tp);
  1260. if (error == -ENOSPC) {
  1261. resblks = 0;
  1262. error = xfs_trans_alloc(mp, &M_RES(mp)->tr_link, 0, 0, 0, &tp);
  1263. }
  1264. if (error)
  1265. goto std_return;
  1266. xfs_lock_two_inodes(sip, XFS_ILOCK_EXCL, tdp, XFS_ILOCK_EXCL);
  1267. xfs_trans_ijoin(tp, sip, XFS_ILOCK_EXCL);
  1268. xfs_trans_ijoin(tp, tdp, XFS_ILOCK_EXCL);
  1269. /*
  1270. * If we are using project inheritance, we only allow hard link
  1271. * creation in our tree when the project IDs are the same; else
  1272. * the tree quota mechanism could be circumvented.
  1273. */
  1274. if (unlikely((tdp->i_d.di_flags & XFS_DIFLAG_PROJINHERIT) &&
  1275. (xfs_get_projid(tdp) != xfs_get_projid(sip)))) {
  1276. error = -EXDEV;
  1277. goto error_return;
  1278. }
  1279. if (!resblks) {
  1280. error = xfs_dir_canenter(tp, tdp, target_name);
  1281. if (error)
  1282. goto error_return;
  1283. }
  1284. xfs_defer_init(&dfops, &first_block);
  1285. /*
  1286. * Handle initial link state of O_TMPFILE inode
  1287. */
  1288. if (VFS_I(sip)->i_nlink == 0) {
  1289. error = xfs_iunlink_remove(tp, sip);
  1290. if (error)
  1291. goto error_return;
  1292. }
  1293. error = xfs_dir_createname(tp, tdp, target_name, sip->i_ino,
  1294. &first_block, &dfops, resblks);
  1295. if (error)
  1296. goto error_return;
  1297. xfs_trans_ichgtime(tp, tdp, XFS_ICHGTIME_MOD | XFS_ICHGTIME_CHG);
  1298. xfs_trans_log_inode(tp, tdp, XFS_ILOG_CORE);
  1299. error = xfs_bumplink(tp, sip);
  1300. if (error)
  1301. goto error_return;
  1302. /*
  1303. * If this is a synchronous mount, make sure that the
  1304. * link transaction goes to disk before returning to
  1305. * the user.
  1306. */
  1307. if (mp->m_flags & (XFS_MOUNT_WSYNC|XFS_MOUNT_DIRSYNC))
  1308. xfs_trans_set_sync(tp);
  1309. error = xfs_defer_finish(&tp, &dfops);
  1310. if (error) {
  1311. xfs_defer_cancel(&dfops);
  1312. goto error_return;
  1313. }
  1314. return xfs_trans_commit(tp);
  1315. error_return:
  1316. xfs_trans_cancel(tp);
  1317. std_return:
  1318. return error;
  1319. }
  1320. /* Clear the reflink flag and the cowblocks tag if possible. */
  1321. static void
  1322. xfs_itruncate_clear_reflink_flags(
  1323. struct xfs_inode *ip)
  1324. {
  1325. struct xfs_ifork *dfork;
  1326. struct xfs_ifork *cfork;
  1327. if (!xfs_is_reflink_inode(ip))
  1328. return;
  1329. dfork = XFS_IFORK_PTR(ip, XFS_DATA_FORK);
  1330. cfork = XFS_IFORK_PTR(ip, XFS_COW_FORK);
  1331. if (dfork->if_bytes == 0 && cfork->if_bytes == 0)
  1332. ip->i_d.di_flags2 &= ~XFS_DIFLAG2_REFLINK;
  1333. if (cfork->if_bytes == 0)
  1334. xfs_inode_clear_cowblocks_tag(ip);
  1335. }
  1336. /*
  1337. * Free up the underlying blocks past new_size. The new size must be smaller
  1338. * than the current size. This routine can be used both for the attribute and
  1339. * data fork, and does not modify the inode size, which is left to the caller.
  1340. *
  1341. * The transaction passed to this routine must have made a permanent log
  1342. * reservation of at least XFS_ITRUNCATE_LOG_RES. This routine may commit the
  1343. * given transaction and start new ones, so make sure everything involved in
  1344. * the transaction is tidy before calling here. Some transaction will be
  1345. * returned to the caller to be committed. The incoming transaction must
  1346. * already include the inode, and both inode locks must be held exclusively.
  1347. * The inode must also be "held" within the transaction. On return the inode
  1348. * will be "held" within the returned transaction. This routine does NOT
  1349. * require any disk space to be reserved for it within the transaction.
  1350. *
  1351. * If we get an error, we must return with the inode locked and linked into the
  1352. * current transaction. This keeps things simple for the higher level code,
  1353. * because it always knows that the inode is locked and held in the transaction
  1354. * that returns to it whether errors occur or not. We don't mark the inode
  1355. * dirty on error so that transactions can be easily aborted if possible.
  1356. */
  1357. int
  1358. xfs_itruncate_extents(
  1359. struct xfs_trans **tpp,
  1360. struct xfs_inode *ip,
  1361. int whichfork,
  1362. xfs_fsize_t new_size)
  1363. {
  1364. struct xfs_mount *mp = ip->i_mount;
  1365. struct xfs_trans *tp = *tpp;
  1366. struct xfs_defer_ops dfops;
  1367. xfs_fsblock_t first_block;
  1368. xfs_fileoff_t first_unmap_block;
  1369. xfs_fileoff_t last_block;
  1370. xfs_filblks_t unmap_len;
  1371. int error = 0;
  1372. int done = 0;
  1373. ASSERT(xfs_isilocked(ip, XFS_ILOCK_EXCL));
  1374. ASSERT(!atomic_read(&VFS_I(ip)->i_count) ||
  1375. xfs_isilocked(ip, XFS_IOLOCK_EXCL));
  1376. ASSERT(new_size <= XFS_ISIZE(ip));
  1377. ASSERT(tp->t_flags & XFS_TRANS_PERM_LOG_RES);
  1378. ASSERT(ip->i_itemp != NULL);
  1379. ASSERT(ip->i_itemp->ili_lock_flags == 0);
  1380. ASSERT(!XFS_NOT_DQATTACHED(mp, ip));
  1381. trace_xfs_itruncate_extents_start(ip, new_size);
  1382. /*
  1383. * Since it is possible for space to become allocated beyond
  1384. * the end of the file (in a crash where the space is allocated
  1385. * but the inode size is not yet updated), simply remove any
  1386. * blocks which show up between the new EOF and the maximum
  1387. * possible file size. If the first block to be removed is
  1388. * beyond the maximum file size (ie it is the same as last_block),
  1389. * then there is nothing to do.
  1390. */
  1391. first_unmap_block = XFS_B_TO_FSB(mp, (xfs_ufsize_t)new_size);
  1392. last_block = XFS_B_TO_FSB(mp, mp->m_super->s_maxbytes);
  1393. if (first_unmap_block == last_block)
  1394. return 0;
  1395. ASSERT(first_unmap_block < last_block);
  1396. unmap_len = last_block - first_unmap_block + 1;
  1397. while (!done) {
  1398. xfs_defer_init(&dfops, &first_block);
  1399. error = xfs_bunmapi(tp, ip,
  1400. first_unmap_block, unmap_len,
  1401. xfs_bmapi_aflag(whichfork),
  1402. XFS_ITRUNC_MAX_EXTENTS,
  1403. &first_block, &dfops,
  1404. &done);
  1405. if (error)
  1406. goto out_bmap_cancel;
  1407. /*
  1408. * Duplicate the transaction that has the permanent
  1409. * reservation and commit the old transaction.
  1410. */
  1411. xfs_defer_ijoin(&dfops, ip);
  1412. error = xfs_defer_finish(&tp, &dfops);
  1413. if (error)
  1414. goto out_bmap_cancel;
  1415. error = xfs_trans_roll_inode(&tp, ip);
  1416. if (error)
  1417. goto out;
  1418. }
  1419. /* Remove all pending CoW reservations. */
  1420. error = xfs_reflink_cancel_cow_blocks(ip, &tp, first_unmap_block,
  1421. last_block, true);
  1422. if (error)
  1423. goto out;
  1424. xfs_itruncate_clear_reflink_flags(ip);
  1425. /*
  1426. * Always re-log the inode so that our permanent transaction can keep
  1427. * on rolling it forward in the log.
  1428. */
  1429. xfs_trans_log_inode(tp, ip, XFS_ILOG_CORE);
  1430. trace_xfs_itruncate_extents_end(ip, new_size);
  1431. out:
  1432. *tpp = tp;
  1433. return error;
  1434. out_bmap_cancel:
  1435. /*
  1436. * If the bunmapi call encounters an error, return to the caller where
  1437. * the transaction can be properly aborted. We just need to make sure
  1438. * we're not holding any resources that we were not when we came in.
  1439. */
  1440. xfs_defer_cancel(&dfops);
  1441. goto out;
  1442. }
  1443. int
  1444. xfs_release(
  1445. xfs_inode_t *ip)
  1446. {
  1447. xfs_mount_t *mp = ip->i_mount;
  1448. int error;
  1449. if (!S_ISREG(VFS_I(ip)->i_mode) || (VFS_I(ip)->i_mode == 0))
  1450. return 0;
  1451. /* If this is a read-only mount, don't do this (would generate I/O) */
  1452. if (mp->m_flags & XFS_MOUNT_RDONLY)
  1453. return 0;
  1454. if (!XFS_FORCED_SHUTDOWN(mp)) {
  1455. int truncated;
  1456. /*
  1457. * If we previously truncated this file and removed old data
  1458. * in the process, we want to initiate "early" writeout on
  1459. * the last close. This is an attempt to combat the notorious
  1460. * NULL files problem which is particularly noticeable from a
  1461. * truncate down, buffered (re-)write (delalloc), followed by
  1462. * a crash. What we are effectively doing here is
  1463. * significantly reducing the time window where we'd otherwise
  1464. * be exposed to that problem.
  1465. */
  1466. truncated = xfs_iflags_test_and_clear(ip, XFS_ITRUNCATED);
  1467. if (truncated) {
  1468. xfs_iflags_clear(ip, XFS_IDIRTY_RELEASE);
  1469. if (ip->i_delayed_blks > 0) {
  1470. error = filemap_flush(VFS_I(ip)->i_mapping);
  1471. if (error)
  1472. return error;
  1473. }
  1474. }
  1475. }
  1476. if (VFS_I(ip)->i_nlink == 0)
  1477. return 0;
  1478. if (xfs_can_free_eofblocks(ip, false)) {
  1479. /*
  1480. * Check if the inode is being opened, written and closed
  1481. * frequently and we have delayed allocation blocks outstanding
  1482. * (e.g. streaming writes from the NFS server), truncating the
  1483. * blocks past EOF will cause fragmentation to occur.
  1484. *
  1485. * In this case don't do the truncation, but we have to be
  1486. * careful how we detect this case. Blocks beyond EOF show up as
  1487. * i_delayed_blks even when the inode is clean, so we need to
  1488. * truncate them away first before checking for a dirty release.
  1489. * Hence on the first dirty close we will still remove the
  1490. * speculative allocation, but after that we will leave it in
  1491. * place.
  1492. */
  1493. if (xfs_iflags_test(ip, XFS_IDIRTY_RELEASE))
  1494. return 0;
  1495. /*
  1496. * If we can't get the iolock just skip truncating the blocks
  1497. * past EOF because we could deadlock with the mmap_sem
  1498. * otherwise. We'll get another chance to drop them once the
  1499. * last reference to the inode is dropped, so we'll never leak
  1500. * blocks permanently.
  1501. */
  1502. if (xfs_ilock_nowait(ip, XFS_IOLOCK_EXCL)) {
  1503. error = xfs_free_eofblocks(ip);
  1504. xfs_iunlock(ip, XFS_IOLOCK_EXCL);
  1505. if (error)
  1506. return error;
  1507. }
  1508. /* delalloc blocks after truncation means it really is dirty */
  1509. if (ip->i_delayed_blks)
  1510. xfs_iflags_set(ip, XFS_IDIRTY_RELEASE);
  1511. }
  1512. return 0;
  1513. }
  1514. /*
  1515. * xfs_inactive_truncate
  1516. *
  1517. * Called to perform a truncate when an inode becomes unlinked.
  1518. */
  1519. STATIC int
  1520. xfs_inactive_truncate(
  1521. struct xfs_inode *ip)
  1522. {
  1523. struct xfs_mount *mp = ip->i_mount;
  1524. struct xfs_trans *tp;
  1525. int error;
  1526. error = xfs_trans_alloc(mp, &M_RES(mp)->tr_itruncate, 0, 0, 0, &tp);
  1527. if (error) {
  1528. ASSERT(XFS_FORCED_SHUTDOWN(mp));
  1529. return error;
  1530. }
  1531. xfs_ilock(ip, XFS_ILOCK_EXCL);
  1532. xfs_trans_ijoin(tp, ip, 0);
  1533. /*
  1534. * Log the inode size first to prevent stale data exposure in the event
  1535. * of a system crash before the truncate completes. See the related
  1536. * comment in xfs_vn_setattr_size() for details.
  1537. */
  1538. ip->i_d.di_size = 0;
  1539. xfs_trans_log_inode(tp, ip, XFS_ILOG_CORE);
  1540. error = xfs_itruncate_extents(&tp, ip, XFS_DATA_FORK, 0);
  1541. if (error)
  1542. goto error_trans_cancel;
  1543. ASSERT(ip->i_d.di_nextents == 0);
  1544. error = xfs_trans_commit(tp);
  1545. if (error)
  1546. goto error_unlock;
  1547. xfs_iunlock(ip, XFS_ILOCK_EXCL);
  1548. return 0;
  1549. error_trans_cancel:
  1550. xfs_trans_cancel(tp);
  1551. error_unlock:
  1552. xfs_iunlock(ip, XFS_ILOCK_EXCL);
  1553. return error;
  1554. }
  1555. /*
  1556. * xfs_inactive_ifree()
  1557. *
  1558. * Perform the inode free when an inode is unlinked.
  1559. */
  1560. STATIC int
  1561. xfs_inactive_ifree(
  1562. struct xfs_inode *ip)
  1563. {
  1564. struct xfs_defer_ops dfops;
  1565. xfs_fsblock_t first_block;
  1566. struct xfs_mount *mp = ip->i_mount;
  1567. struct xfs_trans *tp;
  1568. int error;
  1569. /*
  1570. * We try to use a per-AG reservation for any block needed by the finobt
  1571. * tree, but as the finobt feature predates the per-AG reservation
  1572. * support a degraded file system might not have enough space for the
  1573. * reservation at mount time. In that case try to dip into the reserved
  1574. * pool and pray.
  1575. *
  1576. * Send a warning if the reservation does happen to fail, as the inode
  1577. * now remains allocated and sits on the unlinked list until the fs is
  1578. * repaired.
  1579. */
  1580. if (unlikely(mp->m_inotbt_nores)) {
  1581. error = xfs_trans_alloc(mp, &M_RES(mp)->tr_ifree,
  1582. XFS_IFREE_SPACE_RES(mp), 0, XFS_TRANS_RESERVE,
  1583. &tp);
  1584. } else {
  1585. error = xfs_trans_alloc(mp, &M_RES(mp)->tr_ifree, 0, 0, 0, &tp);
  1586. }
  1587. if (error) {
  1588. if (error == -ENOSPC) {
  1589. xfs_warn_ratelimited(mp,
  1590. "Failed to remove inode(s) from unlinked list. "
  1591. "Please free space, unmount and run xfs_repair.");
  1592. } else {
  1593. ASSERT(XFS_FORCED_SHUTDOWN(mp));
  1594. }
  1595. return error;
  1596. }
  1597. xfs_ilock(ip, XFS_ILOCK_EXCL);
  1598. xfs_trans_ijoin(tp, ip, 0);
  1599. xfs_defer_init(&dfops, &first_block);
  1600. error = xfs_ifree(tp, ip, &dfops);
  1601. if (error) {
  1602. /*
  1603. * If we fail to free the inode, shut down. The cancel
  1604. * might do that, we need to make sure. Otherwise the
  1605. * inode might be lost for a long time or forever.
  1606. */
  1607. if (!XFS_FORCED_SHUTDOWN(mp)) {
  1608. xfs_notice(mp, "%s: xfs_ifree returned error %d",
  1609. __func__, error);
  1610. xfs_force_shutdown(mp, SHUTDOWN_META_IO_ERROR);
  1611. }
  1612. xfs_trans_cancel(tp);
  1613. xfs_iunlock(ip, XFS_ILOCK_EXCL);
  1614. return error;
  1615. }
  1616. /*
  1617. * Credit the quota account(s). The inode is gone.
  1618. */
  1619. xfs_trans_mod_dquot_byino(tp, ip, XFS_TRANS_DQ_ICOUNT, -1);
  1620. /*
  1621. * Just ignore errors at this point. There is nothing we can do except
  1622. * to try to keep going. Make sure it's not a silent error.
  1623. */
  1624. error = xfs_defer_finish(&tp, &dfops);
  1625. if (error) {
  1626. xfs_notice(mp, "%s: xfs_defer_finish returned error %d",
  1627. __func__, error);
  1628. xfs_defer_cancel(&dfops);
  1629. }
  1630. error = xfs_trans_commit(tp);
  1631. if (error)
  1632. xfs_notice(mp, "%s: xfs_trans_commit returned error %d",
  1633. __func__, error);
  1634. xfs_iunlock(ip, XFS_ILOCK_EXCL);
  1635. return 0;
  1636. }
  1637. /*
  1638. * xfs_inactive
  1639. *
  1640. * This is called when the vnode reference count for the vnode
  1641. * goes to zero. If the file has been unlinked, then it must
  1642. * now be truncated. Also, we clear all of the read-ahead state
  1643. * kept for the inode here since the file is now closed.
  1644. */
  1645. void
  1646. xfs_inactive(
  1647. xfs_inode_t *ip)
  1648. {
  1649. struct xfs_mount *mp;
  1650. struct xfs_ifork *cow_ifp = XFS_IFORK_PTR(ip, XFS_COW_FORK);
  1651. int error;
  1652. int truncate = 0;
  1653. /*
  1654. * If the inode is already free, then there can be nothing
  1655. * to clean up here.
  1656. */
  1657. if (VFS_I(ip)->i_mode == 0) {
  1658. ASSERT(ip->i_df.if_real_bytes == 0);
  1659. ASSERT(ip->i_df.if_broot_bytes == 0);
  1660. return;
  1661. }
  1662. mp = ip->i_mount;
  1663. ASSERT(!xfs_iflags_test(ip, XFS_IRECOVERY));
  1664. /* If this is a read-only mount, don't do this (would generate I/O) */
  1665. if (mp->m_flags & XFS_MOUNT_RDONLY)
  1666. return;
  1667. /* Try to clean out the cow blocks if there are any. */
  1668. if (xfs_is_reflink_inode(ip) && cow_ifp->if_bytes > 0)
  1669. xfs_reflink_cancel_cow_range(ip, 0, NULLFILEOFF, true);
  1670. if (VFS_I(ip)->i_nlink != 0) {
  1671. /*
  1672. * force is true because we are evicting an inode from the
  1673. * cache. Post-eof blocks must be freed, lest we end up with
  1674. * broken free space accounting.
  1675. *
  1676. * Note: don't bother with iolock here since lockdep complains
  1677. * about acquiring it in reclaim context. We have the only
  1678. * reference to the inode at this point anyways.
  1679. */
  1680. if (xfs_can_free_eofblocks(ip, true))
  1681. xfs_free_eofblocks(ip);
  1682. return;
  1683. }
  1684. if (S_ISREG(VFS_I(ip)->i_mode) &&
  1685. (ip->i_d.di_size != 0 || XFS_ISIZE(ip) != 0 ||
  1686. ip->i_d.di_nextents > 0 || ip->i_delayed_blks > 0))
  1687. truncate = 1;
  1688. error = xfs_qm_dqattach(ip, 0);
  1689. if (error)
  1690. return;
  1691. if (S_ISLNK(VFS_I(ip)->i_mode))
  1692. error = xfs_inactive_symlink(ip);
  1693. else if (truncate)
  1694. error = xfs_inactive_truncate(ip);
  1695. if (error)
  1696. return;
  1697. /*
  1698. * If there are attributes associated with the file then blow them away
  1699. * now. The code calls a routine that recursively deconstructs the
  1700. * attribute fork. If also blows away the in-core attribute fork.
  1701. */
  1702. if (XFS_IFORK_Q(ip)) {
  1703. error = xfs_attr_inactive(ip);
  1704. if (error)
  1705. return;
  1706. }
  1707. ASSERT(!ip->i_afp);
  1708. ASSERT(ip->i_d.di_anextents == 0);
  1709. ASSERT(ip->i_d.di_forkoff == 0);
  1710. /*
  1711. * Free the inode.
  1712. */
  1713. error = xfs_inactive_ifree(ip);
  1714. if (error)
  1715. return;
  1716. /*
  1717. * Release the dquots held by inode, if any.
  1718. */
  1719. xfs_qm_dqdetach(ip);
  1720. }
  1721. /*
  1722. * This is called when the inode's link count goes to 0 or we are creating a
  1723. * tmpfile via O_TMPFILE. In the case of a tmpfile, @ignore_linkcount will be
  1724. * set to true as the link count is dropped to zero by the VFS after we've
  1725. * created the file successfully, so we have to add it to the unlinked list
  1726. * while the link count is non-zero.
  1727. *
  1728. * We place the on-disk inode on a list in the AGI. It will be pulled from this
  1729. * list when the inode is freed.
  1730. */
  1731. STATIC int
  1732. xfs_iunlink(
  1733. struct xfs_trans *tp,
  1734. struct xfs_inode *ip)
  1735. {
  1736. xfs_mount_t *mp = tp->t_mountp;
  1737. xfs_agi_t *agi;
  1738. xfs_dinode_t *dip;
  1739. xfs_buf_t *agibp;
  1740. xfs_buf_t *ibp;
  1741. xfs_agino_t agino;
  1742. short bucket_index;
  1743. int offset;
  1744. int error;
  1745. ASSERT(VFS_I(ip)->i_mode != 0);
  1746. /*
  1747. * Get the agi buffer first. It ensures lock ordering
  1748. * on the list.
  1749. */
  1750. error = xfs_read_agi(mp, tp, XFS_INO_TO_AGNO(mp, ip->i_ino), &agibp);
  1751. if (error)
  1752. return error;
  1753. agi = XFS_BUF_TO_AGI(agibp);
  1754. /*
  1755. * Get the index into the agi hash table for the
  1756. * list this inode will go on.
  1757. */
  1758. agino = XFS_INO_TO_AGINO(mp, ip->i_ino);
  1759. ASSERT(agino != 0);
  1760. bucket_index = agino % XFS_AGI_UNLINKED_BUCKETS;
  1761. ASSERT(agi->agi_unlinked[bucket_index]);
  1762. ASSERT(be32_to_cpu(agi->agi_unlinked[bucket_index]) != agino);
  1763. if (agi->agi_unlinked[bucket_index] != cpu_to_be32(NULLAGINO)) {
  1764. /*
  1765. * There is already another inode in the bucket we need
  1766. * to add ourselves to. Add us at the front of the list.
  1767. * Here we put the head pointer into our next pointer,
  1768. * and then we fall through to point the head at us.
  1769. */
  1770. error = xfs_imap_to_bp(mp, tp, &ip->i_imap, &dip, &ibp,
  1771. 0, 0);
  1772. if (error)
  1773. return error;
  1774. ASSERT(dip->di_next_unlinked == cpu_to_be32(NULLAGINO));
  1775. dip->di_next_unlinked = agi->agi_unlinked[bucket_index];
  1776. offset = ip->i_imap.im_boffset +
  1777. offsetof(xfs_dinode_t, di_next_unlinked);
  1778. /* need to recalc the inode CRC if appropriate */
  1779. xfs_dinode_calc_crc(mp, dip);
  1780. xfs_trans_inode_buf(tp, ibp);
  1781. xfs_trans_log_buf(tp, ibp, offset,
  1782. (offset + sizeof(xfs_agino_t) - 1));
  1783. xfs_inobp_check(mp, ibp);
  1784. }
  1785. /*
  1786. * Point the bucket head pointer at the inode being inserted.
  1787. */
  1788. ASSERT(agino != 0);
  1789. agi->agi_unlinked[bucket_index] = cpu_to_be32(agino);
  1790. offset = offsetof(xfs_agi_t, agi_unlinked) +
  1791. (sizeof(xfs_agino_t) * bucket_index);
  1792. xfs_trans_log_buf(tp, agibp, offset,
  1793. (offset + sizeof(xfs_agino_t) - 1));
  1794. return 0;
  1795. }
  1796. /*
  1797. * Pull the on-disk inode from the AGI unlinked list.
  1798. */
  1799. STATIC int
  1800. xfs_iunlink_remove(
  1801. xfs_trans_t *tp,
  1802. xfs_inode_t *ip)
  1803. {
  1804. xfs_ino_t next_ino;
  1805. xfs_mount_t *mp;
  1806. xfs_agi_t *agi;
  1807. xfs_dinode_t *dip;
  1808. xfs_buf_t *agibp;
  1809. xfs_buf_t *ibp;
  1810. xfs_agnumber_t agno;
  1811. xfs_agino_t agino;
  1812. xfs_agino_t next_agino;
  1813. xfs_buf_t *last_ibp;
  1814. xfs_dinode_t *last_dip = NULL;
  1815. short bucket_index;
  1816. int offset, last_offset = 0;
  1817. int error;
  1818. mp = tp->t_mountp;
  1819. agno = XFS_INO_TO_AGNO(mp, ip->i_ino);
  1820. /*
  1821. * Get the agi buffer first. It ensures lock ordering
  1822. * on the list.
  1823. */
  1824. error = xfs_read_agi(mp, tp, agno, &agibp);
  1825. if (error)
  1826. return error;
  1827. agi = XFS_BUF_TO_AGI(agibp);
  1828. /*
  1829. * Get the index into the agi hash table for the
  1830. * list this inode will go on.
  1831. */
  1832. agino = XFS_INO_TO_AGINO(mp, ip->i_ino);
  1833. ASSERT(agino != 0);
  1834. bucket_index = agino % XFS_AGI_UNLINKED_BUCKETS;
  1835. ASSERT(agi->agi_unlinked[bucket_index] != cpu_to_be32(NULLAGINO));
  1836. ASSERT(agi->agi_unlinked[bucket_index]);
  1837. if (be32_to_cpu(agi->agi_unlinked[bucket_index]) == agino) {
  1838. /*
  1839. * We're at the head of the list. Get the inode's on-disk
  1840. * buffer to see if there is anyone after us on the list.
  1841. * Only modify our next pointer if it is not already NULLAGINO.
  1842. * This saves us the overhead of dealing with the buffer when
  1843. * there is no need to change it.
  1844. */
  1845. error = xfs_imap_to_bp(mp, tp, &ip->i_imap, &dip, &ibp,
  1846. 0, 0);
  1847. if (error) {
  1848. xfs_warn(mp, "%s: xfs_imap_to_bp returned error %d.",
  1849. __func__, error);
  1850. return error;
  1851. }
  1852. next_agino = be32_to_cpu(dip->di_next_unlinked);
  1853. ASSERT(next_agino != 0);
  1854. if (next_agino != NULLAGINO) {
  1855. dip->di_next_unlinked = cpu_to_be32(NULLAGINO);
  1856. offset = ip->i_imap.im_boffset +
  1857. offsetof(xfs_dinode_t, di_next_unlinked);
  1858. /* need to recalc the inode CRC if appropriate */
  1859. xfs_dinode_calc_crc(mp, dip);
  1860. xfs_trans_inode_buf(tp, ibp);
  1861. xfs_trans_log_buf(tp, ibp, offset,
  1862. (offset + sizeof(xfs_agino_t) - 1));
  1863. xfs_inobp_check(mp, ibp);
  1864. } else {
  1865. xfs_trans_brelse(tp, ibp);
  1866. }
  1867. /*
  1868. * Point the bucket head pointer at the next inode.
  1869. */
  1870. ASSERT(next_agino != 0);
  1871. ASSERT(next_agino != agino);
  1872. agi->agi_unlinked[bucket_index] = cpu_to_be32(next_agino);
  1873. offset = offsetof(xfs_agi_t, agi_unlinked) +
  1874. (sizeof(xfs_agino_t) * bucket_index);
  1875. xfs_trans_log_buf(tp, agibp, offset,
  1876. (offset + sizeof(xfs_agino_t) - 1));
  1877. } else {
  1878. /*
  1879. * We need to search the list for the inode being freed.
  1880. */
  1881. next_agino = be32_to_cpu(agi->agi_unlinked[bucket_index]);
  1882. last_ibp = NULL;
  1883. while (next_agino != agino) {
  1884. struct xfs_imap imap;
  1885. if (last_ibp)
  1886. xfs_trans_brelse(tp, last_ibp);
  1887. imap.im_blkno = 0;
  1888. next_ino = XFS_AGINO_TO_INO(mp, agno, next_agino);
  1889. error = xfs_imap(mp, tp, next_ino, &imap, 0);
  1890. if (error) {
  1891. xfs_warn(mp,
  1892. "%s: xfs_imap returned error %d.",
  1893. __func__, error);
  1894. return error;
  1895. }
  1896. error = xfs_imap_to_bp(mp, tp, &imap, &last_dip,
  1897. &last_ibp, 0, 0);
  1898. if (error) {
  1899. xfs_warn(mp,
  1900. "%s: xfs_imap_to_bp returned error %d.",
  1901. __func__, error);
  1902. return error;
  1903. }
  1904. last_offset = imap.im_boffset;
  1905. next_agino = be32_to_cpu(last_dip->di_next_unlinked);
  1906. ASSERT(next_agino != NULLAGINO);
  1907. ASSERT(next_agino != 0);
  1908. }
  1909. /*
  1910. * Now last_ibp points to the buffer previous to us on the
  1911. * unlinked list. Pull us from the list.
  1912. */
  1913. error = xfs_imap_to_bp(mp, tp, &ip->i_imap, &dip, &ibp,
  1914. 0, 0);
  1915. if (error) {
  1916. xfs_warn(mp, "%s: xfs_imap_to_bp(2) returned error %d.",
  1917. __func__, error);
  1918. return error;
  1919. }
  1920. next_agino = be32_to_cpu(dip->di_next_unlinked);
  1921. ASSERT(next_agino != 0);
  1922. ASSERT(next_agino != agino);
  1923. if (next_agino != NULLAGINO) {
  1924. dip->di_next_unlinked = cpu_to_be32(NULLAGINO);
  1925. offset = ip->i_imap.im_boffset +
  1926. offsetof(xfs_dinode_t, di_next_unlinked);
  1927. /* need to recalc the inode CRC if appropriate */
  1928. xfs_dinode_calc_crc(mp, dip);
  1929. xfs_trans_inode_buf(tp, ibp);
  1930. xfs_trans_log_buf(tp, ibp, offset,
  1931. (offset + sizeof(xfs_agino_t) - 1));
  1932. xfs_inobp_check(mp, ibp);
  1933. } else {
  1934. xfs_trans_brelse(tp, ibp);
  1935. }
  1936. /*
  1937. * Point the previous inode on the list to the next inode.
  1938. */
  1939. last_dip->di_next_unlinked = cpu_to_be32(next_agino);
  1940. ASSERT(next_agino != 0);
  1941. offset = last_offset + offsetof(xfs_dinode_t, di_next_unlinked);
  1942. /* need to recalc the inode CRC if appropriate */
  1943. xfs_dinode_calc_crc(mp, last_dip);
  1944. xfs_trans_inode_buf(tp, last_ibp);
  1945. xfs_trans_log_buf(tp, last_ibp, offset,
  1946. (offset + sizeof(xfs_agino_t) - 1));
  1947. xfs_inobp_check(mp, last_ibp);
  1948. }
  1949. return 0;
  1950. }
  1951. /*
  1952. * A big issue when freeing the inode cluster is that we _cannot_ skip any
  1953. * inodes that are in memory - they all must be marked stale and attached to
  1954. * the cluster buffer.
  1955. */
  1956. STATIC int
  1957. xfs_ifree_cluster(
  1958. xfs_inode_t *free_ip,
  1959. xfs_trans_t *tp,
  1960. struct xfs_icluster *xic)
  1961. {
  1962. xfs_mount_t *mp = free_ip->i_mount;
  1963. int blks_per_cluster;
  1964. int inodes_per_cluster;
  1965. int nbufs;
  1966. int i, j;
  1967. int ioffset;
  1968. xfs_daddr_t blkno;
  1969. xfs_buf_t *bp;
  1970. xfs_inode_t *ip;
  1971. xfs_inode_log_item_t *iip;
  1972. struct xfs_log_item *lip;
  1973. struct xfs_perag *pag;
  1974. xfs_ino_t inum;
  1975. inum = xic->first_ino;
  1976. pag = xfs_perag_get(mp, XFS_INO_TO_AGNO(mp, inum));
  1977. blks_per_cluster = xfs_icluster_size_fsb(mp);
  1978. inodes_per_cluster = blks_per_cluster << mp->m_sb.sb_inopblog;
  1979. nbufs = mp->m_ialloc_blks / blks_per_cluster;
  1980. for (j = 0; j < nbufs; j++, inum += inodes_per_cluster) {
  1981. /*
  1982. * The allocation bitmap tells us which inodes of the chunk were
  1983. * physically allocated. Skip the cluster if an inode falls into
  1984. * a sparse region.
  1985. */
  1986. ioffset = inum - xic->first_ino;
  1987. if ((xic->alloc & XFS_INOBT_MASK(ioffset)) == 0) {
  1988. ASSERT(do_mod(ioffset, inodes_per_cluster) == 0);
  1989. continue;
  1990. }
  1991. blkno = XFS_AGB_TO_DADDR(mp, XFS_INO_TO_AGNO(mp, inum),
  1992. XFS_INO_TO_AGBNO(mp, inum));
  1993. /*
  1994. * We obtain and lock the backing buffer first in the process
  1995. * here, as we have to ensure that any dirty inode that we
  1996. * can't get the flush lock on is attached to the buffer.
  1997. * If we scan the in-memory inodes first, then buffer IO can
  1998. * complete before we get a lock on it, and hence we may fail
  1999. * to mark all the active inodes on the buffer stale.
  2000. */
  2001. bp = xfs_trans_get_buf(tp, mp->m_ddev_targp, blkno,
  2002. mp->m_bsize * blks_per_cluster,
  2003. XBF_UNMAPPED);
  2004. if (!bp)
  2005. return -ENOMEM;
  2006. /*
  2007. * This buffer may not have been correctly initialised as we
  2008. * didn't read it from disk. That's not important because we are
  2009. * only using to mark the buffer as stale in the log, and to
  2010. * attach stale cached inodes on it. That means it will never be
  2011. * dispatched for IO. If it is, we want to know about it, and we
  2012. * want it to fail. We can acheive this by adding a write
  2013. * verifier to the buffer.
  2014. */
  2015. bp->b_ops = &xfs_inode_buf_ops;
  2016. /*
  2017. * Walk the inodes already attached to the buffer and mark them
  2018. * stale. These will all have the flush locks held, so an
  2019. * in-memory inode walk can't lock them. By marking them all
  2020. * stale first, we will not attempt to lock them in the loop
  2021. * below as the XFS_ISTALE flag will be set.
  2022. */
  2023. list_for_each_entry(lip, &bp->b_li_list, li_bio_list) {
  2024. if (lip->li_type == XFS_LI_INODE) {
  2025. iip = (xfs_inode_log_item_t *)lip;
  2026. ASSERT(iip->ili_logged == 1);
  2027. lip->li_cb = xfs_istale_done;
  2028. xfs_trans_ail_copy_lsn(mp->m_ail,
  2029. &iip->ili_flush_lsn,
  2030. &iip->ili_item.li_lsn);
  2031. xfs_iflags_set(iip->ili_inode, XFS_ISTALE);
  2032. }
  2033. }
  2034. /*
  2035. * For each inode in memory attempt to add it to the inode
  2036. * buffer and set it up for being staled on buffer IO
  2037. * completion. This is safe as we've locked out tail pushing
  2038. * and flushing by locking the buffer.
  2039. *
  2040. * We have already marked every inode that was part of a
  2041. * transaction stale above, which means there is no point in
  2042. * even trying to lock them.
  2043. */
  2044. for (i = 0; i < inodes_per_cluster; i++) {
  2045. retry:
  2046. rcu_read_lock();
  2047. ip = radix_tree_lookup(&pag->pag_ici_root,
  2048. XFS_INO_TO_AGINO(mp, (inum + i)));
  2049. /* Inode not in memory, nothing to do */
  2050. if (!ip) {
  2051. rcu_read_unlock();
  2052. continue;
  2053. }
  2054. /*
  2055. * because this is an RCU protected lookup, we could
  2056. * find a recently freed or even reallocated inode
  2057. * during the lookup. We need to check under the
  2058. * i_flags_lock for a valid inode here. Skip it if it
  2059. * is not valid, the wrong inode or stale.
  2060. */
  2061. spin_lock(&ip->i_flags_lock);
  2062. if (ip->i_ino != inum + i ||
  2063. __xfs_iflags_test(ip, XFS_ISTALE)) {
  2064. spin_unlock(&ip->i_flags_lock);
  2065. rcu_read_unlock();
  2066. continue;
  2067. }
  2068. spin_unlock(&ip->i_flags_lock);
  2069. /*
  2070. * Don't try to lock/unlock the current inode, but we
  2071. * _cannot_ skip the other inodes that we did not find
  2072. * in the list attached to the buffer and are not
  2073. * already marked stale. If we can't lock it, back off
  2074. * and retry.
  2075. */
  2076. if (ip != free_ip) {
  2077. if (!xfs_ilock_nowait(ip, XFS_ILOCK_EXCL)) {
  2078. rcu_read_unlock();
  2079. delay(1);
  2080. goto retry;
  2081. }
  2082. /*
  2083. * Check the inode number again in case we're
  2084. * racing with freeing in xfs_reclaim_inode().
  2085. * See the comments in that function for more
  2086. * information as to why the initial check is
  2087. * not sufficient.
  2088. */
  2089. if (ip->i_ino != inum + i) {
  2090. xfs_iunlock(ip, XFS_ILOCK_EXCL);
  2091. rcu_read_unlock();
  2092. continue;
  2093. }
  2094. }
  2095. rcu_read_unlock();
  2096. xfs_iflock(ip);
  2097. xfs_iflags_set(ip, XFS_ISTALE);
  2098. /*
  2099. * we don't need to attach clean inodes or those only
  2100. * with unlogged changes (which we throw away, anyway).
  2101. */
  2102. iip = ip->i_itemp;
  2103. if (!iip || xfs_inode_clean(ip)) {
  2104. ASSERT(ip != free_ip);
  2105. xfs_ifunlock(ip);
  2106. xfs_iunlock(ip, XFS_ILOCK_EXCL);
  2107. continue;
  2108. }
  2109. iip->ili_last_fields = iip->ili_fields;
  2110. iip->ili_fields = 0;
  2111. iip->ili_fsync_fields = 0;
  2112. iip->ili_logged = 1;
  2113. xfs_trans_ail_copy_lsn(mp->m_ail, &iip->ili_flush_lsn,
  2114. &iip->ili_item.li_lsn);
  2115. xfs_buf_attach_iodone(bp, xfs_istale_done,
  2116. &iip->ili_item);
  2117. if (ip != free_ip)
  2118. xfs_iunlock(ip, XFS_ILOCK_EXCL);
  2119. }
  2120. xfs_trans_stale_inode_buf(tp, bp);
  2121. xfs_trans_binval(tp, bp);
  2122. }
  2123. xfs_perag_put(pag);
  2124. return 0;
  2125. }
  2126. /*
  2127. * Free any local-format buffers sitting around before we reset to
  2128. * extents format.
  2129. */
  2130. static inline void
  2131. xfs_ifree_local_data(
  2132. struct xfs_inode *ip,
  2133. int whichfork)
  2134. {
  2135. struct xfs_ifork *ifp;
  2136. if (XFS_IFORK_FORMAT(ip, whichfork) != XFS_DINODE_FMT_LOCAL)
  2137. return;
  2138. ifp = XFS_IFORK_PTR(ip, whichfork);
  2139. xfs_idata_realloc(ip, -ifp->if_bytes, whichfork);
  2140. }
  2141. /*
  2142. * This is called to return an inode to the inode free list.
  2143. * The inode should already be truncated to 0 length and have
  2144. * no pages associated with it. This routine also assumes that
  2145. * the inode is already a part of the transaction.
  2146. *
  2147. * The on-disk copy of the inode will have been added to the list
  2148. * of unlinked inodes in the AGI. We need to remove the inode from
  2149. * that list atomically with respect to freeing it here.
  2150. */
  2151. int
  2152. xfs_ifree(
  2153. xfs_trans_t *tp,
  2154. xfs_inode_t *ip,
  2155. struct xfs_defer_ops *dfops)
  2156. {
  2157. int error;
  2158. struct xfs_icluster xic = { 0 };
  2159. ASSERT(xfs_isilocked(ip, XFS_ILOCK_EXCL));
  2160. ASSERT(VFS_I(ip)->i_nlink == 0);
  2161. ASSERT(ip->i_d.di_nextents == 0);
  2162. ASSERT(ip->i_d.di_anextents == 0);
  2163. ASSERT(ip->i_d.di_size == 0 || !S_ISREG(VFS_I(ip)->i_mode));
  2164. ASSERT(ip->i_d.di_nblocks == 0);
  2165. /*
  2166. * Pull the on-disk inode from the AGI unlinked list.
  2167. */
  2168. error = xfs_iunlink_remove(tp, ip);
  2169. if (error)
  2170. return error;
  2171. error = xfs_difree(tp, ip->i_ino, dfops, &xic);
  2172. if (error)
  2173. return error;
  2174. xfs_ifree_local_data(ip, XFS_DATA_FORK);
  2175. xfs_ifree_local_data(ip, XFS_ATTR_FORK);
  2176. VFS_I(ip)->i_mode = 0; /* mark incore inode as free */
  2177. ip->i_d.di_flags = 0;
  2178. ip->i_d.di_flags2 = 0;
  2179. ip->i_d.di_dmevmask = 0;
  2180. ip->i_d.di_forkoff = 0; /* mark the attr fork not in use */
  2181. ip->i_d.di_format = XFS_DINODE_FMT_EXTENTS;
  2182. ip->i_d.di_aformat = XFS_DINODE_FMT_EXTENTS;
  2183. /* Don't attempt to replay owner changes for a deleted inode */
  2184. ip->i_itemp->ili_fields &= ~(XFS_ILOG_AOWNER|XFS_ILOG_DOWNER);
  2185. /*
  2186. * Bump the generation count so no one will be confused
  2187. * by reincarnations of this inode.
  2188. */
  2189. VFS_I(ip)->i_generation++;
  2190. xfs_trans_log_inode(tp, ip, XFS_ILOG_CORE);
  2191. if (xic.deleted)
  2192. error = xfs_ifree_cluster(ip, tp, &xic);
  2193. return error;
  2194. }
  2195. /*
  2196. * This is called to unpin an inode. The caller must have the inode locked
  2197. * in at least shared mode so that the buffer cannot be subsequently pinned
  2198. * once someone is waiting for it to be unpinned.
  2199. */
  2200. static void
  2201. xfs_iunpin(
  2202. struct xfs_inode *ip)
  2203. {
  2204. ASSERT(xfs_isilocked(ip, XFS_ILOCK_EXCL|XFS_ILOCK_SHARED));
  2205. trace_xfs_inode_unpin_nowait(ip, _RET_IP_);
  2206. /* Give the log a push to start the unpinning I/O */
  2207. xfs_log_force_lsn(ip->i_mount, ip->i_itemp->ili_last_lsn, 0, NULL);
  2208. }
  2209. static void
  2210. __xfs_iunpin_wait(
  2211. struct xfs_inode *ip)
  2212. {
  2213. wait_queue_head_t *wq = bit_waitqueue(&ip->i_flags, __XFS_IPINNED_BIT);
  2214. DEFINE_WAIT_BIT(wait, &ip->i_flags, __XFS_IPINNED_BIT);
  2215. xfs_iunpin(ip);
  2216. do {
  2217. prepare_to_wait(wq, &wait.wq_entry, TASK_UNINTERRUPTIBLE);
  2218. if (xfs_ipincount(ip))
  2219. io_schedule();
  2220. } while (xfs_ipincount(ip));
  2221. finish_wait(wq, &wait.wq_entry);
  2222. }
  2223. void
  2224. xfs_iunpin_wait(
  2225. struct xfs_inode *ip)
  2226. {
  2227. if (xfs_ipincount(ip))
  2228. __xfs_iunpin_wait(ip);
  2229. }
  2230. /*
  2231. * Removing an inode from the namespace involves removing the directory entry
  2232. * and dropping the link count on the inode. Removing the directory entry can
  2233. * result in locking an AGF (directory blocks were freed) and removing a link
  2234. * count can result in placing the inode on an unlinked list which results in
  2235. * locking an AGI.
  2236. *
  2237. * The big problem here is that we have an ordering constraint on AGF and AGI
  2238. * locking - inode allocation locks the AGI, then can allocate a new extent for
  2239. * new inodes, locking the AGF after the AGI. Similarly, freeing the inode
  2240. * removes the inode from the unlinked list, requiring that we lock the AGI
  2241. * first, and then freeing the inode can result in an inode chunk being freed
  2242. * and hence freeing disk space requiring that we lock an AGF.
  2243. *
  2244. * Hence the ordering that is imposed by other parts of the code is AGI before
  2245. * AGF. This means we cannot remove the directory entry before we drop the inode
  2246. * reference count and put it on the unlinked list as this results in a lock
  2247. * order of AGF then AGI, and this can deadlock against inode allocation and
  2248. * freeing. Therefore we must drop the link counts before we remove the
  2249. * directory entry.
  2250. *
  2251. * This is still safe from a transactional point of view - it is not until we
  2252. * get to xfs_defer_finish() that we have the possibility of multiple
  2253. * transactions in this operation. Hence as long as we remove the directory
  2254. * entry and drop the link count in the first transaction of the remove
  2255. * operation, there are no transactional constraints on the ordering here.
  2256. */
  2257. int
  2258. xfs_remove(
  2259. xfs_inode_t *dp,
  2260. struct xfs_name *name,
  2261. xfs_inode_t *ip)
  2262. {
  2263. xfs_mount_t *mp = dp->i_mount;
  2264. xfs_trans_t *tp = NULL;
  2265. int is_dir = S_ISDIR(VFS_I(ip)->i_mode);
  2266. int error = 0;
  2267. struct xfs_defer_ops dfops;
  2268. xfs_fsblock_t first_block;
  2269. uint resblks;
  2270. trace_xfs_remove(dp, name);
  2271. if (XFS_FORCED_SHUTDOWN(mp))
  2272. return -EIO;
  2273. error = xfs_qm_dqattach(dp, 0);
  2274. if (error)
  2275. goto std_return;
  2276. error = xfs_qm_dqattach(ip, 0);
  2277. if (error)
  2278. goto std_return;
  2279. /*
  2280. * We try to get the real space reservation first,
  2281. * allowing for directory btree deletion(s) implying
  2282. * possible bmap insert(s). If we can't get the space
  2283. * reservation then we use 0 instead, and avoid the bmap
  2284. * btree insert(s) in the directory code by, if the bmap
  2285. * insert tries to happen, instead trimming the LAST
  2286. * block from the directory.
  2287. */
  2288. resblks = XFS_REMOVE_SPACE_RES(mp);
  2289. error = xfs_trans_alloc(mp, &M_RES(mp)->tr_remove, resblks, 0, 0, &tp);
  2290. if (error == -ENOSPC) {
  2291. resblks = 0;
  2292. error = xfs_trans_alloc(mp, &M_RES(mp)->tr_remove, 0, 0, 0,
  2293. &tp);
  2294. }
  2295. if (error) {
  2296. ASSERT(error != -ENOSPC);
  2297. goto std_return;
  2298. }
  2299. xfs_lock_two_inodes(dp, XFS_ILOCK_EXCL, ip, XFS_ILOCK_EXCL);
  2300. xfs_trans_ijoin(tp, dp, XFS_ILOCK_EXCL);
  2301. xfs_trans_ijoin(tp, ip, XFS_ILOCK_EXCL);
  2302. /*
  2303. * If we're removing a directory perform some additional validation.
  2304. */
  2305. if (is_dir) {
  2306. ASSERT(VFS_I(ip)->i_nlink >= 2);
  2307. if (VFS_I(ip)->i_nlink != 2) {
  2308. error = -ENOTEMPTY;
  2309. goto out_trans_cancel;
  2310. }
  2311. if (!xfs_dir_isempty(ip)) {
  2312. error = -ENOTEMPTY;
  2313. goto out_trans_cancel;
  2314. }
  2315. /* Drop the link from ip's "..". */
  2316. error = xfs_droplink(tp, dp);
  2317. if (error)
  2318. goto out_trans_cancel;
  2319. /* Drop the "." link from ip to self. */
  2320. error = xfs_droplink(tp, ip);
  2321. if (error)
  2322. goto out_trans_cancel;
  2323. } else {
  2324. /*
  2325. * When removing a non-directory we need to log the parent
  2326. * inode here. For a directory this is done implicitly
  2327. * by the xfs_droplink call for the ".." entry.
  2328. */
  2329. xfs_trans_log_inode(tp, dp, XFS_ILOG_CORE);
  2330. }
  2331. xfs_trans_ichgtime(tp, dp, XFS_ICHGTIME_MOD | XFS_ICHGTIME_CHG);
  2332. /* Drop the link from dp to ip. */
  2333. error = xfs_droplink(tp, ip);
  2334. if (error)
  2335. goto out_trans_cancel;
  2336. xfs_defer_init(&dfops, &first_block);
  2337. error = xfs_dir_removename(tp, dp, name, ip->i_ino,
  2338. &first_block, &dfops, resblks);
  2339. if (error) {
  2340. ASSERT(error != -ENOENT);
  2341. goto out_bmap_cancel;
  2342. }
  2343. /*
  2344. * If this is a synchronous mount, make sure that the
  2345. * remove transaction goes to disk before returning to
  2346. * the user.
  2347. */
  2348. if (mp->m_flags & (XFS_MOUNT_WSYNC|XFS_MOUNT_DIRSYNC))
  2349. xfs_trans_set_sync(tp);
  2350. error = xfs_defer_finish(&tp, &dfops);
  2351. if (error)
  2352. goto out_bmap_cancel;
  2353. error = xfs_trans_commit(tp);
  2354. if (error)
  2355. goto std_return;
  2356. if (is_dir && xfs_inode_is_filestream(ip))
  2357. xfs_filestream_deassociate(ip);
  2358. return 0;
  2359. out_bmap_cancel:
  2360. xfs_defer_cancel(&dfops);
  2361. out_trans_cancel:
  2362. xfs_trans_cancel(tp);
  2363. std_return:
  2364. return error;
  2365. }
  2366. /*
  2367. * Enter all inodes for a rename transaction into a sorted array.
  2368. */
  2369. #define __XFS_SORT_INODES 5
  2370. STATIC void
  2371. xfs_sort_for_rename(
  2372. struct xfs_inode *dp1, /* in: old (source) directory inode */
  2373. struct xfs_inode *dp2, /* in: new (target) directory inode */
  2374. struct xfs_inode *ip1, /* in: inode of old entry */
  2375. struct xfs_inode *ip2, /* in: inode of new entry */
  2376. struct xfs_inode *wip, /* in: whiteout inode */
  2377. struct xfs_inode **i_tab,/* out: sorted array of inodes */
  2378. int *num_inodes) /* in/out: inodes in array */
  2379. {
  2380. int i, j;
  2381. ASSERT(*num_inodes == __XFS_SORT_INODES);
  2382. memset(i_tab, 0, *num_inodes * sizeof(struct xfs_inode *));
  2383. /*
  2384. * i_tab contains a list of pointers to inodes. We initialize
  2385. * the table here & we'll sort it. We will then use it to
  2386. * order the acquisition of the inode locks.
  2387. *
  2388. * Note that the table may contain duplicates. e.g., dp1 == dp2.
  2389. */
  2390. i = 0;
  2391. i_tab[i++] = dp1;
  2392. i_tab[i++] = dp2;
  2393. i_tab[i++] = ip1;
  2394. if (ip2)
  2395. i_tab[i++] = ip2;
  2396. if (wip)
  2397. i_tab[i++] = wip;
  2398. *num_inodes = i;
  2399. /*
  2400. * Sort the elements via bubble sort. (Remember, there are at
  2401. * most 5 elements to sort, so this is adequate.)
  2402. */
  2403. for (i = 0; i < *num_inodes; i++) {
  2404. for (j = 1; j < *num_inodes; j++) {
  2405. if (i_tab[j]->i_ino < i_tab[j-1]->i_ino) {
  2406. struct xfs_inode *temp = i_tab[j];
  2407. i_tab[j] = i_tab[j-1];
  2408. i_tab[j-1] = temp;
  2409. }
  2410. }
  2411. }
  2412. }
  2413. static int
  2414. xfs_finish_rename(
  2415. struct xfs_trans *tp,
  2416. struct xfs_defer_ops *dfops)
  2417. {
  2418. int error;
  2419. /*
  2420. * If this is a synchronous mount, make sure that the rename transaction
  2421. * goes to disk before returning to the user.
  2422. */
  2423. if (tp->t_mountp->m_flags & (XFS_MOUNT_WSYNC|XFS_MOUNT_DIRSYNC))
  2424. xfs_trans_set_sync(tp);
  2425. error = xfs_defer_finish(&tp, dfops);
  2426. if (error) {
  2427. xfs_defer_cancel(dfops);
  2428. xfs_trans_cancel(tp);
  2429. return error;
  2430. }
  2431. return xfs_trans_commit(tp);
  2432. }
  2433. /*
  2434. * xfs_cross_rename()
  2435. *
  2436. * responsible for handling RENAME_EXCHANGE flag in renameat2() sytemcall
  2437. */
  2438. STATIC int
  2439. xfs_cross_rename(
  2440. struct xfs_trans *tp,
  2441. struct xfs_inode *dp1,
  2442. struct xfs_name *name1,
  2443. struct xfs_inode *ip1,
  2444. struct xfs_inode *dp2,
  2445. struct xfs_name *name2,
  2446. struct xfs_inode *ip2,
  2447. struct xfs_defer_ops *dfops,
  2448. xfs_fsblock_t *first_block,
  2449. int spaceres)
  2450. {
  2451. int error = 0;
  2452. int ip1_flags = 0;
  2453. int ip2_flags = 0;
  2454. int dp2_flags = 0;
  2455. /* Swap inode number for dirent in first parent */
  2456. error = xfs_dir_replace(tp, dp1, name1,
  2457. ip2->i_ino,
  2458. first_block, dfops, spaceres);
  2459. if (error)
  2460. goto out_trans_abort;
  2461. /* Swap inode number for dirent in second parent */
  2462. error = xfs_dir_replace(tp, dp2, name2,
  2463. ip1->i_ino,
  2464. first_block, dfops, spaceres);
  2465. if (error)
  2466. goto out_trans_abort;
  2467. /*
  2468. * If we're renaming one or more directories across different parents,
  2469. * update the respective ".." entries (and link counts) to match the new
  2470. * parents.
  2471. */
  2472. if (dp1 != dp2) {
  2473. dp2_flags = XFS_ICHGTIME_MOD | XFS_ICHGTIME_CHG;
  2474. if (S_ISDIR(VFS_I(ip2)->i_mode)) {
  2475. error = xfs_dir_replace(tp, ip2, &xfs_name_dotdot,
  2476. dp1->i_ino, first_block,
  2477. dfops, spaceres);
  2478. if (error)
  2479. goto out_trans_abort;
  2480. /* transfer ip2 ".." reference to dp1 */
  2481. if (!S_ISDIR(VFS_I(ip1)->i_mode)) {
  2482. error = xfs_droplink(tp, dp2);
  2483. if (error)
  2484. goto out_trans_abort;
  2485. error = xfs_bumplink(tp, dp1);
  2486. if (error)
  2487. goto out_trans_abort;
  2488. }
  2489. /*
  2490. * Although ip1 isn't changed here, userspace needs
  2491. * to be warned about the change, so that applications
  2492. * relying on it (like backup ones), will properly
  2493. * notify the change
  2494. */
  2495. ip1_flags |= XFS_ICHGTIME_CHG;
  2496. ip2_flags |= XFS_ICHGTIME_MOD | XFS_ICHGTIME_CHG;
  2497. }
  2498. if (S_ISDIR(VFS_I(ip1)->i_mode)) {
  2499. error = xfs_dir_replace(tp, ip1, &xfs_name_dotdot,
  2500. dp2->i_ino, first_block,
  2501. dfops, spaceres);
  2502. if (error)
  2503. goto out_trans_abort;
  2504. /* transfer ip1 ".." reference to dp2 */
  2505. if (!S_ISDIR(VFS_I(ip2)->i_mode)) {
  2506. error = xfs_droplink(tp, dp1);
  2507. if (error)
  2508. goto out_trans_abort;
  2509. error = xfs_bumplink(tp, dp2);
  2510. if (error)
  2511. goto out_trans_abort;
  2512. }
  2513. /*
  2514. * Although ip2 isn't changed here, userspace needs
  2515. * to be warned about the change, so that applications
  2516. * relying on it (like backup ones), will properly
  2517. * notify the change
  2518. */
  2519. ip1_flags |= XFS_ICHGTIME_MOD | XFS_ICHGTIME_CHG;
  2520. ip2_flags |= XFS_ICHGTIME_CHG;
  2521. }
  2522. }
  2523. if (ip1_flags) {
  2524. xfs_trans_ichgtime(tp, ip1, ip1_flags);
  2525. xfs_trans_log_inode(tp, ip1, XFS_ILOG_CORE);
  2526. }
  2527. if (ip2_flags) {
  2528. xfs_trans_ichgtime(tp, ip2, ip2_flags);
  2529. xfs_trans_log_inode(tp, ip2, XFS_ILOG_CORE);
  2530. }
  2531. if (dp2_flags) {
  2532. xfs_trans_ichgtime(tp, dp2, dp2_flags);
  2533. xfs_trans_log_inode(tp, dp2, XFS_ILOG_CORE);
  2534. }
  2535. xfs_trans_ichgtime(tp, dp1, XFS_ICHGTIME_MOD | XFS_ICHGTIME_CHG);
  2536. xfs_trans_log_inode(tp, dp1, XFS_ILOG_CORE);
  2537. return xfs_finish_rename(tp, dfops);
  2538. out_trans_abort:
  2539. xfs_defer_cancel(dfops);
  2540. xfs_trans_cancel(tp);
  2541. return error;
  2542. }
  2543. /*
  2544. * xfs_rename_alloc_whiteout()
  2545. *
  2546. * Return a referenced, unlinked, unlocked inode that that can be used as a
  2547. * whiteout in a rename transaction. We use a tmpfile inode here so that if we
  2548. * crash between allocating the inode and linking it into the rename transaction
  2549. * recovery will free the inode and we won't leak it.
  2550. */
  2551. static int
  2552. xfs_rename_alloc_whiteout(
  2553. struct xfs_inode *dp,
  2554. struct xfs_inode **wip)
  2555. {
  2556. struct xfs_inode *tmpfile;
  2557. int error;
  2558. error = xfs_create_tmpfile(dp, S_IFCHR | WHITEOUT_MODE, &tmpfile);
  2559. if (error)
  2560. return error;
  2561. /*
  2562. * Prepare the tmpfile inode as if it were created through the VFS.
  2563. * Otherwise, the link increment paths will complain about nlink 0->1.
  2564. * Drop the link count as done by d_tmpfile(), complete the inode setup
  2565. * and flag it as linkable.
  2566. */
  2567. drop_nlink(VFS_I(tmpfile));
  2568. xfs_setup_iops(tmpfile);
  2569. xfs_finish_inode_setup(tmpfile);
  2570. VFS_I(tmpfile)->i_state |= I_LINKABLE;
  2571. *wip = tmpfile;
  2572. return 0;
  2573. }
  2574. /*
  2575. * xfs_rename
  2576. */
  2577. int
  2578. xfs_rename(
  2579. struct xfs_inode *src_dp,
  2580. struct xfs_name *src_name,
  2581. struct xfs_inode *src_ip,
  2582. struct xfs_inode *target_dp,
  2583. struct xfs_name *target_name,
  2584. struct xfs_inode *target_ip,
  2585. unsigned int flags)
  2586. {
  2587. struct xfs_mount *mp = src_dp->i_mount;
  2588. struct xfs_trans *tp;
  2589. struct xfs_defer_ops dfops;
  2590. xfs_fsblock_t first_block;
  2591. struct xfs_inode *wip = NULL; /* whiteout inode */
  2592. struct xfs_inode *inodes[__XFS_SORT_INODES];
  2593. int num_inodes = __XFS_SORT_INODES;
  2594. bool new_parent = (src_dp != target_dp);
  2595. bool src_is_directory = S_ISDIR(VFS_I(src_ip)->i_mode);
  2596. int spaceres;
  2597. int error;
  2598. trace_xfs_rename(src_dp, target_dp, src_name, target_name);
  2599. if ((flags & RENAME_EXCHANGE) && !target_ip)
  2600. return -EINVAL;
  2601. /*
  2602. * If we are doing a whiteout operation, allocate the whiteout inode
  2603. * we will be placing at the target and ensure the type is set
  2604. * appropriately.
  2605. */
  2606. if (flags & RENAME_WHITEOUT) {
  2607. ASSERT(!(flags & (RENAME_NOREPLACE | RENAME_EXCHANGE)));
  2608. error = xfs_rename_alloc_whiteout(target_dp, &wip);
  2609. if (error)
  2610. return error;
  2611. /* setup target dirent info as whiteout */
  2612. src_name->type = XFS_DIR3_FT_CHRDEV;
  2613. }
  2614. xfs_sort_for_rename(src_dp, target_dp, src_ip, target_ip, wip,
  2615. inodes, &num_inodes);
  2616. spaceres = XFS_RENAME_SPACE_RES(mp, target_name->len);
  2617. error = xfs_trans_alloc(mp, &M_RES(mp)->tr_rename, spaceres, 0, 0, &tp);
  2618. if (error == -ENOSPC) {
  2619. spaceres = 0;
  2620. error = xfs_trans_alloc(mp, &M_RES(mp)->tr_rename, 0, 0, 0,
  2621. &tp);
  2622. }
  2623. if (error)
  2624. goto out_release_wip;
  2625. /*
  2626. * Attach the dquots to the inodes
  2627. */
  2628. error = xfs_qm_vop_rename_dqattach(inodes);
  2629. if (error)
  2630. goto out_trans_cancel;
  2631. /*
  2632. * Lock all the participating inodes. Depending upon whether
  2633. * the target_name exists in the target directory, and
  2634. * whether the target directory is the same as the source
  2635. * directory, we can lock from 2 to 4 inodes.
  2636. */
  2637. xfs_lock_inodes(inodes, num_inodes, XFS_ILOCK_EXCL);
  2638. /*
  2639. * Join all the inodes to the transaction. From this point on,
  2640. * we can rely on either trans_commit or trans_cancel to unlock
  2641. * them.
  2642. */
  2643. xfs_trans_ijoin(tp, src_dp, XFS_ILOCK_EXCL);
  2644. if (new_parent)
  2645. xfs_trans_ijoin(tp, target_dp, XFS_ILOCK_EXCL);
  2646. xfs_trans_ijoin(tp, src_ip, XFS_ILOCK_EXCL);
  2647. if (target_ip)
  2648. xfs_trans_ijoin(tp, target_ip, XFS_ILOCK_EXCL);
  2649. if (wip)
  2650. xfs_trans_ijoin(tp, wip, XFS_ILOCK_EXCL);
  2651. /*
  2652. * If we are using project inheritance, we only allow renames
  2653. * into our tree when the project IDs are the same; else the
  2654. * tree quota mechanism would be circumvented.
  2655. */
  2656. if (unlikely((target_dp->i_d.di_flags & XFS_DIFLAG_PROJINHERIT) &&
  2657. (xfs_get_projid(target_dp) != xfs_get_projid(src_ip)))) {
  2658. error = -EXDEV;
  2659. goto out_trans_cancel;
  2660. }
  2661. xfs_defer_init(&dfops, &first_block);
  2662. /* RENAME_EXCHANGE is unique from here on. */
  2663. if (flags & RENAME_EXCHANGE)
  2664. return xfs_cross_rename(tp, src_dp, src_name, src_ip,
  2665. target_dp, target_name, target_ip,
  2666. &dfops, &first_block, spaceres);
  2667. /*
  2668. * Set up the target.
  2669. */
  2670. if (target_ip == NULL) {
  2671. /*
  2672. * If there's no space reservation, check the entry will
  2673. * fit before actually inserting it.
  2674. */
  2675. if (!spaceres) {
  2676. error = xfs_dir_canenter(tp, target_dp, target_name);
  2677. if (error)
  2678. goto out_trans_cancel;
  2679. }
  2680. /*
  2681. * If target does not exist and the rename crosses
  2682. * directories, adjust the target directory link count
  2683. * to account for the ".." reference from the new entry.
  2684. */
  2685. error = xfs_dir_createname(tp, target_dp, target_name,
  2686. src_ip->i_ino, &first_block,
  2687. &dfops, spaceres);
  2688. if (error)
  2689. goto out_bmap_cancel;
  2690. xfs_trans_ichgtime(tp, target_dp,
  2691. XFS_ICHGTIME_MOD | XFS_ICHGTIME_CHG);
  2692. if (new_parent && src_is_directory) {
  2693. error = xfs_bumplink(tp, target_dp);
  2694. if (error)
  2695. goto out_bmap_cancel;
  2696. }
  2697. } else { /* target_ip != NULL */
  2698. /*
  2699. * If target exists and it's a directory, check that both
  2700. * target and source are directories and that target can be
  2701. * destroyed, or that neither is a directory.
  2702. */
  2703. if (S_ISDIR(VFS_I(target_ip)->i_mode)) {
  2704. /*
  2705. * Make sure target dir is empty.
  2706. */
  2707. if (!(xfs_dir_isempty(target_ip)) ||
  2708. (VFS_I(target_ip)->i_nlink > 2)) {
  2709. error = -EEXIST;
  2710. goto out_trans_cancel;
  2711. }
  2712. }
  2713. /*
  2714. * Link the source inode under the target name.
  2715. * If the source inode is a directory and we are moving
  2716. * it across directories, its ".." entry will be
  2717. * inconsistent until we replace that down below.
  2718. *
  2719. * In case there is already an entry with the same
  2720. * name at the destination directory, remove it first.
  2721. */
  2722. error = xfs_dir_replace(tp, target_dp, target_name,
  2723. src_ip->i_ino,
  2724. &first_block, &dfops, spaceres);
  2725. if (error)
  2726. goto out_bmap_cancel;
  2727. xfs_trans_ichgtime(tp, target_dp,
  2728. XFS_ICHGTIME_MOD | XFS_ICHGTIME_CHG);
  2729. /*
  2730. * Decrement the link count on the target since the target
  2731. * dir no longer points to it.
  2732. */
  2733. error = xfs_droplink(tp, target_ip);
  2734. if (error)
  2735. goto out_bmap_cancel;
  2736. if (src_is_directory) {
  2737. /*
  2738. * Drop the link from the old "." entry.
  2739. */
  2740. error = xfs_droplink(tp, target_ip);
  2741. if (error)
  2742. goto out_bmap_cancel;
  2743. }
  2744. } /* target_ip != NULL */
  2745. /*
  2746. * Remove the source.
  2747. */
  2748. if (new_parent && src_is_directory) {
  2749. /*
  2750. * Rewrite the ".." entry to point to the new
  2751. * directory.
  2752. */
  2753. error = xfs_dir_replace(tp, src_ip, &xfs_name_dotdot,
  2754. target_dp->i_ino,
  2755. &first_block, &dfops, spaceres);
  2756. ASSERT(error != -EEXIST);
  2757. if (error)
  2758. goto out_bmap_cancel;
  2759. }
  2760. /*
  2761. * We always want to hit the ctime on the source inode.
  2762. *
  2763. * This isn't strictly required by the standards since the source
  2764. * inode isn't really being changed, but old unix file systems did
  2765. * it and some incremental backup programs won't work without it.
  2766. */
  2767. xfs_trans_ichgtime(tp, src_ip, XFS_ICHGTIME_CHG);
  2768. xfs_trans_log_inode(tp, src_ip, XFS_ILOG_CORE);
  2769. /*
  2770. * Adjust the link count on src_dp. This is necessary when
  2771. * renaming a directory, either within one parent when
  2772. * the target existed, or across two parent directories.
  2773. */
  2774. if (src_is_directory && (new_parent || target_ip != NULL)) {
  2775. /*
  2776. * Decrement link count on src_directory since the
  2777. * entry that's moved no longer points to it.
  2778. */
  2779. error = xfs_droplink(tp, src_dp);
  2780. if (error)
  2781. goto out_bmap_cancel;
  2782. }
  2783. /*
  2784. * For whiteouts, we only need to update the source dirent with the
  2785. * inode number of the whiteout inode rather than removing it
  2786. * altogether.
  2787. */
  2788. if (wip) {
  2789. error = xfs_dir_replace(tp, src_dp, src_name, wip->i_ino,
  2790. &first_block, &dfops, spaceres);
  2791. } else
  2792. error = xfs_dir_removename(tp, src_dp, src_name, src_ip->i_ino,
  2793. &first_block, &dfops, spaceres);
  2794. if (error)
  2795. goto out_bmap_cancel;
  2796. /*
  2797. * For whiteouts, we need to bump the link count on the whiteout inode.
  2798. * This means that failures all the way up to this point leave the inode
  2799. * on the unlinked list and so cleanup is a simple matter of dropping
  2800. * the remaining reference to it. If we fail here after bumping the link
  2801. * count, we're shutting down the filesystem so we'll never see the
  2802. * intermediate state on disk.
  2803. */
  2804. if (wip) {
  2805. ASSERT(VFS_I(wip)->i_nlink == 0);
  2806. error = xfs_bumplink(tp, wip);
  2807. if (error)
  2808. goto out_bmap_cancel;
  2809. error = xfs_iunlink_remove(tp, wip);
  2810. if (error)
  2811. goto out_bmap_cancel;
  2812. xfs_trans_log_inode(tp, wip, XFS_ILOG_CORE);
  2813. /*
  2814. * Now we have a real link, clear the "I'm a tmpfile" state
  2815. * flag from the inode so it doesn't accidentally get misused in
  2816. * future.
  2817. */
  2818. VFS_I(wip)->i_state &= ~I_LINKABLE;
  2819. }
  2820. xfs_trans_ichgtime(tp, src_dp, XFS_ICHGTIME_MOD | XFS_ICHGTIME_CHG);
  2821. xfs_trans_log_inode(tp, src_dp, XFS_ILOG_CORE);
  2822. if (new_parent)
  2823. xfs_trans_log_inode(tp, target_dp, XFS_ILOG_CORE);
  2824. error = xfs_finish_rename(tp, &dfops);
  2825. if (wip)
  2826. IRELE(wip);
  2827. return error;
  2828. out_bmap_cancel:
  2829. xfs_defer_cancel(&dfops);
  2830. out_trans_cancel:
  2831. xfs_trans_cancel(tp);
  2832. out_release_wip:
  2833. if (wip)
  2834. IRELE(wip);
  2835. return error;
  2836. }
  2837. STATIC int
  2838. xfs_iflush_cluster(
  2839. struct xfs_inode *ip,
  2840. struct xfs_buf *bp)
  2841. {
  2842. struct xfs_mount *mp = ip->i_mount;
  2843. struct xfs_perag *pag;
  2844. unsigned long first_index, mask;
  2845. unsigned long inodes_per_cluster;
  2846. int cilist_size;
  2847. struct xfs_inode **cilist;
  2848. struct xfs_inode *cip;
  2849. int nr_found;
  2850. int clcount = 0;
  2851. int bufwasdelwri;
  2852. int i;
  2853. pag = xfs_perag_get(mp, XFS_INO_TO_AGNO(mp, ip->i_ino));
  2854. inodes_per_cluster = mp->m_inode_cluster_size >> mp->m_sb.sb_inodelog;
  2855. cilist_size = inodes_per_cluster * sizeof(xfs_inode_t *);
  2856. cilist = kmem_alloc(cilist_size, KM_MAYFAIL|KM_NOFS);
  2857. if (!cilist)
  2858. goto out_put;
  2859. mask = ~(((mp->m_inode_cluster_size >> mp->m_sb.sb_inodelog)) - 1);
  2860. first_index = XFS_INO_TO_AGINO(mp, ip->i_ino) & mask;
  2861. rcu_read_lock();
  2862. /* really need a gang lookup range call here */
  2863. nr_found = radix_tree_gang_lookup(&pag->pag_ici_root, (void**)cilist,
  2864. first_index, inodes_per_cluster);
  2865. if (nr_found == 0)
  2866. goto out_free;
  2867. for (i = 0; i < nr_found; i++) {
  2868. cip = cilist[i];
  2869. if (cip == ip)
  2870. continue;
  2871. /*
  2872. * because this is an RCU protected lookup, we could find a
  2873. * recently freed or even reallocated inode during the lookup.
  2874. * We need to check under the i_flags_lock for a valid inode
  2875. * here. Skip it if it is not valid or the wrong inode.
  2876. */
  2877. spin_lock(&cip->i_flags_lock);
  2878. if (!cip->i_ino ||
  2879. __xfs_iflags_test(cip, XFS_ISTALE)) {
  2880. spin_unlock(&cip->i_flags_lock);
  2881. continue;
  2882. }
  2883. /*
  2884. * Once we fall off the end of the cluster, no point checking
  2885. * any more inodes in the list because they will also all be
  2886. * outside the cluster.
  2887. */
  2888. if ((XFS_INO_TO_AGINO(mp, cip->i_ino) & mask) != first_index) {
  2889. spin_unlock(&cip->i_flags_lock);
  2890. break;
  2891. }
  2892. spin_unlock(&cip->i_flags_lock);
  2893. /*
  2894. * Do an un-protected check to see if the inode is dirty and
  2895. * is a candidate for flushing. These checks will be repeated
  2896. * later after the appropriate locks are acquired.
  2897. */
  2898. if (xfs_inode_clean(cip) && xfs_ipincount(cip) == 0)
  2899. continue;
  2900. /*
  2901. * Try to get locks. If any are unavailable or it is pinned,
  2902. * then this inode cannot be flushed and is skipped.
  2903. */
  2904. if (!xfs_ilock_nowait(cip, XFS_ILOCK_SHARED))
  2905. continue;
  2906. if (!xfs_iflock_nowait(cip)) {
  2907. xfs_iunlock(cip, XFS_ILOCK_SHARED);
  2908. continue;
  2909. }
  2910. if (xfs_ipincount(cip)) {
  2911. xfs_ifunlock(cip);
  2912. xfs_iunlock(cip, XFS_ILOCK_SHARED);
  2913. continue;
  2914. }
  2915. /*
  2916. * Check the inode number again, just to be certain we are not
  2917. * racing with freeing in xfs_reclaim_inode(). See the comments
  2918. * in that function for more information as to why the initial
  2919. * check is not sufficient.
  2920. */
  2921. if (!cip->i_ino) {
  2922. xfs_ifunlock(cip);
  2923. xfs_iunlock(cip, XFS_ILOCK_SHARED);
  2924. continue;
  2925. }
  2926. /*
  2927. * arriving here means that this inode can be flushed. First
  2928. * re-check that it's dirty before flushing.
  2929. */
  2930. if (!xfs_inode_clean(cip)) {
  2931. int error;
  2932. error = xfs_iflush_int(cip, bp);
  2933. if (error) {
  2934. xfs_iunlock(cip, XFS_ILOCK_SHARED);
  2935. goto cluster_corrupt_out;
  2936. }
  2937. clcount++;
  2938. } else {
  2939. xfs_ifunlock(cip);
  2940. }
  2941. xfs_iunlock(cip, XFS_ILOCK_SHARED);
  2942. }
  2943. if (clcount) {
  2944. XFS_STATS_INC(mp, xs_icluster_flushcnt);
  2945. XFS_STATS_ADD(mp, xs_icluster_flushinode, clcount);
  2946. }
  2947. out_free:
  2948. rcu_read_unlock();
  2949. kmem_free(cilist);
  2950. out_put:
  2951. xfs_perag_put(pag);
  2952. return 0;
  2953. cluster_corrupt_out:
  2954. /*
  2955. * Corruption detected in the clustering loop. Invalidate the
  2956. * inode buffer and shut down the filesystem.
  2957. */
  2958. rcu_read_unlock();
  2959. /*
  2960. * Clean up the buffer. If it was delwri, just release it --
  2961. * brelse can handle it with no problems. If not, shut down the
  2962. * filesystem before releasing the buffer.
  2963. */
  2964. bufwasdelwri = (bp->b_flags & _XBF_DELWRI_Q);
  2965. if (bufwasdelwri)
  2966. xfs_buf_relse(bp);
  2967. xfs_force_shutdown(mp, SHUTDOWN_CORRUPT_INCORE);
  2968. if (!bufwasdelwri) {
  2969. /*
  2970. * Just like incore_relse: if we have b_iodone functions,
  2971. * mark the buffer as an error and call them. Otherwise
  2972. * mark it as stale and brelse.
  2973. */
  2974. if (bp->b_iodone) {
  2975. bp->b_flags &= ~XBF_DONE;
  2976. xfs_buf_stale(bp);
  2977. xfs_buf_ioerror(bp, -EIO);
  2978. xfs_buf_ioend(bp);
  2979. } else {
  2980. xfs_buf_stale(bp);
  2981. xfs_buf_relse(bp);
  2982. }
  2983. }
  2984. /*
  2985. * Unlocks the flush lock
  2986. */
  2987. xfs_iflush_abort(cip, false);
  2988. kmem_free(cilist);
  2989. xfs_perag_put(pag);
  2990. return -EFSCORRUPTED;
  2991. }
  2992. /*
  2993. * Flush dirty inode metadata into the backing buffer.
  2994. *
  2995. * The caller must have the inode lock and the inode flush lock held. The
  2996. * inode lock will still be held upon return to the caller, and the inode
  2997. * flush lock will be released after the inode has reached the disk.
  2998. *
  2999. * The caller must write out the buffer returned in *bpp and release it.
  3000. */
  3001. int
  3002. xfs_iflush(
  3003. struct xfs_inode *ip,
  3004. struct xfs_buf **bpp)
  3005. {
  3006. struct xfs_mount *mp = ip->i_mount;
  3007. struct xfs_buf *bp = NULL;
  3008. struct xfs_dinode *dip;
  3009. int error;
  3010. XFS_STATS_INC(mp, xs_iflush_count);
  3011. ASSERT(xfs_isilocked(ip, XFS_ILOCK_EXCL|XFS_ILOCK_SHARED));
  3012. ASSERT(xfs_isiflocked(ip));
  3013. ASSERT(ip->i_d.di_format != XFS_DINODE_FMT_BTREE ||
  3014. ip->i_d.di_nextents > XFS_IFORK_MAXEXT(ip, XFS_DATA_FORK));
  3015. *bpp = NULL;
  3016. xfs_iunpin_wait(ip);
  3017. /*
  3018. * For stale inodes we cannot rely on the backing buffer remaining
  3019. * stale in cache for the remaining life of the stale inode and so
  3020. * xfs_imap_to_bp() below may give us a buffer that no longer contains
  3021. * inodes below. We have to check this after ensuring the inode is
  3022. * unpinned so that it is safe to reclaim the stale inode after the
  3023. * flush call.
  3024. */
  3025. if (xfs_iflags_test(ip, XFS_ISTALE)) {
  3026. xfs_ifunlock(ip);
  3027. return 0;
  3028. }
  3029. /*
  3030. * This may have been unpinned because the filesystem is shutting
  3031. * down forcibly. If that's the case we must not write this inode
  3032. * to disk, because the log record didn't make it to disk.
  3033. *
  3034. * We also have to remove the log item from the AIL in this case,
  3035. * as we wait for an empty AIL as part of the unmount process.
  3036. */
  3037. if (XFS_FORCED_SHUTDOWN(mp)) {
  3038. error = -EIO;
  3039. goto abort_out;
  3040. }
  3041. /*
  3042. * Get the buffer containing the on-disk inode. We are doing a try-lock
  3043. * operation here, so we may get an EAGAIN error. In that case, we
  3044. * simply want to return with the inode still dirty.
  3045. *
  3046. * If we get any other error, we effectively have a corruption situation
  3047. * and we cannot flush the inode, so we treat it the same as failing
  3048. * xfs_iflush_int().
  3049. */
  3050. error = xfs_imap_to_bp(mp, NULL, &ip->i_imap, &dip, &bp, XBF_TRYLOCK,
  3051. 0);
  3052. if (error == -EAGAIN) {
  3053. xfs_ifunlock(ip);
  3054. return error;
  3055. }
  3056. if (error)
  3057. goto corrupt_out;
  3058. /*
  3059. * First flush out the inode that xfs_iflush was called with.
  3060. */
  3061. error = xfs_iflush_int(ip, bp);
  3062. if (error)
  3063. goto corrupt_out;
  3064. /*
  3065. * If the buffer is pinned then push on the log now so we won't
  3066. * get stuck waiting in the write for too long.
  3067. */
  3068. if (xfs_buf_ispinned(bp))
  3069. xfs_log_force(mp, 0);
  3070. /*
  3071. * inode clustering:
  3072. * see if other inodes can be gathered into this write
  3073. */
  3074. error = xfs_iflush_cluster(ip, bp);
  3075. if (error)
  3076. goto cluster_corrupt_out;
  3077. *bpp = bp;
  3078. return 0;
  3079. corrupt_out:
  3080. if (bp)
  3081. xfs_buf_relse(bp);
  3082. xfs_force_shutdown(mp, SHUTDOWN_CORRUPT_INCORE);
  3083. cluster_corrupt_out:
  3084. error = -EFSCORRUPTED;
  3085. abort_out:
  3086. /*
  3087. * Unlocks the flush lock
  3088. */
  3089. xfs_iflush_abort(ip, false);
  3090. return error;
  3091. }
  3092. /*
  3093. * If there are inline format data / attr forks attached to this inode,
  3094. * make sure they're not corrupt.
  3095. */
  3096. bool
  3097. xfs_inode_verify_forks(
  3098. struct xfs_inode *ip)
  3099. {
  3100. struct xfs_ifork *ifp;
  3101. xfs_failaddr_t fa;
  3102. fa = xfs_ifork_verify_data(ip, &xfs_default_ifork_ops);
  3103. if (fa) {
  3104. ifp = XFS_IFORK_PTR(ip, XFS_DATA_FORK);
  3105. xfs_inode_verifier_error(ip, -EFSCORRUPTED, "data fork",
  3106. ifp->if_u1.if_data, ifp->if_bytes, fa);
  3107. return false;
  3108. }
  3109. fa = xfs_ifork_verify_attr(ip, &xfs_default_ifork_ops);
  3110. if (fa) {
  3111. ifp = XFS_IFORK_PTR(ip, XFS_ATTR_FORK);
  3112. xfs_inode_verifier_error(ip, -EFSCORRUPTED, "attr fork",
  3113. ifp ? ifp->if_u1.if_data : NULL,
  3114. ifp ? ifp->if_bytes : 0, fa);
  3115. return false;
  3116. }
  3117. return true;
  3118. }
  3119. STATIC int
  3120. xfs_iflush_int(
  3121. struct xfs_inode *ip,
  3122. struct xfs_buf *bp)
  3123. {
  3124. struct xfs_inode_log_item *iip = ip->i_itemp;
  3125. struct xfs_dinode *dip;
  3126. struct xfs_mount *mp = ip->i_mount;
  3127. ASSERT(xfs_isilocked(ip, XFS_ILOCK_EXCL|XFS_ILOCK_SHARED));
  3128. ASSERT(xfs_isiflocked(ip));
  3129. ASSERT(ip->i_d.di_format != XFS_DINODE_FMT_BTREE ||
  3130. ip->i_d.di_nextents > XFS_IFORK_MAXEXT(ip, XFS_DATA_FORK));
  3131. ASSERT(iip != NULL && iip->ili_fields != 0);
  3132. ASSERT(ip->i_d.di_version > 1);
  3133. /* set *dip = inode's place in the buffer */
  3134. dip = xfs_buf_offset(bp, ip->i_imap.im_boffset);
  3135. if (XFS_TEST_ERROR(dip->di_magic != cpu_to_be16(XFS_DINODE_MAGIC),
  3136. mp, XFS_ERRTAG_IFLUSH_1)) {
  3137. xfs_alert_tag(mp, XFS_PTAG_IFLUSH,
  3138. "%s: Bad inode %Lu magic number 0x%x, ptr "PTR_FMT,
  3139. __func__, ip->i_ino, be16_to_cpu(dip->di_magic), dip);
  3140. goto corrupt_out;
  3141. }
  3142. if (S_ISREG(VFS_I(ip)->i_mode)) {
  3143. if (XFS_TEST_ERROR(
  3144. (ip->i_d.di_format != XFS_DINODE_FMT_EXTENTS) &&
  3145. (ip->i_d.di_format != XFS_DINODE_FMT_BTREE),
  3146. mp, XFS_ERRTAG_IFLUSH_3)) {
  3147. xfs_alert_tag(mp, XFS_PTAG_IFLUSH,
  3148. "%s: Bad regular inode %Lu, ptr "PTR_FMT,
  3149. __func__, ip->i_ino, ip);
  3150. goto corrupt_out;
  3151. }
  3152. } else if (S_ISDIR(VFS_I(ip)->i_mode)) {
  3153. if (XFS_TEST_ERROR(
  3154. (ip->i_d.di_format != XFS_DINODE_FMT_EXTENTS) &&
  3155. (ip->i_d.di_format != XFS_DINODE_FMT_BTREE) &&
  3156. (ip->i_d.di_format != XFS_DINODE_FMT_LOCAL),
  3157. mp, XFS_ERRTAG_IFLUSH_4)) {
  3158. xfs_alert_tag(mp, XFS_PTAG_IFLUSH,
  3159. "%s: Bad directory inode %Lu, ptr "PTR_FMT,
  3160. __func__, ip->i_ino, ip);
  3161. goto corrupt_out;
  3162. }
  3163. }
  3164. if (XFS_TEST_ERROR(ip->i_d.di_nextents + ip->i_d.di_anextents >
  3165. ip->i_d.di_nblocks, mp, XFS_ERRTAG_IFLUSH_5)) {
  3166. xfs_alert_tag(mp, XFS_PTAG_IFLUSH,
  3167. "%s: detected corrupt incore inode %Lu, "
  3168. "total extents = %d, nblocks = %Ld, ptr "PTR_FMT,
  3169. __func__, ip->i_ino,
  3170. ip->i_d.di_nextents + ip->i_d.di_anextents,
  3171. ip->i_d.di_nblocks, ip);
  3172. goto corrupt_out;
  3173. }
  3174. if (XFS_TEST_ERROR(ip->i_d.di_forkoff > mp->m_sb.sb_inodesize,
  3175. mp, XFS_ERRTAG_IFLUSH_6)) {
  3176. xfs_alert_tag(mp, XFS_PTAG_IFLUSH,
  3177. "%s: bad inode %Lu, forkoff 0x%x, ptr "PTR_FMT,
  3178. __func__, ip->i_ino, ip->i_d.di_forkoff, ip);
  3179. goto corrupt_out;
  3180. }
  3181. /*
  3182. * Inode item log recovery for v2 inodes are dependent on the
  3183. * di_flushiter count for correct sequencing. We bump the flush
  3184. * iteration count so we can detect flushes which postdate a log record
  3185. * during recovery. This is redundant as we now log every change and
  3186. * hence this can't happen but we need to still do it to ensure
  3187. * backwards compatibility with old kernels that predate logging all
  3188. * inode changes.
  3189. */
  3190. if (ip->i_d.di_version < 3)
  3191. ip->i_d.di_flushiter++;
  3192. /* Check the inline fork data before we write out. */
  3193. if (!xfs_inode_verify_forks(ip))
  3194. goto corrupt_out;
  3195. /*
  3196. * Copy the dirty parts of the inode into the on-disk inode. We always
  3197. * copy out the core of the inode, because if the inode is dirty at all
  3198. * the core must be.
  3199. */
  3200. xfs_inode_to_disk(ip, dip, iip->ili_item.li_lsn);
  3201. /* Wrap, we never let the log put out DI_MAX_FLUSH */
  3202. if (ip->i_d.di_flushiter == DI_MAX_FLUSH)
  3203. ip->i_d.di_flushiter = 0;
  3204. xfs_iflush_fork(ip, dip, iip, XFS_DATA_FORK);
  3205. if (XFS_IFORK_Q(ip))
  3206. xfs_iflush_fork(ip, dip, iip, XFS_ATTR_FORK);
  3207. xfs_inobp_check(mp, bp);
  3208. /*
  3209. * We've recorded everything logged in the inode, so we'd like to clear
  3210. * the ili_fields bits so we don't log and flush things unnecessarily.
  3211. * However, we can't stop logging all this information until the data
  3212. * we've copied into the disk buffer is written to disk. If we did we
  3213. * might overwrite the copy of the inode in the log with all the data
  3214. * after re-logging only part of it, and in the face of a crash we
  3215. * wouldn't have all the data we need to recover.
  3216. *
  3217. * What we do is move the bits to the ili_last_fields field. When
  3218. * logging the inode, these bits are moved back to the ili_fields field.
  3219. * In the xfs_iflush_done() routine we clear ili_last_fields, since we
  3220. * know that the information those bits represent is permanently on
  3221. * disk. As long as the flush completes before the inode is logged
  3222. * again, then both ili_fields and ili_last_fields will be cleared.
  3223. *
  3224. * We can play with the ili_fields bits here, because the inode lock
  3225. * must be held exclusively in order to set bits there and the flush
  3226. * lock protects the ili_last_fields bits. Set ili_logged so the flush
  3227. * done routine can tell whether or not to look in the AIL. Also, store
  3228. * the current LSN of the inode so that we can tell whether the item has
  3229. * moved in the AIL from xfs_iflush_done(). In order to read the lsn we
  3230. * need the AIL lock, because it is a 64 bit value that cannot be read
  3231. * atomically.
  3232. */
  3233. iip->ili_last_fields = iip->ili_fields;
  3234. iip->ili_fields = 0;
  3235. iip->ili_fsync_fields = 0;
  3236. iip->ili_logged = 1;
  3237. xfs_trans_ail_copy_lsn(mp->m_ail, &iip->ili_flush_lsn,
  3238. &iip->ili_item.li_lsn);
  3239. /*
  3240. * Attach the function xfs_iflush_done to the inode's
  3241. * buffer. This will remove the inode from the AIL
  3242. * and unlock the inode's flush lock when the inode is
  3243. * completely written to disk.
  3244. */
  3245. xfs_buf_attach_iodone(bp, xfs_iflush_done, &iip->ili_item);
  3246. /* generate the checksum. */
  3247. xfs_dinode_calc_crc(mp, dip);
  3248. ASSERT(!list_empty(&bp->b_li_list));
  3249. ASSERT(bp->b_iodone != NULL);
  3250. return 0;
  3251. corrupt_out:
  3252. return -EFSCORRUPTED;
  3253. }