Groups | Search | Server Info | Keyboard shortcuts | Login | Register [http] [https] [nntp] [nntps]
Groups > linux.kernel > #1540805 > unrolled thread
| Started by | Joel Fernandes <joelaf@google.com> |
|---|---|
| First post | 2016-12-13 03:10 +0100 |
| Last post | 2017-01-04 01:10 +0100 |
| Articles | 2 — 2 participants |
Back to article view | Back to linux.kernel
[PATCH v3] llist: Clarify comments about when locking is needed Joel Fernandes <joelaf@google.com> - 2016-12-13 03:10 +0100
Re: [PATCH v3] llist: Clarify comments about when locking is needed "Paul E. McKenney" <paulmck@linux.vnet.ibm.com> - 2017-01-04 01:10 +0100
| From | Joel Fernandes <joelaf@google.com> |
|---|---|
| Date | 2016-12-13 03:10 +0100 |
| Subject | [PATCH v3] llist: Clarify comments about when locking is needed |
| Message-ID | <sNKHv-3GS-7@gated-at.bofh.it> |
llist.h comments are confusing about when locking is needed versus when it isn't. Clarify these comments by being more descriptive about why locking is needed for llist_del_first. Cc: Ingo Molnar <mingo@kernel.org> Cc: Will Deacon <will.deacon@arm.com> Cc: Paul McKenney <paulmck@linux.vnet.ibm.com> Acked-by: Huang Ying <ying.huang@intel.com> Acked-by: Mathieu Desnoyers <mathieu.desnoyers@efficios.com> Signed-off-by: Joel Fernandes <joelaf@google.com> --- Changes since before: Minor changes to comment and commit message based on Mathieu's suggestions (https://lkml.org/lkml/2016/12/10/39) include/linux/llist.h | 37 +++++++++++++++++++++---------------- 1 file changed, 21 insertions(+), 16 deletions(-) diff --git a/include/linux/llist.h b/include/linux/llist.h index fd4ca0b..31822bb 100644 --- a/include/linux/llist.h +++ b/include/linux/llist.h @@ -3,28 +3,33 @@ /* * Lock-less NULL terminated single linked list * - * If there are multiple producers and multiple consumers, llist_add - * can be used in producers and llist_del_all can be used in - * consumers. They can work simultaneously without lock. But - * llist_del_first can not be used here. Because llist_del_first - * depends on list->first->next does not changed if list->first is not - * changed during its operation, but llist_del_first, llist_add, - * llist_add (or llist_del_all, llist_add, llist_add) sequence in - * another consumer may violate that. - * - * If there are multiple producers and one consumer, llist_add can be - * used in producers and llist_del_all or llist_del_first can be used - * in the consumer. - * - * This can be summarized as follow: + * Cases where locking is not needed: + * If there are multiple producers and multiple consumers, llist_add can be + * used in producers and llist_del_all can be used in consumers simultaneously + * without locking. Also a single consumer can use llist_del_first while + * multiple producers simultaneously use llist_add, without any locking. + * + * Cases where locking is needed: + * If we have multiple consumers with llist_del_first used in one consumer, and + * llist_del_first or llist_del_all used in other consumers, then a lock is + * needed. This is because llist_del_first depends on list->first->next not + * changing, but without lock protection, there's no way to be sure about that + * if a preemption happens in the middle of the delete operation and on being + * preempted back, the list->first is the same as before causing the cmpxchg in + * llist_del_first to succeed. For example, while a llist_del_first operation + * is in progress in one consumer, then a llist_del_first, llist_add, + * llist_add (or llist_del_all, llist_add, llist_add) sequence in another + * consumer may cause violations. + * + * This can be summarized as follows: * * | add | del_first | del_all * add | - | - | - * del_first | | L | L * del_all | | | - * - * Where "-" stands for no lock is needed, while "L" stands for lock - * is needed. + * Where, a particular row's operation can happen concurrently with a column's + * operation, with "-" being no lock needed, while "L" being lock is needed. * * The list entries deleted via llist_del_all can be traversed with * traversing function such as llist_for_each etc. But the list -- 2.8.0.rc3.226.g39d4020
[toc] | [next] | [standalone]
| From | "Paul E. McKenney" <paulmck@linux.vnet.ibm.com> |
|---|---|
| Date | 2017-01-04 01:10 +0100 |
| Message-ID | <sVHjr-5la-7@gated-at.bofh.it> |
| In reply to | #1540805 |
On Mon, Dec 12, 2016 at 06:01:45PM -0800, Joel Fernandes wrote: > llist.h comments are confusing about when locking is needed versus when it > isn't. Clarify these comments by being more descriptive about why locking is > needed for llist_del_first. > > Cc: Ingo Molnar <mingo@kernel.org> > Cc: Will Deacon <will.deacon@arm.com> > Cc: Paul McKenney <paulmck@linux.vnet.ibm.com> > Acked-by: Huang Ying <ying.huang@intel.com> > Acked-by: Mathieu Desnoyers <mathieu.desnoyers@efficios.com> > Signed-off-by: Joel Fernandes <joelaf@google.com> Queued for 4.12, thank you all! Thanx, Paul > --- > Changes since before: > Minor changes to comment and commit message based on Mathieu's suggestions > (https://lkml.org/lkml/2016/12/10/39) > > include/linux/llist.h | 37 +++++++++++++++++++++---------------- > 1 file changed, 21 insertions(+), 16 deletions(-) > > diff --git a/include/linux/llist.h b/include/linux/llist.h > index fd4ca0b..31822bb 100644 > --- a/include/linux/llist.h > +++ b/include/linux/llist.h > @@ -3,28 +3,33 @@ > /* > * Lock-less NULL terminated single linked list > * > - * If there are multiple producers and multiple consumers, llist_add > - * can be used in producers and llist_del_all can be used in > - * consumers. They can work simultaneously without lock. But > - * llist_del_first can not be used here. Because llist_del_first > - * depends on list->first->next does not changed if list->first is not > - * changed during its operation, but llist_del_first, llist_add, > - * llist_add (or llist_del_all, llist_add, llist_add) sequence in > - * another consumer may violate that. > - * > - * If there are multiple producers and one consumer, llist_add can be > - * used in producers and llist_del_all or llist_del_first can be used > - * in the consumer. > - * > - * This can be summarized as follow: > + * Cases where locking is not needed: > + * If there are multiple producers and multiple consumers, llist_add can be > + * used in producers and llist_del_all can be used in consumers simultaneously > + * without locking. Also a single consumer can use llist_del_first while > + * multiple producers simultaneously use llist_add, without any locking. > + * > + * Cases where locking is needed: > + * If we have multiple consumers with llist_del_first used in one consumer, and > + * llist_del_first or llist_del_all used in other consumers, then a lock is > + * needed. This is because llist_del_first depends on list->first->next not > + * changing, but without lock protection, there's no way to be sure about that > + * if a preemption happens in the middle of the delete operation and on being > + * preempted back, the list->first is the same as before causing the cmpxchg in > + * llist_del_first to succeed. For example, while a llist_del_first operation > + * is in progress in one consumer, then a llist_del_first, llist_add, > + * llist_add (or llist_del_all, llist_add, llist_add) sequence in another > + * consumer may cause violations. > + * > + * This can be summarized as follows: > * > * | add | del_first | del_all > * add | - | - | - > * del_first | | L | L > * del_all | | | - > * > - * Where "-" stands for no lock is needed, while "L" stands for lock > - * is needed. > + * Where, a particular row's operation can happen concurrently with a column's > + * operation, with "-" being no lock needed, while "L" being lock is needed. > * > * The list entries deleted via llist_del_all can be traversed with > * traversing function such as llist_for_each etc. But the list > -- > 2.8.0.rc3.226.g39d4020 >
[toc] | [prev] | [standalone]
Back to top | Article view | linux.kernel
csiph-web