Home
last modified time | relevance | path

Searched refs:RHS (Results 1 – 2 of 2) sorted by relevance

/linux/tools/testing/selftests/bpf/
H A Dbpf_experimental.h104 #define __bpf_assert_check(LHS, op, RHS) \ argument
108 _Static_assert(__builtin_constant_p((RHS)), "2nd argument must be a constant expression")
110 #define __bpf_assert(LHS, op, cons, RHS, VAL) \ argument
114 : : [lhs] "r"(LHS), [rhs] cons(RHS), [value] "ri"(VAL) : ); \
117 #define __bpf_assert_op_sign(LHS, op, cons, RHS, VAL, supp_sign) \ argument
119 __bpf_assert_check(LHS, op, RHS); \
121 __bpf_assert(LHS, "s" #op, cons, RHS, VAL); \
123 __bpf_assert(LHS, #op, cons, RHS, VAL); \
126 #define __bpf_assert_op(LHS, op, RHS, VAL, supp_sign) \ argument
128 if (sizeof(typeof(RHS)) == 8) { \
[all …]
/linux/tools/perf/util/
H A Dexpr.y139 #define BINARY_OP(RESULT, OP, LHS, RHS) \
140 if (!compute_ids || (is_const(LHS.val) && is_const(RHS.val))) { \
142 assert(RHS.ids == NULL); \
143 if (isnan(LHS.val) || isnan(RHS.val)) { \
146 RESULT.val = LHS.val OP RHS.val; \
150 RESULT = union_expr(LHS, RHS); \
189 * LHS == RHS, so both are an identical constant. No need to
199 * Value is either the LHS or RHS and we need the IF expression
317 /* LHS and/or RHS need computing from event IDs so union. */
332 /* LHS and/or RHS nee
[all...]