aboutsummaryrefslogtreecommitdiff
path: root/libgcc/config/gcn/lib2-divmod-di.c
blob: d0385f3b28cf360fa56130c03bf18e95b7c504bd (plain)
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
/* Copyright (C) 2021-2023 Free Software Foundation, Inc.
   Contributed by Mentor Graphics, Inc.

This file is free software; you can redistribute it and/or modify it
under the terms of the GNU General Public License as published by the
Free Software Foundation; either version 3, or (at your option) any
later version.

This file 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
General Public License for more details.

Under Section 7 of GPL version 3, you are granted additional
permissions described in the GCC Runtime Library Exception, version
3.1, as published by the Free Software Foundation.

You should have received a copy of the GNU General Public License and
a copy of the GCC Runtime Library Exception along with this program;
see the files COPYING3 and COPYING.RUNTIME respectively.  If not, see
<http://www.gnu.org/licenses/>.  */

#include "lib2-gcn.h"

/* 64-bit SI divide and modulo as used in gcn.  */

union pack {
  UTItype ti;
  struct {DItype quot, rem;} pair;
};
union upack {
  UTItype ti;
  struct {UDItype quot, rem;} pair;
};

UTItype
__udivmoddi4 (UDItype num, UDItype den)
{
  UDItype bit = 1;
  union upack res = {0};

  while (den < num && bit && !(den & (1L<<63)))
    {
      den <<=1;
      bit <<=1;
    }
  while (bit)
    {
      if (num >= den)
	{
	  num -= den;
	  res.pair.quot |= bit;
	}
      bit >>=1;
      den >>=1;
    }
  res.pair.rem = num;
  return res.ti;
}

UTItype
__divmoddi4 (DItype a, DItype b)
{
  word_type nega = 0, negb = 0;
  union pack res;

  if (a < 0)
    {
      a = -a;
      nega = 1;
    }

  if (b < 0)
    {
      b = -b;
      negb = 1;
    }

  res.ti = __udivmoddi4 (a, b);

  if (nega)
    res.pair.rem = -res.pair.rem;
  if (nega ^ negb)
    res.pair.quot = -res.pair.quot;

  return res.ti;
}


DItype
__divdi3 (DItype a, DItype b)
{
  union pack u;
  u.ti = __divmoddi4 (a, b);
  return u.pair.quot;
}

DItype
__moddi3 (DItype a, DItype b)
{
  union pack u;
  u.ti = __divmoddi4 (a, b);
  return u.pair.rem;
}


UDItype
__udivdi3 (UDItype a, UDItype b)
{
  union pack u;
  u.ti = __udivmoddi4 (a, b);
  return u.pair.quot;
}

UDItype
__umoddi3 (UDItype a, UDItype b)
{
  union pack u;
 u.ti = __udivmoddi4 (a, b);
 return u.pair.rem;
}