Slightly faster quadtree searching

src/core/SkTObjectPool.h

 /*
  * Copyright 2014 Google Inc.
  *
  * Use of this source code is governed by a BSD-style license that can be
  * found in the LICENSE file.
  */
 
 #ifndef SkFreeList_DEFINED
 #define SkFreeList_DEFINED
 
@@ skipping 56 matching lines @@
      * Returns the number of items immediately available without having to
      * construct any new ones.
      */
     int available() const { return fAvailable.getCount(); }
 
     /**
      * Returns the number of blocks of items the pool has allocated so far.
      */
     int blocks() const { return fBlocks.getCount(); }
 
+    /**
+     * Returns the number of items allocated by the pool in total.
+     */
+    int allocated() const { return fBlocks.getCount() * numItemsPerBlock; }
+
 private:
     /**
      * The type for a new block of entries for the list.
      */
     struct Block {
         T entries[numItemsPerBlock];
         SK_DECLARE_INTERNAL_SLIST_INTERFACE(Block);
     };
     SkTInternalSList<Block> fBlocks;
     SkTInternalSList<T> fAvailable;
 
     /**
      * When the free list runs out of items, this method is called to allocate
      * a new block of them.
      * It calls the constructors and then pushes the nodes into the available
      * list.
      */
     void grow() {
         Block* block = SkNEW(Block);
         fBlocks.push(block);
         for(int index = 0; index < numItemsPerBlock; ++index) {
             fAvailable.push(&block->entries[index]);
         }
     }
 
 };
 
 #endif