v1.4.1
Bug-fix release on v1.4.
Realign expectation that State::iterations() returns 0 before the main benchmark loop begins.
CMake error message fixes
Enscripten check fix
OpenBSD porting
Windows bazel fixes
Bazel pthread linking
Negative regexes
gmock fix
v1.4.0
Removal of deprecated headers
Improved CPU cache info reporting
Support State::KeepRunningBatch()
Support int64_t for AddRange()
New platform support: NetBSD, s390x, Solaris
Bazel build support
Support googletest unit tests
Add assembler tests
Various warnings fixed
v1.3.0
Ranged for loop optimization!
Make installation optional
Better stats including user-provided ones
JSON reporter format fixes
Documentation improvements
Update DEPENDS
Upstream changes:
Version 0.7112:
- Fix Makefile.PL warning
- Fix deleting of inc during release process
- Better fix for AutomatedTester warning
Version 0.7111:
- Update META.yml
Version 0.7110:
- Trying once again to fix the compile test on windows
Version 0.7109:
- Add missing URI::Escape dependency
- Check in standard tests, including one that skips the compile check on Windows
Version 0.7108:
- Add standard tests
- Fix compatibility issue with newer versions of perl, which remove "." from
@INC. https://rt.cpan.org/Ticket/Display.html?id=121015
- Fix no_index declaration for delta.pl.
https://rt.cpan.org/Ticket/Display.html?id=112477
Fixes use of auto_ptr.
glmark2 2017.07 (20170728)
==========================
* Use monotonic clock for benchmark timings.
* Use udev to find the best node path to use in the DRM backend.
* Don't rebuild common source needlessly.
* Build in C++14 mode.
fallout from it.
NetBSD has large file support without O_LARGEFILE/open64/lseek64.
Not tested on other operating systems, but hopefully a non-functional
change for them.
This is the equivalent of removing the checks for large file support
and using O_LARGEFILE to test for the availability of different functions
for 64bit.
Flame graphs are a visualization of profiled software, allowing the most
frequent code-paths to be identified quickly and accurately. They can be
generated using my open source programs which create interactive SVGs.
The actual fix as been done by "pkglint -F */*/buildlink3.mk", and was
reviewed manually.
There are some .include lines that still are indented with zero spaces
although the surrounding .if is indented. This is existing practice.
Unsorted entries in PLIST files have generated a pkglint warning for at
least 12 years. Somewhat more recently, pkglint has learned to sort
PLIST files automatically. Since pkglint 5.4.23, the sorting is only
done in obvious, simple cases. These have been applied by running:
pkglint -Cnone,PLIST -Wnone,plist-sort -r -F
This has been a pkglint warning for several years now, and pkglint can even
fix it automatically. And it did for this commit.
Only in lang/mercury, two passes of autofixing were necessary because there
were nested variables.
-------------------------------------
dnsperf 2.1.0.0
Release Notes
************************
December 15, 2015
In addition to various bug fixes, the following new capabilities
were added in this release:
- The -C option was added to resperf. This option enables the local
server to act as multiple clients. By default, the local server
acts as a single client.
- the -T option was added to dnsperf. This option separates the
number of clients from the number of threads and allows more
clients to be simulated effectively. Note that using this option
impacts CPU and memory, so we recommend limiting the number of
threads.
fio is a tool that will spawn a number of threads or processes doing a
particular type of io action as specified by the user. fio takes a
number of global parameters, each inherited by the thread unless
otherwise parameters given to them overriding that setting is given.
The typical use of fio is to write a job file matching the io load
one wants to simulate.
MASTER_SITES= site1 \
site2
style continuation lines to be simple repeated
MASTER_SITES+= site1
MASTER_SITES+= site2
lines. As previewed on tech-pkg. With thanks to rillig for fixing pkglint
accordingly.
