1 /*
2 * kernel/sched/debug.c
3 *
4 * Print the CFS rbtree
5 *
6 * Copyright(C) 2007, Red Hat, Inc., Ingo Molnar
7 *
8 * This program is free software; you can redistribute it and/or modify
9 * it under the terms of the GNU General Public License version 2 as
10 * published by the Free Software Foundation.
11 */
12
13 #include <linux/proc_fs.h>
14 #include <linux/sched.h>
15 #include <linux/seq_file.h>
16 #include <linux/kallsyms.h>
17 #include <linux/utsname.h>
18 #include <linux/mempolicy.h>
19
20 #include "sched.h"
21
22 static DEFINE_SPINLOCK(sched_debug_lock);
23
24 /*
25 * This allows printing both to /proc/sched_debug and
26 * to the console
27 */
28 #define SEQ_printf(m, x...) \
29 do { \
30 if (m) \
31 seq_printf(m, x); \
32 else \
33 printk(x); \
34 } while (0)
35
36 /*
37 * Ease the printing of nsec fields:
38 */
nsec_high(unsigned long long nsec)39 static long long nsec_high(unsigned long long nsec)
40 {
41 if ((long long)nsec < 0) {
42 nsec = -nsec;
43 do_div(nsec, 1000000);
44 return -nsec;
45 }
46 do_div(nsec, 1000000);
47
48 return nsec;
49 }
50
nsec_low(unsigned long long nsec)51 static unsigned long nsec_low(unsigned long long nsec)
52 {
53 if ((long long)nsec < 0)
54 nsec = -nsec;
55
56 return do_div(nsec, 1000000);
57 }
58
59 #define SPLIT_NS(x) nsec_high(x), nsec_low(x)
60
61 #ifdef CONFIG_FAIR_GROUP_SCHED
print_cfs_group_stats(struct seq_file * m,int cpu,struct task_group * tg)62 static void print_cfs_group_stats(struct seq_file *m, int cpu, struct task_group *tg)
63 {
64 struct sched_entity *se = tg->se[cpu];
65
66 #define P(F) \
67 SEQ_printf(m, " .%-30s: %lld\n", #F, (long long)F)
68 #define PN(F) \
69 SEQ_printf(m, " .%-30s: %lld.%06ld\n", #F, SPLIT_NS((long long)F))
70
71 if (!se)
72 return;
73
74 PN(se->exec_start);
75 PN(se->vruntime);
76 PN(se->sum_exec_runtime);
77 #ifdef CONFIG_SCHEDSTATS
78 PN(se->statistics.wait_start);
79 PN(se->statistics.sleep_start);
80 PN(se->statistics.block_start);
81 PN(se->statistics.sleep_max);
82 PN(se->statistics.block_max);
83 PN(se->statistics.exec_max);
84 PN(se->statistics.slice_max);
85 PN(se->statistics.wait_max);
86 PN(se->statistics.wait_sum);
87 P(se->statistics.wait_count);
88 #endif
89 P(se->load.weight);
90 #ifdef CONFIG_SMP
91 P(se->avg.load_avg);
92 P(se->avg.util_avg);
93 #endif
94 #undef PN
95 #undef P
96 }
97 #endif
98
99 #ifdef CONFIG_CGROUP_SCHED
100 static char group_path[PATH_MAX];
101
task_group_path(struct task_group * tg)102 static char *task_group_path(struct task_group *tg)
103 {
104 if (autogroup_path(tg, group_path, PATH_MAX))
105 return group_path;
106
107 return cgroup_path(tg->css.cgroup, group_path, PATH_MAX);
108 }
109 #endif
110
111 static void
print_task(struct seq_file * m,struct rq * rq,struct task_struct * p)112 print_task(struct seq_file *m, struct rq *rq, struct task_struct *p)
113 {
114 if (rq->curr == p)
115 SEQ_printf(m, "R");
116 else
117 SEQ_printf(m, " ");
118
119 SEQ_printf(m, "%15s %5d %9Ld.%06ld %9Ld %5d ",
120 p->comm, task_pid_nr(p),
121 SPLIT_NS(p->se.vruntime),
122 (long long)(p->nvcsw + p->nivcsw),
123 p->prio);
124 #ifdef CONFIG_SCHEDSTATS
125 SEQ_printf(m, "%9Ld.%06ld %9Ld.%06ld %9Ld.%06ld",
126 SPLIT_NS(p->se.vruntime),
127 SPLIT_NS(p->se.sum_exec_runtime),
128 SPLIT_NS(p->se.statistics.sum_sleep_runtime));
129 #else
130 SEQ_printf(m, "%15Ld %15Ld %15Ld.%06ld %15Ld.%06ld %15Ld.%06ld",
131 0LL, 0LL, 0LL, 0L, 0LL, 0L, 0LL, 0L);
132 #endif
133 #ifdef CONFIG_NUMA_BALANCING
134 SEQ_printf(m, " %d", task_node(p));
135 #endif
136 #ifdef CONFIG_CGROUP_SCHED
137 SEQ_printf(m, " %s", task_group_path(task_group(p)));
138 #endif
139
140 SEQ_printf(m, "\n");
141 }
142
print_rq(struct seq_file * m,struct rq * rq,int rq_cpu)143 static void print_rq(struct seq_file *m, struct rq *rq, int rq_cpu)
144 {
145 struct task_struct *g, *p;
146
147 SEQ_printf(m,
148 "\nrunnable tasks:\n"
149 " task PID tree-key switches prio"
150 " exec-runtime sum-exec sum-sleep\n"
151 "------------------------------------------------------"
152 "----------------------------------------------------\n");
153
154 rcu_read_lock();
155 for_each_process_thread(g, p) {
156 if (task_cpu(p) != rq_cpu)
157 continue;
158
159 print_task(m, rq, p);
160 }
161 rcu_read_unlock();
162 }
163
print_cfs_rq(struct seq_file * m,int cpu,struct cfs_rq * cfs_rq)164 void print_cfs_rq(struct seq_file *m, int cpu, struct cfs_rq *cfs_rq)
165 {
166 s64 MIN_vruntime = -1, min_vruntime, max_vruntime = -1,
167 spread, rq0_min_vruntime, spread0;
168 struct rq *rq = cpu_rq(cpu);
169 struct sched_entity *last;
170 unsigned long flags;
171
172 #ifdef CONFIG_FAIR_GROUP_SCHED
173 SEQ_printf(m, "\ncfs_rq[%d]:%s\n", cpu, task_group_path(cfs_rq->tg));
174 #else
175 SEQ_printf(m, "\ncfs_rq[%d]:\n", cpu);
176 #endif
177 SEQ_printf(m, " .%-30s: %Ld.%06ld\n", "exec_clock",
178 SPLIT_NS(cfs_rq->exec_clock));
179
180 raw_spin_lock_irqsave(&rq->lock, flags);
181 if (cfs_rq->rb_leftmost)
182 MIN_vruntime = (__pick_first_entity(cfs_rq))->vruntime;
183 last = __pick_last_entity(cfs_rq);
184 if (last)
185 max_vruntime = last->vruntime;
186 min_vruntime = cfs_rq->min_vruntime;
187 rq0_min_vruntime = cpu_rq(0)->cfs.min_vruntime;
188 raw_spin_unlock_irqrestore(&rq->lock, flags);
189 SEQ_printf(m, " .%-30s: %Ld.%06ld\n", "MIN_vruntime",
190 SPLIT_NS(MIN_vruntime));
191 SEQ_printf(m, " .%-30s: %Ld.%06ld\n", "min_vruntime",
192 SPLIT_NS(min_vruntime));
193 SEQ_printf(m, " .%-30s: %Ld.%06ld\n", "max_vruntime",
194 SPLIT_NS(max_vruntime));
195 spread = max_vruntime - MIN_vruntime;
196 SEQ_printf(m, " .%-30s: %Ld.%06ld\n", "spread",
197 SPLIT_NS(spread));
198 spread0 = min_vruntime - rq0_min_vruntime;
199 SEQ_printf(m, " .%-30s: %Ld.%06ld\n", "spread0",
200 SPLIT_NS(spread0));
201 SEQ_printf(m, " .%-30s: %d\n", "nr_spread_over",
202 cfs_rq->nr_spread_over);
203 SEQ_printf(m, " .%-30s: %d\n", "nr_running", cfs_rq->nr_running);
204 SEQ_printf(m, " .%-30s: %ld\n", "load", cfs_rq->load.weight);
205 #ifdef CONFIG_SMP
206 SEQ_printf(m, " .%-30s: %lu\n", "load_avg",
207 cfs_rq->avg.load_avg);
208 SEQ_printf(m, " .%-30s: %lu\n", "runnable_load_avg",
209 cfs_rq->runnable_load_avg);
210 SEQ_printf(m, " .%-30s: %lu\n", "util_avg",
211 cfs_rq->avg.util_avg);
212 SEQ_printf(m, " .%-30s: %ld\n", "removed_load_avg",
213 atomic_long_read(&cfs_rq->removed_load_avg));
214 SEQ_printf(m, " .%-30s: %ld\n", "removed_util_avg",
215 atomic_long_read(&cfs_rq->removed_util_avg));
216 #ifdef CONFIG_FAIR_GROUP_SCHED
217 SEQ_printf(m, " .%-30s: %lu\n", "tg_load_avg_contrib",
218 cfs_rq->tg_load_avg_contrib);
219 SEQ_printf(m, " .%-30s: %ld\n", "tg_load_avg",
220 atomic_long_read(&cfs_rq->tg->load_avg));
221 #endif
222 #endif
223 #ifdef CONFIG_CFS_BANDWIDTH
224 SEQ_printf(m, " .%-30s: %d\n", "tg->cfs_bandwidth.timer_active",
225 cfs_rq->tg->cfs_bandwidth.timer_active);
226 SEQ_printf(m, " .%-30s: %d\n", "throttled",
227 cfs_rq->throttled);
228 SEQ_printf(m, " .%-30s: %d\n", "throttle_count",
229 cfs_rq->throttle_count);
230 #endif
231
232 #ifdef CONFIG_FAIR_GROUP_SCHED
233 print_cfs_group_stats(m, cpu, cfs_rq->tg);
234 #endif
235 }
236
print_rt_rq(struct seq_file * m,int cpu,struct rt_rq * rt_rq)237 void print_rt_rq(struct seq_file *m, int cpu, struct rt_rq *rt_rq)
238 {
239 #ifdef CONFIG_RT_GROUP_SCHED
240 SEQ_printf(m, "\nrt_rq[%d]:%s\n", cpu, task_group_path(rt_rq->tg));
241 #else
242 SEQ_printf(m, "\nrt_rq[%d]:\n", cpu);
243 #endif
244
245 #define P(x) \
246 SEQ_printf(m, " .%-30s: %Ld\n", #x, (long long)(rt_rq->x))
247 #define PN(x) \
248 SEQ_printf(m, " .%-30s: %Ld.%06ld\n", #x, SPLIT_NS(rt_rq->x))
249
250 P(rt_nr_running);
251 P(rt_throttled);
252 PN(rt_time);
253 PN(rt_runtime);
254
255 #undef PN
256 #undef P
257 }
258
259 extern __read_mostly int sched_clock_running;
260
print_cpu(struct seq_file * m,int cpu)261 static void print_cpu(struct seq_file *m, int cpu)
262 {
263 struct rq *rq = cpu_rq(cpu);
264 unsigned long flags;
265
266 #ifdef CONFIG_X86
267 {
268 unsigned int freq = cpu_khz ? : 1;
269
270 SEQ_printf(m, "cpu#%d, %u.%03u MHz\n",
271 cpu, freq / 1000, (freq % 1000));
272 }
273 #else
274 SEQ_printf(m, "cpu#%d\n", cpu);
275 #endif
276
277 #define P(x) \
278 do { \
279 if (sizeof(rq->x) == 4) \
280 SEQ_printf(m, " .%-30s: %ld\n", #x, (long)(rq->x)); \
281 else \
282 SEQ_printf(m, " .%-30s: %Ld\n", #x, (long long)(rq->x));\
283 } while (0)
284
285 #define PN(x) \
286 SEQ_printf(m, " .%-30s: %Ld.%06ld\n", #x, SPLIT_NS(rq->x))
287
288 P(nr_running);
289 SEQ_printf(m, " .%-30s: %lu\n", "load",
290 rq->load.weight);
291 P(nr_switches);
292 P(nr_load_updates);
293 P(nr_uninterruptible);
294 PN(next_balance);
295 SEQ_printf(m, " .%-30s: %ld\n", "curr->pid", (long)(task_pid_nr(rq->curr)));
296 PN(clock);
297 P(cpu_load[0]);
298 P(cpu_load[1]);
299 P(cpu_load[2]);
300 P(cpu_load[3]);
301 P(cpu_load[4]);
302 #undef P
303 #undef PN
304
305 #ifdef CONFIG_SCHEDSTATS
306 #define P(n) SEQ_printf(m, " .%-30s: %d\n", #n, rq->n);
307 #define P64(n) SEQ_printf(m, " .%-30s: %Ld\n", #n, rq->n);
308
309 P(yld_count);
310
311 P(sched_count);
312 P(sched_goidle);
313 #ifdef CONFIG_SMP
314 P64(avg_idle);
315 P64(max_idle_balance_cost);
316 #endif
317
318 P(ttwu_count);
319 P(ttwu_local);
320
321 #undef P
322 #undef P64
323 #endif
324 spin_lock_irqsave(&sched_debug_lock, flags);
325 print_cfs_stats(m, cpu);
326 print_rt_stats(m, cpu);
327
328 print_rq(m, rq, cpu);
329 spin_unlock_irqrestore(&sched_debug_lock, flags);
330 SEQ_printf(m, "\n");
331 }
332
333 static const char *sched_tunable_scaling_names[] = {
334 "none",
335 "logaritmic",
336 "linear"
337 };
338
sched_debug_header(struct seq_file * m)339 static void sched_debug_header(struct seq_file *m)
340 {
341 u64 ktime, sched_clk, cpu_clk;
342 unsigned long flags;
343
344 local_irq_save(flags);
345 ktime = ktime_to_ns(ktime_get());
346 sched_clk = sched_clock();
347 cpu_clk = local_clock();
348 local_irq_restore(flags);
349
350 SEQ_printf(m, "Sched Debug Version: v0.11, %s %.*s\n",
351 init_utsname()->release,
352 (int)strcspn(init_utsname()->version, " "),
353 init_utsname()->version);
354
355 #define P(x) \
356 SEQ_printf(m, "%-40s: %Ld\n", #x, (long long)(x))
357 #define PN(x) \
358 SEQ_printf(m, "%-40s: %Ld.%06ld\n", #x, SPLIT_NS(x))
359 PN(ktime);
360 PN(sched_clk);
361 PN(cpu_clk);
362 P(jiffies);
363 #ifdef CONFIG_HAVE_UNSTABLE_SCHED_CLOCK
364 P(sched_clock_stable());
365 #endif
366 #undef PN
367 #undef P
368
369 SEQ_printf(m, "\n");
370 SEQ_printf(m, "sysctl_sched\n");
371
372 #define P(x) \
373 SEQ_printf(m, " .%-40s: %Ld\n", #x, (long long)(x))
374 #define PN(x) \
375 SEQ_printf(m, " .%-40s: %Ld.%06ld\n", #x, SPLIT_NS(x))
376 PN(sysctl_sched_latency);
377 PN(sysctl_sched_min_granularity);
378 PN(sysctl_sched_wakeup_granularity);
379 P(sysctl_sched_child_runs_first);
380 P(sysctl_sched_features);
381 #undef PN
382 #undef P
383
384 SEQ_printf(m, " .%-40s: %d (%s)\n",
385 "sysctl_sched_tunable_scaling",
386 sysctl_sched_tunable_scaling,
387 sched_tunable_scaling_names[sysctl_sched_tunable_scaling]);
388 SEQ_printf(m, "\n");
389 }
390
sched_debug_show(struct seq_file * m,void * v)391 static int sched_debug_show(struct seq_file *m, void *v)
392 {
393 int cpu = (unsigned long)(v - 2);
394
395 if (cpu != -1)
396 print_cpu(m, cpu);
397 else
398 sched_debug_header(m);
399
400 return 0;
401 }
402
sysrq_sched_debug_show(void)403 void sysrq_sched_debug_show(void)
404 {
405 int cpu;
406
407 sched_debug_header(NULL);
408 for_each_online_cpu(cpu)
409 print_cpu(NULL, cpu);
410
411 }
412
413 /*
414 * This itererator needs some explanation.
415 * It returns 1 for the header position.
416 * This means 2 is cpu 0.
417 * In a hotplugged system some cpus, including cpu 0, may be missing so we have
418 * to use cpumask_* to iterate over the cpus.
419 */
sched_debug_start(struct seq_file * file,loff_t * offset)420 static void *sched_debug_start(struct seq_file *file, loff_t *offset)
421 {
422 unsigned long n = *offset;
423
424 if (n == 0)
425 return (void *) 1;
426
427 n--;
428
429 if (n > 0)
430 n = cpumask_next(n - 1, cpu_online_mask);
431 else
432 n = cpumask_first(cpu_online_mask);
433
434 *offset = n + 1;
435
436 if (n < nr_cpu_ids)
437 return (void *)(unsigned long)(n + 2);
438 return NULL;
439 }
440
sched_debug_next(struct seq_file * file,void * data,loff_t * offset)441 static void *sched_debug_next(struct seq_file *file, void *data, loff_t *offset)
442 {
443 (*offset)++;
444 return sched_debug_start(file, offset);
445 }
446
sched_debug_stop(struct seq_file * file,void * data)447 static void sched_debug_stop(struct seq_file *file, void *data)
448 {
449 }
450
451 static const struct seq_operations sched_debug_sops = {
452 .start = sched_debug_start,
453 .next = sched_debug_next,
454 .stop = sched_debug_stop,
455 .show = sched_debug_show,
456 };
457
sched_debug_release(struct inode * inode,struct file * file)458 static int sched_debug_release(struct inode *inode, struct file *file)
459 {
460 seq_release(inode, file);
461
462 return 0;
463 }
464
sched_debug_open(struct inode * inode,struct file * filp)465 static int sched_debug_open(struct inode *inode, struct file *filp)
466 {
467 int ret = 0;
468
469 ret = seq_open(filp, &sched_debug_sops);
470
471 return ret;
472 }
473
474 static const struct file_operations sched_debug_fops = {
475 .open = sched_debug_open,
476 .read = seq_read,
477 .llseek = seq_lseek,
478 .release = sched_debug_release,
479 };
480
init_sched_debug_procfs(void)481 static int __init init_sched_debug_procfs(void)
482 {
483 struct proc_dir_entry *pe;
484
485 pe = proc_create("sched_debug", 0444, NULL, &sched_debug_fops);
486 if (!pe)
487 return -ENOMEM;
488 return 0;
489 }
490
491 __initcall(init_sched_debug_procfs);
492
493 #define __P(F) \
494 SEQ_printf(m, "%-45s:%21Ld\n", #F, (long long)F)
495 #define P(F) \
496 SEQ_printf(m, "%-45s:%21Ld\n", #F, (long long)p->F)
497 #define __PN(F) \
498 SEQ_printf(m, "%-45s:%14Ld.%06ld\n", #F, SPLIT_NS((long long)F))
499 #define PN(F) \
500 SEQ_printf(m, "%-45s:%14Ld.%06ld\n", #F, SPLIT_NS((long long)p->F))
501
502
sched_show_numa(struct task_struct * p,struct seq_file * m)503 static void sched_show_numa(struct task_struct *p, struct seq_file *m)
504 {
505 #ifdef CONFIG_NUMA_BALANCING
506 struct mempolicy *pol;
507 int node, i;
508
509 if (p->mm)
510 P(mm->numa_scan_seq);
511
512 task_lock(p);
513 pol = p->mempolicy;
514 if (pol && !(pol->flags & MPOL_F_MORON))
515 pol = NULL;
516 mpol_get(pol);
517 task_unlock(p);
518
519 SEQ_printf(m, "numa_migrations, %ld\n", xchg(&p->numa_pages_migrated, 0));
520
521 for_each_online_node(node) {
522 for (i = 0; i < 2; i++) {
523 unsigned long nr_faults = -1;
524 int cpu_current, home_node;
525
526 if (p->numa_faults_memory)
527 nr_faults = p->numa_faults_memory[2*node + i];
528
529 cpu_current = !i ? (task_node(p) == node) :
530 (pol && node_isset(node, pol->v.nodes));
531
532 home_node = (p->numa_preferred_nid == node);
533
534 SEQ_printf(m, "numa_faults_memory, %d, %d, %d, %d, %ld\n",
535 i, node, cpu_current, home_node, nr_faults);
536 }
537 }
538
539 mpol_put(pol);
540 #endif
541 }
542
proc_sched_show_task(struct task_struct * p,struct seq_file * m)543 void proc_sched_show_task(struct task_struct *p, struct seq_file *m)
544 {
545 unsigned long nr_switches;
546
547 SEQ_printf(m, "%s (%d, #threads: %d)\n", p->comm, task_pid_nr(p),
548 get_nr_threads(p));
549 SEQ_printf(m,
550 "---------------------------------------------------------"
551 "----------\n");
552 #define __P(F) \
553 SEQ_printf(m, "%-45s:%21Ld\n", #F, (long long)F)
554 #define P(F) \
555 SEQ_printf(m, "%-45s:%21Ld\n", #F, (long long)p->F)
556 #define __PN(F) \
557 SEQ_printf(m, "%-45s:%14Ld.%06ld\n", #F, SPLIT_NS((long long)F))
558 #define PN(F) \
559 SEQ_printf(m, "%-45s:%14Ld.%06ld\n", #F, SPLIT_NS((long long)p->F))
560
561 PN(se.exec_start);
562 PN(se.vruntime);
563 PN(se.sum_exec_runtime);
564
565 nr_switches = p->nvcsw + p->nivcsw;
566
567 #ifdef CONFIG_SCHEDSTATS
568 PN(se.statistics.wait_start);
569 PN(se.statistics.sleep_start);
570 PN(se.statistics.block_start);
571 PN(se.statistics.sleep_max);
572 PN(se.statistics.block_max);
573 PN(se.statistics.exec_max);
574 PN(se.statistics.slice_max);
575 PN(se.statistics.wait_max);
576 PN(se.statistics.wait_sum);
577 P(se.statistics.wait_count);
578 PN(se.statistics.iowait_sum);
579 P(se.statistics.iowait_count);
580 P(se.nr_migrations);
581 P(se.statistics.nr_migrations_cold);
582 P(se.statistics.nr_failed_migrations_affine);
583 P(se.statistics.nr_failed_migrations_running);
584 P(se.statistics.nr_failed_migrations_hot);
585 P(se.statistics.nr_forced_migrations);
586 P(se.statistics.nr_wakeups);
587 P(se.statistics.nr_wakeups_sync);
588 P(se.statistics.nr_wakeups_migrate);
589 P(se.statistics.nr_wakeups_local);
590 P(se.statistics.nr_wakeups_remote);
591 P(se.statistics.nr_wakeups_affine);
592 P(se.statistics.nr_wakeups_affine_attempts);
593 P(se.statistics.nr_wakeups_passive);
594 P(se.statistics.nr_wakeups_idle);
595
596 {
597 u64 avg_atom, avg_per_cpu;
598
599 avg_atom = p->se.sum_exec_runtime;
600 if (nr_switches)
601 avg_atom = div64_ul(avg_atom, nr_switches);
602 else
603 avg_atom = -1LL;
604
605 avg_per_cpu = p->se.sum_exec_runtime;
606 if (p->se.nr_migrations) {
607 avg_per_cpu = div64_u64(avg_per_cpu,
608 p->se.nr_migrations);
609 } else {
610 avg_per_cpu = -1LL;
611 }
612
613 __PN(avg_atom);
614 __PN(avg_per_cpu);
615 }
616 #endif
617 __P(nr_switches);
618 SEQ_printf(m, "%-45s:%21Ld\n",
619 "nr_voluntary_switches", (long long)p->nvcsw);
620 SEQ_printf(m, "%-45s:%21Ld\n",
621 "nr_involuntary_switches", (long long)p->nivcsw);
622
623 P(se.load.weight);
624 #ifdef CONFIG_SMP
625 P(se.avg.load_sum);
626 P(se.avg.util_sum);
627 P(se.avg.load_avg);
628 P(se.avg.util_avg);
629 P(se.avg.last_update_time);
630 #endif
631 P(policy);
632 P(prio);
633 #undef PN
634 #undef __PN
635 #undef P
636 #undef __P
637
638 {
639 unsigned int this_cpu = raw_smp_processor_id();
640 u64 t0, t1;
641
642 t0 = cpu_clock(this_cpu);
643 t1 = cpu_clock(this_cpu);
644 SEQ_printf(m, "%-45s:%21Ld\n",
645 "clock-delta", (long long)(t1-t0));
646 }
647
648 sched_show_numa(p, m);
649 }
650
proc_sched_set_task(struct task_struct * p)651 void proc_sched_set_task(struct task_struct *p)
652 {
653 #ifdef CONFIG_SCHEDSTATS
654 memset(&p->se.statistics, 0, sizeof(p->se.statistics));
655 #endif
656 }
657