logo
Free, unlimited AI code reviews that run on commit
git-lrc git-lrc GitHub Install Now We'd appreciate a star git-lrc - Free, unlimited AI code reviews that run on commit | Product Hunt git-lrc - Free, unlimited AI code reviews that run on commit | Product Hunt

insertinit, insertsort, get_results, set_results, save_median, save_minimum - the lmbench results

Author

       Carl Staelin and Larry McVoy

       Comments, suggestions, and bug reports are always welcome.

(c)1998 Larry McVoy                                  $Date:$                        lmbenchresultmanagement(3)

Description

       These routines provide some simple data management functionality.  In most cases, you will not need these
       routines.

       The current timing results can be accessed using the routines in timing(3).  The current  timing  results
       may be modified using save_median and save_minimum.

       intsizeof_result(intN)
              returns the number of bytes to allocate for a result_t which contains N results.

       voidinsertinit(result_t*r)
              initializes the results array.

       voidinsertsort(uint64u,uint64n,result_t*r)
              insert u and n into r.  Results are sorted in decreasing order by u/n.

       voidget_results(result_t*r)
              get a copy of the current results.

       voidset_results(result_t*r)
              save a copy r as the current results.

       voidsave_median()
              sets the timing results to the median of the current results.

       voidsave_minimum()
              sets the timing restuls to the minimum of the current results.

       Results are sorted in ascending order, so the minimum value is at TRIES-1 and the maximum value is at 0.

Futures

       Development of lmbench is continuing.

Name

       insertinit,  insertsort,  get_results,  set_results, save_median, save_minimum      - the lmbench results
       subsystem

See Also

lmbench(8), lmbench(3), reporting(3), results(3)

Synopsis

#include``lmbench.h''#defineTRIES11typedefstruct{uint64u,n}value_t;typedefstruct{intN;value_tv[TRIES];}result_t;intsizeof_result(intN)voidinsertinit(result_t*r)voidinsertsort(uint64u,uint64n,result_t*r)result_t*get_results()voidset_results(result_t*r)voidsave_median()voidsave_minimum()

See Also