SAFE public projects git trees. - safe/jmp/linux-2.6/blob - kernel/sched_debug.c

   1 /*
   2  * kernel/time/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
  19 /*
  20  * This allows printing both to /proc/sched_debug and
  21  * to the console
  22  */
  23 #define SEQ_printf(m, x...)                     \
  24  do {                                           \
  25         if (m)                                  \
  26                 seq_printf(m, x);               \
  27         else                                    \
  28                 printk(x);                      \
  29  } while (0)
  30
  31 /*
  32  * Ease the printing of nsec fields:
  33  */
  34 static long long nsec_high(unsigned long long nsec)
  35 {
  36         if ((long long)nsec < 0) {
  37                 nsec = -nsec;
  38                 do_div(nsec, 1000000);
  39                 return -nsec;
  40         }
  41         do_div(nsec, 1000000);
  42
  43         return nsec;
  44 }
  45
  46 static unsigned long nsec_low(unsigned long long nsec)
  47 {
  48         if ((long long)nsec < 0)
  49                 nsec = -nsec;
  50
  51         return do_div(nsec, 1000000);
  52 }
  53
  54 #define SPLIT_NS(x) nsec_high(x), nsec_low(x)
  55
  56 static void
  57 print_task(struct seq_file *m, struct rq *rq, struct task_struct *p)
  58 {
  59         if (rq->curr == p)
  60                 SEQ_printf(m, "R");
  61         else
  62                 SEQ_printf(m, " ");
  63
  64         SEQ_printf(m, "%15s %5d %9Ld.%06ld %9Ld %5d ",
  65                 p->comm, p->pid,
  66                 SPLIT_NS(p->se.vruntime),
  67                 (long long)(p->nvcsw + p->nivcsw),
  68                 p->prio);
  69 #ifdef CONFIG_SCHEDSTATS
  70         SEQ_printf(m, "%9Ld.%06ld %9Ld.%06ld %9Ld.%06ld",
  71                 SPLIT_NS(p->se.vruntime),
  72                 SPLIT_NS(p->se.sum_exec_runtime),
  73                 SPLIT_NS(p->se.sum_sleep_runtime));
  74 #else
  75         SEQ_printf(m, "%15Ld %15Ld %15Ld.%06ld %15Ld.%06ld %15Ld.%06ld",
  76                 0LL, 0LL, 0LL, 0L, 0LL, 0L, 0LL, 0L);
  77 #endif
  78
  79 #ifdef CONFIG_CGROUP_SCHED
  80         {
  81                 char path[64];
  82
  83                 cgroup_path(task_group(p)->css.cgroup, path, sizeof(path));
  84                 SEQ_printf(m, " %s", path);
  85         }
  86 #endif
  87         SEQ_printf(m, "\n");
  88 }
  89
  90 static void print_rq(struct seq_file *m, struct rq *rq, int rq_cpu)
  91 {
  92         struct task_struct *g, *p;
  93         unsigned long flags;
  94
  95         SEQ_printf(m,
  96         "\nrunnable tasks:\n"
  97         "            task   PID         tree-key  switches  prio"
  98         "     exec-runtime         sum-exec        sum-sleep\n"
  99         "------------------------------------------------------"
 100         "----------------------------------------------------\n");
 101
 102         read_lock_irqsave(&tasklist_lock, flags);
 103
 104         do_each_thread(g, p) {
 105                 if (!p->se.on_rq || task_cpu(p) != rq_cpu)
 106                         continue;
 107
 108                 print_task(m, rq, p);
 109         } while_each_thread(g, p);
 110
 111         read_unlock_irqrestore(&tasklist_lock, flags);
 112 }
 113
 114 void print_cfs_rq(struct seq_file *m, int cpu, struct cfs_rq *cfs_rq)
 115 {
 116         s64 MIN_vruntime = -1, min_vruntime, max_vruntime = -1,
 117                 spread, rq0_min_vruntime, spread0;
 118         struct rq *rq = &per_cpu(runqueues, cpu);
 119         struct sched_entity *last;
 120         unsigned long flags;
 121
 122 #if defined(CONFIG_CGROUP_SCHED) && defined(CONFIG_FAIR_GROUP_SCHED)
 123         char path[128] = "";
 124         struct task_group *tg = cfs_rq->tg;
 125
 126         cgroup_path(tg->css.cgroup, path, sizeof(path));
 127
 128         SEQ_printf(m, "\ncfs_rq[%d]:%s\n", cpu, path);
 129 #else
 130         SEQ_printf(m, "\ncfs_rq[%d]:\n", cpu);
 131 #endif
 132
 133         SEQ_printf(m, "  .%-30s: %Ld.%06ld\n", "exec_clock",
 134                         SPLIT_NS(cfs_rq->exec_clock));
 135
 136         spin_lock_irqsave(&rq->lock, flags);
 137         if (cfs_rq->rb_leftmost)
 138                 MIN_vruntime = (__pick_next_entity(cfs_rq))->vruntime;
 139         last = __pick_last_entity(cfs_rq);
 140         if (last)
 141                 max_vruntime = last->vruntime;
 142         min_vruntime = rq->cfs.min_vruntime;
 143         rq0_min_vruntime = per_cpu(runqueues, 0).cfs.min_vruntime;
 144         spin_unlock_irqrestore(&rq->lock, flags);
 145         SEQ_printf(m, "  .%-30s: %Ld.%06ld\n", "MIN_vruntime",
 146                         SPLIT_NS(MIN_vruntime));
 147         SEQ_printf(m, "  .%-30s: %Ld.%06ld\n", "min_vruntime",
 148                         SPLIT_NS(min_vruntime));
 149         SEQ_printf(m, "  .%-30s: %Ld.%06ld\n", "max_vruntime",
 150                         SPLIT_NS(max_vruntime));
 151         spread = max_vruntime - MIN_vruntime;
 152         SEQ_printf(m, "  .%-30s: %Ld.%06ld\n", "spread",
 153                         SPLIT_NS(spread));
 154         spread0 = min_vruntime - rq0_min_vruntime;
 155         SEQ_printf(m, "  .%-30s: %Ld.%06ld\n", "spread0",
 156                         SPLIT_NS(spread0));
 157         SEQ_printf(m, "  .%-30s: %ld\n", "nr_running", cfs_rq->nr_running);
 158         SEQ_printf(m, "  .%-30s: %ld\n", "load", cfs_rq->load.weight);
 159 #ifdef CONFIG_SCHEDSTATS
 160 #define P(n) SEQ_printf(m, "  .%-30s: %d\n", #n, rq->n);
 161
 162         P(yld_exp_empty);
 163         P(yld_act_empty);
 164         P(yld_both_empty);
 165         P(yld_count);
 166
 167         P(sched_switch);
 168         P(sched_count);
 169         P(sched_goidle);
 170
 171         P(ttwu_count);
 172         P(ttwu_local);
 173
 174         P(bkl_count);
 175
 176 #undef P
 177 #endif
 178         SEQ_printf(m, "  .%-30s: %ld\n", "nr_spread_over",
 179                         cfs_rq->nr_spread_over);
 180 #ifdef CONFIG_FAIR_GROUP_SCHED
 181 #ifdef CONFIG_SMP
 182         SEQ_printf(m, "  .%-30s: %lu\n", "shares", cfs_rq->shares);
 183 #endif
 184 #endif
 185 }
 186
 187 void print_rt_rq(struct seq_file *m, int cpu, struct rt_rq *rt_rq)
 188 {
 189 #if defined(CONFIG_CGROUP_SCHED) && defined(CONFIG_RT_GROUP_SCHED)
 190         char path[128] = "";
 191         struct task_group *tg = rt_rq->tg;
 192
 193         cgroup_path(tg->css.cgroup, path, sizeof(path));
 194
 195         SEQ_printf(m, "\nrt_rq[%d]:%s\n", cpu, path);
 196 #else
 197         SEQ_printf(m, "\nrt_rq[%d]:\n", cpu);
 198 #endif
 199
 200
 201 #define P(x) \
 202         SEQ_printf(m, "  .%-30s: %Ld\n", #x, (long long)(rt_rq->x))
 203 #define PN(x) \
 204         SEQ_printf(m, "  .%-30s: %Ld.%06ld\n", #x, SPLIT_NS(rt_rq->x))
 205
 206         P(rt_nr_running);
 207         P(rt_throttled);
 208         PN(rt_time);
 209         PN(rt_runtime);
 210
 211 #undef PN
 212 #undef P
 213 }
 214
 215 static void print_cpu(struct seq_file *m, int cpu)
 216 {
 217         struct rq *rq = &per_cpu(runqueues, cpu);
 218
 219 #ifdef CONFIG_X86
 220         {
 221                 unsigned int freq = cpu_khz ? : 1;
 222
 223                 SEQ_printf(m, "\ncpu#%d, %u.%03u MHz\n",
 224                            cpu, freq / 1000, (freq % 1000));
 225         }
 226 #else
 227         SEQ_printf(m, "\ncpu#%d\n", cpu);
 228 #endif
 229
 230 #define P(x) \
 231         SEQ_printf(m, "  .%-30s: %Ld\n", #x, (long long)(rq->x))
 232 #define PN(x) \
 233         SEQ_printf(m, "  .%-30s: %Ld.%06ld\n", #x, SPLIT_NS(rq->x))
 234
 235         P(nr_running);
 236         SEQ_printf(m, "  .%-30s: %lu\n", "load",
 237                    rq->load.weight);
 238         P(nr_switches);
 239         P(nr_load_updates);
 240         P(nr_uninterruptible);
 241         SEQ_printf(m, "  .%-30s: %lu\n", "jiffies", jiffies);
 242         PN(next_balance);
 243         P(curr->pid);
 244         PN(clock);
 245         P(cpu_load[0]);
 246         P(cpu_load[1]);
 247         P(cpu_load[2]);
 248         P(cpu_load[3]);
 249         P(cpu_load[4]);
 250 #undef P
 251 #undef PN
 252
 253         print_cfs_stats(m, cpu);
 254         print_rt_stats(m, cpu);
 255
 256         print_rq(m, rq, cpu);
 257 }
 258
 259 static int sched_debug_show(struct seq_file *m, void *v)
 260 {
 261         u64 now = ktime_to_ns(ktime_get());
 262         int cpu;
 263
 264         SEQ_printf(m, "Sched Debug Version: v0.07, %s %.*s\n",
 265                 init_utsname()->release,
 266                 (int)strcspn(init_utsname()->version, " "),
 267                 init_utsname()->version);
 268
 269         SEQ_printf(m, "now at %Lu.%06ld msecs\n", SPLIT_NS(now));
 270
 271 #define P(x) \
 272         SEQ_printf(m, "  .%-40s: %Ld\n", #x, (long long)(x))
 273 #define PN(x) \
 274         SEQ_printf(m, "  .%-40s: %Ld.%06ld\n", #x, SPLIT_NS(x))
 275         PN(sysctl_sched_latency);
 276         PN(sysctl_sched_min_granularity);
 277         PN(sysctl_sched_wakeup_granularity);
 278         PN(sysctl_sched_child_runs_first);
 279         P(sysctl_sched_features);
 280 #undef PN
 281 #undef P
 282
 283         for_each_online_cpu(cpu)
 284                 print_cpu(m, cpu);
 285
 286         SEQ_printf(m, "\n");
 287
 288         return 0;
 289 }
 290
 291 static void sysrq_sched_debug_show(void)
 292 {
 293         sched_debug_show(NULL, NULL);
 294 }
 295
 296 static int sched_debug_open(struct inode *inode, struct file *filp)
 297 {
 298         return single_open(filp, sched_debug_show, NULL);
 299 }
 300
 301 static const struct file_operations sched_debug_fops = {
 302         .open           = sched_debug_open,
 303         .read           = seq_read,
 304         .llseek         = seq_lseek,
 305         .release        = single_release,
 306 };
 307
 308 static int __init init_sched_debug_procfs(void)
 309 {
 310         struct proc_dir_entry *pe;
 311
 312         pe = proc_create("sched_debug", 0444, NULL, &sched_debug_fops);
 313         if (!pe)
 314                 return -ENOMEM;
 315         return 0;
 316 }
 317
 318 __initcall(init_sched_debug_procfs);
 319
 320 void proc_sched_show_task(struct task_struct *p, struct seq_file *m)
 321 {
 322         unsigned long nr_switches;
 323         unsigned long flags;
 324         int num_threads = 1;
 325
 326         if (lock_task_sighand(p, &flags)) {
 327                 num_threads = atomic_read(&p->signal->count);
 328                 unlock_task_sighand(p, &flags);
 329         }
 330
 331         SEQ_printf(m, "%s (%d, #threads: %d)\n", p->comm, p->pid, num_threads);
 332         SEQ_printf(m,
 333                 "---------------------------------------------------------\n");
 334 #define __P(F) \
 335         SEQ_printf(m, "%-35s:%21Ld\n", #F, (long long)F)
 336 #define P(F) \
 337         SEQ_printf(m, "%-35s:%21Ld\n", #F, (long long)p->F)
 338 #define __PN(F) \
 339         SEQ_printf(m, "%-35s:%14Ld.%06ld\n", #F, SPLIT_NS((long long)F))
 340 #define PN(F) \
 341         SEQ_printf(m, "%-35s:%14Ld.%06ld\n", #F, SPLIT_NS((long long)p->F))
 342
 343         PN(se.exec_start);
 344         PN(se.vruntime);
 345         PN(se.sum_exec_runtime);
 346         PN(se.avg_overlap);
 347
 348         nr_switches = p->nvcsw + p->nivcsw;
 349
 350 #ifdef CONFIG_SCHEDSTATS
 351         PN(se.wait_start);
 352         PN(se.sleep_start);
 353         PN(se.block_start);
 354         PN(se.sleep_max);
 355         PN(se.block_max);
 356         PN(se.exec_max);
 357         PN(se.slice_max);
 358         PN(se.wait_max);
 359         PN(se.wait_sum);
 360         P(se.wait_count);
 361         P(sched_info.bkl_count);
 362         P(se.nr_migrations);
 363         P(se.nr_migrations_cold);
 364         P(se.nr_failed_migrations_affine);
 365         P(se.nr_failed_migrations_running);
 366         P(se.nr_failed_migrations_hot);
 367         P(se.nr_forced_migrations);
 368         P(se.nr_forced2_migrations);
 369         P(se.nr_wakeups);
 370         P(se.nr_wakeups_sync);
 371         P(se.nr_wakeups_migrate);
 372         P(se.nr_wakeups_local);
 373         P(se.nr_wakeups_remote);
 374         P(se.nr_wakeups_affine);
 375         P(se.nr_wakeups_affine_attempts);
 376         P(se.nr_wakeups_passive);
 377         P(se.nr_wakeups_idle);
 378
 379         {
 380                 u64 avg_atom, avg_per_cpu;
 381
 382                 avg_atom = p->se.sum_exec_runtime;
 383                 if (nr_switches)
 384                         do_div(avg_atom, nr_switches);
 385                 else
 386                         avg_atom = -1LL;
 387
 388                 avg_per_cpu = p->se.sum_exec_runtime;
 389                 if (p->se.nr_migrations) {
 390                         avg_per_cpu = div64_u64(avg_per_cpu,
 391                                                 p->se.nr_migrations);
 392                 } else {
 393                         avg_per_cpu = -1LL;
 394                 }
 395
 396                 __PN(avg_atom);
 397                 __PN(avg_per_cpu);
 398         }
 399 #endif
 400         __P(nr_switches);
 401         SEQ_printf(m, "%-35s:%21Ld\n",
 402                    "nr_voluntary_switches", (long long)p->nvcsw);
 403         SEQ_printf(m, "%-35s:%21Ld\n",
 404                    "nr_involuntary_switches", (long long)p->nivcsw);
 405
 406         P(se.load.weight);
 407         P(policy);
 408         P(prio);
 409 #undef PN
 410 #undef __PN
 411 #undef P
 412 #undef __P
 413
 414         {
 415                 u64 t0, t1;
 416
 417                 t0 = sched_clock();
 418                 t1 = sched_clock();
 419                 SEQ_printf(m, "%-35s:%21Ld\n",
 420                            "clock-delta", (long long)(t1-t0));
 421         }
 422 }
 423
 424 void proc_sched_set_task(struct task_struct *p)
 425 {
 426 #ifdef CONFIG_SCHEDSTATS
 427         p->se.wait_max                          = 0;
 428         p->se.wait_sum                          = 0;
 429         p->se.wait_count                        = 0;
 430         p->se.sleep_max                         = 0;
 431         p->se.sum_sleep_runtime                 = 0;
 432         p->se.block_max                         = 0;
 433         p->se.exec_max                          = 0;
 434         p->se.slice_max                         = 0;
 435         p->se.nr_migrations                     = 0;
 436         p->se.nr_migrations_cold                = 0;
 437         p->se.nr_failed_migrations_affine       = 0;
 438         p->se.nr_failed_migrations_running      = 0;
 439         p->se.nr_failed_migrations_hot          = 0;
 440         p->se.nr_forced_migrations              = 0;
 441         p->se.nr_forced2_migrations             = 0;
 442         p->se.nr_wakeups                        = 0;
 443         p->se.nr_wakeups_sync                   = 0;
 444         p->se.nr_wakeups_migrate                = 0;
 445         p->se.nr_wakeups_local                  = 0;
 446         p->se.nr_wakeups_remote                 = 0;
 447         p->se.nr_wakeups_affine                 = 0;
 448         p->se.nr_wakeups_affine_attempts        = 0;
 449         p->se.nr_wakeups_passive                = 0;
 450         p->se.nr_wakeups_idle                   = 0;
 451         p->sched_info.bkl_count                 = 0;
 452 #endif
 453         p->se.sum_exec_runtime                  = 0;
 454         p->se.prev_sum_exec_runtime             = 0;
 455         p->nvcsw                                = 0;
 456         p->nivcsw                               = 0;
 457 }