Skip to content
GitLab
Menu
Projects
Groups
Snippets
Loading...
Help
Help
Support
Community forum
Keyboard shortcuts
?
Submit feedback
Contribute to GitLab
Sign in
Toggle navigation
Menu
Open sidebar
Thomas Jahns
yaxt
Commits
4db4d55e
Commit
4db4d55e
authored
Apr 16, 2020
by
Thomas Jahns
🤸
Browse files
Remove unneeded parentheses.
parent
9fe8a0fd
Changes
1
Hide whitespace changes
Inline
Side-by-side
src/xt_arithmetic_long.h
View file @
4db4d55e
...
...
@@ -379,7 +379,7 @@ xtlo(Xt_tword x)
static
inline
Xt_tword
xlimul
(
Xt_long
a
,
Xt_int
b
)
{
const
Xt_uint
lo_mask
=
((
Xt_uint
)
1
<<
(
xt_hint_bits
)
)
-
1U
;
const
Xt_uint
lo_mask
=
((
Xt_uint
)
1
<<
xt_hint_bits
)
-
1U
;
Xt_tword
r
;
Xt_uint
bl
=
(
Xt_uint
)
b
&
lo_mask
,
bh
=
(
Xt_uint
)
b
>>
xt_hint_bits
,
...
...
@@ -445,7 +445,7 @@ This is the version that's in the hacker book. */
static
inline
Xt_idiv
xlidivu
(
Xt_ulong
a
,
Xt_uint
b
)
{
const
Xt_uint
lo_mask
=
((
Xt_uint
)
1
<<
(
xt_hint_bits
)
)
-
1U
;
const
Xt_uint
lo_mask
=
((
Xt_uint
)
1
<<
xt_hint_bits
)
-
1U
;
const
Xt_uint
base
=
(
Xt_uint
)
1
<<
xt_hint_bits
;
// Number base
Xt_uint
un1
,
un0
,
// Norm. dividend LSD's.
ah
=
a
.
hi
,
al
=
a
.
lo
,
...
...
@@ -524,7 +524,7 @@ xdivmnu(Xt_ushort *restrict q, Xt_ushort *restrict r,
const
Xt_ushort
*
restrict
u
,
const
Xt_ushort
*
restrict
v
,
int
m
,
int
n
)
{
const
Xt_uint
lo_mask
=
((
Xt_uint
)
1
<<
(
xt_hint_bits
)
)
-
1U
;
const
Xt_uint
lo_mask
=
((
Xt_uint
)
1
<<
xt_hint_bits
)
-
1U
;
const
Xt_uint
base
=
(
Xt_uint
)
1
<<
xt_hint_bits
;
// Number base
Xt_int
s
,
t
;
...
...
@@ -621,7 +621,7 @@ xa2l(Xt_ushort a[4])
static
inline
Xt_ldiv
xlldivu
(
Xt_ulong
u
,
Xt_ulong
v
)
{
const
Xt_uint
lo_mask
=
((
Xt_uint
)
1
<<
(
xt_hint_bits
)
)
-
1U
;
const
Xt_uint
lo_mask
=
((
Xt_uint
)
1
<<
xt_hint_bits
)
-
1U
;
const
Xt_uint
base
=
(
Xt_uint
)
1
<<
xt_hint_bits
;
// Number base
Xt_uint
qhat
;
// Estimated quotient digit.
...
...
Write
Preview
Markdown
is supported
0%
Try again
or
attach a new file
.
Attach a file
Cancel
You are about to add
0
people
to the discussion. Proceed with caution.
Finish editing this message first!
Cancel
Please
register
or
sign in
to comment