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
137 | by the CPU's leaf ``rcu_node`` structure's ``->lock`` as described    |
165 the ``rcu_node`` structure's ``->lock`` field, so much so that it is
223 The box represents the ``rcu_node`` structure's ``->lock`` critical
259 RCU-protected data structure). It simply enqueues the ``rcu_head``
260 structure on a per-CPU list, which cannot become associated with a grace
281 ``rcu_node`` structure's ``->lock``. In all cases, there is full
283 structure's ``->lock``, and also full ordering against any of the
285 structure's ``->lock``.
317 advance the ``rcu_state`` structure's ``->gp_seq`` grace-period-number
324 root ``rcu_node`` structure is touched.
329 this ``rcu_node`` structure has not transitioned to or from zero, this
331 number of online CPUs for a given leaf ``rcu_node`` structure has
334 leaf ``rcu_node`` structure has transitioned to zero,
337 ``rcu_node`` structure onlines its first CPU and if the next
338 ``rcu_node`` structure has no online CPUs (or, alternatively if the
339 leftmost ``rcu_node`` structure offlines its last CPU and if the next
340 ``rcu_node`` structure has no online CPUs).
345 breadth-first, setting each ``rcu_node`` structure's ``->gp_seq`` field
346 to the newly advanced value from the ``rcu_state`` structure, as shown
355 ``rcu_state`` structure's ``->gp_seq`` field) before setting each leaf
356 ``rcu_node`` structure's ``->gp_seq`` field, each CPU's observation of
377 | structure.                                                            |
393 ``rcu_node`` tree only until they encountered an ``rcu_node`` structure
396 that ``rcu_node`` structure's ``->lock``.
439 diagram, clearing bits from each ``rcu_node`` structure's ``->qsmask``
442 Note that traversal passes upwards out of a given ``rcu_node`` structure
444 subtree headed by that ``rcu_node`` structure. A key point is that if a
445 CPU's traversal stops at a given ``rcu_node`` structure, then there will
451 CPU traverses through the root ``rcu_node`` structure, the “last CPU”
453 structure's ``->qsmask`` field.
467 while holding the corresponding CPU's leaf ``rcu_node`` structure's
491 ``rcu_node`` structure's ``->lock`` and update this structure's
517 reaches an ``rcu_node`` structure that has quiescent states outstanding
524 | ``rcu_node`` structure, which means that there are still CPUs         |
525 | subordinate to that structure on which the current grace period is    |
543 ``rcu_state`` structure's ``->gp_seq`` field. The ordering effects are
562 | once the ``rcu_state`` structure's ``->gp_seq`` field has been        |
571 Once a given CPU's leaf ``rcu_node`` structure's ``->gp_seq`` field has
589 its leaf ``rcu_node`` structure's ``->lock`` before invoking callbacks,
601 structure, and awaken a task that is to run on a CPU corresponding to
602 the rightmost leaf ``rcu_node`` structure, and the grace-period kernel