]> git.ipfire.org Git - thirdparty/gcc.git/blame - libgfortran/generated/pow_i4_i16.c
Update copyright years.
[thirdparty/gcc.git] / libgfortran / generated / pow_i4_i16.c
CommitLineData
644cb69f 1/* Support routines for the intrinsic power (**) operator.
818ab71a 2 Copyright (C) 2004-2016 Free Software Foundation, Inc.
644cb69f
FXC
3 Contributed by Paul Brook
4
5This file is part of the GNU Fortran 95 runtime library (libgfortran).
6
7Libgfortran is free software; you can redistribute it and/or
8modify it under the terms of the GNU General Public
9License as published by the Free Software Foundation; either
748086b7 10version 3 of the License, or (at your option) any later version.
644cb69f
FXC
11
12Libgfortran is distributed in the hope that it will be useful,
13but WITHOUT ANY WARRANTY; without even the implied warranty of
14MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
15GNU General Public License for more details.
16
748086b7
JJ
17Under Section 7 of GPL version 3, you are granted additional
18permissions described in the GCC Runtime Library Exception, version
193.1, as published by the Free Software Foundation.
20
21You should have received a copy of the GNU General Public License and
22a copy of the GCC Runtime Library Exception along with this program;
23see the files COPYING3 and COPYING.RUNTIME respectively. If not, see
24<http://www.gnu.org/licenses/>. */
644cb69f 25
644cb69f
FXC
26#include "libgfortran.h"
27
36ae8a61 28
644cb69f
FXC
29/* Use Binary Method to calculate the powi. This is not an optimal but
30 a simple and reasonable arithmetic. See section 4.6.3, "Evaluation of
31 Powers" of Donald E. Knuth, "Seminumerical Algorithms", Vol. 2, "The Art
32 of Computer Programming", 3rd Edition, 1998. */
33
34#if defined (HAVE_GFC_INTEGER_4) && defined (HAVE_GFC_INTEGER_16)
35
36GFC_INTEGER_4 pow_i4_i16 (GFC_INTEGER_4 a, GFC_INTEGER_16 b);
37export_proto(pow_i4_i16);
38
39GFC_INTEGER_4
40pow_i4_i16 (GFC_INTEGER_4 a, GFC_INTEGER_16 b)
41{
42 GFC_INTEGER_4 pow, x;
3d1f465a
TK
43 GFC_INTEGER_16 n;
44 GFC_UINTEGER_16 u;
644cb69f
FXC
45
46 n = b;
47 x = a;
48 pow = 1;
49 if (n != 0)
50 {
51 if (n < 0)
52 {
53 if (x == 1)
54 return 1;
55 if (x == -1)
56 return (n & 1) ? -1 : 1;
57 return (x == 0) ? 1 / x : 0;
58 }
3d1f465a
TK
59 else
60 {
61 u = n;
62 }
644cb69f
FXC
63 for (;;)
64 {
65 if (u & 1)
66 pow *= x;
67 u >>= 1;
68 if (u)
69 x *= x;
70 else
71 break;
72 }
73 }
74 return pow;
75}
76
77#endif