michael@0: #include "precompiled.h"
michael@0: //
michael@0: // Copyright (c) 2013 The ANGLE Project Authors. All rights reserved.
michael@0: // Use of this source code is governed by a BSD-style license that can be
michael@0: // found in the LICENSE file.
michael@0: //
michael@0: 
michael@0: // IndexRangeCache.cpp: Defines the rx::IndexRangeCache class which stores information about
michael@0: // ranges of indices.
michael@0: 
michael@0: #include "libGLESv2/renderer/IndexRangeCache.h"
michael@0: #include "common/debug.h"
michael@0: #include "libGLESv2/utilities.h"
michael@0: #include <tuple>
michael@0: 
michael@0: namespace rx
michael@0: {
michael@0: 
michael@0: void IndexRangeCache::addRange(GLenum type, intptr_t offset, GLsizei count, unsigned int minIdx, unsigned int maxIdx, 
michael@0:                                unsigned int streamOffset)
michael@0: {
michael@0:     mIndexRangeCache[IndexRange(type, offset, count)] = IndexBounds(minIdx, maxIdx, streamOffset);
michael@0: }
michael@0: 
michael@0: void IndexRangeCache::invalidateRange(unsigned int offset, unsigned int size)
michael@0: {
michael@0:     unsigned int invalidateStart = offset;
michael@0:     unsigned int invalidateEnd = offset + size;
michael@0: 
michael@0:     IndexRangeMap::iterator i = mIndexRangeCache.begin();
michael@0:     while (i != mIndexRangeCache.end())
michael@0:     {
michael@0:         unsigned int rangeStart = i->second.streamOffset;
michael@0:         unsigned int rangeEnd = i->second.streamOffset + (gl::ComputeTypeSize(i->first.type) * i->first.count);
michael@0: 
michael@0:         if (invalidateEnd < rangeStart || invalidateStart > rangeEnd)
michael@0:         {
michael@0:             ++i;
michael@0:         }
michael@0:         else
michael@0:         {
michael@0:             i = mIndexRangeCache.erase(i);
michael@0:         }
michael@0:     }
michael@0: }
michael@0: 
michael@0: bool IndexRangeCache::findRange(GLenum type, intptr_t offset, GLsizei count, unsigned int *outMinIndex,
michael@0:                                 unsigned int *outMaxIndex, unsigned int *outStreamOffset) const
michael@0: {
michael@0:     IndexRangeMap::const_iterator i = mIndexRangeCache.find(IndexRange(type, offset, count));
michael@0:     if (i != mIndexRangeCache.end())
michael@0:     {
michael@0:         if (outMinIndex)     *outMinIndex = i->second.minIndex;
michael@0:         if (outMaxIndex)     *outMaxIndex = i->second.maxIndex;
michael@0:         if (outStreamOffset) *outStreamOffset = i->second.streamOffset;
michael@0:         return true;
michael@0:     }
michael@0:     else
michael@0:     {
michael@0:         if (outMinIndex)     *outMinIndex = 0;
michael@0:         if (outMaxIndex)     *outMaxIndex = 0;
michael@0:         if (outStreamOffset) *outStreamOffset = 0;
michael@0:         return false;
michael@0:     }
michael@0: }
michael@0: 
michael@0: void IndexRangeCache::clear()
michael@0: {
michael@0:     mIndexRangeCache.clear();
michael@0: }
michael@0: 
michael@0: IndexRangeCache::IndexRange::IndexRange()
michael@0:     : type(GL_NONE), offset(0), count(0)
michael@0: {
michael@0: }
michael@0: 
michael@0: IndexRangeCache::IndexRange::IndexRange(GLenum typ, intptr_t off, GLsizei c)
michael@0:     : type(typ), offset(off), count(c)
michael@0: {
michael@0: }
michael@0: 
michael@0: bool IndexRangeCache::IndexRange::operator<(const IndexRange& rhs) const
michael@0: {
michael@0:     return std::make_tuple(type, offset, count) < std::make_tuple(rhs.type, rhs.offset, rhs.count);
michael@0: }
michael@0: 
michael@0: IndexRangeCache::IndexBounds::IndexBounds()
michael@0:     : minIndex(0), maxIndex(0), streamOffset(0)
michael@0: {
michael@0: }
michael@0: 
michael@0: IndexRangeCache::IndexBounds::IndexBounds(unsigned int minIdx, unsigned int maxIdx, unsigned int offset)
michael@0:     : minIndex(minIdx), maxIndex(maxIdx), streamOffset(offset)
michael@0: {
michael@0: }
michael@0: 
michael@0: }