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
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
163
164
165
166
167
168
169
170
171
172
173
174
175
176
177
178
179
180
181
182
183
184
185
186
187
188
|
// Copyright 2010 The Chromium Authors
// Use of this source code is governed by a BSD-style license that can be
// found in the LICENSE file.
#ifndef CC_BASE_TILING_DATA_H_
#define CC_BASE_TILING_DATA_H_
#include <utility>
#include "base/check_op.h"
#include "cc/base/base_export.h"
#include "cc/base/index_rect.h"
#include "cc/base/reverse_spiral_iterator.h"
#include "cc/base/spiral_iterator.h"
#include "ui/gfx/geometry/rect.h"
#include "ui/gfx/geometry/size.h"
namespace gfx {
class RectF;
class Vector2d;
}
namespace cc {
class CC_BASE_EXPORT TilingData {
public:
TilingData();
TilingData(const gfx::Size& max_texture_size,
const gfx::Rect& tiling_rect,
int border_texels);
TilingData(const gfx::Size& max_texture_size,
const gfx::Rect& tiling_rect,
bool has_border_texels) = delete;
const gfx::Rect& tiling_rect() const { return tiling_rect_; }
void SetTilingRect(const gfx::Rect& tiling_rect);
gfx::Size max_texture_size() const { return max_texture_size_; }
void SetMaxTextureSize(const gfx::Size& max_texture_size);
int border_texels() const { return border_texels_; }
bool has_empty_bounds() const { return !num_tiles_x_ || !num_tiles_y_; }
int num_tiles_x() const { return num_tiles_x_; }
int num_tiles_y() const { return num_tiles_y_; }
// The following functions map between tile indices and tile geometries.
// All positions and bounds of tiles are in layer coordinates. Tiles are
// created within `tiling_rect`, so a tile with index 0 in x/y direction
// means its x/y position is tiling_rect_.x/y() (instead of 0).
// Return the tile index whose non-border texels include src_position.
int TileXIndexFromSrcCoord(int src_position) const;
int TileYIndexFromSrcCoord(int src_position) const;
// Return the lowest tile index whose border texels include src_position.
int FirstBorderTileXIndexFromSrcCoord(int src_position) const;
int FirstBorderTileYIndexFromSrcCoord(int src_position) const;
// Return the highest tile index whose border texels include src_position.
int LastBorderTileXIndexFromSrcCoord(int src_position) const;
int LastBorderTileYIndexFromSrcCoord(int src_position) const;
// Return the tile indices around the given rect.
IndexRect TileAroundIndexRect(const gfx::Rect& center_rect) const;
gfx::Rect ExpandRectToTileBounds(const gfx::Rect& rect) const;
gfx::Rect TileBounds(int i, int j) const;
gfx::Rect TileBoundsWithBorder(int i, int j) const;
int TilePositionX(int x_index) const;
int TilePositionY(int y_index) const;
int TileSizeX(int x_index) const;
int TileSizeY(int y_index) const;
gfx::RectF TexelExtent(int i, int j) const;
// Difference between TileBound's and TileBoundWithBorder's origin().
gfx::Vector2d TextureOffset(int x_index, int y_index) const;
class CC_BASE_EXPORT BaseIterator {
public:
operator bool() const { return index_x_ != -1 && index_y_ != -1; }
int index_x() const { return index_x_; }
int index_y() const { return index_y_; }
std::pair<int, int> index() const {
return std::make_pair(index_x_, index_y_);
}
protected:
BaseIterator();
void done() {
index_x_ = -1;
index_y_ = -1;
}
int index_x_;
int index_y_;
};
// Iterate through tiles whose bounds + optional border intersect with |rect|.
class CC_BASE_EXPORT Iterator : public BaseIterator {
public:
Iterator();
Iterator(const TilingData* tiling_data,
const gfx::Rect& consider_rect,
bool include_borders);
Iterator& operator++();
private:
IndexRect index_rect_;
};
class CC_BASE_EXPORT BaseDifferenceIterator : public BaseIterator {
protected:
BaseDifferenceIterator();
BaseDifferenceIterator(const TilingData* tiling_data,
const gfx::Rect& consider_rect,
const gfx::Rect& ignore_rect);
bool HasConsiderRect() const;
IndexRect consider_index_rect_;
IndexRect ignore_index_rect_;
};
// Iterate through all indices whose bounds (not including borders) intersect
// with |consider| but which also do not intersect with |ignore|.
class CC_BASE_EXPORT DifferenceIterator : public BaseDifferenceIterator {
public:
DifferenceIterator();
DifferenceIterator(const TilingData* tiling_data,
const gfx::Rect& consider_rect,
const gfx::Rect& ignore_rect);
DifferenceIterator& operator++();
};
// Iterate through all indices whose bounds + border intersect with
// |consider| but which also do not intersect with |ignore|. The iterator
// order is a counterclockwise spiral around the given center.
class CC_BASE_EXPORT SpiralDifferenceIterator
: public BaseDifferenceIterator {
public:
SpiralDifferenceIterator();
SpiralDifferenceIterator(const TilingData* tiling_data,
const gfx::Rect& consider_rect,
const gfx::Rect& ignore_rect,
const gfx::Rect& center_rect);
SpiralDifferenceIterator& operator++();
private:
SpiralIterator spiral_iterator_;
};
class CC_BASE_EXPORT ReverseSpiralDifferenceIterator
: public BaseDifferenceIterator {
public:
ReverseSpiralDifferenceIterator();
ReverseSpiralDifferenceIterator(const TilingData* tiling_data,
const gfx::Rect& consider_rect,
const gfx::Rect& ignore_rect,
const gfx::Rect& center_rect);
ReverseSpiralDifferenceIterator& operator++();
private:
ReverseSpiralIterator reverse_spiral_iterator_;
};
private:
void AssertTile(int i, int j) const {
DCHECK_GE(i, 0);
DCHECK_LT(i, num_tiles_x_);
DCHECK_GE(j, 0);
DCHECK_LT(j, num_tiles_y_);
}
void RecomputeNumTiles();
gfx::Size max_texture_size_;
gfx::Rect tiling_rect_;
int border_texels_;
// These are computed values.
int num_tiles_x_;
int num_tiles_y_;
};
} // namespace cc
#endif // CC_BASE_TILING_DATA_H_
|
