Robin Seggelmann via RT wrote:
> #define RSMBLY_BITMASK_IS_COMPLETE(bitmask, msg_len, is_complete) { \
> + if (is_complete) for (ii = (((msg_len) - 1) >> 3) - 1;
> ii > 0 ; ii--) \
I'm wondering if there are two issues with this for loop:
1. It fails to check if bitmask[0] equals 0xff.
2. ii is initialized with ((((msg_len) - 1) >> 3) - 1). If msg_len is 8
or smaller, this expression is basically equal to (0-1) which wraps
around the unsigned long i.e. the value becomes something like
4294967295 on a 32 bit system.
-Daniel
______________________________________________________________________
OpenSSL Project http://www.openssl.org
Development Mailing List [email protected]
Automated List Manager [email protected]
