Method validate_index

dds/DCPS/MemoryPool.cpp:259–297

#ifdef VALIDATE_MEMORY_POOL
void
FreeIndex::validate_index(FreeIndex& index, unsigned char* base, bool log)
{
  if (log) {
    FreeIndexNode* node = index.nodes_;
    while (node < index.nodes_ + index.size_) {
      if (node->ptr()) {
        ACE_OS::printf("  IND[%4d] -> %4d\n", node->size(), node->ptr()->size());
      } else {
        ACE_OS::printf("  IND[%4d] -> NULL\n", node->size());
      }
      ++node;
    }
  }

  // Validate searches of each size
  for (size_t size = min_index; size <= max_index; size *= 2) {
    // Find size or larger
    FreeHeader* size_or_larger = index.find(size, base);
    if (size_or_larger) {
      TEST_CHECK(size_or_larger->size() >= size);
    }
  }

  // Validate each node points to a free block of the proper size;
  for (FreeIndexNode* node = index.nodes_; node < index.nodes_ + index.size_; ++node) {
    FreeHeader* block = node->ptr();
    if (block) {
      // node should point to a free block of the proper size;
      TEST_CHECK(node->contains(block->size()));

      FreeHeader* smaller = block;
      while ((smaller = smaller->smaller_free(base))) {
        // Anything smaller should be too small for this node
        TEST_CHECK(smaller->size() < node->size());
      }
    }
  }
}
#endif

MemoryPool::MemoryPool(unsigned int pool_size, size_t granularity)