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

• Show log

  Commit

• Hash : 831b1953
  Author :
  Date : 2015-05-05T11:02:27
  

  Move the IndexRangeCache and Range types to the gl namespace.
  
  BUG=angleproject:881
  
  Change-Id: Ib05149facee9fcc7714cb957ca8647b3498a36b6
  Reviewed-on: https://chromium-review.googlesource.com/269254
  Reviewed-by: Jamie Madill <jmadill@chromium.org>
  Tested-by: Geoff Lang <geofflang@chromium.org>
  Reviewed-by: Brandon Jones <bajones@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, unsigned int offset, GLsizei count, const RangeUI &range)
  {
      mIndexRangeCache[IndexRange(type, offset, count)] = range;
  }
  
  void IndexRangeCache::invalidateRange(unsigned int offset, unsigned int size)
  {
      unsigned int invalidateStart = offset;
      unsigned int invalidateEnd = offset + size;
  
      IndexRangeMap::iterator i = mIndexRangeCache.begin();
      while (i != mIndexRangeCache.end())
      {
          unsigned int rangeStart = i->first.offset;
          unsigned int rangeEnd = i->first.offset + (GetTypeInfo(i->first.type).bytes * i->first.count);
  
          if (invalidateEnd < rangeStart || invalidateStart > rangeEnd)
          {
              ++i;
          }
          else
          {
              mIndexRangeCache.erase(i++);
          }
      }
  }
  
  bool IndexRangeCache::findRange(GLenum type, unsigned int offset, GLsizei count,
                                  RangeUI *outRange) const
  {
      IndexRangeMap::const_iterator i = mIndexRangeCache.find(IndexRange(type, offset, count));
      if (i != mIndexRangeCache.end())
      {
          if (outRange)
          {
              *outRange = i->second;
          }
          return true;
      }
      else
      {
          if (outRange)
          {
              *outRange = RangeUI(0, 0);
          }
          return false;
      }
  }
  
  void IndexRangeCache::clear()
  {
      mIndexRangeCache.clear();
  }
  
  IndexRangeCache::IndexRange::IndexRange()
      : IndexRangeCache::IndexRange(GL_NONE, 0, 0)
  {
  }
  
  IndexRangeCache::IndexRange::IndexRange(GLenum typ, intptr_t off, GLsizei c)
      : type(typ),
        offset(static_cast<unsigned int>(off)),
        count(c)
  {
  }
  
  bool IndexRangeCache::IndexRange::operator<(const IndexRange& rhs) const
  {
      if (type != rhs.type) return type < rhs.type;
      if (offset != rhs.offset) return offset < rhs.offset;
      return count < rhs.count;
  }
  
  }
  

Download