Groups | Search | Server Info | Keyboard shortcuts | Login | Register [http] [https] [nntp] [nntps]
Groups > linux.kernel > #1220590
| From | Thomas Gleixner <tglx@linutronix.de> |
|---|---|
| Newsgroups | linux.kernel |
| Subject | Re: [RFC][PATCH RT 0/3] RT: Fix trylock deadlock without msleep() hack |
| Date | 2015-09-08 10:20 +0200 |
| Message-ID | <q6mif-72x-31@gated-at.bofh.it> (permalink) |
| References | <q4NZf-3Zz-3@gated-at.bofh.it> <q5j35-6jH-41@gated-at.bofh.it> <q5ks9-8rE-9@gated-at.bofh.it> <q6082-ic-1@gated-at.bofh.it> <q6lFw-63O-11@gated-at.bofh.it> |
| Organization | linux.* mail to news gateway |
On Tue, 8 Sep 2015, Ingo Molnar wrote:
>
> * Thomas Gleixner <tglx@linutronix.de> wrote:
>
> > 3) sched_yield() makes me shudder
> >
> > CPU0 CPU1
> >
> > taskA
> > lock(x->lock)
> >
> > preemption
> > taskC
> > taskB
> > lock(y->lock);
> > x = y->x;
> > if (!try_lock(x->lock)) {
> > unlock(y->lock);
> > boost(taskA);
> > sched_yield(); <- returns immediately
>
> So I'm still struggling with properly parsing the usecase.
>
> If y->x might become invalid the moment we drop y->lock, what makes
> the 'taskA' use (after we've dropped y->lock) safe? Shouldn't we at
> least also have a task_get(taskA)/task_put(taskA) reference count,
> to make sure the boosted task stays around?
Stevens trylock_and_boost() function makes sure that taskA cannot go
away while doing the boosting. It's a bug in my pseudo code, but that
does not make the issue above going away.
> And if we are into getting reference counts, why not solve it at a
> higher level and get a reference count to 'x' to make sure it's safe
> to use? Then we could do:
>
> lock(y->lock);
> retry:
> x = y->x;
> if (!trylock(x->lock)) {
> get_ref(x->count)
> unlock(y->lock);
> lock(x->lock);
> lock(y->lock);
> put_ref(x->count);
> if (y->x != x) { /* Retry if 'x' got dropped meanwhile */
> unlock(x->lock);
> goto retry;
> }
> }
>
> Or so.
In the case of dcache::dentry_kill() we probably do not have to take
refcounts and it might be actually counterproductive to do so. y->x,
i.e. dentry->parent, cannot vanish under us, if I understand the life
time rules correctly.
Aside of that, yes, I was thinking about a similar scheme for
that. I need some more time to grok all the rules there :)
Thanks,
tglx
--
To unsubscribe from this list: send the line "unsubscribe linux-kernel" in
the body of a message to majordomo@vger.kernel.org
More majordomo info at http://vger.kernel.org/majordomo-info.html
Please read the FAQ at http://www.tux.org/lkml/
Back to linux.kernel | Previous | Next — Previous in thread | Next in thread | Find similar | Unroll thread
Re: [RFC][PATCH RT 0/3] RT: Fix trylock deadlock without msleep() hack Ingo Molnar <mingo@kernel.org> - 2015-09-08 09:40 +0200
Re: [RFC][PATCH RT 0/3] RT: Fix trylock deadlock without msleep() hack Thomas Gleixner <tglx@linutronix.de> - 2015-09-08 10:20 +0200
Re: [RFC][PATCH RT 0/3] RT: Fix trylock deadlock without msleep() hack Ingo Molnar <mingo@kernel.org> - 2015-09-14 12:00 +0200
csiph-web