casts for picky compilers.
This commit is contained in:
parent
cbf8906f5d
commit
ff1ccbfc21
|
@ -811,7 +811,8 @@ static int re_optimize_star_jump(bufp, code)
|
||||||
p2 = code;
|
p2 = code;
|
||||||
/* p1 points inside loop, p2 points to after loop */
|
/* p1 points inside loop, p2 points to after loop */
|
||||||
if (!re_do_compile_fastmap(bufp->buffer, bufp->used,
|
if (!re_do_compile_fastmap(bufp->buffer, bufp->used,
|
||||||
p2 - bufp->buffer, &can_be_null, map))
|
(int)(p2 - bufp->buffer),
|
||||||
|
&can_be_null, map))
|
||||||
goto make_normal_jump;
|
goto make_normal_jump;
|
||||||
|
|
||||||
/* If we might introduce a new update point inside the
|
/* If we might introduce a new update point inside the
|
||||||
|
|
|
@ -195,7 +195,7 @@ sha_transform(sha_info)
|
||||||
SHA_INT32 T, A, B, C, D, E, W[80], *WP;
|
SHA_INT32 T, A, B, C, D, E, W[80], *WP;
|
||||||
|
|
||||||
memcpy(W, sha_info->data, sizeof(sha_info->data));
|
memcpy(W, sha_info->data, sizeof(sha_info->data));
|
||||||
longReverse(W, sizeof(sha_info->data), sha_info->Endianness);
|
longReverse(W, (int)sizeof(sha_info->data), sha_info->Endianness);
|
||||||
|
|
||||||
for (i = 16; i < 80; ++i) {
|
for (i = 16; i < 80; ++i) {
|
||||||
W[i] = W[i-3] ^ W[i-8] ^ W[i-14] ^ W[i-16];
|
W[i] = W[i-3] ^ W[i-8] ^ W[i-14] ^ W[i-16];
|
||||||
|
|
|
@ -512,7 +512,7 @@ file_read(f, args)
|
||||||
if (!PyArg_ParseTuple(args, "|l", &bytesrequested))
|
if (!PyArg_ParseTuple(args, "|l", &bytesrequested))
|
||||||
return NULL;
|
return NULL;
|
||||||
if (bytesrequested < 0)
|
if (bytesrequested < 0)
|
||||||
buffersize = new_buffersize(f, 0);
|
buffersize = new_buffersize(f, (size_t)0);
|
||||||
else
|
else
|
||||||
buffersize = bytesrequested;
|
buffersize = bytesrequested;
|
||||||
v = PyString_FromStringAndSize((char *)NULL, buffersize);
|
v = PyString_FromStringAndSize((char *)NULL, buffersize);
|
||||||
|
|
Loading…
Reference in New Issue