Commit | Line | Data |
---|---|---|
cccf129f FF |
1 | /* |
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> | |
5a0e3ad6 | 52 | #include <linux/slab.h> |
bc3b2d7f | 53 | #include <linux/export.h> |
cccf129f FF |
54 | #include <net/mac80211.h> |
55 | #include "rc80211_minstrel.h" | |
56 | ||
eae44756 | 57 | int |
cccf129f FF |
58 | minstrel_stats_open(struct inode *inode, struct file *file) |
59 | { | |
60 | struct minstrel_sta_info *mi = inode->i_private; | |
44ac91ea | 61 | struct minstrel_debugfs_info *ms; |
1109dc39 | 62 | unsigned int i, tp_max, tp_avg, eprob; |
cccf129f FF |
63 | char *p; |
64 | ||
11b2357d | 65 | ms = kmalloc(2048, GFP_KERNEL); |
cccf129f FF |
66 | if (!ms) |
67 | return -ENOMEM; | |
68 | ||
69 | file->private_data = ms; | |
70 | p = ms->buf; | |
e161f7f6 | 71 | p += sprintf(p, "\n"); |
a0c391b1 | 72 | p += sprintf(p, |
506dbf90 | 73 | "best __________rate_________ ____statistics___ ____last_____ ______sum-of________\n"); |
a0c391b1 | 74 | p += sprintf(p, |
506dbf90 | 75 | "rate [name idx airtime max_tp] [avg(tp) avg(prob)] [retry|suc|att] [#success | #attempts]\n"); |
e161f7f6 | 76 | |
cccf129f FF |
77 | for (i = 0; i < mi->n_rates; i++) { |
78 | struct minstrel_rate *mr = &mi->r[i]; | |
ca12c0c8 | 79 | struct minstrel_rate_stats *mrs = &mi->r[i].stats; |
cccf129f | 80 | |
2ff2b690 TH |
81 | *(p++) = (i == mi->max_tp_rate[0]) ? 'A' : ' '; |
82 | *(p++) = (i == mi->max_tp_rate[1]) ? 'B' : ' '; | |
83 | *(p++) = (i == mi->max_tp_rate[2]) ? 'C' : ' '; | |
84 | *(p++) = (i == mi->max_tp_rate[3]) ? 'D' : ' '; | |
cccf129f | 85 | *(p++) = (i == mi->max_prob_rate) ? 'P' : ' '; |
e161f7f6 TH |
86 | |
87 | p += sprintf(p, " %3u%s ", mr->bitrate / 2, | |
cccf129f | 88 | (mr->bitrate & 1 ? ".5" : " ")); |
e161f7f6 | 89 | p += sprintf(p, "%3u ", i); |
50e55a8e | 90 | p += sprintf(p, "%6u ", mr->perfect_tx_time); |
cccf129f | 91 | |
50e55a8e TH |
92 | tp_max = minstrel_get_tp_avg(mr, MINSTREL_FRAC(100,100)); |
93 | tp_avg = minstrel_get_tp_avg(mr, mrs->prob_ewma); | |
9134073b | 94 | eprob = MINSTREL_TRUNC(mrs->prob_ewma * 1000); |
cccf129f | 95 | |
506dbf90 | 96 | p += sprintf(p, "%4u.%1u %4u.%1u %3u.%1u" |
1109dc39 | 97 | " %3u %3u %-3u " |
5f919abc | 98 | "%9llu %-9llu\n", |
50e55a8e | 99 | tp_max / 10, tp_max % 10, |
6a27b2c4 | 100 | tp_avg / 10, tp_avg % 10, |
cccf129f | 101 | eprob / 10, eprob % 10, |
e161f7f6 | 102 | mrs->retry_count, |
ca12c0c8 TH |
103 | mrs->last_success, |
104 | mrs->last_attempts, | |
105 | (unsigned long long)mrs->succ_hist, | |
106 | (unsigned long long)mrs->att_hist); | |
cccf129f FF |
107 | } |
108 | p += sprintf(p, "\nTotal packet count:: ideal %d " | |
109 | "lookaround %d\n\n", | |
ca12c0c8 TH |
110 | mi->total_packets - mi->sample_packets, |
111 | mi->sample_packets); | |
cccf129f FF |
112 | ms->len = p - ms->buf; |
113 | ||
11b2357d KB |
114 | WARN_ON(ms->len + sizeof(*ms) > 2048); |
115 | ||
cccf129f FF |
116 | return 0; |
117 | } | |
118 | ||
6d488517 TH |
119 | int |
120 | minstrel_stats_csv_open(struct inode *inode, struct file *file) | |
cccf129f | 121 | { |
6d488517 | 122 | struct minstrel_sta_info *mi = inode->i_private; |
44ac91ea | 123 | struct minstrel_debugfs_info *ms; |
1109dc39 | 124 | unsigned int i, tp_max, tp_avg, eprob; |
6d488517 | 125 | char *p; |
cccf129f | 126 | |
6d488517 TH |
127 | ms = kmalloc(2048, GFP_KERNEL); |
128 | if (!ms) | |
129 | return -ENOMEM; | |
130 | ||
131 | file->private_data = ms; | |
132 | p = ms->buf; | |
133 | ||
134 | for (i = 0; i < mi->n_rates; i++) { | |
135 | struct minstrel_rate *mr = &mi->r[i]; | |
136 | struct minstrel_rate_stats *mrs = &mi->r[i].stats; | |
137 | ||
138 | p += sprintf(p, "%s" ,((i == mi->max_tp_rate[0]) ? "A" : "")); | |
139 | p += sprintf(p, "%s" ,((i == mi->max_tp_rate[1]) ? "B" : "")); | |
140 | p += sprintf(p, "%s" ,((i == mi->max_tp_rate[2]) ? "C" : "")); | |
141 | p += sprintf(p, "%s" ,((i == mi->max_tp_rate[3]) ? "D" : "")); | |
142 | p += sprintf(p, "%s" ,((i == mi->max_prob_rate) ? "P" : "")); | |
143 | ||
144 | p += sprintf(p, ",%u%s", mr->bitrate / 2, | |
145 | (mr->bitrate & 1 ? ".5," : ",")); | |
146 | p += sprintf(p, "%u,", i); | |
147 | p += sprintf(p, "%u,",mr->perfect_tx_time); | |
148 | ||
50e55a8e TH |
149 | tp_max = minstrel_get_tp_avg(mr, MINSTREL_FRAC(100,100)); |
150 | tp_avg = minstrel_get_tp_avg(mr, mrs->prob_ewma); | |
9134073b | 151 | eprob = MINSTREL_TRUNC(mrs->prob_ewma * 1000); |
6d488517 | 152 | |
506dbf90 | 153 | p += sprintf(p, "%u.%u,%u.%u,%u.%u,%u,%u,%u," |
6d488517 | 154 | "%llu,%llu,%d,%d\n", |
50e55a8e | 155 | tp_max / 10, tp_max % 10, |
6a27b2c4 | 156 | tp_avg / 10, tp_avg % 10, |
6d488517 | 157 | eprob / 10, eprob % 10, |
6d488517 TH |
158 | mrs->retry_count, |
159 | mrs->last_success, | |
160 | mrs->last_attempts, | |
161 | (unsigned long long)mrs->succ_hist, | |
162 | (unsigned long long)mrs->att_hist, | |
163 | mi->total_packets - mi->sample_packets, | |
164 | mi->sample_packets); | |
165 | ||
166 | } | |
167 | ms->len = p - ms->buf; | |
168 | ||
169 | WARN_ON(ms->len + sizeof(*ms) > 2048); | |
cccf129f | 170 | |
cccf129f FF |
171 | return 0; |
172 | } |