rc80211_minstrel_debugfs.c 5.8 KB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130131132133134135136137138139140141142143144145146147148149150151152153154155156157158159160161162163164165166167168169170171172
  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. int
  57. minstrel_stats_open(struct inode *inode, struct file *file)
  58. {
  59. struct minstrel_sta_info *mi = inode->i_private;
  60. struct minstrel_debugfs_info *ms;
  61. unsigned int i, tp_max, tp_avg, eprob;
  62. char *p;
  63. ms = kmalloc(2048, GFP_KERNEL);
  64. if (!ms)
  65. return -ENOMEM;
  66. file->private_data = ms;
  67. p = ms->buf;
  68. p += sprintf(p, "\n");
  69. p += sprintf(p,
  70. "best __________rate_________ ____statistics___ ____last_____ ______sum-of________\n");
  71. p += sprintf(p,
  72. "rate [name idx airtime max_tp] [avg(tp) avg(prob)] [retry|suc|att] [#success | #attempts]\n");
  73. for (i = 0; i < mi->n_rates; i++) {
  74. struct minstrel_rate *mr = &mi->r[i];
  75. struct minstrel_rate_stats *mrs = &mi->r[i].stats;
  76. *(p++) = (i == mi->max_tp_rate[0]) ? 'A' : ' ';
  77. *(p++) = (i == mi->max_tp_rate[1]) ? 'B' : ' ';
  78. *(p++) = (i == mi->max_tp_rate[2]) ? 'C' : ' ';
  79. *(p++) = (i == mi->max_tp_rate[3]) ? 'D' : ' ';
  80. *(p++) = (i == mi->max_prob_rate) ? 'P' : ' ';
  81. p += sprintf(p, " %3u%s ", mr->bitrate / 2,
  82. (mr->bitrate & 1 ? ".5" : " "));
  83. p += sprintf(p, "%3u ", i);
  84. p += sprintf(p, "%6u ", mr->perfect_tx_time);
  85. tp_max = minstrel_get_tp_avg(mr, MINSTREL_FRAC(100,100));
  86. tp_avg = minstrel_get_tp_avg(mr, mrs->prob_avg);
  87. eprob = MINSTREL_TRUNC(mrs->prob_avg * 1000);
  88. p += sprintf(p, "%4u.%1u %4u.%1u %3u.%1u"
  89. " %3u %3u %-3u "
  90. "%9llu %-9llu\n",
  91. tp_max / 10, tp_max % 10,
  92. tp_avg / 10, tp_avg % 10,
  93. eprob / 10, eprob % 10,
  94. mrs->retry_count,
  95. mrs->last_success,
  96. mrs->last_attempts,
  97. (unsigned long long)mrs->succ_hist,
  98. (unsigned long long)mrs->att_hist);
  99. }
  100. p += sprintf(p, "\nTotal packet count:: ideal %d "
  101. "lookaround %d\n\n",
  102. mi->total_packets - mi->sample_packets,
  103. mi->sample_packets);
  104. ms->len = p - ms->buf;
  105. WARN_ON(ms->len + sizeof(*ms) > 2048);
  106. return 0;
  107. }
  108. int
  109. minstrel_stats_csv_open(struct inode *inode, struct file *file)
  110. {
  111. struct minstrel_sta_info *mi = inode->i_private;
  112. struct minstrel_debugfs_info *ms;
  113. unsigned int i, tp_max, tp_avg, eprob;
  114. char *p;
  115. ms = kmalloc(2048, GFP_KERNEL);
  116. if (!ms)
  117. return -ENOMEM;
  118. file->private_data = ms;
  119. p = ms->buf;
  120. for (i = 0; i < mi->n_rates; i++) {
  121. struct minstrel_rate *mr = &mi->r[i];
  122. struct minstrel_rate_stats *mrs = &mi->r[i].stats;
  123. p += sprintf(p, "%s" ,((i == mi->max_tp_rate[0]) ? "A" : ""));
  124. p += sprintf(p, "%s" ,((i == mi->max_tp_rate[1]) ? "B" : ""));
  125. p += sprintf(p, "%s" ,((i == mi->max_tp_rate[2]) ? "C" : ""));
  126. p += sprintf(p, "%s" ,((i == mi->max_tp_rate[3]) ? "D" : ""));
  127. p += sprintf(p, "%s" ,((i == mi->max_prob_rate) ? "P" : ""));
  128. p += sprintf(p, ",%u%s", mr->bitrate / 2,
  129. (mr->bitrate & 1 ? ".5," : ","));
  130. p += sprintf(p, "%u,", i);
  131. p += sprintf(p, "%u,",mr->perfect_tx_time);
  132. tp_max = minstrel_get_tp_avg(mr, MINSTREL_FRAC(100,100));
  133. tp_avg = minstrel_get_tp_avg(mr, mrs->prob_avg);
  134. eprob = MINSTREL_TRUNC(mrs->prob_avg * 1000);
  135. p += sprintf(p, "%u.%u,%u.%u,%u.%u,%u,%u,%u,"
  136. "%llu,%llu,%d,%d\n",
  137. tp_max / 10, tp_max % 10,
  138. tp_avg / 10, tp_avg % 10,
  139. eprob / 10, eprob % 10,
  140. mrs->retry_count,
  141. mrs->last_success,
  142. mrs->last_attempts,
  143. (unsigned long long)mrs->succ_hist,
  144. (unsigned long long)mrs->att_hist,
  145. mi->total_packets - mi->sample_packets,
  146. mi->sample_packets);
  147. }
  148. ms->len = p - ms->buf;
  149. WARN_ON(ms->len + sizeof(*ms) > 2048);
  150. return 0;
  151. }