5b200ac2c7
* f95-lang.c (gfc_init_builtin_functions): Use vold_list_node.
Create decls for __builtin_pow{,f}.
* gfortran.h (PREFIX_LEN): Define.
* trans-decl.c (gfor_fndecl_math_powi): Add.
(gfor_fndecl_math_powf, gfor_fndecl_math_pow): Remove.
(gfc_build_intrinsic_function_decls): Create decls for powi.
* trans-expr.c (powi_table): Add.
(gfc_conv_integer_power): Remove.
(gfc_conv_powi): New function.
(gfc_conv_cst_int_power): New function.
(gfc_conv_power_op): Use new powi routines.
* trans.h (struct gfc_powdecl_list): Add.
(gfor_fndecl_math_powi): Add.
(gfor_fndecl_math_powf, gfor_fndecl_math_pow): Remove.
testsuite/
* gfortran.fortran-torture/execute/power.f90: Test constant integers.
libgfortran/
* Makefile.am (i_pow_c): Set it. Add build rule.
(gfor_built_src): Use it.
(m4_files): add m4/pow.m4.
* Makefile.in: Regenerate.
* m4/pow.m4: New file.
* generated/pow_*.c: Regenerate.
From-SVN: r82014
61 lines
1.6 KiB
C
61 lines
1.6 KiB
C
/* Support routines for the intrinsic power (**) operator.
|
|
Copyright 2004 Free Software Foundation, Inc.
|
|
Contributed by Paul Brook
|
|
|
|
This file is part of the GNU Fortran 95 runtime library (libgfor).
|
|
|
|
Libgfor is free software; you can redistribute it and/or
|
|
modify it under the terms of the GNU Lesser General Public
|
|
License as published by the Free Software Foundation; either
|
|
version 2.1 of the License, or (at your option) any later version.
|
|
|
|
Ligbfor is distributed in the hope that it will be useful,
|
|
but WITHOUT ANY WARRANTY; without even the implied warranty of
|
|
MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
|
|
GNU Lesser General Public License for more details.
|
|
|
|
You should have received a copy of the GNU Lesser General Public
|
|
License along with libgfor; see the file COPYING.LIB. If not,
|
|
write to the Free Software Foundation, Inc., 59 Temple Place - Suite 330,
|
|
Boston, MA 02111-1307, USA. */
|
|
|
|
#include "config.h"
|
|
#include "libgfortran.h"
|
|
|
|
/* Uuse Binary Method to calculate the powi. This is not an optimal but
|
|
a simple and reasonable arithmetic. See section 4.6.3, "Evaluation of
|
|
Powers" of Donald E. Knuth, "Seminumerical Algorithms", Vol. 2, "The Art
|
|
of Computer Programming", 3rd Edition, 1998. */
|
|
|
|
GFC_COMPLEX_8
|
|
prefix(pow_c8_i4) (GFC_COMPLEX_8 a, GFC_INTEGER_4 b)
|
|
{
|
|
GFC_COMPLEX_8 pow, x;
|
|
GFC_INTEGER_4 n, u;
|
|
|
|
n = b;
|
|
x = a;
|
|
pow = 1;
|
|
if (n != 0)
|
|
{
|
|
if (n < 0)
|
|
{
|
|
|
|
n = -n;
|
|
x = pow / x;
|
|
}
|
|
u = n;
|
|
for (;;)
|
|
{
|
|
if (u & 1)
|
|
pow *= x;
|
|
u >>= 1;
|
|
if (u)
|
|
x *= x;
|
|
else
|
|
break;
|
|
}
|
|
}
|
|
return pow;
|
|
}
|