Andy Grover | a8c879a | 2009-02-24 15:30:22 +0000 | [diff] [blame] | 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 | |
| 37 | #include "rds.h" |
| 38 | |
| 39 | DEFINE_PER_CPU_SHARED_ALIGNED(struct rds_statistics, rds_stats); |
| 40 | |
| 41 | /* :.,$s/unsigned long\>.*\<s_\(.*\);/"\1",/g */ |
| 42 | |
| 43 | static char *rds_stat_names[] = { |
| 44 | "conn_reset", |
| 45 | "recv_drop_bad_checksum", |
| 46 | "recv_drop_old_seq", |
| 47 | "recv_drop_no_sock", |
| 48 | "recv_drop_dead_sock", |
| 49 | "recv_deliver_raced", |
| 50 | "recv_delivered", |
| 51 | "recv_queued", |
| 52 | "recv_immediate_retry", |
| 53 | "recv_delayed_retry", |
| 54 | "recv_ack_required", |
| 55 | "recv_rdma_bytes", |
| 56 | "recv_ping", |
| 57 | "send_queue_empty", |
| 58 | "send_queue_full", |
| 59 | "send_sem_contention", |
| 60 | "send_sem_queue_raced", |
| 61 | "send_immediate_retry", |
| 62 | "send_delayed_retry", |
| 63 | "send_drop_acked", |
| 64 | "send_ack_required", |
| 65 | "send_queued", |
| 66 | "send_rdma", |
| 67 | "send_rdma_bytes", |
| 68 | "send_pong", |
| 69 | "page_remainder_hit", |
| 70 | "page_remainder_miss", |
| 71 | "copy_to_user", |
| 72 | "copy_from_user", |
| 73 | "cong_update_queued", |
| 74 | "cong_update_received", |
| 75 | "cong_send_error", |
| 76 | "cong_send_blocked", |
| 77 | }; |
| 78 | |
| 79 | void rds_stats_info_copy(struct rds_info_iterator *iter, |
| 80 | uint64_t *values, char **names, size_t nr) |
| 81 | { |
| 82 | struct rds_info_counter ctr; |
| 83 | size_t i; |
| 84 | |
| 85 | for (i = 0; i < nr; i++) { |
| 86 | BUG_ON(strlen(names[i]) >= sizeof(ctr.name)); |
| 87 | strncpy(ctr.name, names[i], sizeof(ctr.name) - 1); |
| 88 | ctr.value = values[i]; |
| 89 | |
| 90 | rds_info_copy(iter, &ctr, sizeof(ctr)); |
| 91 | } |
| 92 | } |
| 93 | |
| 94 | /* |
| 95 | * This gives global counters across all the transports. The strings |
| 96 | * are copied in so that the tool doesn't need knowledge of the specific |
| 97 | * stats that we're exporting. Some are pretty implementation dependent |
| 98 | * and may change over time. That doesn't stop them from being useful. |
| 99 | * |
| 100 | * This is the only function in the chain that knows about the byte granular |
| 101 | * length in userspace. It converts it to number of stat entries that the |
| 102 | * rest of the functions operate in. |
| 103 | */ |
| 104 | static void rds_stats_info(struct socket *sock, unsigned int len, |
| 105 | struct rds_info_iterator *iter, |
| 106 | struct rds_info_lengths *lens) |
| 107 | { |
| 108 | struct rds_statistics stats = {0, }; |
| 109 | uint64_t *src; |
| 110 | uint64_t *sum; |
| 111 | size_t i; |
| 112 | int cpu; |
| 113 | unsigned int avail; |
| 114 | |
| 115 | avail = len / sizeof(struct rds_info_counter); |
| 116 | |
| 117 | if (avail < ARRAY_SIZE(rds_stat_names)) { |
| 118 | avail = 0; |
| 119 | goto trans; |
| 120 | } |
| 121 | |
| 122 | for_each_online_cpu(cpu) { |
| 123 | src = (uint64_t *)&(per_cpu(rds_stats, cpu)); |
| 124 | sum = (uint64_t *)&stats; |
| 125 | for (i = 0; i < sizeof(stats) / sizeof(uint64_t); i++) |
| 126 | *(sum++) += *(src++); |
| 127 | } |
| 128 | |
| 129 | rds_stats_info_copy(iter, (uint64_t *)&stats, rds_stat_names, |
| 130 | ARRAY_SIZE(rds_stat_names)); |
| 131 | avail -= ARRAY_SIZE(rds_stat_names); |
| 132 | |
| 133 | trans: |
| 134 | lens->each = sizeof(struct rds_info_counter); |
| 135 | lens->nr = rds_trans_stats_info_copy(iter, avail) + |
| 136 | ARRAY_SIZE(rds_stat_names); |
| 137 | } |
| 138 | |
| 139 | void rds_stats_exit(void) |
| 140 | { |
| 141 | rds_info_deregister_func(RDS_INFO_COUNTERS, rds_stats_info); |
| 142 | } |
| 143 | |
| 144 | int __init rds_stats_init(void) |
| 145 | { |
| 146 | rds_info_register_func(RDS_INFO_COUNTERS, rds_stats_info); |
| 147 | return 0; |
| 148 | } |