/include/linux/ |
H A D | rculist_bl.h | 14 LIST_BL_BUG_ON(((unsigned long)h->first & LIST_BL_LOCKMASK) != 16 rcu_assign_pointer(h->first, 23 ((unsigned long)rcu_dereference_check(h->first, hlist_bl_is_locked(h)) & ~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 D | rculist_nulls.h | 41 (*((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; 108 * The barrier() is needed to make sure compiler doesn't cache first element [1],
|
H A D | list_nulls.h | 18 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 D | llist.h | 10 * 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 132 * @node: the first entry of deleted list entries. 160 return ACCESS_ONCE(head->first) == NULL; 188 * return the pointer to the first entry. The order of entries 193 return xchg(&head->first, NULL);
|
H A D | list_bl.h | 12 * 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 D | user_namespace.h | 14 u32 first; member in struct:uid_gid_map::uid_gid_extent
|
H A D | rculist.h | 184 * @head: the place in the list to splice the first list into 202 struct list_head *first = list->next; local 210 * "first" and "last" tracking list, so initialize it. RCU readers 235 rcu_assign_pointer(list_next_rcu(head), first); local 236 first->prev = head; 278 * list_first_or_null_rcu - get the first element from a list 370 * return the first or the next element in an RCU protected hlist 372 #define hlist_first_rcu(head) (*((struct hlist_node __rcu **)(&(head)->first))) 398 struct hlist_node *first = h->first; local [all...] |
H A D | list.h | 217 struct list_head *first; local 220 first = head->next; 221 list_move_tail(first, head); 278 struct list_head *first = list->next; local 281 first->prev = prev; 282 prev->next = first; 291 * @head: the place to add it in the first list. 303 * @head: the place to add it in the first list. 315 * @head: the place to add it in the first list. 331 * @head: the place to add it in the first lis 640 struct hlist_node *first = h->first; local [all...] |
H A D | isdn_ppp.h | 163 struct ippp_buf_queue *first; /* pointer to (current) first packet */ member in struct:ippp_struct
|
H A D | types.h | 191 struct hlist_node *first; member in struct:hlist_head
|
H A D | ccp.h | 249 * @first: indicates first SHA operation 272 u32 first; /* Indicates first sha cmd */ member in struct:ccp_sha_engine 393 * @operand_1: first operand for the modular math operation 394 * @operand_1_len: length of the first operand 430 * @point_1: the first point of the ECC point math operation
|
H A D | ata.h | 631 u16 first = word_209 & 0x3fff; local 632 if (first > 0) 633 return (1 << log2_per_phys) - first;
|
H A D | skbuff.h | 169 /* These two members must be first. */ 507 /* These two members must be first. */ 523 * first. This is owned by whoever has the skb queued ATM. 1009 * skb_queue_is_first - check if skb is the first entry in the queue 1013 * Returns true if @skb is the first buffer on the list. 1359 struct sk_buff *first = list->next; local 1362 first->prev = prev; 1363 prev->next = first; 1372 * @head: the place to add it in the first list 1386 * @head: the place to add it in the first lis [all...] |
/include/media/ |
H A D | v4l2-event.h | 45 * v4l2_fh struct so VIDIOC_DQEVENT will know which event to dequeue first. 104 * @first: The index of the events containing the oldest available event. 117 unsigned first; member in struct:v4l2_subscribed_event
|
/include/sound/ |
H A D | gus.h | 205 struct snd_gf1_mem_block *first; member in struct:snd_gf1_mem
|
/include/linux/ceph/ |
H A D | ceph_fs.h | 722 __le64 first, last; /* snap range */ member in struct:ceph_mds_lease
|
/include/linux/mlx5/ |
H A D | driver.h | 186 struct mlx5_cmd_first first; member in struct:mlx5_cmd_msg
|
/include/uapi/linux/ |
H A D | kvm.h | 347 __u32 first, last; member in struct:kvm_coalesced_mmio_ring
|
/include/uapi/sound/ |
H A D | asound.h | 405 unsigned int first; /* offset to first sample in bits */ member in struct:snd_pcm_channel_info 841 unsigned int offset; /* W: first element ID to get */ 911 unsigned int tlv[0]; /* first TLV */
|