[deliverable/linux.git] / fs / gfs2 / locking / dlm / thread.c

/*
 * Copyright (C) Sistina Software, Inc.  1997-2003 All rights reserved.
 * Copyright (C) 2004-2005 Red Hat, Inc.  All rights reserved.
 *
 * This copyrighted material is made available to anyone wishing to use,
 * modify, copy, or redistribute it subject to the terms and conditions
 * of the GNU General Public License version 2.
 */

#include "lock_dlm.h"

/* A lock placed on this queue is re-submitted to DLM as soon as the lock_dlm
   thread gets to it. */

static void queue_submit(struct gdlm_lock *lp)
{
	struct gdlm_ls *ls = lp->ls;

	spin_lock(&ls->async_lock);
	list_add_tail(&lp->delay_list, &ls->submit);
	spin_unlock(&ls->async_lock);
	wake_up(&ls->thread_wait);
}

static void process_blocking(struct gdlm_lock *lp, int bast_mode)
{
	struct gdlm_ls *ls = lp->ls;
	unsigned int cb = 0;

	switch (gdlm_make_lmstate(bast_mode)) {
	case LM_ST_EXCLUSIVE:
		cb = LM_CB_NEED_E;
		break;
	case LM_ST_DEFERRED:
		cb = LM_CB_NEED_D;
		break;
	case LM_ST_SHARED:
		cb = LM_CB_NEED_S;
		break;
	default:
		gdlm_assert(0, "unknown bast mode %u", lp->bast_mode);
	}

	ls->fscb(ls->fsdata, cb, &lp->lockname);
}

