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
|
/*
* Copyright 2006 The Android Open Source Project
*
* Use of this source code is governed by a BSD-style license that can be
* found in the LICENSE file.
*/
#ifndef SkBitmapSampler_DEFINED
#define SkBitmapSampler_DEFINED
#include "SkBitmap.h"
#include "SkPaint.h"
#include "SkShader.h"
typedef int (*SkTileModeProc)(int value, unsigned max);
class SkBitmapSampler {
public:
SkBitmapSampler(const SkBitmap&, bool filter, SkShader::TileMode tmx, SkShader::TileMode tmy);
virtual ~SkBitmapSampler() {}
const SkBitmap& getBitmap() const { return fBitmap; }
bool getFilterBitmap() const { return fFilterBitmap; }
SkShader::TileMode getTileModeX() const { return fTileModeX; }
SkShader::TileMode getTileModeY() const { return fTileModeY; }
/** Given a pixel center at [x,y], return the color sample
*/
virtual SkPMColor sample(SkFixed x, SkFixed y) const = 0;
virtual void setPaint(const SkPaint& paint);
// This is the factory for finding an optimal subclass
static SkBitmapSampler* Create(const SkBitmap&, bool filter,
SkShader::TileMode tmx, SkShader::TileMode tmy);
protected:
const SkBitmap& fBitmap;
uint16_t fMaxX, fMaxY;
bool fFilterBitmap;
SkShader::TileMode fTileModeX;
SkShader::TileMode fTileModeY;
SkTileModeProc fTileProcX;
SkTileModeProc fTileProcY;
// illegal
SkBitmapSampler& operator=(const SkBitmapSampler&);
};
static inline int fixed_clamp(SkFixed x)
{
#ifdef SK_CPU_HAS_CONDITIONAL_INSTR
if (x >> 16)
x = 0xFFFF;
if (x < 0)
x = 0;
#else
if (x >> 16)
{
if (x < 0)
x = 0;
else
x = 0xFFFF;
}
#endif
return x;
}
//////////////////////////////////////////////////////////////////////////////////////
static inline int fixed_repeat(SkFixed x)
{
return x & 0xFFFF;
}
static inline int fixed_mirror(SkFixed x)
{
SkFixed s = x << 15 >> 31;
// s is FFFFFFFF if we're on an odd interval, or 0 if an even interval
return (x ^ s) & 0xFFFF;
}
static inline bool is_pow2(int count)
{
SkASSERT(count > 0);
return (count & (count - 1)) == 0;
}
static inline int do_clamp(int index, unsigned max)
{
SkASSERT((int)max >= 0);
#ifdef SK_CPU_HAS_CONDITIONAL_INSTR
if (index > (int)max)
index = max;
if (index < 0)
index = 0;
#else
if ((unsigned)index > max)
{
if (index < 0)
index = 0;
else
index = max;
}
#endif
return index;
}
static inline int do_repeat_mod(int index, unsigned max)
{
SkASSERT((int)max >= 0);
if ((unsigned)index > max)
{
if (index < 0)
index = max - (~index % (max + 1));
else
index = index % (max + 1);
}
return index;
}
static inline int do_repeat_pow2(int index, unsigned max)
{
SkASSERT((int)max >= 0 && is_pow2(max + 1));
return index & max;
}
static inline int do_mirror_mod(int index, unsigned max)
{
SkASSERT((int)max >= 0);
// have to handle negatives so that
// -1 -> 0, -2 -> 1, -3 -> 2, etc.
// so we can't just cal abs
index ^= index >> 31;
if ((unsigned)index > max)
{
int mod = (max + 1) << 1;
index = index % mod;
if ((unsigned)index > max)
index = mod - index - 1;
}
return index;
}
static inline int do_mirror_pow2(int index, unsigned max)
{
SkASSERT((int)max >= 0 && is_pow2(max + 1));
int s = (index & (max + 1)) - 1;
s = ~(s >> 31);
// at this stage, s is FFFFFFFF if we're on an odd interval, or 0 if an even interval
return (index ^ s) & max;
}
#endif
|
