You can not select more than 25 topics
Topics must start with a letter or number, can include dashes ('-') and can be up to 35 characters long.
182 lines
5.5 KiB
182 lines
5.5 KiB
//---------------------------------------------------------------------------- |
|
// 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 <assert.h> |
|
|
|
#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; |
|
|
|
assert(height == 0 || 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
|
|
|