if (i_rand_limit(3) == 0)
buf[i] = i_rand_limit(4);
else
- buf[i] = i;
+ buf[i] = i % UCHAR_MAX;
}
for (i = 0; i < 1024*128 / sizeof(buf); i++) {
sha1_loop(&sha1, buf, sizeof(buf));
break;
}
- output[outpos % 4] = (input[1] << 4) | (input[2] >> 2);
+ output[outpos % 4] = ((input[1] << 4) & 0xff) | (input[2] >> 2);
if (++outpos % 4 == outstart) {
if (utf16buf_to_utf8(dest, output, &outstart, 4) < 0)
return -1;
dec->sub_pos++;
break;
case 2:
- dec->buf = (dec->buf << 4) | (dm >> 2);
+ dec->buf = ((dec->buf << 4) & 0xff) | (dm >> 2);
buffer_append_c(dest, dec->buf);
dst_avail--;
dec->buf = dm;
unsigned int j = i_rand_limit(NELEMS);
const unsigned short *ptmp = array_idx(&arr2, j);
unsigned short tmp = *ptmp;
- unsigned short repl = tmp + deltas[i_rand_limit(N_ELEMENTS(deltas))];
+ unsigned short repl = ((unsigned int)tmp +
+ deltas[i_rand_limit(N_ELEMENTS(deltas))]) & 0xffff;
array_idx_set(&arr2, j, &repl);
test_assert_idx(array_cmp(&arr1, &arr2) == (tmp == repl), i);
/* grow it */
unsigned char *p2 = t_buffer_get(i);
test_assert_idx(p == p2, i);
- p[i-1] = i;
+ p[i-1] = i & 0xff;
test_assert_idx(p[i-2] == (unsigned char)(i-1), i);
}
/* now fix it permanently */
for (i = 2; i <= left; i++) {
/* grow it */
test_assert_idx(t_try_realloc(p, i), i);
- p[i-1] = i;
+ p[i-1] = i & 0xff;
test_assert_idx(p[i-2] == (unsigned char)(i-1), i);
}
test_assert(t_get_bytes_available() < 64 + MEM_ALIGN(1));
data_len = i_rand_minmax(1, TEST_MAX_ISTREAM_SIZE);
w_data = t_malloc_no0(data_len);
for (j = 0; j < data_len; j++)
- w_data[j] = offset++;
+ w_data[j] = (offset++) & 0xff;
streams[i] = test_istream_create_data(w_data, data_len);
test_istream_set_allow_eof(streams[i], TRUE);
}
data_len = i_rand_minmax(1, 100);
w_data = t_malloc_no0(data_len);
for (j = 0; j < data_len; j++)
- w_data[j] = offset++;
+ w_data[j] = (offset++) & 0xff;
streams[i] = test_istream_create_data(w_data, data_len);
streams[i]->seekable = FALSE;
test_istream_set_allow_eof(streams[i], TRUE);