Lines Matching full:readers

90 SMR allows readers and writers to access the data structure concurrently.
91 Readers can always enter a read section immediately
108 readers and writers.
115 structure are not freed and recycled while readers are accessing them in
119 the structure, preventing any new readers from observing the item.
120 Then, the writer waits until some mechanism guarantees that no existing readers
123 SMR provides this mechanism: readers may access a lock-free data structure in
138 Readers load global state and modify per-CPU state, while writers must scan all
139 per-CPU states to detect active readers.
142 .Ss Readers
147 Specifically, context switching is disabled, and thus readers may not acquire
181 waits for all active readers which may be accessing the freed item to finish
185 point when no readers can be accessing a given item.
211 polling all CPUs to see whether active readers have observed a given sequence
224 to deduce that no active readers have access to the unlinked item, and thus the
231 is a non-blocking operation and returns true only if all active readers are