Lines Matching refs:list
5 ("struct list_head" in list.h). One big advantage of this approach
7 the list macros. This document describes several applications of RCU,
36 list_for_each_entry(e, &audit_tsklist, list) {
46 Here the list is searched under the lock, but the lock is dropped before
48 on, the list may well have been modified. This makes sense, since if
60 list_for_each_entry_rcu(e, &audit_tsklist, list) {
72 become list_for_each_entry_rcu(). The _rcu() list-traversal primitives
79 struct list_head *list)
84 list_for_each_entry(e, list, list) {
86 list_del(&e->list);
96 struct list_head *list)
101 list_add(&entry->list, list);
103 list_add_tail(&entry->list, list);
112 struct list_head *list)
118 list_for_each_entry(e, list, list) {
120 list_del_rcu(&e->list);
129 struct list_head *list)
133 list_add_rcu(&entry->list, list);
135 list_add_tail_rcu(&entry->list, list);
149 The _rcu() list-manipulation primitives add memory barriers that are
166 struct list_head *list,
175 list_for_each_entry(e, list, list) {
193 struct list_head *list,
200 list_for_each_entry(e, list, list) {
208 list_replace_rcu(&e->list, &ne->list);
248 list_for_each_entry_rcu(e, &audit_tsklist, list) {
274 struct list_head *list)
280 list_for_each_entry(e, list, list) {
283 list_del_rcu(&e->list);
296 Read-mostly list-based data structures that can tolerate stale data are