Home
last modified time | relevance | path

Searched refs:pos (Results 1 – 25 of 92) sorted by relevance

1234

/include/linux/
A Dlist.h687 for (pos = (head)->next; !list_is_head(pos, (head)); pos = pos->next)
697 pos = rcu_dereference(pos->next))
707 for (pos = pos->next; !list_is_head(pos, (head)); pos = pos->next)
715 for (pos = (head)->prev; !list_is_head(pos, (head)); pos = pos->prev)
726 pos = n, n = pos->next)
737 pos = n, n = pos->prev)
1137 for (pos = (head)->first; pos ; pos = pos->next)
1140 for (pos = (head)->first; pos && ({ n = pos->next; 1; }); \
1157 pos = hlist_entry_safe((pos)->member.next, typeof(*(pos)), member))
1167 pos = hlist_entry_safe((pos)->member.next, typeof(*(pos)), member))
[all …]
A Drculist.h440 pos = list_entry_rcu(pos->member.next, typeof(*pos), member))
459 pos = list_entry_rcu(pos->member.next, typeof(*pos), member))
493 pos = list_entry_lockless(pos->member.next, typeof(*pos), member))
514 for (pos = list_entry_rcu(pos->member.next, typeof(*pos), member); \
516 pos = list_entry_rcu(pos->member.next, typeof(*pos), member))
537 pos = list_entry_rcu(pos->member.next, typeof(*(pos)), member))
759 &(pos)->member)), typeof(*(pos)), member))
780 &(pos)->member)), typeof(*(pos)), member))
800 &(pos)->member)), typeof(*(pos)), member))
817 &(pos)->member)), typeof(*(pos)), member))
[all …]
A Dllist.h143 #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))
203 for (pos = llist_entry((node), typeof(*pos), member); \
204 member_address_is_nonnull(pos, member) && \
[all …]
A Dif_tunnel.h14 #define for_each_ip_tunnel_rcu(pos, start) \ argument
15 for (pos = rcu_dereference(start); pos; pos = rcu_dereference(pos->next))
A Dplist.h142 #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
163 #define plist_for_each_safe(pos, n, head) \ argument
172 #define plist_for_each_entry(pos, head, mem) \ argument
184 #define plist_for_each_entry_continue(pos, head, m) \ argument
196 #define plist_for_each_entry_safe(pos, n, head, m) \ argument
257 #define plist_next(pos) \ argument
258 list_next_entry(pos, node_list)
264 #define plist_prev(pos) \ argument
[all …]
A Drculist_nulls.h167 #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; });)
A Dlist_nulls.h128 #define hlist_nulls_for_each_entry(tpos, pos, head, member) \ argument
129 for (pos = (head)->first; \
130 (!is_a_nulls(pos)) && \
131 ({ tpos = hlist_nulls_entry(pos, typeof(*tpos), member); 1;}); \
132 pos = pos->next)
141 #define hlist_nulls_for_each_entry_from(tpos, pos, member) \ argument
142 for (; (!is_a_nulls(pos)) && \
143 ({ tpos = hlist_nulls_entry(pos, typeof(*tpos), member); 1;}); \
144 pos = pos->next)
A Drculist_bl.h95 #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))
A Dlist_bl.h169 #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)
A Drhashtable.h425 pos = rht_dereference_bucket((pos)->next, tbl, hash))
448 (!rht_is_a_nulls(pos)) && rht_entry(tpos, pos, member); \
449 pos = rht_dereference_bucket((pos)->next, tbl, hash))
480 (!rht_is_a_nulls(pos)) && rht_entry(tpos, pos, member); \
500 pos = rcu_dereference_raw(pos->next))
516 pos = rcu_dereference_raw(pos->next))
534 (!rht_is_a_nulls(pos)) && rht_entry(tpos, pos, member); \
535 pos = rht_dereference_bucket_rcu(pos->next, tbl, hash))
563 for (pos = list; pos; pos = rcu_dereference_raw(pos->next))
576 for (pos = list; pos && rht_entry(tpos, pos, member); \
[all …]
A Diomap.h121 return (iomap->addr + pos - iomap->offset) >> SECTOR_SHIFT; in iomap_sector()
129 return iomap->inline_data + pos - iomap->offset; in iomap_inline_data()
148 struct folio *(*get_folio)(struct iomap_iter *iter, loff_t pos,
178 struct folio *folio, loff_t pos, size_t len);
237 loff_t pos; member
266 return min(len, end - pos); in iomap_length_trim()
277 return iomap_length_trim(iter, iter->pos, iter->len); in iomap_length()
316 return round_down(pos, i_blocksize(inode)); in iomap_last_written_block()
317 return round_up(pos + written, i_blocksize(inode)); in iomap_last_written_block()
436 struct folio *folio, u64 pos, unsigned int len,
[all …]
A Dregset.h119 unsigned int pos, unsigned int count,
270 BUG_ON(*pos < start_pos); in user_regset_copyin()
271 if (end_pos < 0 || *pos < end_pos) { in user_regset_copyin()
273 : min(*count, end_pos - *pos)); in user_regset_copyin()
274 data += *pos - start_pos; in user_regset_copyin()
282 *pos += copy; in user_regset_copyin()
288 static inline void user_regset_copyin_ignore(unsigned int *pos, in user_regset_copyin_ignore() argument
297 BUG_ON(*pos < start_pos); in user_regset_copyin_ignore()
298 if (end_pos < 0 || *pos < end_pos) { in user_regset_copyin_ignore()
300 : min(*count, end_pos - *pos)); in user_regset_copyin_ignore()
[all …]
A Dcpufreq.h725 for (pos = table; pos->frequency != CPUFREQ_TABLE_END; pos++)
736 for (pos = table, idx = 0; pos->frequency != CPUFREQ_TABLE_END; \
737 pos++, idx++)
747 for (pos = table; pos->frequency != CPUFREQ_TABLE_END; pos++) \
813 freq = pos->frequency; in cpufreq_table_find_index_al()
835 freq = pos->frequency; in cpufreq_table_find_index_dl()
889 freq = pos->frequency; in cpufreq_table_find_index_ah()
920 freq = pos->frequency; in cpufreq_table_find_index_dh()
965 freq = pos->frequency; in cpufreq_table_find_index_ac()
1000 freq = pos->frequency; in cpufreq_table_find_index_dc()
[all …]
A Dmroute_base.h400 void *mr_vif_seq_next(struct seq_file *seq, void *v, loff_t *pos);
404 return *pos ? mr_vif_seq_idx(seq_file_net(seq), in mr_vif_seq_start()
405 seq->private, *pos - 1) in mr_vif_seq_start()
413 struct mr_mfc_iter *it, loff_t pos);
415 loff_t *pos);
426 return *pos ? mr_mfc_seq_idx(seq_file_net(seq), in mr_mfc_seq_start()
427 seq->private, *pos - 1) in mr_mfc_seq_start()
443 loff_t pos) in mr_vif_seq_idx() argument
449 void *v, loff_t *pos) in mr_vif_seq_next() argument
460 struct mr_mfc_iter *it, loff_t pos) in mr_mfc_seq_idx() argument
[all …]
A Dseq_file.h32 void * (*start) (struct seq_file *m, loff_t *pos);
34 void * (*next) (struct seq_file *m, void *v, loff_t *pos);
301 loff_t pos);
303 loff_t pos);
307 extern struct list_head *seq_list_start_rcu(struct list_head *head, loff_t pos);
308 extern struct list_head *seq_list_start_head_rcu(struct list_head *head, loff_t pos);
316 loff_t pos);
318 loff_t pos);
323 loff_t pos);
325 loff_t pos);
[all …]
A Dcgroup.h152 struct cgroup_subsys_state *css_next_child(struct cgroup_subsys_state *pos,
154 struct cgroup_subsys_state *css_next_descendant_pre(struct cgroup_subsys_state *pos,
188 #define css_for_each_child(pos, parent) \ argument
189 for ((pos) = css_next_child(NULL, (parent)); (pos); \
190 (pos) = css_next_child((pos), (parent)))
248 #define css_for_each_descendant_pre(pos, css) \ argument
249 for ((pos) = css_next_descendant_pre(NULL, (css)); (pos); \
250 (pos) = css_next_descendant_pre((pos), (css)))
271 #define css_for_each_descendant_post(pos, css) \ argument
272 for ((pos) = css_next_descendant_post(NULL, (css)); (pos); \
[all …]
A Dbitmap.h655 void bitmap_release_region(unsigned long *bitmap, unsigned int pos, int order) in bitmap_release_region() argument
657 bitmap_clear(bitmap, pos, BIT(order)); in bitmap_release_region()
672 int bitmap_allocate_region(unsigned long *bitmap, unsigned int pos, int order) in bitmap_allocate_region() argument
676 if (find_next_bit(bitmap, pos + len, pos) < pos + len) in bitmap_allocate_region()
678 bitmap_set(bitmap, pos, len); in bitmap_allocate_region()
699 unsigned int pos, end; /* scans bitmap by regions of size order */ in bitmap_find_free_region() local
701 for (pos = 0; (end = pos + BIT(order)) <= bits; pos = end) { in bitmap_find_free_region()
702 if (!bitmap_allocate_region(bitmap, pos, order)) in bitmap_find_free_region()
703 return pos; in bitmap_find_free_region()
/include/uapi/linux/netfilter/
A Dx_tables.h174 #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/
A Dnand.h759 pos->plane = pos->eraseblock % nand->memorg.planes_per_lun; in nanddev_offs_to_pos()
811 (pos->lun + in nanddev_pos_to_offs()
848 pos->page = 0; in nanddev_pos_next_target()
849 pos->plane = 0; in nanddev_pos_next_target()
851 pos->lun = 0; in nanddev_pos_next_target()
852 pos->target++; in nanddev_pos_next_target()
869 pos->lun++; in nanddev_pos_next_lun()
870 pos->page = 0; in nanddev_pos_next_lun()
890 pos->page = 0; in nanddev_pos_next_eraseblock()
891 pos->plane = pos->eraseblock % nand->memorg.planes_per_lun; in nanddev_pos_next_eraseblock()
[all …]
/include/linux/sunrpc/
A Dsvc_rdma_pcl.h88 #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/
A Dsctp.h109 struct rhashtable_iter *iter, int pos);
114 struct net *net, int *pos, void *p);
368 #define sctp_skb_for_each(pos, head, tmp) \ argument
369 skb_queue_walk_safe(head, pos, tmp)
424 #define sctp_walk_params(pos, chunk)\ argument
428 for (pos.v = (u8 *)(chunk + 1);\
429 (pos.v + offsetof(struct sctp_paramhdr, length) + sizeof(pos.p->length) <=\
431 pos.v <= (void *)chunk + end - ntohs(pos.p->length) &&\
433 pos.v += SCTP_PAD4(ntohs(pos.p->length)))
447 #define sctp_walk_fwdtsn(pos, chunk)\ argument
[all …]
/include/drm/
A Ddrm_mm.h394 #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/
A Dmdio-xgene.h103 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/
A Dsof_intel.h93 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/
A Dapei.h44 int erst_get_record_id_begin(int *pos);
45 int erst_get_record_id_next(int *pos, u64 *record_id);

Completed in 46 milliseconds

1234