static void process_complete(struct gdlm_lock *lp)
{
	struct gdlm_ls *ls = lp->ls;
	struct lm_async_cb acb;
	s16 prev_mode = lp->cur;

	memset(&acb, 0, sizeof(acb));

	if (lp->lksb.sb_status == -DLM_ECANCEL) {
		log_info("complete dlm cancel %x,%llx flags %lx",
		 	 lp->lockname.ln_type, 
			 (unsigned long long)lp->lockname.ln_number,
			 lp->flags);

		lp->req = lp->cur;
		acb.lc_ret |= LM_OUT_CANCELED;
		if (lp->cur == DLM_LOCK_IV)
			lp->lksb.sb_lkid = 0;
		goto out;
	}

	if (test_and_clear_bit(LFL_DLM_UNLOCK, &lp->flags)) {
		if (lp->lksb.sb_status != -DLM_EUNLOCK) {
			log_info("unlock sb_status %d %x,%llx flags %lx",
				 lp->lksb.sb_status, lp->lockname.ln_type,
				 (unsigned long long)lp->lockname.ln_number,
				 lp->flags);
			return;
		}

		lp->cur = DLM_LOCK_IV;
		lp->req = DLM_LOCK_IV;
		lp->lksb.sb_lkid = 0;

		if (test_and_clear_bit(LFL_UNLOCK_DELETE, &lp->flags)) {
			gdlm_delete_lp(lp);
			return;
		}
		goto out;
	}

	if (lp->lksb.sb_flags & DLM_SBF_VALNOTVALID)
		memset(lp->lksb.sb_lvbptr, 0, GDLM_LVB_SIZE);

	if (lp->lksb.sb_flags & DLM_SBF_ALTMODE) {
		if (lp->req == DLM_LOCK_PR)
			lp->req = DLM_LOCK_CW;
		else if (lp->req == DLM_LOCK_CW)
			lp->req = DLM_LOCK_PR;
	}

	/*
	 * A canceled lock request.  The lock was just taken off the delayed
	 * list and was never even submitted to dlm.
	 */

	if (test_and_clear_bit(LFL_CANCEL, &lp->flags)) {
		log_info("complete internal cancel %x,%llx",
		 	 lp->lockname.ln_type, 
			 (unsigned long long)lp->lockname.ln_number);
		lp->req = lp->cur;
		acb.lc_ret |= LM_OUT_CANCELED;
		goto out;
	}

	/*
	 * An error occured.
	 */

	if (lp->lksb.sb_status) {
		/* a "normal" error */
		if ((lp->lksb.sb_status == -EAGAIN) &&
		    (lp->lkf & DLM_LKF_NOQUEUE)) {
			lp->req = lp->cur;
			if (lp->cur == DLM_LOCK_IV)
				lp->lksb.sb_lkid = 0;
			goto out;
		}

		/* this could only happen with cancels I think */
		log_info("ast sb_status %d %x,%llx flags %lx",
			 lp->lksb.sb_status, lp->lockname.ln_type,
			 (unsigned long long)lp->lockname.ln_number,
			 lp->flags);
		return;
	}

	/*
	 * This is an AST for an EX->EX conversion for sync_lvb from GFS.
	 */

	if (test_and_clear_bit(LFL_SYNC_LVB, &lp->flags)) {
		complete(&lp->ast_wait);
		return;
	}

	/*
	 * A lock has been demoted to NL because it initially completed during
	 * BLOCK_LOCKS.  Now it must be requested in the originally requested
	 * mode.
	 */

	if (test_and_clear_bit(LFL_REREQUEST, &lp->flags)) {
		gdlm_assert(lp->req == DLM_LOCK_NL, "%x,%llx",
			    lp->lockname.ln_type,
			    (unsigned long long)lp->lockname.ln_number);
		gdlm_assert(lp->prev_req > DLM_LOCK_NL, "%x,%llx",
			    lp->lockname.ln_type,
			    (unsigned long long)lp->lockname.ln_number);

		lp->cur = DLM_LOCK_NL;
		lp->req = lp->prev_req;
		lp->prev_req = DLM_LOCK_IV;
		lp->lkf &= ~DLM_LKF_CONVDEADLK;

		set_bit(LFL_NOCACHE, &lp->flags);

		if (test_bit(DFL_BLOCK_LOCKS, &ls->flags) &&
		    !test_bit(LFL_NOBLOCK, &lp->flags))
			gdlm_queue_delayed(lp);
		else
			queue_submit(lp);
		return;
	}

	/*
	 * A request is granted during dlm recovery.  It may be granted
	 * because the locks of a failed node were cleared.  In that case,
	 * there may be inconsistent data beneath this lock and we must wait
	 * for recovery to complete to use it.  When gfs recovery is done this
	 * granted lock will be converted to NL and then reacquired in this
	 * granted state.
	 */

	if (test_bit(DFL_BLOCK_LOCKS, &ls->flags) &&
	    !test_bit(LFL_NOBLOCK, &lp->flags) &&
	    lp->req != DLM_LOCK_NL) {

		lp->cur = lp->req;
		lp->prev_req = lp->req;
		lp->req = DLM_LOCK_NL;
		lp->lkf |= DLM_LKF_CONVERT;
		lp->lkf &= ~DLM_LKF_CONVDEADLK;

		log_debug("rereq %x,%llx id %x %d,%d",
			  lp->lockname.ln_type,
			  (unsigned long long)lp->lockname.ln_number,
			  lp->lksb.sb_lkid, lp->cur, lp->req);

		set_bit(LFL_REREQUEST, &lp->flags);
		queue_submit(lp);
		return;
	}

	/*
	 * DLM demoted the lock to NL before it was granted so GFS must be
	 * told it cannot cache data for this lock.
	 */

	if (lp->lksb.sb_flags & DLM_SBF_DEMOTED)
		set_bit(LFL_NOCACHE, &lp->flags);

out:
	/*
	 * This is an internal lock_dlm lock
	 */

	if (test_bit(LFL_INLOCK, &lp->flags)) {
		clear_bit(LFL_NOBLOCK, &lp->flags);
		lp->cur = lp->req;
		complete(&lp->ast_wait);
		return;
	}

	/*
	 * Normal completion of a lock request.  Tell GFS it now has the lock.
	 */

	clear_bit(LFL_NOBLOCK, &lp->flags);
	lp->cur = lp->req;

	acb.lc_name = lp->lockname;
	acb.lc_ret |= gdlm_make_lmstate(lp->cur);

	if (!test_and_clear_bit(LFL_NOCACHE, &lp->flags) &&
	    (lp->cur > DLM_LOCK_NL) && (prev_mode > DLM_LOCK_NL))
		acb.lc_ret |= LM_OUT_CACHEABLE;

	ls->fscb(ls->fsdata, LM_CB_ASYNC, &acb);
}

static inline int no_work(struct gdlm_ls *ls, int blocking)
{
	int ret;

	spin_lock(&ls->async_lock);
	ret = list_empty(&ls->complete) && list_empty(&ls->submit);
	if (ret && blocking)
		ret = list_empty(&ls->blocking);
	spin_unlock(&ls->async_lock);

	return ret;
}

