Lines Matching refs:structure
37 a linked RCU-protected data structure, and phase two frees that element.
50 critical section for the ``rcu_node`` structure's
62 Therefore, for any given ``rcu_node`` structure, any access
118 | But the chain of rcu_node-structure lock acquisitions guarantees |
166 | by the CPU's leaf ``rcu_node`` structure's ``->lock`` as described |
194 the ``rcu_node`` structure's ``->lock`` field, so much so that it is
247 The box represents the ``rcu_node`` structure's ``->lock`` critical
283 RCU-protected data structure). It simply enqueues the ``rcu_head``
284 structure on a per-CPU list, which cannot become associated with a grace
305 ``rcu_node`` structure's ``->lock``. In all cases, there is full
307 structure's ``->lock``, and also full ordering against any of the
309 structure's ``->lock``.
341 advance the ``rcu_state`` structure's ``->gp_seq`` grace-period-number
348 root ``rcu_node`` structure is touched.
353 this ``rcu_node`` structure has not transitioned to or from zero, this
355 number of online CPUs for a given leaf ``rcu_node`` structure has
358 leaf ``rcu_node`` structure has transitioned to zero,
361 ``rcu_node`` structure onlines its first CPU and if the next
362 ``rcu_node`` structure has no online CPUs (or, alternatively if the
363 leftmost ``rcu_node`` structure offlines its last CPU and if the next
364 ``rcu_node`` structure has no online CPUs).
369 breadth-first, setting each ``rcu_node`` structure's ``->gp_seq`` field
370 to the newly advanced value from the ``rcu_state`` structure, as shown
379 ``rcu_state`` structure's ``->gp_seq`` field) before setting each leaf
380 ``rcu_node`` structure's ``->gp_seq`` field, each CPU's observation of
401 | structure. |
417 ``rcu_node`` tree only until they encountered an ``rcu_node`` structure
420 that ``rcu_node`` structure's ``->lock``.
463 diagram, clearing bits from each ``rcu_node`` structure's ``->qsmask``
466 Note that traversal passes upwards out of a given ``rcu_node`` structure
468 subtree headed by that ``rcu_node`` structure. A key point is that if a
469 CPU's traversal stops at a given ``rcu_node`` structure, then there will
475 CPU traverses through the root ``rcu_node`` structure, the “last CPU”
477 structure's ``->qsmask`` field.
491 while holding the corresponding CPU's leaf ``rcu_node`` structure's
515 ``rcu_node`` structure's ``->lock`` and update this structure's
541 reaches an ``rcu_node`` structure that has quiescent states outstanding
548 | ``rcu_node`` structure, which means that there are still CPUs |
549 | subordinate to that structure on which the current grace period is |
567 ``rcu_state`` structure's ``->gp_seq`` field. The ordering effects are
586 | once the ``rcu_state`` structure's ``->gp_seq`` field has been |
595 Once a given CPU's leaf ``rcu_node`` structure's ``->gp_seq`` field has
613 its leaf ``rcu_node`` structure's ``->lock`` before invoking callbacks,
625 structure, and awaken a task that is to run on a CPU corresponding to
626 the rightmost leaf ``rcu_node`` structure, and the grace-period kernel