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 static void
  32 print_task(struct seq_file *m, struct rq *rq, struct task_struct *p)
  33 {
  34         if (rq->curr == p)
  35                 SEQ_printf(m, "R");
  36         else
  37                 SEQ_printf(m, " ");
  38
  39         SEQ_printf(m, "%15s %5d %15Ld %13Ld %13Ld %9Ld %5d ",
  40                 p->comm, p->pid,
  41                 (long long)p->se.fair_key,
  42                 (long long)(p->se.fair_key - rq->cfs.fair_clock),
  43                 (long long)p->se.wait_runtime,
  44                 (long long)(p->nvcsw + p->nivcsw),
  45                 p->prio);
  46 #ifdef CONFIG_SCHEDSTATS
  47         SEQ_printf(m, "%15Ld %15Ld %15Ld %15Ld %15Ld %15Ld\n",
  48                 (long long)p->se.vruntime,
  49                 (long long)p->se.sum_exec_runtime,
  50                 (long long)p->se.sum_wait_runtime,
  51                 (long long)p->se.sum_sleep_runtime,
  52                 (long long)p->se.wait_runtime_overruns,
  53                 (long long)p->se.wait_runtime_underruns);
  54 #else
  55         SEQ_printf(m, "%15Ld %15Ld %15Ld %15Ld %15Ld\n",
  56                 0LL, 0LL, 0LL, 0LL, 0LL);
  57 #endif
  58 }
  59
  60 static void print_rq(struct seq_file *m, struct rq *rq, int rq_cpu)
  61 {
  62         struct task_struct *g, *p;
  63
  64         SEQ_printf(m,
  65         "\nrunnable tasks:\n"
  66         "            task   PID        tree-key         delta       waiting"
  67         "  switches  prio"
  68         "    exec-runtime        sum-exec        sum-wait       sum-sleep"
  69         "    wait-overrun   wait-underrun\n"
  70         "------------------------------------------------------------------"
  71         "--------------------------------"
  72         "------------------------------------------------"
  73         "--------------------------------\n");
  74
  75         read_lock_irq(&tasklist_lock);
  76
  77         do_each_thread(g, p) {
  78                 if (!p->se.on_rq || task_cpu(p) != rq_cpu)
  79                         continue;
  80
  81                 print_task(m, rq, p);
  82         } while_each_thread(g, p);
  83
  84         read_unlock_irq(&tasklist_lock);
  85 }
  86
  87 static void
  88 print_cfs_rq_runtime_sum(struct seq_file *m, int cpu, struct cfs_rq *cfs_rq)
  89 {
  90         s64 wait_runtime_rq_sum = 0;
  91         struct task_struct *p;
  92         struct rb_node *curr;
  93         unsigned long flags;
  94         struct rq *rq = &per_cpu(runqueues, cpu);
  95
  96         spin_lock_irqsave(&rq->lock, flags);
  97         curr = first_fair(cfs_rq);
  98         while (curr) {
  99                 p = rb_entry(curr, struct task_struct, se.run_node);
 100                 wait_runtime_rq_sum += p->se.wait_runtime;
 101
 102                 curr = rb_next(curr);
 103         }
 104         spin_unlock_irqrestore(&rq->lock, flags);
 105
 106         SEQ_printf(m, "  .%-30s: %Ld\n", "wait_runtime_rq_sum",
 107                 (long long)wait_runtime_rq_sum);
 108 }
 109
 110 void print_cfs_rq(struct seq_file *m, int cpu, struct cfs_rq *cfs_rq)
 111 {
 112         s64 MIN_vruntime = -1, min_vruntime, max_vruntime = -1,
 113                 spread, rq0_min_vruntime, spread0;
 114         struct rq *rq = &per_cpu(runqueues, cpu);
 115         struct sched_entity *last;
 116         unsigned long flags;
 117
 118         SEQ_printf(m, "\ncfs_rq\n");
 119
 120 #define P(x) \
 121         SEQ_printf(m, "  .%-30s: %Ld\n", #x, (long long)(cfs_rq->x))
 122
 123         P(fair_clock);
 124         P(exec_clock);
 125
 126         spin_lock_irqsave(&rq->lock, flags);
 127         if (cfs_rq->rb_leftmost)
 128                 MIN_vruntime = (__pick_next_entity(cfs_rq))->vruntime;
 129         last = __pick_last_entity(cfs_rq);
 130         if (last)
 131                 max_vruntime = last->vruntime;
 132         min_vruntime = rq->cfs.min_vruntime;
 133         rq0_min_vruntime = per_cpu(runqueues, 0).cfs.min_vruntime;
 134         spin_unlock_irqrestore(&rq->lock, flags);
 135         SEQ_printf(m, "  .%-30s: %Ld\n", "MIN_vruntime",
 136                         (long long)MIN_vruntime);
 137         SEQ_printf(m, "  .%-30s: %Ld\n", "min_vruntime",
 138                         (long long)min_vruntime);
 139         SEQ_printf(m, "  .%-30s: %Ld\n", "max_vruntime",
 140                         (long long)max_vruntime);
 141         spread = max_vruntime - MIN_vruntime;
 142         SEQ_printf(m, "  .%-30s: %Ld\n", "spread",
 143                         (long long)spread);
 144         spread0 = min_vruntime - rq0_min_vruntime;
 145         SEQ_printf(m, "  .%-30s: %Ld\n", "spread0",
 146                         (long long)spread0);
 147
 148         P(wait_runtime);
 149         P(wait_runtime_overruns);
 150         P(wait_runtime_underruns);
 151 #undef P
 152
 153         print_cfs_rq_runtime_sum(m, cpu, cfs_rq);
 154 }
 155
 156 static void print_cpu(struct seq_file *m, int cpu)
 157 {
 158         struct rq *rq = &per_cpu(runqueues, cpu);
 159
 160 #ifdef CONFIG_X86
 161         {
 162                 unsigned int freq = cpu_khz ? : 1;
 163
 164                 SEQ_printf(m, "\ncpu#%d, %u.%03u MHz\n",
 165                            cpu, freq / 1000, (freq % 1000));
 166         }
 167 #else
 168         SEQ_printf(m, "\ncpu#%d\n", cpu);
 169 #endif
 170
 171 #define P(x) \
 172         SEQ_printf(m, "  .%-30s: %Ld\n", #x, (long long)(rq->x))
 173
 174         P(nr_running);
 175         SEQ_printf(m, "  .%-30s: %lu\n", "load",
 176                    rq->load.weight);
 177         P(nr_switches);
 178         P(nr_load_updates);
 179         P(nr_uninterruptible);
 180         SEQ_printf(m, "  .%-30s: %lu\n", "jiffies", jiffies);
 181         P(next_balance);
 182         P(curr->pid);
 183         P(clock);
 184         P(idle_clock);
 185         P(prev_clock_raw);
 186         P(clock_warps);
 187         P(clock_overflows);
 188         P(clock_deep_idle_events);
 189         P(clock_max_delta);
 190         P(cpu_load[0]);
 191         P(cpu_load[1]);
 192         P(cpu_load[2]);
 193         P(cpu_load[3]);
 194         P(cpu_load[4]);
 195 #undef P
 196
 197         print_cfs_stats(m, cpu);
 198
 199         print_rq(m, rq, cpu);
 200 }
 201
 202 static int sched_debug_show(struct seq_file *m, void *v)
 203 {
 204         u64 now = ktime_to_ns(ktime_get());
 205         int cpu;
 206
 207         SEQ_printf(m, "Sched Debug Version: v0.05-v20, %s %.*s\n",
 208                 init_utsname()->release,
 209                 (int)strcspn(init_utsname()->version, " "),
 210                 init_utsname()->version);
 211
 212         SEQ_printf(m, "now at %Lu nsecs\n", (unsigned long long)now);
 213
 214         for_each_online_cpu(cpu)
 215                 print_cpu(m, cpu);
 216
 217         SEQ_printf(m, "\n");
 218
 219         return 0;
 220 }
 221
 222 static void sysrq_sched_debug_show(void)
 223 {
 224         sched_debug_show(NULL, NULL);
 225 }
 226
 227 static int sched_debug_open(struct inode *inode, struct file *filp)
 228 {
 229         return single_open(filp, sched_debug_show, NULL);
 230 }
 231
 232 static struct file_operations sched_debug_fops = {
 233         .open           = sched_debug_open,
 234         .read           = seq_read,
 235         .llseek         = seq_lseek,
 236         .release        = single_release,
 237 };
 238
 239 static int __init init_sched_debug_procfs(void)
 240 {
 241         struct proc_dir_entry *pe;
 242
 243         pe = create_proc_entry("sched_debug", 0644, NULL);
 244         if (!pe)
 245                 return -ENOMEM;
 246
 247         pe->proc_fops = &sched_debug_fops;
 248
 249         return 0;
 250 }
 251
 252 __initcall(init_sched_debug_procfs);
 253
 254 void proc_sched_show_task(struct task_struct *p, struct seq_file *m)
 255 {
 256         unsigned long flags;
 257         int num_threads = 1;
 258
 259         rcu_read_lock();
 260         if (lock_task_sighand(p, &flags)) {
 261                 num_threads = atomic_read(&p->signal->count);
 262                 unlock_task_sighand(p, &flags);
 263         }
 264         rcu_read_unlock();
 265
 266         SEQ_printf(m, "%s (%d, #threads: %d)\n", p->comm, p->pid, num_threads);
 267         SEQ_printf(m, "----------------------------------------------\n");
 268 #define P(F) \
 269         SEQ_printf(m, "%-25s:%20Ld\n", #F, (long long)p->F)
 270
 271         P(se.wait_runtime);
 272         P(se.wait_start_fair);
 273         P(se.exec_start);
 274         P(se.vruntime);
 275         P(se.sum_exec_runtime);
 276
 277 #ifdef CONFIG_SCHEDSTATS
 278         P(se.wait_start);
 279         P(se.sleep_start);
 280         P(se.block_start);
 281         P(se.sleep_max);
 282         P(se.block_max);
 283         P(se.exec_max);
 284         P(se.slice_max);
 285         P(se.wait_max);
 286         P(se.wait_runtime_overruns);
 287         P(se.wait_runtime_underruns);
 288         P(se.sum_wait_runtime);
 289 #endif
 290         SEQ_printf(m, "%-25s:%20Ld\n",
 291                    "nr_switches", (long long)(p->nvcsw + p->nivcsw));
 292         P(se.load.weight);
 293         P(policy);
 294         P(prio);
 295 #undef P
 296
 297         {
 298                 u64 t0, t1;
 299
 300                 t0 = sched_clock();
 301                 t1 = sched_clock();
 302                 SEQ_printf(m, "%-25s:%20Ld\n",
 303                            "clock-delta", (long long)(t1-t0));
 304         }
 305 }
 306
 307 void proc_sched_set_task(struct task_struct *p)
 308 {
 309 #ifdef CONFIG_SCHEDSTATS
 310         p->se.sleep_max                 = 0;
 311         p->se.block_max                 = 0;
 312         p->se.exec_max                  = 0;
 313         p->se.slice_max                 = 0;
 314         p->se.wait_max                  = 0;
 315         p->se.wait_runtime_overruns     = 0;
 316         p->se.wait_runtime_underruns    = 0;
 317 #endif
 318         p->se.sum_exec_runtime          = 0;
 319         p->se.prev_sum_exec_runtime     = 0;
 320 }