1 /* delayacct.c - per-task delay accounting
3 * Copyright (C) Shailabh Nagar, IBM Corp. 2006
5 * This program is free software; you can redistribute it and/or modify
6 * it under the terms of the GNU General Public License as published by
7 * the Free Software Foundation; either version 2 of the License, or
8 * (at your option) any later version.
10 * This program is distributed in the hope that it would be useful, but
11 * WITHOUT ANY WARRANTY; without even the implied warranty of
12 * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See
13 * the GNU General Public License for more details.
16 #include <linux/sched.h>
17 #include <linux/slab.h>
18 #include <linux/time.h>
19 #include <linux/sysctl.h>
20 #include <linux/delayacct.h>
22 int delayacct_on __read_mostly = 1; /* Delay accounting turned on/off */
23 struct kmem_cache *delayacct_cache;
25 static int __init delayacct_setup_disable(char *str)
30 __setup("nodelayacct", delayacct_setup_disable);
32 void delayacct_init(void)
34 delayacct_cache = KMEM_CACHE(task_delay_info, SLAB_PANIC);
35 delayacct_tsk_init(&init_task);
38 void __delayacct_tsk_init(struct task_struct *tsk)
40 tsk->delays = kmem_cache_zalloc(delayacct_cache, GFP_KERNEL);
42 spin_lock_init(&tsk->delays->lock);
46 * Start accounting for a delay statistic using
47 * its starting timestamp (@start)
50 static inline void delayacct_start(struct timespec *start)
52 do_posix_clock_monotonic_gettime(start);
56 * Finish delay accounting for a statistic using
57 * its timestamps (@start, @end), accumalator (@total) and @count
60 static void delayacct_end(struct timespec *start, struct timespec *end,
61 u64 *total, u32 *count)
67 do_posix_clock_monotonic_gettime(end);
68 ts = timespec_sub(*end, *start);
69 ns = timespec_to_ns(&ts);
73 spin_lock_irqsave(¤t->delays->lock, flags);
76 spin_unlock_irqrestore(¤t->delays->lock, flags);
79 void __delayacct_blkio_start(void)
81 delayacct_start(¤t->delays->blkio_start);
84 void __delayacct_blkio_end(void)
86 if (current->delays->flags & DELAYACCT_PF_SWAPIN)
87 /* Swapin block I/O */
88 delayacct_end(¤t->delays->blkio_start,
89 ¤t->delays->blkio_end,
90 ¤t->delays->swapin_delay,
91 ¤t->delays->swapin_count);
92 else /* Other block I/O */
93 delayacct_end(¤t->delays->blkio_start,
94 ¤t->delays->blkio_end,
95 ¤t->delays->blkio_delay,
96 ¤t->delays->blkio_count);
99 int __delayacct_add_tsk(struct taskstats *d, struct task_struct *tsk)
103 unsigned long t1,t2,t3;
106 /* Though tsk->delays accessed later, early exit avoids
107 * unnecessary returning of other data
112 tmp = (s64)d->cpu_run_real_total;
113 cputime_to_timespec(tsk->utime + tsk->stime, &ts);
114 tmp += timespec_to_ns(&ts);
115 d->cpu_run_real_total = (tmp < (s64)d->cpu_run_real_total) ? 0 : tmp;
118 * No locking available for sched_info (and too expensive to add one)
119 * Mitigate by taking snapshot of values
121 t1 = tsk->sched_info.pcnt;
122 t2 = tsk->sched_info.run_delay;
123 t3 = tsk->sched_info.cpu_time;
127 jiffies_to_timespec(t2, &ts);
128 tmp = (s64)d->cpu_delay_total + timespec_to_ns(&ts);
129 d->cpu_delay_total = (tmp < (s64)d->cpu_delay_total) ? 0 : tmp;
131 tmp = (s64)d->cpu_run_virtual_total + (s64)jiffies_to_usecs(t3) * 1000;
132 d->cpu_run_virtual_total =
133 (tmp < (s64)d->cpu_run_virtual_total) ? 0 : tmp;
135 /* zero XXX_total, non-zero XXX_count implies XXX stat overflowed */
137 spin_lock_irqsave(&tsk->delays->lock, flags);
138 tmp = d->blkio_delay_total + tsk->delays->blkio_delay;
139 d->blkio_delay_total = (tmp < d->blkio_delay_total) ? 0 : tmp;
140 tmp = d->swapin_delay_total + tsk->delays->swapin_delay;
141 d->swapin_delay_total = (tmp < d->swapin_delay_total) ? 0 : tmp;
142 d->blkio_count += tsk->delays->blkio_count;
143 d->swapin_count += tsk->delays->swapin_count;
144 spin_unlock_irqrestore(&tsk->delays->lock, flags);
150 __u64 __delayacct_blkio_ticks(struct task_struct *tsk)
155 spin_lock_irqsave(&tsk->delays->lock, flags);
156 ret = nsec_to_clock_t(tsk->delays->blkio_delay +
157 tsk->delays->swapin_delay);
158 spin_unlock_irqrestore(&tsk->delays->lock, flags);