/**************************************************************************** ** ** Copyright (C) 2013 Digia Plc and/or its subsidiary(-ies). ** Contact: http://www.qt-project.org/legal ** ** This file is part of the Qt scene graph research project. ** ** $QT_BEGIN_LICENSE:LGPL$ ** Commercial License Usage ** Licensees holding valid commercial Qt licenses may use this file in ** accordance with the commercial license agreement provided with the ** Software or, alternatively, in accordance with the terms contained in ** a written agreement between you and Digia. For licensing terms and ** conditions see http://qt.digia.com/licensing. For further information ** use the contact form at http://qt.digia.com/contact-us. ** ** GNU Lesser General Public License Usage ** Alternatively, this file may be used under the terms of the GNU Lesser ** General Public License version 2.1 as published by the Free Software ** Foundation and appearing in the file LICENSE.LGPL included in the ** packaging of this file. Please review the following information to ** ensure the GNU Lesser General Public License version 2.1 requirements ** will be met: http://www.gnu.org/licenses/old-licenses/lgpl-2.1.html. ** ** In addition, as a special exception, Digia gives you certain additional ** rights. These rights are described in the Digia Qt LGPL Exception ** version 1.1, included in the file LGPL_EXCEPTION.txt in this package. ** ** GNU General Public License Usage ** Alternatively, this file may be used under the terms of the GNU ** General Public License version 3.0 as published by the Free Software ** Foundation and appearing in the file LICENSE.GPL included in the ** packaging of this file. Please review the following information to ** ensure the GNU General Public License version 3.0 requirements will be ** met: http://www.gnu.org/copyleft/gpl.html. ** ** ** $QT_END_LICENSE$ ** ****************************************************************************/ #ifndef QSGGEOMETRY_H #define QSGGEOMETRY_H #include #include #include QT_BEGIN_NAMESPACE class QSGGeometryData; class Q_QUICK_EXPORT QSGGeometry { public: struct Q_QUICK_EXPORT Attribute { int position; int tupleSize; int type; uint isVertexCoordinate : 1; uint reserved : 31; static Attribute create(int pos, int tupleSize, int primitiveType, bool isPosition = false); }; struct AttributeSet { int count; int stride; const Attribute *attributes; }; struct Point2D { float x, y; void set(float nx, float ny) { x = nx; y = ny; } }; struct TexturedPoint2D { float x, y; float tx, ty; void set(float nx, float ny, float ntx, float nty) { x = nx; y = ny; tx = ntx; ty = nty; } }; struct ColoredPoint2D { float x, y; unsigned char r, g, b, a; void set(float nx, float ny, uchar nr, uchar ng, uchar nb, uchar na) { x = nx; y = ny; r = nr; g = ng, b = nb; a = na; } }; static const AttributeSet &defaultAttributes_Point2D(); static const AttributeSet &defaultAttributes_TexturedPoint2D(); static const AttributeSet &defaultAttributes_ColoredPoint2D(); enum DataPattern { AlwaysUploadPattern = 0, StreamPattern = 1, DynamicPattern = 2, StaticPattern = 3 }; QSGGeometry(const QSGGeometry::AttributeSet &attribs, int vertexCount, int indexCount = 0, int indexType = GL_UNSIGNED_SHORT); virtual ~QSGGeometry(); void setDrawingMode(GLenum mode); inline GLenum drawingMode() const { return m_drawing_mode; } void allocate(int vertexCount, int indexCount = 0); int vertexCount() const { return m_vertex_count; } void *vertexData() { return m_data; } inline Point2D *vertexDataAsPoint2D(); inline TexturedPoint2D *vertexDataAsTexturedPoint2D(); inline ColoredPoint2D *vertexDataAsColoredPoint2D(); inline const void *vertexData() const { return m_data; } inline const Point2D *vertexDataAsPoint2D() const; inline const TexturedPoint2D *vertexDataAsTexturedPoint2D() const; inline const ColoredPoint2D *vertexDataAsColoredPoint2D() const; inline int indexType() const { return m_index_type; } int indexCount() const { return m_index_count; } void *indexData(); inline uint *indexDataAsUInt(); inline quint16 *indexDataAsUShort(); inline int sizeOfIndex() const; const void *indexData() const; inline const uint *indexDataAsUInt() const; inline const quint16 *indexDataAsUShort() const; inline int attributeCount() const { return m_attributes.count; } inline const Attribute *attributes() const { return m_attributes.attributes; } inline int sizeOfVertex() const { return m_attributes.stride; } static void updateRectGeometry(QSGGeometry *g, const QRectF &rect); static void updateTexturedRectGeometry(QSGGeometry *g, const QRectF &rect, const QRectF &sourceRect); void setIndexDataPattern(DataPattern p); DataPattern indexDataPattern() const { return DataPattern(m_index_usage_pattern); } void setVertexDataPattern(DataPattern p); DataPattern vertexDataPattern() const { return DataPattern(m_vertex_usage_pattern); } void markIndexDataDirty(); void markVertexDataDirty(); float lineWidth() const; void setLineWidth(float w); private: friend class QSGGeometryData; int m_drawing_mode; int m_vertex_count; int m_index_count; int m_index_type; const AttributeSet &m_attributes; void *m_data; int m_index_data_offset; QSGGeometryData *m_server_data; uint m_owns_data : 1; uint m_index_usage_pattern : 2; uint m_vertex_usage_pattern : 2; uint m_dirty_index_data : 1; uint m_dirty_vertex_data : 1; uint m_reserved_bits : 25; float m_prealloc[16]; float m_line_width; }; inline uint *QSGGeometry::indexDataAsUInt() { Q_ASSERT(m_index_type == GL_UNSIGNED_INT); return static_cast(indexData()); } inline quint16 *QSGGeometry::indexDataAsUShort() { Q_ASSERT(m_index_type == GL_UNSIGNED_SHORT); return static_cast(indexData()); } inline const uint *QSGGeometry::indexDataAsUInt() const { Q_ASSERT(m_index_type == GL_UNSIGNED_INT); return static_cast(indexData()); } inline const quint16 *QSGGeometry::indexDataAsUShort() const { Q_ASSERT(m_index_type == GL_UNSIGNED_SHORT); return static_cast(indexData()); } inline QSGGeometry::Point2D *QSGGeometry::vertexDataAsPoint2D() { Q_ASSERT(m_attributes.count == 1); Q_ASSERT(m_attributes.stride == 2 * sizeof(float)); Q_ASSERT(m_attributes.attributes[0].tupleSize == 2); Q_ASSERT(m_attributes.attributes[0].type == GL_FLOAT); Q_ASSERT(m_attributes.attributes[0].position == 0); return static_cast(m_data); } inline QSGGeometry::TexturedPoint2D *QSGGeometry::vertexDataAsTexturedPoint2D() { Q_ASSERT(m_attributes.count == 2); Q_ASSERT(m_attributes.stride == 4 * sizeof(float)); Q_ASSERT(m_attributes.attributes[0].position == 0); Q_ASSERT(m_attributes.attributes[0].tupleSize == 2); Q_ASSERT(m_attributes.attributes[0].type == GL_FLOAT); Q_ASSERT(m_attributes.attributes[1].position == 1); Q_ASSERT(m_attributes.attributes[1].tupleSize == 2); Q_ASSERT(m_attributes.attributes[1].type == GL_FLOAT); return static_cast(m_data); } inline QSGGeometry::ColoredPoint2D *QSGGeometry::vertexDataAsColoredPoint2D() { Q_ASSERT(m_attributes.count == 2); Q_ASSERT(m_attributes.stride == 2 * sizeof(float) + 4 * sizeof(char)); Q_ASSERT(m_attributes.attributes[0].position == 0); Q_ASSERT(m_attributes.attributes[0].tupleSize == 2); Q_ASSERT(m_attributes.attributes[0].type == GL_FLOAT); Q_ASSERT(m_attributes.attributes[1].position == 1); Q_ASSERT(m_attributes.attributes[1].tupleSize == 4); Q_ASSERT(m_attributes.attributes[1].type == GL_UNSIGNED_BYTE); return static_cast(m_data); } inline const QSGGeometry::Point2D *QSGGeometry::vertexDataAsPoint2D() const { Q_ASSERT(m_attributes.count == 1); Q_ASSERT(m_attributes.stride == 2 * sizeof(float)); Q_ASSERT(m_attributes.attributes[0].tupleSize == 2); Q_ASSERT(m_attributes.attributes[0].type == GL_FLOAT); Q_ASSERT(m_attributes.attributes[0].position == 0); return static_cast(m_data); } inline const QSGGeometry::TexturedPoint2D *QSGGeometry::vertexDataAsTexturedPoint2D() const { Q_ASSERT(m_attributes.count == 2); Q_ASSERT(m_attributes.stride == 4 * sizeof(float)); Q_ASSERT(m_attributes.attributes[0].position == 0); Q_ASSERT(m_attributes.attributes[0].tupleSize == 2); Q_ASSERT(m_attributes.attributes[0].type == GL_FLOAT); Q_ASSERT(m_attributes.attributes[1].position == 1); Q_ASSERT(m_attributes.attributes[1].tupleSize == 2); Q_ASSERT(m_attributes.attributes[1].type == GL_FLOAT); return static_cast(m_data); } inline const QSGGeometry::ColoredPoint2D *QSGGeometry::vertexDataAsColoredPoint2D() const { Q_ASSERT(m_attributes.count == 2); Q_ASSERT(m_attributes.stride == 2 * sizeof(float) + 4 * sizeof(char)); Q_ASSERT(m_attributes.attributes[0].position == 0); Q_ASSERT(m_attributes.attributes[0].tupleSize == 2); Q_ASSERT(m_attributes.attributes[0].type == GL_FLOAT); Q_ASSERT(m_attributes.attributes[1].position == 1); Q_ASSERT(m_attributes.attributes[1].tupleSize == 4); Q_ASSERT(m_attributes.attributes[1].type == GL_UNSIGNED_BYTE); return static_cast(m_data); } int QSGGeometry::sizeOfIndex() const { if (m_index_type == GL_UNSIGNED_SHORT) return 2; else if (m_index_type == GL_UNSIGNED_BYTE) return 1; else if (m_index_type == GL_UNSIGNED_INT) return 4; return 0; } QT_END_NAMESPACE #endif // QSGGEOMETRY_H