Lines Matching refs:ranges
445 * invalid ranges, in such cases it's easier to detect them
555 /* What would be the new estimates for register x and y ranges assuming truthful
558 * We assume "interesting" cases where ranges overlap. Cases where it's
682 /* now see if we can derive anything new from updated reg_state's ranges */
772 /* if 64-bit ranges are indecisive, use 32-bit subranges to
821 /* Generate test BPF program based on provided test ranges, operation, and
1168 /* Validate ranges match, and print details if they don't */
1368 * register ranges (including their expected num_t domain), and conditional
1435 /* Given setup ranges and number types, go over all supported operations,
1603 /* Generate valid ranges from upper/lower seeds */
1734 /* Go over generated constants and ranges and validate various supported
1741 const struct range *ranges;
1750 ranges = init_t == U64 ? ctx.uranges : ctx.sranges;
1764 if (verify_case(&ctx, init_t, cond_t, ranges[j], rconst))
1767 if (verify_case(&ctx, init_t, cond_t, rconst, ranges[j]))
1780 const struct range *ranges;
1789 ranges = init_t == U32 ? ctx.usubranges : ctx.ssubranges;
1803 if (verify_case(&ctx, init_t, cond_t, ranges[j], rconst))
1806 if (verify_case(&ctx, init_t, cond_t, rconst, ranges[j]))
1818 const struct range *ranges;
1829 ranges = ctx.uranges;
1833 ranges = ctx.usubranges;
1837 ranges = ctx.sranges;
1841 ranges = ctx.ssubranges;
1858 if (verify_case(&ctx, init_t, cond_t, ranges[i], ranges[j]))
1860 if (verify_case(&ctx, init_t, cond_t, ranges[j], ranges[i]))