jdk-sandbox: comparison src/java.desktop/share/native/libfreetype/include/freetype/internal/ftcalc.h

equal deleted inserted replaced

-:bcfedddcf4ce
+:da3834261f0c
-/***************************************************************************/
+/****************************************************************************
-/*                                                                         */
+*
-/*  ftcalc.h                                                               */
+* ftcalc.h
-/*                                                                         */
+*
-/*    Arithmetic computations (specification).                             */
+*   Arithmetic computations (specification).
-/*                                                                         */
+*
-/*  Copyright 1996-2018 by                                                 */
+* Copyright (C) 1996-2019 by
-/*  David Turner, Robert Wilhelm, and Werner Lemberg.                      */
+* David Turner, Robert Wilhelm, and Werner Lemberg.
-/*                                                                         */
+*
-/*  This file is part of the FreeType project, and may only be used,       */
+* This file is part of the FreeType project, and may only be used,
-/*  modified, and distributed under the terms of the FreeType project      */
+* modified, and distributed under the terms of the FreeType project
-/*  license, LICENSE.TXT.  By continuing to use, modify, or distribute     */
+* license, LICENSE.TXT.  By continuing to use, modify, or distribute
-/*  this file you indicate that you have read the license and              */
+* this file you indicate that you have read the license and
-/*  understand and accept it fully.                                        */
+* understand and accept it fully.
-/*                                                                         */
+*
-/***************************************************************************/
+*/
 #ifndef FTCALC_H_
 #define FTCALC_H_
 FT_BEGIN_HEADER
-/*************************************************************************/
+/**************************************************************************
-/*                                                                       */
+*
-/* FT_MulDiv() and FT_MulFix() are declared in freetype.h.               */
+* FT_MulDiv() and FT_MulFix() are declared in freetype.h.
-/*                                                                       */
+*
-/*************************************************************************/
+*/
 #ifndef  FT_CONFIG_OPTION_NO_ASSEMBLER
 /* Provide assembler fragments for performance-critical functions. */
 /* These must be defined `static __inline__' with GCC.             */
 #define FT_MulFix( a, b )  FT_MULFIX_ASSEMBLER( (FT_Int32)(a), (FT_Int32)(b) )
 #endif
 #endif
