bpf/prog_tests/reg_bounds.c

15 #define U32_MAX ((u32)UINT_MAX)
16 #define U16_MAX ((u32)UINT_MAX)
31 #define u32 ___u32
71 	case U32: return (u32)x < (u32)y ? (u32)x : (u32)y;
82 	case U32: return (u32)x > (u32)y ? (u32)x : (u32)y;
84 	case S32: return (s32)x > (s32)y ? (u32)(s32)x : (u32)(s32)y;
93 	case U32: return (u32)x;
95 	case S32: return (u32)(s32)x;
104 	case U32: return "u32";
152 	case U32: return (u32)x <= UNUM_MAX_DECIMAL;
166 		case U32: return snappendf(sb, "%u", (u32)x);
181 			if ((u32)x == U32_MAX)
183 			else if ((u32)x >= U32_MAX - 256)
184 				return snappendf(sb, "U32_MAX-%u", U32_MAX - (u32)x);
186 				return snappendf(sb, "%#x", (u32)x);
246 	[S32] = { (u64)(u32)S32_MIN, (u64)(u32)S32_MAX },
264 	case U32: return (struct range){ (u32)a, (u32)b };
266 	case S32: return (struct range){ (u32)(s32)a, (u32)(s32)b };
271 static __always_inline u32 sign64(u64 x) { return (x >> 63) & 1; }
272 static __always_inline u32 sign32(u64 x) { return ((u32)x >> 31) & 1; }
273 static __always_inline u32 upper32(u64 x) { return (u32)(x >> 32); }
274 static __always_inline u64 swap_low32(u64 x, u32 y) { return (x & 0xffffffff00000000ULL) | y; }
352 	u32 a = (u32)x.a, b = (u32)x.b;
357 		/* u32 is always a valid zero-extended u64/s64 */
418 	case U32: return (u32)x.a <= (u32)x.b;
512 	case U32: { range_canbe(u32); }
859 	 * ; assign r6/w6 and r7/w7 unpredictable u64/u32 value
1035 		{"smin32=", &reg->r[S32].a, (u32)S32_MIN, true},
1036 		{"smax32=", &reg->r[S32].b, (u32)S32_MAX, true},
1095 				*f->dst = f->is_32 ? (u64)(u32)val : val;
1307 static u32 upper_seeds[] = {
1313 	(u32)S32_MIN,
1316 static u32 lower_seeds[] = {
1319 	2, (u32)-2,
1320 	255, (u32)-255,
1324 	(u32)INT_MIN,
1331 	u32 usubvals[ARRAY_SIZE(lower_seeds)];
1511 	u32 x1 = *(const u32 *)p1, x2 = *(const u32 *)p2;
1598 			printf("SUBSEED #%d: u32=%-10s s32=%-10s\n", i, sb1->buf, sb2->buf);
1650 				printf("SUBRANGE #%d: u32=%-20s s32=%-20s\n", cnt, sb1->buf, sb2->buf);
1781 	const u32 *vals;
1790 	vals = init_t == U32 ? ctx.usubvals : (const u32 *)ctx.ssubvals;
1802 			/* (u32|s32)(<range> x <const>) */
1805 			/* (u32|s32)(<const> x <range>) */
2086 	/* longer convergence case: learning from u64 -> s64 -> u64 -> u32,
2087 	 * arriving at u32: [1, U32_MAX] (instead of more pessimistic [0, U32_MAX])
2095 	{S32, U64, {(u32)S32_MIN, (u32)S32_MIN}, {(u32)(s32)-255, 0}},
2096 	{S32, S64, {(u32)S32_MIN, (u32)(s32)-255}, {(u32)(s32)-2, 0}},
2097 	{S32, S64, {0, 1}, {(u32)S32_MIN, (u32)S32_MIN}},
2098 	{S32, U32, {(u32)S32_MIN, (u32)S32_MIN}, {(u32)S32_MIN, (u32)S32_MIN}},
2108 	{S32, U32, {(u32)S32_MIN, 0}, {0, 0}},
2109 	{S32, U32, {(u32)S32_MIN, 0}, {(u32)S32_MIN, (u32)S32_MIN}},
2110 	{S32, U32, {(u32)S32_MIN, S32_MAX}, {S32_MAX, S32_MAX}},