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
252 The box represents the ``rcu_node`` structure's ``->lock`` critical
288 RCU-protected data structure). It simply enqueues the ``rcu_head``
289 structure on a per-CPU list, which cannot become associated with a grace
310 ``rcu_node`` structure's ``->lock``. In all cases, there is full
312 structure's ``->lock``, and also full ordering against any of the
314 structure's ``->lock``.
346 advance the ``rcu_state`` structure's ``->gp_seq`` grace-period-number
353 root ``rcu_node`` structure is touched.
358 this ``rcu_node`` structure has not transitioned to or from zero, this
360 number of online CPUs for a given leaf ``rcu_node`` structure has
363 leaf ``rcu_node`` structure has transitioned to zero,
366 ``rcu_node`` structure onlines its first CPU and if the next
367 ``rcu_node`` structure has no online CPUs (or, alternatively if the
368 leftmost ``rcu_node`` structure offlines its last CPU and if the next
369 ``rcu_node`` structure has no online CPUs).
374 breadth-first, setting each ``rcu_node`` structure's ``->gp_seq`` field
375 to the newly advanced value from the ``rcu_state`` structure, as shown
384 ``rcu_state`` structure's ``->gp_seq`` field) before setting each leaf
385 ``rcu_node`` structure's ``->gp_seq`` field, each CPU's observation of
406 | structure.                                                            |
422 ``rcu_node`` tree only until they encountered an ``rcu_node`` structure
425 that ``rcu_node`` structure's ``->lock``.
468 diagram, clearing bits from each ``rcu_node`` structure's ``->qsmask``
471 Note that traversal passes upwards out of a given ``rcu_node`` structure
473 subtree headed by that ``rcu_node`` structure. A key point is that if a
474 CPU's traversal stops at a given ``rcu_node`` structure, then there will
480 CPU traverses through the root ``rcu_node`` structure, the “last CPU”
482 structure's ``->qsmask`` field.
496 while holding the corresponding CPU's leaf ``rcu_node`` structure's
520 ``rcu_node`` structure's ``->lock`` and update this structure's
546 reaches an ``rcu_node`` structure that has quiescent states outstanding
553 | ``rcu_node`` structure, which means that there are still CPUs         |
554 | subordinate to that structure on which the current grace period is    |
572 ``rcu_state`` structure's ``->gp_seq`` field. The ordering effects are
591 | once the ``rcu_state`` structure's ``->gp_seq`` field has been        |
600 Once a given CPU's leaf ``rcu_node`` structure's ``->gp_seq`` field has
618 its leaf ``rcu_node`` structure's ``->lock`` before invoking callbacks,
630 structure, and awaken a task that is to run on a CPU corresponding to
631 the rightmost leaf ``rcu_node`` structure, and the grace-period kernel