/include/linux/ |
H A D | if_tunnel.h | 13 #define for_each_ip_tunnel_rcu(pos, start) \ 14 for (pos = rcu_dereference(start); pos; pos = rcu_dereference(pos->next))
|
H A D | rculist.h | 297 * @pos: the type * to use as a loop cursor. 305 #define list_for_each_entry_rcu(pos, head, member) \ 306 for (pos = list_entry_rcu((head)->next, typeof(*pos), member); \ 307 &pos->member != (head); \ 308 pos = list_entry_rcu(pos->member.next, typeof(*pos), member)) 312 * @pos: the type * to use as a loop cursor. 319 #define list_for_each_entry_continue_rcu(pos, hea [all...] |
H A D | llist.h | 92 * @pos: the &struct llist_node to use as a loop cursor 104 #define llist_for_each(pos, node) \ 105 for ((pos) = (node); pos; (pos) = (pos)->next) 109 * @pos: the type * to use as a loop cursor. 122 #define llist_for_each_entry(pos, node, member) \ 123 for ((pos) = llist_entry((node), typeof(*(pos)), membe [all...] |
H A D | rhashtable.h | 129 #define rht_next_entry_safe(pos, ht, member) \ 131 pos ? rht_entry_safe(rht_dereference((pos)->member.next, ht), \ 132 typeof(*(pos)), member) : NULL; \ 137 * @pos: &struct rhash_head to use as a loop cursor. 141 #define rht_for_each(pos, head, ht) \ 142 for (pos = rht_dereference(head, ht); \ 143 pos; \ 144 pos = rht_dereference((pos) [all...] |
H A D | list.h | 389 * @pos: the type * to cursor 392 #define list_next_entry(pos, member) \ 393 list_entry((pos)->member.next, typeof(*(pos)), member) 397 * @pos: the type * to cursor 400 #define list_prev_entry(pos, member) \ 401 list_entry((pos)->member.prev, typeof(*(pos)), member) 405 * @pos: the &struct list_head to use as a loop cursor. 408 #define list_for_each(pos, hea [all...] |
H A D | regset.h | 46 * @pos: offset into the regset data to access, in bytes 52 * are usual failure returns. The @pos and @count values are in 60 unsigned int pos, unsigned int count, 67 * @pos: offset into the regset data to access, in bytes 73 * are usual failure returns. The @pos and @count values are in 81 unsigned int pos, unsigned int count, 134 * The @pos argument must be aligned according to @align; the @count 220 static inline int user_regset_copyout(unsigned int *pos, unsigned int *count, argument 227 BUG_ON(*pos < start_pos); 228 if (end_pos < 0 || *pos < end_po [all...] |
H A D | plist.h | 148 * @pos: the type * to use as a loop counter 151 #define plist_for_each(pos, head) \ 152 list_for_each_entry(pos, &(head)->node_list, node_list) 156 * @pos: the type * to use as a loop cursor 161 #define plist_for_each_continue(pos, head) \ 162 list_for_each_entry_continue(pos, &(head)->node_list, node_list) 166 * @pos: the type * to use as a loop counter 172 #define plist_for_each_safe(pos, n, head) \ 173 list_for_each_entry_safe(pos, n, &(head)->node_list, node_list) 177 * @pos [all...] |
H A D | list_nulls.h | 89 * @pos: the &struct hlist_node to use as a loop cursor. 94 #define hlist_nulls_for_each_entry(tpos, pos, head, member) \ 95 for (pos = (head)->first; \ 96 (!is_a_nulls(pos)) && \ 97 ({ tpos = hlist_nulls_entry(pos, typeof(*tpos), member); 1;}); \ 98 pos = pos->next) 103 * @pos: the &struct hlist_node to use as a loop cursor. 107 #define hlist_nulls_for_each_entry_from(tpos, pos, member) \ 108 for (; (!is_a_nulls(pos)) [all...] |
H A D | list_bl.h | 136 * @pos: the &struct hlist_node to use as a loop cursor. 141 #define hlist_bl_for_each_entry(tpos, pos, head, member) \ 142 for (pos = hlist_bl_first(head); \ 143 pos && \ 144 ({ tpos = hlist_bl_entry(pos, typeof(*tpos), member); 1;}); \ 145 pos = pos->next) 150 * @pos: the &struct hlist_node to use as a loop cursor. 155 #define hlist_bl_for_each_entry_safe(tpos, pos, n, head, member) \ 156 for (pos [all...] |
H A D | rculist_bl.h | 117 * @pos: the &struct hlist_bl_node to use as a loop cursor. 122 #define hlist_bl_for_each_entry_rcu(tpos, pos, head, member) \ 123 for (pos = hlist_bl_first_rcu(head); \ 124 pos && \ 125 ({ tpos = hlist_bl_entry(pos, typeof(*tpos), member); 1; }); \ 126 pos = rcu_dereference_raw(pos->next))
|
H A D | rculist_nulls.h | 104 * @pos: the &struct hlist_nulls_node to use as a loop cursor. 113 #define hlist_nulls_for_each_entry_rcu(tpos, pos, head, member) \ 115 pos = rcu_dereference_raw(hlist_nulls_first_rcu(head)); \ 116 (!is_a_nulls(pos)) && \ 117 ({ tpos = hlist_nulls_entry(pos, typeof(*tpos), member); 1; }); \ 118 pos = rcu_dereference_raw(hlist_nulls_next_rcu(pos)))
|
H A D | rbtree.h | 97 * @pos: the 'type *' to use as a loop cursor. 102 #define rbtree_postorder_for_each_entry_safe(pos, n, root, field) \ 103 for (pos = rb_entry_safe(rb_first_postorder(root), typeof(*pos), field); \ 104 pos && ({ n = rb_entry_safe(rb_next_postorder(&pos->field), \ 105 typeof(*pos), field); 1; }); \ 106 pos = n)
|
H A D | cgroup.h | 770 struct cgroup_subsys_state *css_next_child(struct cgroup_subsys_state *pos, 777 * @pos: the css * to use as the loop cursor 790 * caller is responsible for ensuring that @pos remains accessible until 793 #define css_for_each_child(pos, parent) \ 794 for ((pos) = css_next_child(NULL, (parent)); (pos); \ 795 (pos) = css_next_child((pos), (parent))) 798 css_next_descendant_pre(struct cgroup_subsys_state *pos, 802 css_rightmost_descendant(struct cgroup_subsys_state *pos); [all...] |
H A D | seq_file.h | 37 void * (*start) (struct seq_file *m, loff_t *pos); 39 void * (*next) (struct seq_file *m, void *v, loff_t *pos); 167 loff_t pos); 169 loff_t pos); 178 loff_t pos); 180 loff_t pos); 185 loff_t pos); 187 loff_t pos); 193 extern struct hlist_node *seq_hlist_start_percpu(struct hlist_head __percpu *head, int *cpu, loff_t pos); 195 extern struct hlist_node *seq_hlist_next_percpu(void *v, struct hlist_head __percpu *head, int *cpu, loff_t *pos); [all...] |
H A D | cpufreq.h | 528 static inline bool cpufreq_next_valid(struct cpufreq_frequency_table **pos) argument 530 while ((*pos)->frequency != CPUFREQ_TABLE_END) 531 if ((*pos)->frequency != CPUFREQ_ENTRY_INVALID) 534 (*pos)++; 540 * @pos: the cpufreq_frequency_table * to use as a loop cursor. 544 #define cpufreq_for_each_entry(pos, table) \ 545 for (pos = table; pos->frequency != CPUFREQ_TABLE_END; pos++) 550 * @pos [all...] |
H A D | klist.h | 47 extern void klist_add_behind(struct klist_node *n, struct klist_node *pos); 48 extern void klist_add_before(struct klist_node *n, struct klist_node *pos);
|
/include/linux/decompress/ |
H A D | bunzip2.h | 8 long *pos,
|
H A D | inflate.h | 8 long *pos,
|
H A D | unlz4.h | 8 long *pos,
|
H A D | unlzo.h | 8 long *pos,
|
/include/uapi/linux/netfilter/ |
H A D | x_tables.h | 172 /* pos is normally a struct ipt_entry/ip6t_entry/etc. */ 173 #define xt_entry_foreach(pos, ehead, esize) \ 174 for ((pos) = (typeof(pos))(ehead); \ 175 (pos) < (typeof(pos))((char *)(ehead) + (esize)); \ 176 (pos) = (typeof(pos))((char *)(pos) + (pos) [all...] |
/include/acpi/ |
H A D | apei.h | 38 int erst_get_record_id_begin(int *pos); 39 int erst_get_record_id_next(int *pos, u64 *record_id);
|
/include/net/sctp/ |
H A D | sctp.h | 342 #define sctp_skb_for_each(pos, head, tmp) \ 343 skb_queue_walk_safe(head, pos, tmp) 439 #define sctp_walk_params(pos, chunk, member)\ 440 _sctp_walk_params((pos), (chunk), ntohs((chunk)->chunk_hdr.length), member) 442 #define _sctp_walk_params(pos, chunk, end, member)\ 443 for (pos.v = chunk->member;\ 444 pos.v <= (void *)chunk + end - ntohs(pos.p->length) &&\ 445 ntohs(pos.p->length) >= sizeof(sctp_paramhdr_t);\ 446 pos [all...] |
/include/media/ |
H A D | omap4iss.h | 15 * @pos: position of the lane 19 u8 pos; member in struct:iss_csiphy_lane
|
/include/net/ |
H A D | raw.h | 52 void *raw_seq_start(struct seq_file *seq, loff_t *pos); 53 void *raw_seq_next(struct seq_file *seq, void *v, loff_t *pos);
|