static inline int check_drop(struct gdlm_ls *ls)
{
	if (!ls->drop_locks_count)
		return 0;

	if (time_after(jiffies, ls->drop_time + ls->drop_locks_period * HZ)) {
		ls->drop_time = jiffies;
		if (ls->all_locks_count >= ls->drop_locks_count)
			return 1;
	}
	return 0;
}

static int gdlm_thread(void *data)
{
	struct gdlm_ls *ls = (struct gdlm_ls *) data;
	struct gdlm_lock *lp = NULL;
	int blist = 0;
	uint8_t complete, blocking, submit, drop;
	DECLARE_WAITQUEUE(wait, current);

	/* Only thread1 is allowed to do blocking callbacks since gfs
	   may wait for a completion callback within a blocking cb. */

	if (current == ls->thread1)
		blist = 1;

	while (!kthread_should_stop()) {
		set_current_state(TASK_INTERRUPTIBLE);
		add_wait_queue(&ls->thread_wait, &wait);
		if (no_work(ls, blist))
			schedule();
		remove_wait_queue(&ls->thread_wait, &wait);
		set_current_state(TASK_RUNNING);

		complete = blocking = submit = drop = 0;

		spin_lock(&ls->async_lock);

		if (blist && !list_empty(&ls->blocking)) {
			lp = list_entry(ls->blocking.next, struct gdlm_lock,
					blist);
			list_del_init(&lp->blist);
			blocking = lp->bast_mode;
			lp->bast_mode = 0;
		} else if (!list_empty(&ls->complete)) {
			lp = list_entry(ls->complete.next, struct gdlm_lock,
					clist);
			list_del_init(&lp->clist);
			complete = 1;
		} else if (!list_empty(&ls->submit)) {
			lp = list_entry(ls->submit.next, struct gdlm_lock,
					delay_list);
			list_del_init(&lp->delay_list);
			submit = 1;
		}

		drop = check_drop(ls);
		spin_unlock(&ls->async_lock);

		if (complete)
			process_complete(lp);

		else if (blocking)
			process_blocking(lp, blocking);

		else if (submit)
			gdlm_do_lock(lp);

		if (drop)
			ls->fscb(ls->fsdata, LM_CB_DROPLOCKS, NULL);

		schedule();
	}

	return 0;
}

int gdlm_init_threads(struct gdlm_ls *ls)
{
	struct task_struct *p;
	int error;

	p = kthread_run(gdlm_thread, ls, "lock_dlm1");
	error = IS_ERR(p);
	if (error) {
		log_error("can't start lock_dlm1 thread %d", error);
		return error;
	}
	ls->thread1 = p;

	p = kthread_run(gdlm_thread, ls, "lock_dlm2");
	error = IS_ERR(p);
	if (error) {
		log_error("can't start lock_dlm2 thread %d", error);
		kthread_stop(ls->thread1);
		return error;
	}
	ls->thread2 = p;

	return 0;
}

void gdlm_release_threads(struct gdlm_ls *ls)
{
	kthread_stop(ls->thread1);
	kthread_stop(ls->thread2);
}
Commit	Line	Data
869d81df DT	1	/*
	2	* Copyright (C) Sistina Software, Inc. 1997-2003 All rights reserved.
	3	* Copyright (C) 2004-2005 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
e9fc2aa0	7	* of the GNU General Public License version 2.
869d81df	8	*/
29b7998d DT	9
	10	#include "lock_dlm.h"
	11
	12	/* A lock placed on this queue is re-submitted to DLM as soon as the lock_dlm
	13	thread gets to it. */
	14
	15	static void queue_submit(struct gdlm_lock *lp)
	16	{
	17	struct gdlm_ls *ls = lp->ls;
	18
	19	spin_lock(&ls->async_lock);
	20	list_add_tail(&lp->delay_list, &ls->submit);
	21	spin_unlock(&ls->async_lock);
	22	wake_up(&ls->thread_wait);
	23	}
	24
