From mboxrd@z Thu Jan 1 00:00:00 1970 Return-Path: Received: from mail-wr1-x42a.google.com (mail-wr1-x42a.google.com [IPv6:2a00:1450:4864:20::42a]) by sourceware.org (Postfix) with ESMTPS id C5505385DC07 for ; Thu, 5 Oct 2023 14:05:54 +0000 (GMT) DMARC-Filter: OpenDMARC Filter v1.4.2 sourceware.org C5505385DC07 Authentication-Results: sourceware.org; dmarc=pass (p=none dis=none) header.from=gmail.com Authentication-Results: sourceware.org; spf=pass smtp.mailfrom=gmail.com Received: by mail-wr1-x42a.google.com with SMTP id ffacd0b85a97d-3231dff4343so659704f8f.0 for ; Thu, 05 Oct 2023 07:05:54 -0700 (PDT) DKIM-Signature: v=1; a=rsa-sha256; c=relaxed/relaxed; d=gmail.com; s=20230601; t=1696514753; x=1697119553; darn=gcc.gnu.org; h=content-transfer-encoding:in-reply-to:from:references:to :content-language:subject:cc:user-agent:mime-version:date:message-id :from:to:cc:subject:date:message-id:reply-to; bh=X89HRvkMRyE0uHxL9b7KZ404hLz5tVCLN/dW3A5fH1s=; b=K2HOXfubtNj+3jYhbiLNrSwmOfdqxfi1P++vPDa5tHU20JlgvqnVSznu1/JxNkhZuw Yhk9TrWlri8QHl3lG1ovi9SNjqWlPRPL4Qu1EClPUGzT9ic77hyM0Y4X4J/Uno2PzLW2 /+r7dfEXobnWkTsGw6ay+gfsNlnp/vOuZAXU9SM9gbwWFXqDtkhgAPaYv81FT3dwv6pT vuwfeaDTqOyRdYXjRuFrG7Kh++jEYQPFHh8+Tp1DbSmsFbon/Mkp100vxeZyNBq5mEoB 9uLB25HAZ/ZBUFdI7eNdZB78fBN9VrLJD24hXq8mI7pfAvZtiWvFYo3XUxRrvthh4yW3 KVZg== X-Google-DKIM-Signature: v=1; a=rsa-sha256; c=relaxed/relaxed; d=1e100.net; s=20230601; t=1696514753; x=1697119553; h=content-transfer-encoding:in-reply-to:from:references:to :content-language:subject:cc:user-agent:mime-version:date:message-id :x-gm-message-state:from:to:cc:subject:date:message-id:reply-to; bh=X89HRvkMRyE0uHxL9b7KZ404hLz5tVCLN/dW3A5fH1s=; b=lHMM8dWpuYn4ooFsOhI4Mj9QqRYeqoITZYGzdjU0p0jEzKzNKfxNsHZ4303CpFueic w41HFQavjyJMCaPV8z+4VY5IC+I7sepTbK+ElylRiLHAvlM6qZB5l/W06jZKgR2SwHfI W540yYayqaY0WhNQi5BwUTLQ81ruXFI7VAIorMJkzeU0ZZxYIg5BQ9PLbiUlqoYX6nVD fnh1oteN2BRg4tX69dfKjNfhzugaVZjecl88xtJrLIlI0TZ3/Zyq2iGyU8oKaJSEnmOp R7ouqekKoVHNSWDunXvghZRdFCJeXOKxZILF+Y+gjqlr4g0Dxbq4HNCJLt4eeqjCiXpg ti3Q== X-Gm-Message-State: AOJu0Yyrrq+Y8Z6FE5B0YmUrMbpsRFhuyicMlCWafMwOtqfSSeB+pgRs Nf6gt6qbgIMhUwxKMWSjf8k= X-Google-Smtp-Source: AGHT+IFKIdW4A1XAxykEVfajpxgymAOsgYXRLlBmi6LktyDR5MTx5S5uxZjgVQGcjLMmxN2NTrQaGg== X-Received: by 2002:a5d:4690:0:b0:318:720c:bb3 with SMTP id u16-20020a5d4690000000b00318720c0bb3mr2334497wrq.20.1696514753038; Thu, 05 Oct 2023 07:05:53 -0700 (PDT) Received: from [192.168.1.23] (ip-046-005-130-086.um12.pools.vodafone-ip.de. [46.5.130.86]) by smtp.gmail.com with ESMTPSA id w10-20020adfde8a000000b00325a59b2080sm1865773wrl.97.2023.10.05.07.05.52 (version=TLS1_3 cipher=TLS_AES_128_GCM_SHA256 bits=128/128); Thu, 05 Oct 2023 07:05:52 -0700 (PDT) Message-ID: <85b08273-7eea-be3f-f08a-edf0780d36a7@gmail.com> Date: Thu, 5 Oct 2023 16:05:51 +0200 MIME-Version: 1.0 User-Agent: Mozilla/5.0 (X11; Linux x86_64; rv:102.0) Gecko/20100101 Thunderbird/102.15.1 Cc: rdapp.gcc@gmail.com Subject: Re: [PATCH] ifcvt/vect: Emit COND_ADD for conditional scalar reduction. Content-Language: en-US To: Tamar Christina , gcc-patches , Richard Biener References: <0193b63e-98dc-42bc-cd33-485361ea50bf@gmail.com> <671a575c-02ff-071b-967e-2e93d8986c1a@gmail.com> From: Robin Dapp In-Reply-To: Content-Type: text/plain; charset=UTF-8 Content-Transfer-Encoding: 7bit X-Spam-Status: No, score=-11.3 required=5.0 tests=BAYES_00,DKIM_SIGNED,DKIM_VALID,DKIM_VALID_AU,DKIM_VALID_EF,FREEMAIL_FROM,GIT_PATCH_0,KAM_SHORT,NICE_REPLY_A,RCVD_IN_DNSWL_NONE,SPF_HELO_NONE,SPF_PASS,TXREP autolearn=ham autolearn_force=no version=3.4.6 X-Spam-Checker-Version: SpamAssassin 3.4.6 (2021-04-09) on server2.sourceware.org List-Id: Hi Tamar, > The only comment I have is whether you actually need this helper > function? It looks like all the uses of it are in cases you have, or > will call conditional_internal_fn_code directly. removed the cond_fn_p entirely in the attached v3. Bootstrapped and regtested on x86_64, aarch64 and power10. Regards Robin Subject: [PATCH v3] ifcvt/vect: Emit COND_ADD for conditional scalar reduction. As described in PR111401 we currently emit a COND and a PLUS expression for conditional reductions. This makes it difficult to combine both into a masked reduction statement later. This patch improves that by directly emitting a COND_ADD during ifcvt and adjusting some vectorizer code to handle it. It also makes neutral_op_for_reduction return -0 if HONOR_SIGNED_ZEROS is true. gcc/ChangeLog: PR middle-end/111401 * tree-if-conv.cc (convert_scalar_cond_reduction): Emit COND_ADD if supported. (predicate_scalar_phi): Add whitespace. * tree-vect-loop.cc (fold_left_reduction_fn): Add IFN_COND_ADD. (neutral_op_for_reduction): Return -0 for PLUS. (vect_is_simple_reduction): Don't count else operand in COND_ADD. (vect_create_epilog_for_reduction): Fix whitespace. (vectorize_fold_left_reduction): Add COND_ADD handling. (vectorizable_reduction): Don't count else operand in COND_ADD. (vect_transform_reduction): Add COND_ADD handling. * tree-vectorizer.h (neutral_op_for_reduction): Add default parameter. gcc/testsuite/ChangeLog: * gcc.dg/vect/vect-cond-reduc-in-order-2-signed-zero.c: New test. * gcc.target/riscv/rvv/autovec/cond/pr111401.c: New test. --- .../vect-cond-reduc-in-order-2-signed-zero.c | 141 ++++++++++++++++ .../riscv/rvv/autovec/cond/pr111401.c | 139 ++++++++++++++++ gcc/tree-if-conv.cc | 63 ++++++-- gcc/tree-vect-loop.cc | 150 ++++++++++++++---- gcc/tree-vectorizer.h | 2 +- 5 files changed, 451 insertions(+), 44 deletions(-) create mode 100644 gcc/testsuite/gcc.dg/vect/vect-cond-reduc-in-order-2-signed-zero.c create mode 100644 gcc/testsuite/gcc.target/riscv/rvv/autovec/cond/pr111401.c diff --git a/gcc/testsuite/gcc.dg/vect/vect-cond-reduc-in-order-2-signed-zero.c b/gcc/testsuite/gcc.dg/vect/vect-cond-reduc-in-order-2-signed-zero.c new file mode 100644 index 00000000000..7b46e7d8a2a --- /dev/null +++ b/gcc/testsuite/gcc.dg/vect/vect-cond-reduc-in-order-2-signed-zero.c @@ -0,0 +1,141 @@ +/* Make sure a -0 stays -0 when we perform a conditional reduction. */ +/* { dg-do run } */ +/* { dg-require-effective-target vect_double } */ +/* { dg-add-options ieee } */ +/* { dg-additional-options "-std=gnu99 -fno-fast-math" } */ + +#include "tree-vect.h" + +#include + +#define N (VECTOR_BITS * 17) + +double __attribute__ ((noinline, noclone)) +reduc_plus_double (double *restrict a, double init, int *cond, int n) +{ + double res = init; + for (int i = 0; i < n; i++) + if (cond[i]) + res += a[i]; + return res; +} + +double __attribute__ ((noinline, noclone, optimize ("0"))) +reduc_plus_double_ref (double *restrict a, double init, int *cond, int n) +{ + double res = init; + for (int i = 0; i < n; i++) + if (cond[i]) + res += a[i]; + return res; +} + +double __attribute__ ((noinline, noclone)) +reduc_minus_double (double *restrict a, double init, int *cond, int n) +{ + double res = init; + for (int i = 0; i < n; i++) + if (cond[i]) + res -= a[i]; + return res; +} + +double __attribute__ ((noinline, noclone, optimize ("0"))) +reduc_minus_double_ref (double *restrict a, double init, int *cond, int n) +{ + double res = init; + for (int i = 0; i < n; i++) + if (cond[i]) + res -= a[i]; + return res; +} + +int __attribute__ ((optimize (1))) +main () +{ + int n = 19; + double a[N]; + int cond1[N], cond2[N]; + + for (int i = 0; i < N; i++) + { + a[i] = (i * 0.1) * (i & 1 ? 1 : -1); + cond1[i] = 0; + cond2[i] = i & 4 ? 1 : 0; + asm volatile ("" ::: "memory"); + } + + double res1 = reduc_plus_double (a, -0.0, cond1, n); + double ref1 = reduc_plus_double_ref (a, -0.0, cond1, n); + double res2 = reduc_minus_double (a, -0.0, cond1, n); + double ref2 = reduc_minus_double_ref (a, -0.0, cond1, n); + double res3 = reduc_plus_double (a, -0.0, cond1, n); + double ref3 = reduc_plus_double_ref (a, -0.0, cond1, n); + double res4 = reduc_minus_double (a, -0.0, cond1, n); + double ref4 = reduc_minus_double_ref (a, -0.0, cond1, n); + + if (res1 != ref1 || signbit (res1) != signbit (ref1)) + __builtin_abort (); + if (res2 != ref2 || signbit (res2) != signbit (ref2)) + __builtin_abort (); + if (res3 != ref3 || signbit (res3) != signbit (ref3)) + __builtin_abort (); + if (res4 != ref4 || signbit (res4) != signbit (ref4)) + __builtin_abort (); + + res1 = reduc_plus_double (a, 0.0, cond1, n); + ref1 = reduc_plus_double_ref (a, 0.0, cond1, n); + res2 = reduc_minus_double (a, 0.0, cond1, n); + ref2 = reduc_minus_double_ref (a, 0.0, cond1, n); + res3 = reduc_plus_double (a, 0.0, cond1, n); + ref3 = reduc_plus_double_ref (a, 0.0, cond1, n); + res4 = reduc_minus_double (a, 0.0, cond1, n); + ref4 = reduc_minus_double_ref (a, 0.0, cond1, n); + + if (res1 != ref1 || signbit (res1) != signbit (ref1)) + __builtin_abort (); + if (res2 != ref2 || signbit (res2) != signbit (ref2)) + __builtin_abort (); + if (res3 != ref3 || signbit (res3) != signbit (ref3)) + __builtin_abort (); + if (res4 != ref4 || signbit (res4) != signbit (ref4)) + __builtin_abort (); + + res1 = reduc_plus_double (a, -0.0, cond2, n); + ref1 = reduc_plus_double_ref (a, -0.0, cond2, n); + res2 = reduc_minus_double (a, -0.0, cond2, n); + ref2 = reduc_minus_double_ref (a, -0.0, cond2, n); + res3 = reduc_plus_double (a, -0.0, cond2, n); + ref3 = reduc_plus_double_ref (a, -0.0, cond2, n); + res4 = reduc_minus_double (a, -0.0, cond2, n); + ref4 = reduc_minus_double_ref (a, -0.0, cond2, n); + + if (res1 != ref1 || signbit (res1) != signbit (ref1)) + __builtin_abort (); + if (res2 != ref2 || signbit (res2) != signbit (ref2)) + __builtin_abort (); + if (res3 != ref3 || signbit (res3) != signbit (ref3)) + __builtin_abort (); + if (res4 != ref4 || signbit (res4) != signbit (ref4)) + __builtin_abort (); + + res1 = reduc_plus_double (a, 0.0, cond2, n); + ref1 = reduc_plus_double_ref (a, 0.0, cond2, n); + res2 = reduc_minus_double (a, 0.0, cond2, n); + ref2 = reduc_minus_double_ref (a, 0.0, cond2, n); + res3 = reduc_plus_double (a, 0.0, cond2, n); + ref3 = reduc_plus_double_ref (a, 0.0, cond2, n); + res4 = reduc_minus_double (a, 0.0, cond2, n); + ref4 = reduc_minus_double_ref (a, 0.0, cond2, n); + + if (res1 != ref1 || signbit (res1) != signbit (ref1)) + __builtin_abort (); + if (res2 != ref2 || signbit (res2) != signbit (ref2)) + __builtin_abort (); + if (res3 != ref3 || signbit (res3) != signbit (ref3)) + __builtin_abort (); + if (res4 != ref4 || signbit (res4) != signbit (ref4)) + __builtin_abort (); + + return 0; +} diff --git a/gcc/testsuite/gcc.target/riscv/rvv/autovec/cond/pr111401.c b/gcc/testsuite/gcc.target/riscv/rvv/autovec/cond/pr111401.c new file mode 100644 index 00000000000..8f1cb0d68de --- /dev/null +++ b/gcc/testsuite/gcc.target/riscv/rvv/autovec/cond/pr111401.c @@ -0,0 +1,139 @@ +/* { dg-do run { target { riscv_v } } } */ +/* { dg-additional-options "-march=rv64gcv -mabi=lp64d --param riscv-autovec-preference=scalable -fdump-tree-vect-details" } */ + +double +__attribute__ ((noipa)) +foo2 (double *__restrict a, double init, int *__restrict cond, int n) +{ + for (int i = 0; i < n; i++) + if (cond[i]) + init += a[i]; + return init; +} + +double +__attribute__ ((noipa)) +foo3 (double *__restrict a, double init, int *__restrict cond, int n) +{ + for (int i = 0; i < n; i++) + if (cond[i]) + init -= a[i]; + return init; +} + +double +__attribute__ ((noipa)) +foo4 (double *__restrict a, double init, int *__restrict cond, int n) +{ + for (int i = 0; i < n; i++) + if (cond[i]) + init *= a[i]; + return init; +} + +int +__attribute__ ((noipa)) +foo5 (int *__restrict a, int init, int *__restrict cond, int n) +{ + for (int i = 0; i < n; i++) + if (cond[i]) + init &= a[i]; + return init; +} + +int +__attribute__ ((noipa)) +foo6 (int *__restrict a, int init, int *__restrict cond, int n) +{ + for (int i = 0; i < n; i++) + if (cond[i]) + init |= a[i]; + return init; +} + +int +__attribute__ ((noipa)) +foo7 (int *__restrict a, int init, int *__restrict cond, int n) +{ + for (int i = 0; i < n; i++) + if (cond[i]) + init ^= a[i]; + return init; +} + +#define SZ 125 + +int +main () +{ + double res1 = 0, res2 = 0, res3 = 0; + double a1[SZ], a2[SZ], a3[SZ]; + int c1[SZ], c2[SZ], c3[SZ]; + + int a4[SZ], a5[SZ], a6[SZ], a7[SZ], a8[SZ]; + int res4 = 0, res5 = 0, res6 = 0; + int c4[SZ], c5[SZ], c6[SZ]; + + for (int i = 0; i < SZ; i++) + { + a1[i] = i * 3 + (i & 4) - (i & 7); + a2[i] = i * 3 + (i & 4) - (i & 7); + a3[i] = i * 0.05 + (i & 4) - (i & 7); + a4[i] = i * 3 + (i & 4) - (i & 7); + a5[i] = i * 3 + (i & 4) - (i & 7); + a6[i] = i * 3 + (i & 4) - (i & 7); + c1[i] = i & 1; + c2[i] = i & 2; + c3[i] = i & 3; + c4[i] = i & 4; + c5[i] = i & 5; + c6[i] = i & 6; + __asm__ volatile ("" : : : "memory"); + } + + double init1 = 2.7, init2 = 8.2, init3 = 0.1; + double ref1 = init1, ref2 = init2, ref3 = init3; + + int init4 = 87, init5 = 11, init6 = -123894344, init7 = -2, init8 = 854893; + int ref4 = init4, ref5 = init5, ref6 = init6; + +#pragma GCC novector + for (int i = 0; i < SZ; i++) + { + if (c1[i]) + ref1 += a1[i]; + if (c2[i]) + ref2 -= a2[i]; + if (c3[i]) + ref3 *= a3[i]; + if (c4[i]) + ref4 &= a4[i]; + if (c5[i]) + ref5 |= a5[i]; + if (c6[i]) + ref6 ^= a6[i]; + } + + res1 = foo2 (a1, init1, c1, SZ); + res2 = foo3 (a2, init2, c2, SZ); + res3 = foo4 (a3, init3, c3, SZ); + res4 = foo5 (a4, init4, c4, SZ); + res5 = foo6 (a5, init5, c5, SZ); + res6 = foo7 (a6, init6, c6, SZ); + + if (res1 != ref1) + __builtin_abort (); + if (res2 != ref2) + __builtin_abort (); + if (res3 != ref3) + __builtin_abort (); + if (res4 != ref4) + __builtin_abort (); + if (res5 != ref5) + __builtin_abort (); + if (res6 != ref6) + __builtin_abort (); +} + +/* { dg-final { scan-tree-dump-times "vectorized 1 loop" 5 "vect" } } */ +/* { dg-final { scan-tree-dump-not "VCOND_MASK" "vect" } } */ diff --git a/gcc/tree-if-conv.cc b/gcc/tree-if-conv.cc index a8c915913ae..b334173794d 100644 --- a/gcc/tree-if-conv.cc +++ b/gcc/tree-if-conv.cc @@ -1852,10 +1852,12 @@ convert_scalar_cond_reduction (gimple *reduc, gimple_stmt_iterator *gsi, gimple *new_assign; tree rhs; tree rhs1 = gimple_assign_rhs1 (reduc); + tree lhs = gimple_assign_lhs (reduc); tree tmp = make_temp_ssa_name (TREE_TYPE (rhs1), NULL, "_ifc_"); tree c; enum tree_code reduction_op = gimple_assign_rhs_code (reduc); - tree op_nochange = neutral_op_for_reduction (TREE_TYPE (rhs1), reduction_op, NULL); + tree op_nochange = neutral_op_for_reduction (TREE_TYPE (rhs1), reduction_op, + NULL, false); gimple_seq stmts = NULL; if (dump_file && (dump_flags & TDF_DETAILS)) @@ -1864,19 +1866,52 @@ convert_scalar_cond_reduction (gimple *reduc, gimple_stmt_iterator *gsi, print_gimple_stmt (dump_file, reduc, 0, TDF_SLIM); } - /* Build cond expression using COND and constant operand - of reduction rhs. */ - c = fold_build_cond_expr (TREE_TYPE (rhs1), - unshare_expr (cond), - swap ? op_nochange : op1, - swap ? op1 : op_nochange); + /* If possible try to create an IFN_COND_ADD instead of a COND_EXPR and + a PLUS_EXPR. Don't do this if the reduction def operand itself is + a vectorizable call as we can create a COND version of it directly. */ + internal_fn ifn; + ifn = get_conditional_internal_fn (reduction_op); - /* Create assignment stmt and insert it at GSI. */ - new_assign = gimple_build_assign (tmp, c); - gsi_insert_before (gsi, new_assign, GSI_SAME_STMT); - /* Build rhs for unconditional increment/decrement/logic_operation. */ - rhs = gimple_build (&stmts, reduction_op, - TREE_TYPE (rhs1), op0, tmp); + bool try_cond_op = true; + gimple *opstmt; + if (TREE_CODE (op1) == SSA_NAME + && (opstmt = SSA_NAME_DEF_STMT (op1)) + && is_gimple_call (opstmt)) + { + combined_fn cfn = gimple_call_combined_fn (opstmt); + internal_fn ifnop; + reduction_fn_for_scalar_code (cfn, &ifnop); + if (vectorized_internal_fn_supported_p (ifnop, TREE_TYPE + (gimple_call_lhs (opstmt)))) + try_cond_op = false; + } + + if (ifn != IFN_LAST + && vectorized_internal_fn_supported_p (ifn, TREE_TYPE (lhs)) + && try_cond_op && !swap) + { + gcall *cond_call = gimple_build_call_internal (ifn, 4, + unshare_expr (cond), + op0, op1, op0); + gsi_insert_before (gsi, cond_call, GSI_SAME_STMT); + gimple_call_set_lhs (cond_call, tmp); + rhs = tmp; + } + else + { + /* Build cond expression using COND and constant operand + of reduction rhs. */ + c = fold_build_cond_expr (TREE_TYPE (rhs1), + unshare_expr (cond), + swap ? op_nochange : op1, + swap ? op1 : op_nochange); + /* Create assignment stmt and insert it at GSI. */ + new_assign = gimple_build_assign (tmp, c); + gsi_insert_before (gsi, new_assign, GSI_SAME_STMT); + /* Build rhs for unconditional increment/decrement/logic_operation. */ + rhs = gimple_build (&stmts, reduction_op, + TREE_TYPE (rhs1), op0, tmp); + } if (has_nop) { @@ -2241,7 +2276,7 @@ predicate_scalar_phi (gphi *phi, gimple_stmt_iterator *gsi) { /* Convert reduction stmt into vectorizable form. */ rhs = convert_scalar_cond_reduction (reduc, gsi, cond, op0, op1, - swap,has_nop, nop_reduc); + swap, has_nop, nop_reduc); redundant_ssa_names.safe_push (std::make_pair (res, rhs)); } new_stmt = gimple_build_assign (res, rhs); diff --git a/gcc/tree-vect-loop.cc b/gcc/tree-vect-loop.cc index 23c6e8259e7..3c80029eec5 100644 --- a/gcc/tree-vect-loop.cc +++ b/gcc/tree-vect-loop.cc @@ -3672,7 +3672,7 @@ vect_analyze_loop (class loop *loop, vec_info_shared *shared) static bool fold_left_reduction_fn (code_helper code, internal_fn *reduc_fn) { - if (code == PLUS_EXPR) + if (code == PLUS_EXPR || code == MINUS_EXPR) { *reduc_fn = IFN_FOLD_LEFT_PLUS; return true; @@ -3751,23 +3751,29 @@ reduction_fn_for_scalar_code (code_helper code, internal_fn *reduc_fn) by the introduction of additional X elements, return that X, otherwise return null. CODE is the code of the reduction and SCALAR_TYPE is type of the scalar elements. If the reduction has just a single initial value - then INITIAL_VALUE is that value, otherwise it is null. */ + then INITIAL_VALUE is that value, otherwise it is null. + If AS_INITIAL is TRUE the value is supposed to be used as initial value. + In that case no signed zero is returned. */ tree neutral_op_for_reduction (tree scalar_type, code_helper code, - tree initial_value) + tree initial_value, bool as_initial) { if (code.is_tree_code ()) switch (tree_code (code)) { - case WIDEN_SUM_EXPR: case DOT_PROD_EXPR: case SAD_EXPR: - case PLUS_EXPR: case MINUS_EXPR: case BIT_IOR_EXPR: case BIT_XOR_EXPR: return build_zero_cst (scalar_type); + case WIDEN_SUM_EXPR: + case PLUS_EXPR: + if (!as_initial && HONOR_SIGNED_ZEROS (scalar_type)) + return build_real (scalar_type, dconstm0); + else + return build_zero_cst (scalar_type); case MULT_EXPR: return build_one_cst (scalar_type); @@ -4106,8 +4112,14 @@ vect_is_simple_reduction (loop_vec_info loop_info, stmt_vec_info phi_info, return NULL; } - nphi_def_loop_uses++; - phi_use_stmt = use_stmt; + /* In case of a COND_OP (mask, op1, op2, op1) reduction we might have + op1 twice (once as definition, once as else) in the same operation. + Only count it as one. */ + if (use_stmt != phi_use_stmt) + { + nphi_def_loop_uses++; + phi_use_stmt = use_stmt; + } } tree latch_def = PHI_ARG_DEF_FROM_EDGE (phi, loop_latch_edge (loop)); @@ -6041,7 +6053,7 @@ vect_create_epilog_for_reduction (loop_vec_info loop_vinfo, gcc_assert (STMT_VINFO_IN_PATTERN_P (orig_stmt_info)); gcc_assert (STMT_VINFO_RELATED_STMT (orig_stmt_info) == stmt_info); } - + scalar_dest = gimple_get_lhs (orig_stmt_info->stmt); scalar_type = TREE_TYPE (scalar_dest); scalar_results.truncate (0); @@ -6378,7 +6390,7 @@ vect_create_epilog_for_reduction (loop_vec_info loop_vinfo, if (REDUC_GROUP_FIRST_ELEMENT (stmt_info)) initial_value = reduc_info->reduc_initial_values[0]; neutral_op = neutral_op_for_reduction (TREE_TYPE (vectype), code, - initial_value); + initial_value, false); } if (neutral_op) vector_identity = gimple_build_vector_from_val (&seq, vectype, @@ -6860,8 +6872,8 @@ vectorize_fold_left_reduction (loop_vec_info loop_vinfo, gimple_stmt_iterator *gsi, gimple **vec_stmt, slp_tree slp_node, gimple *reduc_def_stmt, - tree_code code, internal_fn reduc_fn, - tree ops[3], tree vectype_in, + code_helper code, internal_fn reduc_fn, + tree *ops, int num_ops, tree vectype_in, int reduc_index, vec_loop_masks *masks, vec_loop_lens *lens) { @@ -6877,17 +6889,48 @@ vectorize_fold_left_reduction (loop_vec_info loop_vinfo, gcc_assert (!nested_in_vect_loop_p (loop, stmt_info)); gcc_assert (ncopies == 1); - gcc_assert (TREE_CODE_LENGTH (code) == binary_op); + + bool is_cond_op = false; + if (!code.is_tree_code ()) + { + code = conditional_internal_fn_code (internal_fn (code)); + gcc_assert (code != ERROR_MARK); + is_cond_op = true; + } + + gcc_assert (TREE_CODE_LENGTH (tree_code (code)) == binary_op); if (slp_node) - gcc_assert (known_eq (TYPE_VECTOR_SUBPARTS (vectype_out), - TYPE_VECTOR_SUBPARTS (vectype_in))); + { + if (is_cond_op) + { + if (dump_enabled_p ()) + dump_printf_loc (MSG_MISSED_OPTIMIZATION, vect_location, + "fold-left reduction on SLP not supported.\n"); + return false; + } - tree op0 = ops[1 - reduc_index]; + gcc_assert (known_eq (TYPE_VECTOR_SUBPARTS (vectype_out), + TYPE_VECTOR_SUBPARTS (vectype_in))); + } + + /* The operands either come from a binary operation or an IFN_COND operation. + The former is a gimple assign with binary rhs and the latter is a + gimple call with four arguments. */ + gcc_assert (num_ops == 2 || num_ops == 4); + tree op0, opmask; + if (!is_cond_op) + op0 = ops[1 - reduc_index]; + else + { + op0 = ops[2]; + opmask = ops[0]; + gcc_assert (!slp_node); + } int group_size = 1; stmt_vec_info scalar_dest_def_info; - auto_vec vec_oprnds0; + auto_vec vec_oprnds0, vec_opmask; if (slp_node) { auto_vec > vec_defs (2); @@ -6903,9 +6946,15 @@ vectorize_fold_left_reduction (loop_vec_info loop_vinfo, vect_get_vec_defs_for_operand (loop_vinfo, stmt_info, 1, op0, &vec_oprnds0); scalar_dest_def_info = stmt_info; + + /* For an IFN_COND_OP we also need the vector mask operand. */ + if (is_cond_op) + vect_get_vec_defs_for_operand (loop_vinfo, stmt_info, 1, + opmask, &vec_opmask); } - tree scalar_dest = gimple_assign_lhs (scalar_dest_def_info->stmt); + gimple *sdef = scalar_dest_def_info->stmt; + tree scalar_dest = gimple_get_lhs (sdef); tree scalar_type = TREE_TYPE (scalar_dest); tree reduc_var = gimple_phi_result (reduc_def_stmt); @@ -6939,13 +6988,16 @@ vectorize_fold_left_reduction (loop_vec_info loop_vinfo, tree bias = NULL_TREE; if (LOOP_VINFO_FULLY_MASKED_P (loop_vinfo)) mask = vect_get_loop_mask (loop_vinfo, gsi, masks, vec_num, vectype_in, i); + else if (is_cond_op) + mask = vec_opmask[0]; if (LOOP_VINFO_FULLY_WITH_LENGTH_P (loop_vinfo)) { len = vect_get_loop_len (loop_vinfo, gsi, lens, vec_num, vectype_in, i, 1); signed char biasval = LOOP_VINFO_PARTIAL_LOAD_STORE_BIAS (loop_vinfo); bias = build_int_cst (intQI_type_node, biasval); - mask = build_minus_one_cst (truth_type_for (vectype_in)); + if (!is_cond_op) + mask = build_minus_one_cst (truth_type_for (vectype_in)); } /* Handle MINUS by adding the negative. */ @@ -6957,7 +7009,8 @@ vectorize_fold_left_reduction (loop_vec_info loop_vinfo, def0 = negated; } - if (mask && mask_reduc_fn == IFN_LAST) + if (LOOP_VINFO_FULLY_MASKED_P (loop_vinfo) + && mask && mask_reduc_fn == IFN_LAST) def0 = merge_with_identity (gsi, mask, vectype_out, def0, vector_identity); @@ -6988,8 +7041,8 @@ vectorize_fold_left_reduction (loop_vec_info loop_vinfo, } else { - reduc_var = vect_expand_fold_left (gsi, scalar_dest_var, code, - reduc_var, def0); + reduc_var = vect_expand_fold_left (gsi, scalar_dest_var, + tree_code (code), reduc_var, def0); new_stmt = SSA_NAME_DEF_STMT (reduc_var); /* Remove the statement, so that we can use the same code paths as for statements that we've just created. */ @@ -7440,6 +7493,11 @@ vectorizable_reduction (loop_vec_info loop_vinfo, if (i == STMT_VINFO_REDUC_IDX (stmt_info)) continue; + /* For an IFN_COND_OP we might hit the reduction definition operand + twice (once as definition, once as else). */ + if (op.ops[i] == op.ops[STMT_VINFO_REDUC_IDX (stmt_info)]) + continue; + /* There should be only one cycle def in the stmt, the one leading to reduc_def. */ if (VECTORIZABLE_CYCLE_DEF (dt)) @@ -7640,6 +7698,15 @@ vectorizable_reduction (loop_vec_info loop_vinfo, when generating the code inside the loop. */ code_helper orig_code = STMT_VINFO_REDUC_CODE (phi_info); + + /* If conversion might have created a conditional operation like + IFN_COND_ADD already. Use the internal code for the following checks. */ + if (orig_code.is_internal_fn ()) + { + tree_code new_code = conditional_internal_fn_code (internal_fn (orig_code)); + orig_code = new_code != ERROR_MARK ? new_code : orig_code; + } + STMT_VINFO_REDUC_CODE (reduc_info) = orig_code; vect_reduction_type reduction_type = STMT_VINFO_REDUC_TYPE (reduc_info); @@ -7678,7 +7745,7 @@ vectorizable_reduction (loop_vec_info loop_vinfo, { if (dump_enabled_p ()) dump_printf_loc (MSG_MISSED_OPTIMIZATION, vect_location, - "reduction: not commutative/associative"); + "reduction: not commutative/associative\n"); return false; } } @@ -8213,6 +8280,7 @@ vect_transform_reduction (loop_vec_info loop_vinfo, code_helper code = canonicalize_code (op.code, op.type); internal_fn cond_fn = get_conditional_internal_fn (code, op.type); + vec_loop_masks *masks = &LOOP_VINFO_MASKS (loop_vinfo); vec_loop_lens *lens = &LOOP_VINFO_LENS (loop_vinfo); bool mask_by_cond_expr = use_mask_by_cond_expr_p (code, cond_fn, vectype_in); @@ -8231,17 +8299,29 @@ vect_transform_reduction (loop_vec_info loop_vinfo, if (code == COND_EXPR) gcc_assert (ncopies == 1); + /* A binary COND_OP reduction must have the same definition and else + value. */ + bool cond_fn_p = code.is_internal_fn () + && conditional_internal_fn_code (internal_fn (code)) != ERROR_MARK; + if (cond_fn_p) + { + gcc_assert (code == IFN_COND_ADD || code == IFN_COND_SUB + || code == IFN_COND_MUL || code == IFN_COND_AND + || code == IFN_COND_IOR || code == IFN_COND_XOR); + gcc_assert (op.num_ops == 4 && (op.ops[1] == op.ops[3])); + } + bool masked_loop_p = LOOP_VINFO_FULLY_MASKED_P (loop_vinfo); vect_reduction_type reduction_type = STMT_VINFO_REDUC_TYPE (reduc_info); if (reduction_type == FOLD_LEFT_REDUCTION) { internal_fn reduc_fn = STMT_VINFO_REDUC_FN (reduc_info); - gcc_assert (code.is_tree_code ()); + gcc_assert (code.is_tree_code () || cond_fn_p); return vectorize_fold_left_reduction (loop_vinfo, stmt_info, gsi, vec_stmt, slp_node, reduc_def_phi, - tree_code (code), reduc_fn, op.ops, vectype_in, reduc_index, masks, - lens); + code, reduc_fn, op.ops, op.num_ops, vectype_in, + reduc_index, masks, lens); } bool single_defuse_cycle = STMT_VINFO_FORCE_SINGLE_CYCLE (reduc_info); @@ -8254,14 +8334,20 @@ vect_transform_reduction (loop_vec_info loop_vinfo, tree scalar_dest = gimple_get_lhs (stmt_info->stmt); tree vec_dest = vect_create_destination_var (scalar_dest, vectype_out); + /* Get NCOPIES vector definitions for all operands except the reduction + definition. */ vect_get_vec_defs (loop_vinfo, stmt_info, slp_node, ncopies, single_defuse_cycle && reduc_index == 0 ? NULL_TREE : op.ops[0], &vec_oprnds0, single_defuse_cycle && reduc_index == 1 ? NULL_TREE : op.ops[1], &vec_oprnds1, - op.num_ops == 3 - && !(single_defuse_cycle && reduc_index == 2) + op.num_ops == 4 + || (op.num_ops == 3 + && !(single_defuse_cycle && reduc_index == 2)) ? op.ops[2] : NULL_TREE, &vec_oprnds2); + + /* For single def-use cycles get one copy of the vectorized reduction + definition. */ if (single_defuse_cycle) { gcc_assert (!slp_node); @@ -8301,7 +8387,7 @@ vect_transform_reduction (loop_vec_info loop_vinfo, } else { - if (op.num_ops == 3) + if (op.num_ops >= 3) vop[2] = vec_oprnds2[i]; if (masked_loop_p && mask_by_cond_expr) @@ -8314,10 +8400,16 @@ vect_transform_reduction (loop_vec_info loop_vinfo, if (emulated_mixed_dot_prod) new_stmt = vect_emulate_mixed_dot_prod (loop_vinfo, stmt_info, gsi, vec_dest, vop); - else if (code.is_internal_fn ()) + + else if (code.is_internal_fn () && !cond_fn_p) new_stmt = gimple_build_call_internal (internal_fn (code), op.num_ops, vop[0], vop[1], vop[2]); + else if (code.is_internal_fn () && cond_fn_p) + new_stmt = gimple_build_call_internal (internal_fn (code), + op.num_ops, + vop[0], vop[1], vop[2], + vop[1]); else new_stmt = gimple_build_assign (vec_dest, tree_code (op.code), vop[0], vop[1], vop[2]); diff --git a/gcc/tree-vectorizer.h b/gcc/tree-vectorizer.h index f1d0cd79961..e22067400af 100644 --- a/gcc/tree-vectorizer.h +++ b/gcc/tree-vectorizer.h @@ -2319,7 +2319,7 @@ extern tree vect_create_addr_base_for_vector_ref (vec_info *, tree); /* In tree-vect-loop.cc. */ -extern tree neutral_op_for_reduction (tree, code_helper, tree); +extern tree neutral_op_for_reduction (tree, code_helper, tree, bool = true); extern widest_int vect_iv_limit_for_partial_vectors (loop_vec_info loop_vinfo); bool vect_rgroup_iv_might_wrap_p (loop_vec_info, rgroup_controls *); /* Used in tree-vect-loop-manip.cc */ -- 2.41.0