/linux-master/tools/testing/selftests/bpf/benchs/ |
H A D | run_bench_local_storage_rcu_tasks_trace.sh | 11 ./bench --nr_procs 15000 --kthread_pid $kthread_pid -d 600 --quiet local-storage-tasks-trace
|
/linux-master/tools/testing/selftests/bpf/progs/ |
H A D | bpf_iter_task_btf.c | 11 long tasks = 0; variable 33 tasks++;
|
/linux-master/drivers/gpu/drm/ |
H A D | drm_flip_work.c | 104 struct list_head tasks; local 110 INIT_LIST_HEAD(&tasks); 112 list_splice_tail(&work->commited, &tasks); 116 if (list_empty(&tasks)) 119 list_for_each_entry_safe(task, tmp, &tasks, node) {
|
/linux-master/samples/bpf/ |
H A D | tracex2_user.c | 85 static struct task tasks[1024]; local 93 if (memcmp(&tasks[i], &next_key, SIZE) == 0) 96 memcpy(&tasks[task_cnt++], &next_key, SIZE); 102 (__u32) tasks[i].pid_tgid, 103 tasks[i].comm, 104 (__u32) tasks[i].uid_gid); 105 print_hist_for_pid(fd, &tasks[i]);
|
H A D | map_perf_test_user.c | 94 static int pre_test_lru_hash_lookup(int tasks) argument 295 typedef int (*pre_test_func)(int tasks); 315 static int pre_test(int tasks) argument 321 int ret = pre_test_funcs[i](tasks); 346 static void run_perf_test(int tasks) argument 348 pid_t pid[tasks]; 351 assert(!pre_test(tasks)); 353 for (i = 0; i < tasks; i++) { 363 for (i = 0; i < tasks; i++) {
|
H A D | test_overhead_user.c | 108 static void run_perf_test(int tasks, int flags) argument 110 pid_t pid[tasks]; 113 for (i = 0; i < tasks; i++) { 123 for (i = 0; i < tasks; i++) {
|
H A D | test_lru_dist.c | 235 static void run_parallel(unsigned int tasks, void (*fn)(int i, void *data), argument 239 pid_t pid[tasks]; 242 for (i = 0; i < tasks; i++) { 258 for (i = 0; i < tasks; i++) { 496 printf("Usage: %s <dist-file> <lru-size> <nr-tasks>\n",
|
/linux-master/include/linux/ |
H A D | user_events.h | 26 refcount_t tasks; member in struct:user_event_mm 47 refcount_inc(&old_mm->tasks);
|
H A D | pid.h | 16 * It refers to individual tasks, process groups, and sessions. While 62 /* lists of tasks that use this pid */ 63 struct hlist_head tasks[PIDTYPE_MAX]; member in struct:pid 92 return !hlist_empty(&pid->tasks[type]); 190 &(pid)->tasks[type], pid_links[type]) {
|
H A D | psi_types.h | 19 * For IO and CPU stalls the presence of running/oncpu tasks 54 * SOME: Stalled tasks & working tasks 55 * FULL: Stalled tasks & no working tasks 90 /* States of the tasks belonging to this group */ 91 unsigned int tasks[NR_PSI_TASK_COUNTS]; member in struct:psi_group_cpu 93 /* Aggregate pressure state derived from the tasks */
|
/linux-master/scripts/gdb/ |
H A D | vmlinux-gdb.py | 33 import linux.tasks namespace
|
/linux-master/tools/perf/scripts/python/ |
H A D | sched-migration.py | 100 def __init__(self, tasks = [0], event = RunqueueEventUnknown()): 101 self.tasks = tuple(tasks) 107 if taskState(prev_state) == "R" and next in self.tasks \ 108 and prev in self.tasks: 114 next_tasks = list(self.tasks[:]) 115 if prev in self.tasks: 127 if old not in self.tasks: 129 next_tasks = [task for task in self.tasks if task != old] 134 if new in self.tasks [all...] |
/linux-master/kernel/sched/ |
H A D | psi.c | 11 * When CPU, memory and IO are contended, tasks experience delays that 30 * In the SOME state of a given resource, one or more tasks are 32 * perform work, but the CPU may still be executing other tasks. 34 * In the FULL state of a given resource, all non-idle tasks are 48 * FULL means all non-idle tasks in the cgroup are delayed on the CPU 62 * The more tasks and available CPUs there are, the more work can be 65 * tasks and CPUs. 67 * Consider a scenario where 257 number crunching tasks are trying to 75 * Conversely, consider a scenario of 4 tasks and 4 CPUs where at any 76 * given time *one* of the tasks i 221 test_state(unsigned int *tasks, enum psi_states state, bool oncpu) argument 251 unsigned int tasks[NR_PSI_TASK_COUNTS]; local [all...] |
/linux-master/tools/perf/tests/shell/ |
H A D | test_task_analyzer.sh | 86 perf script report task-analyzer --ms --filter-tasks perf --highlight-tasks perf \ 88 check_exec_0 "perf script report task-analyzer --ms --filter-tasks perf --highlight-tasks perf" 95 --limit-to-tasks perf > "$out" 96 check_exec_0 "perf script report task-analyzer --extended-times --time-limit :99999 --limit-to-tasks perf"
|
/linux-master/scripts/gdb/linux/ |
H A D | cpus.py | 16 from linux import tasks, utils namespace 33 return tasks.get_thread_info(tasks.get_task_by_pid(tid))['cpu']
|
H A D | proc.py | 18 from linux import tasks namespace 163 task = tasks.get_task_by_pid(pid)
|
/linux-master/tools/testing/selftests/resctrl/ |
H A D | resctrlfs.c | 501 static int write_pid_to_tasks(char *tasks, pid_t pid) argument 505 fp = fopen(tasks, "w"); 507 ksft_perror("Failed to open tasks file"); 512 ksft_print_msg("Failed to write pid to tasks file\n"); 541 char tasks[1024]; local 553 sprintf(tasks, "%s/tasks", controlgroup); 554 ret = write_pid_to_tasks(tasks, bm_pid); 568 sprintf(tasks, "%s/mon_groups/%s/tasks", [all...] |
/linux-master/drivers/gpu/drm/amd/pm/powerplay/inc/ |
H A D | smu_ucode_xfer_cz.h | 124 SMU_Task tasks[]; member in struct:TOC
|
/linux-master/include/linux/qed/ |
H A D | qed_fcoe_if.h | 84 * @param tasks - qed will fill information about tasks 129 int (*start)(struct qed_dev *cdev, struct qed_fcoe_tid *tasks);
|
H A D | qed_iscsi_if.h | 143 * @param tasks - qed will fill information about tasks 203 struct qed_iscsi_tid *tasks,
|
H A D | qed_nvmetcp_if.h | 123 * @param tasks - qed will fill information about tasks 204 struct qed_nvmetcp_tid *tasks,
|
/linux-master/net/sunrpc/ |
H A D | sched.c | 49 * RPC tasks sit here while waiting for conditions to improve. 199 __rpc_list_enqueue_task(&queue->tasks[queue_priority], task); 213 list_add_tail(&task->u.tk_wait.list, &queue->tasks[0]); 248 for (i = 0; i < ARRAY_SIZE(queue->tasks); i++) 249 INIT_LIST_HEAD(&queue->tasks[i]); 315 * and then waking up all tasks that were sleeping. 378 * By always appending tasks to the list we ensure FIFO behavior. 611 q = &queue->tasks[RPC_NR_PRIORITY - 1]; 618 * Service a batch of tasks from a single owner. 620 q = &queue->tasks[queu [all...] |
/linux-master/kernel/ |
H A D | pid.c | 9 * pid-structures are backing objects for tasks sharing a given ID to chain 11 * parking tasks using given ID's on a list. 51 .tasks = { 270 INIT_HLIST_HEAD(&pid->tasks[type]); 343 hlist_add_head_rcu(&task->pid_links[type], &pid->tasks[type]); 386 struct hlist_head *head1 = &pid1->tasks[PIDTYPE_PID]; 387 struct hlist_head *head2 = &pid2->tasks[PIDTYPE_PID]; 414 first = rcu_dereference_check(hlist_first_rcu(&pid->tasks[type]),
|
/linux-master/sound/pci/cs46xx/ |
H A D | cs46xx_dsp_spos.h | 174 struct dsp_task_descriptor tasks[DSP_MAX_TASK_DESC]; member in struct:dsp_spos_instance
|
/linux-master/init/ |
H A D | init_task.c | 94 .tasks = LIST_HEAD_INIT(init_task.tasks),
|