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

• Show log

  Commit

• Hash : 3edfe034
  Author :
  Date : 2015-09-04T16:38:24
  

  Support primitive restart in RendererGL.
  
  Store index ranges in a new struct that tracks how many real indices were
  seen.  Update index caching to key on primitive restart being enabled and
  update index counting functions to skip primitive restart indicies when
  needed.
  
  Passes dEQP-GLES3.functional.primitive_restart.*
  
  Change-Id: Id1e25a5adcdcd4e998836e8ff6679c64be4c3066
  Reviewed-on: https://chromium-review.googlesource.com/297770
  Tryjob-Request: Geoff Lang <geofflang@chromium.org>
  Reviewed-by: Geoff Lang <geofflang@chromium.org>
  Tested-by: Geoff Lang <geofflang@chromium.org>
  

Download

• src/libANGLE/IndexRangeCache.cpp

• //
  // Copyright (c) 2013 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.
  //
  
  // IndexRangeCache.cpp: Defines the gl::IndexRangeCache class which stores information about
  // ranges of indices.
  
  #include "libANGLE/IndexRangeCache.h"
  
  #include "common/debug.h"
  #include "libANGLE/formatutils.h"
  
  namespace gl
  {
  
  void IndexRangeCache::addRange(GLenum type,
                                 size_t offset,
                                 size_t count,
                                 bool primitiveRestartEnabled,
                                 const IndexRange &range)
  {
      mIndexRangeCache[IndexRangeKey(type, offset, count, primitiveRestartEnabled)] = range;
  }
  
  bool IndexRangeCache::findRange(GLenum type,
                                  size_t offset,
                                  size_t count,
                                  bool primitiveRestartEnabled,
                                  IndexRange *outRange) const
  {
      auto i = mIndexRangeCache.find(IndexRangeKey(type, offset, count, primitiveRestartEnabled));
      if (i != mIndexRangeCache.end())
      {
          if (outRange)
          {
              *outRange = i->second;
          }
          return true;
      }
      else
      {
          if (outRange)
          {
              *outRange = IndexRange();
          }
          return false;
      }
  }
  
  void IndexRangeCache::invalidateRange(size_t offset, size_t size)
  {
      size_t invalidateStart = offset;
      size_t invalidateEnd   = offset + size;
  
      auto i = mIndexRangeCache.begin();
      while (i != mIndexRangeCache.end())
      {
          size_t rangeStart = i->first.offset;
          size_t rangeEnd   = i->first.offset + (GetTypeInfo(i->first.type).bytes * i->first.count);
  
          if (invalidateEnd < rangeStart || invalidateStart > rangeEnd)
          {
              ++i;
          }
          else
          {
              mIndexRangeCache.erase(i++);
          }
      }
  }
  
  void IndexRangeCache::clear()
  {
      mIndexRangeCache.clear();
  }
  
  IndexRangeCache::IndexRangeKey::IndexRangeKey()
      : IndexRangeCache::IndexRangeKey(GL_NONE, 0, 0, false)
  {
  }
  
  IndexRangeCache::IndexRangeKey::IndexRangeKey(GLenum type_,
                                                size_t offset_,
                                                size_t count_,
                                                bool primitiveRestartEnabled_)
      : type(type_), offset(offset_), count(count_), primitiveRestartEnabled(primitiveRestartEnabled_)
  {
  }
  
  bool IndexRangeCache::IndexRangeKey::operator<(const IndexRangeKey &rhs) const
  {
      if (type != rhs.type)
      {
          return type < rhs.type;
      }
      if (offset != rhs.offset)
      {
          return offset < rhs.offset;
      }
      if (count != rhs.count)
      {
          return count < rhs.count;
      }
      if (primitiveRestartEnabled != rhs.primitiveRestartEnabled)
      {
          return primitiveRestartEnabled;
      }
      return false;
  }
  
  }
  

Download