Lines Matching defs:s32

19 #define S32_MIN ((s32)INT_MIN)
20 #define S32_MAX ((s32)INT_MAX)
33 #define s32 ___s32
73 case S32: return (s32)x < (s32)y ? (s32)x : (s32)y;
84 case S32: return (s32)x > (s32)y ? (u32)(s32)x : (u32)(s32)y;
95 case S32: return (u32)(s32)x;
106 case S32: return "s32";
154 case S32: return (s32)x >= SNUM_MIN_DECIMAL && (s32)x <= SNUM_MAX_DECIMAL;
168 case S32: return snappendf(sb, "%d", (s32)x);
199 if ((s32)x == S32_MAX)
201 else if ((s32)x >= S32_MAX - 256)
202 return snappendf(sb, "S32_MAX-%d", S32_MAX - (s32)x);
203 else if ((s32)x == S32_MIN)
205 else if ((s32)x <= S32_MIN + 256)
206 return snappendf(sb, "S32_MIN+%d", (s32)x - S32_MIN);
208 return snappendf(sb, "%#x", (s32)x);
266 case S32: return (struct range){ (u32)(s32)a, (u32)(s32)b };
286 * s32 range to be correct
288 if (upper32(a) == upper32(b) && (s32)a <= (s32)b)
293 * 0x00000000 is also valid), while lower bits form a proper s32 range
300 if (upper32(a) + 1 == upper32(b) && (s32)a < 0 && (s32)b >= 0)
369 s32 a = (s32)x.a, b = (s32)x.b;
420 case S32: return (s32)x.a <= (s32)x.b;
514 case S32: { range_canbe(s32); }
882 emit(BPF_MOV32_IMM(BPF_REG_1, (s32)x.a));
883 emit(BPF_MOV32_IMM(BPF_REG_2, (s32)x.b));
903 emit(BPF_MOV32_IMM(BPF_REG_1, (s32)y.a));
904 emit(BPF_MOV32_IMM(BPF_REG_2, (s32)y.b));
1332 s32 ssubvals[ARRAY_SIZE(lower_seeds)];
1525 s32 x1 = *(const s32 *)p1, x2 = *(const s32 *)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);
1802 /* (u32|s32)(<range> x <const>) */
1805 /* (u32|s32)(<const> x <range>) */
2080 /* verifier knows about [-1, 0] range for s32 for this case already */
2083 {U64, U64, {0xffffffff, 0x100000000ULL}, {0, 0}}, /* s32: [-1, 0] */
2084 {U64, U64, {0xffffffff, 0x100000001ULL}, {0, 0}}, /* s32: [-1, 1] */
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}},