1 /***************************************************************************/
5 /* Arithmetic computations (specification). */
7 /* Copyright 1996-2006, 2008, 2009, 2012-2013 by */
8 /* David Turner, Robert Wilhelm, and Werner Lemberg. */
10 /* This file is part of the FreeType project, and may only be used, */
11 /* modified, and distributed under the terms of the FreeType project */
12 /* license, LICENSE.TXT. By continuing to use, modify, or distribute */
13 /* this file you indicate that you have read the license and */
14 /* understand and accept it fully. */
16 /***************************************************************************/
24 #include FT_FREETYPE_H
32 /*************************************************************************/
38 /* Computes the square root of a 16.16 fixed-point value. */
41 /* x :: The value to compute the root for. */
44 /* The result of `sqrt(x)'. */
47 /* This function is not very fast. */
50 FT_SqrtFixed( FT_Int32 x
);
55 /*************************************************************************/
57 /* FT_MulDiv() and FT_MulFix() are declared in freetype.h. */
59 /*************************************************************************/
62 /*************************************************************************/
65 /* FT_MulDiv_No_Round */
68 /* A very simple function used to perform the computation `(a*b)/c' */
69 /* (without rounding) with maximum accuracy (it uses a 64-bit */
70 /* intermediate integer whenever necessary). */
72 /* This function isn't necessarily as fast as some processor specific */
73 /* operations, but is at least completely portable. */
76 /* a :: The first multiplier. */
77 /* b :: The second multiplier. */
78 /* c :: The divisor. */
81 /* The result of `(a*b)/c'. This function never traps when trying to */
82 /* divide by zero; it simply returns `MaxInt' or `MinInt' depending */
83 /* on the signs of `a' and `b'. */
86 FT_MulDiv_No_Round( FT_Long a
,
92 * A variant of FT_Matrix_Multiply which scales its result afterwards.
93 * The idea is that both `a' and `b' are scaled by factors of 10 so that
94 * the values are as precise as possible to get a correct result during
95 * the 64bit multiplication. Let `sa' and `sb' be the scaling factors of
96 * `a' and `b', respectively, then the scaling factor of the result is
100 FT_Matrix_Multiply_Scaled( const FT_Matrix
* a
,
106 * A variant of FT_Vector_Transform. See comments for
107 * FT_Matrix_Multiply_Scaled.
110 FT_Vector_Transform_Scaled( FT_Vector
* vector
,
111 const FT_Matrix
* matrix
,
116 * Return -1, 0, or +1, depending on the orientation of a given corner.
117 * We use the Cartesian coordinate system, with positive vertical values
118 * going upwards. The function returns +1 if the corner turns to the
119 * left, -1 to the right, and 0 for undecidable cases.
122 ft_corner_orientation( FT_Pos in_x
,
128 * Return TRUE if a corner is flat or nearly flat. This is equivalent to
129 * saying that the angle difference between the `in' and `out' vectors is
133 ft_corner_is_flat( FT_Pos in_x
,
140 * Return the most significant bit index.
143 FT_MSB( FT_UInt32 z
);
147 * Return sqrt(x*x+y*y), which is the same as `FT_Vector_Length' but uses
148 * two fixed-point arguments instead.
151 FT_Hypot( FT_Fixed x
,
155 #define INT_TO_F26DOT6( x ) ( (FT_Long)(x) << 6 )
156 #define INT_TO_F2DOT14( x ) ( (FT_Long)(x) << 14 )
157 #define INT_TO_FIXED( x ) ( (FT_Long)(x) << 16 )
158 #define F2DOT14_TO_FIXED( x ) ( (FT_Long)(x) << 2 )
159 #define FLOAT_TO_FIXED( x ) ( (FT_Long)( x * 65536.0 ) )
160 #define FIXED_TO_INT( x ) ( FT_RoundFix( x ) >> 16 )
162 #define ROUND_F26DOT6( x ) ( x >= 0 ? ( ( (x) + 32 ) & -64 ) \
163 : ( -( ( 32 - (x) ) & -64 ) ) )
168 #endif /* __FTCALC_H__ */