SIZE_MAX
if (size > SIZE_MAX)
if (pos < 0 || (uint64)pos > SIZE_MAX || (size_t)pos > fSize - 1) {
#if SIZE_MAX >= UINT64_MAX
size_t max = SIZE_MAX);
#if SIZE_MAX > UINT32_MAX
if ((r > SIZE_MAX / 128 / p) ||
#if SIZE_MAX / 256 <= UINT32_MAX
(r > (SIZE_MAX - 64) / 256) ||
(N > SIZE_MAX / 128 / r)) {
if (BE (MIN (IDX_MAX, SIZE_MAX / max_object_size) / 2 <= pat_len, 0))
if (BE (MIN (IDX_MAX, SIZE_MAX / max_object_size) < new_nodes_alloc, 0))
if (BE (MIN (IDX_MAX, SIZE_MAX / max_object_size) < new_buf_len, 0))
# define SSIZE_MAX ((ssize_t) (SIZE_MAX / 2))
if (BE (SIZE_MAX / sizeof (re_dfastate_t *) < new_alloc, 0))
if (BE ((((SIZE_MAX - (sizeof (re_node_set) + sizeof (bitset_t)) * SBC_MAX)
if (BE (MIN (IDX_MAX, SIZE_MAX / sizeof (re_dfastate_t *)) / 2
if (BE (MIN (IDX_MAX, SIZE_MAX / max_object_size) < n, 0))
if (BE ((MIN (IDX_MAX, SIZE_MAX / sizeof (re_dfastate_t *))
if (BE (MIN (IDX_MAX, SIZE_MAX / sizeof (re_dfastate_t *)) <= match_last, 0))
if (__glibc_unlikely (len > SIZE_MAX / sizeof (wchar_t))) \
if (sz >= SIZE_MAX - mopts.malloc_guard - MALLOC_PAGESIZE) {
if (newsz >= SIZE_MAX - mopts.malloc_guard - MALLOC_PAGESIZE) {
nmemb > 0 && SIZE_MAX / nmemb < size) {
nmemb > 0 && SIZE_MAX / nmemb < size) {
newnmemb > 0 && SIZE_MAX / newnmemb < size) {
oldnmemb > 0 && SIZE_MAX / oldnmemb < size) {
newnmemb > 0 && SIZE_MAX / newnmemb < size) {
oldnmemb > 0 && SIZE_MAX / oldnmemb < size) {
if (alignment > SIZE_MAX - sz)
if (sz >= SIZE_MAX - mopts.malloc_guard - MALLOC_PAGESIZE) {
if (d->regions_total > SIZE_MAX / sizeof(struct region_info) / 2)
if (len > SIZE_MAX/sizeof *names) break;
if (elsize != 0 && nelem != 0 && nelem > SIZE_MAX / elsize) {
const size_t valuesz = value * (SIZE_MAX / UINT8_MAX);
std::min(size, (uint64)SIZE_MAX), bytesWritten);
status = path.SetTo(NULL, KPath::DEFAULT, SIZE_MAX);
status_t status = path.SetTo(NULL, KPath::LAZY_ALLOC, SIZE_MAX);
if (calloc(SIZE_MAX, SIZE_MAX) != NULL) {