results.3 1.9 KB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081
  1. .\"
  2. .\" @(#)results.man 2.0 98/04/24
  3. .\"
  4. .\" results - lmbench results subsystem
  5. .\"
  6. .\" Copyright (C) 1998 Carl Staelin and Larry McVoy
  7. .\" E-mail: staelin@hpl.hp.com
  8. .\"
  9. .TH "lmbench result management" 3 "$Date$" "(c)1998 Larry McVoy" "LMBENCH"
  10. .SH "NAME"
  11. insertinit, insertsort, get_results, set_results, save_median, save_minimum
  12. \- the lmbench results subsystem
  13. .SH "SYNOPSIS"
  14. .ft C
  15. #include "lmbench.h"
  16. .br
  17. #define TRIES 11
  18. .br
  19. typedef struct { int N; uint64 u[TRIES], n[TRIES] } result_t;
  20. .br
  21. void insertinit(result_t *r);
  22. .br
  23. void insertsort(uint64 u, uint64 n, result_t *r);
  24. .br
  25. void get_results(result_t *r);
  26. .br
  27. void set_results(result_t *r);
  28. .br
  29. void save_median();
  30. .br
  31. void save_minimum();
  32. .ft R
  33. .SH "DESCRIPTION"
  34. These routines provide some simple data management functionality.
  35. In most cases, you will not need these routines.
  36. .P
  37. The current timing results can be accessed using the routines in
  38. timing(3). The current timing results may be modified using
  39. .B save_median
  40. and
  41. .BR save_minimum .
  42. .TP
  43. .B "void insertinit(result_t *r)"
  44. initializes the results array.
  45. .TP
  46. .B "void insertsort(uint64 u, uint64 n, result_t *r)"
  47. insert
  48. .I u
  49. and
  50. .I n
  51. into
  52. .IR r .
  53. Results are sorted in decreasing order by
  54. .IR u/n .
  55. .TP
  56. .B "void get_results(result_t *r)"
  57. get a copy of the current results.
  58. .TP
  59. .B "void set_results(result_t *r)"
  60. save a copy
  61. .I r
  62. as the current results.
  63. .TP
  64. .B "void save_median()"
  65. sets the timing results to the median of the current results.
  66. .TP
  67. .B "void save_minimum()"
  68. sets the timing restuls to the minimum of the current results.
  69. .P
  70. Results are sorted in ascending order, so the minimum value is at
  71. .B TRIES-1
  72. and the maximum value is at
  73. .BR 0 .
  74. .SH "FUTURES"
  75. Development of \fIlmbench\fR is continuing.
  76. .SH "SEE ALSO"
  77. lmbench(8), lmbench(3), timing(3), reporting(3).
  78. .SH "AUTHOR"
  79. Carl Staelin and Larry McVoy
  80. .PP
  81. Comments, suggestions, and bug reports are always welcome.