Searched refs:task1 (Results 1 – 4 of 4) sorted by relevance
| /linux-5.19.10/kernel/ |
| D | kcmp.c | 98 static int kcmp_epoll_target(struct task_struct *task1, in kcmp_epoll_target() argument
109 filp = get_file_raw_ptr(task1, idx1); in kcmp_epoll_target()
126 static int kcmp_epoll_target(struct task_struct *task1, in kcmp_epoll_target() argument
138 struct task_struct *task1, *task2; in SYSCALL_DEFINE5() local
146 task1 = find_task_by_vpid(pid1); in SYSCALL_DEFINE5()
148 if (!task1 || !task2) in SYSCALL_DEFINE5()
151 get_task_struct(task1); in SYSCALL_DEFINE5()
159 ret = kcmp_lock(&task1->signal->exec_update_lock, in SYSCALL_DEFINE5()
163 if (!ptrace_may_access(task1, PTRACE_MODE_READ_REALCREDS) || in SYSCALL_DEFINE5()
173 filp1 = get_file_raw_ptr(task1, idx1); in SYSCALL_DEFINE5()
[all …]
|
| /linux-5.19.10/tools/memory-model/Documentation/ |
| D | ordering.txt | 352 example, where task0() and task1() execute concurrently:
360 void task1(void)
|
| /linux-5.19.10/tools/perf/ |
| D | builtin-sched.c | 506 struct task_desc *task1, *task2; in add_cross_task_wakeups() local
510 task1 = sched->tasks[i]; in add_cross_task_wakeups()
515 add_sched_event_wakeup(sched, task1, 0, task2); in add_cross_task_wakeups()
|
| /linux-5.19.10/Documentation/RCU/Design/Memory-Ordering/ |
| D | Tree-RCU-Memory-Ordering.rst | 90 11 void task1(void)
|