rrp->current = rrp->peers->current;
n = rrp->current / (8 * sizeof(uintptr_t));
- m = 1 << rrp->current % (8 * sizeof(uintptr_t));
+ m = (uintptr_t) 1 << rrp->current % (8 * sizeof(uintptr_t));
if (!(rrp->tried[n] & m)) {
peer = &rrp->peers->peer[rrp->current];
} else {
for ( ;; ) {
n = rrp->current / (8 * sizeof(uintptr_t));
- m = 1 << rrp->current % (8 * sizeof(uintptr_t));
+ m = (uintptr_t) 1 << rrp->current % (8 * sizeof(uintptr_t));
if (!(rrp->tried[n] & m)) {