glock.c 47 KB

1234567891011121314151617181920212223242526272829303132333435363738394041424344454647484950515253545556575859606162636465666768697071727374757677787980818283848586878889909192939495969798991001011021031041051061071081091101111121131141151161171181191201211221231241251261271281291301311321331341351361371381391401411421431441451461471481491501511521531541551561571581591601611621631641651661671681691701711721731741751761771781791801811821831841851861871881891901911921931941951961971981992002012022032042052062072082092102112122132142152162172182192202212222232242252262272282292302312322332342352362372382392402412422432442452462472482492502512522532542552562572582592602612622632642652662672682692702712722732742752762772782792802812822832842852862872882892902912922932942952962972982993003013023033043053063073083093103113123133143153163173183193203213223233243253263273283293303313323333343353363373383393403413423433443453463473483493503513523533543553563573583593603613623633643653663673683693703713723733743753763773783793803813823833843853863873883893903913923933943953963973983994004014024034044054064074084094104114124134144154164174184194204214224234244254264274284294304314324334344354364374384394404414424434444454464474484494504514524534544554564574584594604614624634644654664674684694704714724734744754764774784794804814824834844854864874884894904914924934944954964974984995005015025035045055065075085095105115125135145155165175185195205215225235245255265275285295305315325335345355365375385395405415425435445455465475485495505515525535545555565575585595605615625635645655665675685695705715725735745755765775785795805815825835845855865875885895905915925935945955965975985996006016026036046056066076086096106116126136146156166176186196206216226236246256266276286296306316326336346356366376386396406416426436446456466476486496506516526536546556566576586596606616626636646656666676686696706716726736746756766776786796806816826836846856866876886896906916926936946956966976986997007017027037047057067077087097107117127137147157167177187197207217227237247257267277287297307317327337347357367377387397407417427437447457467477487497507517527537547557567577587597607617627637647657667677687697707717727737747757767777787797807817827837847857867877887897907917927937947957967977987998008018028038048058068078088098108118128138148158168178188198208218228238248258268278288298308318328338348358368378388398408418428438448458468478488498508518528538548558568578588598608618628638648658668678688698708718728738748758768778788798808818828838848858868878888898908918928938948958968978988999009019029039049059069079089099109119129139149159169179189199209219229239249259269279289299309319329339349359369379389399409419429439449459469479489499509519529539549559569579589599609619629639649659669679689699709719729739749759769779789799809819829839849859869879889899909919929939949959969979989991000100110021003100410051006100710081009101010111012101310141015101610171018101910201021102210231024102510261027102810291030103110321033103410351036103710381039104010411042104310441045104610471048104910501051105210531054105510561057105810591060106110621063106410651066106710681069107010711072107310741075107610771078107910801081108210831084108510861087108810891090109110921093109410951096109710981099110011011102110311041105110611071108110911101111111211131114111511161117111811191120112111221123112411251126112711281129113011311132113311341135113611371138113911401141114211431144114511461147114811491150115111521153115411551156115711581159116011611162116311641165116611671168116911701171117211731174117511761177117811791180118111821183118411851186118711881189119011911192119311941195119611971198119912001201120212031204120512061207120812091210121112121213121412151216121712181219122012211222122312241225122612271228122912301231123212331234123512361237123812391240124112421243124412451246124712481249125012511252125312541255125612571258125912601261126212631264126512661267126812691270127112721273127412751276127712781279128012811282128312841285128612871288128912901291129212931294129512961297129812991300130113021303130413051306130713081309131013111312131313141315131613171318131913201321132213231324132513261327132813291330133113321333133413351336133713381339134013411342134313441345134613471348134913501351135213531354135513561357135813591360136113621363136413651366136713681369137013711372137313741375137613771378137913801381138213831384138513861387138813891390139113921393139413951396139713981399140014011402140314041405140614071408140914101411141214131414141514161417141814191420142114221423142414251426142714281429143014311432143314341435143614371438143914401441144214431444144514461447144814491450145114521453145414551456145714581459146014611462146314641465146614671468146914701471147214731474147514761477147814791480148114821483148414851486148714881489149014911492149314941495149614971498149915001501150215031504150515061507150815091510151115121513151415151516151715181519152015211522152315241525152615271528152915301531153215331534153515361537153815391540154115421543154415451546154715481549155015511552155315541555155615571558155915601561156215631564156515661567156815691570157115721573157415751576157715781579158015811582158315841585158615871588158915901591159215931594159515961597159815991600160116021603160416051606160716081609161016111612161316141615161616171618161916201621162216231624162516261627162816291630163116321633163416351636163716381639164016411642164316441645164616471648164916501651165216531654165516561657165816591660166116621663166416651666166716681669167016711672167316741675167616771678167916801681168216831684168516861687168816891690169116921693169416951696169716981699170017011702170317041705170617071708170917101711171217131714171517161717171817191720172117221723172417251726172717281729173017311732173317341735173617371738173917401741174217431744174517461747174817491750175117521753175417551756175717581759176017611762176317641765176617671768176917701771177217731774177517761777177817791780178117821783178417851786178717881789179017911792179317941795179617971798179918001801180218031804180518061807180818091810181118121813181418151816181718181819182018211822182318241825182618271828182918301831183218331834183518361837183818391840184118421843184418451846184718481849185018511852185318541855185618571858185918601861186218631864186518661867186818691870187118721873187418751876187718781879188018811882188318841885188618871888188918901891189218931894189518961897189818991900190119021903190419051906190719081909191019111912191319141915191619171918191919201921192219231924192519261927192819291930193119321933193419351936193719381939194019411942194319441945194619471948194919501951195219531954195519561957195819591960
  1. /*
  2. * Copyright (C) Sistina Software, Inc. 1997-2003 All rights reserved.
  3. * Copyright (C) 2004-2008 Red Hat, Inc. All rights reserved.
  4. *
  5. * This copyrighted material is made available to anyone wishing to use,
  6. * modify, copy, or redistribute it subject to the terms and conditions
  7. * of the GNU General Public License version 2.
  8. */
  9. #include <linux/sched.h>
  10. #include <linux/slab.h>
  11. #include <linux/spinlock.h>
  12. #include <linux/completion.h>
  13. #include <linux/buffer_head.h>
  14. #include <linux/delay.h>
  15. #include <linux/sort.h>
  16. #include <linux/jhash.h>
  17. #include <linux/kallsyms.h>
  18. #include <linux/gfs2_ondisk.h>
  19. #include <linux/list.h>
  20. #include <linux/lm_interface.h>
  21. #include <linux/wait.h>
  22. #include <linux/module.h>
  23. #include <linux/rwsem.h>
  24. #include <asm/uaccess.h>
  25. #include <linux/seq_file.h>
  26. #include <linux/debugfs.h>
  27. #include <linux/kthread.h>
  28. #include <linux/freezer.h>
  29. #include <linux/workqueue.h>
  30. #include <linux/jiffies.h>
  31. #include "gfs2.h"
  32. #include "incore.h"
  33. #include "glock.h"
  34. #include "glops.h"
  35. #include "inode.h"
  36. #include "lops.h"
  37. #include "meta_io.h"
  38. #include "quota.h"
  39. #include "super.h"
  40. #include "util.h"
  41. struct gfs2_gl_hash_bucket {
  42. struct hlist_head hb_list;
  43. };
  44. struct gfs2_glock_iter {
  45. int hash; /* hash bucket index */
  46. struct gfs2_sbd *sdp; /* incore superblock */
  47. struct gfs2_glock *gl; /* current glock struct */
  48. char string[512]; /* scratch space */
  49. };
  50. typedef void (*glock_examiner) (struct gfs2_glock * gl);
  51. static int gfs2_dump_lockstate(struct gfs2_sbd *sdp);
  52. static int __dump_glock(struct seq_file *seq, const struct gfs2_glock *gl);
  53. #define GLOCK_BUG_ON(gl,x) do { if (unlikely(x)) { __dump_glock(NULL, gl); BUG(); } } while(0)
  54. static void do_xmote(struct gfs2_glock *gl, struct gfs2_holder *gh, unsigned int target);
  55. static DECLARE_RWSEM(gfs2_umount_flush_sem);
  56. static struct dentry *gfs2_root;
  57. static struct task_struct *scand_process;
  58. static unsigned int scand_secs = 5;
  59. static struct workqueue_struct *glock_workqueue;
  60. #define GFS2_GL_HASH_SHIFT 15
  61. #define GFS2_GL_HASH_SIZE (1 << GFS2_GL_HASH_SHIFT)
  62. #define GFS2_GL_HASH_MASK (GFS2_GL_HASH_SIZE - 1)
  63. static struct gfs2_gl_hash_bucket gl_hash_table[GFS2_GL_HASH_SIZE];
  64. static struct dentry *gfs2_root;
  65. /*
  66. * Despite what you might think, the numbers below are not arbitrary :-)
  67. * They are taken from the ipv4 routing hash code, which is well tested
  68. * and thus should be nearly optimal. Later on we might tweek the numbers
  69. * but for now this should be fine.
  70. *
  71. * The reason for putting the locks in a separate array from the list heads
  72. * is that we can have fewer locks than list heads and save memory. We use
  73. * the same hash function for both, but with a different hash mask.
  74. */
  75. #if defined(CONFIG_SMP) || defined(CONFIG_DEBUG_SPINLOCK) || \
  76. defined(CONFIG_PROVE_LOCKING)
  77. #ifdef CONFIG_LOCKDEP
  78. # define GL_HASH_LOCK_SZ 256
  79. #else
  80. # if NR_CPUS >= 32
  81. # define GL_HASH_LOCK_SZ 4096
  82. # elif NR_CPUS >= 16
  83. # define GL_HASH_LOCK_SZ 2048
  84. # elif NR_CPUS >= 8
  85. # define GL_HASH_LOCK_SZ 1024
  86. # elif NR_CPUS >= 4
  87. # define GL_HASH_LOCK_SZ 512
  88. # else
  89. # define GL_HASH_LOCK_SZ 256
  90. # endif
  91. #endif
  92. /* We never want more locks than chains */
  93. #if GFS2_GL_HASH_SIZE < GL_HASH_LOCK_SZ
  94. # undef GL_HASH_LOCK_SZ
  95. # define GL_HASH_LOCK_SZ GFS2_GL_HASH_SIZE
  96. #endif
  97. static rwlock_t gl_hash_locks[GL_HASH_LOCK_SZ];
  98. static inline rwlock_t *gl_lock_addr(unsigned int x)
  99. {
  100. return &gl_hash_locks[x & (GL_HASH_LOCK_SZ-1)];
  101. }
  102. #else /* not SMP, so no spinlocks required */
  103. static inline rwlock_t *gl_lock_addr(unsigned int x)
  104. {
  105. return NULL;
  106. }
  107. #endif
  108. /**
  109. * gl_hash() - Turn glock number into hash bucket number
  110. * @lock: The glock number
  111. *
  112. * Returns: The number of the corresponding hash bucket
  113. */
  114. static unsigned int gl_hash(const struct gfs2_sbd *sdp,
  115. const struct lm_lockname *name)
  116. {
  117. unsigned int h;
  118. h = jhash(&name->ln_number, sizeof(u64), 0);
  119. h = jhash(&name->ln_type, sizeof(unsigned int), h);
  120. h = jhash(&sdp, sizeof(struct gfs2_sbd *), h);
  121. h &= GFS2_GL_HASH_MASK;
  122. return h;
  123. }
  124. /**
  125. * glock_free() - Perform a few checks and then release struct gfs2_glock
  126. * @gl: The glock to release
  127. *
  128. * Also calls lock module to release its internal structure for this glock.
  129. *
  130. */
  131. static void glock_free(struct gfs2_glock *gl)
  132. {
  133. struct gfs2_sbd *sdp = gl->gl_sbd;
  134. struct inode *aspace = gl->gl_aspace;
  135. if (sdp->sd_lockstruct.ls_ops->lm_put_lock)
  136. sdp->sd_lockstruct.ls_ops->lm_put_lock(gl->gl_lock);
  137. if (aspace)
  138. gfs2_aspace_put(aspace);
  139. kmem_cache_free(gfs2_glock_cachep, gl);
  140. }
  141. /**
  142. * gfs2_glock_hold() - increment reference count on glock
  143. * @gl: The glock to hold
  144. *
  145. */
  146. static void gfs2_glock_hold(struct gfs2_glock *gl)
  147. {
  148. atomic_inc(&gl->gl_ref);
  149. }
  150. /**
  151. * gfs2_glock_put() - Decrement reference count on glock
  152. * @gl: The glock to put
  153. *
  154. */
  155. int gfs2_glock_put(struct gfs2_glock *gl)
  156. {
  157. int rv = 0;
  158. write_lock(gl_lock_addr(gl->gl_hash));
  159. if (atomic_dec_and_test(&gl->gl_ref)) {
  160. hlist_del(&gl->gl_list);
  161. write_unlock(gl_lock_addr(gl->gl_hash));
  162. GLOCK_BUG_ON(gl, gl->gl_state != LM_ST_UNLOCKED);
  163. GLOCK_BUG_ON(gl, !list_empty(&gl->gl_reclaim));
  164. GLOCK_BUG_ON(gl, !list_empty(&gl->gl_holders));
  165. glock_free(gl);
  166. rv = 1;
  167. goto out;
  168. }
  169. write_unlock(gl_lock_addr(gl->gl_hash));
  170. out:
  171. return rv;
  172. }
  173. /**
  174. * search_bucket() - Find struct gfs2_glock by lock number
  175. * @bucket: the bucket to search
  176. * @name: The lock name
  177. *
  178. * Returns: NULL, or the struct gfs2_glock with the requested number
  179. */
  180. static struct gfs2_glock *search_bucket(unsigned int hash,
  181. const struct gfs2_sbd *sdp,
  182. const struct lm_lockname *name)
  183. {
  184. struct gfs2_glock *gl;
  185. struct hlist_node *h;
  186. hlist_for_each_entry(gl, h, &gl_hash_table[hash].hb_list, gl_list) {
  187. if (!lm_name_equal(&gl->gl_name, name))
  188. continue;
  189. if (gl->gl_sbd != sdp)
  190. continue;
  191. atomic_inc(&gl->gl_ref);
  192. return gl;
  193. }
  194. return NULL;
  195. }
  196. /**
  197. * gfs2_glock_find() - Find glock by lock number
  198. * @sdp: The GFS2 superblock
  199. * @name: The lock name
  200. *
  201. * Returns: NULL, or the struct gfs2_glock with the requested number
  202. */
  203. static struct gfs2_glock *gfs2_glock_find(const struct gfs2_sbd *sdp,
  204. const struct lm_lockname *name)
  205. {
  206. unsigned int hash = gl_hash(sdp, name);
  207. struct gfs2_glock *gl;
  208. read_lock(gl_lock_addr(hash));
  209. gl = search_bucket(hash, sdp, name);
  210. read_unlock(gl_lock_addr(hash));
  211. return gl;
  212. }
  213. /**
  214. * may_grant - check if its ok to grant a new lock
  215. * @gl: The glock
  216. * @gh: The lock request which we wish to grant
  217. *
  218. * Returns: true if its ok to grant the lock
  219. */
  220. static inline int may_grant(const struct gfs2_glock *gl, const struct gfs2_holder *gh)
  221. {
  222. const struct gfs2_holder *gh_head = list_entry(gl->gl_holders.next, const struct gfs2_holder, gh_list);
  223. if ((gh->gh_state == LM_ST_EXCLUSIVE ||
  224. gh_head->gh_state == LM_ST_EXCLUSIVE) && gh != gh_head)
  225. return 0;
  226. if (gl->gl_state == gh->gh_state)
  227. return 1;
  228. if (gh->gh_flags & GL_EXACT)
  229. return 0;
  230. if (gl->gl_state == LM_ST_EXCLUSIVE) {
  231. if (gh->gh_state == LM_ST_SHARED && gh_head->gh_state == LM_ST_SHARED)
  232. return 1;
  233. if (gh->gh_state == LM_ST_DEFERRED && gh_head->gh_state == LM_ST_DEFERRED)
  234. return 1;
  235. }
  236. if (gl->gl_state != LM_ST_UNLOCKED && (gh->gh_flags & LM_FLAG_ANY))
  237. return 1;
  238. return 0;
  239. }
  240. static void gfs2_holder_wake(struct gfs2_holder *gh)
  241. {
  242. clear_bit(HIF_WAIT, &gh->gh_iflags);
  243. smp_mb__after_clear_bit();
  244. wake_up_bit(&gh->gh_iflags, HIF_WAIT);
  245. }
  246. /**
  247. * do_promote - promote as many requests as possible on the current queue
  248. * @gl: The glock
  249. *
  250. * Returns: true if there is a blocked holder at the head of the list
  251. */
  252. static int do_promote(struct gfs2_glock *gl)
  253. {
  254. const struct gfs2_glock_operations *glops = gl->gl_ops;
  255. struct gfs2_holder *gh, *tmp;
  256. int ret;
  257. restart:
  258. list_for_each_entry_safe(gh, tmp, &gl->gl_holders, gh_list) {
  259. if (test_bit(HIF_HOLDER, &gh->gh_iflags))
  260. continue;
  261. if (may_grant(gl, gh)) {
  262. if (gh->gh_list.prev == &gl->gl_holders &&
  263. glops->go_lock) {
  264. spin_unlock(&gl->gl_spin);
  265. /* FIXME: eliminate this eventually */
  266. ret = glops->go_lock(gh);
  267. spin_lock(&gl->gl_spin);
  268. if (ret) {
  269. gh->gh_error = ret;
  270. list_del_init(&gh->gh_list);
  271. gfs2_holder_wake(gh);
  272. goto restart;
  273. }
  274. set_bit(HIF_HOLDER, &gh->gh_iflags);
  275. gfs2_holder_wake(gh);
  276. goto restart;
  277. }
  278. set_bit(HIF_HOLDER, &gh->gh_iflags);
  279. gfs2_holder_wake(gh);
  280. continue;
  281. }
  282. if (gh->gh_list.prev == &gl->gl_holders)
  283. return 1;
  284. break;
  285. }
  286. return 0;
  287. }
  288. /**
  289. * do_error - Something unexpected has happened during a lock request
  290. *
  291. */
  292. static inline void do_error(struct gfs2_glock *gl, const int ret)
  293. {
  294. struct gfs2_holder *gh, *tmp;
  295. list_for_each_entry_safe(gh, tmp, &gl->gl_holders, gh_list) {
  296. if (test_bit(HIF_HOLDER, &gh->gh_iflags))
  297. continue;
  298. if (ret & LM_OUT_ERROR)
  299. gh->gh_error = -EIO;
  300. else if (gh->gh_flags & (LM_FLAG_TRY | LM_FLAG_TRY_1CB))
  301. gh->gh_error = GLR_TRYFAILED;
  302. else
  303. continue;
  304. list_del_init(&gh->gh_list);
  305. gfs2_holder_wake(gh);
  306. }
  307. }
  308. /**
  309. * find_first_waiter - find the first gh that's waiting for the glock
  310. * @gl: the glock
  311. */
  312. static inline struct gfs2_holder *find_first_waiter(const struct gfs2_glock *gl)
  313. {
  314. struct gfs2_holder *gh;
  315. list_for_each_entry(gh, &gl->gl_holders, gh_list) {
  316. if (!test_bit(HIF_HOLDER, &gh->gh_iflags))
  317. return gh;
  318. }
  319. return NULL;
  320. }
  321. /**
  322. * state_change - record that the glock is now in a different state
  323. * @gl: the glock
  324. * @new_state the new state
  325. *
  326. */
  327. static void state_change(struct gfs2_glock *gl, unsigned int new_state)
  328. {
  329. int held1, held2;
  330. held1 = (gl->gl_state != LM_ST_UNLOCKED);
  331. held2 = (new_state != LM_ST_UNLOCKED);
  332. if (held1 != held2) {
  333. if (held2)
  334. gfs2_glock_hold(gl);
  335. else
  336. gfs2_glock_put(gl);
  337. }
  338. gl->gl_state = new_state;
  339. gl->gl_tchange = jiffies;
  340. }
  341. static void gfs2_demote_wake(struct gfs2_glock *gl)
  342. {
  343. gl->gl_demote_state = LM_ST_EXCLUSIVE;
  344. clear_bit(GLF_DEMOTE, &gl->gl_flags);
  345. smp_mb__after_clear_bit();
  346. wake_up_bit(&gl->gl_flags, GLF_DEMOTE);
  347. }
  348. /**
  349. * finish_xmote - The DLM has replied to one of our lock requests
  350. * @gl: The glock
  351. * @ret: The status from the DLM
  352. *
  353. */
  354. static void finish_xmote(struct gfs2_glock *gl, unsigned int ret)
  355. {
  356. const struct gfs2_glock_operations *glops = gl->gl_ops;
  357. struct gfs2_holder *gh;
  358. unsigned state = ret & LM_OUT_ST_MASK;
  359. spin_lock(&gl->gl_spin);
  360. state_change(gl, state);
  361. gh = find_first_waiter(gl);
  362. /* Demote to UN request arrived during demote to SH or DF */
  363. if (test_bit(GLF_DEMOTE_IN_PROGRESS, &gl->gl_flags) &&
  364. state != LM_ST_UNLOCKED && gl->gl_demote_state == LM_ST_UNLOCKED)
  365. gl->gl_target = LM_ST_UNLOCKED;
  366. /* Check for state != intended state */
  367. if (unlikely(state != gl->gl_target)) {
  368. if (gh && !test_bit(GLF_DEMOTE_IN_PROGRESS, &gl->gl_flags)) {
  369. /* move to back of queue and try next entry */
  370. if (ret & LM_OUT_CANCELED) {
  371. if ((gh->gh_flags & LM_FLAG_PRIORITY) == 0)
  372. list_move_tail(&gh->gh_list, &gl->gl_holders);
  373. gh = find_first_waiter(gl);
  374. gl->gl_target = gh->gh_state;
  375. goto retry;
  376. }
  377. /* Some error or failed "try lock" - report it */
  378. if ((ret & LM_OUT_ERROR) ||
  379. (gh->gh_flags & (LM_FLAG_TRY | LM_FLAG_TRY_1CB))) {
  380. gl->gl_target = gl->gl_state;
  381. do_error(gl, ret);
  382. goto out;
  383. }
  384. }
  385. switch(state) {
  386. /* Unlocked due to conversion deadlock, try again */
  387. case LM_ST_UNLOCKED:
  388. retry:
  389. do_xmote(gl, gh, gl->gl_target);
  390. break;
  391. /* Conversion fails, unlock and try again */
  392. case LM_ST_SHARED:
  393. case LM_ST_DEFERRED:
  394. do_xmote(gl, gh, LM_ST_UNLOCKED);
  395. break;
  396. default: /* Everything else */
  397. printk(KERN_ERR "GFS2: wanted %u got %u\n", gl->gl_target, state);
  398. GLOCK_BUG_ON(gl, 1);
  399. }
  400. spin_unlock(&gl->gl_spin);
  401. gfs2_glock_put(gl);
  402. return;
  403. }
  404. /* Fast path - we got what we asked for */
  405. if (test_and_clear_bit(GLF_DEMOTE_IN_PROGRESS, &gl->gl_flags))
  406. gfs2_demote_wake(gl);
  407. if (state != LM_ST_UNLOCKED) {
  408. if (glops->go_xmote_bh) {
  409. int rv;
  410. spin_unlock(&gl->gl_spin);
  411. rv = glops->go_xmote_bh(gl, gh);
  412. if (rv == -EAGAIN)
  413. return;
  414. spin_lock(&gl->gl_spin);
  415. if (rv) {
  416. do_error(gl, rv);
  417. goto out;
  418. }
  419. }
  420. do_promote(gl);
  421. }
  422. out:
  423. clear_bit(GLF_LOCK, &gl->gl_flags);
  424. spin_unlock(&gl->gl_spin);
  425. gfs2_glock_put(gl);
  426. }
  427. static unsigned int gfs2_lm_lock(struct gfs2_sbd *sdp, void *lock,
  428. unsigned int cur_state, unsigned int req_state,
  429. unsigned int flags)
  430. {
  431. int ret = LM_OUT_ERROR;
  432. if (!sdp->sd_lockstruct.ls_ops->lm_lock)
  433. return req_state == LM_ST_UNLOCKED ? 0 : req_state;
  434. if (likely(!test_bit(SDF_SHUTDOWN, &sdp->sd_flags)))
  435. ret = sdp->sd_lockstruct.ls_ops->lm_lock(lock, cur_state,
  436. req_state, flags);
  437. return ret;
  438. }
  439. /**
  440. * do_xmote - Calls the DLM to change the state of a lock
  441. * @gl: The lock state
  442. * @gh: The holder (only for promotes)
  443. * @target: The target lock state
  444. *
  445. */
  446. static void do_xmote(struct gfs2_glock *gl, struct gfs2_holder *gh, unsigned int target)
  447. {
  448. const struct gfs2_glock_operations *glops = gl->gl_ops;
  449. struct gfs2_sbd *sdp = gl->gl_sbd;
  450. unsigned int lck_flags = gh ? gh->gh_flags : 0;
  451. int ret;
  452. lck_flags &= (LM_FLAG_TRY | LM_FLAG_TRY_1CB | LM_FLAG_NOEXP |
  453. LM_FLAG_PRIORITY);
  454. BUG_ON(gl->gl_state == target);
  455. BUG_ON(gl->gl_state == gl->gl_target);
  456. if ((target == LM_ST_UNLOCKED || target == LM_ST_DEFERRED) &&
  457. glops->go_inval) {
  458. set_bit(GLF_INVALIDATE_IN_PROGRESS, &gl->gl_flags);
  459. do_error(gl, 0); /* Fail queued try locks */
  460. }
  461. spin_unlock(&gl->gl_spin);
  462. if (glops->go_xmote_th)
  463. glops->go_xmote_th(gl);
  464. if (test_bit(GLF_INVALIDATE_IN_PROGRESS, &gl->gl_flags))
  465. glops->go_inval(gl, target == LM_ST_DEFERRED ? 0 : DIO_METADATA);
  466. clear_bit(GLF_INVALIDATE_IN_PROGRESS, &gl->gl_flags);
  467. gfs2_glock_hold(gl);
  468. if (target != LM_ST_UNLOCKED && (gl->gl_state == LM_ST_SHARED ||
  469. gl->gl_state == LM_ST_DEFERRED) &&
  470. !(lck_flags & (LM_FLAG_TRY | LM_FLAG_TRY_1CB)))
  471. lck_flags |= LM_FLAG_TRY_1CB;
  472. ret = gfs2_lm_lock(sdp, gl->gl_lock, gl->gl_state, target, lck_flags);
  473. if (!(ret & LM_OUT_ASYNC)) {
  474. finish_xmote(gl, ret);
  475. gfs2_glock_hold(gl);
  476. if (queue_delayed_work(glock_workqueue, &gl->gl_work, 0) == 0)
  477. gfs2_glock_put(gl);
  478. } else {
  479. GLOCK_BUG_ON(gl, ret != LM_OUT_ASYNC);
  480. }
  481. spin_lock(&gl->gl_spin);
  482. }
  483. /**
  484. * find_first_holder - find the first "holder" gh
  485. * @gl: the glock
  486. */
  487. static inline struct gfs2_holder *find_first_holder(const struct gfs2_glock *gl)
  488. {
  489. struct gfs2_holder *gh;
  490. if (!list_empty(&gl->gl_holders)) {
  491. gh = list_entry(gl->gl_holders.next, struct gfs2_holder, gh_list);
  492. if (test_bit(HIF_HOLDER, &gh->gh_iflags))
  493. return gh;
  494. }
  495. return NULL;
  496. }
  497. /**
  498. * run_queue - do all outstanding tasks related to a glock
  499. * @gl: The glock in question
  500. * @nonblock: True if we must not block in run_queue
  501. *
  502. */
  503. static void run_queue(struct gfs2_glock *gl, const int nonblock)
  504. {
  505. struct gfs2_holder *gh = NULL;
  506. if (test_and_set_bit(GLF_LOCK, &gl->gl_flags))
  507. return;
  508. GLOCK_BUG_ON(gl, test_bit(GLF_DEMOTE_IN_PROGRESS, &gl->gl_flags));
  509. if (test_bit(GLF_DEMOTE, &gl->gl_flags) &&
  510. gl->gl_demote_state != gl->gl_state) {
  511. if (find_first_holder(gl))
  512. goto out;
  513. if (nonblock)
  514. goto out_sched;
  515. set_bit(GLF_DEMOTE_IN_PROGRESS, &gl->gl_flags);
  516. GLOCK_BUG_ON(gl, gl->gl_demote_state == LM_ST_EXCLUSIVE);
  517. gl->gl_target = gl->gl_demote_state;
  518. } else {
  519. if (test_bit(GLF_DEMOTE, &gl->gl_flags))
  520. gfs2_demote_wake(gl);
  521. if (do_promote(gl) == 0)
  522. goto out;
  523. gh = find_first_waiter(gl);
  524. gl->gl_target = gh->gh_state;
  525. if (!(gh->gh_flags & (LM_FLAG_TRY | LM_FLAG_TRY_1CB)))
  526. do_error(gl, 0); /* Fail queued try locks */
  527. }
  528. do_xmote(gl, gh, gl->gl_target);
  529. return;
  530. out_sched:
  531. gfs2_glock_hold(gl);
  532. if (queue_delayed_work(glock_workqueue, &gl->gl_work, 0) == 0)
  533. gfs2_glock_put(gl);
  534. out:
  535. clear_bit(GLF_LOCK, &gl->gl_flags);
  536. }
  537. static void glock_work_func(struct work_struct *work)
  538. {
  539. unsigned long delay = 0;
  540. struct gfs2_glock *gl = container_of(work, struct gfs2_glock, gl_work.work);
  541. if (test_and_clear_bit(GLF_REPLY_PENDING, &gl->gl_flags))
  542. finish_xmote(gl, gl->gl_reply);
  543. spin_lock(&gl->gl_spin);
  544. if (test_and_clear_bit(GLF_PENDING_DEMOTE, &gl->gl_flags) &&
  545. gl->gl_state != LM_ST_UNLOCKED &&
  546. gl->gl_demote_state != LM_ST_EXCLUSIVE) {
  547. unsigned long holdtime, now = jiffies;
  548. holdtime = gl->gl_tchange + gl->gl_ops->go_min_hold_time;
  549. if (time_before(now, holdtime))
  550. delay = holdtime - now;
  551. set_bit(delay ? GLF_PENDING_DEMOTE : GLF_DEMOTE, &gl->gl_flags);
  552. }
  553. run_queue(gl, 0);
  554. spin_unlock(&gl->gl_spin);
  555. if (!delay ||
  556. queue_delayed_work(glock_workqueue, &gl->gl_work, delay) == 0)
  557. gfs2_glock_put(gl);
  558. }
  559. static int gfs2_lm_get_lock(struct gfs2_sbd *sdp, struct lm_lockname *name,
  560. void **lockp)
  561. {
  562. int error = -EIO;
  563. if (!sdp->sd_lockstruct.ls_ops->lm_get_lock)
  564. return 0;
  565. if (likely(!test_bit(SDF_SHUTDOWN, &sdp->sd_flags)))
  566. error = sdp->sd_lockstruct.ls_ops->lm_get_lock(
  567. sdp->sd_lockstruct.ls_lockspace, name, lockp);
  568. return error;
  569. }
  570. /**
  571. * gfs2_glock_get() - Get a glock, or create one if one doesn't exist
  572. * @sdp: The GFS2 superblock
  573. * @number: the lock number
  574. * @glops: The glock_operations to use
  575. * @create: If 0, don't create the glock if it doesn't exist
  576. * @glp: the glock is returned here
  577. *
  578. * This does not lock a glock, just finds/creates structures for one.
  579. *
  580. * Returns: errno
  581. */
  582. int gfs2_glock_get(struct gfs2_sbd *sdp, u64 number,
  583. const struct gfs2_glock_operations *glops, int create,
  584. struct gfs2_glock **glp)
  585. {
  586. struct lm_lockname name = { .ln_number = number, .ln_type = glops->go_type };
  587. struct gfs2_glock *gl, *tmp;
  588. unsigned int hash = gl_hash(sdp, &name);
  589. int error;
  590. read_lock(gl_lock_addr(hash));
  591. gl = search_bucket(hash, sdp, &name);
  592. read_unlock(gl_lock_addr(hash));
  593. if (gl || !create) {
  594. *glp = gl;
  595. return 0;
  596. }
  597. gl = kmem_cache_alloc(gfs2_glock_cachep, GFP_KERNEL);
  598. if (!gl)
  599. return -ENOMEM;
  600. gl->gl_flags = 0;
  601. gl->gl_name = name;
  602. atomic_set(&gl->gl_ref, 1);
  603. gl->gl_state = LM_ST_UNLOCKED;
  604. gl->gl_target = LM_ST_UNLOCKED;
  605. gl->gl_demote_state = LM_ST_EXCLUSIVE;
  606. gl->gl_hash = hash;
  607. gl->gl_ops = glops;
  608. gl->gl_stamp = jiffies;
  609. gl->gl_tchange = jiffies;
  610. gl->gl_object = NULL;
  611. gl->gl_sbd = sdp;
  612. gl->gl_aspace = NULL;
  613. INIT_DELAYED_WORK(&gl->gl_work, glock_work_func);
  614. /* If this glock protects actual on-disk data or metadata blocks,
  615. create a VFS inode to manage the pages/buffers holding them. */
  616. if (glops == &gfs2_inode_glops || glops == &gfs2_rgrp_glops) {
  617. gl->gl_aspace = gfs2_aspace_get(sdp);
  618. if (!gl->gl_aspace) {
  619. error = -ENOMEM;
  620. goto fail;
  621. }
  622. }
  623. error = gfs2_lm_get_lock(sdp, &name, &gl->gl_lock);
  624. if (error)
  625. goto fail_aspace;
  626. write_lock(gl_lock_addr(hash));
  627. tmp = search_bucket(hash, sdp, &name);
  628. if (tmp) {
  629. write_unlock(gl_lock_addr(hash));
  630. glock_free(gl);
  631. gl = tmp;
  632. } else {
  633. hlist_add_head(&gl->gl_list, &gl_hash_table[hash].hb_list);
  634. write_unlock(gl_lock_addr(hash));
  635. }
  636. *glp = gl;
  637. return 0;
  638. fail_aspace:
  639. if (gl->gl_aspace)
  640. gfs2_aspace_put(gl->gl_aspace);
  641. fail:
  642. kmem_cache_free(gfs2_glock_cachep, gl);
  643. return error;
  644. }
  645. /**
  646. * gfs2_holder_init - initialize a struct gfs2_holder in the default way
  647. * @gl: the glock
  648. * @state: the state we're requesting
  649. * @flags: the modifier flags
  650. * @gh: the holder structure
  651. *
  652. */
  653. void gfs2_holder_init(struct gfs2_glock *gl, unsigned int state, unsigned flags,
  654. struct gfs2_holder *gh)
  655. {
  656. INIT_LIST_HEAD(&gh->gh_list);
  657. gh->gh_gl = gl;
  658. gh->gh_ip = (unsigned long)__builtin_return_address(0);
  659. gh->gh_owner_pid = get_pid(task_pid(current));
  660. gh->gh_state = state;
  661. gh->gh_flags = flags;
  662. gh->gh_error = 0;
  663. gh->gh_iflags = 0;
  664. gfs2_glock_hold(gl);
  665. }
  666. /**
  667. * gfs2_holder_reinit - reinitialize a struct gfs2_holder so we can requeue it
  668. * @state: the state we're requesting
  669. * @flags: the modifier flags
  670. * @gh: the holder structure
  671. *
  672. * Don't mess with the glock.
  673. *
  674. */
  675. void gfs2_holder_reinit(unsigned int state, unsigned flags, struct gfs2_holder *gh)
  676. {
  677. gh->gh_state = state;
  678. gh->gh_flags = flags;
  679. gh->gh_iflags = 0;
  680. gh->gh_ip = (unsigned long)__builtin_return_address(0);
  681. }
  682. /**
  683. * gfs2_holder_uninit - uninitialize a holder structure (drop glock reference)
  684. * @gh: the holder structure
  685. *
  686. */
  687. void gfs2_holder_uninit(struct gfs2_holder *gh)
  688. {
  689. put_pid(gh->gh_owner_pid);
  690. gfs2_glock_put(gh->gh_gl);
  691. gh->gh_gl = NULL;
  692. gh->gh_ip = 0;
  693. }
  694. static int just_schedule(void *word)
  695. {
  696. schedule();
  697. return 0;
  698. }
  699. static void wait_on_holder(struct gfs2_holder *gh)
  700. {
  701. might_sleep();
  702. wait_on_bit(&gh->gh_iflags, HIF_WAIT, just_schedule, TASK_UNINTERRUPTIBLE);
  703. }
  704. static void wait_on_demote(struct gfs2_glock *gl)
  705. {
  706. might_sleep();
  707. wait_on_bit(&gl->gl_flags, GLF_DEMOTE, just_schedule, TASK_UNINTERRUPTIBLE);
  708. }
  709. /**
  710. * handle_callback - process a demote request
  711. * @gl: the glock
  712. * @state: the state the caller wants us to change to
  713. *
  714. * There are only two requests that we are going to see in actual
  715. * practise: LM_ST_SHARED and LM_ST_UNLOCKED
  716. */
  717. static void handle_callback(struct gfs2_glock *gl, unsigned int state,
  718. int remote, unsigned long delay)
  719. {
  720. int bit = delay ? GLF_PENDING_DEMOTE : GLF_DEMOTE;
  721. set_bit(bit, &gl->gl_flags);
  722. if (gl->gl_demote_state == LM_ST_EXCLUSIVE) {
  723. gl->gl_demote_state = state;
  724. gl->gl_demote_time = jiffies;
  725. if (remote && gl->gl_ops->go_type == LM_TYPE_IOPEN &&
  726. gl->gl_object)
  727. gfs2_glock_schedule_for_reclaim(gl);
  728. } else if (gl->gl_demote_state != LM_ST_UNLOCKED &&
  729. gl->gl_demote_state != state) {
  730. gl->gl_demote_state = LM_ST_UNLOCKED;
  731. }
  732. }
  733. /**
  734. * gfs2_glock_wait - wait on a glock acquisition
  735. * @gh: the glock holder
  736. *
  737. * Returns: 0 on success
  738. */
  739. int gfs2_glock_wait(struct gfs2_holder *gh)
  740. {
  741. wait_on_holder(gh);
  742. return gh->gh_error;
  743. }
  744. void gfs2_print_dbg(struct seq_file *seq, const char *fmt, ...)
  745. {
  746. va_list args;
  747. va_start(args, fmt);
  748. if (seq) {
  749. struct gfs2_glock_iter *gi = seq->private;
  750. vsprintf(gi->string, fmt, args);
  751. seq_printf(seq, gi->string);
  752. } else {
  753. printk(KERN_ERR " ");
  754. vprintk(fmt, args);
  755. }
  756. va_end(args);
  757. }
  758. /**
  759. * add_to_queue - Add a holder to the wait queue (but look for recursion)
  760. * @gh: the holder structure to add
  761. *
  762. * Eventually we should move the recursive locking trap to a
  763. * debugging option or something like that. This is the fast
  764. * path and needs to have the minimum number of distractions.
  765. *
  766. */
  767. static inline void add_to_queue(struct gfs2_holder *gh)
  768. {
  769. struct gfs2_glock *gl = gh->gh_gl;
  770. struct gfs2_sbd *sdp = gl->gl_sbd;
  771. struct list_head *insert_pt = NULL;
  772. struct gfs2_holder *gh2;
  773. int try_lock = 0;
  774. BUG_ON(gh->gh_owner_pid == NULL);
  775. if (test_and_set_bit(HIF_WAIT, &gh->gh_iflags))
  776. BUG();
  777. if (gh->gh_flags & (LM_FLAG_TRY | LM_FLAG_TRY_1CB)) {
  778. if (test_bit(GLF_LOCK, &gl->gl_flags))
  779. try_lock = 1;
  780. if (test_bit(GLF_INVALIDATE_IN_PROGRESS, &gl->gl_flags))
  781. goto fail;
  782. }
  783. list_for_each_entry(gh2, &gl->gl_holders, gh_list) {
  784. if (unlikely(gh2->gh_owner_pid == gh->gh_owner_pid &&
  785. (gh->gh_gl->gl_ops->go_type != LM_TYPE_FLOCK)))
  786. goto trap_recursive;
  787. if (try_lock &&
  788. !(gh2->gh_flags & (LM_FLAG_TRY | LM_FLAG_TRY_1CB)) &&
  789. !may_grant(gl, gh)) {
  790. fail:
  791. gh->gh_error = GLR_TRYFAILED;
  792. gfs2_holder_wake(gh);
  793. return;
  794. }
  795. if (test_bit(HIF_HOLDER, &gh2->gh_iflags))
  796. continue;
  797. if (unlikely((gh->gh_flags & LM_FLAG_PRIORITY) && !insert_pt))
  798. insert_pt = &gh2->gh_list;
  799. }
  800. if (likely(insert_pt == NULL)) {
  801. list_add_tail(&gh->gh_list, &gl->gl_holders);
  802. if (unlikely(gh->gh_flags & LM_FLAG_PRIORITY))
  803. goto do_cancel;
  804. return;
  805. }
  806. list_add_tail(&gh->gh_list, insert_pt);
  807. do_cancel:
  808. gh = list_entry(gl->gl_holders.next, struct gfs2_holder, gh_list);
  809. if (!(gh->gh_flags & LM_FLAG_PRIORITY)) {
  810. spin_unlock(&gl->gl_spin);
  811. if (sdp->sd_lockstruct.ls_ops->lm_cancel)
  812. sdp->sd_lockstruct.ls_ops->lm_cancel(gl->gl_lock);
  813. spin_lock(&gl->gl_spin);
  814. }
  815. return;
  816. trap_recursive:
  817. print_symbol(KERN_ERR "original: %s\n", gh2->gh_ip);
  818. printk(KERN_ERR "pid: %d\n", pid_nr(gh2->gh_owner_pid));
  819. printk(KERN_ERR "lock type: %d req lock state : %d\n",
  820. gh2->gh_gl->gl_name.ln_type, gh2->gh_state);
  821. print_symbol(KERN_ERR "new: %s\n", gh->gh_ip);
  822. printk(KERN_ERR "pid: %d\n", pid_nr(gh->gh_owner_pid));
  823. printk(KERN_ERR "lock type: %d req lock state : %d\n",
  824. gh->gh_gl->gl_name.ln_type, gh->gh_state);
  825. __dump_glock(NULL, gl);
  826. BUG();
  827. }
  828. /**
  829. * gfs2_glock_nq - enqueue a struct gfs2_holder onto a glock (acquire a glock)
  830. * @gh: the holder structure
  831. *
  832. * if (gh->gh_flags & GL_ASYNC), this never returns an error
  833. *
  834. * Returns: 0, GLR_TRYFAILED, or errno on failure
  835. */
  836. int gfs2_glock_nq(struct gfs2_holder *gh)
  837. {
  838. struct gfs2_glock *gl = gh->gh_gl;
  839. struct gfs2_sbd *sdp = gl->gl_sbd;
  840. int error = 0;
  841. if (unlikely(test_bit(SDF_SHUTDOWN, &sdp->sd_flags)))
  842. return -EIO;
  843. spin_lock(&gl->gl_spin);
  844. add_to_queue(gh);
  845. run_queue(gl, 1);
  846. spin_unlock(&gl->gl_spin);
  847. if (!(gh->gh_flags & GL_ASYNC))
  848. error = gfs2_glock_wait(gh);
  849. return error;
  850. }
  851. /**
  852. * gfs2_glock_poll - poll to see if an async request has been completed
  853. * @gh: the holder
  854. *
  855. * Returns: 1 if the request is ready to be gfs2_glock_wait()ed on
  856. */
  857. int gfs2_glock_poll(struct gfs2_holder *gh)
  858. {
  859. return test_bit(HIF_WAIT, &gh->gh_iflags) ? 0 : 1;
  860. }
  861. /**
  862. * gfs2_glock_dq - dequeue a struct gfs2_holder from a glock (release a glock)
  863. * @gh: the glock holder
  864. *
  865. */
  866. void gfs2_glock_dq(struct gfs2_holder *gh)
  867. {
  868. struct gfs2_glock *gl = gh->gh_gl;
  869. const struct gfs2_glock_operations *glops = gl->gl_ops;
  870. unsigned delay = 0;
  871. int fast_path = 0;
  872. spin_lock(&gl->gl_spin);
  873. if (gh->gh_flags & GL_NOCACHE)
  874. handle_callback(gl, LM_ST_UNLOCKED, 0, 0);
  875. list_del_init(&gh->gh_list);
  876. if (find_first_holder(gl) == NULL) {
  877. if (glops->go_unlock) {
  878. GLOCK_BUG_ON(gl, test_and_set_bit(GLF_LOCK, &gl->gl_flags));
  879. spin_unlock(&gl->gl_spin);
  880. glops->go_unlock(gh);
  881. spin_lock(&gl->gl_spin);
  882. clear_bit(GLF_LOCK, &gl->gl_flags);
  883. }
  884. gl->gl_stamp = jiffies;
  885. if (list_empty(&gl->gl_holders) &&
  886. !test_bit(GLF_PENDING_DEMOTE, &gl->gl_flags) &&
  887. !test_bit(GLF_DEMOTE, &gl->gl_flags))
  888. fast_path = 1;
  889. }
  890. spin_unlock(&gl->gl_spin);
  891. if (likely(fast_path))
  892. return;
  893. gfs2_glock_hold(gl);
  894. if (test_bit(GLF_PENDING_DEMOTE, &gl->gl_flags) &&
  895. !test_bit(GLF_DEMOTE, &gl->gl_flags))
  896. delay = gl->gl_ops->go_min_hold_time;
  897. if (queue_delayed_work(glock_workqueue, &gl->gl_work, delay) == 0)
  898. gfs2_glock_put(gl);
  899. }
  900. void gfs2_glock_dq_wait(struct gfs2_holder *gh)
  901. {
  902. struct gfs2_glock *gl = gh->gh_gl;
  903. gfs2_glock_dq(gh);
  904. wait_on_demote(gl);
  905. }
  906. /**
  907. * gfs2_glock_dq_uninit - dequeue a holder from a glock and initialize it
  908. * @gh: the holder structure
  909. *
  910. */
  911. void gfs2_glock_dq_uninit(struct gfs2_holder *gh)
  912. {
  913. gfs2_glock_dq(gh);
  914. gfs2_holder_uninit(gh);
  915. }
  916. /**
  917. * gfs2_glock_nq_num - acquire a glock based on lock number
  918. * @sdp: the filesystem
  919. * @number: the lock number
  920. * @glops: the glock operations for the type of glock
  921. * @state: the state to acquire the glock in
  922. * @flags: modifier flags for the aquisition
  923. * @gh: the struct gfs2_holder
  924. *
  925. * Returns: errno
  926. */
  927. int gfs2_glock_nq_num(struct gfs2_sbd *sdp, u64 number,
  928. const struct gfs2_glock_operations *glops,
  929. unsigned int state, int flags, struct gfs2_holder *gh)
  930. {
  931. struct gfs2_glock *gl;
  932. int error;
  933. error = gfs2_glock_get(sdp, number, glops, CREATE, &gl);
  934. if (!error) {
  935. error = gfs2_glock_nq_init(gl, state, flags, gh);
  936. gfs2_glock_put(gl);
  937. }
  938. return error;
  939. }
  940. /**
  941. * glock_compare - Compare two struct gfs2_glock structures for sorting
  942. * @arg_a: the first structure
  943. * @arg_b: the second structure
  944. *
  945. */
  946. static int glock_compare(const void *arg_a, const void *arg_b)
  947. {
  948. const struct gfs2_holder *gh_a = *(const struct gfs2_holder **)arg_a;
  949. const struct gfs2_holder *gh_b = *(const struct gfs2_holder **)arg_b;
  950. const struct lm_lockname *a = &gh_a->gh_gl->gl_name;
  951. const struct lm_lockname *b = &gh_b->gh_gl->gl_name;
  952. if (a->ln_number > b->ln_number)
  953. return 1;
  954. if (a->ln_number < b->ln_number)
  955. return -1;
  956. BUG_ON(gh_a->gh_gl->gl_ops->go_type == gh_b->gh_gl->gl_ops->go_type);
  957. return 0;
  958. }
  959. /**
  960. * nq_m_sync - synchonously acquire more than one glock in deadlock free order
  961. * @num_gh: the number of structures
  962. * @ghs: an array of struct gfs2_holder structures
  963. *
  964. * Returns: 0 on success (all glocks acquired),
  965. * errno on failure (no glocks acquired)
  966. */
  967. static int nq_m_sync(unsigned int num_gh, struct gfs2_holder *ghs,
  968. struct gfs2_holder **p)
  969. {
  970. unsigned int x;
  971. int error = 0;
  972. for (x = 0; x < num_gh; x++)
  973. p[x] = &ghs[x];
  974. sort(p, num_gh, sizeof(struct gfs2_holder *), glock_compare, NULL);
  975. for (x = 0; x < num_gh; x++) {
  976. p[x]->gh_flags &= ~(LM_FLAG_TRY | GL_ASYNC);
  977. error = gfs2_glock_nq(p[x]);
  978. if (error) {
  979. while (x--)
  980. gfs2_glock_dq(p[x]);
  981. break;
  982. }
  983. }
  984. return error;
  985. }
  986. /**
  987. * gfs2_glock_nq_m - acquire multiple glocks
  988. * @num_gh: the number of structures
  989. * @ghs: an array of struct gfs2_holder structures
  990. *
  991. *
  992. * Returns: 0 on success (all glocks acquired),
  993. * errno on failure (no glocks acquired)
  994. */
  995. int gfs2_glock_nq_m(unsigned int num_gh, struct gfs2_holder *ghs)
  996. {
  997. struct gfs2_holder *tmp[4];
  998. struct gfs2_holder **pph = tmp;
  999. int error = 0;
  1000. switch(num_gh) {
  1001. case 0:
  1002. return 0;
  1003. case 1:
  1004. ghs->gh_flags &= ~(LM_FLAG_TRY | GL_ASYNC);
  1005. return gfs2_glock_nq(ghs);
  1006. default:
  1007. if (num_gh <= 4)
  1008. break;
  1009. pph = kmalloc(num_gh * sizeof(struct gfs2_holder *), GFP_NOFS);
  1010. if (!pph)
  1011. return -ENOMEM;
  1012. }
  1013. error = nq_m_sync(num_gh, ghs, pph);
  1014. if (pph != tmp)
  1015. kfree(pph);
  1016. return error;
  1017. }
  1018. /**
  1019. * gfs2_glock_dq_m - release multiple glocks
  1020. * @num_gh: the number of structures
  1021. * @ghs: an array of struct gfs2_holder structures
  1022. *
  1023. */
  1024. void gfs2_glock_dq_m(unsigned int num_gh, struct gfs2_holder *ghs)
  1025. {
  1026. unsigned int x;
  1027. for (x = 0; x < num_gh; x++)
  1028. gfs2_glock_dq(&ghs[x]);
  1029. }
  1030. /**
  1031. * gfs2_glock_dq_uninit_m - release multiple glocks
  1032. * @num_gh: the number of structures
  1033. * @ghs: an array of struct gfs2_holder structures
  1034. *
  1035. */
  1036. void gfs2_glock_dq_uninit_m(unsigned int num_gh, struct gfs2_holder *ghs)
  1037. {
  1038. unsigned int x;
  1039. for (x = 0; x < num_gh; x++)
  1040. gfs2_glock_dq_uninit(&ghs[x]);
  1041. }
  1042. static int gfs2_lm_hold_lvb(struct gfs2_sbd *sdp, void *lock, char **lvbp)
  1043. {
  1044. int error = -EIO;
  1045. if (!sdp->sd_lockstruct.ls_ops->lm_hold_lvb)
  1046. return 0;
  1047. if (likely(!test_bit(SDF_SHUTDOWN, &sdp->sd_flags)))
  1048. error = sdp->sd_lockstruct.ls_ops->lm_hold_lvb(lock, lvbp);
  1049. return error;
  1050. }
  1051. /**
  1052. * gfs2_lvb_hold - attach a LVB from a glock
  1053. * @gl: The glock in question
  1054. *
  1055. */
  1056. int gfs2_lvb_hold(struct gfs2_glock *gl)
  1057. {
  1058. int error;
  1059. if (!atomic_read(&gl->gl_lvb_count)) {
  1060. error = gfs2_lm_hold_lvb(gl->gl_sbd, gl->gl_lock, &gl->gl_lvb);
  1061. if (error)
  1062. return error;
  1063. gfs2_glock_hold(gl);
  1064. }
  1065. atomic_inc(&gl->gl_lvb_count);
  1066. return 0;
  1067. }
  1068. /**
  1069. * gfs2_lvb_unhold - detach a LVB from a glock
  1070. * @gl: The glock in question
  1071. *
  1072. */
  1073. void gfs2_lvb_unhold(struct gfs2_glock *gl)
  1074. {
  1075. struct gfs2_sbd *sdp = gl->gl_sbd;
  1076. gfs2_glock_hold(gl);
  1077. gfs2_assert(gl->gl_sbd, atomic_read(&gl->gl_lvb_count) > 0);
  1078. if (atomic_dec_and_test(&gl->gl_lvb_count)) {
  1079. if (sdp->sd_lockstruct.ls_ops->lm_unhold_lvb)
  1080. sdp->sd_lockstruct.ls_ops->lm_unhold_lvb(gl->gl_lock, gl->gl_lvb);
  1081. gl->gl_lvb = NULL;
  1082. gfs2_glock_put(gl);
  1083. }
  1084. gfs2_glock_put(gl);
  1085. }
  1086. static void blocking_cb(struct gfs2_sbd *sdp, struct lm_lockname *name,
  1087. unsigned int state)
  1088. {
  1089. struct gfs2_glock *gl;
  1090. unsigned long delay = 0;
  1091. unsigned long holdtime;
  1092. unsigned long now = jiffies;
  1093. gl = gfs2_glock_find(sdp, name);
  1094. if (!gl)
  1095. return;
  1096. holdtime = gl->gl_tchange + gl->gl_ops->go_min_hold_time;
  1097. if (time_before(now, holdtime))
  1098. delay = holdtime - now;
  1099. if (test_bit(GLF_REPLY_PENDING, &gl->gl_flags))
  1100. delay = gl->gl_ops->go_min_hold_time;
  1101. spin_lock(&gl->gl_spin);
  1102. handle_callback(gl, state, 1, delay);
  1103. spin_unlock(&gl->gl_spin);
  1104. if (queue_delayed_work(glock_workqueue, &gl->gl_work, delay) == 0)
  1105. gfs2_glock_put(gl);
  1106. }
  1107. /**
  1108. * gfs2_glock_cb - Callback used by locking module
  1109. * @sdp: Pointer to the superblock
  1110. * @type: Type of callback
  1111. * @data: Type dependent data pointer
  1112. *
  1113. * Called by the locking module when it wants to tell us something.
  1114. * Either we need to drop a lock, one of our ASYNC requests completed, or
  1115. * a journal from another client needs to be recovered.
  1116. */
  1117. void gfs2_glock_cb(void *cb_data, unsigned int type, void *data)
  1118. {
  1119. struct gfs2_sbd *sdp = cb_data;
  1120. switch (type) {
  1121. case LM_CB_NEED_E:
  1122. blocking_cb(sdp, data, LM_ST_UNLOCKED);
  1123. return;
  1124. case LM_CB_NEED_D:
  1125. blocking_cb(sdp, data, LM_ST_DEFERRED);
  1126. return;
  1127. case LM_CB_NEED_S:
  1128. blocking_cb(sdp, data, LM_ST_SHARED);
  1129. return;
  1130. case LM_CB_ASYNC: {
  1131. struct lm_async_cb *async = data;
  1132. struct gfs2_glock *gl;
  1133. down_read(&gfs2_umount_flush_sem);
  1134. gl = gfs2_glock_find(sdp, &async->lc_name);
  1135. if (gfs2_assert_warn(sdp, gl))
  1136. return;
  1137. gl->gl_reply = async->lc_ret;
  1138. set_bit(GLF_REPLY_PENDING, &gl->gl_flags);
  1139. if (queue_delayed_work(glock_workqueue, &gl->gl_work, 0) == 0)
  1140. gfs2_glock_put(gl);
  1141. up_read(&gfs2_umount_flush_sem);
  1142. return;
  1143. }
  1144. case LM_CB_NEED_RECOVERY:
  1145. gfs2_jdesc_make_dirty(sdp, *(unsigned int *)data);
  1146. if (sdp->sd_recoverd_process)
  1147. wake_up_process(sdp->sd_recoverd_process);
  1148. return;
  1149. default:
  1150. gfs2_assert_warn(sdp, 0);
  1151. return;
  1152. }
  1153. }
  1154. /**
  1155. * demote_ok - Check to see if it's ok to unlock a glock
  1156. * @gl: the glock
  1157. *
  1158. * Returns: 1 if it's ok
  1159. */
  1160. static int demote_ok(struct gfs2_glock *gl)
  1161. {
  1162. const struct gfs2_glock_operations *glops = gl->gl_ops;
  1163. int demote = 1;
  1164. if (test_bit(GLF_STICKY, &gl->gl_flags))
  1165. demote = 0;
  1166. else if (glops->go_demote_ok)
  1167. demote = glops->go_demote_ok(gl);
  1168. return demote;
  1169. }
  1170. /**
  1171. * gfs2_glock_schedule_for_reclaim - Add a glock to the reclaim list
  1172. * @gl: the glock
  1173. *
  1174. */
  1175. void gfs2_glock_schedule_for_reclaim(struct gfs2_glock *gl)
  1176. {
  1177. struct gfs2_sbd *sdp = gl->gl_sbd;
  1178. spin_lock(&sdp->sd_reclaim_lock);
  1179. if (list_empty(&gl->gl_reclaim)) {
  1180. gfs2_glock_hold(gl);
  1181. list_add(&gl->gl_reclaim, &sdp->sd_reclaim_list);
  1182. atomic_inc(&sdp->sd_reclaim_count);
  1183. spin_unlock(&sdp->sd_reclaim_lock);
  1184. wake_up(&sdp->sd_reclaim_wq);
  1185. } else
  1186. spin_unlock(&sdp->sd_reclaim_lock);
  1187. }
  1188. /**
  1189. * gfs2_reclaim_glock - process the next glock on the filesystem's reclaim list
  1190. * @sdp: the filesystem
  1191. *
  1192. * Called from gfs2_glockd() glock reclaim daemon, or when promoting a
  1193. * different glock and we notice that there are a lot of glocks in the
  1194. * reclaim list.
  1195. *
  1196. */
  1197. void gfs2_reclaim_glock(struct gfs2_sbd *sdp)
  1198. {
  1199. struct gfs2_glock *gl;
  1200. int done_callback = 0;
  1201. spin_lock(&sdp->sd_reclaim_lock);
  1202. if (list_empty(&sdp->sd_reclaim_list)) {
  1203. spin_unlock(&sdp->sd_reclaim_lock);
  1204. return;
  1205. }
  1206. gl = list_entry(sdp->sd_reclaim_list.next,
  1207. struct gfs2_glock, gl_reclaim);
  1208. list_del_init(&gl->gl_reclaim);
  1209. spin_unlock(&sdp->sd_reclaim_lock);
  1210. atomic_dec(&sdp->sd_reclaim_count);
  1211. atomic_inc(&sdp->sd_reclaimed);
  1212. spin_lock(&gl->gl_spin);
  1213. if (find_first_holder(gl) == NULL &&
  1214. gl->gl_state != LM_ST_UNLOCKED && demote_ok(gl)) {
  1215. handle_callback(gl, LM_ST_UNLOCKED, 0, 0);
  1216. done_callback = 1;
  1217. }
  1218. spin_unlock(&gl->gl_spin);
  1219. if (!done_callback ||
  1220. queue_delayed_work(glock_workqueue, &gl->gl_work, 0) == 0)
  1221. gfs2_glock_put(gl);
  1222. }
  1223. /**
  1224. * examine_bucket - Call a function for glock in a hash bucket
  1225. * @examiner: the function
  1226. * @sdp: the filesystem
  1227. * @bucket: the bucket
  1228. *
  1229. * Returns: 1 if the bucket has entries
  1230. */
  1231. static int examine_bucket(glock_examiner examiner, struct gfs2_sbd *sdp,
  1232. unsigned int hash)
  1233. {
  1234. struct gfs2_glock *gl, *prev = NULL;
  1235. int has_entries = 0;
  1236. struct hlist_head *head = &gl_hash_table[hash].hb_list;
  1237. read_lock(gl_lock_addr(hash));
  1238. /* Can't use hlist_for_each_entry - don't want prefetch here */
  1239. if (hlist_empty(head))
  1240. goto out;
  1241. gl = list_entry(head->first, struct gfs2_glock, gl_list);
  1242. while(1) {
  1243. if (!sdp || gl->gl_sbd == sdp) {
  1244. gfs2_glock_hold(gl);
  1245. read_unlock(gl_lock_addr(hash));
  1246. if (prev)
  1247. gfs2_glock_put(prev);
  1248. prev = gl;
  1249. examiner(gl);
  1250. has_entries = 1;
  1251. read_lock(gl_lock_addr(hash));
  1252. }
  1253. if (gl->gl_list.next == NULL)
  1254. break;
  1255. gl = list_entry(gl->gl_list.next, struct gfs2_glock, gl_list);
  1256. }
  1257. out:
  1258. read_unlock(gl_lock_addr(hash));
  1259. if (prev)
  1260. gfs2_glock_put(prev);
  1261. cond_resched();
  1262. return has_entries;
  1263. }
  1264. /**
  1265. * scan_glock - look at a glock and see if we can reclaim it
  1266. * @gl: the glock to look at
  1267. *
  1268. */
  1269. static void scan_glock(struct gfs2_glock *gl)
  1270. {
  1271. if (gl->gl_ops == &gfs2_inode_glops && gl->gl_object)
  1272. return;
  1273. if (test_bit(GLF_LOCK, &gl->gl_flags))
  1274. return;
  1275. spin_lock(&gl->gl_spin);
  1276. if (find_first_holder(gl) == NULL &&
  1277. gl->gl_state != LM_ST_UNLOCKED && demote_ok(gl))
  1278. gfs2_glock_schedule_for_reclaim(gl);
  1279. spin_unlock(&gl->gl_spin);
  1280. }
  1281. /**
  1282. * clear_glock - look at a glock and see if we can free it from glock cache
  1283. * @gl: the glock to look at
  1284. *
  1285. */
  1286. static void clear_glock(struct gfs2_glock *gl)
  1287. {
  1288. struct gfs2_sbd *sdp = gl->gl_sbd;
  1289. int released;
  1290. spin_lock(&sdp->sd_reclaim_lock);
  1291. if (!list_empty(&gl->gl_reclaim)) {
  1292. list_del_init(&gl->gl_reclaim);
  1293. atomic_dec(&sdp->sd_reclaim_count);
  1294. spin_unlock(&sdp->sd_reclaim_lock);
  1295. released = gfs2_glock_put(gl);
  1296. gfs2_assert(sdp, !released);
  1297. } else {
  1298. spin_unlock(&sdp->sd_reclaim_lock);
  1299. }
  1300. spin_lock(&gl->gl_spin);
  1301. if (find_first_holder(gl) == NULL && gl->gl_state != LM_ST_UNLOCKED)
  1302. handle_callback(gl, LM_ST_UNLOCKED, 0, 0);
  1303. spin_unlock(&gl->gl_spin);
  1304. gfs2_glock_hold(gl);
  1305. if (queue_delayed_work(glock_workqueue, &gl->gl_work, 0) == 0)
  1306. gfs2_glock_put(gl);
  1307. }
  1308. /**
  1309. * gfs2_gl_hash_clear - Empty out the glock hash table
  1310. * @sdp: the filesystem
  1311. * @wait: wait until it's all gone
  1312. *
  1313. * Called when unmounting the filesystem.
  1314. */
  1315. void gfs2_gl_hash_clear(struct gfs2_sbd *sdp)
  1316. {
  1317. unsigned long t;
  1318. unsigned int x;
  1319. int cont;
  1320. t = jiffies;
  1321. for (;;) {
  1322. cont = 0;
  1323. for (x = 0; x < GFS2_GL_HASH_SIZE; x++) {
  1324. if (examine_bucket(clear_glock, sdp, x))
  1325. cont = 1;
  1326. }
  1327. if (!cont)
  1328. break;
  1329. if (time_after_eq(jiffies,
  1330. t + gfs2_tune_get(sdp, gt_stall_secs) * HZ)) {
  1331. fs_warn(sdp, "Unmount seems to be stalled. "
  1332. "Dumping lock state...\n");
  1333. gfs2_dump_lockstate(sdp);
  1334. t = jiffies;
  1335. }
  1336. down_write(&gfs2_umount_flush_sem);
  1337. invalidate_inodes(sdp->sd_vfs);
  1338. up_write(&gfs2_umount_flush_sem);
  1339. msleep(10);
  1340. }
  1341. }
  1342. static const char *state2str(unsigned state)
  1343. {
  1344. switch(state) {
  1345. case LM_ST_UNLOCKED:
  1346. return "UN";
  1347. case LM_ST_SHARED:
  1348. return "SH";
  1349. case LM_ST_DEFERRED:
  1350. return "DF";
  1351. case LM_ST_EXCLUSIVE:
  1352. return "EX";
  1353. }
  1354. return "??";
  1355. }
  1356. static const char *hflags2str(char *buf, unsigned flags, unsigned long iflags)
  1357. {
  1358. char *p = buf;
  1359. if (flags & LM_FLAG_TRY)
  1360. *p++ = 't';
  1361. if (flags & LM_FLAG_TRY_1CB)
  1362. *p++ = 'T';
  1363. if (flags & LM_FLAG_NOEXP)
  1364. *p++ = 'e';
  1365. if (flags & LM_FLAG_ANY)
  1366. *p++ = 'a';
  1367. if (flags & LM_FLAG_PRIORITY)
  1368. *p++ = 'p';
  1369. if (flags & GL_ASYNC)
  1370. *p++ = 'a';
  1371. if (flags & GL_EXACT)
  1372. *p++ = 'E';
  1373. if (flags & GL_NOCACHE)
  1374. *p++ = 'c';
  1375. if (test_bit(HIF_HOLDER, &iflags))
  1376. *p++ = 'H';
  1377. if (test_bit(HIF_WAIT, &iflags))
  1378. *p++ = 'W';
  1379. if (test_bit(HIF_FIRST, &iflags))
  1380. *p++ = 'F';
  1381. *p = 0;
  1382. return buf;
  1383. }
  1384. /**
  1385. * dump_holder - print information about a glock holder
  1386. * @seq: the seq_file struct
  1387. * @gh: the glock holder
  1388. *
  1389. * Returns: 0 on success, -ENOBUFS when we run out of space
  1390. */
  1391. static int dump_holder(struct seq_file *seq, const struct gfs2_holder *gh)
  1392. {
  1393. struct task_struct *gh_owner = NULL;
  1394. char buffer[KSYM_SYMBOL_LEN];
  1395. char flags_buf[32];
  1396. sprint_symbol(buffer, gh->gh_ip);
  1397. if (gh->gh_owner_pid)
  1398. gh_owner = pid_task(gh->gh_owner_pid, PIDTYPE_PID);
  1399. gfs2_print_dbg(seq, " H: s:%s f:%s e:%d p:%ld [%s] %s\n",
  1400. state2str(gh->gh_state),
  1401. hflags2str(flags_buf, gh->gh_flags, gh->gh_iflags),
  1402. gh->gh_error,
  1403. gh->gh_owner_pid ? (long)pid_nr(gh->gh_owner_pid) : -1,
  1404. gh_owner ? gh_owner->comm : "(ended)", buffer);
  1405. return 0;
  1406. }
  1407. static const char *gflags2str(char *buf, const unsigned long *gflags)
  1408. {
  1409. char *p = buf;
  1410. if (test_bit(GLF_LOCK, gflags))
  1411. *p++ = 'l';
  1412. if (test_bit(GLF_STICKY, gflags))
  1413. *p++ = 's';
  1414. if (test_bit(GLF_DEMOTE, gflags))
  1415. *p++ = 'D';
  1416. if (test_bit(GLF_PENDING_DEMOTE, gflags))
  1417. *p++ = 'd';
  1418. if (test_bit(GLF_DEMOTE_IN_PROGRESS, gflags))
  1419. *p++ = 'p';
  1420. if (test_bit(GLF_DIRTY, gflags))
  1421. *p++ = 'y';
  1422. if (test_bit(GLF_LFLUSH, gflags))
  1423. *p++ = 'f';
  1424. if (test_bit(GLF_INVALIDATE_IN_PROGRESS, gflags))
  1425. *p++ = 'i';
  1426. if (test_bit(GLF_REPLY_PENDING, gflags))
  1427. *p++ = 'r';
  1428. *p = 0;
  1429. return buf;
  1430. }
  1431. /**
  1432. * __dump_glock - print information about a glock
  1433. * @seq: The seq_file struct
  1434. * @gl: the glock
  1435. *
  1436. * The file format is as follows:
  1437. * One line per object, capital letters are used to indicate objects
  1438. * G = glock, I = Inode, R = rgrp, H = holder. Glocks are not indented,
  1439. * other objects are indented by a single space and follow the glock to
  1440. * which they are related. Fields are indicated by lower case letters
  1441. * followed by a colon and the field value, except for strings which are in
  1442. * [] so that its possible to see if they are composed of spaces for
  1443. * example. The field's are n = number (id of the object), f = flags,
  1444. * t = type, s = state, r = refcount, e = error, p = pid.
  1445. *
  1446. * Returns: 0 on success, -ENOBUFS when we run out of space
  1447. */
  1448. static int __dump_glock(struct seq_file *seq, const struct gfs2_glock *gl)
  1449. {
  1450. const struct gfs2_glock_operations *glops = gl->gl_ops;
  1451. unsigned long long dtime;
  1452. const struct gfs2_holder *gh;
  1453. char gflags_buf[32];
  1454. int error = 0;
  1455. dtime = jiffies - gl->gl_demote_time;
  1456. dtime *= 1000000/HZ; /* demote time in uSec */
  1457. if (!test_bit(GLF_DEMOTE, &gl->gl_flags))
  1458. dtime = 0;
  1459. gfs2_print_dbg(seq, "G: s:%s n:%u/%llu f:%s t:%s d:%s/%llu l:%d a:%d r:%d\n",
  1460. state2str(gl->gl_state),
  1461. gl->gl_name.ln_type,
  1462. (unsigned long long)gl->gl_name.ln_number,
  1463. gflags2str(gflags_buf, &gl->gl_flags),
  1464. state2str(gl->gl_target),
  1465. state2str(gl->gl_demote_state), dtime,
  1466. atomic_read(&gl->gl_lvb_count),
  1467. atomic_read(&gl->gl_ail_count),
  1468. atomic_read(&gl->gl_ref));
  1469. list_for_each_entry(gh, &gl->gl_holders, gh_list) {
  1470. error = dump_holder(seq, gh);
  1471. if (error)
  1472. goto out;
  1473. }
  1474. if (gl->gl_state != LM_ST_UNLOCKED && glops->go_dump)
  1475. error = glops->go_dump(seq, gl);
  1476. out:
  1477. return error;
  1478. }
  1479. static int dump_glock(struct seq_file *seq, struct gfs2_glock *gl)
  1480. {
  1481. int ret;
  1482. spin_lock(&gl->gl_spin);
  1483. ret = __dump_glock(seq, gl);
  1484. spin_unlock(&gl->gl_spin);
  1485. return ret;
  1486. }
  1487. /**
  1488. * gfs2_dump_lockstate - print out the current lockstate
  1489. * @sdp: the filesystem
  1490. * @ub: the buffer to copy the information into
  1491. *
  1492. * If @ub is NULL, dump the lockstate to the console.
  1493. *
  1494. */
  1495. static int gfs2_dump_lockstate(struct gfs2_sbd *sdp)
  1496. {
  1497. struct gfs2_glock *gl;
  1498. struct hlist_node *h;
  1499. unsigned int x;
  1500. int error = 0;
  1501. for (x = 0; x < GFS2_GL_HASH_SIZE; x++) {
  1502. read_lock(gl_lock_addr(x));
  1503. hlist_for_each_entry(gl, h, &gl_hash_table[x].hb_list, gl_list) {
  1504. if (gl->gl_sbd != sdp)
  1505. continue;
  1506. error = dump_glock(NULL, gl);
  1507. if (error)
  1508. break;
  1509. }
  1510. read_unlock(gl_lock_addr(x));
  1511. if (error)
  1512. break;
  1513. }
  1514. return error;
  1515. }
  1516. /**
  1517. * gfs2_scand - Look for cached glocks and inodes to toss from memory
  1518. * @sdp: Pointer to GFS2 superblock
  1519. *
  1520. * One of these daemons runs, finding candidates to add to sd_reclaim_list.
  1521. * See gfs2_glockd()
  1522. */
  1523. static int gfs2_scand(void *data)
  1524. {
  1525. unsigned x;
  1526. unsigned delay;
  1527. while (!kthread_should_stop()) {
  1528. for (x = 0; x < GFS2_GL_HASH_SIZE; x++)
  1529. examine_bucket(scan_glock, NULL, x);
  1530. if (freezing(current))
  1531. refrigerator();
  1532. delay = scand_secs;
  1533. if (delay < 1)
  1534. delay = 1;
  1535. schedule_timeout_interruptible(delay * HZ);
  1536. }
  1537. return 0;
  1538. }
  1539. int __init gfs2_glock_init(void)
  1540. {
  1541. unsigned i;
  1542. for(i = 0; i < GFS2_GL_HASH_SIZE; i++) {
  1543. INIT_HLIST_HEAD(&gl_hash_table[i].hb_list);
  1544. }
  1545. #ifdef GL_HASH_LOCK_SZ
  1546. for(i = 0; i < GL_HASH_LOCK_SZ; i++) {
  1547. rwlock_init(&gl_hash_locks[i]);
  1548. }
  1549. #endif
  1550. scand_process = kthread_run(gfs2_scand, NULL, "gfs2_scand");
  1551. if (IS_ERR(scand_process))
  1552. return PTR_ERR(scand_process);
  1553. glock_workqueue = create_workqueue("glock_workqueue");
  1554. if (IS_ERR(glock_workqueue)) {
  1555. kthread_stop(scand_process);
  1556. return PTR_ERR(glock_workqueue);
  1557. }
  1558. return 0;
  1559. }
  1560. void gfs2_glock_exit(void)
  1561. {
  1562. destroy_workqueue(glock_workqueue);
  1563. kthread_stop(scand_process);
  1564. }
  1565. module_param(scand_secs, uint, S_IRUGO|S_IWUSR);
  1566. MODULE_PARM_DESC(scand_secs, "The number of seconds between scand runs");
  1567. static int gfs2_glock_iter_next(struct gfs2_glock_iter *gi)
  1568. {
  1569. struct gfs2_glock *gl;
  1570. restart:
  1571. read_lock(gl_lock_addr(gi->hash));
  1572. gl = gi->gl;
  1573. if (gl) {
  1574. gi->gl = hlist_entry(gl->gl_list.next,
  1575. struct gfs2_glock, gl_list);
  1576. } else {
  1577. gi->gl = hlist_entry(gl_hash_table[gi->hash].hb_list.first,
  1578. struct gfs2_glock, gl_list);
  1579. }
  1580. if (gi->gl)
  1581. gfs2_glock_hold(gi->gl);
  1582. read_unlock(gl_lock_addr(gi->hash));
  1583. if (gl)
  1584. gfs2_glock_put(gl);
  1585. while (gi->gl == NULL) {
  1586. gi->hash++;
  1587. if (gi->hash >= GFS2_GL_HASH_SIZE)
  1588. return 1;
  1589. read_lock(gl_lock_addr(gi->hash));
  1590. gi->gl = hlist_entry(gl_hash_table[gi->hash].hb_list.first,
  1591. struct gfs2_glock, gl_list);
  1592. if (gi->gl)
  1593. gfs2_glock_hold(gi->gl);
  1594. read_unlock(gl_lock_addr(gi->hash));
  1595. }
  1596. if (gi->sdp != gi->gl->gl_sbd)
  1597. goto restart;
  1598. return 0;
  1599. }
  1600. static void gfs2_glock_iter_free(struct gfs2_glock_iter *gi)
  1601. {
  1602. if (gi->gl)
  1603. gfs2_glock_put(gi->gl);
  1604. gi->gl = NULL;
  1605. }
  1606. static void *gfs2_glock_seq_start(struct seq_file *seq, loff_t *pos)
  1607. {
  1608. struct gfs2_glock_iter *gi = seq->private;
  1609. loff_t n = *pos;
  1610. gi->hash = 0;
  1611. do {
  1612. if (gfs2_glock_iter_next(gi)) {
  1613. gfs2_glock_iter_free(gi);
  1614. return NULL;
  1615. }
  1616. } while (n--);
  1617. return gi->gl;
  1618. }
  1619. static void *gfs2_glock_seq_next(struct seq_file *seq, void *iter_ptr,
  1620. loff_t *pos)
  1621. {
  1622. struct gfs2_glock_iter *gi = seq->private;
  1623. (*pos)++;
  1624. if (gfs2_glock_iter_next(gi)) {
  1625. gfs2_glock_iter_free(gi);
  1626. return NULL;
  1627. }
  1628. return gi->gl;
  1629. }
  1630. static void gfs2_glock_seq_stop(struct seq_file *seq, void *iter_ptr)
  1631. {
  1632. struct gfs2_glock_iter *gi = seq->private;
  1633. gfs2_glock_iter_free(gi);
  1634. }
  1635. static int gfs2_glock_seq_show(struct seq_file *seq, void *iter_ptr)
  1636. {
  1637. return dump_glock(seq, iter_ptr);
  1638. }
  1639. static const struct seq_operations gfs2_glock_seq_ops = {
  1640. .start = gfs2_glock_seq_start,
  1641. .next = gfs2_glock_seq_next,
  1642. .stop = gfs2_glock_seq_stop,
  1643. .show = gfs2_glock_seq_show,
  1644. };
  1645. static int gfs2_debugfs_open(struct inode *inode, struct file *file)
  1646. {
  1647. int ret = seq_open_private(file, &gfs2_glock_seq_ops,
  1648. sizeof(struct gfs2_glock_iter));
  1649. if (ret == 0) {
  1650. struct seq_file *seq = file->private_data;
  1651. struct gfs2_glock_iter *gi = seq->private;
  1652. gi->sdp = inode->i_private;
  1653. }
  1654. return ret;
  1655. }
  1656. static const struct file_operations gfs2_debug_fops = {
  1657. .owner = THIS_MODULE,
  1658. .open = gfs2_debugfs_open,
  1659. .read = seq_read,
  1660. .llseek = seq_lseek,
  1661. .release = seq_release_private,
  1662. };
  1663. int gfs2_create_debugfs_file(struct gfs2_sbd *sdp)
  1664. {
  1665. sdp->debugfs_dir = debugfs_create_dir(sdp->sd_table_name, gfs2_root);
  1666. if (!sdp->debugfs_dir)
  1667. return -ENOMEM;
  1668. sdp->debugfs_dentry_glocks = debugfs_create_file("glocks",
  1669. S_IFREG | S_IRUGO,
  1670. sdp->debugfs_dir, sdp,
  1671. &gfs2_debug_fops);
  1672. if (!sdp->debugfs_dentry_glocks)
  1673. return -ENOMEM;
  1674. return 0;
  1675. }
  1676. void gfs2_delete_debugfs_file(struct gfs2_sbd *sdp)
  1677. {
  1678. if (sdp && sdp->debugfs_dir) {
  1679. if (sdp->debugfs_dentry_glocks) {
  1680. debugfs_remove(sdp->debugfs_dentry_glocks);
  1681. sdp->debugfs_dentry_glocks = NULL;
  1682. }
  1683. debugfs_remove(sdp->debugfs_dir);
  1684. sdp->debugfs_dir = NULL;
  1685. }
  1686. }
  1687. int gfs2_register_debugfs(void)
  1688. {
  1689. gfs2_root = debugfs_create_dir("gfs2", NULL);
  1690. return gfs2_root ? 0 : -ENOMEM;
  1691. }
  1692. void gfs2_unregister_debugfs(void)
  1693. {
  1694. debugfs_remove(gfs2_root);
  1695. gfs2_root = NULL;
  1696. }