Add GLES2Implemention::FreeUnusedSharedMemory

gpu/command_buffer/client/fenced_allocator_test.cc

 // Copyright (c) 2011 The Chromium Authors. All rights reserved.
 // Use of this source code is governed by a BSD-style license that can be
 // found in the LICENSE file.
 
 // This file contains the tests for the FencedAllocator class.
 
 #include "base/callback.h"
 #include "base/message_loop.h"
 #include "base/mac/scoped_nsautorelease_pool.h"
 #include "gpu/command_buffer/client/cmd_buffer_helper.h"
@@ skipping 87 matching lines @@
 
     BaseFencedAllocatorTest::TearDown();
   }
 
   scoped_ptr<FencedAllocator> allocator_;
 };
 
 // Checks basic alloc and free.
 TEST_F(FencedAllocatorTest, TestBasic) {
   allocator_->CheckConsistency();
+  EXPECT_FALSE(allocator_->InUse());
 
   const unsigned int kSize = 16;
   FencedAllocator::Offset offset = allocator_->Alloc(kSize);
+  EXPECT_TRUE(allocator_->InUse());
   EXPECT_NE(FencedAllocator::kInvalidOffset, offset);
   EXPECT_GE(kBufferSize, offset+kSize);
   EXPECT_TRUE(allocator_->CheckConsistency());
 
   allocator_->Free(offset);
+  EXPECT_FALSE(allocator_->InUse());
   EXPECT_TRUE(allocator_->CheckConsistency());
 }
 
 // Checks out-of-memory condition.
 TEST_F(FencedAllocatorTest, TestOutOfMemory) {
   EXPECT_TRUE(allocator_->CheckConsistency());
 
   const unsigned int kSize = 16;
   const unsigned int kAllocCount = kBufferSize / kSize;
   CHECK(kAllocCount * kSize == kBufferSize);
@@ skipping 89 matching lines @@
   CHECK(kAllocCount * kSize == kBufferSize);
 
   // Allocate several buffers to fill in the memory.
   FencedAllocator::Offset offsets[kAllocCount];
   for (unsigned int i = 0; i < kAllocCount; ++i) {
     offsets[i] = allocator_->Alloc(kSize);
     EXPECT_NE(FencedAllocator::kInvalidOffset, offsets[i]);
     EXPECT_GE(kBufferSize, offsets[i]+kSize);
     EXPECT_TRUE(allocator_->CheckConsistency());
   }
+  EXPECT_TRUE(allocator_->InUse());
 
   // No memory should be available.
   EXPECT_EQ(0u, allocator_->GetLargestFreeSize());
 
   // Free one successful allocation, pending fence.
   int32 token = helper_.get()->InsertToken();
   allocator_->FreePendingToken(offsets[0], token);
   EXPECT_TRUE(allocator_->CheckConsistency());
 
   // Force the command buffer to process the token.
@@ skipping 16 matching lines @@
   EXPECT_EQ(kSize, allocator_->GetLargestFreeSize());
 
   // Force the command buffer to process the token.
   helper_->Finish();
 
   // Tell the allocator to update what's available based on the current token.
   allocator_->FreeUnused();
 
   // Check that the new largest free size takes into account the unused blocks.
   EXPECT_EQ(kSize * 3, allocator_->GetLargestFreeSize());
+  EXPECT_TRUE(allocator_->InUse());
 
   // Free up everything.
   for (unsigned int i = 3; i < kAllocCount; ++i) {
     allocator_->Free(offsets[i]);
     EXPECT_TRUE(allocator_->CheckConsistency());
   }
+  EXPECT_FALSE(allocator_->InUse());
 }
 
 // Tests GetLargestFreeSize
 TEST_F(FencedAllocatorTest, TestGetLargestFreeSize) {
   EXPECT_TRUE(allocator_->CheckConsistency());
   EXPECT_EQ(kBufferSize, allocator_->GetLargestFreeSize());
 
   FencedAllocator::Offset offset = allocator_->Alloc(kBufferSize);
   ASSERT_NE(FencedAllocator::kInvalidOffset, offset);
   EXPECT_EQ(0u, allocator_->GetLargestFreeSize());
@@ skipping 236 matching lines @@
   EXPECT_LE(token, GetToken());
 
   // Free up everything.
   for (unsigned int i = 0; i < kAllocCount; ++i) {
     allocator_->Free(pointers[i]);
     EXPECT_TRUE(allocator_->CheckConsistency());
   }
 }
 
 }  // namespace gpu