Lines Matching refs:n
66 static inline void __hlist_del(struct hlist_node *n) in __hlist_del() argument
68 struct hlist_node *next = n->next; in __hlist_del()
69 struct hlist_node **pprev = n->pprev; in __hlist_del()
76 static inline void hlist_del(struct hlist_node *n) in hlist_del() argument
78 __hlist_del(n); in hlist_del()
79 n->next = (struct hlist_node*)LIST_POISON1; in hlist_del()
80 n->pprev = (struct hlist_node**)LIST_POISON2; in hlist_del()
83 static inline void hlist_del_init(struct hlist_node *n) in hlist_del_init() argument
85 if (!hlist_unhashed(n)) { in hlist_del_init()
86 __hlist_del(n); in hlist_del_init()
87 INIT_HLIST_NODE(n); in hlist_del_init()
91 static inline void hlist_add_head(struct hlist_node *n, struct hlist_head *h) in hlist_add_head() argument
94 n->next = first; in hlist_add_head()
96 first->pprev = &n->next; in hlist_add_head()
97 WRITE_ONCE(h->first, n); in hlist_add_head()
98 n->pprev = &h->first; in hlist_add_head()
101 static inline void hlist_add_before(struct hlist_node *n, struct hlist_node *next) in hlist_add_before() argument
103 n->pprev = next->pprev; in hlist_add_before()
104 n->next = next; in hlist_add_before()
105 next->pprev = &n->next; in hlist_add_before()
106 WRITE_ONCE(*(n->pprev), n); in hlist_add_before()
109 static inline void hlist_add_behind(struct hlist_node *n, struct hlist_node *prev) in hlist_add_behind() argument
111 n->next = prev->next; in hlist_add_behind()
112 WRITE_ONCE(prev->next, n); in hlist_add_behind()
113 n->pprev = &prev->next; in hlist_add_behind()
115 if (n->next) in hlist_add_behind()
116 n->next->pprev = &n->next; in hlist_add_behind()
119 static inline void hlist_add_fake(struct hlist_node *n) in hlist_add_fake() argument
121 n->pprev = &n->next; in hlist_add_fake()
130 hlist_is_singular_node(struct hlist_node *n, struct hlist_head *h) in hlist_is_singular_node() argument
132 return !n->next && n->pprev == &h->first; in hlist_is_singular_node()
149 #define hlist_for_each_safe(pos, n, head) \ argument
150 for (pos = (head)->first; pos && ({ n = pos->next; 1; }); \
151 pos = n)
172 #define hlist_for_each_entry_safe(pos, n, head, member) \ argument
174 pos && ({ n = pos->member.next; 1; }); \
175 pos = hlist_entry_safe(n, typeof(*pos), member))
186 #define ilog2(n) \ argument
188 (n) & (1ULL << 63) ? 63 : \
189 (n) & (1ULL << 62) ? 62 : \
190 (n) & (1ULL << 61) ? 61 : \
191 (n) & (1ULL << 60) ? 60 : \
192 (n) & (1ULL << 59) ? 59 : \
193 (n) & (1ULL << 58) ? 58 : \
194 (n) & (1ULL << 57) ? 57 : \
195 (n) & (1ULL << 56) ? 56 : \
196 (n) & (1ULL << 55) ? 55 : \
197 (n) & (1ULL << 54) ? 54 : \
198 (n) & (1ULL << 53) ? 53 : \
199 (n) & (1ULL << 52) ? 52 : \
200 (n) & (1ULL << 51) ? 51 : \
201 (n) & (1ULL << 50) ? 50 : \
202 (n) & (1ULL << 49) ? 49 : \
203 (n) & (1ULL << 48) ? 48 : \
204 (n) & (1ULL << 47) ? 47 : \
205 (n) & (1ULL << 46) ? 46 : \
206 (n) & (1ULL << 45) ? 45 : \
207 (n) & (1ULL << 44) ? 44 : \
208 (n) & (1ULL << 43) ? 43 : \
209 (n) & (1ULL << 42) ? 42 : \
210 (n) & (1ULL << 41) ? 41 : \
211 (n) & (1ULL << 40) ? 40 : \
212 (n) & (1ULL << 39) ? 39 : \
213 (n) & (1ULL << 38) ? 38 : \
214 (n) & (1ULL << 37) ? 37 : \
215 (n) & (1ULL << 36) ? 36 : \
216 (n) & (1ULL << 35) ? 35 : \
217 (n) & (1ULL << 34) ? 34 : \
218 (n) & (1ULL << 33) ? 33 : \
219 (n) & (1ULL << 32) ? 32 : \
220 (n) & (1ULL << 31) ? 31 : \
221 (n) & (1ULL << 30) ? 30 : \
222 (n) & (1ULL << 29) ? 29 : \
223 (n) & (1ULL << 28) ? 28 : \
224 (n) & (1ULL << 27) ? 27 : \
225 (n) & (1ULL << 26) ? 26 : \
226 (n) & (1ULL << 25) ? 25 : \
227 (n) & (1ULL << 24) ? 24 : \
228 (n) & (1ULL << 23) ? 23 : \
229 (n) & (1ULL << 22) ? 22 : \
230 (n) & (1ULL << 21) ? 21 : \
231 (n) & (1ULL << 20) ? 20 : \
232 (n) & (1ULL << 19) ? 19 : \
233 (n) & (1ULL << 18) ? 18 : \
234 (n) & (1ULL << 17) ? 17 : \
235 (n) & (1ULL << 16) ? 16 : \
236 (n) & (1ULL << 15) ? 15 : \
237 (n) & (1ULL << 14) ? 14 : \
238 (n) & (1ULL << 13) ? 13 : \
239 (n) & (1ULL << 12) ? 12 : \
240 (n) & (1ULL << 11) ? 11 : \
241 (n) & (1ULL << 10) ? 10 : \
242 (n) & (1ULL << 9) ? 9 : \
243 (n) & (1ULL << 8) ? 8 : \
244 (n) & (1ULL << 7) ? 7 : \
245 (n) & (1ULL << 6) ? 6 : \
246 (n) & (1ULL << 5) ? 5 : \
247 (n) & (1ULL << 4) ? 4 : \
248 (n) & (1ULL << 3) ? 3 : \
249 (n) & (1ULL << 2) ? 2 : \
250 (n) & (1ULL << 1) ? 1 : 0 \