29b7998d DT	25	static void process_blocking(struct gdlm_lock *lp, int bast_mode)
	26	{
	27	struct gdlm_ls *ls = lp->ls;
869d81df	28	unsigned int cb = 0;
29b7998d DT	29
	30	switch (gdlm_make_lmstate(bast_mode)) {
	31	case LM_ST_EXCLUSIVE:
	32	cb = LM_CB_NEED_E;
	33	break;
	34	case LM_ST_DEFERRED:
	35	cb = LM_CB_NEED_D;
	36	break;
	37	case LM_ST_SHARED:
	38	cb = LM_CB_NEED_S;
	39	break;
	40	default:
869d81df	41	gdlm_assert(0, "unknown bast mode %u", lp->bast_mode);
29b7998d DT	42	}
	43
	44	ls->fscb(ls->fsdata, cb, &lp->lockname);
	45	}
	46
	47	static void process_complete(struct gdlm_lock *lp)
	48	{
	49	struct gdlm_ls *ls = lp->ls;
	50	struct lm_async_cb acb;
cd915493	51	s16 prev_mode = lp->cur;
29b7998d DT	52
	53	memset(&acb, 0, sizeof(acb));
	54
	55	if (lp->lksb.sb_status == -DLM_ECANCEL) {
869d81df	56	log_info("complete dlm cancel %x,%llx flags %lx",
0239c4ae DW	57	lp->lockname.ln_type,
0239c4ae DW	58	(unsigned long long)lp->lockname.ln_number,
869d81df	59	lp->flags);
29b7998d DT	60
	61	lp->req = lp->cur;
	62	acb.lc_ret \|= LM_OUT_CANCELED;
	63	if (lp->cur == DLM_LOCK_IV)
	64	lp->lksb.sb_lkid = 0;
	65	goto out;
	66	}
	67
	68	if (test_and_clear_bit(LFL_DLM_UNLOCK, &lp->flags)) {
	69	if (lp->lksb.sb_status != -DLM_EUNLOCK) {
869d81df DT	70	log_info("unlock sb_status %d %x,%llx flags %lx",
869d81df DT	71	lp->lksb.sb_status, lp->lockname.ln_type,
0239c4ae DW	72	(unsigned long long)lp->lockname.ln_number,
0239c4ae DW	73	lp->flags);
29b7998d DT	74	return;
	75	}
	76
	77	lp->cur = DLM_LOCK_IV;
	78	lp->req = DLM_LOCK_IV;
	79	lp->lksb.sb_lkid = 0;
	80
	81	if (test_and_clear_bit(LFL_UNLOCK_DELETE, &lp->flags)) {
	82	gdlm_delete_lp(lp);
	83	return;
	84	}
	85	goto out;
	86	}
	87
	88	if (lp->lksb.sb_flags & DLM_SBF_VALNOTVALID)
	89	memset(lp->lksb.sb_lvbptr, 0, GDLM_LVB_SIZE);
	90
	91	if (lp->lksb.sb_flags & DLM_SBF_ALTMODE) {
	92	if (lp->req == DLM_LOCK_PR)
	93	lp->req = DLM_LOCK_CW;
	94	else if (lp->req == DLM_LOCK_CW)
	95	lp->req = DLM_LOCK_PR;
	96	}
	97
	98	/*
	99	* A canceled lock request. The lock was just taken off the delayed
	100	* list and was never even submitted to dlm.
	101	*/
	102
	103	if (test_and_clear_bit(LFL_CANCEL, &lp->flags)) {
869d81df	104	log_info("complete internal cancel %x,%llx",
0239c4ae DW	105	lp->lockname.ln_type,
0239c4ae DW	106	(unsigned long long)lp->lockname.ln_number);
29b7998d DT	107	lp->req = lp->cur;
	108	acb.lc_ret \|= LM_OUT_CANCELED;
	109	goto out;
	110	}
	111
	112	/*
	113	* An error occured.
	114	*/
	115
	116	if (lp->lksb.sb_status) {
	117	/* a "normal" error */
	118	if ((lp->lksb.sb_status == -EAGAIN) &&
	119	(lp->lkf & DLM_LKF_NOQUEUE)) {
	120	lp->req = lp->cur;
	121	if (lp->cur == DLM_LOCK_IV)
	122	lp->lksb.sb_lkid = 0;
	123	goto out;
	124	}
	125
	126	/* this could only happen with cancels I think */
869d81df DT	127	log_info("ast sb_status %d %x,%llx flags %lx",
869d81df DT	128	lp->lksb.sb_status, lp->lockname.ln_type,
0239c4ae DW	129	(unsigned long long)lp->lockname.ln_number,
0239c4ae DW	130	lp->flags);
29b7998d DT	131	return;
	132	}
	133
	134	/*
	135	* This is an AST for an EX->EX conversion for sync_lvb from GFS.
	136	*/
	137
	138	if (test_and_clear_bit(LFL_SYNC_LVB, &lp->flags)) {
	139	complete(&lp->ast_wait);
	140	return;
	141	}
	142
	143	/*
	144	* A lock has been demoted to NL because it initially completed during
	145	* BLOCK_LOCKS. Now it must be requested in the originally requested
	146	* mode.
	147	*/
	148
	149	if (test_and_clear_bit(LFL_REREQUEST, &lp->flags)) {
869d81df	150	gdlm_assert(lp->req == DLM_LOCK_NL, "%x,%llx",
0239c4ae DW	151	lp->lockname.ln_type,
0239c4ae DW	152	(unsigned long long)lp->lockname.ln_number);
869d81df	153	gdlm_assert(lp->prev_req > DLM_LOCK_NL, "%x,%llx",
0239c4ae DW	154	lp->lockname.ln_type,
0239c4ae DW	155	(unsigned long long)lp->lockname.ln_number);
29b7998d DT	156
	157	lp->cur = DLM_LOCK_NL;
	158	lp->req = lp->prev_req;
	159	lp->prev_req = DLM_LOCK_IV;
	160	lp->lkf &= ~DLM_LKF_CONVDEADLK;
	161
	162	set_bit(LFL_NOCACHE, &lp->flags);
	163
	164	if (test_bit(DFL_BLOCK_LOCKS, &ls->flags) &&
	165	!test_bit(LFL_NOBLOCK, &lp->flags))
	166	gdlm_queue_delayed(lp);
	167	else
	168	queue_submit(lp);
	169	return;
	170	}
	171
	172	/*
	173	* A request is granted during dlm recovery. It may be granted
	174	* because the locks of a failed node were cleared. In that case,
	175	* there may be inconsistent data beneath this lock and we must wait
	176	* for recovery to complete to use it. When gfs recovery is done this
	177	* granted lock will be converted to NL and then reacquired in this
	178	* granted state.
	179	*/
	180
	181	if (test_bit(DFL_BLOCK_LOCKS, &ls->flags) &&
	182	!test_bit(LFL_NOBLOCK, &lp->flags) &&
	183	lp->req != DLM_LOCK_NL) {
	184
	185	lp->cur = lp->req;
	186	lp->prev_req = lp->req;
	187	lp->req = DLM_LOCK_NL;
	188	lp->lkf \|= DLM_LKF_CONVERT;
	189	lp->lkf &= ~DLM_LKF_CONVDEADLK;
	190
869d81df	191	log_debug("rereq %x,%llx id %x %d,%d",
0239c4ae DW	192	lp->lockname.ln_type,
0239c4ae DW	193	(unsigned long long)lp->lockname.ln_number,
29b7998d DT	194	lp->lksb.sb_lkid, lp->cur, lp->req);
	195
	196	set_bit(LFL_REREQUEST, &lp->flags);
	197	queue_submit(lp);
	198	return;
	199	}
	200
	201	/*
	202	* DLM demoted the lock to NL before it was granted so GFS must be
	203	* told it cannot cache data for this lock.
	204	*/
	205
	206	if (lp->lksb.sb_flags & DLM_SBF_DEMOTED)
	207	set_bit(LFL_NOCACHE, &lp->flags);
	208
a91ea69f	209	out:
29b7998d DT	210	/*
	211	* This is an internal lock_dlm lock
	212	*/
	213
	214	if (test_bit(LFL_INLOCK, &lp->flags)) {
	215	clear_bit(LFL_NOBLOCK, &lp->flags);
	216	lp->cur = lp->req;
	217	complete(&lp->ast_wait);
	218	return;
	219	}
	220
	221	/*
	222	* Normal completion of a lock request. Tell GFS it now has the lock.
	223	*/
	224
	225	clear_bit(LFL_NOBLOCK, &lp->flags);
	226	lp->cur = lp->req;
	227
	228	acb.lc_name = lp->lockname;
	229	acb.lc_ret \|= gdlm_make_lmstate(lp->cur);
	230
	231	if (!test_and_clear_bit(LFL_NOCACHE, &lp->flags) &&
	232	(lp->cur > DLM_LOCK_NL) && (prev_mode > DLM_LOCK_NL))
	233	acb.lc_ret \|= LM_OUT_CACHEABLE;
	234
	235	ls->fscb(ls->fsdata, LM_CB_ASYNC, &acb);
	236	}
	237
	238	static inline int no_work(struct gdlm_ls *ls, int blocking)
	239	{
	240	int ret;
	241
	242	spin_lock(&ls->async_lock);
	243	ret = list_empty(&ls->complete) && list_empty(&ls->submit);
	244	if (ret && blocking)
	245	ret = list_empty(&ls->blocking);
	246	spin_unlock(&ls->async_lock);
	247
	248	return ret;
	249	}
	250
	251	static inline int check_drop(struct gdlm_ls *ls)
	252	{
	253	if (!ls->drop_locks_count)
	254	return 0;
	255
	256	if (time_after(jiffies, ls->drop_time + ls->drop_locks_period * HZ)) {
	257	ls->drop_time = jiffies;
	258	if (ls->all_locks_count >= ls->drop_locks_count)
	259	return 1;
	260	}
	261	return 0;
	262	}
	263
	264	static int gdlm_thread(void *data)
	265	{
	266	struct gdlm_ls ls = (struct gdlm_ls ) data;
	267	struct gdlm_lock *lp = NULL;
	268	int blist = 0;
	269	uint8_t complete, blocking, submit, drop;
	270	DECLARE_WAITQUEUE(wait, current);
	271
	272	/* Only thread1 is allowed to do blocking callbacks since gfs
	273	may wait for a completion callback within a blocking cb. */
274
275	if (current == ls->thread1)
276	blist = 1;
277
278	while (!kthread_should_stop()) {
279	set_current_state(TASK_INTERRUPTIBLE);
280	add_wait_queue(&ls->thread_wait, &wait);
281	if (no_work(ls, blist))
282	schedule();
283	remove_wait_queue(&ls->thread_wait, &wait);
284	set_current_state(TASK_RUNNING);
285
286	complete = blocking = submit = drop = 0;
287
288	spin_lock(&ls->async_lock);
289
290	if (blist && !list_empty(&ls->blocking)) {
291	lp = list_entry(ls->blocking.next, struct gdlm_lock,
292	blist);
293	list_del_init(&lp->blist);
294	blocking = lp->bast_mode;
295	lp->bast_mode = 0;
296	} else if (!list_empty(&ls->complete)) {
297	lp = list_entry(ls->complete.next, struct gdlm_lock,
298	clist);
299	list_del_init(&lp->clist);
300	complete = 1;
301	} else if (!list_empty(&ls->submit)) {
302	lp = list_entry(ls->submit.next, struct gdlm_lock,
303	delay_list);
304	list_del_init(&lp->delay_list);
305	submit = 1;
306	}
307
308	drop = check_drop(ls);
309	spin_unlock(&ls->async_lock);
310
311	if (complete)
312	process_complete(lp);
313
314	else if (blocking)
315	process_blocking(lp, blocking);
316
317	else if (submit)
8d3b35a4	318	gdlm_do_lock(lp);
29b7998d DT	319
	320	if (drop)
	321	ls->fscb(ls->fsdata, LM_CB_DROPLOCKS, NULL);
	322
	323	schedule();
	324	}
	325
	326	return 0;
	327	}
	328
	329	int gdlm_init_threads(struct gdlm_ls *ls)
	330	{
	331	struct task_struct *p;
	332	int error;
	333
	334	p = kthread_run(gdlm_thread, ls, "lock_dlm1");
	335	error = IS_ERR(p);
	336	if (error) {
869d81df	337	log_error("can't start lock_dlm1 thread %d", error);
29b7998d DT	338	return error;
	339	}
	340	ls->thread1 = p;
	341
	342	p = kthread_run(gdlm_thread, ls, "lock_dlm2");
	343	error = IS_ERR(p);
	344	if (error) {
869d81df	345	log_error("can't start lock_dlm2 thread %d", error);
29b7998d DT	346	kthread_stop(ls->thread1);
	347	return error;
	348	}
	349	ls->thread2 = p;
	350
	351	return 0;
	352	}
	353
	354	void gdlm_release_threads(struct gdlm_ls *ls)
	355	{
	356	kthread_stop(ls->thread1);
	357	kthread_stop(ls->thread2);
	358	}
	359