| /include/linux/ |
| D | list.h | 272 struct list_head *pos = entry2->prev; in list_swap() local
276 if (pos == entry1) in list_swap()
277 pos = entry2; in list_swap()
278 list_add(entry1, pos); in list_swap()
644 #define list_next_entry(pos, member) \ argument
645 list_entry((pos)->member.next, typeof(*(pos)), member)
656 #define list_next_entry_circular(pos, head, member) \ argument
657 (list_is_last(&(pos)->member, head) ? \
658 list_first_entry(head, typeof(*(pos)), member) : list_next_entry(pos, member))
665 #define list_prev_entry(pos, member) \ argument
[all …]
|
| D | rculist.h | 392 #define list_for_each_entry_rcu(pos, head, member, cond...) \ argument
394 pos = list_entry_rcu((head)->next, typeof(*pos), member); \
395 &pos->member != (head); \
396 pos = list_entry_rcu(pos->member.next, typeof(*pos), member))
411 #define list_for_each_entry_srcu(pos, head, member, cond) \ argument
413 pos = list_entry_rcu((head)->next, typeof(*pos), member); \
414 &pos->member != (head); \
415 pos = list_entry_rcu(pos->member.next, typeof(*pos), member))
446 #define list_for_each_entry_lockless(pos, head, member) \ argument
447 for (pos = list_entry_lockless((head)->next, typeof(*pos), member); \
[all …]
|
| D | llist.h | 143 #define llist_for_each(pos, node) \ argument
144 for ((pos) = (node); pos; (pos) = (pos)->next)
162 #define llist_for_each_safe(pos, n, node) \ argument
163 for ((pos) = (node); (pos) && ((n) = (pos)->next, true); (pos) = (n))
180 #define llist_for_each_entry(pos, node, member) \ argument
181 for ((pos) = llist_entry((node), typeof(*(pos)), member); \
182 member_address_is_nonnull(pos, member); \
183 (pos) = llist_entry((pos)->member.next, typeof(*(pos)), member))
202 #define llist_for_each_entry_safe(pos, n, node, member) \ argument
203 for (pos = llist_entry((node), typeof(*pos), member); \
[all …]
|
| D | if_tunnel.h | 14 #define for_each_ip_tunnel_rcu(pos, start) \ argument
15 for (pos = rcu_dereference(start); pos; pos = rcu_dereference(pos->next))
|
| D | plist.h | 142 #define plist_for_each(pos, head) \ argument
143 list_for_each_entry(pos, &(head)->node_list, node_list)
152 #define plist_for_each_continue(pos, head) \ argument
153 list_for_each_entry_continue(pos, &(head)->node_list, node_list)
163 #define plist_for_each_safe(pos, n, head) \ argument
164 list_for_each_entry_safe(pos, n, &(head)->node_list, node_list)
172 #define plist_for_each_entry(pos, head, mem) \ argument
173 list_for_each_entry(pos, &(head)->node_list, mem.node_list)
184 #define plist_for_each_entry_continue(pos, head, m) \ argument
185 list_for_each_entry_continue(pos, &(head)->node_list, m.node_list)
[all …]
|
| D | rculist_nulls.h | 167 #define hlist_nulls_for_each_entry_rcu(tpos, pos, head, member) \ argument
169 pos = rcu_dereference_raw(hlist_nulls_first_rcu(head)); \
170 (!is_a_nulls(pos)) && \
171 ({ tpos = hlist_nulls_entry(pos, typeof(*tpos), member); 1; }); \
172 pos = rcu_dereference_raw(hlist_nulls_next_rcu(pos)))
182 #define hlist_nulls_for_each_entry_safe(tpos, pos, head, member) \ argument
184 pos = rcu_dereference_raw(hlist_nulls_first_rcu(head)); \
185 (!is_a_nulls(pos)) && \
186 ({ tpos = hlist_nulls_entry(pos, typeof(*tpos), member); \
187 pos = rcu_dereference_raw(hlist_nulls_next_rcu(pos)); 1; });)
|
| D | list_nulls.h | 127 #define hlist_nulls_for_each_entry(tpos, pos, head, member) \ argument
128 for (pos = (head)->first; \
129 (!is_a_nulls(pos)) && \
130 ({ tpos = hlist_nulls_entry(pos, typeof(*tpos), member); 1;}); \
131 pos = pos->next)
140 #define hlist_nulls_for_each_entry_from(tpos, pos, member) \ argument
141 for (; (!is_a_nulls(pos)) && \
142 ({ tpos = hlist_nulls_entry(pos, typeof(*tpos), member); 1;}); \
143 pos = pos->next)
|
| D | rculist_bl.h | 95 #define hlist_bl_for_each_entry_rcu(tpos, pos, head, member) \ argument
96 for (pos = hlist_bl_first_rcu(head); \
97 pos && \
98 ({ tpos = hlist_bl_entry(pos, typeof(*tpos), member); 1; }); \
99 pos = rcu_dereference_raw(pos->next))
|
| D | list_bl.h | 169 #define hlist_bl_for_each_entry(tpos, pos, head, member) \ argument
170 for (pos = hlist_bl_first(head); \
171 pos && \
172 ({ tpos = hlist_bl_entry(pos, typeof(*tpos), member); 1;}); \
173 pos = pos->next)
183 #define hlist_bl_for_each_entry_safe(tpos, pos, n, head, member) \ argument
184 for (pos = hlist_bl_first(head); \
185 pos && ({ n = pos->next; 1; }) && \
186 ({ tpos = hlist_bl_entry(pos, typeof(*tpos), member); 1;}); \
187 pos = n)
|
| D | cpufreq.h | 706 #define cpufreq_for_each_entry(pos, table) \ argument
707 for (pos = table; pos->frequency != CPUFREQ_TABLE_END; pos++)
717 #define cpufreq_for_each_entry_idx(pos, table, idx) \ argument
718 for (pos = table, idx = 0; pos->frequency != CPUFREQ_TABLE_END; \
719 pos++, idx++)
728 #define cpufreq_for_each_valid_entry(pos, table) \ argument
729 for (pos = table; pos->frequency != CPUFREQ_TABLE_END; pos++) \
730 if (pos->frequency == CPUFREQ_ENTRY_INVALID) \
742 #define cpufreq_for_each_valid_entry_idx(pos, table, idx) \ argument
743 cpufreq_for_each_entry_idx(pos, table, idx) \
[all …]
|
| D | regset.h | 119 unsigned int pos, unsigned int count,
253 static inline int user_regset_copyin(unsigned int *pos, unsigned int *count, in user_regset_copyin() argument
260 BUG_ON(*pos < start_pos); in user_regset_copyin()
261 if (end_pos < 0 || *pos < end_pos) { in user_regset_copyin()
263 : min(*count, end_pos - *pos)); in user_regset_copyin()
264 data += *pos - start_pos; in user_regset_copyin()
272 *pos += copy; in user_regset_copyin()
278 static inline void user_regset_copyin_ignore(unsigned int *pos, in user_regset_copyin_ignore() argument
287 BUG_ON(*pos < start_pos); in user_regset_copyin_ignore()
288 if (end_pos < 0 || *pos < end_pos) { in user_regset_copyin_ignore()
[all …]
|
| D | rhashtable.h | 283 #define rht_entry(tpos, pos, member) \ argument
284 ({ tpos = container_of(pos, typeof(*tpos), member); 1; })
422 #define rht_for_each_from(pos, head, tbl, hash) \ argument
423 for (pos = head; \
424 !rht_is_a_nulls(pos); \
425 pos = rht_dereference_bucket((pos)->next, tbl, hash))
433 #define rht_for_each(pos, tbl, hash) \ argument
434 rht_for_each_from(pos, rht_ptr(rht_bucket(tbl, hash), tbl, hash), \
446 #define rht_for_each_entry_from(tpos, pos, head, tbl, hash, member) \ argument
447 for (pos = head; \
[all …]
|
| D | iomap.h | 111 static inline sector_t iomap_sector(const struct iomap *iomap, loff_t pos) in iomap_sector() argument
113 return (iomap->addr + pos - iomap->offset) >> SECTOR_SHIFT; in iomap_sector()
119 static inline void *iomap_inline_data(const struct iomap *iomap, loff_t pos) in iomap_inline_data() argument
121 return iomap->inline_data + pos - iomap->offset; in iomap_inline_data()
145 struct folio *(*get_folio)(struct iomap_iter *iter, loff_t pos,
147 void (*put_folio)(struct inode *inode, loff_t pos, unsigned copied,
191 int (*iomap_begin)(struct inode *inode, loff_t pos, loff_t length,
201 int (*iomap_end)(struct inode *inode, loff_t pos, loff_t length,
223 loff_t pos; member
246 return min(iter->len, end - iter->pos); in iomap_length()
[all …]
|
| D | mroute_base.h | 394 void *mr_vif_seq_idx(struct net *net, struct mr_vif_iter *iter, loff_t pos);
395 void *mr_vif_seq_next(struct seq_file *seq, void *v, loff_t *pos);
397 static inline void *mr_vif_seq_start(struct seq_file *seq, loff_t *pos) in mr_vif_seq_start() argument
399 return *pos ? mr_vif_seq_idx(seq_file_net(seq), in mr_vif_seq_start()
400 seq->private, *pos - 1) in mr_vif_seq_start()
408 struct mr_mfc_iter *it, loff_t pos);
410 loff_t *pos);
412 static inline void *mr_mfc_seq_start(struct seq_file *seq, loff_t *pos, in mr_mfc_seq_start() argument
421 return *pos ? mr_mfc_seq_idx(seq_file_net(seq), in mr_mfc_seq_start()
422 seq->private, *pos - 1) in mr_mfc_seq_start()
[all …]
|
| D | cgroup.h | 147 struct cgroup_subsys_state *css_next_child(struct cgroup_subsys_state *pos,
149 struct cgroup_subsys_state *css_next_descendant_pre(struct cgroup_subsys_state *pos,
151 struct cgroup_subsys_state *css_rightmost_descendant(struct cgroup_subsys_state *pos);
152 struct cgroup_subsys_state *css_next_descendant_post(struct cgroup_subsys_state *pos,
183 #define css_for_each_child(pos, parent) \ argument
184 for ((pos) = css_next_child(NULL, (parent)); (pos); \
185 (pos) = css_next_child((pos), (parent)))
243 #define css_for_each_descendant_pre(pos, css) \ argument
244 for ((pos) = css_next_descendant_pre(NULL, (css)); (pos); \
245 (pos) = css_next_descendant_pre((pos), (css)))
[all …]
|
| D | seq_file.h | 32 void * (*start) (struct seq_file *m, loff_t *pos);
34 void * (*next) (struct seq_file *m, void *v, loff_t *pos);
300 loff_t pos);
302 loff_t pos);
306 extern struct list_head *seq_list_start_rcu(struct list_head *head, loff_t pos);
307 extern struct list_head *seq_list_start_head_rcu(struct list_head *head, loff_t pos);
315 loff_t pos);
317 loff_t pos);
322 loff_t pos);
324 loff_t pos);
[all …]
|
| D | min_heap.h | 78 void __min_heap_sift_down(min_heap_char *heap, int pos, size_t elem_size, in __min_heap_sift_down() argument
83 void *root = data + pos * elem_size; in __min_heap_sift_down()
84 int i = pos, j; in __min_heap_sift_down()
100 while (i != pos && func->less(root, data + i * elem_size, args)) in __min_heap_sift_down()
105 while (i != pos) { in __min_heap_sift_down()
193 int pos; in __min_heap_push() local
199 pos = heap->nr; in __min_heap_push()
200 memcpy(data + (pos * elem_size), element, elem_size); in __min_heap_push()
204 __min_heap_sift_up(heap, elem_size, pos, func, args); in __min_heap_push()
|
| /include/uapi/linux/netfilter/ |
| D | x_tables.h | 174 #define xt_entry_foreach(pos, ehead, esize) \ argument
175 for ((pos) = (typeof(pos))(ehead); \
176 (pos) < (typeof(pos))((char *)(ehead) + (esize)); \
177 (pos) = (typeof(pos))((char *)(pos) + (pos)->next_offset))
180 #define xt_ematch_foreach(pos, entry) \ argument
181 for ((pos) = (struct xt_entry_match *)entry->elems; \
182 (pos) < (struct xt_entry_match *)((char *)(entry) + \
184 (pos) = (struct xt_entry_match *)((char *)(pos) + \
185 (pos)->u.match_size))
|
| /include/linux/mtd/ |
| D | nand.h | 116 struct nand_pos pos; member
229 int (*erase)(struct nand_device *nand, const struct nand_pos *pos);
230 int (*markbad)(struct nand_device *nand, const struct nand_pos *pos);
231 bool (*isbad)(struct nand_device *nand, const struct nand_pos *pos);
751 struct nand_pos *pos) in nanddev_offs_to_pos() argument
757 pos->page = do_div(tmp, nand->memorg.pages_per_eraseblock); in nanddev_offs_to_pos()
758 pos->eraseblock = do_div(tmp, nand->memorg.eraseblocks_per_lun); in nanddev_offs_to_pos()
759 pos->plane = pos->eraseblock % nand->memorg.planes_per_lun; in nanddev_offs_to_pos()
760 pos->lun = do_div(tmp, nand->memorg.luns_per_target); in nanddev_offs_to_pos()
761 pos->target = tmp; in nanddev_offs_to_pos()
[all …]
|
| /include/linux/sunrpc/ |
| D | svc_rdma_pcl.h | 88 #define pcl_for_each_chunk(pos, pcl) \ argument
89 for (pos = list_first_entry(&(pcl)->cl_chunks, struct svc_rdma_chunk, ch_list); \
90 &pos->ch_list != &(pcl)->cl_chunks; \
91 pos = list_next_entry(pos, ch_list))
98 #define pcl_for_each_segment(pos, chunk) \ argument
99 for (pos = &(chunk)->ch_segments[0]; \
100 pos <= &(chunk)->ch_segments[(chunk)->ch_segcount - 1]; \
101 pos++)
|
| /include/net/sctp/ |
| D | sctp.h | 109 struct rhashtable_iter *iter, int pos);
114 struct net *net, int *pos, void *p);
370 #define sctp_skb_for_each(pos, head, tmp) \ argument
371 skb_queue_walk_safe(head, pos, tmp)
426 #define sctp_walk_params(pos, chunk)\ argument
427 _sctp_walk_params((pos), (chunk), ntohs((chunk)->chunk_hdr.length))
429 #define _sctp_walk_params(pos, chunk, end)\ argument
430 for (pos.v = (u8 *)(chunk + 1);\
431 (pos.v + offsetof(struct sctp_paramhdr, length) + sizeof(pos.p->length) <=\
433 pos.v <= (void *)chunk + end - ntohs(pos.p->length) &&\
[all …]
|
| /include/drm/ |
| D | drm_mm.h | 394 #define drm_mm_for_each_hole(pos, mm, hole_start, hole_end) \ argument
395 for (pos = list_first_entry(&(mm)->hole_stack, \
396 typeof(*pos), hole_stack); \
397 &pos->hole_stack != &(mm)->hole_stack ? \
398 hole_start = drm_mm_hole_node_start(pos), \
399 hole_end = hole_start + pos->hole_size, \
401 pos = list_next_entry(pos, hole_stack))
|
| /include/linux/mdio/ |
| D | mdio-xgene.h | 103 static inline u64 xgene_enet_set_field_value(int pos, int len, u64 val) in xgene_enet_set_field_value() argument
105 return (val & ((1ULL << len) - 1)) << pos; in xgene_enet_set_field_value()
117 static inline u64 xgene_enet_get_field_value(int pos, int len, u64 src) in xgene_enet_get_field_value() argument
119 return (src >> pos) & ((1ULL << len) - 1); in xgene_enet_get_field_value()
|
| /include/trace/events/ |
| D | sof_intel.h | 93 snd_pcm_uframes_t pos
95 TP_ARGS(sdev, hstream, substream, pos),
100 __field(unsigned long, pos)
106 __entry->pos = pos;
110 __entry->substream, __entry->pos)
|
| /include/acpi/ |
| D | apei.h | 44 int erst_get_record_id_begin(int *pos);
45 int erst_get_record_id_next(int *pos, u64 *record_id);
|