| Commit message (Collapse) | Author | Age | Files | Lines |
|---|
| |
|
|
|
| |
the amalgamation build. Add a check that warns if we do this again,
and some more logging in the amalgamation generator.
|
| |
|
|
|
|
|
|
|
|
| |
each subchain of filters will run in its own thread.
Written and contributed by Joel Low.
A thread on botan-devel contains the original patch and some
discussion:
http://lists.randombit.net/pipermail/botan-devel/2013-January/001699.html
|
| |
|
|
|
|
|
|
| |
the pointer to volatile before writing to it. At least for various
versions of GCC, Clang, and ICC on x86-64, this does cause the
compiler to emit a simple byte-at-a-time loop, and at least in non-LTO
builds the compiler won't optimize the call away. For dealing with
LTO, probably would have to do some kind of complicated side-effect.
|
| |
|
|
|
|
|
|
|
|
|
| |
pointer checks as a sufficiently smart compiler might optimize way
pointer comparisons otherwise. Avoid using an iterator value after we
have released it from the map.
Reduce the default buffer size to 1K to reduce pressure on mlock
memory.
Drop the old mlock wrapper code.
|
| |
|
|
|
|
|
|
|
| |
resolution clock for this in C++11. Now that the only remaining
function in time.h is calendar_point, rename the header to
calendar.h. Hopefully that last use will go away once a TR2 datetime
library becomes available.
Use std::chrono inside the library benchmark code.
|
| |\
| |
| |
| |
| |
| | |
2898d79f992f27a328a3e41d34b46eb1052da0de)
to branch 'net.randombit.botan.c++0x' (head 6cba76268fd69a73195760c021b7f881b8a6552c)
|
| | | |
|
| | |
| |
| |
| | |
especially now that the standalone hex encoder is around
|
| |/
|
|
|
|
|
|
|
|
| |
errors of the form
if(some_expr_indicating_failure)
throw Internal_Error("Some mildly informative message");
Make this simpiler with the addition of a BOTAN_ASSERT macro which will
throw an exception upon failure.
|
| |
|
|
| |
including loadstor.h actually just needed get_byte and nothing else.
|
| | |
|
| | |
|
| | |
|
| |
|
|
| |
I tend to rewrite often in particular files while debugging things.
|
| |
|
|
|
|
|
|
|
|
|
|
|
|
| |
bswap.h); too many external apps rely on loadstor.h existing.
Define 64-bit generic bswap in terms of 32-bit bswap, since it's
not much slower if 32-bit is also generic, and much faster if
it's not. This may be quite helpful on 32-bit x86 in particular.
Change formulation of generic 32-bit bswap. It may be faster or
slower depending on the CPU, especially the latency and throuput
of rotate instructions, but should be faster on an ideally
superscalar processor with rotate instructions (ie, what I expect
future CPUs to look more like).
|
| |
|
|
|
|
|
|
|
|
|
|
|
| |
Fixes for the amalgamation generator for internal headers.
Remove BOTAN_DLL exporting macros from all internal-only headers;
the classes/functions there don't need to be exported, and
avoiding the PIC/GOT indirection can be a big win.
Add missing BOTAN_DLLs where necessary, mostly gfpmath and cvc
For GCC, use -fvisibility=hidden and set BOTAN_DLL to the
visibility __attribute__ to export those classes/functions.
|
| | |
|
| |
|
|
|
|
|
|
|
|
|
|
|
|
| |
QueryPerformanceCounter, into an entropy source hres_timer. Its
results, if any, do not count as contributing entropy to the poll.
Convert the other (monotonic/fixed epoch) timers to a single function
get_nanoseconds_clock(), living in time.h, which statically chooses
the 'best' timer type (clock_gettime, gettimeofday, std::clock, in
that order depending on what is available). Add feature test macros
for clock_gettime and gettimeofday.
Remove the Timer class and timer.h. Remove the Timer& argument to the
algorithm benchmark function.
|
| |
|
|
|
| |
Pretty much useless and unused, except for listing the module names in
build.h and the short versions totally suffice for that.
|
| | |
|
| |
|
|
|
| |
that claim to be by defining __GNUG__ (such as Intel C++)) in new utils
header prefetch.h
|
| |
|
|
| |
existing on the current CPU before returning an object.
|
| |
|
|
|
|
|
| |
- rounding.h (round_up, round_down)
- workfactor.h (dl_work_factor)
- timer.h (system_time)
And update all users of the previous util.h
|
| |
|
|
| |
Inline round_up and round_down
|
| |
|
|
|
|
|
|
|
|
|
| |
build (only libstate, utils, plus dependencies), which can be extended with
use of --enable-modules.
To add new modules to the set of always-loaded, use 'load_on always' in info.txt
Also fix a few small build problems that popped up when doing a minimal build.
Requested by a user.
|
| | |
|
| | |
|
| |
|
|
|
|
| |
the info.txt files with the right module dependencies.
Apply it across the codebase.
|
| | |
|
| |
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
| |
Combine the fast and slow polls, into a single poll() operation.
Instead of being given a buffer to write output into, the EntropySource is
passed an Entropy_Accumulator. This handles the RLE encoding that xor_into_buf
used to do. It also contains a cached I/O buffer so entropy sources do not
individually need to allocate memory for that with each poll. When data
is added to the accumulator, the source specifies an estimate of the number
of bits of entropy per byte, as a double. This is tracked in the accumulator.
Once the estimated entropy hits a target (set by the constructor), the
accumulator's member function predicate polling_goal_achieved flips to true.
This signals to the PRNG that it can stop performing polling on sources,
also polls that take a long time periodically check this flag and return
immediately.
The Win32 and BeOS entropy sources have been updated, but blindly; testing
is needed.
The test_es example program has been modified: now it polls twice and outputs
the XOR of the two collected results. That helps show if the output is consistent
across polls (not a good thing). I have noticed on the Unix entropy source,
occasionally there are many 0x00 bytes in the output, which is not optimal.
This also needs to be investigated.
The RLE is not actually RLE anymore. It works well for non-random inputs
(ASCII text, etc), but I noticed that when /dev/random output was fed into
it, the output buffer would end up being RR01RR01RR01 where RR is a random
byte and 00 is the byte count.
The buffer sizing also needs to be examined carefully. It might be useful
to choose a prime number for the size to XOR stuff into, to help ensure an
even distribution of entropy across the entire buffer space. Or: feed it
all into a hash function?
This change should (perhaps with further modifications) help WRT the
concerns Zack W raised about the RNG on the monotone-dev list.
|
| |
|
|
| |
xoring integer values in.
|
| |
|
|
|
|
| |
As with HMAC_RNG, instead assume one bit of conditional entropy per byte
of polled material. Since they are no longer used, drop the entropy
estimation routines entirely.
|
| |
|
|
| |
all over the engine code.
|
| |
|
|
|
|
| |
botan.h includes unconditionally.
Remove obsolete seed_rng code from init.h
|
| |
|
|
| |
Add some missing info.txts
|
| |
|
|
|
| |
basically). buf_comp and data_src might need their own directory, but it
doesn't really feel like it.
|
| |
|
|
| |
Move core/sym_algo.{h,cpp} to sym_algo
|
| |
|
|
|
| |
implementation), remove freestanding estimate_entropy function, change
Randpool to use entropy estimator.
|
| | |
|
| | |
|
| |
|
|
|
|
| |
in utils.
Support OS feature macros, eg BOTAN_TARGET_OS_HAS_POSIX_MLOCK (how very autoconf)
|
|
|
them modules now. In any case there is no distinction so info.txt seems
better.
|
