[Bug runtime/10234] clean up aggregate hard-coded logic

[mcermak at redhat dot com]

https://sourceware.org/bugzilla/show_bug.cgi?id=10234

--- Comment #11 from Martin Cermak <mcermak at redhat dot com> ---
Checked in commit 26382d613f4d266f74ddb3d3f3f36aceab171e14 .

The optimization effect significantly depends on compiler version,
platform architecture, and the stat operators being used for given
global.  At the moment, the available stat operators are @count,
@sum, @min, @max, @avg, and @variance. The most computionally
expensive is @variance.  The effect of optimizing @variance is
significant.  Other stat operators are computionally chap and so
the effect of their optimizations is relatively low.

Using gcc-6.2.1-1.fc26.x86_64, the @count, @sum, @min, and @max
optimizations brings approximately 8% run time shrinkage. The
@variance optimization shrinkage is up to 70% using this compiler.
For other architectures, namely for power, the optimization is less
effective.

-- 
You are receiving this mail because:
You are the assignee for the bug.