1 | /* |
2 | * Copyright (c) 2006 Oracle. All rights reserved. |
3 | * |
4 | * This software is available to you under a choice of one of two |
5 | * licenses. You may choose to be licensed under the terms of the GNU |
6 | * General Public License (GPL) Version 2, available from the file |
7 | * COPYING in the main directory of this source tree, or the |
8 | * OpenIB.org BSD license below: |
9 | * |
10 | * Redistribution and use in source and binary forms, with or |
11 | * without modification, are permitted provided that the following |
12 | * conditions are met: |
13 | * |
14 | * - Redistributions of source code must retain the above |
15 | * copyright notice, this list of conditions and the following |
16 | * disclaimer. |
17 | * |
18 | * - Redistributions in binary form must reproduce the above |
19 | * copyright notice, this list of conditions and the following |
20 | * disclaimer in the documentation and/or other materials |
21 | * provided with the distribution. |
22 | * |
23 | * THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, |
24 | * EXPRESS OR IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF |
25 | * MERCHANTABILITY, FITNESS FOR A PARTICULAR PURPOSE AND |
26 | * NONINFRINGEMENT. IN NO EVENT SHALL THE AUTHORS OR COPYRIGHT HOLDERS |
27 | * BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER LIABILITY, WHETHER IN AN |
28 | * ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM, OUT OF OR IN |
29 | * CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN THE |
30 | * SOFTWARE. |
31 | * |
32 | */ |
33 | #include <linux/percpu.h> |
34 | #include <linux/seq_file.h> |
35 | #include <linux/proc_fs.h> |
36 | #include <linux/export.h> |
37 | |
38 | #include "rds.h" |
39 | |
40 | DEFINE_PER_CPU_SHARED_ALIGNED(struct rds_statistics, rds_stats); |
41 | EXPORT_PER_CPU_SYMBOL_GPL(rds_stats); |
42 | |
43 | /* :.,$s/unsigned long\>.*\<s_\(.*\);/"\1",/g */ |
44 | |
45 | static const char *const rds_stat_names[] = { |
46 | "conn_reset" , |
47 | "recv_drop_bad_checksum" , |
48 | "recv_drop_old_seq" , |
49 | "recv_drop_no_sock" , |
50 | "recv_drop_dead_sock" , |
51 | "recv_deliver_raced" , |
52 | "recv_delivered" , |
53 | "recv_queued" , |
54 | "recv_immediate_retry" , |
55 | "recv_delayed_retry" , |
56 | "recv_ack_required" , |
57 | "recv_rdma_bytes" , |
58 | "recv_ping" , |
59 | "send_queue_empty" , |
60 | "send_queue_full" , |
61 | "send_lock_contention" , |
62 | "send_lock_queue_raced" , |
63 | "send_immediate_retry" , |
64 | "send_delayed_retry" , |
65 | "send_drop_acked" , |
66 | "send_ack_required" , |
67 | "send_queued" , |
68 | "send_rdma" , |
69 | "send_rdma_bytes" , |
70 | "send_pong" , |
71 | "page_remainder_hit" , |
72 | "page_remainder_miss" , |
73 | "copy_to_user" , |
74 | "copy_from_user" , |
75 | "cong_update_queued" , |
76 | "cong_update_received" , |
77 | "cong_send_error" , |
78 | "cong_send_blocked" , |
79 | "recv_bytes_added_to_sock" , |
80 | "recv_bytes_freed_fromsock" , |
81 | "send_stuck_rm" , |
82 | }; |
83 | |
84 | void rds_stats_info_copy(struct rds_info_iterator *iter, |
85 | uint64_t *values, const char *const *names, size_t nr) |
86 | { |
87 | struct rds_info_counter ctr; |
88 | size_t i; |
89 | |
90 | for (i = 0; i < nr; i++) { |
91 | BUG_ON(strlen(names[i]) >= sizeof(ctr.name)); |
92 | strncpy(p: ctr.name, q: names[i], size: sizeof(ctr.name) - 1); |
93 | ctr.name[sizeof(ctr.name) - 1] = '\0'; |
94 | ctr.value = values[i]; |
95 | |
96 | rds_info_copy(iter, data: &ctr, bytes: sizeof(ctr)); |
97 | } |
98 | } |
99 | EXPORT_SYMBOL_GPL(rds_stats_info_copy); |
100 | |
101 | /* |
102 | * This gives global counters across all the transports. The strings |
103 | * are copied in so that the tool doesn't need knowledge of the specific |
104 | * stats that we're exporting. Some are pretty implementation dependent |
105 | * and may change over time. That doesn't stop them from being useful. |
106 | * |
107 | * This is the only function in the chain that knows about the byte granular |
108 | * length in userspace. It converts it to number of stat entries that the |
109 | * rest of the functions operate in. |
110 | */ |
111 | static void rds_stats_info(struct socket *sock, unsigned int len, |
112 | struct rds_info_iterator *iter, |
113 | struct rds_info_lengths *lens) |
114 | { |
115 | struct rds_statistics stats = {0, }; |
116 | uint64_t *src; |
117 | uint64_t *sum; |
118 | size_t i; |
119 | int cpu; |
120 | unsigned int avail; |
121 | |
122 | avail = len / sizeof(struct rds_info_counter); |
123 | |
124 | if (avail < ARRAY_SIZE(rds_stat_names)) { |
125 | avail = 0; |
126 | goto trans; |
127 | } |
128 | |
129 | for_each_online_cpu(cpu) { |
130 | src = (uint64_t *)&(per_cpu(rds_stats, cpu)); |
131 | sum = (uint64_t *)&stats; |
132 | for (i = 0; i < sizeof(stats) / sizeof(uint64_t); i++) |
133 | *(sum++) += *(src++); |
134 | } |
135 | |
136 | rds_stats_info_copy(iter, (uint64_t *)&stats, rds_stat_names, |
137 | ARRAY_SIZE(rds_stat_names)); |
138 | avail -= ARRAY_SIZE(rds_stat_names); |
139 | |
140 | trans: |
141 | lens->each = sizeof(struct rds_info_counter); |
142 | lens->nr = rds_trans_stats_info_copy(iter, avail) + |
143 | ARRAY_SIZE(rds_stat_names); |
144 | } |
145 | |
146 | void rds_stats_exit(void) |
147 | { |
148 | rds_info_deregister_func(RDS_INFO_COUNTERS, func: rds_stats_info); |
149 | } |
150 | |
151 | int rds_stats_init(void) |
152 | { |
153 | rds_info_register_func(RDS_INFO_COUNTERS, func: rds_stats_info); |
154 | return 0; |
155 | } |
156 | |