Skip to content
Projects
Groups
Snippets
Help
This project
Loading...
Sign in / Register
Toggle navigation
W
wine-winehq
Project
Project
Details
Activity
Cycle Analytics
Repository
Repository
Files
Commits
Branches
Tags
Contributors
Graph
Compare
Charts
Issues
0
Issues
0
List
Board
Labels
Milestones
Merge Requests
0
Merge Requests
0
CI / CD
CI / CD
Pipelines
Jobs
Schedules
Charts
Registry
Registry
Wiki
Wiki
Snippets
Snippets
Members
Members
Collapse sidebar
Close sidebar
Activity
Graph
Charts
Create a new issue
Jobs
Commits
Issue Boards
Open sidebar
wine
wine-winehq
Commits
303bff28
Commit
303bff28
authored
Jan 17, 2008
by
Andrew Talbot
Committed by
Alexandre Julliard
Jan 18, 2008
Browse files
Options
Browse Files
Download
Email Patches
Plain Diff
rsaenh: Remove unneeded casts.
parent
cb959648
Hide whitespace changes
Inline
Side-by-side
Showing
3 changed files
with
25 additions
and
26 deletions
+25
-26
handle.c
dlls/rsaenh/handle.c
+2
-2
mpi.c
dlls/rsaenh/mpi.c
+12
-13
rsaenh.c
dlls/rsaenh/rsaenh.c
+11
-11
No files found.
dlls/rsaenh/handle.c
View file @
303bff28
...
...
@@ -193,10 +193,10 @@ int alloc_handle_table(HANDLETABLE **lplpTable)
int
release_handle_table
(
HANDLETABLE
*
lpTable
)
{
TRACE
(
"(lpTable=%p)
\n
"
,
lpTable
);
release_all_handles
(
lpTable
);
destroy_handle_table
(
lpTable
);
return
(
int
)
HeapFree
(
GetProcessHeap
(),
0
,
lpTable
);
return
HeapFree
(
GetProcessHeap
(),
0
,
lpTable
);
}
/******************************************************************************
...
...
dlls/rsaenh/mpi.c
View file @
303bff28
...
...
@@ -1069,7 +1069,7 @@ int mp_div (const mp_int * a, const mp_int * b, mp_int * c, mp_int * d)
/* normalize both x and y, ensure that y >= b/2, [b == 2**DIGIT_BIT] */
norm
=
mp_count_bits
(
&
y
)
%
DIGIT_BIT
;
if
(
norm
<
(
int
)(
DIGIT_BIT
-
1
)
)
{
if
(
norm
<
DIGIT_BIT
-
1
)
{
norm
=
(
DIGIT_BIT
-
1
)
-
norm
;
if
((
res
=
mp_mul_2d
(
&
x
,
norm
,
&
x
))
!=
MP_OKAY
)
{
goto
__Y
;
...
...
@@ -1285,7 +1285,7 @@ int mp_div_2d (const mp_int * a, int b, mp_int * c, mp_int * d)
}
/* shift by as many digits in the bit count */
if
(
b
>=
(
int
)
DIGIT_BIT
)
{
if
(
b
>=
DIGIT_BIT
)
{
mp_rshd
(
c
,
b
/
DIGIT_BIT
);
}
...
...
@@ -1390,9 +1390,9 @@ int mp_div_d (const mp_int * a, mp_digit b, mp_int * c, mp_digit * d)
}
else
{
t
=
0
;
}
q
.
dp
[
ix
]
=
(
mp_digit
)
t
;
q
.
dp
[
ix
]
=
t
;
}
if
(
d
!=
NULL
)
{
*
d
=
(
mp_digit
)
w
;
}
...
...
@@ -1710,11 +1710,11 @@ mp_exptmod_fast (const mp_int * G, const mp_int * X, mp_int * P, mp_int * Y, int
}
/* read next digit and reset bitcnt */
buf
=
X
->
dp
[
digidx
--
];
bitcnt
=
(
int
)
DIGIT_BIT
;
bitcnt
=
DIGIT_BIT
;
}
/* grab the next msb from the exponent */
y
=
(
mp_digit
)(
buf
>>
(
DIGIT_BIT
-
1
))
&
1
;
y
=
(
buf
>>
(
DIGIT_BIT
-
1
))
&
1
;
buf
<<=
(
mp_digit
)
1
;
/* if the bit is zero and mode == 0 then we ignore it
...
...
@@ -2609,7 +2609,7 @@ mp_mod_2d (const mp_int * a, int b, mp_int * c)
}
/* if the modulus is larger than the value than return */
if
(
b
>
(
int
)
(
a
->
used
*
DIGIT_BIT
)
)
{
if
(
b
>
a
->
used
*
DIGIT_BIT
)
{
res
=
mp_copy
(
a
,
c
);
return
res
;
}
...
...
@@ -2624,8 +2624,7 @@ mp_mod_2d (const mp_int * a, int b, mp_int * c)
c
->
dp
[
x
]
=
0
;
}
/* clear the digit that is not completely outside/inside the modulus */
c
->
dp
[
b
/
DIGIT_BIT
]
&=
(
mp_digit
)
((((
mp_digit
)
1
)
<<
(((
mp_digit
)
b
)
%
DIGIT_BIT
))
-
((
mp_digit
)
1
));
c
->
dp
[
b
/
DIGIT_BIT
]
&=
(
1
<<
((
mp_digit
)
b
%
DIGIT_BIT
))
-
1
;
mp_clamp
(
c
);
return
MP_OKAY
;
}
...
...
@@ -2661,7 +2660,7 @@ int mp_montgomery_calc_normalization (mp_int * a, const mp_int * b)
/* now compute C = A * B mod b */
for
(
x
=
bits
-
1
;
x
<
(
int
)
DIGIT_BIT
;
x
++
)
{
for
(
x
=
bits
-
1
;
x
<
DIGIT_BIT
;
x
++
)
{
if
((
res
=
mp_mul_2
(
a
,
a
))
!=
MP_OKAY
)
{
return
res
;
}
...
...
@@ -2907,14 +2906,14 @@ int mp_mul_2d (const mp_int * a, int b, mp_int * c)
}
}
if
(
c
->
alloc
<
(
int
)(
c
->
used
+
b
/
DIGIT_BIT
+
1
)
)
{
if
(
c
->
alloc
<
c
->
used
+
b
/
DIGIT_BIT
+
1
)
{
if
((
res
=
mp_grow
(
c
,
c
->
used
+
b
/
DIGIT_BIT
+
1
))
!=
MP_OKAY
)
{
return
res
;
}
}
/* shift by as many digits in the bit count */
if
(
b
>=
(
int
)
DIGIT_BIT
)
{
if
(
b
>=
DIGIT_BIT
)
{
if
((
res
=
mp_lshd
(
c
,
b
/
DIGIT_BIT
))
!=
MP_OKAY
)
{
return
res
;
}
...
...
@@ -4068,7 +4067,7 @@ int s_mp_exptmod (const mp_int * G, const mp_int * X, mp_int * P, mp_int * Y)
}
/* read next digit and reset the bitcnt */
buf
=
X
->
dp
[
digidx
--
];
bitcnt
=
(
int
)
DIGIT_BIT
;
bitcnt
=
DIGIT_BIT
;
}
/* grab the next msb from the exponent */
...
...
dlls/rsaenh/rsaenh.c
View file @
303bff28
...
...
@@ -828,8 +828,8 @@ static HCRYPTKEY new_key(HCRYPTPROV hProv, ALG_ID aiAlgid, DWORD dwFlags, CRYPTK
}
}
hCryptKey
=
(
HCRYPTKEY
)
new_object
(
&
handle_table
,
sizeof
(
CRYPTKEY
),
RSAENH_MAGIC_KEY
,
destroy_key
,
(
OBJECTHDR
**
)
&
pCryptKey
);
hCryptKey
=
new_object
(
&
handle_table
,
sizeof
(
CRYPTKEY
),
RSAENH_MAGIC_KEY
,
destroy_key
,
(
OBJECTHDR
**
)
&
pCryptKey
);
if
(
hCryptKey
!=
(
HCRYPTKEY
)
INVALID_HANDLE_VALUE
)
{
pCryptKey
->
aiAlgid
=
aiAlgid
;
...
...
@@ -1095,8 +1095,8 @@ static HCRYPTPROV new_key_container(PCCH pszContainerName, DWORD dwFlags, const
KEYCONTAINER
*
pKeyContainer
;
HCRYPTPROV
hKeyContainer
;
hKeyContainer
=
(
HCRYPTPROV
)
new_object
(
&
handle_table
,
sizeof
(
KEYCONTAINER
),
RSAENH_MAGIC_CONTAINER
,
destroy_key_container
,
(
OBJECTHDR
**
)
&
pKeyContainer
);
hKeyContainer
=
new_object
(
&
handle_table
,
sizeof
(
KEYCONTAINER
),
RSAENH_MAGIC_CONTAINER
,
destroy_key_container
,
(
OBJECTHDR
**
)
&
pKeyContainer
);
if
(
hKeyContainer
!=
(
HCRYPTPROV
)
INVALID_HANDLE_VALUE
)
{
lstrcpynA
(
pKeyContainer
->
szName
,
pszContainerName
,
MAX_PATH
);
...
...
@@ -1670,10 +1670,10 @@ BOOL WINAPI RSAENH_CPCreateHash(HCRYPTPROV hProv, ALG_ID Algid, HCRYPTKEY hKey,
}
}
*
phHash
=
(
HCRYPTHASH
)
new_object
(
&
handle_table
,
sizeof
(
CRYPTHASH
),
RSAENH_MAGIC_HASH
,
destroy_hash
,
(
OBJECTHDR
**
)
&
pCryptHash
);
*
phHash
=
new_object
(
&
handle_table
,
sizeof
(
CRYPTHASH
),
RSAENH_MAGIC_HASH
,
destroy_hash
,
(
OBJECTHDR
**
)
&
pCryptHash
);
if
(
!
pCryptHash
)
return
FALSE
;
pCryptHash
->
aiAlgid
=
Algid
;
pCryptHash
->
hKey
=
hKey
;
pCryptHash
->
hProv
=
hProv
;
...
...
@@ -1834,8 +1834,8 @@ BOOL WINAPI RSAENH_CPDuplicateHash(HCRYPTPROV hUID, HCRYPTHASH hHash, DWORD *pdw
return
FALSE
;
}
*
phHash
=
(
HCRYPTHASH
)
new_object
(
&
handle_table
,
sizeof
(
CRYPTHASH
),
RSAENH_MAGIC_HASH
,
destroy_hash
,
(
OBJECTHDR
**
)
&
pDestHash
);
*
phHash
=
new_object
(
&
handle_table
,
sizeof
(
CRYPTHASH
),
RSAENH_MAGIC_HASH
,
destroy_hash
,
(
OBJECTHDR
**
)
&
pDestHash
);
if
(
*
phHash
!=
(
HCRYPTHASH
)
INVALID_HANDLE_VALUE
)
{
memcpy
(
pDestHash
,
pSrcHash
,
sizeof
(
CRYPTHASH
));
...
...
@@ -1890,8 +1890,8 @@ BOOL WINAPI RSAENH_CPDuplicateKey(HCRYPTPROV hUID, HCRYPTKEY hKey, DWORD *pdwRes
return
FALSE
;
}
*
phKey
=
(
HCRYPTKEY
)
new_object
(
&
handle_table
,
sizeof
(
CRYPTKEY
),
RSAENH_MAGIC_KEY
,
destroy_key
,
(
OBJECTHDR
**
)
&
pDestKey
);
*
phKey
=
new_object
(
&
handle_table
,
sizeof
(
CRYPTKEY
),
RSAENH_MAGIC_KEY
,
destroy_key
,
(
OBJECTHDR
**
)
&
pDestKey
);
if
(
*
phKey
!=
(
HCRYPTKEY
)
INVALID_HANDLE_VALUE
)
{
memcpy
(
pDestKey
,
pSrcKey
,
sizeof
(
CRYPTKEY
));
...
...
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