Correctly deal with allocators added post-initialization. In particular,

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.

1 files changed, 2 insertions, 2 deletions

diff --git a/include/secmem.h b/include/secmem.h
index 84c821ec7..7873c8b1f 100644
--- a/include/secmem.h
+++ b/include/secmem.h
@@ -75,8 +75,8 @@ class MemoryRegion
          set(copy.buf, copy.used);
          }
 
-      void init(bool lock, u32bit size = 0)
-         { alloc = get_allocator(lock ? "" : "malloc"); create(size); }
+      void init(bool locking, u32bit size = 0)
+         { alloc = Allocator::get(locking); create(size); }
    private:
       T* allocate(u32bit n) const { return (T*)alloc->allocate(sizeof(T)*n); }
       void deallocate(T* p, u32bit n) const