Lines Matching refs:readers

1054 users into two classes: the readers and the writers. If you are only
1060 does), and the lock is held by readers for significant lengths of time,
1068 Using RCU, the readers can avoid taking a lock altogether: as we expect
1073 writers may be changing the list underneath the readers. That is
1097 pointer to the old element with a pointer to its successor, and readers
1122 wait until we know that all the readers who were traversing the list
1125 destroy the object once all pre-existing readers are finished.
1129 But how does Read Copy Update know when the readers are finished? The
1130 method is this: firstly, the readers always traverse the list inside
1136 readers cannot sleep, we know that any readers which were traversing the
1178     +/* Final discard done once we know no readers are looking. */