1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
|
//
// 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.h: Defines the gl::IndexRangeCache class which stores information about
// ranges of indices.
#ifndef LIBANGLE_INDEXRANGECACHE_H_
#define LIBANGLE_INDEXRANGECACHE_H_
#include "common/angleutils.h"
#include "common/mathutil.h"
#include "angle_gl.h"
#include <map>
namespace gl
{
class IndexRangeCache
{
public:
void addRange(GLenum type,
size_t offset,
size_t count,
bool primitiveRestartEnabled,
const IndexRange &range);
bool findRange(GLenum type,
size_t offset,
size_t count,
bool primitiveRestartEnabled,
IndexRange *outRange) const;
void invalidateRange(size_t offset, size_t size);
void clear();
private:
struct IndexRangeKey
{
IndexRangeKey();
IndexRangeKey(GLenum type, size_t offset, size_t count, bool primitiveRestart);
bool operator<(const IndexRangeKey &rhs) const;
GLenum type;
size_t offset;
size_t count;
bool primitiveRestartEnabled;
};
typedef std::map<IndexRangeKey, IndexRange> IndexRangeMap;
IndexRangeMap mIndexRangeCache;
};
}
#endif // LIBANGLE_INDEXRANGECACHE_H_
|
