Add heap tests for Vulkan

src/gpu/vk/GrVkMemory.cpp

 /*
 * Copyright 2015 Google Inc.
 *
 * Use of this source code is governed by a BSD-style license that can be
 * found in the LICENSE file.
 */
 
 #include "GrVkMemory.h"
 
 #include "GrVkGpu.h"
@@ skipping 357 matching lines @@
 
     return false;
 }
 
 
 void GrVkSubHeap::free(const GrVkAlloc& alloc) {
     SkASSERT(alloc.fMemory == fAlloc);
 
     // find the block right after this allocation
     FreeList::Iter iter = fFreeList.headIter();
+    FreeList::Iter prev;
     while (iter.get() && iter.get()->fOffset < alloc.fOffset) {
+        prev = iter;
         iter.next();
     } 
-    FreeList::Iter prev = iter;
-    prev.prev();
     // we have four cases:
     // we exactly follow the previous one
     Block* block;
     if (prev.get() && prev.get()->fOffset + prev.get()->fSize == alloc.fOffset) {
         block = prev.get();
         block->fSize += alloc.fSize;
         if (block->fOffset == fLargestBlockOffset) {
             fLargestBlockSize = block->fSize;
         }
         // and additionally we may exactly precede the next one
@@ skipping 46 matching lines @@
 bool GrVkHeap::subAlloc(VkDeviceSize size, VkDeviceSize alignment, 
                         uint32_t memoryTypeIndex, GrVkAlloc* alloc) {
     VkDeviceSize alignedSize = align_size(size, alignment);
 
     // first try to find a subheap that fits our allocation request
     int bestFitIndex = -1;
     VkDeviceSize bestFitSize = 0x7FFFFFFF;
     for (auto i = 0; i < fSubHeaps.count(); ++i) {
         if (fSubHeaps[i]->memoryTypeIndex() == memoryTypeIndex) {
             VkDeviceSize heapSize = fSubHeaps[i]->largestBlockSize();
-            if (heapSize > alignedSize && heapSize < bestFitSize) {
+            if (heapSize >= alignedSize && heapSize < bestFitSize) {
                 bestFitIndex = i;
                 bestFitSize = heapSize;
             }
         }
     }
 
     if (bestFitIndex >= 0) {
         SkASSERT(fSubHeaps[bestFitIndex]->alignment() == alignment);
         if (fSubHeaps[bestFitIndex]->alloc(size, alloc)) {
             fUsedSize += alloc->fSize;
@@ skipping 17 matching lines @@
 bool GrVkHeap::singleAlloc(VkDeviceSize size, VkDeviceSize alignment, 
                            uint32_t memoryTypeIndex, GrVkAlloc* alloc) {
     VkDeviceSize alignedSize = align_size(size, alignment);
 
     // first try to find an unallocated subheap that fits our allocation request
     int bestFitIndex = -1;
     VkDeviceSize bestFitSize = 0x7FFFFFFF;
     for (auto i = 0; i < fSubHeaps.count(); ++i) {
         if (fSubHeaps[i]->memoryTypeIndex() == memoryTypeIndex && fSubHeaps[i]->unallocated()) {
             VkDeviceSize heapSize = fSubHeaps[i]->size();
-            if (heapSize > alignedSize && heapSize < bestFitSize) {
+            if (heapSize >= alignedSize && heapSize < bestFitSize) {
                 bestFitIndex = i;
                 bestFitSize = heapSize;
             }
         }
     }
 
     if (bestFitIndex >= 0) {
         SkASSERT(fSubHeaps[bestFitIndex]->alignment() == alignment);
         if (fSubHeaps[bestFitIndex]->alloc(size, alloc)) {
             fUsedSize += alloc->fSize;
@@ skipping 20 matching lines @@
             fSubHeaps[i]->free(alloc);
             fUsedSize -= alloc.fSize;
             return true;
         }
     }
 
     return false;
 }