static cairo_bool_t
within_tolerance (const cairo_point_t *p1,
const cairo_point_t *p2,
cairo_uint64_t tolerance)
{
return FALSE;
return _cairo_int64_lt (point_distance_sq (p1, p2), tolerance);
}
static inline cairo_bo_intersect_ordinate_t
round_to_nearest (cairo_quorem64_t d,
cairo_int64_t den)
{
cairo_bo_intersect_ordinate_t ordinate;
int32_t quo = d.quo;
cairo_int64_t drem_2 = _cairo_int64_mul (d.rem, _cairo_int32_to_int64 (2));
/* assert (! _cairo_int64_negative (den));*/
if (_cairo_int64_lt (drem_2, _cairo_int64_negate (den))) {
quo -= 1;
drem_2 = _cairo_int64_negate (drem_2);
} else if (_cairo_int64_le (den, drem_2)) {
quo += 1;
drem_2 = _cairo_int64_negate (drem_2);
}
ordinate.ordinate = quo;
ordinate.approx = _cairo_int64_is_zero (drem_2) ? EXACT : _cairo_int64_negative (drem_2) ? EXCESS : DEFAULT;
return ordinate;
}
cairo_bool_t
_cairo_box_intersects_line_segment (cairo_box_t *box, cairo_line_t *line)
{
cairo_fixed_t t1=0, t2=0, t3=0, t4=0;
cairo_int64_t t1y, t2y, t3x, t4x;
cairo_fixed_t xlen, ylen;
if (_cairo_box_contains_point (box, &line->p1) ||
_cairo_box_contains_point (box, &line->p2))
return TRUE;
xlen = P2x - P1x;
ylen = P2y - P1y;
if (xlen) {
if (xlen > 0) {
t1 = B1x - P1x;
t2 = B2x - P1x;
} else {
t1 = P1x - B2x;
t2 = P1x - B1x;
xlen = - xlen;
}
if ((t1 < 0 || t1 > xlen) &&
(t2 < 0 || t2 > xlen))
return FALSE;
} else {
/* Fully vertical line -- check that X is in bounds */
if (P1x < B1x || P1x > B2x)
return FALSE;
}
if (ylen) {
if (ylen > 0) {
t3 = B1y - P1y;
t4 = B2y - P1y;
} else {
t3 = P1y - B2y;
t4 = P1y - B1y;
ylen = - ylen;
}
if ((t3 < 0 || t3 > ylen) &&
(t4 < 0 || t4 > ylen))
return FALSE;
} else {
/* Fully horizontal line -- check Y */
if (P1y < B1y || P1y > B2y)
return FALSE;
}
/* If we had a horizontal or vertical line, then it's already been checked */
if (P1x == P2x || P1y == P2y)
return TRUE;
/* Check overlap. Note that t1 < t2 and t3 < t4 here. */
t1y = _cairo_int32x32_64_mul (t1, ylen);
t2y = _cairo_int32x32_64_mul (t2, ylen);
t3x = _cairo_int32x32_64_mul (t3, xlen);
t4x = _cairo_int32x32_64_mul (t4, xlen);
if (_cairo_int64_lt(t1y, t4x) &&
_cairo_int64_lt(t3x, t2y))
return TRUE;
return FALSE;
}
static void
inner_join (struct stroker *stroker,
const cairo_stroke_face_t *in,
const cairo_stroke_face_t *out,
int clockwise)
{
#if 0
cairo_point_t last;
const cairo_point_t *p, *outpt;
struct stroke_contour *inner;
cairo_int64_t d_p, d_last;
cairo_int64_t half_line_width;
cairo_bool_t negate;
/* XXX line segments shorter than line-width */
if (clockwise) {
inner = &stroker->ccw;
outpt = &out->ccw;
negate = 1;
} else {
inner = &stroker->cw;
outpt = &out->cw;
negate = 0;
}
half_line_width = CAIRO_FIXED_ONE*CAIRO_FIXED_ONE/2 * stroker->style.line_width * out->length + .5;
/* On the inside, the previous end-point is always
* closer to the new face by definition.
*/
last = *_cairo_contour_last_point (&inner->contour);
d_last = distance_from_face (out, &last, negate);
_cairo_contour_remove_last_point (&inner->contour);
prev:
if (inner->contour.chain.num_points == 0) {
contour_add_point (stroker, inner, outpt);
return;
}
p = _cairo_contour_last_point (&inner->contour);
d_p = distance_from_face (out, p, negate);
if (_cairo_int64_lt (d_p, half_line_width) &&
!_cairo_int64_negative (distance_along_face (out, p)))
{
last = *p;
d_last = d_p;
_cairo_contour_remove_last_point (&inner->contour);
goto prev;
}
compute_inner_joint (&last, d_last, p, d_p, half_line_width);
contour_add_point (stroker, inner, &last);
#else
const cairo_point_t *outpt;
struct stroke_contour *inner;
if (clockwise) {
inner = &stroker->ccw;
outpt = &out->ccw;
} else {
inner = &stroker->cw;
outpt = &out->cw;
}
contour_add_point (stroker, inner, &in->point);
contour_add_point (stroker, inner, outpt);
#endif
}
