From patchwork Mon Jun 12 07:57:38 2023 Content-Type: text/plain; charset="utf-8" MIME-Version: 1.0 Content-Transfer-Encoding: 7bit X-Patchwork-Submitter: Stefan Schulze Frielinghaus X-Patchwork-Id: 1793783 Return-Path: X-Original-To: incoming@patchwork.ozlabs.org Delivered-To: patchwork-incoming@legolas.ozlabs.org Authentication-Results: legolas.ozlabs.org; spf=pass (sender SPF authorized) smtp.mailfrom=gcc.gnu.org (client-ip=8.43.85.97; helo=sourceware.org; envelope-from=gcc-patches-bounces+incoming=patchwork.ozlabs.org@gcc.gnu.org; receiver=) Authentication-Results: legolas.ozlabs.org; dkim=pass (1024-bit key; unprotected) header.d=gcc.gnu.org header.i=@gcc.gnu.org header.a=rsa-sha256 header.s=default header.b=ZKa6jOkX; dkim-atps=neutral Received: from sourceware.org (ip-8-43-85-97.sourceware.org [8.43.85.97]) (using TLSv1.3 with cipher TLS_AES_256_GCM_SHA384 (256/256 bits) key-exchange X25519 server-signature ECDSA (P-384) server-digest SHA384) (No client certificate requested) by legolas.ozlabs.org (Postfix) with ESMTPS id 4QfkbK0yRfz20X6 for ; Mon, 12 Jun 2023 17:58:53 +1000 (AEST) Received: from server2.sourceware.org (localhost [IPv6:::1]) by sourceware.org (Postfix) with ESMTP id 5B8743858C2C for ; Mon, 12 Jun 2023 07:58:47 +0000 (GMT) DKIM-Filter: OpenDKIM Filter v2.11.0 sourceware.org 5B8743858C2C DKIM-Signature: v=1; a=rsa-sha256; c=relaxed/relaxed; d=gcc.gnu.org; s=default; t=1686556727; bh=Q8fSBccg7W+ITOaTJDcWMhGWMbuMOxAFvn9QjolflG4=; h=To:Cc:Subject:Date:List-Id:List-Unsubscribe:List-Archive: List-Post:List-Help:List-Subscribe:From:Reply-To:From; b=ZKa6jOkX4mldcsh9+8r3iPUH41U71LKZ0g/VF2xlQMQovDiOePD0OVN8G5LctFABS yRuFlKiN0Hlm2hL1jlA7uRkBmwvh81ryhwlbyF+OICsGi1ozVgsLAuEbs51+w07P8n KgmxavhnUXJEx7VLQuNrdGQPJ4b0GmyhckO0Gpwc= X-Original-To: gcc-patches@gcc.gnu.org Delivered-To: gcc-patches@gcc.gnu.org Received: from mx0a-001b2d01.pphosted.com (mx0a-001b2d01.pphosted.com [148.163.156.1]) by sourceware.org (Postfix) with ESMTPS id 867CF3858412 for ; Mon, 12 Jun 2023 07:58:27 +0000 (GMT) DMARC-Filter: OpenDMARC Filter v1.4.2 sourceware.org 867CF3858412 Received: from pps.filterd (m0360083.ppops.net [127.0.0.1]) by mx0a-001b2d01.pphosted.com (8.17.1.19/8.17.1.19) with ESMTP id 35C7os3Y024643 for ; Mon, 12 Jun 2023 07:58:26 GMT Received: from ppma04ams.nl.ibm.com (63.31.33a9.ip4.static.sl-reverse.com [169.51.49.99]) by mx0a-001b2d01.pphosted.com (PPS) with ESMTPS id 3r5yb706sr-1 (version=TLSv1.2 cipher=ECDHE-RSA-AES256-GCM-SHA384 bits=256 verify=NOT) for ; Mon, 12 Jun 2023 07:58:26 +0000 Received: from pps.filterd (ppma04ams.nl.ibm.com [127.0.0.1]) by ppma04ams.nl.ibm.com (8.17.1.19/8.17.1.19) with ESMTP id 35C3jGBG014562 for ; Mon, 12 Jun 2023 07:58:23 GMT Received: from smtprelay04.fra02v.mail.ibm.com ([9.218.2.228]) by ppma04ams.nl.ibm.com (PPS) with ESMTPS id 3r4gt51bhb-1 (version=TLSv1.2 cipher=ECDHE-RSA-AES256-GCM-SHA384 bits=256 verify=NOT) for ; Mon, 12 Jun 2023 07:58:23 +0000 Received: from smtpav04.fra02v.mail.ibm.com (smtpav04.fra02v.mail.ibm.com [10.20.54.103]) by smtprelay04.fra02v.mail.ibm.com (8.14.9/8.14.9/NCO v10.0) with ESMTP id 35C7wKvt45613654 (version=TLSv1/SSLv3 cipher=DHE-RSA-AES256-GCM-SHA384 bits=256 verify=OK); Mon, 12 Jun 2023 07:58:20 GMT Received: from smtpav04.fra02v.mail.ibm.com (unknown [127.0.0.1]) by IMSVA (Postfix) with ESMTP id 4EB622004B; Mon, 12 Jun 2023 07:58:20 +0000 (GMT) Received: from smtpav04.fra02v.mail.ibm.com (unknown [127.0.0.1]) by IMSVA (Postfix) with ESMTP id 2F75D20043; Mon, 12 Jun 2023 07:58:20 +0000 (GMT) Received: from a8345010.lnxne.boe (unknown [9.152.108.100]) by smtpav04.fra02v.mail.ibm.com (Postfix) with ESMTPS; Mon, 12 Jun 2023 07:58:20 +0000 (GMT) To: gcc-patches@gcc.gnu.org Cc: Stefan Schulze Frielinghaus Subject: [PATCH] combine: Narrow comparison of memory and constant Date: Mon, 12 Jun 2023 09:57:38 +0200 Message-Id: <20230612075737.1801-1-stefansf@linux.ibm.com> X-Mailer: git-send-email 2.39.2 MIME-Version: 1.0 X-TM-AS-GCONF: 00 X-Proofpoint-GUID: XMjg13uOlw-BwKB0dBmc-OQhuyRE5vkx X-Proofpoint-ORIG-GUID: XMjg13uOlw-BwKB0dBmc-OQhuyRE5vkx X-Proofpoint-Virus-Version: vendor=baseguard engine=ICAP:2.0.254,Aquarius:18.0.957,Hydra:6.0.573,FMLib:17.11.176.26 definitions=2023-06-12_04,2023-06-09_01,2023-05-22_02 X-Proofpoint-Spam-Details: rule=outbound_notspam policy=outbound score=0 lowpriorityscore=0 adultscore=0 priorityscore=1501 phishscore=0 malwarescore=0 spamscore=0 mlxlogscore=999 clxscore=1015 impostorscore=0 suspectscore=0 bulkscore=0 mlxscore=0 classifier=spam adjust=0 reason=mlx scancount=1 engine=8.12.0-2305260000 definitions=main-2306120064 X-Spam-Status: No, score=-8.3 required=5.0 tests=BAYES_00, DKIM_SIGNED, DKIM_VALID, DKIM_VALID_EF, GIT_PATCH_0, KAM_SHORT, RCVD_IN_MSPIKE_H5, RCVD_IN_MSPIKE_WL, SPF_HELO_NONE, SPF_PASS, TXREP, T_SCC_BODY_TEXT_LINE autolearn=ham autolearn_force=no version=3.4.6 X-Spam-Checker-Version: SpamAssassin 3.4.6 (2021-04-09) on server2.sourceware.org X-BeenThere: gcc-patches@gcc.gnu.org X-Mailman-Version: 2.1.29 Precedence: list List-Id: Gcc-patches mailing list List-Unsubscribe: , List-Archive: List-Post: List-Help: List-Subscribe: , X-Patchwork-Original-From: Stefan Schulze Frielinghaus via Gcc-patches From: Stefan Schulze Frielinghaus Reply-To: Stefan Schulze Frielinghaus Errors-To: gcc-patches-bounces+incoming=patchwork.ozlabs.org@gcc.gnu.org Sender: "Gcc-patches" Comparisons between memory and constants might be done in a smaller mode resulting in smaller constants which might finally end up as immediates instead of in the literal pool. For example, on s390x a non-symmetric comparison like x <= 0x3fffffffffffffff results in the constant being spilled to the literal pool and an 8 byte memory comparison is emitted. Ideally, an equivalent comparison x0 <= 0x3f where x0 is the most significant byte of x, is emitted where the constant is smaller and more likely to materialize as an immediate. Similarly, comparisons of the form x >= 0x4000000000000000 can be shortened into x0 >= 0x40. I'm not entirely sure whether combine is the right place to implement something like this. In my first try I implemented it in TARGET_CANONICALIZE_COMPARISON but then thought other targets might profit from it, too. simplify_context::simplify_relational_operation_1 seems to be the wrong place since code/mode may change. Any opinions? gcc/ChangeLog: * combine.cc (simplify_compare_const): Narrow comparison of memory and constant. (try_combine): Adapt new function signature. (simplify_comparison): Adapt new function signature. gcc/testsuite/ChangeLog: * gcc.target/s390/cmp-mem-const-1.c: New test. * gcc.target/s390/cmp-mem-const-2.c: New test. --- gcc/combine.cc | 82 ++++++++++++++- .../gcc.target/s390/cmp-mem-const-1.c | 99 +++++++++++++++++++ .../gcc.target/s390/cmp-mem-const-2.c | 23 +++++ 3 files changed, 200 insertions(+), 4 deletions(-) create mode 100644 gcc/testsuite/gcc.target/s390/cmp-mem-const-1.c create mode 100644 gcc/testsuite/gcc.target/s390/cmp-mem-const-2.c diff --git a/gcc/combine.cc b/gcc/combine.cc index 5aa0ec5c45a..6ad1600dc1b 100644 --- a/gcc/combine.cc +++ b/gcc/combine.cc @@ -460,7 +460,7 @@ static rtx simplify_shift_const (rtx, enum rtx_code, machine_mode, rtx, static int recog_for_combine (rtx *, rtx_insn *, rtx *); static rtx gen_lowpart_for_combine (machine_mode, rtx); static enum rtx_code simplify_compare_const (enum rtx_code, machine_mode, - rtx, rtx *); + rtx *, rtx *); static enum rtx_code simplify_comparison (enum rtx_code, rtx *, rtx *); static void update_table_tick (rtx); static void record_value_for_reg (rtx, rtx_insn *, rtx); @@ -3185,7 +3185,7 @@ try_combine (rtx_insn *i3, rtx_insn *i2, rtx_insn *i1, rtx_insn *i0, compare_code = orig_compare_code = GET_CODE (*cc_use_loc); if (is_a (GET_MODE (i2dest), &mode)) compare_code = simplify_compare_const (compare_code, mode, - op0, &op1); + &op0, &op1); target_canonicalize_comparison (&compare_code, &op0, &op1, 1); } @@ -11800,9 +11800,10 @@ gen_lowpart_for_combine (machine_mode omode, rtx x) static enum rtx_code simplify_compare_const (enum rtx_code code, machine_mode mode, - rtx op0, rtx *pop1) + rtx *pop0, rtx *pop1) { scalar_int_mode int_mode; + rtx op0 = *pop0; HOST_WIDE_INT const_op = INTVAL (*pop1); /* Get the constant we are comparing against and turn off all bits @@ -11987,6 +11988,79 @@ simplify_compare_const (enum rtx_code code, machine_mode mode, break; } + /* Narrow non-symmetric comparison of memory and constant as e.g. + x0...x7 <= 0x3fffffffffffffff into x0 <= 0x3f where x0 is the most + significant byte. Likewise, transform x0...x7 >= 0x4000000000000000 into + x0 >= 0x40. */ + if ((code == LEU || code == LTU || code == GEU || code == GTU) + && is_a (GET_MODE (op0), &int_mode) + && MEM_P (op0) + && !MEM_VOLATILE_P (op0) + && (unsigned HOST_WIDE_INT)const_op > 0xff) + { + unsigned HOST_WIDE_INT n = (unsigned HOST_WIDE_INT)const_op; + enum rtx_code adjusted_code = code; + + /* If the least significant bit is already zero, then adjust the + comparison in the hope that we hit cases like + op0 <= 0x3ffffdfffffffffe + where the adjusted comparison + op0 < 0x3ffffdffffffffff + can be shortened into + op0' < 0x3ffffd. */ + if (code == LEU && (n & 1) == 0) + { + ++n; + adjusted_code = LTU; + } + /* or e.g. op0 < 0x4020000000000000 */ + else if (code == LTU && (n & 1) == 0) + { + --n; + adjusted_code = LEU; + } + /* or op0 >= 0x4000000000000001 */ + else if (code == GEU && (n & 1) == 1) + { + --n; + adjusted_code = GTU; + } + /* or op0 > 0x3fffffffffffffff. */ + else if (code == GTU && (n & 1) == 1) + { + ++n; + adjusted_code = GEU; + } + + scalar_int_mode narrow_mode_iter; + bool lower_p = code == LEU || code == LTU; + bool greater_p = !lower_p; + FOR_EACH_MODE_UNTIL (narrow_mode_iter, int_mode) + { + unsigned nbits = GET_MODE_PRECISION (int_mode) + - GET_MODE_PRECISION (narrow_mode_iter); + unsigned HOST_WIDE_INT mask = (HOST_WIDE_INT_1U << nbits) - 1; + unsigned HOST_WIDE_INT lower_bits = n & mask; + if ((lower_p && lower_bits == mask) + || (greater_p && lower_bits == 0)) + { + n >>= nbits; + break; + } + } + + if (narrow_mode_iter < int_mode) + { + poly_int64 offset = BYTES_BIG_ENDIAN + ? 0 + : GET_MODE_SIZE (int_mode) + - GET_MODE_SIZE (narrow_mode_iter); + *pop0 = adjust_address (op0, narrow_mode_iter, offset); + *pop1 = GEN_INT (n); + return adjusted_code; + } + } + *pop1 = GEN_INT (const_op); return code; } @@ -12179,7 +12253,7 @@ simplify_comparison (enum rtx_code code, rtx *pop0, rtx *pop1) /* Try to simplify the compare to constant, possibly changing the comparison op, and/or changing op1 to zero. */ - code = simplify_compare_const (code, raw_mode, op0, &op1); + code = simplify_compare_const (code, raw_mode, &op0, &op1); const_op = INTVAL (op1); /* Compute some predicates to simplify code below. */ diff --git a/gcc/testsuite/gcc.target/s390/cmp-mem-const-1.c b/gcc/testsuite/gcc.target/s390/cmp-mem-const-1.c new file mode 100644 index 00000000000..b90c2a8c224 --- /dev/null +++ b/gcc/testsuite/gcc.target/s390/cmp-mem-const-1.c @@ -0,0 +1,99 @@ +/* { dg-do compile { target { lp64 } } } */ +/* { dg-options "-O1 -march=z13 -mzarch" } */ +/* { dg-final { scan-assembler-not {\tclc\t} } } */ + +int +ge_8b (unsigned long *x) +{ + return *x >= 0x4000000000000000; +} + +int +ge_8b_adjust (unsigned long *x) +{ + return *x >= 0x4000000000000001; +} + +int +ge_6b (unsigned long *x) +{ + return *x >= 0x400000000000; +} + +int +ge_6b_adjust (unsigned long *x) +{ + return *x >= 0x400000000001; +} + +int +gt_8b (unsigned long *x) +{ + return *x > 0x4000000000000000; +} + +int +gt_8b_adjust (unsigned long *x) +{ + return *x > 0x3fffffffffffffff; +} + +int +gt_6b (unsigned long *x) +{ + return *x > 0x400000000000; +} + +int +gt_6b_adjust (unsigned long *x) +{ + return *x > 0x3fffffffffff; +} + +int +le_8b (unsigned long *x) +{ + return *x <= 0x3ff7ffffffffffff; +} + +int +le_6b (unsigned long *x) +{ + return *x <= 0x3f7fffffffff; +} + +int +le_8b_adjust (unsigned long *x) +{ + return *x <= 0x3ffffdfffffffffe; +} + +int +le_6b_adjust (unsigned long *x) +{ + return *x <= 0x3ffffffffffe; +} + +int +lt_8b (unsigned long *x) +{ + return *x < 0x3fffffffffffffff; +} + +int +lt_6b (unsigned long *x) +{ + return *x < 0x3fffffffffff; +} + +int +lt_8b_adjust (unsigned long *x) +{ + return *x < 0x4020000000000000; +} + +int +lt_6b_adjust (unsigned long *x) +{ + return *x < 0x400000000000; +} diff --git a/gcc/testsuite/gcc.target/s390/cmp-mem-const-2.c b/gcc/testsuite/gcc.target/s390/cmp-mem-const-2.c new file mode 100644 index 00000000000..e3951870d94 --- /dev/null +++ b/gcc/testsuite/gcc.target/s390/cmp-mem-const-2.c @@ -0,0 +1,23 @@ +/* { dg-do compile { target { lp64 } } } */ +/* { dg-options "-O1 -march=z13 -mzarch" } */ +/* { dg-final { scan-assembler-not {\tclc\t} } } */ + +struct s +{ + long a; + unsigned b : 1; + unsigned c : 1; +}; + +int foo (struct s *x) +{ + /* Expression + x->b || x->c + is transformed into + _1 = BIT_FIELD_REF <*x_4(D), 64, 64>; + _2 = _1 > 0x3FFFFFFFFFFFFFFF; + where the constant may materialize in the literal pool and an 8 byte CLC + may be emitted. Ensure this is not the case. + */ + return x->b || x->c; +}