INDEX_MAX
if (!ckd_add(&sum, a, b) && sum <= INDEX_MAX)
if (a <= INDEX_MAX && b <= INDEX_MAX - a)
|| INDEX_MAX < initial_nenvptrs)
if (initial_nenvptrs == INDEX_MAX / sizeof *environ)
if (!HAVE_SETENV && INDEX_MAX <= arglenmax)
ptrdiff_t dotdotetcsize, linksize = INDEX_MAX;
= (min(INT_MAX, INDEX_MAX) / FORMAT_LEN_GROWTH_BOUND) };
if (!ckd_add(&sum, a, b) && sum <= INDEX_MAX)
if (a <= INDEX_MAX && b <= INDEX_MAX - a)
if (!ckd_mul(&product, nitems, itemsize) && product <= INDEX_MAX)
ptrdiff_t nitems_max = INDEX_MAX / itemsize;
&& !ckd_mul(&product, *nitems_alloc, itemsize) && product <= INDEX_MAX)
if (*nitems_alloc <= ((INDEX_MAX - 1) / 3 * 2) / itemsize) {
CTASSERT(INDEX_MAX * 10 < sizeof (uint64_t) * 8);
while (index < INDEX_MAX) {
#define INDEX_NEXT(m) (((m) == INDEX_MAX)? 2 : ((m) + 2) & INDEX_MAX)
#define INDEX_DECODE(i) ((i) & ~INDEX_MAX)
#define INDEX_ENCODE(p, n) (((n) & ~INDEX_MAX) | (p)->ua_index)
#define INDEX_VALID(p, i) (((i) & INDEX_MAX) == (p)->ua_index)
#define INDEX_CHECK(i) (((i) & INDEX_MAX) != 0)
#define INDEX_NEXT(m) (((m) == INDEX_MAX)? 1 : ((m) + 1) & INDEX_MAX)
#define INDEX_TO_NODE(i) ((uu_list_node_impl_t *)((i) & ~INDEX_MAX))
#define NODE_TO_INDEX(p, n) (((uintptr_t)(n) & ~INDEX_MAX) | (p)->ul_index)
#define INDEX_VALID(p, i) (((i) & INDEX_MAX) == (p)->ul_index)
#define INDEX_CHECK(i) (((i) & INDEX_MAX) != 0)