2 * Copyright (C) Sistina Software, Inc. 1997-2003 All rights reserved.
3 * Copyright (C) 2004-2005 Red Hat, Inc. All rights reserved.
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 v.2.
12 static char junk_lvb[GDLM_LVB_SIZE];
14 static void queue_complete(struct gdlm_lock *lp)
16 struct gdlm_ls *ls = lp->ls;
18 clear_bit(LFL_ACTIVE, &lp->flags);
20 spin_lock(&ls->async_lock);
21 list_add_tail(&lp->clist, &ls->complete);
22 spin_unlock(&ls->async_lock);
23 wake_up(&ls->thread_wait);
26 static inline void gdlm_ast(void *astarg)
28 queue_complete(astarg);
31 static inline void gdlm_bast(void *astarg, int mode)
33 struct gdlm_lock *lp = astarg;
34 struct gdlm_ls *ls = lp->ls;
37 printk(KERN_INFO "lock_dlm: bast mode zero %x,%llx\n",
39 (unsigned long long)lp->lockname.ln_number);
43 spin_lock(&ls->async_lock);
45 list_add_tail(&lp->blist, &ls->blocking);
47 } else if (lp->bast_mode < mode)
49 spin_unlock(&ls->async_lock);
50 wake_up(&ls->thread_wait);
53 void gdlm_queue_delayed(struct gdlm_lock *lp)
55 struct gdlm_ls *ls = lp->ls;
57 spin_lock(&ls->async_lock);
58 list_add_tail(&lp->delay_list, &ls->delayed);
59 spin_unlock(&ls->async_lock);
62 /* convert gfs lock-state to dlm lock-mode */
64 static int16_t make_mode(int16_t lmstate)
76 gdlm_assert(0, "unknown LM state %d", lmstate);
80 /* convert dlm lock-mode to gfs lock-state */
82 int16_t gdlm_make_lmstate(int16_t dlmmode)
87 return LM_ST_UNLOCKED;
89 return LM_ST_EXCLUSIVE;
91 return LM_ST_DEFERRED;
95 gdlm_assert(0, "unknown DLM mode %d", dlmmode);
99 /* verify agreement with GFS on the current lock state, NB: DLM_LOCK_NL and
100 DLM_LOCK_IV are both considered LM_ST_UNLOCKED by GFS. */
102 static void check_cur_state(struct gdlm_lock *lp, unsigned int cur_state)
104 int16_t cur = make_mode(cur_state);
105 if (lp->cur != DLM_LOCK_IV)
106 gdlm_assert(lp->cur == cur, "%d, %d", lp->cur, cur);
109 static inline unsigned int make_flags(struct gdlm_lock *lp,
110 unsigned int gfs_flags,
111 int16_t cur, int16_t req)
113 unsigned int lkf = 0;
115 if (gfs_flags & LM_FLAG_TRY)
116 lkf |= DLM_LKF_NOQUEUE;
118 if (gfs_flags & LM_FLAG_TRY_1CB) {
119 lkf |= DLM_LKF_NOQUEUE;
120 lkf |= DLM_LKF_NOQUEUEBAST;
123 if (gfs_flags & LM_FLAG_PRIORITY) {
124 lkf |= DLM_LKF_NOORDER;
125 lkf |= DLM_LKF_HEADQUE;
128 if (gfs_flags & LM_FLAG_ANY) {
129 if (req == DLM_LOCK_PR)
130 lkf |= DLM_LKF_ALTCW;
131 else if (req == DLM_LOCK_CW)
132 lkf |= DLM_LKF_ALTPR;
135 if (lp->lksb.sb_lkid != 0) {
136 lkf |= DLM_LKF_CONVERT;
138 /* Conversion deadlock avoidance by DLM */
140 if (!test_bit(LFL_FORCE_PROMOTE, &lp->flags) &&
141 !(lkf & DLM_LKF_NOQUEUE) &&
142 cur > DLM_LOCK_NL && req > DLM_LOCK_NL && cur != req)
143 lkf |= DLM_LKF_CONVDEADLK;
147 lkf |= DLM_LKF_VALBLK;
152 /* make_strname - convert GFS lock numbers to a string */
154 static inline void make_strname(struct lm_lockname *lockname,
155 struct gdlm_strname *str)
157 sprintf(str->name, "%8x%16llx", lockname->ln_type,
158 (unsigned long long)lockname->ln_number);
159 str->namelen = GDLM_STRNAME_BYTES;
162 static int gdlm_create_lp(struct gdlm_ls *ls, struct lm_lockname *name,
163 struct gdlm_lock **lpp)
165 struct gdlm_lock *lp;
167 lp = kzalloc(sizeof(struct gdlm_lock), GFP_KERNEL);
171 lp->lockname = *name;
173 lp->cur = DLM_LOCK_IV;
175 lp->hold_null = NULL;
176 init_completion(&lp->ast_wait);
177 INIT_LIST_HEAD(&lp->clist);
178 INIT_LIST_HEAD(&lp->blist);
179 INIT_LIST_HEAD(&lp->delay_list);
181 spin_lock(&ls->async_lock);
182 list_add(&lp->all_list, &ls->all_locks);
183 ls->all_locks_count++;
184 spin_unlock(&ls->async_lock);
190 void gdlm_delete_lp(struct gdlm_lock *lp)
192 struct gdlm_ls *ls = lp->ls;
194 spin_lock(&ls->async_lock);
195 if (!list_empty(&lp->clist))
196 list_del_init(&lp->clist);
197 if (!list_empty(&lp->blist))
198 list_del_init(&lp->blist);
199 if (!list_empty(&lp->delay_list))
200 list_del_init(&lp->delay_list);
201 gdlm_assert(!list_empty(&lp->all_list), "%x,%llx", lp->lockname.ln_type,
202 (unsigned long long)lp->lockname.ln_number);
203 list_del_init(&lp->all_list);
204 ls->all_locks_count--;
205 spin_unlock(&ls->async_lock);
210 int gdlm_get_lock(lm_lockspace_t *lockspace, struct lm_lockname *name,
213 struct gdlm_lock *lp;
216 error = gdlm_create_lp((struct gdlm_ls *) lockspace, name, &lp);
218 *lockp = (lm_lock_t *) lp;
222 void gdlm_put_lock(lm_lock_t *lock)
224 gdlm_delete_lp((struct gdlm_lock *) lock);
227 unsigned int gdlm_do_lock(struct gdlm_lock *lp)
229 struct gdlm_ls *ls = lp->ls;
230 struct gdlm_strname str;
234 * When recovery is in progress, delay lock requests for submission
235 * once recovery is done. Requests for recovery (NOEXP) and unlocks
239 if (test_bit(DFL_BLOCK_LOCKS, &ls->flags) &&
240 !test_bit(LFL_NOBLOCK, &lp->flags) && lp->req != DLM_LOCK_NL) {
241 gdlm_queue_delayed(lp);
246 * Submit the actual lock request.
249 if (test_bit(LFL_NOBAST, &lp->flags))
252 make_strname(&lp->lockname, &str);
254 set_bit(LFL_ACTIVE, &lp->flags);
256 log_debug("lk %x,%llx id %x %d,%d %x", lp->lockname.ln_type,
257 (unsigned long long)lp->lockname.ln_number, lp->lksb.sb_lkid,
258 lp->cur, lp->req, lp->lkf);
260 error = dlm_lock(ls->dlm_lockspace, lp->req, &lp->lksb, lp->lkf,
261 str.name, str.namelen, 0, gdlm_ast, lp,
262 bast ? gdlm_bast : NULL);
264 if ((error == -EAGAIN) && (lp->lkf & DLM_LKF_NOQUEUE)) {
265 lp->lksb.sb_status = -EAGAIN;
271 log_debug("%s: gdlm_lock %x,%llx err=%d cur=%d req=%d lkf=%x "
272 "flags=%lx", ls->fsname, lp->lockname.ln_type,
273 (unsigned long long)lp->lockname.ln_number, error,
274 lp->cur, lp->req, lp->lkf, lp->flags);
280 static unsigned int gdlm_do_unlock(struct gdlm_lock *lp)
282 struct gdlm_ls *ls = lp->ls;
283 unsigned int lkf = 0;
286 set_bit(LFL_DLM_UNLOCK, &lp->flags);
287 set_bit(LFL_ACTIVE, &lp->flags);
290 lkf = DLM_LKF_VALBLK;
292 log_debug("un %x,%llx %x %d %x", lp->lockname.ln_type,
293 (unsigned long long)lp->lockname.ln_number,
294 lp->lksb.sb_lkid, lp->cur, lkf);
296 error = dlm_unlock(ls->dlm_lockspace, lp->lksb.sb_lkid, lkf, NULL, lp);
299 log_debug("%s: gdlm_unlock %x,%llx err=%d cur=%d req=%d lkf=%x "
300 "flags=%lx", ls->fsname, lp->lockname.ln_type,
301 (unsigned long long)lp->lockname.ln_number, error,
302 lp->cur, lp->req, lp->lkf, lp->flags);
308 unsigned int gdlm_lock(lm_lock_t *lock, unsigned int cur_state,
309 unsigned int req_state, unsigned int flags)
311 struct gdlm_lock *lp = (struct gdlm_lock *) lock;
313 clear_bit(LFL_DLM_CANCEL, &lp->flags);
314 if (flags & LM_FLAG_NOEXP)
315 set_bit(LFL_NOBLOCK, &lp->flags);
317 check_cur_state(lp, cur_state);
318 lp->req = make_mode(req_state);
319 lp->lkf = make_flags(lp, flags, lp->cur, lp->req);
321 return gdlm_do_lock(lp);
324 unsigned int gdlm_unlock(lm_lock_t *lock, unsigned int cur_state)
326 struct gdlm_lock *lp = (struct gdlm_lock *) lock;
328 clear_bit(LFL_DLM_CANCEL, &lp->flags);
329 if (lp->cur == DLM_LOCK_IV)
331 return gdlm_do_unlock(lp);
334 void gdlm_cancel(lm_lock_t *lock)
336 struct gdlm_lock *lp = (struct gdlm_lock *) lock;
337 struct gdlm_ls *ls = lp->ls;
338 int error, delay_list = 0;
340 if (test_bit(LFL_DLM_CANCEL, &lp->flags))
343 log_info("gdlm_cancel %x,%llx flags %lx", lp->lockname.ln_type,
344 (unsigned long long)lp->lockname.ln_number, lp->flags);
346 spin_lock(&ls->async_lock);
347 if (!list_empty(&lp->delay_list)) {
348 list_del_init(&lp->delay_list);
351 spin_unlock(&ls->async_lock);
354 set_bit(LFL_CANCEL, &lp->flags);
355 set_bit(LFL_ACTIVE, &lp->flags);
360 if (!test_bit(LFL_ACTIVE, &lp->flags) ||
361 test_bit(LFL_DLM_UNLOCK, &lp->flags)) {
362 log_info("gdlm_cancel skip %x,%llx flags %lx",
363 lp->lockname.ln_type,
364 (unsigned long long)lp->lockname.ln_number, lp->flags);
368 /* the lock is blocked in the dlm */
370 set_bit(LFL_DLM_CANCEL, &lp->flags);
371 set_bit(LFL_ACTIVE, &lp->flags);
373 error = dlm_unlock(ls->dlm_lockspace, lp->lksb.sb_lkid, DLM_LKF_CANCEL,
376 log_info("gdlm_cancel rv %d %x,%llx flags %lx", error,
377 lp->lockname.ln_type,
378 (unsigned long long)lp->lockname.ln_number, lp->flags);
381 clear_bit(LFL_DLM_CANCEL, &lp->flags);
384 static int gdlm_add_lvb(struct gdlm_lock *lp)
388 lvb = kzalloc(GDLM_LVB_SIZE, GFP_KERNEL);
392 lp->lksb.sb_lvbptr = lvb;
397 static void gdlm_del_lvb(struct gdlm_lock *lp)
401 lp->lksb.sb_lvbptr = NULL;
404 /* This can do a synchronous dlm request (requiring a lock_dlm thread to get
405 the completion) because gfs won't call hold_lvb() during a callback (from
406 the context of a lock_dlm thread). */
408 static int hold_null_lock(struct gdlm_lock *lp)
410 struct gdlm_lock *lpn = NULL;
414 printk(KERN_INFO "lock_dlm: lvb already held\n");
418 error = gdlm_create_lp(lp->ls, &lp->lockname, &lpn);
422 lpn->lksb.sb_lvbptr = junk_lvb;
425 lpn->req = DLM_LOCK_NL;
426 lpn->lkf = DLM_LKF_VALBLK | DLM_LKF_EXPEDITE;
427 set_bit(LFL_NOBAST, &lpn->flags);
428 set_bit(LFL_INLOCK, &lpn->flags);
430 init_completion(&lpn->ast_wait);
432 wait_for_completion(&lpn->ast_wait);
433 error = lp->lksb.sb_status;
435 printk(KERN_INFO "lock_dlm: hold_null_lock dlm error %d\n",
445 /* This cannot do a synchronous dlm request (requiring a lock_dlm thread to get
446 the completion) because gfs may call unhold_lvb() during a callback (from
447 the context of a lock_dlm thread) which could cause a deadlock since the
448 other lock_dlm thread could be engaged in recovery. */
450 static void unhold_null_lock(struct gdlm_lock *lp)
452 struct gdlm_lock *lpn = lp->hold_null;
454 gdlm_assert(lpn, "%x,%llx", lp->lockname.ln_type,
455 (unsigned long long)lp->lockname.ln_number);
456 lpn->lksb.sb_lvbptr = NULL;
458 set_bit(LFL_UNLOCK_DELETE, &lpn->flags);
460 lp->hold_null = NULL;
463 /* Acquire a NL lock because gfs requires the value block to remain
464 intact on the resource while the lvb is "held" even if it's holding no locks
467 int gdlm_hold_lvb(lm_lock_t *lock, char **lvbp)
469 struct gdlm_lock *lp = (struct gdlm_lock *) lock;
472 error = gdlm_add_lvb(lp);
478 error = hold_null_lock(lp);
485 void gdlm_unhold_lvb(lm_lock_t *lock, char *lvb)
487 struct gdlm_lock *lp = (struct gdlm_lock *) lock;
489 unhold_null_lock(lp);
493 void gdlm_sync_lvb(lm_lock_t *lock, char *lvb)
495 struct gdlm_lock *lp = (struct gdlm_lock *) lock;
497 if (lp->cur != DLM_LOCK_EX)
500 init_completion(&lp->ast_wait);
501 set_bit(LFL_SYNC_LVB, &lp->flags);
503 lp->req = DLM_LOCK_EX;
504 lp->lkf = make_flags(lp, 0, lp->cur, lp->req);
507 wait_for_completion(&lp->ast_wait);
510 void gdlm_submit_delayed(struct gdlm_ls *ls)
512 struct gdlm_lock *lp, *safe;
514 spin_lock(&ls->async_lock);
515 list_for_each_entry_safe(lp, safe, &ls->delayed, delay_list) {
516 list_del_init(&lp->delay_list);
517 list_add_tail(&lp->delay_list, &ls->submit);
519 spin_unlock(&ls->async_lock);
520 wake_up(&ls->thread_wait);
523 int gdlm_release_all_locks(struct gdlm_ls *ls)
525 struct gdlm_lock *lp, *safe;
528 spin_lock(&ls->async_lock);
529 list_for_each_entry_safe(lp, safe, &ls->all_locks, all_list) {
530 list_del_init(&lp->all_list);
532 if (lp->lvb && lp->lvb != junk_lvb)
537 spin_unlock(&ls->async_lock);