xfs_iget.c 26 KB

12345678910111213141516171819202122232425262728293031323334353637383940414243444546474849505152535455565758596061626364656667686970717273747576777879808182838485868788899091929394959697989910010110210310410510610710810911011111211311411511611711811912012112212312412512612712812913013113213313413513613713813914014114214314414514614714814915015115215315415515615715815916016116216316416516616716816917017117217317417517617717817918018118218318418518618718818919019119219319419519619719819920020120220320420520620720820921021121221321421521621721821922022122222322422522622722822923023123223323423523623723823924024124224324424524624724824925025125225325425525625725825926026126226326426526626726826927027127227327427527627727827928028128228328428528628728828929029129229329429529629729829930030130230330430530630730830931031131231331431531631731831932032132232332432532632732832933033133233333433533633733833934034134234334434534634734834935035135235335435535635735835936036136236336436536636736836937037137237337437537637737837938038138238338438538638738838939039139239339439539639739839940040140240340440540640740840941041141241341441541641741841942042142242342442542642742842943043143243343443543643743843944044144244344444544644744844945045145245345445545645745845946046146246346446546646746846947047147247347447547647747847948048148248348448548648748848949049149249349449549649749849950050150250350450550650750850951051151251351451551651751851952052152252352452552652752852953053153253353453553653753853954054154254354454554654754854955055155255355455555655755855956056156256356456556656756856957057157257357457557657757857958058158258358458558658758858959059159259359459559659759859960060160260360460560660760860961061161261361461561661761861962062162262362462562662762862963063163263363463563663763863964064164264364464564664764864965065165265365465565665765865966066166266366466566666766866967067167267367467567667767867968068168268368468568668768868969069169269369469569669769869970070170270370470570670770870971071171271371471571671771871972072172272372472572672772872973073173273373473573673773873974074174274374474574674774874975075175275375475575675775875976076176276376476576676776876977077177277377477577677777877978078178278378478578678778878979079179279379479579679779879980080180280380480580680780880981081181281381481581681781881982082182282382482582682782882983083183283383483583683783883984084184284384484584684784884985085185285385485585685785885986086186286386486586686786886987087187287387487587687787887988088188288388488588688788888989089189289389489589689789889990090190290390490590690790890991091191291391491591691791891992092192292392492592692792892993093193293393493593693793893994094194294394494594694794894995095195295395495595695795895996096196296396496596696796896997097197297397497597697797897998098198298398498598698798898999099199299399499599699799899910001001100210031004100510061007100810091010101110121013101410151016101710181019102010211022102310241025102610271028102910301031103210331034
  1. /*
  2. * Copyright (c) 2000-2005 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 "xfs.h"
  19. #include "xfs_fs.h"
  20. #include "xfs_types.h"
  21. #include "xfs_bit.h"
  22. #include "xfs_log.h"
  23. #include "xfs_inum.h"
  24. #include "xfs_trans.h"
  25. #include "xfs_sb.h"
  26. #include "xfs_ag.h"
  27. #include "xfs_dir2.h"
  28. #include "xfs_dmapi.h"
  29. #include "xfs_mount.h"
  30. #include "xfs_bmap_btree.h"
  31. #include "xfs_alloc_btree.h"
  32. #include "xfs_ialloc_btree.h"
  33. #include "xfs_dir2_sf.h"
  34. #include "xfs_attr_sf.h"
  35. #include "xfs_dinode.h"
  36. #include "xfs_inode.h"
  37. #include "xfs_btree.h"
  38. #include "xfs_ialloc.h"
  39. #include "xfs_quota.h"
  40. #include "xfs_utils.h"
  41. /*
  42. * Initialize the inode hash table for the newly mounted file system.
  43. * Choose an initial table size based on user specified value, else
  44. * use a simple algorithm using the maximum number of inodes as an
  45. * indicator for table size, and clamp it between one and some large
  46. * number of pages.
  47. */
  48. void
  49. xfs_ihash_init(xfs_mount_t *mp)
  50. {
  51. __uint64_t icount;
  52. uint i, flags = KM_SLEEP | KM_MAYFAIL;
  53. if (!mp->m_ihsize) {
  54. icount = mp->m_maxicount ? mp->m_maxicount :
  55. (mp->m_sb.sb_dblocks << mp->m_sb.sb_inopblog);
  56. mp->m_ihsize = 1 << max_t(uint, 8,
  57. (xfs_highbit64(icount) + 1) / 2);
  58. mp->m_ihsize = min_t(uint, mp->m_ihsize,
  59. (64 * NBPP) / sizeof(xfs_ihash_t));
  60. }
  61. while (!(mp->m_ihash = (xfs_ihash_t *)kmem_zalloc(mp->m_ihsize *
  62. sizeof(xfs_ihash_t), flags))) {
  63. if ((mp->m_ihsize >>= 1) <= NBPP)
  64. flags = KM_SLEEP;
  65. }
  66. for (i = 0; i < mp->m_ihsize; i++) {
  67. rwlock_init(&(mp->m_ihash[i].ih_lock));
  68. }
  69. }
  70. /*
  71. * Free up structures allocated by xfs_ihash_init, at unmount time.
  72. */
  73. void
  74. xfs_ihash_free(xfs_mount_t *mp)
  75. {
  76. kmem_free(mp->m_ihash, mp->m_ihsize*sizeof(xfs_ihash_t));
  77. mp->m_ihash = NULL;
  78. }
  79. /*
  80. * Initialize the inode cluster hash table for the newly mounted file system.
  81. * Its size is derived from the ihash table size.
  82. */
  83. void
  84. xfs_chash_init(xfs_mount_t *mp)
  85. {
  86. uint i;
  87. mp->m_chsize = max_t(uint, 1, mp->m_ihsize /
  88. (XFS_INODE_CLUSTER_SIZE(mp) >> mp->m_sb.sb_inodelog));
  89. mp->m_chsize = min_t(uint, mp->m_chsize, mp->m_ihsize);
  90. mp->m_chash = (xfs_chash_t *)kmem_zalloc(mp->m_chsize
  91. * sizeof(xfs_chash_t),
  92. KM_SLEEP);
  93. for (i = 0; i < mp->m_chsize; i++) {
  94. spinlock_init(&mp->m_chash[i].ch_lock,"xfshash");
  95. }
  96. }
  97. /*
  98. * Free up structures allocated by xfs_chash_init, at unmount time.
  99. */
  100. void
  101. xfs_chash_free(xfs_mount_t *mp)
  102. {
  103. int i;
  104. for (i = 0; i < mp->m_chsize; i++) {
  105. spinlock_destroy(&mp->m_chash[i].ch_lock);
  106. }
  107. kmem_free(mp->m_chash, mp->m_chsize*sizeof(xfs_chash_t));
  108. mp->m_chash = NULL;
  109. }
  110. /*
  111. * Try to move an inode to the front of its hash list if possible
  112. * (and if its not there already). Called right after obtaining
  113. * the list version number and then dropping the read_lock on the
  114. * hash list in question (which is done right after looking up the
  115. * inode in question...).
  116. */
  117. STATIC void
  118. xfs_ihash_promote(
  119. xfs_ihash_t *ih,
  120. xfs_inode_t *ip,
  121. ulong version)
  122. {
  123. xfs_inode_t *iq;
  124. if ((ip->i_prevp != &ih->ih_next) && write_trylock(&ih->ih_lock)) {
  125. if (likely(version == ih->ih_version)) {
  126. /* remove from list */
  127. if ((iq = ip->i_next)) {
  128. iq->i_prevp = ip->i_prevp;
  129. }
  130. *ip->i_prevp = iq;
  131. /* insert at list head */
  132. iq = ih->ih_next;
  133. iq->i_prevp = &ip->i_next;
  134. ip->i_next = iq;
  135. ip->i_prevp = &ih->ih_next;
  136. ih->ih_next = ip;
  137. }
  138. write_unlock(&ih->ih_lock);
  139. }
  140. }
  141. /*
  142. * Look up an inode by number in the given file system.
  143. * The inode is looked up in the hash table for the file system
  144. * represented by the mount point parameter mp. Each bucket of
  145. * the hash table is guarded by an individual semaphore.
  146. *
  147. * If the inode is found in the hash table, its corresponding vnode
  148. * is obtained with a call to vn_get(). This call takes care of
  149. * coordination with the reclamation of the inode and vnode. Note
  150. * that the vmap structure is filled in while holding the hash lock.
  151. * This gives us the state of the inode/vnode when we found it and
  152. * is used for coordination in vn_get().
  153. *
  154. * If it is not in core, read it in from the file system's device and
  155. * add the inode into the hash table.
  156. *
  157. * The inode is locked according to the value of the lock_flags parameter.
  158. * This flag parameter indicates how and if the inode's IO lock and inode lock
  159. * should be taken.
  160. *
  161. * mp -- the mount point structure for the current file system. It points
  162. * to the inode hash table.
  163. * tp -- a pointer to the current transaction if there is one. This is
  164. * simply passed through to the xfs_iread() call.
  165. * ino -- the number of the inode desired. This is the unique identifier
  166. * within the file system for the inode being requested.
  167. * lock_flags -- flags indicating how to lock the inode. See the comment
  168. * for xfs_ilock() for a list of valid values.
  169. * bno -- the block number starting the buffer containing the inode,
  170. * if known (as by bulkstat), else 0.
  171. */
  172. STATIC int
  173. xfs_iget_core(
  174. bhv_vnode_t *vp,
  175. xfs_mount_t *mp,
  176. xfs_trans_t *tp,
  177. xfs_ino_t ino,
  178. uint flags,
  179. uint lock_flags,
  180. xfs_inode_t **ipp,
  181. xfs_daddr_t bno)
  182. {
  183. xfs_ihash_t *ih;
  184. xfs_inode_t *ip;
  185. xfs_inode_t *iq;
  186. bhv_vnode_t *inode_vp;
  187. ulong version;
  188. int error;
  189. /* REFERENCED */
  190. xfs_chash_t *ch;
  191. xfs_chashlist_t *chl, *chlnew;
  192. SPLDECL(s);
  193. ih = XFS_IHASH(mp, ino);
  194. again:
  195. read_lock(&ih->ih_lock);
  196. for (ip = ih->ih_next; ip != NULL; ip = ip->i_next) {
  197. if (ip->i_ino == ino) {
  198. /*
  199. * If INEW is set this inode is being set up
  200. * we need to pause and try again.
  201. */
  202. if (ip->i_flags & XFS_INEW) {
  203. read_unlock(&ih->ih_lock);
  204. delay(1);
  205. XFS_STATS_INC(xs_ig_frecycle);
  206. goto again;
  207. }
  208. inode_vp = XFS_ITOV_NULL(ip);
  209. if (inode_vp == NULL) {
  210. /*
  211. * If IRECLAIM is set this inode is
  212. * on its way out of the system,
  213. * we need to pause and try again.
  214. */
  215. if (ip->i_flags & XFS_IRECLAIM) {
  216. read_unlock(&ih->ih_lock);
  217. delay(1);
  218. XFS_STATS_INC(xs_ig_frecycle);
  219. goto again;
  220. }
  221. vn_trace_exit(vp, "xfs_iget.alloc",
  222. (inst_t *)__return_address);
  223. XFS_STATS_INC(xs_ig_found);
  224. ip->i_flags &= ~XFS_IRECLAIMABLE;
  225. version = ih->ih_version;
  226. read_unlock(&ih->ih_lock);
  227. xfs_ihash_promote(ih, ip, version);
  228. XFS_MOUNT_ILOCK(mp);
  229. list_del_init(&ip->i_reclaim);
  230. XFS_MOUNT_IUNLOCK(mp);
  231. goto finish_inode;
  232. } else if (vp != inode_vp) {
  233. struct inode *inode = vn_to_inode(inode_vp);
  234. /* The inode is being torn down, pause and
  235. * try again.
  236. */
  237. if (inode->i_state & (I_FREEING | I_CLEAR)) {
  238. read_unlock(&ih->ih_lock);
  239. delay(1);
  240. XFS_STATS_INC(xs_ig_frecycle);
  241. goto again;
  242. }
  243. /* Chances are the other vnode (the one in the inode) is being torn
  244. * down right now, and we landed on top of it. Question is, what do
  245. * we do? Unhook the old inode and hook up the new one?
  246. */
  247. cmn_err(CE_PANIC,
  248. "xfs_iget_core: ambiguous vns: vp/0x%p, invp/0x%p",
  249. inode_vp, vp);
  250. }
  251. /*
  252. * Inode cache hit: if ip is not at the front of
  253. * its hash chain, move it there now.
  254. * Do this with the lock held for update, but
  255. * do statistics after releasing the lock.
  256. */
  257. version = ih->ih_version;
  258. read_unlock(&ih->ih_lock);
  259. xfs_ihash_promote(ih, ip, version);
  260. XFS_STATS_INC(xs_ig_found);
  261. finish_inode:
  262. if (ip->i_d.di_mode == 0) {
  263. if (!(flags & IGET_CREATE))
  264. return ENOENT;
  265. xfs_iocore_inode_reinit(ip);
  266. }
  267. if (lock_flags != 0)
  268. xfs_ilock(ip, lock_flags);
  269. ip->i_flags &= ~XFS_ISTALE;
  270. vn_trace_exit(vp, "xfs_iget.found",
  271. (inst_t *)__return_address);
  272. goto return_ip;
  273. }
  274. }
  275. /*
  276. * Inode cache miss: save the hash chain version stamp and unlock
  277. * the chain, so we don't deadlock in vn_alloc.
  278. */
  279. XFS_STATS_INC(xs_ig_missed);
  280. version = ih->ih_version;
  281. read_unlock(&ih->ih_lock);
  282. /*
  283. * Read the disk inode attributes into a new inode structure and get
  284. * a new vnode for it. This should also initialize i_ino and i_mount.
  285. */
  286. error = xfs_iread(mp, tp, ino, &ip, bno);
  287. if (error) {
  288. return error;
  289. }
  290. vn_trace_exit(vp, "xfs_iget.alloc", (inst_t *)__return_address);
  291. xfs_inode_lock_init(ip, vp);
  292. xfs_iocore_inode_init(ip);
  293. if (lock_flags != 0) {
  294. xfs_ilock(ip, lock_flags);
  295. }
  296. if ((ip->i_d.di_mode == 0) && !(flags & IGET_CREATE)) {
  297. xfs_idestroy(ip);
  298. return ENOENT;
  299. }
  300. /*
  301. * Put ip on its hash chain, unless someone else hashed a duplicate
  302. * after we released the hash lock.
  303. */
  304. write_lock(&ih->ih_lock);
  305. if (ih->ih_version != version) {
  306. for (iq = ih->ih_next; iq != NULL; iq = iq->i_next) {
  307. if (iq->i_ino == ino) {
  308. write_unlock(&ih->ih_lock);
  309. xfs_idestroy(ip);
  310. XFS_STATS_INC(xs_ig_dup);
  311. goto again;
  312. }
  313. }
  314. }
  315. /*
  316. * These values _must_ be set before releasing ihlock!
  317. */
  318. ip->i_hash = ih;
  319. if ((iq = ih->ih_next)) {
  320. iq->i_prevp = &ip->i_next;
  321. }
  322. ip->i_next = iq;
  323. ip->i_prevp = &ih->ih_next;
  324. ih->ih_next = ip;
  325. ip->i_udquot = ip->i_gdquot = NULL;
  326. ih->ih_version++;
  327. ip->i_flags |= XFS_INEW;
  328. write_unlock(&ih->ih_lock);
  329. /*
  330. * put ip on its cluster's hash chain
  331. */
  332. ASSERT(ip->i_chash == NULL && ip->i_cprev == NULL &&
  333. ip->i_cnext == NULL);
  334. chlnew = NULL;
  335. ch = XFS_CHASH(mp, ip->i_blkno);
  336. chlredo:
  337. s = mutex_spinlock(&ch->ch_lock);
  338. for (chl = ch->ch_list; chl != NULL; chl = chl->chl_next) {
  339. if (chl->chl_blkno == ip->i_blkno) {
  340. /* insert this inode into the doubly-linked list
  341. * where chl points */
  342. if ((iq = chl->chl_ip)) {
  343. ip->i_cprev = iq->i_cprev;
  344. iq->i_cprev->i_cnext = ip;
  345. iq->i_cprev = ip;
  346. ip->i_cnext = iq;
  347. } else {
  348. ip->i_cnext = ip;
  349. ip->i_cprev = ip;
  350. }
  351. chl->chl_ip = ip;
  352. ip->i_chash = chl;
  353. break;
  354. }
  355. }
  356. /* no hash list found for this block; add a new hash list */
  357. if (chl == NULL) {
  358. if (chlnew == NULL) {
  359. mutex_spinunlock(&ch->ch_lock, s);
  360. ASSERT(xfs_chashlist_zone != NULL);
  361. chlnew = (xfs_chashlist_t *)
  362. kmem_zone_alloc(xfs_chashlist_zone,
  363. KM_SLEEP);
  364. ASSERT(chlnew != NULL);
  365. goto chlredo;
  366. } else {
  367. ip->i_cnext = ip;
  368. ip->i_cprev = ip;
  369. ip->i_chash = chlnew;
  370. chlnew->chl_ip = ip;
  371. chlnew->chl_blkno = ip->i_blkno;
  372. if (ch->ch_list)
  373. ch->ch_list->chl_prev = chlnew;
  374. chlnew->chl_next = ch->ch_list;
  375. chlnew->chl_prev = NULL;
  376. ch->ch_list = chlnew;
  377. chlnew = NULL;
  378. }
  379. } else {
  380. if (chlnew != NULL) {
  381. kmem_zone_free(xfs_chashlist_zone, chlnew);
  382. }
  383. }
  384. mutex_spinunlock(&ch->ch_lock, s);
  385. /*
  386. * Link ip to its mount and thread it on the mount's inode list.
  387. */
  388. XFS_MOUNT_ILOCK(mp);
  389. if ((iq = mp->m_inodes)) {
  390. ASSERT(iq->i_mprev->i_mnext == iq);
  391. ip->i_mprev = iq->i_mprev;
  392. iq->i_mprev->i_mnext = ip;
  393. iq->i_mprev = ip;
  394. ip->i_mnext = iq;
  395. } else {
  396. ip->i_mnext = ip;
  397. ip->i_mprev = ip;
  398. }
  399. mp->m_inodes = ip;
  400. XFS_MOUNT_IUNLOCK(mp);
  401. return_ip:
  402. ASSERT(ip->i_df.if_ext_max ==
  403. XFS_IFORK_DSIZE(ip) / sizeof(xfs_bmbt_rec_t));
  404. ASSERT(((ip->i_d.di_flags & XFS_DIFLAG_REALTIME) != 0) ==
  405. ((ip->i_iocore.io_flags & XFS_IOCORE_RT) != 0));
  406. *ipp = ip;
  407. /*
  408. * If we have a real type for an on-disk inode, we can set ops(&unlock)
  409. * now. If it's a new inode being created, xfs_ialloc will handle it.
  410. */
  411. bhv_vfs_init_vnode(XFS_MTOVFS(mp), vp, XFS_ITOBHV(ip), 1);
  412. return 0;
  413. }
  414. /*
  415. * The 'normal' internal xfs_iget, if needed it will
  416. * 'allocate', or 'get', the vnode.
  417. */
  418. int
  419. xfs_iget(
  420. xfs_mount_t *mp,
  421. xfs_trans_t *tp,
  422. xfs_ino_t ino,
  423. uint flags,
  424. uint lock_flags,
  425. xfs_inode_t **ipp,
  426. xfs_daddr_t bno)
  427. {
  428. struct inode *inode;
  429. bhv_vnode_t *vp = NULL;
  430. int error;
  431. XFS_STATS_INC(xs_ig_attempts);
  432. retry:
  433. if ((inode = iget_locked(XFS_MTOVFS(mp)->vfs_super, ino))) {
  434. xfs_inode_t *ip;
  435. vp = vn_from_inode(inode);
  436. if (inode->i_state & I_NEW) {
  437. vn_initialize(inode);
  438. error = xfs_iget_core(vp, mp, tp, ino, flags,
  439. lock_flags, ipp, bno);
  440. if (error) {
  441. vn_mark_bad(vp);
  442. if (inode->i_state & I_NEW)
  443. unlock_new_inode(inode);
  444. iput(inode);
  445. }
  446. } else {
  447. /*
  448. * If the inode is not fully constructed due to
  449. * filehandle mismatches wait for the inode to go
  450. * away and try again.
  451. *
  452. * iget_locked will call __wait_on_freeing_inode
  453. * to wait for the inode to go away.
  454. */
  455. if (is_bad_inode(inode) ||
  456. ((ip = xfs_vtoi(vp)) == NULL)) {
  457. iput(inode);
  458. delay(1);
  459. goto retry;
  460. }
  461. if (lock_flags != 0)
  462. xfs_ilock(ip, lock_flags);
  463. XFS_STATS_INC(xs_ig_found);
  464. *ipp = ip;
  465. error = 0;
  466. }
  467. } else
  468. error = ENOMEM; /* If we got no inode we are out of memory */
  469. return error;
  470. }
  471. /*
  472. * Do the setup for the various locks within the incore inode.
  473. */
  474. void
  475. xfs_inode_lock_init(
  476. xfs_inode_t *ip,
  477. bhv_vnode_t *vp)
  478. {
  479. mrlock_init(&ip->i_lock, MRLOCK_ALLOW_EQUAL_PRI|MRLOCK_BARRIER,
  480. "xfsino", (long)vp->v_number);
  481. mrlock_init(&ip->i_iolock, MRLOCK_BARRIER, "xfsio", vp->v_number);
  482. init_waitqueue_head(&ip->i_ipin_wait);
  483. atomic_set(&ip->i_pincount, 0);
  484. init_sema(&ip->i_flock, 1, "xfsfino", vp->v_number);
  485. }
  486. /*
  487. * Look for the inode corresponding to the given ino in the hash table.
  488. * If it is there and its i_transp pointer matches tp, return it.
  489. * Otherwise, return NULL.
  490. */
  491. xfs_inode_t *
  492. xfs_inode_incore(xfs_mount_t *mp,
  493. xfs_ino_t ino,
  494. xfs_trans_t *tp)
  495. {
  496. xfs_ihash_t *ih;
  497. xfs_inode_t *ip;
  498. ulong version;
  499. ih = XFS_IHASH(mp, ino);
  500. read_lock(&ih->ih_lock);
  501. for (ip = ih->ih_next; ip != NULL; ip = ip->i_next) {
  502. if (ip->i_ino == ino) {
  503. /*
  504. * If we find it and tp matches, return it.
  505. * Also move it to the front of the hash list
  506. * if we find it and it is not already there.
  507. * Otherwise break from the loop and return
  508. * NULL.
  509. */
  510. if (ip->i_transp == tp) {
  511. version = ih->ih_version;
  512. read_unlock(&ih->ih_lock);
  513. xfs_ihash_promote(ih, ip, version);
  514. return (ip);
  515. }
  516. break;
  517. }
  518. }
  519. read_unlock(&ih->ih_lock);
  520. return (NULL);
  521. }
  522. /*
  523. * Decrement reference count of an inode structure and unlock it.
  524. *
  525. * ip -- the inode being released
  526. * lock_flags -- this parameter indicates the inode's locks to be
  527. * to be released. See the comment on xfs_iunlock() for a list
  528. * of valid values.
  529. */
  530. void
  531. xfs_iput(xfs_inode_t *ip,
  532. uint lock_flags)
  533. {
  534. bhv_vnode_t *vp = XFS_ITOV(ip);
  535. vn_trace_entry(vp, "xfs_iput", (inst_t *)__return_address);
  536. xfs_iunlock(ip, lock_flags);
  537. VN_RELE(vp);
  538. }
  539. /*
  540. * Special iput for brand-new inodes that are still locked
  541. */
  542. void
  543. xfs_iput_new(xfs_inode_t *ip,
  544. uint lock_flags)
  545. {
  546. bhv_vnode_t *vp = XFS_ITOV(ip);
  547. struct inode *inode = vn_to_inode(vp);
  548. vn_trace_entry(vp, "xfs_iput_new", (inst_t *)__return_address);
  549. if ((ip->i_d.di_mode == 0)) {
  550. ASSERT(!(ip->i_flags & XFS_IRECLAIMABLE));
  551. vn_mark_bad(vp);
  552. }
  553. if (inode->i_state & I_NEW)
  554. unlock_new_inode(inode);
  555. if (lock_flags)
  556. xfs_iunlock(ip, lock_flags);
  557. VN_RELE(vp);
  558. }
  559. /*
  560. * This routine embodies the part of the reclaim code that pulls
  561. * the inode from the inode hash table and the mount structure's
  562. * inode list.
  563. * This should only be called from xfs_reclaim().
  564. */
  565. void
  566. xfs_ireclaim(xfs_inode_t *ip)
  567. {
  568. bhv_vnode_t *vp;
  569. /*
  570. * Remove from old hash list and mount list.
  571. */
  572. XFS_STATS_INC(xs_ig_reclaims);
  573. xfs_iextract(ip);
  574. /*
  575. * Here we do a spurious inode lock in order to coordinate with
  576. * xfs_sync(). This is because xfs_sync() references the inodes
  577. * in the mount list without taking references on the corresponding
  578. * vnodes. We make that OK here by ensuring that we wait until
  579. * the inode is unlocked in xfs_sync() before we go ahead and
  580. * free it. We get both the regular lock and the io lock because
  581. * the xfs_sync() code may need to drop the regular one but will
  582. * still hold the io lock.
  583. */
  584. xfs_ilock(ip, XFS_ILOCK_EXCL | XFS_IOLOCK_EXCL);
  585. /*
  586. * Release dquots (and their references) if any. An inode may escape
  587. * xfs_inactive and get here via vn_alloc->vn_reclaim path.
  588. */
  589. XFS_QM_DQDETACH(ip->i_mount, ip);
  590. /*
  591. * Pull our behavior descriptor from the vnode chain.
  592. */
  593. vp = XFS_ITOV_NULL(ip);
  594. if (vp) {
  595. vn_bhv_remove(VN_BHV_HEAD(vp), XFS_ITOBHV(ip));
  596. }
  597. /*
  598. * Free all memory associated with the inode.
  599. */
  600. xfs_idestroy(ip);
  601. }
  602. /*
  603. * This routine removes an about-to-be-destroyed inode from
  604. * all of the lists in which it is located with the exception
  605. * of the behavior chain.
  606. */
  607. void
  608. xfs_iextract(
  609. xfs_inode_t *ip)
  610. {
  611. xfs_ihash_t *ih;
  612. xfs_inode_t *iq;
  613. xfs_mount_t *mp;
  614. xfs_chash_t *ch;
  615. xfs_chashlist_t *chl, *chm;
  616. SPLDECL(s);
  617. ih = ip->i_hash;
  618. write_lock(&ih->ih_lock);
  619. if ((iq = ip->i_next)) {
  620. iq->i_prevp = ip->i_prevp;
  621. }
  622. *ip->i_prevp = iq;
  623. ih->ih_version++;
  624. write_unlock(&ih->ih_lock);
  625. /*
  626. * Remove from cluster hash list
  627. * 1) delete the chashlist if this is the last inode on the chashlist
  628. * 2) unchain from list of inodes
  629. * 3) point chashlist->chl_ip to 'chl_next' if to this inode.
  630. */
  631. mp = ip->i_mount;
  632. ch = XFS_CHASH(mp, ip->i_blkno);
  633. s = mutex_spinlock(&ch->ch_lock);
  634. if (ip->i_cnext == ip) {
  635. /* Last inode on chashlist */
  636. ASSERT(ip->i_cnext == ip && ip->i_cprev == ip);
  637. ASSERT(ip->i_chash != NULL);
  638. chm=NULL;
  639. chl = ip->i_chash;
  640. if (chl->chl_prev)
  641. chl->chl_prev->chl_next = chl->chl_next;
  642. else
  643. ch->ch_list = chl->chl_next;
  644. if (chl->chl_next)
  645. chl->chl_next->chl_prev = chl->chl_prev;
  646. kmem_zone_free(xfs_chashlist_zone, chl);
  647. } else {
  648. /* delete one inode from a non-empty list */
  649. iq = ip->i_cnext;
  650. iq->i_cprev = ip->i_cprev;
  651. ip->i_cprev->i_cnext = iq;
  652. if (ip->i_chash->chl_ip == ip) {
  653. ip->i_chash->chl_ip = iq;
  654. }
  655. ip->i_chash = __return_address;
  656. ip->i_cprev = __return_address;
  657. ip->i_cnext = __return_address;
  658. }
  659. mutex_spinunlock(&ch->ch_lock, s);
  660. /*
  661. * Remove from mount's inode list.
  662. */
  663. XFS_MOUNT_ILOCK(mp);
  664. ASSERT((ip->i_mnext != NULL) && (ip->i_mprev != NULL));
  665. iq = ip->i_mnext;
  666. iq->i_mprev = ip->i_mprev;
  667. ip->i_mprev->i_mnext = iq;
  668. /*
  669. * Fix up the head pointer if it points to the inode being deleted.
  670. */
  671. if (mp->m_inodes == ip) {
  672. if (ip == iq) {
  673. mp->m_inodes = NULL;
  674. } else {
  675. mp->m_inodes = iq;
  676. }
  677. }
  678. /* Deal with the deleted inodes list */
  679. list_del_init(&ip->i_reclaim);
  680. mp->m_ireclaims++;
  681. XFS_MOUNT_IUNLOCK(mp);
  682. }
  683. /*
  684. * This is a wrapper routine around the xfs_ilock() routine
  685. * used to centralize some grungy code. It is used in places
  686. * that wish to lock the inode solely for reading the extents.
  687. * The reason these places can't just call xfs_ilock(SHARED)
  688. * is that the inode lock also guards to bringing in of the
  689. * extents from disk for a file in b-tree format. If the inode
  690. * is in b-tree format, then we need to lock the inode exclusively
  691. * until the extents are read in. Locking it exclusively all
  692. * the time would limit our parallelism unnecessarily, though.
  693. * What we do instead is check to see if the extents have been
  694. * read in yet, and only lock the inode exclusively if they
  695. * have not.
  696. *
  697. * The function returns a value which should be given to the
  698. * corresponding xfs_iunlock_map_shared(). This value is
  699. * the mode in which the lock was actually taken.
  700. */
  701. uint
  702. xfs_ilock_map_shared(
  703. xfs_inode_t *ip)
  704. {
  705. uint lock_mode;
  706. if ((ip->i_d.di_format == XFS_DINODE_FMT_BTREE) &&
  707. ((ip->i_df.if_flags & XFS_IFEXTENTS) == 0)) {
  708. lock_mode = XFS_ILOCK_EXCL;
  709. } else {
  710. lock_mode = XFS_ILOCK_SHARED;
  711. }
  712. xfs_ilock(ip, lock_mode);
  713. return lock_mode;
  714. }
  715. /*
  716. * This is simply the unlock routine to go with xfs_ilock_map_shared().
  717. * All it does is call xfs_iunlock() with the given lock_mode.
  718. */
  719. void
  720. xfs_iunlock_map_shared(
  721. xfs_inode_t *ip,
  722. unsigned int lock_mode)
  723. {
  724. xfs_iunlock(ip, lock_mode);
  725. }
  726. /*
  727. * The xfs inode contains 2 locks: a multi-reader lock called the
  728. * i_iolock and a multi-reader lock called the i_lock. This routine
  729. * allows either or both of the locks to be obtained.
  730. *
  731. * The 2 locks should always be ordered so that the IO lock is
  732. * obtained first in order to prevent deadlock.
  733. *
  734. * ip -- the inode being locked
  735. * lock_flags -- this parameter indicates the inode's locks
  736. * to be locked. It can be:
  737. * XFS_IOLOCK_SHARED,
  738. * XFS_IOLOCK_EXCL,
  739. * XFS_ILOCK_SHARED,
  740. * XFS_ILOCK_EXCL,
  741. * XFS_IOLOCK_SHARED | XFS_ILOCK_SHARED,
  742. * XFS_IOLOCK_SHARED | XFS_ILOCK_EXCL,
  743. * XFS_IOLOCK_EXCL | XFS_ILOCK_SHARED,
  744. * XFS_IOLOCK_EXCL | XFS_ILOCK_EXCL
  745. */
  746. void
  747. xfs_ilock(xfs_inode_t *ip,
  748. uint lock_flags)
  749. {
  750. /*
  751. * You can't set both SHARED and EXCL for the same lock,
  752. * and only XFS_IOLOCK_SHARED, XFS_IOLOCK_EXCL, XFS_ILOCK_SHARED,
  753. * and XFS_ILOCK_EXCL are valid values to set in lock_flags.
  754. */
  755. ASSERT((lock_flags & (XFS_IOLOCK_SHARED | XFS_IOLOCK_EXCL)) !=
  756. (XFS_IOLOCK_SHARED | XFS_IOLOCK_EXCL));
  757. ASSERT((lock_flags & (XFS_ILOCK_SHARED | XFS_ILOCK_EXCL)) !=
  758. (XFS_ILOCK_SHARED | XFS_ILOCK_EXCL));
  759. ASSERT((lock_flags & ~XFS_LOCK_MASK) == 0);
  760. if (lock_flags & XFS_IOLOCK_EXCL) {
  761. mrupdate(&ip->i_iolock);
  762. } else if (lock_flags & XFS_IOLOCK_SHARED) {
  763. mraccess(&ip->i_iolock);
  764. }
  765. if (lock_flags & XFS_ILOCK_EXCL) {
  766. mrupdate(&ip->i_lock);
  767. } else if (lock_flags & XFS_ILOCK_SHARED) {
  768. mraccess(&ip->i_lock);
  769. }
  770. xfs_ilock_trace(ip, 1, lock_flags, (inst_t *)__return_address);
  771. }
  772. /*
  773. * This is just like xfs_ilock(), except that the caller
  774. * is guaranteed not to sleep. It returns 1 if it gets
  775. * the requested locks and 0 otherwise. If the IO lock is
  776. * obtained but the inode lock cannot be, then the IO lock
  777. * is dropped before returning.
  778. *
  779. * ip -- the inode being locked
  780. * lock_flags -- this parameter indicates the inode's locks to be
  781. * to be locked. See the comment for xfs_ilock() for a list
  782. * of valid values.
  783. *
  784. */
  785. int
  786. xfs_ilock_nowait(xfs_inode_t *ip,
  787. uint lock_flags)
  788. {
  789. int iolocked;
  790. int ilocked;
  791. /*
  792. * You can't set both SHARED and EXCL for the same lock,
  793. * and only XFS_IOLOCK_SHARED, XFS_IOLOCK_EXCL, XFS_ILOCK_SHARED,
  794. * and XFS_ILOCK_EXCL are valid values to set in lock_flags.
  795. */
  796. ASSERT((lock_flags & (XFS_IOLOCK_SHARED | XFS_IOLOCK_EXCL)) !=
  797. (XFS_IOLOCK_SHARED | XFS_IOLOCK_EXCL));
  798. ASSERT((lock_flags & (XFS_ILOCK_SHARED | XFS_ILOCK_EXCL)) !=
  799. (XFS_ILOCK_SHARED | XFS_ILOCK_EXCL));
  800. ASSERT((lock_flags & ~XFS_LOCK_MASK) == 0);
  801. iolocked = 0;
  802. if (lock_flags & XFS_IOLOCK_EXCL) {
  803. iolocked = mrtryupdate(&ip->i_iolock);
  804. if (!iolocked) {
  805. return 0;
  806. }
  807. } else if (lock_flags & XFS_IOLOCK_SHARED) {
  808. iolocked = mrtryaccess(&ip->i_iolock);
  809. if (!iolocked) {
  810. return 0;
  811. }
  812. }
  813. if (lock_flags & XFS_ILOCK_EXCL) {
  814. ilocked = mrtryupdate(&ip->i_lock);
  815. if (!ilocked) {
  816. if (iolocked) {
  817. mrunlock(&ip->i_iolock);
  818. }
  819. return 0;
  820. }
  821. } else if (lock_flags & XFS_ILOCK_SHARED) {
  822. ilocked = mrtryaccess(&ip->i_lock);
  823. if (!ilocked) {
  824. if (iolocked) {
  825. mrunlock(&ip->i_iolock);
  826. }
  827. return 0;
  828. }
  829. }
  830. xfs_ilock_trace(ip, 2, lock_flags, (inst_t *)__return_address);
  831. return 1;
  832. }
  833. /*
  834. * xfs_iunlock() is used to drop the inode locks acquired with
  835. * xfs_ilock() and xfs_ilock_nowait(). The caller must pass
  836. * in the flags given to xfs_ilock() or xfs_ilock_nowait() so
  837. * that we know which locks to drop.
  838. *
  839. * ip -- the inode being unlocked
  840. * lock_flags -- this parameter indicates the inode's locks to be
  841. * to be unlocked. See the comment for xfs_ilock() for a list
  842. * of valid values for this parameter.
  843. *
  844. */
  845. void
  846. xfs_iunlock(xfs_inode_t *ip,
  847. uint lock_flags)
  848. {
  849. /*
  850. * You can't set both SHARED and EXCL for the same lock,
  851. * and only XFS_IOLOCK_SHARED, XFS_IOLOCK_EXCL, XFS_ILOCK_SHARED,
  852. * and XFS_ILOCK_EXCL are valid values to set in lock_flags.
  853. */
  854. ASSERT((lock_flags & (XFS_IOLOCK_SHARED | XFS_IOLOCK_EXCL)) !=
  855. (XFS_IOLOCK_SHARED | XFS_IOLOCK_EXCL));
  856. ASSERT((lock_flags & (XFS_ILOCK_SHARED | XFS_ILOCK_EXCL)) !=
  857. (XFS_ILOCK_SHARED | XFS_ILOCK_EXCL));
  858. ASSERT((lock_flags & ~(XFS_LOCK_MASK | XFS_IUNLOCK_NONOTIFY)) == 0);
  859. ASSERT(lock_flags != 0);
  860. if (lock_flags & (XFS_IOLOCK_SHARED | XFS_IOLOCK_EXCL)) {
  861. ASSERT(!(lock_flags & XFS_IOLOCK_SHARED) ||
  862. (ismrlocked(&ip->i_iolock, MR_ACCESS)));
  863. ASSERT(!(lock_flags & XFS_IOLOCK_EXCL) ||
  864. (ismrlocked(&ip->i_iolock, MR_UPDATE)));
  865. mrunlock(&ip->i_iolock);
  866. }
  867. if (lock_flags & (XFS_ILOCK_SHARED | XFS_ILOCK_EXCL)) {
  868. ASSERT(!(lock_flags & XFS_ILOCK_SHARED) ||
  869. (ismrlocked(&ip->i_lock, MR_ACCESS)));
  870. ASSERT(!(lock_flags & XFS_ILOCK_EXCL) ||
  871. (ismrlocked(&ip->i_lock, MR_UPDATE)));
  872. mrunlock(&ip->i_lock);
  873. /*
  874. * Let the AIL know that this item has been unlocked in case
  875. * it is in the AIL and anyone is waiting on it. Don't do
  876. * this if the caller has asked us not to.
  877. */
  878. if (!(lock_flags & XFS_IUNLOCK_NONOTIFY) &&
  879. ip->i_itemp != NULL) {
  880. xfs_trans_unlocked_item(ip->i_mount,
  881. (xfs_log_item_t*)(ip->i_itemp));
  882. }
  883. }
  884. xfs_ilock_trace(ip, 3, lock_flags, (inst_t *)__return_address);
  885. }
  886. /*
  887. * give up write locks. the i/o lock cannot be held nested
  888. * if it is being demoted.
  889. */
  890. void
  891. xfs_ilock_demote(xfs_inode_t *ip,
  892. uint lock_flags)
  893. {
  894. ASSERT(lock_flags & (XFS_IOLOCK_EXCL|XFS_ILOCK_EXCL));
  895. ASSERT((lock_flags & ~(XFS_IOLOCK_EXCL|XFS_ILOCK_EXCL)) == 0);
  896. if (lock_flags & XFS_ILOCK_EXCL) {
  897. ASSERT(ismrlocked(&ip->i_lock, MR_UPDATE));
  898. mrdemote(&ip->i_lock);
  899. }
  900. if (lock_flags & XFS_IOLOCK_EXCL) {
  901. ASSERT(ismrlocked(&ip->i_iolock, MR_UPDATE));
  902. mrdemote(&ip->i_iolock);
  903. }
  904. }
  905. /*
  906. * The following three routines simply manage the i_flock
  907. * semaphore embedded in the inode. This semaphore synchronizes
  908. * processes attempting to flush the in-core inode back to disk.
  909. */
  910. void
  911. xfs_iflock(xfs_inode_t *ip)
  912. {
  913. psema(&(ip->i_flock), PINOD|PLTWAIT);
  914. }
  915. int
  916. xfs_iflock_nowait(xfs_inode_t *ip)
  917. {
  918. return (cpsema(&(ip->i_flock)));
  919. }
  920. void
  921. xfs_ifunlock(xfs_inode_t *ip)
  922. {
  923. ASSERT(issemalocked(&(ip->i_flock)));
  924. vsema(&(ip->i_flock));
  925. }