Searched defs:first (Results 1 - 17 of 17) sorted by relevance

/include/linux/
H A Drculist_bl.h14 LIST_BL_BUG_ON(((unsigned long)h->first & LIST_BL_LOCKMASK) !=
16 rcu_assign_pointer(h->first,
23 ((unsigned long)rcu_dereference(h->first) & ~LIST_BL_LOCKMASK);
101 struct hlist_bl_node *first; local
104 first = hlist_bl_first(h);
106 n->next = first;
107 if (first)
108 first->pprev = &n->next;
109 n->pprev = &h->first;
H A Drculist_nulls.h41 (*((struct hlist_nulls_node __rcu __force **)&(head)->first))
93 struct hlist_nulls_node *first = h->first; local
95 n->next = first;
96 n->pprev = &h->first;
98 if (!is_a_nulls(first))
99 first->pprev = &n->next;
H A Dlist_nulls.h18 struct hlist_nulls_node *first; member in struct:hlist_nulls_head
25 ((ptr)->first = (struct hlist_nulls_node *) (1UL | (((long)nulls) << 1)))
56 return is_a_nulls(h->first);
62 struct hlist_nulls_node *first = h->first; local
64 n->next = first;
65 n->pprev = &h->first;
66 h->first = n;
67 if (!is_a_nulls(first))
68 first
[all...]
H A Dlist_bl.h12 * For modification operations, the 0 bit of hlist_bl_head->first
34 struct hlist_bl_node *first; member in struct:hlist_bl_head
41 ((ptr)->first = NULL)
59 ((unsigned long)h->first & ~LIST_BL_LOCKMASK);
66 LIST_BL_BUG_ON(((unsigned long)h->first & LIST_BL_LOCKMASK) !=
68 h->first = (struct hlist_bl_node *)((unsigned long)n | LIST_BL_LOCKMASK);
73 return !((unsigned long)h->first & ~LIST_BL_LOCKMASK);
79 struct hlist_bl_node *first = hlist_bl_first(h); local
81 n->next = first;
82 if (first)
[all...]
H A Dllist.h10 * depends on list->first->next does not changed if list->first is not
62 struct llist_node *first; member in struct:llist_head
78 list->first = NULL;
93 * @node: the first entry of deleted list entries
137 return ACCESS_ONCE(head->first) == NULL;
156 entry = head->first;
160 entry = cmpxchg(&head->first, old_entry, new);
173 * return the pointer to the first entry. The order of entries
178 return xchg(&head->first, NUL
[all...]
H A Drculist.h164 * @head: the place in the list to splice the first list into
182 struct list_head *first = list->next; local
189 /* "first" and "last" tracking list, so initialize it. */
211 rcu_assign_pointer(list_next_rcu(head), first); local
212 first->prev = head;
231 * list_first_entry_rcu - get the first element from a list
336 * return the first or the next element in an RCU protected hlist
338 #define hlist_first_rcu(head) (*((struct hlist_node __rcu **)(&(head)->first)))
364 struct hlist_node *first = h->first; local
[all...]
H A Dlist.h216 struct list_head *first; local
219 first = head->next;
220 list_move_tail(first, head);
277 struct list_head *first = list->next; local
280 first->prev = prev;
281 prev->next = first;
290 * @head: the place to add it in the first list.
302 * @head: the place to add it in the first list.
314 * @head: the place to add it in the first list.
330 * @head: the place to add it in the first lis
612 struct hlist_node *first = h->first; local
[all...]
H A Dtypes.h234 struct hlist_node *first; member in struct:hlist_head
H A Disdn_ppp.h215 struct ippp_buf_queue *first; /* pointer to (current) first packet */ member in struct:ippp_struct
H A Dskbuff.h129 /* These two members must be first. */
389 /* These two members must be first. */
402 * first. This is owned by whoever has the skb queued ATM.
683 * skb_queue_is_first - check if skb is the first entry in the queue
687 * Returns true if @skb is the first buffer on the list.
995 struct sk_buff *first = list->next; local
998 first->prev = prev;
999 prev->next = first;
1008 * @head: the place to add it in the first list
1022 * @head: the place to add it in the first lis
[all...]
H A Data.h684 u16 first = word_209 & 0x3fff; local
685 if (first > 0)
686 return (1 << log2_per_phys) - first;
H A Dkvm.h314 __u32 first, last; member in struct:kvm_coalesced_mmio_ring
/include/media/
H A Dv4l2-event.h45 * v4l2_fh struct so VIDIOC_DQEVENT will know which event to dequeue first.
91 * @first: The index of the events containing the oldest available event.
107 unsigned first; member in struct:v4l2_subscribed_event
/include/linux/netfilter/ipset/
H A Dip_set_ahash.h62 u8 pos; /* position of the first free entry */
125 /* Round up to the first 2^n value */
157 /* Add in increasing prefix order, so larger cidr first */
641 u32 first = cb->args[2]; local
660 if (cb->args[2] == first) {
680 if (unlikely(first == cb->args[2])) {
1075 u32 first = cb->args[2]; local
1094 if (cb->args[2] == first) {
1114 if (unlikely(first == cb->args[2])) {
/include/sound/
H A Dgus.h205 struct snd_gf1_mem_block *first; member in struct:snd_gf1_mem
H A Dasound.h396 unsigned int first; /* offset to first sample in bits */ member in struct:snd_pcm_channel_info
777 unsigned int offset; /* W: first element ID to get */
847 unsigned int tlv[0]; /* first TLV */
/include/linux/ceph/
H A Dceph_fs.h682 __le64 first, last; /* snap range */ member in struct:ceph_mds_lease

Completed in 3093 milliseconds