Lines Matching full:structures
4 <head><title>A Tour Through TREE_RCU's Data Structures [LWN.net]</title>
12 This document describes RCU's major data structures and their relationship
39 data structures maintain the state in such a way as to allow RCU readers
48 containing a tree of <tt>rcu_node</tt> structures.
50 <tt>rcu_data</tt> structures associated with it, so that there
51 are <tt>NR_CPUS</tt> number of <tt>rcu_data</tt> structures,
65 Quiescent states are recorded by the per-CPU <tt>rcu_data</tt> structures,
67 structures.
90 <tt>rcu_node</tt> structures than further up the tree.
91 Therefore, if the leaf <tt>rcu_node</tt> structures have fanout of
92 64, the contention on these structures' <tt>->structures</tt>
100 that the fanout for the non-leaf <tt>rcu_node</tt> structures
105 contention problems on the non-leaf <tt>rcu_node</tt> structures,
113 <tt>rcu_node</tt> structures align with hardware boundaries.
143 For the internal <tt>rcu_node</tt> structures, the situation is even
158 running concurrently, so RCU builds separate data structures for each
183 CPU, and all of a given CPU's <tt>rcu_data</tt> structures share
196 RCU callbacks are represented by <tt>rcu_head</tt> structures,
197 which are queued on <tt>rcu_data</tt> structures while they are
203 <tt>PREEMPT_RCU</tt>'s major data structures are related.
204 Lesser data structures will be introduced with the algorithms that
207 </p><p>Note that each of the data structures in the above figure has
211 <li> Each <tt>rcu_state</tt> structures has a lock and a mutex,
222 <p>It is important to note that different data structures can have
225 grace period propagates slowly through the data structures.
229 trick is to consider each instance of these data structures to be
233 </p><p>The general role of each of these data structures is as
239 <tt>rcu_node</tt> and <tt>rcu_data</tt> structures,
278 Unlike the other three structures, the <tt>rcu_dynticks</tt>
288 RCU's data structures are related, you are done.
291 and <tt>rcu_dynticks</tt> data structures.
299 <tt>rcu_node</tt> and <tt>rcu_data</tt> structures,
310 <h5>Relationship to rcu_node and rcu_data Structures</h5>
326 You said that the <tt>rcu_node</tt> structures formed a tree,
398 in the <tt>rcu_node</tt> and <tt>rcu_data</tt> structures
401 most current value, and those of the other structures are compared
430 <p>The <tt>rcu_node</tt> structures form the combining
514 <p>The <tt>rcu_node</tt> structures' <tt>->gp_seq</tt> fields are
571 Note that the leaf <tt>rcu_node</tt> structures should be
572 thought of as having <tt>rcu_data</tt> structures as their
670 sections, their <tt>task_struct</tt> structures are enqueued
820 excessive contention for the leaf <tt>rcu_node</tt> structures'
843 <tt>rcu_node</tt> structures required for each level of the tree,
847 The number of <tt>rcu_node</tt> structures for the topmost level
1011 <h5>Connection to Other Data Structures</h5>
1065 in the <tt>rcu_state</tt> and <tt>rcu_node</tt> structures.
1187 Unlike the other structures, <tt>rcu_dynticks</tt> is not
1280 These structures are normally embedded within RCU-protected data
1281 structures whose algorithms use asynchronous grace periods.
1283 RCU users need not provide <tt>rcu_head</tt> structures.
1293 to link the <tt>rcu_head</tt> structures together in the
1294 lists within the <tt>rcu_data</tt> structures.
1405 structures in the <tt>rcu_state</tt> structure's
1410 the leaf <tt>rcu_node</tt> structures.
1413 <tt>rcu_node</tt> structures.
1437 <tt>rcu_data</tt> structures.