Searched refs:prev (Results 151 - 175 of 1036) sorted by last modified time

1234567891011>>

/linux-master/io_uring/
H A Dtimeout.c25 struct io_kiocb *prev; member in struct:io_timeout
78 list_add(&timeout->list, ctx->timeout_list.prev);
302 struct io_kiocb *prev = timeout->prev; local
305 if (prev) {
309 .data = prev->cqe.user_data,
316 io_put_req(prev);
327 struct io_kiocb *prev, *req = data->req; local
333 prev = timeout->head;
340 if (prev) {
[all...]
H A Drw.c1111 struct io_wq_work_node *pos, *start, *prev; local
1163 prev = start;
1164 wq_list_for_each_resume(pos, prev) {
1179 wq_list_cut(&ctx->iopoll_list, prev, start);
H A Dio-wq.c478 struct io_wq_work_node *node, *prev; variable in typeref:struct:
483 wq_list_for_each(node, prev, &acct->work_list) {
490 wq_list_del(&acct->work_list, node, prev);
501 wq_list_cut(&acct->work_list, &tail->list, prev);
506 /* fast forward to a next hash, for-each will fix up @prev */
1019 struct io_wq_work_node *prev)
1026 if (prev)
1027 prev_work = container_of(prev, struct io_wq_work, list);
1033 wq_list_del(&acct->work_list, &work->list, prev);
1040 struct io_wq_work_node *node, *prev; local
1017 io_wq_remove_pending(struct io_wq *wq, struct io_wq_work *work, struct io_wq_work_node *prev) argument
1340 int prev[IO_WQ_ACCT_NR]; local
[all...]
/linux-master/include/trace/events/
H A Dsched.h225 struct task_struct *prev,
229 TP_ARGS(preempt, prev, next, prev_state),
243 __entry->prev_pid = prev->pid;
244 __entry->prev_prio = prev->prio;
245 __entry->prev_state = __trace_sched_switch_state(preempt, prev_state, prev);
246 memcpy(__entry->prev_comm, prev->comm, TASK_COMM_LEN);
/linux-master/include/net/
H A Dsch_generic.h65 /* similar to sk_buff_head, but skb->prev pointer is undefined. */
1091 if (skb->prev)
1092 skb->prev->next = *to_free;
/linux-master/include/linux/
H A Dvtime.h48 extern void vtime_task_switch(struct task_struct *prev);
85 extern void vtime_task_switch_generic(struct task_struct *prev);
87 static inline void vtime_task_switch(struct task_struct *prev) argument
90 vtime_task_switch_generic(prev);
112 static inline void vtime_task_switch(struct task_struct *prev) { } argument
H A Dtrace_events.h248 void tracing_record_taskinfo_sched_switch(struct task_struct *prev,
H A Dperf_event.h1085 extern void __perf_event_task_sched_in(struct task_struct *prev,
1087 extern void __perf_event_task_sched_out(struct task_struct *prev,
1469 static inline void perf_event_task_sched_in(struct task_struct *prev, argument
1473 __perf_event_task_sched_in(prev, task);
1482 static inline void perf_event_task_sched_out(struct task_struct *prev, argument
1490 perf_cgroup_from_task(prev, NULL) !=
1496 __perf_event_task_sched_out(prev, next);
1746 perf_event_task_sched_in(struct task_struct *prev, argument
1749 perf_event_task_sched_out(struct task_struct *prev, argument
H A Dfilter.h1123 fp->aux->ksym.lnode.prev == LIST_POISON2;
H A Dblk-mq.h257 * @prev: The request preceding @rq in @src (NULL if @rq is the head)
260 struct request *rq, struct request *prev)
262 if (prev)
263 prev->rq_next = rq->rq_next;
259 rq_list_move(struct request **src, struct request **dst, struct request *rq, struct request *prev) argument
H A Dbio.h834 struct bio *bio_chain_and_submit(struct bio *prev, struct bio *new);
H A Damd-pstate.h61 * @prev: Last Aperf/Mperf/tsc count value read from register
97 struct amd_aperf_mperf prev; member in struct:amd_cpudata
H A Dacpi.h1410 struct fwnode_handle *prev)
1409 acpi_graph_get_next_endpoint(const struct fwnode_handle *fwnode, struct fwnode_handle *prev) argument
/linux-master/include/linux/mlx5/
H A Ddriver.h435 u32 prev; member in struct:mlx5_core_health
/linux-master/include/kunit/
H A Dtest.h128 const void* (*generate_params)(const void *prev, char *desc);
193 * const void* gen_params(const void *prev, char *desc)
196 * a void*. The argument @prev is the previously returned value, which should be
197 * used to derive the next value; @prev is set to NULL on the initial generator
1532 static const void *name##_gen_params(const void *prev, char *desc) \
1534 typeof((array)[0]) *__next = prev ? ((typeof(__next)) prev) + 1 : (array); \
1553 static const void *name##_gen_params(const void *prev, char *desc) \
1555 typeof((array)[0]) *__next = prev ? ((typeof(__next)) prev)
[all...]
/linux-master/fs/reiserfs/
H A Ditem_ops.c264 __u32 prev = INT_MAX; local
274 if (sequence_finished(prev, &num, get_block_num(unp, j))) {
275 print_sequence(prev, num);
276 start_new_sequence(&prev, &num, get_block_num(unp, j));
279 print_sequence(prev, num);
/linux-master/fs/orangefs/
H A Dsuper.c622 ORANGEFS_SB(sb)->list.prev = NULL;
/linux-master/fs/ntfs3/
H A Dindex.c2259 struct NTFS_DE *e, *re, *next, *prev, *me; local
2464 prev = NULL;
2468 prev = e;
2493 if (!prev) {
2498 if (de_has_vcn(prev)) {
2499 de_set_vbn_le(e, de_get_vbn_le(prev));
2505 e = prev;
/linux-master/fs/
H A Dlibfs.c577 static struct dentry *find_next_child(struct dentry *parent, struct dentry *prev) argument
582 d = prev ? d_next_sibling(prev) : d_first_child(parent);
594 dput(prev);
H A Dfs-writeback.c464 pos->i_io_list.prev);
1423 inode = wb_inode(delaying_queue->prev);
1451 sb = wb_inode(tmp.prev)->i_sb;
1873 struct inode *inode = wb_inode(wb->b_io.prev);
2006 struct inode *inode = wb_inode(wb->b_io.prev);
2159 inode = wb_inode(wb->b_more_io.prev);
H A Ddcache.c1061 dentry = list_entry(list->prev, struct dentry, d_lru);
/linux-master/fs/gfs2/
H A Dxattr.c86 struct gfs2_ea_header *prev, void *private);
92 struct gfs2_ea_header *ea, *prev = NULL; local
98 for (ea = GFS2_EA_BH2FIRST(bh);; prev = ea, ea = GFS2_EA2NEXT(ea)) {
112 error = ea_call(ip, bh, ea, prev, data);
180 struct gfs2_ea_header *ea, struct gfs2_ea_header *prev,
195 el->el_prev = prev;
235 struct gfs2_ea_header *prev, void *private)
305 if (prev && !leave) {
308 len = GFS2_EA_REC_LEN(prev) + GFS2_EA_REC_LEN(ea);
309 prev
179 ea_find_i(struct gfs2_inode *ip, struct buffer_head *bh, struct gfs2_ea_header *ea, struct gfs2_ea_header *prev, void *private) argument
233 ea_dealloc_unstuffed(struct gfs2_inode *ip, struct buffer_head *bh, struct gfs2_ea_header *ea, struct gfs2_ea_header *prev, void *private) argument
328 ea_remove_unstuffed(struct gfs2_inode *ip, struct buffer_head *bh, struct gfs2_ea_header *ea, struct gfs2_ea_header *prev, int leave) argument
354 ea_list_i(struct gfs2_inode *ip, struct buffer_head *bh, struct gfs2_ea_header *ea, struct gfs2_ea_header *prev, void *private) argument
845 struct gfs2_ea_header *prev = el->el_prev; local
924 ea_set_simple(struct gfs2_inode *ip, struct buffer_head *bh, struct gfs2_ea_header *ea, struct gfs2_ea_header *prev, void *private) argument
1092 struct gfs2_ea_header *prev = el->el_prev; local
[all...]
H A Ddir.c19 * prev->de_rec_len += deleted->de_rec_len. Since the next dirent is obtained
559 struct gfs2_dirent *dent, *prev; local
570 prev = NULL;
584 prev = dent;
600 return prev ? prev : dent;
666 * @prev: The previous dirent
672 struct gfs2_dirent *prev, struct gfs2_dirent *cur)
683 /* If there is no prev entry, this is the first entry in the block.
687 if (!prev) {
671 dirent_del(struct gfs2_inode *dip, struct buffer_head *bh, struct gfs2_dirent *prev, struct gfs2_dirent *cur) argument
1006 struct gfs2_dirent *dent = NULL, *prev = NULL, *next = NULL, *new; local
1880 struct gfs2_dirent *dent, *prev = NULL; local
[all...]
/linux-master/fs/dlm/
H A Dmember.c303 newlist->prev = tmp->prev;
305 tmp->prev->next = newlist;
306 tmp->prev = newlist;
562 log_rinfo(ls, "prev removed member %d", memb->nodeid);
/linux-master/fs/btrfs/
H A Dvolumes.c3056 struct rb_node *prev = NULL; local
3063 prev = node;
3076 if (!prev)
3079 orig_prev = prev;
3080 while (prev && logical >= prev_map->start + prev_map->chunk_len) {
3081 prev = rb_next(prev);
3082 prev_map = rb_entry(prev, struct btrfs_chunk_map, rb_node);
3085 if (!prev) {
3086 prev
[all...]

Completed in 541 milliseconds

1234567891011>>