When searching the block list, first try the last block we had a good

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).

1 files changed, 4 insertions, 4 deletions

diff --git a/src/mem_pool.cpp b/src/mem_pool.cpp
index 24866d172..e327b3473 100644
--- a/src/mem_pool.cpp
+++ b/src/mem_pool.cpp
@@ -244,16 +244,16 @@ byte* Pooling_Allocator::allocate_blocks(u32bit n)
 
    do
       {
-      ++i;
-      if(i == blocks.end())
-         i = blocks.begin();
-
       byte* mem = i->alloc(n);
       if(mem)
          {
          last_used = i;
          return mem;
          }
+
+      ++i;
+      if(i == blocks.end())
+         i = blocks.begin();
       }
    while(i != last_used);