/****************************************************************************
**
** Copyright (C) 2010 Nokia Corporation and/or its subsidiary(-ies).
** All rights reserved.
** Contact: Nokia Corporation (qt-info@nokia.com)
**
** This file is part of the QtGui module of the Qt Toolkit.
**
** $QT_BEGIN_LICENSE:LGPL$
** No Commercial Usage
** This file contains pre-release code and may not be distributed.
** You may use this file in accordance with the terms and conditions
** contained in the Technology Preview License Agreement accompanying
** this package.
**
** 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, Nokia gives you certain additional
** rights. These rights are described in the Nokia Qt LGPL Exception
** version 1.1, included in the file LGPL_EXCEPTION.txt in this package.
**
** If you have questions regarding the use of this file, please contact
** Nokia at qt-info@nokia.com.
**
**
**
**
**
**
**
**
** $QT_END_LICENSE$
**
****************************************************************************/
#include "qoutlinemapper_p.h"
#include <private/qpainterpath_p.h>
#include "qmath.h"
#include <stdlib.h>
QT_BEGIN_NAMESPACE
static const qreal aliasedCoordinateDelta = 0.5 - 0.015625;
#define qreal_to_fixed_26_6(f) (int(f * 64))
static const QRectF boundingRect(const QPointF *points, int pointCount)
{
const QPointF *e = points;
const QPointF *last = points + pointCount;
qreal minx, maxx, miny, maxy;
minx = maxx = e->x();
miny = maxy = e->y();
while (++e < last) {
if (e->x() < minx)
minx = e->x();
else if (e->x() > maxx)
maxx = e->x();
if (e->y() < miny)
miny = e->y();
else if (e->y() > maxy)
maxy = e->y();
}
return QRectF(QPointF(minx, miny), QPointF(maxx, maxy));
}
QT_FT_Outline *QOutlineMapper::convertPath(const QPainterPath &path)
{
Q_ASSERT(!path.isEmpty());
int elmCount = path.elementCount();
#ifdef QT_DEBUG_CONVERT
printf("QOutlineMapper::convertPath(), size=%d\n", elmCount);
#endif
beginOutline(path.fillRule());
for (int index=0; index<elmCount; ++index) {
const QPainterPath::Element &elm = path.elementAt(index);
switch (elm.type) {
case QPainterPath::MoveToElement:
if (index == elmCount - 1)
continue;
moveTo(elm);
break;
case QPainterPath::LineToElement:
lineTo(elm);
break;
case QPainterPath::CurveToElement:
curveTo(elm, path.elementAt(index + 1), path.elementAt(index + 2));
index += 2;
break;
default:
break; // This will never hit..
}
}
endOutline();
return outline();
}
QT_FT_Outline *QOutlineMapper::convertPath(const QVectorPath &path)
{
int count = path.elementCount();
#ifdef QT_DEBUG_CONVERT
printf("QOutlineMapper::convertPath(VP), size=%d\n", count);
#endif
beginOutline(path.hasWindingFill() ? Qt::WindingFill : Qt::OddEvenFill);
if (path.elements()) {
// TODO: if we do closing of subpaths in convertElements instead we
// could avoid this loop
const QPainterPath::ElementType *elements = path.elements();
const QPointF *points = reinterpret_cast<const QPointF *>(path.points());
for (int index = 0; index < count; ++index) {
switch (elements[index]) {
case QPainterPath::MoveToElement:
if (index == count - 1)
continue;
moveTo(points[index]);
break;
case QPainterPath::LineToElement:
lineTo(points[index]);
break;
case QPainterPath::CurveToElement:
curveTo(points[index], points[index+1], points[index+2]);
index += 2;
break;
default:
break; // This will never hit..
}
}
} else {
// ### We can kill this copying and just use the buffer straight...
m_elements.resize(count);
memcpy(m_elements.data(), path.points(), count* sizeof(QPointF));
m_element_types.resize(0);
}
endOutline();
return outline();
}
void QOutlineMapper::endOutline()
{
closeSubpath();
int element_count = m_elements.size();
if (element_count == 0) {
memset(&m_outline, 0, sizeof(m_outline));
return;
}
QPointF *elements;
// Transform the outline
if (m_txop == QTransform::TxNone) {
elements = m_elements.data();
} else {
if (m_txop == QTransform::TxTranslate) {
for (int i=0; i<m_elements.size(); ++i) {
const QPointF &e = m_elements.at(i);
m_elements_dev << QPointF(e.x() + m_dx, e.y() + m_dy);
}
} else if (m_txop == QTransform::TxScale) {
for (int i=0; i<m_elements.size(); ++i) {
const QPointF &e = m_elements.at(i);
m_elements_dev << QPointF(m_m11 * e.x() + m_dx, m_m22 * e.y() + m_dy);
}
} else if (m_txop < QTransform::TxProject) {
for (int i=0; i<m_elements.size(); ++i) {
const QPointF &e = m_elements.at(i);
m_elements_dev << QPointF(m_m11 * e.x() + m_m21 * e.y() + m_dx,
m_m22 * e.y() + m_m12 * e.x() + m_dy);
}
} else {
const QVectorPath vp((qreal *)m_elements.data(), m_elements.size(), m_element_types.size() ? m_element_types.data() : 0);
QPainterPath path = vp.convertToPainterPath();
path = QTransform(m_m11, m_m12, m_m13, m_m21, m_m22, m_m23, m_dx, m_dy, m_m33).map(path);
if (!(m_outline.flags & QT_FT_OUTLINE_EVEN_ODD_FILL))
path.setFillRule(Qt::WindingFill);
uint old_txop = m_txop;
m_txop = QTransform::TxNone;
if (path.isEmpty())
m_valid = false;
else
convertPath(path);
m_txop = old_txop;
return;
}
elements = m_elements_dev.data();
}
if (m_round_coords) {
// round coordinates to match outlines drawn with drawLine_midpoint_i
for (int i = 0; i < m_elements.size(); ++i)
elements[i] = QPointF(qFloor(elements[i].x() + aliasedCoordinateDelta),
qFloor(elements[i].y() + aliasedCoordinateDelta));
}
controlPointRect = boundingRect(elements, element_count);
#ifdef QT_DEBUG_CONVERT
printf(" - control point rect (%.2f, %.2f) %.2f x %.2f, clip=(%d,%d, %dx%d)\n",
controlPointRect.x(), controlPointRect.y(),
controlPointRect.width(), controlPointRect.height(),
m_clip_rect.x(), m_clip_rect.y(), m_clip_rect.width(), m_clip_rect.height());
#endif
// Check for out of dev bounds...
const bool do_clip = (controlPointRect.left() < -QT_RASTER_COORD_LIMIT
|| controlPointRect.right() > QT_RASTER_COORD_LIMIT
|| controlPointRect.top() < -QT_RASTER_COORD_LIMIT
|| controlPointRect.bottom() > QT_RASTER_COORD_LIMIT
|| controlPointRect.width() > QT_RASTER_COORD_LIMIT
|| controlPointRect.height() > QT_RASTER_COORD_LIMIT);
if (do_clip) {
clipElements(elements, elementTypes(), element_count);
} else {
convertElements(elements, elementTypes(), element_count);
}
}
void QOutlineMapper::convertElements(const QPointF *elements,
const QPainterPath::ElementType *types,
int element_count)
{
if (types) {
// Translate into FT coords
const QPointF *e = elements;
for (int i=0; i<element_count; ++i) {
switch (*types) {
case QPainterPath::MoveToElement:
{
QT_FT_Vector pt_fixed = { qreal_to_fixed_26_6(e->x()),
qreal_to_fixed_26_6(e->y()) };
if (i != 0)
m_contours << m_points.size() - 1;
m_points << pt_fixed;
m_tags << QT_FT_CURVE_TAG_ON;
}
break;
case QPainterPath::LineToElement:
{
QT_FT_Vector pt_fixed = { qreal_to_fixed_26_6(e->x()),
qreal_to_fixed_26_6(e->y()) };
m_points << pt_fixed;
m_tags << QT_FT_CURVE_TAG_ON;
}
break;
case QPainterPath::CurveToElement:
{
QT_FT_Vector cp1_fixed = { qreal_to_fixed_26_6(e->x()),
qreal_to_fixed_26_6(e->y()) };
++e;
QT_FT_Vector cp2_fixed = { qreal_to_fixed_26_6((e)->x()),
qreal_to_fixed_26_6((e)->y()) };
++e;
QT_FT_Vector ep_fixed = { qreal_to_fixed_26_6((e)->x()),
qreal_to_fixed_26_6((e)->y()) };
m_points << cp1_fixed << cp2_fixed << ep_fixed;
m_tags << QT_FT_CURVE_TAG_CUBIC
<< QT_FT_CURVE_TAG_CUBIC
<< QT_FT_CURVE_TAG_ON;
types += 2;
i += 2;
}
break;
default:
break;
}
++types;
++e;
}
} else {
// Plain polygon...
const QPointF *last = elements + element_count;
const QPointF *e = elements;
while (e < last) {
QT_FT_Vector pt_fixed = { qreal_to_fixed_26_6(e->x()),
qreal_to_fixed_26_6(e->y()) };
m_points << pt_fixed;
m_tags << QT_FT_CURVE_TAG_ON;
++e;
}
}
// close the very last subpath
m_contours << m_points.size() - 1;
m_outline.n_contours = m_contours.size();
m_outline.n_points = m_points.size();
m_outline.points = m_points.data();
m_outline.tags = m_tags.data();
m_outline.contours = m_contours.data();
#ifdef QT_DEBUG_CONVERT
printf("QOutlineMapper::endOutline\n");
printf(" - contours: %d\n", m_outline.n_contours);
for (int i=0; i<m_outline.n_contours; ++i) {
printf(" - %d\n", m_outline.contours[i]);
}
printf(" - points: %d\n", m_outline.n_points);
for (int i=0; i<m_outline.n_points; ++i) {
printf(" - %d -- %.2f, %.2f, (%d, %d)\n", i,
(double) (m_outline.points[i].x / 64.0),
(double) (m_outline.points[i].y / 64.0),
(int) m_outline.points[i].x, (int) m_outline.points[i].y);
}
#endif
}
void QOutlineMapper::clipElements(const QPointF *elements,
const QPainterPath::ElementType *types,
int element_count)
{
// We could save a bit of time by actually implementing them fully
// instead of going through convenience functionallity, but since
// this part of code hardly every used, it shouldn't matter.
QPainterPath path;
if (types) {
for (int i=0; i<element_count; ++i) {
switch (types[i]) {
case QPainterPath::MoveToElement:
path.moveTo(elements[i]);
break;
case QPainterPath::LineToElement:
path.lineTo(elements[i]);
break;
case QPainterPath::CurveToElement:
path.cubicTo(elements[i], elements[i+1], elements[i+2]);
i += 2;
break;
default:
break;
}
}
} else {
path.moveTo(elements[0]);
for (int i=1; i<element_count; ++i)
path.lineTo(elements[i]);
}
QPainterPath clipPath;
clipPath.addRect(m_clip_rect);
QPainterPath clippedPath = path.intersected(clipPath);
uint old_txop = m_txop;
m_txop = QTransform::TxNone;
if (clippedPath.isEmpty())
m_valid = false;
else
convertPath(clippedPath);
m_txop = old_txop;
}
QT_END_NAMESPACE