Lines Matching refs:head
116 * queue head.
120 /* The wait queue head that linked the "wait" wait queue item */
276 static inline void free_ephead(struct epitems_head *head)
278 if (head)
279 kmem_cache_free(ephead_cache, head);
284 struct epitems_head *head;
286 head = container_of(file->f_ep, struct epitems_head, epitems);
287 if (!head->next) {
288 head->next = tfile_check_list;
289 tfile_check_list = head;
293 static void unlist_file(struct epitems_head *head)
295 struct epitems_head *to_free = head;
296 struct hlist_node *p = rcu_dereference(hlist_first_rcu(&head->epitems));
300 if (!hlist_empty(&head->epitems))
302 head->next = NULL;
682 static void epi_rcu_free(struct rcu_head *head)
684 struct epitem *epi = container_of(head, struct epitem, rcu);
725 struct hlist_head *head;
742 head = file->f_ep;
743 if (head->first == &epi->fllink && !epi->fllink.next) {
747 v = container_of(head, struct epitems_head, epitems);
1084 * direction i.e. either to the tail or to the head, otherwise
1091 struct list_head *head)
1096 * This is simple 'new->next = head' operation, but cmpxchg()
1101 if (!try_cmpxchg(&new->next, &new, head))
1105 * Initially ->next of a new element must be updated with the head
1112 prev = xchg(&head->prev, new);
1444 struct hlist_head *head = NULL;
1451 head = &ep->refs;
1457 head = &to_free->epitems;
1461 if (unlikely(!head)) {
1465 file->f_ep = head;
2020 struct epitems_head *head = tfile_check_list;
2021 tfile_check_list = head->next;
2022 unlist_file(head);