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> 52#include <linux/slab.h> 53#include <linux/export.h> 54#include <net/mac80211.h> 55#include "rc80211_minstrel.h" 56 57ssize_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 73int 74minstrel_stats_open(struct inode *inode, struct file *file) 75{ 76 struct minstrel_sta_info *mi = inode->i_private; 77 struct minstrel_debugfs_info *ms; 78 unsigned int i, tp_max, tp_avg, prob, eprob; 79 char *p; 80 81 ms = kmalloc(2048, GFP_KERNEL); 82 if (!ms) 83 return -ENOMEM; 84 85 file->private_data = ms; 86 p = ms->buf; 87 p += sprintf(p, "\n"); 88 p += sprintf(p, "best __________rate_________ ______" 89 "statistics______ ________last_______ " 90 "______sum-of________\n"); 91 p += sprintf(p, "rate [name idx airtime max_tp] [ ø(tp) ø(prob) " 92 "sd(prob)] [prob.|retry|suc|att] " 93 "[#success | #attempts]\n"); 94 95 for (i = 0; i < mi->n_rates; i++) { 96 struct minstrel_rate *mr = &mi->r[i]; 97 struct minstrel_rate_stats *mrs = &mi->r[i].stats; 98 99 *(p++) = (i == mi->max_tp_rate[0]) ? 'A' : ' '; 100 *(p++) = (i == mi->max_tp_rate[1]) ? 'B' : ' '; 101 *(p++) = (i == mi->max_tp_rate[2]) ? 'C' : ' '; 102 *(p++) = (i == mi->max_tp_rate[3]) ? 'D' : ' '; 103 *(p++) = (i == mi->max_prob_rate) ? 'P' : ' '; 104 105 p += sprintf(p, " %3u%s ", mr->bitrate / 2, 106 (mr->bitrate & 1 ? ".5" : " ")); 107 p += sprintf(p, "%3u ", i); 108 p += sprintf(p, "%6u ", mr->perfect_tx_time); 109 110 tp_max = minstrel_get_tp_avg(mr, MINSTREL_FRAC(100,100)); 111 tp_avg = minstrel_get_tp_avg(mr, mrs->prob_ewma); 112 prob = MINSTREL_TRUNC(mrs->cur_prob * 1000); 113 eprob = MINSTREL_TRUNC(mrs->prob_ewma * 1000); 114 115 p += sprintf(p, "%4u.%1u %4u.%1u %3u.%1u %3u.%1u" 116 " %3u.%1u %3u %3u %-3u " 117 "%9llu %-9llu\n", 118 tp_max / 10, tp_max % 10, 119 tp_avg / 10, tp_avg % 10, 120 eprob / 10, eprob % 10, 121 mrs->prob_ewmsd / 10, mrs->prob_ewmsd % 10, 122 prob / 10, prob % 10, 123 mrs->retry_count, 124 mrs->last_success, 125 mrs->last_attempts, 126 (unsigned long long)mrs->succ_hist, 127 (unsigned long long)mrs->att_hist); 128 } 129 p += sprintf(p, "\nTotal packet count:: ideal %d " 130 "lookaround %d\n\n", 131 mi->total_packets - mi->sample_packets, 132 mi->sample_packets); 133 ms->len = p - ms->buf; 134 135 WARN_ON(ms->len + sizeof(*ms) > 2048); 136 137 return 0; 138} 139 140static const struct file_operations minstrel_stat_fops = { 141 .owner = THIS_MODULE, 142 .open = minstrel_stats_open, 143 .read = minstrel_stats_read, 144 .release = minstrel_stats_release, 145 .llseek = default_llseek, 146}; 147 148int 149minstrel_stats_csv_open(struct inode *inode, struct file *file) 150{ 151 struct minstrel_sta_info *mi = inode->i_private; 152 struct minstrel_debugfs_info *ms; 153 unsigned int i, tp_max, tp_avg, prob, eprob; 154 char *p; 155 156 ms = kmalloc(2048, GFP_KERNEL); 157 if (!ms) 158 return -ENOMEM; 159 160 file->private_data = ms; 161 p = ms->buf; 162 163 for (i = 0; i < mi->n_rates; i++) { 164 struct minstrel_rate *mr = &mi->r[i]; 165 struct minstrel_rate_stats *mrs = &mi->r[i].stats; 166 167 p += sprintf(p, "%s" ,((i == mi->max_tp_rate[0]) ? "A" : "")); 168 p += sprintf(p, "%s" ,((i == mi->max_tp_rate[1]) ? "B" : "")); 169 p += sprintf(p, "%s" ,((i == mi->max_tp_rate[2]) ? "C" : "")); 170 p += sprintf(p, "%s" ,((i == mi->max_tp_rate[3]) ? "D" : "")); 171 p += sprintf(p, "%s" ,((i == mi->max_prob_rate) ? "P" : "")); 172 173 p += sprintf(p, ",%u%s", mr->bitrate / 2, 174 (mr->bitrate & 1 ? ".5," : ",")); 175 p += sprintf(p, "%u,", i); 176 p += sprintf(p, "%u,",mr->perfect_tx_time); 177 178 tp_max = minstrel_get_tp_avg(mr, MINSTREL_FRAC(100,100)); 179 tp_avg = minstrel_get_tp_avg(mr, mrs->prob_ewma); 180 prob = MINSTREL_TRUNC(mrs->cur_prob * 1000); 181 eprob = MINSTREL_TRUNC(mrs->prob_ewma * 1000); 182 183 p += sprintf(p, "%u.%u,%u.%u,%u.%u,%u.%u,%u.%u,%u,%u,%u," 184 "%llu,%llu,%d,%d\n", 185 tp_max / 10, tp_max % 10, 186 tp_avg / 10, tp_avg % 10, 187 eprob / 10, eprob % 10, 188 mrs->prob_ewmsd / 10, mrs->prob_ewmsd % 10, 189 prob / 10, prob % 10, 190 mrs->retry_count, 191 mrs->last_success, 192 mrs->last_attempts, 193 (unsigned long long)mrs->succ_hist, 194 (unsigned long long)mrs->att_hist, 195 mi->total_packets - mi->sample_packets, 196 mi->sample_packets); 197 198 } 199 ms->len = p - ms->buf; 200 201 WARN_ON(ms->len + sizeof(*ms) > 2048); 202 203 return 0; 204} 205 206static const struct file_operations minstrel_stat_csv_fops = { 207 .owner = THIS_MODULE, 208 .open = minstrel_stats_csv_open, 209 .read = minstrel_stats_read, 210 .release = minstrel_stats_release, 211 .llseek = default_llseek, 212}; 213 214void 215minstrel_add_sta_debugfs(void *priv, void *priv_sta, struct dentry *dir) 216{ 217 struct minstrel_sta_info *mi = priv_sta; 218 219 mi->dbg_stats = debugfs_create_file("rc_stats", S_IRUGO, dir, mi, 220 &minstrel_stat_fops); 221 222 mi->dbg_stats_csv = debugfs_create_file("rc_stats_csv", S_IRUGO, dir, 223 mi, &minstrel_stat_csv_fops); 224} 225 226void 227minstrel_remove_sta_debugfs(void *priv, void *priv_sta) 228{ 229 struct minstrel_sta_info *mi = priv_sta; 230 231 debugfs_remove(mi->dbg_stats); 232 233 debugfs_remove(mi->dbg_stats_csv); 234} 235