Searched refs:task1 (Results 1 – 4 of 4) sorted by relevance
/linux/kernel/ |
A D | kcmp.c | 109 filp = get_file_raw_ptr(task1, idx1); in kcmp_epoll_target() 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() 173 filp1 = get_file_raw_ptr(task1, idx1); in SYSCALL_DEFINE5() 183 ret = kcmp_ptr(task1->mm, task2->mm, KCMP_VM); in SYSCALL_DEFINE5() 189 ret = kcmp_ptr(task1->fs, task2->fs, KCMP_FS); in SYSCALL_DEFINE5() 199 ret = kcmp_ptr(task1->sysvsem.undo_list, in SYSCALL_DEFINE5() 215 kcmp_unlock(&task1->signal->exec_update_lock, in SYSCALL_DEFINE5() [all …]
|
/linux/tools/memory-model/Documentation/ |
A D | ordering.txt | 352 example, where task0() and task1() execute concurrently: 360 void task1(void)
|
/linux/tools/perf/ |
A 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/Documentation/RCU/Design/Memory-Ordering/ |
A D | Tree-RCU-Memory-Ordering.rst | 90 11 void task1(void)
|
Completed in 18 milliseconds