kc3-lang/angle/src/libANGLE/HandleAllocator.cpp

• Show log

  Commit

• Hash : 96a483bc
  Author :
  Date : 2017-06-27T16:49:21
  

  Add a ResourceMap class for faster GL resource maps.
  
  This gives a very fast query time for handles that are within a fixed
  range. For WebGL, where we don't allow create-on-bind, this will be
  100% of the time, unless we create a very large number of resources.
  
  It is implemented as a two-tier map - the first uses a flat array to
  index into a handle buffer. The second tier uses a map for out-of-
  range values.
  
  BUG=angleproject:1458
  
  Change-Id: I421bb3725cf523918cdfdbfaab035ad0dd3bf82d
  Reviewed-on: https://chromium-review.googlesource.com/544684
  Commit-Queue: Jamie Madill <jmadill@chromium.org>
  Reviewed-by: Corentin Wallez <cwallez@chromium.org>
  

Download

• src/libANGLE/HandleAllocator.cpp

• //
  // Copyright (c) 2002-2011 The ANGLE Project Authors. All rights reserved.
  // Use of this source code is governed by a BSD-style license that can be
  // found in the LICENSE file.
  //
  
  // HandleAllocator.cpp: Implements the gl::HandleAllocator class, which is used
  // to allocate GL handles.
  
  #include "libANGLE/HandleAllocator.h"
  
  #include <algorithm>
  
  #include "common/debug.h"
  
  namespace gl
  {
  
  struct HandleAllocator::HandleRangeComparator
  {
      bool operator()(const HandleRange &range, GLuint handle) const
      {
          return (range.end < handle);
      }
  };
  
  HandleAllocator::HandleAllocator() : mBaseValue(1), mNextValue(1)
  {
      mUnallocatedList.push_back(HandleRange(1, std::numeric_limits<GLuint>::max()));
  }
  
  HandleAllocator::HandleAllocator(GLuint maximumHandleValue) : mBaseValue(1), mNextValue(1)
  {
      mUnallocatedList.push_back(HandleRange(1, maximumHandleValue));
  }
  
  HandleAllocator::~HandleAllocator()
  {
  }
  
  void HandleAllocator::setBaseHandle(GLuint value)
  {
      ASSERT(mBaseValue == mNextValue);
      mBaseValue = value;
      mNextValue = value;
  }
  
  GLuint HandleAllocator::allocate()
  {
      ASSERT(!mUnallocatedList.empty() || !mReleasedList.empty());
  
      // Allocate from released list, constant time.
      if (!mReleasedList.empty())
      {
          GLuint reusedHandle = mReleasedList.back();
          mReleasedList.pop_back();
          return reusedHandle;
      }
  
      // Allocate from unallocated list, constant time.
      auto listIt = mUnallocatedList.begin();
  
      GLuint freeListHandle = listIt->begin;
      ASSERT(freeListHandle > 0);
  
      if (listIt->begin == listIt->end)
      {
          mUnallocatedList.erase(listIt);
      }
      else
      {
          listIt->begin++;
      }
  
      return freeListHandle;
  }
  
  void HandleAllocator::release(GLuint handle)
  {
      // Add to released list, constant time.
      mReleasedList.push_back(handle);
  }
  
  void HandleAllocator::reserve(GLuint handle)
  {
      // Clear from released list -- might be a slow operation.
      if (!mReleasedList.empty())
      {
          auto releasedIt = std::find(mReleasedList.begin(), mReleasedList.end(), handle);
          if (releasedIt != mReleasedList.end())
          {
              mReleasedList.erase(releasedIt);
              return;
          }
      }
  
      // Not in released list, reserve in the unallocated list.
      auto boundIt = std::lower_bound(mUnallocatedList.begin(), mUnallocatedList.end(), handle, HandleRangeComparator());
  
      ASSERT(boundIt != mUnallocatedList.end());
  
      GLuint begin = boundIt->begin;
      GLuint end = boundIt->end;
  
      if (handle == begin || handle == end)
      {
          if (begin == end)
          {
              mUnallocatedList.erase(boundIt);
          }
          else if (handle == begin)
          {
              boundIt->begin++;
          }
          else
          {
              ASSERT(handle == end);
              boundIt->end--;
          }
          return;
      }
  
      ASSERT(begin < handle && handle < end);
  
      // need to split the range
      auto placementIt = mUnallocatedList.erase(boundIt);
      placementIt      = mUnallocatedList.insert(placementIt, HandleRange(handle + 1, end));
      mUnallocatedList.insert(placementIt, HandleRange(begin, handle - 1));
  }
  
  void HandleAllocator::reset()
  {
      mUnallocatedList.clear();
      mUnallocatedList.push_back(HandleRange(1, std::numeric_limits<GLuint>::max()));
      mReleasedList.clear();
      mBaseValue = 1;
      mNextValue = 1;
  }
  
  }  // namespace gl
  

Download