-/*************************************************************************/
+/**************************************************************************
-/*                                                                       */
+*
-/* <Function>                                                            */
+* @function:
-/*    FT_MulDiv_No_Round                                                 */
+*   FT_MulDiv_No_Round
-/*                                                                       */
+*
-/* <Description>                                                         */
+* @description:
-/*    A very simple function used to perform the computation `(a*b)/c'   */
+*   A very simple function used to perform the computation '(a*b)/c'
-/*    (without rounding) with maximum accuracy (it uses a 64-bit         */
+*   (without rounding) with maximum accuracy (it uses a 64-bit
-/*    intermediate integer whenever necessary).                          */
+*   intermediate integer whenever necessary).
-/*                                                                       */
+*
-/*    This function isn't necessarily as fast as some processor specific */
+*   This function isn't necessarily as fast as some processor-specific
-/*    operations, but is at least completely portable.                   */
+*   operations, but is at least completely portable.
-/*                                                                       */
+*
-/* <Input>                                                               */
+* @input:
-/*    a :: The first multiplier.                                         */
+*   a ::
-/*    b :: The second multiplier.                                        */
+*     The first multiplier.
-/*    c :: The divisor.                                                  */
+*   b ::
-/*                                                                       */
+*     The second multiplier.
-/* <Return>                                                              */
+*   c ::
-/*    The result of `(a*b)/c'.  This function never traps when trying to */
+*     The divisor.
-/*    divide by zero; it simply returns `MaxInt' or `MinInt' depending   */
+*
-/*    on the signs of `a' and `b'.                                       */
+* @return:
-/*                                                                       */
+*   The result of '(a*b)/c'.  This function never traps when trying to
+*   divide by zero; it simply returns 'MaxInt' or 'MinInt' depending on
+*   the signs of 'a' and 'b'.
+*/
 FT_BASE( FT_Long )
 FT_MulDiv_No_Round( FT_Long  a,
 FT_Long  b,
 FT_Long  c );
 /*
-*  A variant of FT_Matrix_Multiply which scales its result afterwards.
+* A variant of FT_Matrix_Multiply which scales its result afterwards.  The
-*  The idea is that both `a' and `b' are scaled by factors of 10 so that
+* idea is that both `a' and `b' are scaled by factors of 10 so that the
-*  the values are as precise as possible to get a correct result during
+* values are as precise as possible to get a correct result during the
-*  the 64bit multiplication.  Let `sa' and `sb' be the scaling factors of
+* 64bit multiplication.  Let `sa' and `sb' be the scaling factors of `a'
-*  `a' and `b', respectively, then the scaling factor of the result is
+* and `b', respectively, then the scaling factor of the result is `sa*sb'.
-*  `sa*sb'.
 */
 FT_BASE( void )
 FT_Matrix_Multiply_Scaled( const FT_Matrix*  a,
 FT_Matrix        *b,
 FT_Long           scaling );
 /*
-*  A variant of FT_Vector_Transform.  See comments for
+* Check a matrix.  If the transformation would lead to extreme shear or
-*  FT_Matrix_Multiply_Scaled.
+* extreme scaling, for example, return 0.  If everything is OK, return 1.
+*
+* Based on geometric considerations we use the following inequality to
+* identify a degenerate matrix.
+*
+*   50 * abs(xx*yy - xy*yx) < xx^2 + xy^2 + yx^2 + yy^2
+*
+* Value 50 is heuristic.
+*/
+FT_BASE( FT_Bool )
+FT_Matrix_Check( const FT_Matrix*  matrix );
+/*
+* A variant of FT_Vector_Transform.  See comments for
+* FT_Matrix_Multiply_Scaled.
 */
 FT_BASE( void )
 FT_Vector_Transform_Scaled( FT_Vector*        vector,
 const FT_Matrix*  matrix,
 FT_Long           scaling );
 /*
-*  This function normalizes a vector and returns its original length.
+* This function normalizes a vector and returns its original length.  The
-*  The normalized vector is a 16.16 fixed-point unit vector with length
+* normalized vector is a 16.16 fixed-point unit vector with length close
-*  close to 0x10000.  The accuracy of the returned length is limited to
+* to 0x10000.  The accuracy of the returned length is limited to 16 bits
-*  16 bits also.  The function utilizes quick inverse square root
+* also.  The function utilizes quick inverse square root approximation
-*  approximation without divisions and square roots relying on Newton's
+* without divisions and square roots relying on Newton's iterations
-*  iterations instead.
+* instead.
 */
 FT_BASE( FT_UInt32 )
 FT_Vector_NormLen( FT_Vector*  vector );
 /*
-*  Return -1, 0, or +1, depending on the orientation of a given corner.
+* Return -1, 0, or +1, depending on the orientation of a given corner.  We
-*  We use the Cartesian coordinate system, with positive vertical values
+* use the Cartesian coordinate system, with positive vertical values going
-*  going upwards.  The function returns +1 if the corner turns to the
+* upwards.  The function returns +1 if the corner turns to the left, -1 to
-*  left, -1 to the right, and 0 for undecidable cases.
+* the right, and 0 for undecidable cases.
 */
 FT_BASE( FT_Int )
 ft_corner_orientation( FT_Pos  in_x,
 FT_Pos  in_y,
 FT_Pos  out_x,
 FT_Pos  out_y );
 /*
-*  Return TRUE if a corner is flat or nearly flat.  This is equivalent to
+* Return TRUE if a corner is flat or nearly flat.  This is equivalent to
-*  saying that the corner point is close to its neighbors, or inside an
+* saying that the corner point is close to its neighbors, or inside an
-*  ellipse defined by the neighbor focal points to be more precise.
+* ellipse defined by the neighbor focal points to be more precise.
 */
 FT_BASE( FT_Int )
 ft_corner_is_flat( FT_Pos  in_x,
 FT_Pos  in_y,
 FT_Pos  out_x,
 FT_Pos  out_y );
 /*
-*  Return the most significant bit index.
+* Return the most significant bit index.
 */
 #ifndef  FT_CONFIG_OPTION_NO_ASSEMBLER
 #if defined( __GNUC__ )                                          && \
 ( __GNUC__ > 3 || ( __GNUC__ == 3 && __GNUC_MINOR__ >= 4 ) )
 #if FT_SIZEOF_INT == 4
 #elif FT_SIZEOF_LONG == 4
 #define FT_MSB( x )  ( 31 - __builtin_clzl( x ) )
-#endif
 #endif /* __GNUC__ */
