blob: 1f6a16f1db961bf8d826574b1897cf8ed557fb18 [file] [log] [blame]
Geoff Langf23eb282013-07-22 10:52:19 -04001#include "precompiled.h"
2//
3// Copyright (c) 2013 The ANGLE Project Authors. All rights reserved.
4// Use of this source code is governed by a BSD-style license that can be
5// found in the LICENSE file.
6//
7
8// IndexRangeCache.cpp: Defines the rx::IndexRangeCache class which stores information about
9// ranges of indices.
10
11#include "libGLESv2/renderer/IndexRangeCache.h"
12#include "libGLESv2/formatutils.h"
13#include "common/debug.h"
14#include <tuple>
15
16namespace rx
17{
18
Jamie Madill39b43462014-08-18 16:39:50 -040019void IndexRangeCache::addRange(GLenum type, unsigned int offset, GLsizei count, const RangeUI &range,
Geoff Langf23eb282013-07-22 10:52:19 -040020 unsigned int streamOffset)
21{
Jamie Madill39b43462014-08-18 16:39:50 -040022 mIndexRangeCache[IndexRange(type, offset, count)] = IndexBounds(range, streamOffset);
Geoff Langf23eb282013-07-22 10:52:19 -040023}
24
25void IndexRangeCache::invalidateRange(unsigned int offset, unsigned int size)
26{
27 unsigned int invalidateStart = offset;
28 unsigned int invalidateEnd = offset + size;
29
30 IndexRangeMap::iterator i = mIndexRangeCache.begin();
31 while (i != mIndexRangeCache.end())
32 {
33 unsigned int rangeStart = i->second.streamOffset;
Geoff Lang5d601382014-07-22 15:14:06 -040034 unsigned int rangeEnd = i->second.streamOffset + (gl::GetTypeInfo(i->first.type).bytes * i->first.count);
Geoff Langf23eb282013-07-22 10:52:19 -040035
36 if (invalidateEnd < rangeStart || invalidateStart > rangeEnd)
37 {
38 ++i;
39 }
40 else
41 {
42 i = mIndexRangeCache.erase(i);
43 }
44 }
45}
46
Jamie Madill39b43462014-08-18 16:39:50 -040047bool IndexRangeCache::findRange(GLenum type, unsigned int offset, GLsizei count,
48 RangeUI *outRange, unsigned int *outStreamOffset) const
Geoff Langf23eb282013-07-22 10:52:19 -040049{
50 IndexRangeMap::const_iterator i = mIndexRangeCache.find(IndexRange(type, offset, count));
51 if (i != mIndexRangeCache.end())
52 {
Jamie Madill39b43462014-08-18 16:39:50 -040053 if (outRange) *outRange = i->second.range;
Geoff Langf23eb282013-07-22 10:52:19 -040054 if (outStreamOffset) *outStreamOffset = i->second.streamOffset;
55 return true;
56 }
57 else
58 {
Jamie Madill39b43462014-08-18 16:39:50 -040059 if (outRange) *outRange = RangeUI(0, 0);
Geoff Langf23eb282013-07-22 10:52:19 -040060 if (outStreamOffset) *outStreamOffset = 0;
61 return false;
62 }
63}
64
65void IndexRangeCache::clear()
66{
67 mIndexRangeCache.clear();
68}
69
70IndexRangeCache::IndexRange::IndexRange()
71 : type(GL_NONE), offset(0), count(0)
72{
73}
74
75IndexRangeCache::IndexRange::IndexRange(GLenum typ, intptr_t off, GLsizei c)
76 : type(typ), offset(off), count(c)
77{
78}
79
80bool IndexRangeCache::IndexRange::operator<(const IndexRange& rhs) const
81{
82 return std::make_tuple(type, offset, count) < std::make_tuple(rhs.type, rhs.offset, rhs.count);
83}
84
85IndexRangeCache::IndexBounds::IndexBounds()
Jamie Madill39b43462014-08-18 16:39:50 -040086 : range(0, 0),
87 streamOffset(0)
Geoff Langf23eb282013-07-22 10:52:19 -040088{
89}
90
Jamie Madill39b43462014-08-18 16:39:50 -040091IndexRangeCache::IndexBounds::IndexBounds(const RangeUI &rangeIn, unsigned int offset)
92 : range(rangeIn), streamOffset(offset)
Geoff Langf23eb282013-07-22 10:52:19 -040093{
94}
95
96}