Andrew Scull | b4b6d4a | 2019-01-02 15:54:55 +0000 | [diff] [blame] | 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 | |
Andrew Scull | b4b6d4a | 2019-01-02 15:54:55 +0000 | [diff] [blame] | 57 | int |
| 58 | minstrel_stats_open(struct inode *inode, struct file *file) |
| 59 | { |
| 60 | struct minstrel_sta_info *mi = inode->i_private; |
| 61 | struct minstrel_debugfs_info *ms; |
| 62 | unsigned int i, tp_max, tp_avg, eprob; |
| 63 | char *p; |
| 64 | |
| 65 | ms = kmalloc(2048, GFP_KERNEL); |
| 66 | if (!ms) |
| 67 | return -ENOMEM; |
| 68 | |
| 69 | file->private_data = ms; |
| 70 | p = ms->buf; |
| 71 | p += sprintf(p, "\n"); |
| 72 | p += sprintf(p, |
David Brazdil | 0f672f6 | 2019-12-10 10:32:29 +0000 | [diff] [blame^] | 73 | "best __________rate_________ ____statistics___ ____last_____ ______sum-of________\n"); |
Andrew Scull | b4b6d4a | 2019-01-02 15:54:55 +0000 | [diff] [blame] | 74 | p += sprintf(p, |
David Brazdil | 0f672f6 | 2019-12-10 10:32:29 +0000 | [diff] [blame^] | 75 | "rate [name idx airtime max_tp] [avg(tp) avg(prob)] [retry|suc|att] [#success | #attempts]\n"); |
Andrew Scull | b4b6d4a | 2019-01-02 15:54:55 +0000 | [diff] [blame] | 76 | |
| 77 | for (i = 0; i < mi->n_rates; i++) { |
| 78 | struct minstrel_rate *mr = &mi->r[i]; |
| 79 | struct minstrel_rate_stats *mrs = &mi->r[i].stats; |
Andrew Scull | b4b6d4a | 2019-01-02 15:54:55 +0000 | [diff] [blame] | 80 | |
| 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' : ' '; |
| 85 | *(p++) = (i == mi->max_prob_rate) ? 'P' : ' '; |
| 86 | |
| 87 | p += sprintf(p, " %3u%s ", mr->bitrate / 2, |
| 88 | (mr->bitrate & 1 ? ".5" : " ")); |
| 89 | p += sprintf(p, "%3u ", i); |
| 90 | p += sprintf(p, "%6u ", mr->perfect_tx_time); |
| 91 | |
| 92 | tp_max = minstrel_get_tp_avg(mr, MINSTREL_FRAC(100,100)); |
| 93 | tp_avg = minstrel_get_tp_avg(mr, mrs->prob_ewma); |
| 94 | eprob = MINSTREL_TRUNC(mrs->prob_ewma * 1000); |
Andrew Scull | b4b6d4a | 2019-01-02 15:54:55 +0000 | [diff] [blame] | 95 | |
David Brazdil | 0f672f6 | 2019-12-10 10:32:29 +0000 | [diff] [blame^] | 96 | p += sprintf(p, "%4u.%1u %4u.%1u %3u.%1u" |
Andrew Scull | b4b6d4a | 2019-01-02 15:54:55 +0000 | [diff] [blame] | 97 | " %3u %3u %-3u " |
| 98 | "%9llu %-9llu\n", |
| 99 | tp_max / 10, tp_max % 10, |
| 100 | tp_avg / 10, tp_avg % 10, |
| 101 | eprob / 10, eprob % 10, |
Andrew Scull | b4b6d4a | 2019-01-02 15:54:55 +0000 | [diff] [blame] | 102 | mrs->retry_count, |
| 103 | mrs->last_success, |
| 104 | mrs->last_attempts, |
| 105 | (unsigned long long)mrs->succ_hist, |
| 106 | (unsigned long long)mrs->att_hist); |
| 107 | } |
| 108 | p += sprintf(p, "\nTotal packet count:: ideal %d " |
| 109 | "lookaround %d\n\n", |
| 110 | mi->total_packets - mi->sample_packets, |
| 111 | mi->sample_packets); |
| 112 | ms->len = p - ms->buf; |
| 113 | |
| 114 | WARN_ON(ms->len + sizeof(*ms) > 2048); |
| 115 | |
| 116 | return 0; |
| 117 | } |
| 118 | |
Andrew Scull | b4b6d4a | 2019-01-02 15:54:55 +0000 | [diff] [blame] | 119 | int |
| 120 | minstrel_stats_csv_open(struct inode *inode, struct file *file) |
| 121 | { |
| 122 | struct minstrel_sta_info *mi = inode->i_private; |
| 123 | struct minstrel_debugfs_info *ms; |
| 124 | unsigned int i, tp_max, tp_avg, eprob; |
| 125 | char *p; |
| 126 | |
| 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; |
Andrew Scull | b4b6d4a | 2019-01-02 15:54:55 +0000 | [diff] [blame] | 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 | |
| 149 | tp_max = minstrel_get_tp_avg(mr, MINSTREL_FRAC(100,100)); |
| 150 | tp_avg = minstrel_get_tp_avg(mr, mrs->prob_ewma); |
| 151 | eprob = MINSTREL_TRUNC(mrs->prob_ewma * 1000); |
Andrew Scull | b4b6d4a | 2019-01-02 15:54:55 +0000 | [diff] [blame] | 152 | |
David Brazdil | 0f672f6 | 2019-12-10 10:32:29 +0000 | [diff] [blame^] | 153 | p += sprintf(p, "%u.%u,%u.%u,%u.%u,%u,%u,%u," |
Andrew Scull | b4b6d4a | 2019-01-02 15:54:55 +0000 | [diff] [blame] | 154 | "%llu,%llu,%d,%d\n", |
| 155 | tp_max / 10, tp_max % 10, |
| 156 | tp_avg / 10, tp_avg % 10, |
| 157 | eprob / 10, eprob % 10, |
Andrew Scull | b4b6d4a | 2019-01-02 15:54:55 +0000 | [diff] [blame] | 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); |
| 170 | |
| 171 | return 0; |
| 172 | } |