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
|
//----------------------------------------------------------------------------
// Anti-Grain Geometry - Version 2.3
// Copyright (C) 2002-2005 Maxim Shemanarev (http://www.antigrain.com)
//
// Permission to copy, use, modify, sell and distribute this software
// is granted provided this copyright notice appears in all copies.
// This software is provided "as is" without express or implied
// warranty, and with no claim as to its suitability for any purpose.
//
//----------------------------------------------------------------------------
// Contact: mcseem@antigrain.com
// mcseemagg@yahoo.com
// http://www.antigrain.com
//----------------------------------------------------------------------------
//
// class rendering_buffer
//
//----------------------------------------------------------------------------
#ifndef AGG_RENDERING_BUFFER_INCLUDED
#define AGG_RENDERING_BUFFER_INCLUDED
#include "agg_basics.h"
namespace agg
{
//==========================================================row_ptr_cache
template<class T> class row_ptr_cache
{
public:
//--------------------------------------------------------------------
struct row_data
{
int x1, x2;
const int8u* ptr;
row_data() {}
row_data(int x1_, int x2_, const int8u* ptr_) :
x1(x1_), x2(x2_), ptr(ptr_) {}
};
//-------------------------------------------------------------------
~row_ptr_cache()
{
delete [] m_rows;
}
//-------------------------------------------------------------------
row_ptr_cache() :
m_buf(0),
m_rows(0),
m_width(0),
m_height(0),
m_stride(0),
m_max_height(0)
{
}
//--------------------------------------------------------------------
row_ptr_cache(T* _buf, unsigned _width, unsigned _height, int _stride) :
m_buf(0),
m_rows(0),
m_width(0),
m_height(0),
m_stride(0),
m_max_height(0)
{
attach(_buf, _width, _height, _stride);
}
//--------------------------------------------------------------------
void attach(T* _buf, unsigned _width, unsigned _height, int _stride)
{
m_buf = _buf;
m_width = _width;
m_height = _height;
m_stride = _stride;
if(_height > m_max_height)
{
delete [] m_rows;
m_rows = new T* [m_max_height = _height];
}
T* row_ptr = m_buf;
if(_stride < 0)
{
row_ptr = m_buf - int(_height - 1) * _stride;
}
T** _rows = m_rows;
while(_height--)
{
*_rows++ = row_ptr;
row_ptr += _stride;
}
}
//--------------------------------------------------------------------
const T* buf() const { return m_buf; }
unsigned width() const { return m_width; }
unsigned height() const { return m_height; }
int stride() const { return m_stride; }
unsigned stride_abs() const
{
return (m_stride < 0) ?
unsigned(-m_stride) :
unsigned(m_stride);
}
//--------------------------------------------------------------------
T* row(unsigned y) { return m_rows[y]; }
const T* row(unsigned y) const { return m_rows[y]; }
T* next_row(void* p) { return (T*)p + m_stride; }
const T* next_row(const void* p) const { return (T*)p + m_stride; }
T const* const* rows() const { return m_rows; }
//--------------------------------------------------------------------
void copy_from(const row_ptr_cache<T>& mtx)
{
unsigned h = height();
if(mtx.height() < h) h = mtx.height();
unsigned l = stride_abs();
if(mtx.stride_abs() < l) l = mtx.stride_abs();
l *= sizeof(T);
unsigned y;
for (y = 0; y < h; y++)
{
memcpy(row(y), mtx.row(y), l);
}
}
//--------------------------------------------------------------------
void clear(T value)
{
unsigned y;
for(y = 0; y < height(); y++)
{
T* p = row(y);
unsigned x;
for(x = 0; x < stride_abs(); x++)
{
*p++ = value;
}
}
}
private:
//--------------------------------------------------------------------
// Prohibit copying
row_ptr_cache(const row_ptr_cache<T>&);
const row_ptr_cache<T>& operator = (const row_ptr_cache<T>&);
private:
//--------------------------------------------------------------------
T* m_buf; // Pointer to renrdering buffer
T** m_rows; // Pointers to each row of the buffer
unsigned m_width; // Width in pixels
unsigned m_height; // Height in pixels
int m_stride; // Number of bytes per row. Can be < 0
unsigned m_max_height; // The maximal height (currently allocated)
};
//========================================================rendering_buffer
typedef row_ptr_cache<int8u> rendering_buffer;
}
#endif
|
