blob: 188e9858713f5a76ca855e55b45802c39feced30 [file] [log] [blame]
Felix Fietkaucccf1292008-10-05 18:07:45 +02001/*
2 * Copyright (C) 2008 Felix Fietkau <nbd@openwrt.org>
3 *
4 * This program is free software; you can redistribute it and/or modify
5 * it under the terms of the GNU General Public License version 2 as
6 * published by the Free Software Foundation.
7 *
8 * Based on minstrel.c:
9 * Copyright (C) 2005-2007 Derek Smithies <derek@indranet.co.nz>
10 * Sponsored by Indranet Technologies Ltd
11 *
12 * Based on sample.c:
13 * Copyright (c) 2005 John Bicket
14 * All rights reserved.
15 *
16 * Redistribution and use in source and binary forms, with or without
17 * modification, are permitted provided that the following conditions
18 * are met:
19 * 1. Redistributions of source code must retain the above copyright
20 * notice, this list of conditions and the following disclaimer,
21 * without modification.
22 * 2. Redistributions in binary form must reproduce at minimum a disclaimer
23 * similar to the "NO WARRANTY" disclaimer below ("Disclaimer") and any
24 * redistribution must be conditioned upon including a substantially
25 * similar Disclaimer requirement for further binary redistribution.
26 * 3. Neither the names of the above-listed copyright holders nor the names
27 * of any contributors may be used to endorse or promote products derived
28 * from this software without specific prior written permission.
29 *
30 * Alternatively, this software may be distributed under the terms of the
31 * GNU General Public License ("GPL") version 2 as published by the Free
32 * Software Foundation.
33 *
34 * NO WARRANTY
35 * THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS
36 * ``AS IS'' AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT
37 * LIMITED TO, THE IMPLIED WARRANTIES OF NONINFRINGEMENT, MERCHANTIBILITY
38 * AND FITNESS FOR A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL
39 * THE COPYRIGHT HOLDERS OR CONTRIBUTORS BE LIABLE FOR SPECIAL, EXEMPLARY,
40 * OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF
41 * SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS
42 * INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER
43 * IN CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE)
44 * ARISING IN ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF
45 * THE POSSIBILITY OF SUCH DAMAGES.
46 */
47#include <linux/netdevice.h>
48#include <linux/types.h>
49#include <linux/skbuff.h>
50#include <linux/debugfs.h>
51#include <linux/ieee80211.h>
Tejun Heo5a0e3ad2010-03-24 17:04:11 +090052#include <linux/slab.h>
Paul Gortmakerbc3b2d72011-07-15 11:47:34 -040053#include <linux/export.h>
Felix Fietkaucccf1292008-10-05 18:07:45 +020054#include <net/mac80211.h>
55#include "rc80211_minstrel.h"
56
Thomas Huehn6d488512015-03-24 21:09:36 +010057ssize_t
58minstrel_stats_read(struct file *file, char __user *buf, size_t len, loff_t *ppos)
59{
60 struct minstrel_debugfs_info *ms;
61
62 ms = file->private_data;
63 return simple_read_from_buffer(buf, len, ppos, ms->buf, ms->len);
64}
65
66int
67minstrel_stats_release(struct inode *inode, struct file *file)
68{
69 kfree(file->private_data);
70 return 0;
71}
72
Felix Fietkaueae44752010-03-01 22:21:40 +010073int
Felix Fietkaucccf1292008-10-05 18:07:45 +020074minstrel_stats_open(struct inode *inode, struct file *file)
75{
76 struct minstrel_sta_info *mi = inode->i_private;
Felix Fietkau44ac91e2010-03-01 22:17:38 +010077 struct minstrel_debugfs_info *ms;
Thomas Huehn6a27b2c2015-03-24 21:09:40 +010078 unsigned int i, tp_avg, prob, eprob;
Felix Fietkaucccf1292008-10-05 18:07:45 +020079 char *p;
80
Karl Beldan11b23572014-10-20 10:54:36 +020081 ms = kmalloc(2048, GFP_KERNEL);
Felix Fietkaucccf1292008-10-05 18:07:45 +020082 if (!ms)
83 return -ENOMEM;
84
85 file->private_data = ms;
86 p = ms->buf;
Thomas Huehne161f7f2015-03-24 21:09:34 +010087 p += sprintf(p, "\n");
88 p += sprintf(p, "best _______rate_____ __statistics__ "
89 "________last_______ ______sum-of________\n");
90 p += sprintf(p, "rate [name idx airtime] [ ø(tp) ø(prob)] "
91 "[prob.|retry|suc|att] [#success | #attempts]\n");
92
Felix Fietkaucccf1292008-10-05 18:07:45 +020093 for (i = 0; i < mi->n_rates; i++) {
94 struct minstrel_rate *mr = &mi->r[i];
Thomas Huehnca12c0c2014-09-09 23:22:13 +020095 struct minstrel_rate_stats *mrs = &mi->r[i].stats;
Felix Fietkaucccf1292008-10-05 18:07:45 +020096
Thomas Huehn2ff2b692013-03-04 23:30:07 +010097 *(p++) = (i == mi->max_tp_rate[0]) ? 'A' : ' ';
98 *(p++) = (i == mi->max_tp_rate[1]) ? 'B' : ' ';
99 *(p++) = (i == mi->max_tp_rate[2]) ? 'C' : ' ';
100 *(p++) = (i == mi->max_tp_rate[3]) ? 'D' : ' ';
Felix Fietkaucccf1292008-10-05 18:07:45 +0200101 *(p++) = (i == mi->max_prob_rate) ? 'P' : ' ';
Thomas Huehne161f7f2015-03-24 21:09:34 +0100102
103 p += sprintf(p, " %3u%s ", mr->bitrate / 2,
Felix Fietkaucccf1292008-10-05 18:07:45 +0200104 (mr->bitrate & 1 ? ".5" : " "));
Thomas Huehne161f7f2015-03-24 21:09:34 +0100105 p += sprintf(p, "%3u ", i);
106 p += sprintf(p, "%6u ", mr->perfect_tx_time);
Felix Fietkaucccf1292008-10-05 18:07:45 +0200107
Thomas Huehn6a27b2c2015-03-24 21:09:40 +0100108 tp_avg = minstrel_get_tp_avg(mr);
Thomas Huehnca12c0c2014-09-09 23:22:13 +0200109 prob = MINSTREL_TRUNC(mrs->cur_prob * 1000);
Thomas Huehn91340732015-03-24 21:09:39 +0100110 eprob = MINSTREL_TRUNC(mrs->prob_ewma * 1000);
Felix Fietkaucccf1292008-10-05 18:07:45 +0200111
Thomas Huehne161f7f2015-03-24 21:09:34 +0100112 p += sprintf(p, " %4u.%1u %3u.%1u %3u.%1u %3u"
113 " %3u %-3u %9llu %-9llu\n",
Thomas Huehn6a27b2c2015-03-24 21:09:40 +0100114 tp_avg / 10, tp_avg % 10,
Felix Fietkaucccf1292008-10-05 18:07:45 +0200115 eprob / 10, eprob % 10,
116 prob / 10, prob % 10,
Thomas Huehne161f7f2015-03-24 21:09:34 +0100117 mrs->retry_count,
Thomas Huehnca12c0c2014-09-09 23:22:13 +0200118 mrs->last_success,
119 mrs->last_attempts,
120 (unsigned long long)mrs->succ_hist,
121 (unsigned long long)mrs->att_hist);
Felix Fietkaucccf1292008-10-05 18:07:45 +0200122 }
123 p += sprintf(p, "\nTotal packet count:: ideal %d "
124 "lookaround %d\n\n",
Thomas Huehnca12c0c2014-09-09 23:22:13 +0200125 mi->total_packets - mi->sample_packets,
126 mi->sample_packets);
Felix Fietkaucccf1292008-10-05 18:07:45 +0200127 ms->len = p - ms->buf;
128
Karl Beldan11b23572014-10-20 10:54:36 +0200129 WARN_ON(ms->len + sizeof(*ms) > 2048);
130
Felix Fietkaucccf1292008-10-05 18:07:45 +0200131 return 0;
132}
133
Stephen Hemminger5ca1b992009-09-01 19:25:05 +0000134static const struct file_operations minstrel_stat_fops = {
Felix Fietkaucccf1292008-10-05 18:07:45 +0200135 .owner = THIS_MODULE,
136 .open = minstrel_stats_open,
137 .read = minstrel_stats_read,
138 .release = minstrel_stats_release,
Arnd Bergmann6038f372010-08-15 18:52:59 +0200139 .llseek = default_llseek,
Felix Fietkaucccf1292008-10-05 18:07:45 +0200140};
141
Thomas Huehn6d488512015-03-24 21:09:36 +0100142int
143minstrel_stats_csv_open(struct inode *inode, struct file *file)
144{
145 struct minstrel_sta_info *mi = inode->i_private;
146 struct minstrel_debugfs_info *ms;
Thomas Huehn6a27b2c2015-03-24 21:09:40 +0100147 unsigned int i, tp_avg, prob, eprob;
Thomas Huehn6d488512015-03-24 21:09:36 +0100148 char *p;
149
150 ms = kmalloc(2048, GFP_KERNEL);
151 if (!ms)
152 return -ENOMEM;
153
154 file->private_data = ms;
155 p = ms->buf;
156
157 for (i = 0; i < mi->n_rates; i++) {
158 struct minstrel_rate *mr = &mi->r[i];
159 struct minstrel_rate_stats *mrs = &mi->r[i].stats;
160
161 p += sprintf(p, "%s" ,((i == mi->max_tp_rate[0]) ? "A" : ""));
162 p += sprintf(p, "%s" ,((i == mi->max_tp_rate[1]) ? "B" : ""));
163 p += sprintf(p, "%s" ,((i == mi->max_tp_rate[2]) ? "C" : ""));
164 p += sprintf(p, "%s" ,((i == mi->max_tp_rate[3]) ? "D" : ""));
165 p += sprintf(p, "%s" ,((i == mi->max_prob_rate) ? "P" : ""));
166
167 p += sprintf(p, ",%u%s", mr->bitrate / 2,
168 (mr->bitrate & 1 ? ".5," : ","));
169 p += sprintf(p, "%u,", i);
170 p += sprintf(p, "%u,",mr->perfect_tx_time);
171
Thomas Huehn6a27b2c2015-03-24 21:09:40 +0100172 tp_avg = minstrel_get_tp_avg(mr);
Thomas Huehn6d488512015-03-24 21:09:36 +0100173 prob = MINSTREL_TRUNC(mrs->cur_prob * 1000);
Thomas Huehn91340732015-03-24 21:09:39 +0100174 eprob = MINSTREL_TRUNC(mrs->prob_ewma * 1000);
Thomas Huehn6d488512015-03-24 21:09:36 +0100175
176 p += sprintf(p, "%u.%u,%u.%u,%u.%u,%u,%u,%u,"
177 "%llu,%llu,%d,%d\n",
Thomas Huehn6a27b2c2015-03-24 21:09:40 +0100178 tp_avg / 10, tp_avg % 10,
Thomas Huehn6d488512015-03-24 21:09:36 +0100179 eprob / 10, eprob % 10,
180 prob / 10, prob % 10,
181 mrs->retry_count,
182 mrs->last_success,
183 mrs->last_attempts,
184 (unsigned long long)mrs->succ_hist,
185 (unsigned long long)mrs->att_hist,
186 mi->total_packets - mi->sample_packets,
187 mi->sample_packets);
188
189 }
190 ms->len = p - ms->buf;
191
192 WARN_ON(ms->len + sizeof(*ms) > 2048);
193
194 return 0;
195}
196
197static const struct file_operations minstrel_stat_csv_fops = {
198 .owner = THIS_MODULE,
199 .open = minstrel_stats_csv_open,
200 .read = minstrel_stats_read,
201 .release = minstrel_stats_release,
202 .llseek = default_llseek,
203};
204
Felix Fietkaucccf1292008-10-05 18:07:45 +0200205void
206minstrel_add_sta_debugfs(void *priv, void *priv_sta, struct dentry *dir)
207{
208 struct minstrel_sta_info *mi = priv_sta;
209
210 mi->dbg_stats = debugfs_create_file("rc_stats", S_IRUGO, dir, mi,
211 &minstrel_stat_fops);
Thomas Huehn6d488512015-03-24 21:09:36 +0100212
213 mi->dbg_stats_csv = debugfs_create_file("rc_stats_csv", S_IRUGO, dir,
214 mi, &minstrel_stat_csv_fops);
Felix Fietkaucccf1292008-10-05 18:07:45 +0200215}
216
217void
218minstrel_remove_sta_debugfs(void *priv, void *priv_sta)
219{
220 struct minstrel_sta_info *mi = priv_sta;
221
222 debugfs_remove(mi->dbg_stats);
Thomas Huehn6d488512015-03-24 21:09:36 +0100223
224 debugfs_remove(mi->dbg_stats_csv);
Felix Fietkaucccf1292008-10-05 18:07:45 +0200225}