+#elif defined( _MSC_VER ) && ( _MSC_VER >= 1400 )
+#if FT_SIZEOF_INT == 4
+#include <intrin.h>
+static __inline FT_Int32
+FT_MSB_i386( FT_UInt32  x )
+{
+unsigned long  where;
+/* not available in older VC versions */
+_BitScanReverse( &where, x );
+return (FT_Int32)where;
+}
+#define FT_MSB( x )  ( FT_MSB_i386( x ) )
+#endif
+#endif /* _MSC_VER */
 #endif /* !FT_CONFIG_OPTION_NO_ASSEMBLER */
 #ifndef FT_MSB
 FT_BASE( FT_Int )
 #endif
 /*
-*  Return sqrt(x*x+y*y), which is the same as `FT_Vector_Length' but uses
+* Return sqrt(x*x+y*y), which is the same as `FT_Vector_Length' but uses
-*  two fixed-point arguments instead.
+* two fixed-point arguments instead.
 */
 FT_BASE( FT_Fixed )
 FT_Hypot( FT_Fixed  x,
 FT_Fixed  y );
 #if 0
-/*************************************************************************/
+/**************************************************************************
-/*                                                                       */
+*
-/* <Function>                                                            */
+* @function:
-/*    FT_SqrtFixed                                                       */
+*   FT_SqrtFixed
-/*                                                                       */
+*
-/* <Description>                                                         */
+* @description:
-/*    Computes the square root of a 16.16 fixed-point value.             */
+*   Computes the square root of a 16.16 fixed-point value.
-/*                                                                       */
+*
-/* <Input>                                                               */
+* @input:
-/*    x :: The value to compute the root for.                            */
+*   x ::
-/*                                                                       */
+*     The value to compute the root for.
-/* <Return>                                                              */
+*
-/*    The result of `sqrt(x)'.                                           */
+* @return:
-/*                                                                       */
+*   The result of 'sqrt(x)'.
-/* <Note>                                                                */
+*
-/*    This function is not very fast.                                    */
+* @note:
-/*                                                                       */
+*   This function is not very fast.
+*/
 FT_BASE( FT_Int32 )
 FT_SqrtFixed( FT_Int32  x );
 #endif /* 0 */
 #define ROUND_F26DOT6( x )     ( x >= 0 ? (    ( (x) + 32 ) & -64 )     \
 : ( -( ( 32 - (x) ) & -64 ) ) )
 /*
-*  The following macros have two purposes.
+* The following macros have two purposes.
 *
-*  . Tag places where overflow is expected and harmless.
+* - Tag places where overflow is expected and harmless.
 *
-*  . Avoid run-time sanitizer errors.
+* - Avoid run-time sanitizer errors.
 *
-*  Use with care!
+* Use with care!
 */
+#define ADD_INT( a, b )                           \
+(FT_Int)( (FT_UInt)(a) + (FT_UInt)(b) )
+#define SUB_INT( a, b )                           \
+(FT_Int)( (FT_UInt)(a) - (FT_UInt)(b) )
+#define MUL_INT( a, b )                           \
+(FT_Int)( (FT_UInt)(a) * (FT_UInt)(b) )
+#define NEG_INT( a )                              \
+(FT_Int)( (FT_UInt)0 - (FT_UInt)(a) )
 #define ADD_LONG( a, b )                             \
 (FT_Long)( (FT_ULong)(a) + (FT_ULong)(b) )
 #define SUB_LONG( a, b )                             \
 (FT_Long)( (FT_ULong)(a) - (FT_ULong)(b) )
 #define MUL_LONG( a, b )                             \
 #define MUL_INT32( a, b )                               \
 (FT_Int32)( (FT_UInt32)(a) * (FT_UInt32)(b) )
 #define NEG_INT32( a )                                  \
 (FT_Int32)( (FT_UInt32)0 - (FT_UInt32)(a) )
+#ifdef FT_LONG64
+#define ADD_INT64( a, b )                               \
+(FT_Int64)( (FT_UInt64)(a) + (FT_UInt64)(b) )
+#define SUB_INT64( a, b )                               \
+(FT_Int64)( (FT_UInt64)(a) - (FT_UInt64)(b) )
+#define MUL_INT64( a, b )                               \
+(FT_Int64)( (FT_UInt64)(a) * (FT_UInt64)(b) )
+#define NEG_INT64( a )                                  \
+(FT_Int64)( (FT_UInt64)0 - (FT_UInt64)(a) )
+#endif /* FT_LONG64 */
 FT_END_HEADER
 #endif /* FTCALC_H_ */

changeset 54876	da3834261f0c
parent 49234	3375a8039fde