Lines Matching refs:ordering

13 grace-period memory ordering guarantee is provided.
18 RCU grace periods provide extremely strong memory-ordering guarantees
49 The workhorse for RCU's grace-period memory ordering is the
72 Tree RCU uses these two ordering guarantees to form an ordering
77 The following litmus test exhibits the ordering effects of these
116 RCU's grace-period memory ordering guarantee to extend to any
144 might not yet be subject to the grace period's memory ordering.
164 Tree RCU's grace--period memory-ordering guarantees rely most heavily on
168 shown below, which is one of several functions that enforce ordering of
230 Tree RCU's grace-period memory-ordering guarantee is provided by a
257 provides no ordering guarantees, either for itself or for phase one of
282 ordering against any prior critical section for that same ``rcu_node``
283 structure's ``->lock``, and also full ordering against any of the
287 The next section will show how this ordering ensures that any accesses
309 ordering through the grace-period computation will require duplicating
316 The first ordering-related grace-period initialization action is to
336 The diagram below shows the path of ordering if the leftmost
394 that is waiting for additional quiescent states. However, ordering is
461 value-returning atomic operations on a per-CPU variable. The ordering
484 corresponding CPU hotplug operations. The ordering effects are shown
505 states”, it is repeated every few jiffies, and its ordering effects are
543 ``rcu_state`` structure's ``->gp_seq`` field. The ordering effects are
590 which preserves the required ordering against the newly completed grace
595 maintain ordering. For example, if the callback function wakes up a task
596 that runs on some other CPU, proper ordering must in place in both the
604 grace period's memory ordering might not yet have reached that CPU, so
606 ordering.