Waiman Long | 45e898b | 2015-11-09 19:09:25 -0500 | [diff] [blame^] | 1 | /* |
| 2 | * This program is free software; you can redistribute it and/or modify |
| 3 | * it under the terms of the GNU General Public License as published by |
| 4 | * the Free Software Foundation; either version 2 of the License, or |
| 5 | * (at your option) any later version. |
| 6 | * |
| 7 | * This program is distributed in the hope that it will be useful, |
| 8 | * but WITHOUT ANY WARRANTY; without even the implied warranty of |
| 9 | * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the |
| 10 | * GNU General Public License for more details. |
| 11 | * |
| 12 | * Authors: Waiman Long <waiman.long@hpe.com> |
| 13 | */ |
| 14 | |
| 15 | /* |
| 16 | * When queued spinlock statistical counters are enabled, the following |
| 17 | * debugfs files will be created for reporting the counter values: |
| 18 | * |
| 19 | * <debugfs>/qlockstat/ |
| 20 | * pv_hash_hops - average # of hops per hashing operation |
| 21 | * pv_kick_unlock - # of vCPU kicks issued at unlock time |
| 22 | * pv_kick_wake - # of vCPU kicks used for computing pv_latency_wake |
| 23 | * pv_latency_kick - average latency (ns) of vCPU kick operation |
| 24 | * pv_latency_wake - average latency (ns) from vCPU kick to wakeup |
| 25 | * pv_spurious_wakeup - # of spurious wakeups |
| 26 | * pv_wait_again - # of vCPU wait's that happened after a vCPU kick |
| 27 | * pv_wait_head - # of vCPU wait's at the queue head |
| 28 | * pv_wait_node - # of vCPU wait's at a non-head queue node |
| 29 | * |
| 30 | * Writing to the "reset_counters" file will reset all the above counter |
| 31 | * values. |
| 32 | * |
| 33 | * These statistical counters are implemented as per-cpu variables which are |
| 34 | * summed and computed whenever the corresponding debugfs files are read. This |
| 35 | * minimizes added overhead making the counters usable even in a production |
| 36 | * environment. |
| 37 | * |
| 38 | * There may be slight difference between pv_kick_wake and pv_kick_unlock. |
| 39 | */ |
| 40 | enum qlock_stats { |
| 41 | qstat_pv_hash_hops, |
| 42 | qstat_pv_kick_unlock, |
| 43 | qstat_pv_kick_wake, |
| 44 | qstat_pv_latency_kick, |
| 45 | qstat_pv_latency_wake, |
| 46 | qstat_pv_spurious_wakeup, |
| 47 | qstat_pv_wait_again, |
| 48 | qstat_pv_wait_head, |
| 49 | qstat_pv_wait_node, |
| 50 | qstat_num, /* Total number of statistical counters */ |
| 51 | qstat_reset_cnts = qstat_num, |
| 52 | }; |
| 53 | |
| 54 | #ifdef CONFIG_QUEUED_LOCK_STAT |
| 55 | /* |
| 56 | * Collect pvqspinlock statistics |
| 57 | */ |
| 58 | #include <linux/debugfs.h> |
| 59 | #include <linux/sched.h> |
| 60 | #include <linux/fs.h> |
| 61 | |
| 62 | static const char * const qstat_names[qstat_num + 1] = { |
| 63 | [qstat_pv_hash_hops] = "pv_hash_hops", |
| 64 | [qstat_pv_kick_unlock] = "pv_kick_unlock", |
| 65 | [qstat_pv_kick_wake] = "pv_kick_wake", |
| 66 | [qstat_pv_spurious_wakeup] = "pv_spurious_wakeup", |
| 67 | [qstat_pv_latency_kick] = "pv_latency_kick", |
| 68 | [qstat_pv_latency_wake] = "pv_latency_wake", |
| 69 | [qstat_pv_wait_again] = "pv_wait_again", |
| 70 | [qstat_pv_wait_head] = "pv_wait_head", |
| 71 | [qstat_pv_wait_node] = "pv_wait_node", |
| 72 | [qstat_reset_cnts] = "reset_counters", |
| 73 | }; |
| 74 | |
| 75 | /* |
| 76 | * Per-cpu counters |
| 77 | */ |
| 78 | static DEFINE_PER_CPU(unsigned long, qstats[qstat_num]); |
| 79 | static DEFINE_PER_CPU(u64, pv_kick_time); |
| 80 | |
| 81 | /* |
| 82 | * Function to read and return the qlock statistical counter values |
| 83 | * |
| 84 | * The following counters are handled specially: |
| 85 | * 1. qstat_pv_latency_kick |
| 86 | * Average kick latency (ns) = pv_latency_kick/pv_kick_unlock |
| 87 | * 2. qstat_pv_latency_wake |
| 88 | * Average wake latency (ns) = pv_latency_wake/pv_kick_wake |
| 89 | * 3. qstat_pv_hash_hops |
| 90 | * Average hops/hash = pv_hash_hops/pv_kick_unlock |
| 91 | */ |
| 92 | static ssize_t qstat_read(struct file *file, char __user *user_buf, |
| 93 | size_t count, loff_t *ppos) |
| 94 | { |
| 95 | char buf[64]; |
| 96 | int cpu, counter, len; |
| 97 | u64 stat = 0, kicks = 0; |
| 98 | |
| 99 | /* |
| 100 | * Get the counter ID stored in file->f_inode->i_private |
| 101 | */ |
| 102 | if (!file->f_inode) { |
| 103 | WARN_ON_ONCE(1); |
| 104 | return -EBADF; |
| 105 | } |
| 106 | counter = (long)(file->f_inode->i_private); |
| 107 | |
| 108 | if (counter >= qstat_num) |
| 109 | return -EBADF; |
| 110 | |
| 111 | for_each_possible_cpu(cpu) { |
| 112 | stat += per_cpu(qstats[counter], cpu); |
| 113 | /* |
| 114 | * Need to sum additional counter for some of them |
| 115 | */ |
| 116 | switch (counter) { |
| 117 | |
| 118 | case qstat_pv_latency_kick: |
| 119 | case qstat_pv_hash_hops: |
| 120 | kicks += per_cpu(qstats[qstat_pv_kick_unlock], cpu); |
| 121 | break; |
| 122 | |
| 123 | case qstat_pv_latency_wake: |
| 124 | kicks += per_cpu(qstats[qstat_pv_kick_wake], cpu); |
| 125 | break; |
| 126 | } |
| 127 | } |
| 128 | |
| 129 | if (counter == qstat_pv_hash_hops) { |
| 130 | u64 frac; |
| 131 | |
| 132 | frac = 100ULL * do_div(stat, kicks); |
| 133 | frac = DIV_ROUND_CLOSEST_ULL(frac, kicks); |
| 134 | |
| 135 | /* |
| 136 | * Return a X.XX decimal number |
| 137 | */ |
| 138 | len = snprintf(buf, sizeof(buf) - 1, "%llu.%02llu\n", stat, frac); |
| 139 | } else { |
| 140 | /* |
| 141 | * Round to the nearest ns |
| 142 | */ |
| 143 | if ((counter == qstat_pv_latency_kick) || |
| 144 | (counter == qstat_pv_latency_wake)) { |
| 145 | stat = 0; |
| 146 | if (kicks) |
| 147 | stat = DIV_ROUND_CLOSEST_ULL(stat, kicks); |
| 148 | } |
| 149 | len = snprintf(buf, sizeof(buf) - 1, "%llu\n", stat); |
| 150 | } |
| 151 | |
| 152 | return simple_read_from_buffer(user_buf, count, ppos, buf, len); |
| 153 | } |
| 154 | |
| 155 | /* |
| 156 | * Function to handle write request |
| 157 | * |
| 158 | * When counter = reset_cnts, reset all the counter values. |
| 159 | * Since the counter updates aren't atomic, the resetting is done twice |
| 160 | * to make sure that the counters are very likely to be all cleared. |
| 161 | */ |
| 162 | static ssize_t qstat_write(struct file *file, const char __user *user_buf, |
| 163 | size_t count, loff_t *ppos) |
| 164 | { |
| 165 | int cpu; |
| 166 | |
| 167 | /* |
| 168 | * Get the counter ID stored in file->f_inode->i_private |
| 169 | */ |
| 170 | if (!file->f_inode) { |
| 171 | WARN_ON_ONCE(1); |
| 172 | return -EBADF; |
| 173 | } |
| 174 | if ((long)(file->f_inode->i_private) != qstat_reset_cnts) |
| 175 | return count; |
| 176 | |
| 177 | for_each_possible_cpu(cpu) { |
| 178 | int i; |
| 179 | unsigned long *ptr = per_cpu_ptr(qstats, cpu); |
| 180 | |
| 181 | for (i = 0 ; i < qstat_num; i++) |
| 182 | WRITE_ONCE(ptr[i], 0); |
| 183 | for (i = 0 ; i < qstat_num; i++) |
| 184 | WRITE_ONCE(ptr[i], 0); |
| 185 | } |
| 186 | return count; |
| 187 | } |
| 188 | |
| 189 | /* |
| 190 | * Debugfs data structures |
| 191 | */ |
| 192 | static const struct file_operations fops_qstat = { |
| 193 | .read = qstat_read, |
| 194 | .write = qstat_write, |
| 195 | .llseek = default_llseek, |
| 196 | }; |
| 197 | |
| 198 | /* |
| 199 | * Initialize debugfs for the qspinlock statistical counters |
| 200 | */ |
| 201 | static int __init init_qspinlock_stat(void) |
| 202 | { |
| 203 | struct dentry *d_qstat = debugfs_create_dir("qlockstat", NULL); |
| 204 | int i; |
| 205 | |
| 206 | if (!d_qstat) { |
| 207 | pr_warn("Could not create 'qlockstat' debugfs directory\n"); |
| 208 | return 0; |
| 209 | } |
| 210 | |
| 211 | /* |
| 212 | * Create the debugfs files |
| 213 | * |
| 214 | * As reading from and writing to the stat files can be slow, only |
| 215 | * root is allowed to do the read/write to limit impact to system |
| 216 | * performance. |
| 217 | */ |
| 218 | for (i = 0; i < qstat_num; i++) |
| 219 | debugfs_create_file(qstat_names[i], 0400, d_qstat, |
| 220 | (void *)(long)i, &fops_qstat); |
| 221 | |
| 222 | debugfs_create_file(qstat_names[qstat_reset_cnts], 0200, d_qstat, |
| 223 | (void *)(long)qstat_reset_cnts, &fops_qstat); |
| 224 | return 0; |
| 225 | } |
| 226 | fs_initcall(init_qspinlock_stat); |
| 227 | |
| 228 | /* |
| 229 | * Increment the PV qspinlock statistical counters |
| 230 | */ |
| 231 | static inline void qstat_inc(enum qlock_stats stat, bool cond) |
| 232 | { |
| 233 | if (cond) |
| 234 | this_cpu_inc(qstats[stat]); |
| 235 | } |
| 236 | |
| 237 | /* |
| 238 | * PV hash hop count |
| 239 | */ |
| 240 | static inline void qstat_hop(int hopcnt) |
| 241 | { |
| 242 | this_cpu_add(qstats[qstat_pv_hash_hops], hopcnt); |
| 243 | } |
| 244 | |
| 245 | /* |
| 246 | * Replacement function for pv_kick() |
| 247 | */ |
| 248 | static inline void __pv_kick(int cpu) |
| 249 | { |
| 250 | u64 start = sched_clock(); |
| 251 | |
| 252 | per_cpu(pv_kick_time, cpu) = start; |
| 253 | pv_kick(cpu); |
| 254 | this_cpu_add(qstats[qstat_pv_latency_kick], sched_clock() - start); |
| 255 | } |
| 256 | |
| 257 | /* |
| 258 | * Replacement function for pv_wait() |
| 259 | */ |
| 260 | static inline void __pv_wait(u8 *ptr, u8 val) |
| 261 | { |
| 262 | u64 *pkick_time = this_cpu_ptr(&pv_kick_time); |
| 263 | |
| 264 | *pkick_time = 0; |
| 265 | pv_wait(ptr, val); |
| 266 | if (*pkick_time) { |
| 267 | this_cpu_add(qstats[qstat_pv_latency_wake], |
| 268 | sched_clock() - *pkick_time); |
| 269 | qstat_inc(qstat_pv_kick_wake, true); |
| 270 | } |
| 271 | } |
| 272 | |
| 273 | #define pv_kick(c) __pv_kick(c) |
| 274 | #define pv_wait(p, v) __pv_wait(p, v) |
| 275 | |
| 276 | #else /* CONFIG_QUEUED_LOCK_STAT */ |
| 277 | |
| 278 | static inline void qstat_inc(enum qlock_stats stat, bool cond) { } |
| 279 | static inline void qstat_hop(int hopcnt) { } |
| 280 | |
| 281 | #endif /* CONFIG_QUEUED_LOCK_STAT */ |