2000-10-26 02:06:35 +02:00
|
|
|
/***************************************************************************/
|
|
|
|
/* */
|
|
|
|
/* ftbbox.c */
|
|
|
|
/* */
|
|
|
|
/* FreeType bbox computation (body). */
|
|
|
|
/* */
|
2013-01-09 06:25:32 +01:00
|
|
|
/* Copyright 1996-2002, 2004, 2006, 2010, 2013 by */
|
2000-10-26 02:06:35 +02:00
|
|
|
/* David Turner, Robert Wilhelm, and Werner Lemberg. */
|
|
|
|
/* */
|
|
|
|
/* This file is part of the FreeType project, and may only be used */
|
|
|
|
/* modified and distributed under the terms of the FreeType project */
|
|
|
|
/* license, LICENSE.TXT. By continuing to use, modify, or distribute */
|
|
|
|
/* this file you indicate that you have read the license and */
|
|
|
|
/* understand and accept it fully. */
|
|
|
|
/* */
|
|
|
|
/***************************************************************************/
|
|
|
|
|
2000-10-26 12:04:16 +02:00
|
|
|
|
2000-10-26 02:06:35 +02:00
|
|
|
/*************************************************************************/
|
|
|
|
/* */
|
|
|
|
/* This component has a _single_ role: to compute exact outline bounding */
|
|
|
|
/* boxes. */
|
|
|
|
/* */
|
|
|
|
/*************************************************************************/
|
|
|
|
|
2000-12-08 17:17:16 +01:00
|
|
|
|
|
|
|
#include <ft2build.h>
|
2013-03-14 10:27:35 +01:00
|
|
|
#include FT_INTERNAL_DEBUG_H
|
|
|
|
|
2000-12-08 17:17:16 +01:00
|
|
|
#include FT_BBOX_H
|
|
|
|
#include FT_IMAGE_H
|
|
|
|
#include FT_OUTLINE_H
|
2001-04-26 15:34:36 +02:00
|
|
|
#include FT_INTERNAL_CALC_H
|
2009-04-05 16:59:26 +02:00
|
|
|
#include FT_INTERNAL_OBJECTS_H
|
2000-10-26 02:06:35 +02:00
|
|
|
|
2000-10-26 12:04:16 +02:00
|
|
|
|
2000-10-26 02:06:35 +02:00
|
|
|
typedef struct TBBox_Rec_
|
|
|
|
{
|
|
|
|
FT_Vector last;
|
|
|
|
FT_BBox bbox;
|
|
|
|
|
|
|
|
} TBBox_Rec;
|
2001-04-26 15:34:36 +02:00
|
|
|
|
2000-10-26 02:06:35 +02:00
|
|
|
|
|
|
|
/*************************************************************************/
|
|
|
|
/* */
|
|
|
|
/* <Function> */
|
|
|
|
/* BBox_Move_To */
|
|
|
|
/* */
|
|
|
|
/* <Description> */
|
|
|
|
/* This function is used as a `move_to' and `line_to' emitter during */
|
2000-10-26 12:04:16 +02:00
|
|
|
/* FT_Outline_Decompose(). It simply records the destination point */
|
2000-11-03 08:34:29 +01:00
|
|
|
/* in `user->last'; no further computations are necessary since we */
|
2004-05-19 11:22:26 +02:00
|
|
|
/* use the cbox as the starting bbox which must be refined. */
|
2000-10-26 02:06:35 +02:00
|
|
|
/* */
|
|
|
|
/* <Input> */
|
|
|
|
/* to :: A pointer to the destination vector. */
|
|
|
|
/* */
|
|
|
|
/* <InOut> */
|
|
|
|
/* user :: A pointer to the current walk context. */
|
|
|
|
/* */
|
|
|
|
/* <Return> */
|
2000-10-26 12:04:16 +02:00
|
|
|
/* Always 0. Needed for the interface only. */
|
2000-10-26 02:06:35 +02:00
|
|
|
/* */
|
2001-06-27 18:18:10 +02:00
|
|
|
static int
|
|
|
|
BBox_Move_To( FT_Vector* to,
|
|
|
|
TBBox_Rec* user )
|
2000-10-26 02:06:35 +02:00
|
|
|
{
|
|
|
|
user->last = *to;
|
|
|
|
|
|
|
|
return 0;
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
|
|
#define CHECK_X( p, bbox ) \
|
|
|
|
( p->x < bbox.xMin || p->x > bbox.xMax )
|
|
|
|
|
|
|
|
#define CHECK_Y( p, bbox ) \
|
|
|
|
( p->y < bbox.yMin || p->y > bbox.yMax )
|
|
|
|
|
|
|
|
|
|
|
|
/*************************************************************************/
|
|
|
|
/* */
|
|
|
|
/* <Function> */
|
|
|
|
/* BBox_Conic_Check */
|
|
|
|
/* */
|
|
|
|
/* <Description> */
|
|
|
|
/* Finds the extrema of a 1-dimensional conic Bezier curve and update */
|
|
|
|
/* a bounding range. This version uses direct computation, as it */
|
|
|
|
/* doesn't need square roots. */
|
|
|
|
/* */
|
|
|
|
/* <Input> */
|
|
|
|
/* y1 :: The start coordinate. */
|
2004-05-19 11:22:26 +02:00
|
|
|
/* */
|
2000-10-26 02:06:35 +02:00
|
|
|
/* y2 :: The coordinate of the control point. */
|
2004-05-19 11:22:26 +02:00
|
|
|
/* */
|
2000-10-26 02:06:35 +02:00
|
|
|
/* y3 :: The end coordinate. */
|
|
|
|
/* */
|
|
|
|
/* <InOut> */
|
|
|
|
/* min :: The address of the current minimum. */
|
2004-05-19 11:22:26 +02:00
|
|
|
/* */
|
2000-10-26 02:06:35 +02:00
|
|
|
/* max :: The address of the current maximum. */
|
|
|
|
/* */
|
2001-06-27 18:18:10 +02:00
|
|
|
static void
|
|
|
|
BBox_Conic_Check( FT_Pos y1,
|
|
|
|
FT_Pos y2,
|
2003-05-15 08:44:09 +02:00
|
|
|
FT_Pos y3,
|
|
|
|
FT_Pos* min,
|
|
|
|
FT_Pos* max )
|
2000-10-26 02:06:35 +02:00
|
|
|
{
|
2013-08-18 04:19:21 +02:00
|
|
|
/* This function is only called when a control off-point is outside */
|
2013-08-20 04:57:05 +02:00
|
|
|
/* the bbox that contains all on-points. It finds a local extremum */
|
|
|
|
/* within the segment, equal to (y1*y3 - y2*y2)/(y1 - 2*y2 + y3). */
|
|
|
|
/* Or, offsetting from y2, we get */
|
2013-08-18 04:19:21 +02:00
|
|
|
|
|
|
|
y1 -= y2;
|
|
|
|
y3 -= y2;
|
|
|
|
y2 += FT_MulDiv( y1, y3, y1 + y3 );
|
|
|
|
|
|
|
|
if ( y2 < *min )
|
|
|
|
*min = y2;
|
|
|
|
if ( y2 > *max )
|
|
|
|
*max = y2;
|
2000-10-26 02:06:35 +02:00
|
|
|
}
|
|
|
|
|
|
|
|
|
|
|
|
/*************************************************************************/
|
|
|
|
/* */
|
|
|
|
/* <Function> */
|
|
|
|
/* BBox_Conic_To */
|
|
|
|
/* */
|
|
|
|
/* <Description> */
|
|
|
|
/* This function is used as a `conic_to' emitter during */
|
2010-01-09 08:14:26 +01:00
|
|
|
/* FT_Outline_Decompose(). It checks a conic Bezier curve with the */
|
2000-10-26 02:06:35 +02:00
|
|
|
/* current bounding box, and computes its extrema if necessary to */
|
|
|
|
/* update it. */
|
|
|
|
/* */
|
|
|
|
/* <Input> */
|
|
|
|
/* control :: A pointer to a control point. */
|
2004-05-19 11:22:26 +02:00
|
|
|
/* */
|
2000-10-26 02:06:35 +02:00
|
|
|
/* to :: A pointer to the destination vector. */
|
|
|
|
/* */
|
|
|
|
/* <InOut> */
|
|
|
|
/* user :: The address of the current walk context. */
|
|
|
|
/* */
|
|
|
|
/* <Return> */
|
2000-10-26 12:04:16 +02:00
|
|
|
/* Always 0. Needed for the interface only. */
|
2000-10-26 02:06:35 +02:00
|
|
|
/* */
|
|
|
|
/* <Note> */
|
|
|
|
/* In the case of a non-monotonous arc, we compute directly the */
|
|
|
|
/* extremum coordinates, as it is sufficiently fast. */
|
|
|
|
/* */
|
2001-06-27 18:18:10 +02:00
|
|
|
static int
|
|
|
|
BBox_Conic_To( FT_Vector* control,
|
|
|
|
FT_Vector* to,
|
|
|
|
TBBox_Rec* user )
|
2000-10-26 02:06:35 +02:00
|
|
|
{
|
2000-11-04 10:41:45 +01:00
|
|
|
/* we don't need to check `to' since it is always an `on' point, thus */
|
|
|
|
/* within the bbox */
|
|
|
|
|
|
|
|
if ( CHECK_X( control, user->bbox ) )
|
2000-10-26 02:06:35 +02:00
|
|
|
BBox_Conic_Check( user->last.x,
|
|
|
|
control->x,
|
|
|
|
to->x,
|
|
|
|
&user->bbox.xMin,
|
|
|
|
&user->bbox.xMax );
|
|
|
|
|
2000-11-04 10:41:45 +01:00
|
|
|
if ( CHECK_Y( control, user->bbox ) )
|
2000-10-26 02:06:35 +02:00
|
|
|
BBox_Conic_Check( user->last.y,
|
|
|
|
control->y,
|
|
|
|
to->y,
|
|
|
|
&user->bbox.yMin,
|
|
|
|
&user->bbox.yMax );
|
|
|
|
|
2000-11-03 08:34:29 +01:00
|
|
|
user->last = *to;
|
|
|
|
|
2000-10-26 02:06:35 +02:00
|
|
|
return 0;
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
|
|
/*************************************************************************/
|
|
|
|
/* */
|
|
|
|
/* <Function> */
|
|
|
|
/* BBox_Cubic_Check */
|
|
|
|
/* */
|
|
|
|
/* <Description> */
|
|
|
|
/* Finds the extrema of a 1-dimensional cubic Bezier curve and */
|
2013-08-20 04:57:05 +02:00
|
|
|
/* updates a bounding range. This version uses iterative splitting */
|
|
|
|
/* because it is faster than the exact solution with square roots. */
|
2000-10-26 02:06:35 +02:00
|
|
|
/* */
|
|
|
|
/* <Input> */
|
|
|
|
/* p1 :: The start coordinate. */
|
2004-05-19 11:22:26 +02:00
|
|
|
/* */
|
2000-10-26 02:06:35 +02:00
|
|
|
/* p2 :: The coordinate of the first control point. */
|
2004-05-19 11:22:26 +02:00
|
|
|
/* */
|
2000-10-26 02:06:35 +02:00
|
|
|
/* p3 :: The coordinate of the second control point. */
|
2004-05-19 11:22:26 +02:00
|
|
|
/* */
|
2000-10-26 02:06:35 +02:00
|
|
|
/* p4 :: The end coordinate. */
|
|
|
|
/* */
|
|
|
|
/* <InOut> */
|
|
|
|
/* min :: The address of the current minimum. */
|
2004-05-19 11:22:26 +02:00
|
|
|
/* */
|
2000-10-26 02:06:35 +02:00
|
|
|
/* max :: The address of the current maximum. */
|
|
|
|
/* */
|
2004-05-19 11:22:26 +02:00
|
|
|
|
2013-08-14 04:28:57 +02:00
|
|
|
static FT_Pos
|
2013-08-20 04:57:05 +02:00
|
|
|
update_cubic_max( FT_Pos q1,
|
|
|
|
FT_Pos q2,
|
|
|
|
FT_Pos q3,
|
|
|
|
FT_Pos q4,
|
|
|
|
FT_Pos max )
|
2000-10-26 02:06:35 +02:00
|
|
|
{
|
2013-08-20 04:57:05 +02:00
|
|
|
/* for a cubic segment to possibly reach new maximum, at least */
|
|
|
|
/* one of its off-points must stay above the current value */
|
2013-08-14 04:28:57 +02:00
|
|
|
while ( q2 > max || q3 > max )
|
2000-10-26 02:06:35 +02:00
|
|
|
{
|
2013-02-20 03:27:18 +01:00
|
|
|
/* determine which half contains the maximum and split */
|
|
|
|
if ( q1 + q2 > q3 + q4 ) /* first half */
|
2000-10-26 02:06:35 +02:00
|
|
|
{
|
2013-02-20 03:27:18 +01:00
|
|
|
q4 = q4 + q3;
|
|
|
|
q3 = q3 + q2;
|
|
|
|
q2 = q2 + q1;
|
|
|
|
q4 = q4 + q3;
|
|
|
|
q3 = q3 + q2;
|
|
|
|
q4 = ( q4 + q3 ) / 8;
|
|
|
|
q3 = q3 / 4;
|
|
|
|
q2 = q2 / 2;
|
2000-10-26 02:06:35 +02:00
|
|
|
}
|
2013-02-20 03:27:18 +01:00
|
|
|
else /* second half */
|
2000-10-26 02:06:35 +02:00
|
|
|
{
|
2013-02-20 03:27:18 +01:00
|
|
|
q1 = q1 + q2;
|
|
|
|
q2 = q2 + q3;
|
|
|
|
q3 = q3 + q4;
|
|
|
|
q1 = q1 + q2;
|
|
|
|
q2 = q2 + q3;
|
|
|
|
q1 = ( q1 + q2 ) / 8;
|
|
|
|
q2 = q2 / 4;
|
|
|
|
q3 = q3 / 2;
|
2000-10-26 02:06:35 +02:00
|
|
|
}
|
2013-02-20 03:27:18 +01:00
|
|
|
|
|
|
|
/* check if either end reached the maximum */
|
|
|
|
if ( q1 == q2 && q1 >= q3 )
|
2000-10-26 02:06:35 +02:00
|
|
|
{
|
2013-08-14 04:28:57 +02:00
|
|
|
max = q1;
|
2013-02-20 03:27:18 +01:00
|
|
|
break;
|
2000-10-26 02:06:35 +02:00
|
|
|
}
|
2013-02-20 03:27:18 +01:00
|
|
|
if ( q3 == q4 && q2 <= q4 )
|
|
|
|
{
|
2013-08-14 04:28:57 +02:00
|
|
|
max = q4;
|
2013-02-20 03:27:18 +01:00
|
|
|
break;
|
|
|
|
}
|
|
|
|
}
|
2000-10-26 02:06:35 +02:00
|
|
|
|
2013-08-14 04:28:57 +02:00
|
|
|
return max;
|
|
|
|
}
|
2000-10-26 02:06:35 +02:00
|
|
|
|
2013-08-14 04:28:57 +02:00
|
|
|
static void
|
|
|
|
BBox_Cubic_Check( FT_Pos p1,
|
|
|
|
FT_Pos p2,
|
|
|
|
FT_Pos p3,
|
|
|
|
FT_Pos p4,
|
|
|
|
FT_Pos* min,
|
|
|
|
FT_Pos* max )
|
|
|
|
{
|
2013-08-16 04:51:42 +02:00
|
|
|
FT_Pos nmin, nmax;
|
|
|
|
FT_Int shift;
|
|
|
|
|
2013-08-20 04:57:05 +02:00
|
|
|
/* This function is only called when a control off-point is outside */
|
|
|
|
/* the bbox that contains all on-points. It finds a local extremum */
|
|
|
|
/* within the segment using iterative bisection of the segment. */
|
|
|
|
/* The fixed-point arithmentic of bisection is inherently stable */
|
|
|
|
/* but may loose accuracy in the two lowest bits. To compensate, */
|
|
|
|
/* we upscale the segment if there is room. Large values may need */
|
|
|
|
/* to be downscaled to avoid overflows during bisection bisection. */
|
|
|
|
/* The control off-point outside the bbox is likely to have the top */
|
|
|
|
/* absolute value among arguments. */
|
2013-08-16 04:51:42 +02:00
|
|
|
|
|
|
|
shift = 27 - FT_MSB( FT_ABS( p2 ) | FT_ABS( p3 ) );
|
|
|
|
|
|
|
|
if ( shift > 0 )
|
|
|
|
{
|
|
|
|
/* upscaling too much just wastes time */
|
|
|
|
if ( shift > 2 )
|
|
|
|
shift = 2;
|
2013-08-20 04:57:05 +02:00
|
|
|
|
2013-08-16 04:51:42 +02:00
|
|
|
p1 <<= shift;
|
|
|
|
p2 <<= shift;
|
|
|
|
p3 <<= shift;
|
|
|
|
p4 <<= shift;
|
|
|
|
nmin = *min << shift;
|
|
|
|
nmax = *max << shift;
|
|
|
|
}
|
2013-08-20 04:57:05 +02:00
|
|
|
else
|
2013-08-16 04:51:42 +02:00
|
|
|
{
|
|
|
|
p1 >>= -shift;
|
|
|
|
p2 >>= -shift;
|
|
|
|
p3 >>= -shift;
|
|
|
|
p4 >>= -shift;
|
|
|
|
nmin = *min >> -shift;
|
|
|
|
nmax = *max >> -shift;
|
|
|
|
}
|
|
|
|
|
2013-08-20 04:57:05 +02:00
|
|
|
nmax = update_cubic_max( p1, p2, p3, p4, nmax );
|
2000-10-26 02:06:35 +02:00
|
|
|
|
2013-08-14 04:28:57 +02:00
|
|
|
/* now flip the signs to update the minimum */
|
2013-08-20 04:57:05 +02:00
|
|
|
nmin = -update_cubic_max( -p1, -p2, -p3, -p4, -nmin );
|
2013-08-16 04:51:42 +02:00
|
|
|
|
|
|
|
if ( shift > 0 )
|
|
|
|
{
|
|
|
|
nmin >>= shift;
|
|
|
|
nmax >>= shift;
|
|
|
|
}
|
|
|
|
else
|
|
|
|
{
|
|
|
|
nmin <<= -shift;
|
|
|
|
nmax <<= -shift;
|
|
|
|
}
|
|
|
|
|
|
|
|
if ( nmin < *min )
|
|
|
|
*min = nmin;
|
|
|
|
if ( nmax > *max )
|
|
|
|
*max = nmax;
|
2000-10-26 02:06:35 +02:00
|
|
|
}
|
2004-05-19 11:22:26 +02:00
|
|
|
|
2000-10-26 02:06:35 +02:00
|
|
|
|
|
|
|
/*************************************************************************/
|
|
|
|
/* */
|
|
|
|
/* <Function> */
|
|
|
|
/* BBox_Cubic_To */
|
|
|
|
/* */
|
|
|
|
/* <Description> */
|
|
|
|
/* This function is used as a `cubic_to' emitter during */
|
2010-01-09 08:14:26 +01:00
|
|
|
/* FT_Outline_Decompose(). It checks a cubic Bezier curve with the */
|
2000-10-26 02:06:35 +02:00
|
|
|
/* current bounding box, and computes its extrema if necessary to */
|
|
|
|
/* update it. */
|
|
|
|
/* */
|
|
|
|
/* <Input> */
|
|
|
|
/* control1 :: A pointer to the first control point. */
|
2004-05-19 11:22:26 +02:00
|
|
|
/* */
|
2000-10-26 02:06:35 +02:00
|
|
|
/* control2 :: A pointer to the second control point. */
|
2004-05-19 11:22:26 +02:00
|
|
|
/* */
|
2000-10-26 02:06:35 +02:00
|
|
|
/* to :: A pointer to the destination vector. */
|
|
|
|
/* */
|
|
|
|
/* <InOut> */
|
|
|
|
/* user :: The address of the current walk context. */
|
|
|
|
/* */
|
|
|
|
/* <Return> */
|
2000-10-26 12:04:16 +02:00
|
|
|
/* Always 0. Needed for the interface only. */
|
2000-10-26 02:06:35 +02:00
|
|
|
/* */
|
|
|
|
/* <Note> */
|
|
|
|
/* In the case of a non-monotonous arc, we don't compute directly */
|
2004-05-19 11:22:26 +02:00
|
|
|
/* extremum coordinates, we subdivide instead. */
|
2000-10-26 02:06:35 +02:00
|
|
|
/* */
|
2001-06-27 18:18:10 +02:00
|
|
|
static int
|
|
|
|
BBox_Cubic_To( FT_Vector* control1,
|
|
|
|
FT_Vector* control2,
|
|
|
|
FT_Vector* to,
|
|
|
|
TBBox_Rec* user )
|
2000-10-26 02:06:35 +02:00
|
|
|
{
|
2013-08-16 04:51:42 +02:00
|
|
|
/* We don't need to check `to' since it is always an on-point, */
|
|
|
|
/* thus within the bbox. Only segments with an off-point outside */
|
|
|
|
/* the bbox can possibly reach new extreme values. */
|
2000-11-04 10:41:45 +01:00
|
|
|
|
2000-10-26 02:06:35 +02:00
|
|
|
if ( CHECK_X( control1, user->bbox ) ||
|
2000-11-04 10:41:45 +01:00
|
|
|
CHECK_X( control2, user->bbox ) )
|
2004-05-19 11:22:26 +02:00
|
|
|
BBox_Cubic_Check( user->last.x,
|
|
|
|
control1->x,
|
|
|
|
control2->x,
|
|
|
|
to->x,
|
|
|
|
&user->bbox.xMin,
|
|
|
|
&user->bbox.xMax );
|
2000-10-26 02:06:35 +02:00
|
|
|
|
|
|
|
if ( CHECK_Y( control1, user->bbox ) ||
|
2000-11-04 10:41:45 +01:00
|
|
|
CHECK_Y( control2, user->bbox ) )
|
2004-05-19 11:22:26 +02:00
|
|
|
BBox_Cubic_Check( user->last.y,
|
|
|
|
control1->y,
|
|
|
|
control2->y,
|
|
|
|
to->y,
|
|
|
|
&user->bbox.yMin,
|
|
|
|
&user->bbox.yMax );
|
2000-10-26 02:06:35 +02:00
|
|
|
|
2000-11-03 08:34:29 +01:00
|
|
|
user->last = *to;
|
|
|
|
|
2000-10-26 02:06:35 +02:00
|
|
|
return 0;
|
|
|
|
}
|
|
|
|
|
2009-04-05 16:59:26 +02:00
|
|
|
FT_DEFINE_OUTLINE_FUNCS(bbox_interface,
|
|
|
|
(FT_Outline_MoveTo_Func) BBox_Move_To,
|
|
|
|
(FT_Outline_LineTo_Func) BBox_Move_To,
|
|
|
|
(FT_Outline_ConicTo_Func)BBox_Conic_To,
|
|
|
|
(FT_Outline_CubicTo_Func)BBox_Cubic_To,
|
|
|
|
0, 0
|
|
|
|
)
|
2000-10-26 02:06:35 +02:00
|
|
|
|
2000-11-07 18:21:11 +01:00
|
|
|
/* documentation is in ftbbox.h */
|
|
|
|
|
2001-06-27 18:18:10 +02:00
|
|
|
FT_EXPORT_DEF( FT_Error )
|
|
|
|
FT_Outline_Get_BBox( FT_Outline* outline,
|
|
|
|
FT_BBox *abbox )
|
2000-10-26 02:06:35 +02:00
|
|
|
{
|
2000-10-26 12:04:16 +02:00
|
|
|
FT_BBox cbox;
|
|
|
|
FT_BBox bbox;
|
|
|
|
FT_Vector* vec;
|
|
|
|
FT_UShort n;
|
2000-10-26 02:06:35 +02:00
|
|
|
|
|
|
|
|
2000-10-26 12:04:16 +02:00
|
|
|
if ( !abbox )
|
2013-03-14 10:27:35 +01:00
|
|
|
return FT_THROW( Invalid_Argument );
|
2000-10-26 12:04:16 +02:00
|
|
|
|
2000-10-26 02:06:35 +02:00
|
|
|
if ( !outline )
|
2013-03-14 10:27:35 +01:00
|
|
|
return FT_THROW( Invalid_Outline );
|
2000-10-26 02:06:35 +02:00
|
|
|
|
2000-10-26 12:04:16 +02:00
|
|
|
/* if outline is empty, return (0,0,0,0) */
|
2000-10-26 02:06:35 +02:00
|
|
|
if ( outline->n_points == 0 || outline->n_contours <= 0 )
|
|
|
|
{
|
|
|
|
abbox->xMin = abbox->xMax = 0;
|
|
|
|
abbox->yMin = abbox->yMax = 0;
|
|
|
|
return 0;
|
|
|
|
}
|
|
|
|
|
|
|
|
/* We compute the control box as well as the bounding box of */
|
|
|
|
/* all `on' points in the outline. Then, if the two boxes */
|
|
|
|
/* coincide, we exit immediately. */
|
|
|
|
|
|
|
|
vec = outline->points;
|
|
|
|
bbox.xMin = bbox.xMax = cbox.xMin = cbox.xMax = vec->x;
|
|
|
|
bbox.yMin = bbox.yMax = cbox.yMin = cbox.yMax = vec->y;
|
2001-04-25 20:11:16 +02:00
|
|
|
vec++;
|
2000-10-26 02:06:35 +02:00
|
|
|
|
|
|
|
for ( n = 1; n < outline->n_points; n++ )
|
|
|
|
{
|
|
|
|
FT_Pos x = vec->x;
|
|
|
|
FT_Pos y = vec->y;
|
|
|
|
|
|
|
|
|
|
|
|
/* update control box */
|
|
|
|
if ( x < cbox.xMin ) cbox.xMin = x;
|
|
|
|
if ( x > cbox.xMax ) cbox.xMax = x;
|
|
|
|
|
|
|
|
if ( y < cbox.yMin ) cbox.yMin = y;
|
|
|
|
if ( y > cbox.yMax ) cbox.yMax = y;
|
|
|
|
|
* massive re-formatting changes to many, many source files. I don't
want to list them all here. The operations performed were all logical
transformations of the sources:
- trying to convert all enums and constants to CAPITALIZED_STYLE, with
#define definitions like
#define my_old_constants MY_NEW_CONSTANT
- big, big update of the documentation comments
* include/freetype/freetype.h, src/base/ftobjs.c, src/smooth/ftsmooth.c,
include/freetype/ftimage.h: adding support for LCD-optimized rendering
though the new constants/enums:
FT_RENDER_MODE_LCD, FT_RENDER_MODE_LCD_V
FT_PIXEL_MODE_LCD, FT_PIXEL_MODE_LCD_V
this is still work in progress, don't expect everything to work correctly
though most of the features have been implemented.
* adding new FT_LOAD_XXX flags, used to specify both hinting and rendering
targets:
FT_LOAD_TARGET_NORMAL :: anti-aliased hinting & rendering
FT_LOAD_TARGET_MONO :: monochrome bitmaps
FT_LOAD_TARGET_LCD :: horizontal RGB/BGR decimated hinting & rendering
FT_LOAD_TARGET_LCD_V :: vertical RGB/BGR decimated hinting & rendering
note that FT_LOAD_TARGET_NORMAL is 0, which means that the default
behaviour of the font engine is _unchanged_.
2002-08-27 22:20:29 +02:00
|
|
|
if ( FT_CURVE_TAG( outline->tags[n] ) == FT_CURVE_TAG_ON )
|
2000-10-26 02:06:35 +02:00
|
|
|
{
|
|
|
|
/* update bbox for `on' points only */
|
|
|
|
if ( x < bbox.xMin ) bbox.xMin = x;
|
|
|
|
if ( x > bbox.xMax ) bbox.xMax = x;
|
|
|
|
|
|
|
|
if ( y < bbox.yMin ) bbox.yMin = y;
|
|
|
|
if ( y > bbox.yMax ) bbox.yMax = y;
|
|
|
|
}
|
|
|
|
|
|
|
|
vec++;
|
|
|
|
}
|
|
|
|
|
|
|
|
/* test two boxes for equality */
|
|
|
|
if ( cbox.xMin < bbox.xMin || cbox.xMax > bbox.xMax ||
|
|
|
|
cbox.yMin < bbox.yMin || cbox.yMax > bbox.yMax )
|
|
|
|
{
|
|
|
|
/* the two boxes are different, now walk over the outline to */
|
|
|
|
/* get the Bezier arc extrema. */
|
|
|
|
|
|
|
|
FT_Error error;
|
|
|
|
TBBox_Rec user;
|
|
|
|
|
2009-04-05 16:59:26 +02:00
|
|
|
#ifdef FT_CONFIG_OPTION_PIC
|
|
|
|
FT_Outline_Funcs bbox_interface;
|
|
|
|
Init_Class_bbox_interface(&bbox_interface);
|
|
|
|
#endif
|
2000-10-26 02:06:35 +02:00
|
|
|
|
|
|
|
user.bbox = bbox;
|
|
|
|
|
2002-04-30 08:37:52 +02:00
|
|
|
error = FT_Outline_Decompose( outline, &bbox_interface, &user );
|
2000-10-26 02:06:35 +02:00
|
|
|
if ( error )
|
|
|
|
return error;
|
|
|
|
|
|
|
|
*abbox = user.bbox;
|
|
|
|
}
|
|
|
|
else
|
|
|
|
*abbox = bbox;
|
|
|
|
|
|
|
|
return FT_Err_Ok;
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
|
|
/* END */
|