"<bitmanip_insn>\t%0,%1,%z2"
[(set_attr "type" "<bitmanip_insn>")])
+;; Provide a minmax pattern for ifcvt to match.
+(define_insn "*<bitmanip_minmax_cmp_insn>_cmp_<mode>3"
+ [(set (match_operand:X 0 "register_operand" "=r")
+ (if_then_else:X
+ (bitmanip_minmax_cmp_op
+ (match_operand:X 1 "register_operand" "r")
+ (match_operand:X 2 "register_operand" "r"))
+ (match_dup 1)
+ (match_dup 2)))]
+ "TARGET_ZBB"
+ "<bitmanip_minmax_cmp_insn>\t%0,%1,%z2"
+ [(set_attr "type" "<bitmanip_minmax_cmp_insn>")])
+
;; Optimize the common case of a SImode min/max against a constant
;; that is safe both for sign- and zero-extension.
(define_split
(define_code_iterator bitmanip_minmax [smin umin smax umax])
+(define_code_iterator bitmanip_minmax_cmp_op [lt ltu le leu ge geu gt gtu])
+
+; Map a comparison operator to a min or max.
+(define_code_attr bitmanip_minmax_cmp_insn [(lt "min") (ltu "minu")
+ (le "min") (leu "minu")
+ (ge "max") (geu "maxu")
+ (gt "max") (gtu "maxu")])
+
(define_code_iterator clz_ctz_pcnt [clz ctz popcount])
(define_code_iterator bitmanip_rotate [rotate rotatert])
{
struct noce_if_info riscv_if_info = *if_info;
- riscv_if_info.original_cost -= COSTS_N_INSNS (2);
- riscv_if_info.original_cost += insn_cost (if_info->jump, if_info->speed_p);
-
/* Hack alert! When `noce_try_store_flag_mask' uses `cstore<mode>4'
to emit a conditional set operation on DImode output it comes up
with a sequence such as:
--- /dev/null
+/* { dg-do compile } */
+/* { dg-options "-O2 -march=rv64gc_zicond_zbb -mabi=lp64d" } */
+/* { dg-skip-if "" { *-*-* } { "-finline-functions" "-funroll-loops" "-ftracer" } } */
+
+int
+remove_one_fast (int *move_ordering, const int num_moves, int mark)
+{
+ int i, best = -1000000;
+ int tmp = 0;
+
+ for (i = mark; i < num_moves; i++)
+ {
+ if (move_ordering[i] > best)
+ {
+ best = move_ordering[i];
+ tmp = i;
+ }
+ }
+
+ return tmp;
+}
+
+/* { dg-final { scan-assembler-times "max\t" 1 } } */
+/* { dg-final { scan-assembler-times "czero.nez" 2 } } */
+/* { dg-final { scan-assembler-times "czero.eqz" 2 } } */
+
+int
+remove_one_fast2 (int *move_ordering, const int num_moves, int mark)
+{
+ int i, best = -1000000;
+ int tmp = 0;
+
+ for (i = mark; i < num_moves; i++)
+ {
+ if (move_ordering[i] < best)
+ {
+ best = move_ordering[i];
+ tmp = i;
+ }
+ }
+
+ return tmp;
+}
+
+/* { dg-final { scan-assembler-times "min\t" 1 } } */