From mboxrd@z Thu Jan 1 00:00:00 1970 Return-Path: Received: by sourceware.org (Postfix, from userid 1666) id B46573857343; Mon, 16 Oct 2023 12:49:25 +0000 (GMT) DKIM-Filter: OpenDKIM Filter v2.11.0 sourceware.org B46573857343 DKIM-Signature: v=1; a=rsa-sha256; c=relaxed/relaxed; d=gcc.gnu.org; s=default; t=1697460565; bh=Ez+2pX5pdN354XAkHluGv9m+ObYEBOzCmuvY5akva6w=; h=From:To:Subject:Date:From; b=eBOGNlq2wErn0F5yL78eN/4qcvmxwA9Fs6lXV1GxSPhrxecHH10sH72PyYiGGqCPY j7qMp1ZhL60F+TmETEcaBjX6Jz33DijWKSPDmRawEhHhfnGdoIu1w+bwJvD8P6d3ED Gtixzrir03+RIYNcHVUskPNZ4GBc4W+zY2i6saw8= Content-Type: text/plain; charset="us-ascii" MIME-Version: 1.0 Content-Transfer-Encoding: 7bit From: Richard Biener To: gcc-cvs@gcc.gnu.org Subject: [gcc(refs/users/rguenth/heads/vect-force-slp)] Add --param vect-single-lane-slp X-Act-Checkin: gcc X-Git-Author: Richard Biener X-Git-Refname: refs/users/rguenth/heads/vect-force-slp X-Git-Oldrev: 8e15af61ade7bcd8239125904e02f3cfdc445e91 X-Git-Newrev: 3193fdcfed995df0579224eabfe703213656ed66 Message-Id: <20231016124925.B46573857343@sourceware.org> Date: Mon, 16 Oct 2023 12:49:25 +0000 (GMT) List-Id: https://gcc.gnu.org/g:3193fdcfed995df0579224eabfe703213656ed66 commit 3193fdcfed995df0579224eabfe703213656ed66 Author: Richard Biener Date: Fri Sep 29 12:54:17 2023 +0200 Add --param vect-single-lane-slp The following adds --param vect-single-lane-slp to guard single-lane loop SLP discovery. As first client we look at non-grouped stores with an assert that SLP discovery works to discover gaps in it. * params.opt (-param=vect-single-lane-slp=): New. * tree-vect-slp.cc (vect_analyze_slp): Perform single-lane loop SLP discovery for non-grouped stores if requested. Diff: --- gcc/params.opt | 4 ++++ gcc/tree-vect-slp.cc | 26 ++++++++++++++++++++++++++ 2 files changed, 30 insertions(+) diff --git a/gcc/params.opt b/gcc/params.opt index ae2fa54fc589..8cfc9bcc60a4 100644 --- a/gcc/params.opt +++ b/gcc/params.opt @@ -1183,6 +1183,10 @@ The maximum factor which the loop vectorizer applies to the cost of statements i Common Joined UInteger Var(param_vect_induction_float) Init(1) IntegerRange(0, 1) Param Optimization Enable loop vectorization of floating point inductions. +-param=vect-single-lane-slp= +Common Joined UInteger Var(param_vect_single_lane_slp) Init(0) IntegerRange(0, 1) Param Optimization +Enable single lane SLP discovery. + -param=vect-force-slp= Common Joined UInteger Var(param_vect_force_slp) Init(0) IntegerRange(0, 1) Param Optimization Fail vectorization when falling back to non-SLP. diff --git a/gcc/tree-vect-slp.cc b/gcc/tree-vect-slp.cc index af8f5031bd27..4e0b0436aa31 100644 --- a/gcc/tree-vect-slp.cc +++ b/gcc/tree-vect-slp.cc @@ -3534,6 +3534,7 @@ vect_analyze_slp_instance (vec_info *vinfo, opt_result vect_analyze_slp (vec_info *vinfo, unsigned max_tree_size) { + loop_vec_info loop_vinfo = dyn_cast (vinfo); unsigned int i; stmt_vec_info first_element; slp_instance instance; @@ -3549,6 +3550,31 @@ vect_analyze_slp (vec_info *vinfo, unsigned max_tree_size) FOR_EACH_VEC_ELT (vinfo->grouped_stores, i, first_element) vect_analyze_slp_instance (vinfo, bst_map, first_element, slp_inst_kind_store, max_tree_size, &limit); + if (loop_vinfo && param_vect_single_lane_slp != 0) + { + data_reference_p dr; + FOR_EACH_VEC_ELT (vinfo->shared->datarefs, i, dr) + if (DR_IS_WRITE (dr)) + { + stmt_vec_info stmt_info = vinfo->lookup_dr (dr)->stmt; + /* It works a bit to dissolve the group but that's + not really what we want to do. Instead group analysis + above starts discovery for each lane and pieces them together + to a single store to the whole group. */ + if (STMT_VINFO_GROUPED_ACCESS (stmt_info)) + continue; + vec stmts; + vec roots = vNULL; + vec remain = vNULL; + stmts.create (1); + stmts.quick_push (stmt_info); + bool res = vect_build_slp_instance (vinfo, slp_inst_kind_store, + stmts, roots, remain, + max_tree_size, &limit, + bst_map, NULL); + gcc_assert (res); + } + } if (bb_vec_info bb_vinfo = dyn_cast (vinfo)) {