From 6c7e94ad15724b10fa57ae354e49e2f7aa59ed46 Mon Sep 17 00:00:00 2001 From: Beman Date: Tue, 28 May 2013 16:33:59 -0400 Subject: [PATCH] Add a bit more explanation of examples. Add Release history. --- doc/index.html | 49 +++++++++++++++++++++++++++++++++++++++++++++++-- 1 file changed, 47 insertions(+), 2 deletions(-) diff --git a/doc/index.html b/doc/index.html index bdd5c38..033dd98 100644 --- a/doc/index.html +++ b/doc/index.html @@ -45,6 +45,7 @@     Timings
    Conclusions
FAQ
+ Release history
Acknowledgements @@ -302,6 +303,11 @@ big_endian(x); +

With the Endian type approach, an implicit conversion from and then back to +big endian is done inside the loop. With the Endian conversion function +approach, the conversions are explicit, so only need to be done once, before and +after the loop.

+

Timings for Example 2 (conversion functions hoisted out of loop)

These tests were run against release builds on a circa 2012 4-core little endian X64 Intel Core i5-3570K @@ -426,8 +432,8 @@ times while the Endian conversion approach only does the reversal once. But if the endianness is the same, there is no conversion with either approach and no conversion code is generated for typical release builds.

-

Whether or not compiler byte swap intrinsics are available has little -impact. Byte swap intrinsics are not available on some older +

Whether or not compiler byte swap intrinsics are explicitly available has little +impact as tested. Byte swap intrinsics are not available on some older compilers and on some machine architectures, such as pre-486 X86 CPUs.

Unaligned types are much slower that aligned types, regardless of @@ -515,6 +521,45 @@ performed on machines that use two's complement arithmetic.

+

Release history

+

Changes since formal review

+ +

Acknowledgements

Comments and suggestions were received from