Lines Matching +full:b +full:- +full:side

16 --------------------------
18 Suppose that an RCU-based algorithm scans a linked list containing
19 elements A, B, and C in process context, and can delete elements from
20 this same list in softirq context.  Suppose that the process-context scan
21 is referencing element B when it is interrupted by softirq processing,
22 which deletes element B, and then invokes call_rcu() to free element B
27 element B.  This situation can greatly decrease the life expectancy of
33 Example 2: Function-Call Fatality
34 ---------------------------------
40 Suppose that an RCU-based algorithm again scans a linked list containing
41 elements A, B, and C in process context, but that it invokes a function
43 deletes element B from the list, then passes it to call_rcu() for deferred
49 all RCU read-side critical sections currently executing have completed.
57 ----------------------------
62 be self-deadlock *even if* this invocation occurred from a later
95 the deadlock-avoidance benefits called out above.
98 -------
117 	Because the calling function is scanning an RCU-protected linked
118 	list, and is therefore within an RCU read-side critical section.
120 	read-side critical section, and is not permitted to block.
128 	a process-context acquisition of this lock must use something
133 	If the process-context code were to simply use spin_lock(),
136 	the process-context critical section.  This would result in
137 	self-deadlock.
149 	of an RCU read-side critical section.  If synchronize_rcu()