qspinlock_stat.h 7.7 KB

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