| Commit message (Collapse) | Author | Age | Files | Lines |
|---|
| |
|
|
|
| |
move in there. Make it a subclass of std::bad_alloc instead of
Botan::Exception (this may prove to be a design mistake).
|
| |
|
|
|
|
|
|
| |
In reality, Config was a singleton, with the only owner being the
Library_State object. Theoretically one could create and use another Config
instance, but in practice it was never done. Reflect the reality and inline
the members and public functions of Config in Library_State, removing Config
entirely.
|
| |
|
|
| |
new build.h macro BOTAN_MEM_POOL_CHUNK_SIZE
|
| |
|
|
|
|
| |
the actual copyright holders. For rationale, see my post to botan-devel
on April 9, subject 'Changing license to directly reflect contributors'
(http://www.randombit.net/pipermail/botan-devel/2008-April/000527.html)
|
| |
|
|
|
| |
updated dates on files that have actually changed this year. This makes
the diff across versions readable again.
|
| |
|
|
|
|
|
| |
but might as well keep it up to date. And it's easier to do it once with
a 'perl -pi' command than to update each file over time.
Apologies to anyone looking at diffs.
|
| |
|
|
|
|
|
|
|
| |
Where loadstor.h was needed but only implicitly included via bit_ops.h,
include it directly
Add endian reversal functions to bit_ops.h
Remove some unneeded includes in big_ops2.cpp and a few other files.
|
| |
|
|
| |
static_cast or reinterpret_cast, as needed.
|
| |
|
|
| |
Studio users.
|
| |
|
|
| |
fairly massive way.
|
| |
|
|
| |
from a void* to a Memory_Block, so call the constructor explicitly.
|
| | |
|
| |
|
|
| |
mem_pool.cpp with debug enabled.
|
| |
|
|
|
|
|
| |
causing allocators that were never used to allocate (and thus, later
deallocate) memory. This was causing a noticable slowdown when the mmap
based allocator was in used (based on the strace output, this was mostly
due to the calls to msync).
|
| |
|
|
|
|
|
|
| |
allocation from, rather than the block after that one. This helps the
pathalogical case where there are many full blocks and some free blocks at
the very end of the list (as then it would loop through each one, trying
and failing to allocate from an already full block until it hit the end of
the list again).
|
| |
|
|
|
|
|
|
|
|
| |
handle the case where an allocator is added that has the same name as one
already registered.
Flush the cached allocator pointer when the default is changed.
Mark comparison operations in Pooling_Allocator::Memory_Block as inline;
this seems to help the STL sort and binary search algorithms tremendously.
|
| |
|
|
|
| |
of stand-alone functions. Store the configuration in a distinct
object, rather than just a map inside the library state.
|
| | |
|
| |
|
|
|
| |
for consistency with code that uses STL iterators, as these were mostly
integer operations, though with one exception).
|
| |
|
