[{"id":3688091,"web_url":"http://patchwork.ozlabs.org/comment/3688091/","msgid":"<CALvbMcB9Rxo4EeMp8NSamQE+HSWQuyi1x5wcG2cfZueDrZGknw@mail.gmail.com>","list_archive_url":null,"date":"2026-05-07T23:17:57","subject":"Re: [PATCH v3] MATCH: Add simplification for MAX<a&CST0, a&CST1> and\n MIN<a&CST0, a&CST1> to match.pd [PR109878]","submitter":{"id":91428,"url":"http://patchwork.ozlabs.org/api/people/91428/","name":"Andrew Pinski","email":"andrew.pinski@oss.qualcomm.com"},"content":"On Wed, May 6, 2026 at 5:43 AM Eikansh Gupta\n<eikansh.gupta@oss.qualcomm.com> wrote:\n>\n> Min and max could be optimized if both operands are defined by\n> (same) variable restricted by an and(&). For signed types,\n> optimization can be done when both constant have same sign bit.\n> The patch also adds optimization for specific case of min/max(a, a&CST).\n>\n> This patch adds match pattern for:\n>\n> max (a & CST0, a & CST1) -> a & CST0 IFF CST0 & CST1 == CST1\n> min (a & CST0, a & CST1) -> a & CST0 IFF CST0 & CST1 == CST0\n> min (a, a & CST) --> a & CST\n> max (a, a & CST) --> a\n>\n> The v2 of the patch has been approved. Patch link:\n> https://gcc.gnu.org/pipermail/gcc-patches/2024-July/657801.html\n\nPushed now after a bootstrap/test on x86_64-linux-gnu.\nWith a slightly fixed up changelog part of the commit message.\n\nThanks,\nAndrea\n\n>\n>         PR tree-optimization/109878\n>\n> gcc/ChangeLog:\n>\n>         * match.pd min/max (a & CST0, a & CST1): New pattern.\n>         min/max (a, a & CST): New pattern.\n>\n> gcc/testsuite/ChangeLog:\n>\n>         * gcc.dg/tree-ssa/pr109878-1.c: New test.\n>         * gcc.dg/tree-ssa/pr109878-2.c: New test.\n>         * gcc.dg/tree-ssa/pr109878-3.c: New test.\n>         * gcc.dg/tree-ssa/pr109878.c: New test.\n>\n> Signed-off-by: Eikansh Gupta <eikansh.gupta@oss.qualcomm.com>\n> ---\n>  gcc/match.pd                               | 26 +++++++++\n>  gcc/testsuite/gcc.dg/tree-ssa/pr109878-1.c | 64 ++++++++++++++++++++++\n>  gcc/testsuite/gcc.dg/tree-ssa/pr109878-2.c | 31 +++++++++++\n>  gcc/testsuite/gcc.dg/tree-ssa/pr109878-3.c | 42 ++++++++++++++\n>  gcc/testsuite/gcc.dg/tree-ssa/pr109878.c   | 64 ++++++++++++++++++++++\n>  5 files changed, 227 insertions(+)\n>  create mode 100644 gcc/testsuite/gcc.dg/tree-ssa/pr109878-1.c\n>  create mode 100644 gcc/testsuite/gcc.dg/tree-ssa/pr109878-2.c\n>  create mode 100644 gcc/testsuite/gcc.dg/tree-ssa/pr109878-3.c\n>  create mode 100644 gcc/testsuite/gcc.dg/tree-ssa/pr109878.c\n>\n> diff --git a/gcc/match.pd b/gcc/match.pd\n> index 7db8ce7580f..2333fb72fd2 100644\n> --- a/gcc/match.pd\n> +++ b/gcc/match.pd\n> @@ -5052,6 +5052,32 @@ DEFINE_INT_AND_FLOAT_ROUND_FN (RINT)\n>    (if (!HONOR_NANS (@0))\n>     (neeq @0 @1))))\n>\n> +/* min (a & CST0, a & CST1) -> a & CST0 IFF CST0 & CST1 == CST0 */\n> +/* max (a & CST0, a & CST1) -> a & CST0 IFF CST0 & CST1 == CST1 */\n> +/* If signed a, then both the constants should have same sign. */\n> +(for minmax (min max)\n> + (simplify\n> +  (minmax (bit_and@3 @0 INTEGER_CST@1) (bit_and@4 @0 INTEGER_CST@2))\n> +   (if (TYPE_UNSIGNED (type)\n> +        || (tree_int_cst_sgn (@1) == tree_int_cst_sgn (@2)))\n> +    (with { auto andvalue = wi::to_wide (@1) & wi::to_wide (@2); }\n> +     (if (andvalue == ((minmax == MIN_EXPR)\n> +                       ? wi::to_wide (@1) : wi::to_wide (@2)))\n> +      @3\n> +      (if (andvalue == ((minmax != MIN_EXPR)\n> +                        ? wi::to_wide (@1) : wi::to_wide (@2)))\n> +       @4))))))\n> +\n> +/* min (a, a & CST) --> a & CST */\n> +/* max (a, a & CST) --> a */\n> +(for minmax (min max)\n> + (simplify\n> +  (minmax @0 (bit_and@1 @0 INTEGER_CST@2))\n> +   (if (TYPE_UNSIGNED(type))\n> +    (if (minmax == MIN_EXPR)\n> +     @1\n> +     @0))))\n> +\n>  /* Simplify min (&var[off0], &var[off1]) etc. depending on whether\n>     the addresses are known to be less, equal or greater.  */\n>  (for minmax (min max)\n> diff --git a/gcc/testsuite/gcc.dg/tree-ssa/pr109878-1.c b/gcc/testsuite/gcc.dg/tree-ssa/pr109878-1.c\n> new file mode 100644\n> index 00000000000..509e59adea1\n> --- /dev/null\n> +++ b/gcc/testsuite/gcc.dg/tree-ssa/pr109878-1.c\n> @@ -0,0 +1,64 @@\n> +/* PR tree-optimization/109878 */\n> +/* { dg-do compile } */\n> +/* { dg-options \"-O1 -fdump-tree-optimized\" } */\n> +\n> +/* All the constant pair <cst0, cst1> used here satisfy the condition:\n> +   (cst0 & cst1 == cst0) || (cst0 & cst1 == cst1).\n> +   If the above condition is true, then MIN_EXPR is not needed. */\n> +int min_and(int a, int b) {\n> +  b = a & 3;\n> +  a = a & 1;\n> +  if (b < a)\n> +    return b;\n> +  else\n> +    return a;\n> +}\n> +\n> +int min_and1(int a, int b) {\n> +  b = a & 3;\n> +  a = a & 15;\n> +  if (b < a)\n> +    return b;\n> +  else\n> +    return a;\n> +}\n> +\n> +int min_and2(int a, int b) {\n> +  b = a & -7;\n> +  a = a & -3;\n> +  if (b < a)\n> +    return b;\n> +  else\n> +    return a;\n> +}\n> +\n> +int min_and3(int a, int b) {\n> +  b = a & -5;\n> +  a = a & -13;\n> +  if (b < a)\n> +    return b;\n> +  else\n> +    return a;\n> +}\n> +\n> +/* When constants are of opposite signs, the simplification will only\n> +   work for unsigned types. */\n> +unsigned int min_and4(unsigned int a, unsigned int b) {\n> +  b = a & 3;\n> +  a = a & -5;\n> +  if (b < a)\n> +    return b;\n> +  else\n> +    return a;\n> +}\n> +\n> +unsigned int min_and5(unsigned int a, unsigned int b) {\n> +  b = a & -3;\n> +  a = a & 5;\n> +  if (b < a)\n> +    return b;\n> +  else\n> +    return a;\n> +}\n> +\n> +/* { dg-final { scan-tree-dump-not \" MIN_EXPR \" \"optimized\" } } */\n> diff --git a/gcc/testsuite/gcc.dg/tree-ssa/pr109878-2.c b/gcc/testsuite/gcc.dg/tree-ssa/pr109878-2.c\n> new file mode 100644\n> index 00000000000..1503dcde1cb\n> --- /dev/null\n> +++ b/gcc/testsuite/gcc.dg/tree-ssa/pr109878-2.c\n> @@ -0,0 +1,31 @@\n> +/* PR tree-optimization/109878 */\n> +/* { dg-do compile } */\n> +/* { dg-options \"-O1 -fdump-tree-optimized\" } */\n> +\n> +/* The testcases here should not get optimized with the patch.\n> +   For constant pair <cst0, cst1>, the condition:\n> +   (cst0 & cst1 == cst0) || (cst0 & cst1 == cst1)\n> +   is false for the constants used here. */\n> +int max_and(int a, int b) {\n> +\n> +  b = a & 3;\n> +  a = a & 5;\n> +  if (b > a)\n> +    return b;\n> +  else\n> +    return a;\n> +}\n> +\n> +/* The constants in this function satisfy the condition but a is signed.\n> +   For signed types both the constants should have same sign. */\n> +int min_and(int a, int b) {\n> +  b = a & 1;\n> +  a = a & -3;\n> +  if (b < a)\n> +    return b;\n> +  else\n> +    return a;\n> +}\n> +\n> +/* { dg-final { scan-tree-dump \" MIN_EXPR \" \"optimized\" } } */\n> +/* { dg-final { scan-tree-dump \" MAX_EXPR \" \"optimized\" } } */\n> diff --git a/gcc/testsuite/gcc.dg/tree-ssa/pr109878-3.c b/gcc/testsuite/gcc.dg/tree-ssa/pr109878-3.c\n> new file mode 100644\n> index 00000000000..65966e1ebf3\n> --- /dev/null\n> +++ b/gcc/testsuite/gcc.dg/tree-ssa/pr109878-3.c\n> @@ -0,0 +1,42 @@\n> +/* PR tree-optimization/109878 */\n> +/* { dg-do compile } */\n> +/* { dg-options \"-O1 -fdump-tree-optimized\" } */\n> +\n> +/* For unsigned types, min(a, a&CST) should be simplified to a&CST and\n> +   should not generate MIN_EXPR. */\n> +unsigned int min_1(unsigned int a, unsigned int b) {\n> +  b = a & 1;\n> +  if (b < a)\n> +    return b;\n> +  else\n> +    return a;\n> +}\n> +\n> +unsigned int min_2(unsigned int a, unsigned int b) {\n> +  b = a & 3;\n> +  if (b < a)\n> +    return b;\n> +  else\n> +    return a;\n> +}\n> +\n> +/* For unsigned types, max(a, a&CST) should be simplified to a and\n> +   should not generate MAX_EXPR. */\n> +unsigned int max_1(unsigned int a, unsigned int b) {\n> +  b = a & 1;\n> +  if (b > a)\n> +    return b;\n> +  else\n> +    return a;\n> +}\n> +\n> +unsigned int max_2(unsigned int a, unsigned int b) {\n> +  b = a & 3;\n> +  if (b > a)\n> +    return b;\n> +  else\n> +    return a;\n> +}\n> +\n> +/* { dg-final { scan-tree-dump-not \" MIN_EXPR \" \"optimized\" } } */\n> +/* { dg-final { scan-tree-dump-not \" MAX_EXPR \" \"optimized\" } } */\n> diff --git a/gcc/testsuite/gcc.dg/tree-ssa/pr109878.c b/gcc/testsuite/gcc.dg/tree-ssa/pr109878.c\n> new file mode 100644\n> index 00000000000..6f13bafcf14\n> --- /dev/null\n> +++ b/gcc/testsuite/gcc.dg/tree-ssa/pr109878.c\n> @@ -0,0 +1,64 @@\n> +/* PR tree-optimization/109878 */\n> +/* { dg-do compile } */\n> +/* { dg-options \"-O1 -fdump-tree-optimized\" } */\n> +\n> +/* All the constant pair <cst0, cst1> used here satisfy the condition:\n> +   (cst0 & cst1 == cst0) || (cst0 & cst1 == cst1).\n> +   If the above condition is true, then MAX_EXPR is not needed. */\n> +int max_and(int a, int b) {\n> +  b = a & 3;\n> +  a = a & 1;\n> +  if (b > a)\n> +    return b;\n> +  else\n> +    return a;\n> +}\n> +\n> +int max_and1(int a, int b) {\n> +  b = a & 3;\n> +  a = a & 15;\n> +  if (b > a)\n> +    return b;\n> +  else\n> +    return a;\n> +}\n> +\n> +int max_and2(int a, int b) {\n> +  b = a & -7;\n> +  a = a & -3;\n> +  if (b > a)\n> +    return b;\n> +  else\n> +    return a;\n> +}\n> +\n> +int max_and3(int a, int b) {\n> +  b = a & -5;\n> +  a = a & -13;\n> +  if (b > a)\n> +    return b;\n> +  else\n> +    return a;\n> +}\n> +\n> +/* When constants are of opposite signs, the simplification will only\n> +   work for unsigned types. */\n> +unsigned int max_and4(unsigned int a, unsigned int b) {\n> +  b = a & 3;\n> +  a = a & -5;\n> +  if (b > a)\n> +    return b;\n> +  else\n> +    return a;\n> +}\n> +\n> +unsigned int max_and5(unsigned int a, unsigned int b) {\n> +  b = a & -3;\n> +  a = a & 5;\n> +  if (b > a)\n> +    return b;\n> +  else\n> +    return a;\n> +}\n> +\n> +/* { dg-final { scan-tree-dump-not \" MAX_EXPR \" \"optimized\" } } */\n> --\n> 2.34.1\n>","headers":{"Return-Path":"<gcc-patches-bounces~incoming=patchwork.ozlabs.org@gcc.gnu.org>","X-Original-To":["incoming@patchwork.ozlabs.org","gcc-patches@gcc.gnu.org"],"Delivered-To":["patchwork-incoming@legolas.ozlabs.org","gcc-patches@gcc.gnu.org"],"Authentication-Results":["legolas.ozlabs.org;\n\tdkim=pass (2048-bit key;\n unprotected) header.d=qualcomm.com header.i=@qualcomm.com header.a=rsa-sha256\n header.s=qcppdkim1 header.b=LAjri3cF;\n\tdkim=pass (2048-bit key;\n unprotected) header.d=oss.qualcomm.com header.i=@oss.qualcomm.com\n header.a=rsa-sha256 header.s=google header.b=fqj89Rck;\n\tdkim-atps=neutral","legolas.ozlabs.org;\n spf=pass (sender SPF authorized) smtp.mailfrom=gcc.gnu.org\n (client-ip=2620:52:6:3111::32; helo=vm01.sourceware.org;\n envelope-from=gcc-patches-bounces~incoming=patchwork.ozlabs.org@gcc.gnu.org;\n receiver=patchwork.ozlabs.org)","sourceware.org;\n\tdkim=pass (2048-bit key,\n unprotected) header.d=qualcomm.com header.i=@qualcomm.com header.a=rsa-sha256\n header.s=qcppdkim1 header.b=LAjri3cF;\n\tdkim=pass (2048-bit key,\n unprotected) header.d=oss.qualcomm.com header.i=@oss.qualcomm.com\n header.a=rsa-sha256 header.s=google header.b=fqj89Rck","sourceware.org; dmarc=none (p=none dis=none)\n header.from=oss.qualcomm.com","sourceware.org;\n spf=pass smtp.mailfrom=oss.qualcomm.com","sourceware.org;\n arc=pass smtp.remote-ip=205.220.180.131"],"Received":["from vm01.sourceware.org (vm01.sourceware.org\n [IPv6:2620:52:6:3111::32])\n\t(using TLSv1.3 with cipher TLS_AES_256_GCM_SHA384 (256/256 bits)\n\t key-exchange x25519 server-signature ECDSA (secp384r1) server-digest SHA384)\n\t(No client certificate requested)\n\tby legolas.ozlabs.org (Postfix) with ESMTPS id 4gBSqX1dbMz1yCg\n\tfor <incoming@patchwork.ozlabs.org>; Fri, 08 May 2026 09:18:46 +1000 (AEST)","from vm01.sourceware.org (localhost [IPv6:::1])\n\tby sourceware.org (Postfix) with ESMTP id 38AF24BA2E3B\n\tfor <incoming@patchwork.ozlabs.org>; Thu,  7 May 2026 23:18:44 +0000 (GMT)","from mx0b-0031df01.pphosted.com (mx0b-0031df01.pphosted.com\n [205.220.180.131])\n by sourceware.org (Postfix) with ESMTPS id 460C54BA23D7\n for <gcc-patches@gcc.gnu.org>; Thu,  7 May 2026 23:18:11 +0000 (GMT)","from pps.filterd (m0279872.ppops.net [127.0.0.1])\n by mx0a-0031df01.pphosted.com (8.18.1.11/8.18.1.11) with ESMTP id\n 647G35OQ2384382\n for <gcc-patches@gcc.gnu.org>; Thu, 7 May 2026 23:18:10 GMT","from mail-dl1-f70.google.com (mail-dl1-f70.google.com\n [74.125.82.70])\n by mx0a-0031df01.pphosted.com (PPS) with ESMTPS id 4e0wwuhd99-1\n (version=TLSv1.3 cipher=TLS_AES_128_GCM_SHA256 bits=128 verify=NOT)\n for <gcc-patches@gcc.gnu.org>; Thu, 07 May 2026 23:18:10 +0000 (GMT)","by mail-dl1-f70.google.com with SMTP id\n a92af1059eb24-12c35f2c09dso2472951c88.0\n for <gcc-patches@gcc.gnu.org>; Thu, 07 May 2026 16:18:10 -0700 (PDT)"],"DKIM-Filter":["OpenDKIM Filter v2.11.0 sourceware.org 38AF24BA2E3B","OpenDKIM Filter v2.11.0 sourceware.org 460C54BA23D7"],"DMARC-Filter":"OpenDMARC Filter v1.4.2 sourceware.org 460C54BA23D7","ARC-Filter":"OpenARC Filter v1.0.0 sourceware.org 460C54BA23D7","ARC-Seal":["i=2; a=rsa-sha256; d=sourceware.org; s=key; t=1778195891; cv=pass;\n b=wkONxLBjnSDbtNy80wwS7Fcu7H45dEuUy8XsyagWVzNWNJgWJIOTySNy9wJxMeYMw4wqQj4umWZVA3JnlPAS+o8+iUFjcUznwE1AWnZ71DCXXio4+J3SFiFQFOZeTYgcF1chAQAvXqcc/t50lYqodolyp6mUGZtCEz7nEGVOLIs=","i=1; a=rsa-sha256; t=1778195889; cv=none;\n d=google.com; s=arc-20240605;\n b=kuQayg56UzPwVfzYqUWgZT+Io+tTsEfzXnnnk9CmWmJNTE/bfjeBKPa5Zzw1iTUAZU\n UYqqHZok6GTYRZU0vs5hu+RYuI4puxzzpJJM2sPFSmYU/eYpKOxkmFuxb0oJm5j7xEOX\n /AkNuSsmqy76FT4dupt7wBmV0tPKmCpqpsGA6rpQLj52CDjfGpiZfVBPv6JN1CAHwxPo\n /y1DjTnIa6FFyOEVRg8fNyz1xUiVEC8a3aOhJAHdkGeeU1opkjl8d0+1UbTnimW231sy\n GV0b6nkw55tzLSBCiDfCY+inrf65PY8dYhTQ0C8DFsEt2Cluhvpd2kNCCO46YgLCYBo+\n XFyw=="],"ARC-Message-Signature":["i=2; a=rsa-sha256; d=sourceware.org; s=key;\n t=1778195891; c=relaxed/simple;\n bh=J/vYguFmuqpnsTHId+5xVo17BlYh2sdLczVgeH+aoIA=;\n h=DKIM-Signature:DKIM-Signature:MIME-Version:From:Date:Message-ID:\n Subject:To;\n b=YDqjSYiU/UJOD3Jg/xLwU9BOMrtDylAcSCbuT6yQ5OSYdFHkWsjsPmmpxxfUz//Ff270EDRs0m97AZhjV7FAdI3++3R7qAQ2noicY3nJHsch+1iWz4jcrAiniQ3oBYh9MHDA3YN3xp7GEOcJ44aP0H1fpo2UBSrsjj5dfowNUPY=","i=1; a=rsa-sha256; c=relaxed/relaxed; d=google.com;\n s=arc-20240605;\n h=content-transfer-encoding:cc:to:subject:message-id:date:from\n :in-reply-to:references:mime-version:dkim-signature;\n bh=3D/S8Z6NfsjTCxJ1AuO8autNxJA57krQcGjF9QRDVXo=;\n fh=8ZHhM+Vf0igST2/4uO+kHSh9ULNuoz2EzFn0p4RjPzk=;\n b=hamyDdGfXbGwHmD4uKNdWmg5oLB/dvwOK4ZHemSSREvgD8D6THvV5i7JVCZ3U9sSPo\n S0SW3dNPM2EeAdo3Xullj9s1ow53W1hI9DoQ/NrSK70li0xgG2w3TfXMKeMAJxsc2CUw\n MNY4w6O9sxZJFP7E1KR0Vuq/SuJYu+/GhLlj9ummLO7PB6EQU/pFt5g+XMnnWq8GMsh0\n FJ+iMKBiiYK5QYh1Z+FuZp1shNR4T/Jdpmhj2JWCyw2DSuSrogg/KURw5OyXgi5ahpGj\n 4AFC7WvDF+JCTo+LtLqpSuGnS4IRV47A9MOxHYdeaiiimnLoXx5nDOswO2D5ndn6Rf8R\n jLNQ==; darn=gcc.gnu.org"],"ARC-Authentication-Results":["i=2; sourceware.org;\n dkim=pass (2048-bit key, unprotected)\n header.d=qualcomm.com header.i=@qualcomm.com header.a=rsa-sha256\n header.s=qcppdkim1 header.b=LAjri3cF;\n dkim=pass (2048-bit key, unprotected) header.d=oss.qualcomm.com\n header.i=@oss.qualcomm.com header.a=rsa-sha256 header.s=google\n header.b=fqj89Rck","i=1; mx.google.com; arc=none"],"DKIM-Signature":["v=1; a=rsa-sha256; c=relaxed/relaxed; d=qualcomm.com; h=\n cc:content-transfer-encoding:content-type:date:from:in-reply-to\n :message-id:mime-version:references:subject:to; s=qcppdkim1; bh=\n 3D/S8Z6NfsjTCxJ1AuO8autNxJA57krQcGjF9QRDVXo=; b=LAjri3cFvEvXztP6\n CFdehqC3NO+E0V8N8urXOJKngF5am4EHOnawe1g9sIcBRRZ7kEiIkQnHN80luq8E\n f43MWOz5NaY6kzP4uO9ffdxlsPUMf9Cn8r0ied64sqPHR2d1YNkKuAldiAtFk35L\n sGtomERKaP5/RZC1pwUnJMX8NfaMc6EwJYEig0mzJYoY1F7QlmH2vAMDk+rbUZlS\n DvVKGBoUFfBbCaedV/zQIvswcI6Wkm8EZl/QPIw09oe7vuXDAboZeH102s3DVtZJ\n zfNpZdz2Z03mNFyWU5BZ0/HXWAkOTKtdyiwFKVsqym/ncGrYZb3CSEKxYz+NBHkM\n 9Jn3uw==","v=1; a=rsa-sha256; c=relaxed/relaxed;\n d=oss.qualcomm.com; s=google; t=1778195889; x=1778800689; darn=gcc.gnu.org;\n h=content-transfer-encoding:cc:to:subject:message-id:date:from\n :in-reply-to:references:mime-version:from:to:cc:subject:date\n :message-id:reply-to;\n bh=3D/S8Z6NfsjTCxJ1AuO8autNxJA57krQcGjF9QRDVXo=;\n b=fqj89RckISlVm9qDhhOjLnXrU3EVySt91uNMh7bTQo8WTRGk/0O6hn45BtOWhFE7Tt\n yfOKFeL1SB1mgTkkP6StXAGRRFWwilYOl116jIqbgCrt0YerTRJpVg6K4kbjcvzLK3v4\n 2iHgv1xLj9MyiYl9hz0gwRXh1hYTB0HWH+nYUZjEfjySmvjRcW2g1ufR+H6qu1czpKIk\n qeGVSlwjzKHvKd/kReUruP1K/SW4QmTqAoUuCRhyjIxVkb8n/+A2XMv4pJtj0aAY8ZMA\n wIAF1yIbmvIeyaJvMbzk1DA0H3hjEJTRGrysFjetNCD+kbHK7A5p79/mpnkT9221nKue\n kiww=="],"X-Google-DKIM-Signature":"v=1; a=rsa-sha256; c=relaxed/relaxed;\n d=1e100.net; s=20251104; t=1778195889; x=1778800689;\n h=content-transfer-encoding:cc:to:subject:message-id:date:from\n :in-reply-to:references:mime-version:x-gm-gg:x-gm-message-state:from\n :to:cc:subject:date:message-id:reply-to;\n bh=3D/S8Z6NfsjTCxJ1AuO8autNxJA57krQcGjF9QRDVXo=;\n b=eRfXIhwjEKPggWQQ6pOM8gxJSklbJf/MhQpv/cTM/Ph5N0drsMTs4xSHBmUiRdrDIO\n q5PgwI+FthgL7m4YygDjaFkz5DyhNHXqsMIsanfTDtGzbHG0ZTZaX+A9CcdskSgWzG+s\n BKPsRYDM+GgQ74XsOEbV4YWwbPL26VypssDaNEFLn0A8hElgdggs32NO10DR2fcPL6EJ\n Up5jafBYYQubKfnIHGs7dsPRGBuskTOOWKWaz2/uO2k0rlyGXOZs18QWBPrHZCeE9Str\n M/R3zNwEG46Aity5+rpJNjO4FTudQGWLKeUmMEnA2DTRtHr/fwCwuGqXUubjAp+mZaW1\n fEaA==","X-Gm-Message-State":"AOJu0Yz1VJAvJDjcloG91BCGxIeWjj7RSO7j1o4A3WWpBSgVPAizaP2r\n 9KQdnzNGpu+eebRcfmRnfkOj8fovfxk2SKZmwATbJtavADJDylcauzNCW3i6jf9b0zMSzL+Tgrh\n AGDAhaeUHCUIrWvXnI2xEBHejyoD1Oa+S92n2nZLB2IlLOFc9HDhIpJ/AvJX1uRqGSVtrUm32el\n ZC5Os/ZcuL5/7sdhduPjNu5n1KS7e71z1Lp8g=","X-Gm-Gg":"Acq92OFOVZZillVQCMkObeceINmGJ4MYCDO2/ELcUJr885eyiV0u3c+mgwzEL8x7Ojl\n RJBWJAU+YX9m2+OCFR90dipjrBSH57U85IiliwgaxBfDLan5Y1r/41h4PDyB0tBdSDDJkHAOrl1\n KWnA+GpmqY1ST9CqHoD9GKbqgr9eDncScTM6lxupXEi9dF7juOHnWanjlxb5g9jEmkc2gmXDxZI\n VU=","X-Received":["by 2002:a05:693c:3015:b0:2e2:4979:ec7 with SMTP id\n 5a478bee46e88-2f548d9e68amr5193934eec.10.1778195889211;\n Thu, 07 May 2026 16:18:09 -0700 (PDT)","by 2002:a05:693c:3015:b0:2e2:4979:ec7 with SMTP id\n 5a478bee46e88-2f548d9e68amr5193917eec.10.1778195888545; Thu, 07 May 2026\n 16:18:08 -0700 (PDT)"],"MIME-Version":"1.0","References":"<20260506123845.339938-1-eikansh.gupta@oss.qualcomm.com>","In-Reply-To":"<20260506123845.339938-1-eikansh.gupta@oss.qualcomm.com>","From":"Andrew Pinski <andrew.pinski@oss.qualcomm.com>","Date":"Thu, 7 May 2026 16:17:57 -0700","X-Gm-Features":"AVHnY4Kr6yJC62HMEFqNFQfeBCzL6_4WCMvlm4BziBIEC36BZTR2GT8x7yfKbFk","Message-ID":"\n <CALvbMcB9Rxo4EeMp8NSamQE+HSWQuyi1x5wcG2cfZueDrZGknw@mail.gmail.com>","Subject":"Re: [PATCH v3] MATCH: Add simplification for MAX<a&CST0, a&CST1> and\n MIN<a&CST0, a&CST1> to match.pd [PR109878]","To":"Eikansh Gupta <eikansh.gupta@oss.qualcomm.com>","Cc":"gcc-patches@gcc.gnu.org","Content-Type":"text/plain; charset=\"UTF-8\"","Content-Transfer-Encoding":"quoted-printable","X-Proofpoint-ORIG-GUID":"zFQgIQJbyfURPZo8g_BsaMxSAU-5Ka-2","X-Authority-Analysis":"v=2.4 cv=Nd/WEWD4 c=1 sm=1 tr=0 ts=69fd1db2 cx=c_pps\n a=SvEPeNj+VMjHSW//kvnxuw==:117 a=IkcTkHD0fZMA:10 a=NGcC8JguVDcA:10\n a=s4-Qcg_JpJYA:10 a=VkNPw1HP01LnGYTKEx00:22 a=u7WPNUs3qKkmUXheDGA7:22\n a=yx91gb_oNiZeI1HMLzn7:22 a=mDV3o1hIAAAA:8 a=EUspDBNiAAAA:8\n a=S8-92vBn1fwMb1lC1j8A:9 a=QEXdDO2ut3YA:10 a=Kq8ClHjjuc5pcCNDwlU0:22","X-Proofpoint-Spam-Details-Enc":"AW1haW4tMjYwNTA3MDIzNyBTYWx0ZWRfXyxCDrdzk/Y9D\n aj+UzLf37hZbPCe1UHWf4DOfDZTAgWfLfS0qO8OSQ3uCIQTIcdwvZz45gkoy4hc4tHhAuw+Q/HC\n tF8ekazLtyOJn09M0juyHVzM0pIdFkSZOAXY3VdjPgcyI4WWP0MoezbcPnPTmwqa+E3n8enFjpM\n Uwtg4UC5hyPzQAiDSFNhTzkUR6Qpf5hlUHjlz/mhqAhMPIgyRqh/KKi9xtqpnd/fhr+C0WtImg8\n 2ojnYAAhT8d6uxxM102Q0qyziLf0CcHKn9Vb6EBh8Y0sTETDzzXjZd3K26dF90fGLd7D6SzuVpj\n UaKoVXM2AxisgQwRXi9ESuYGxnI55oMN9DWrG04lYKFlsjiRzZX4DuGrdrDju+yz5cH1uDt4zgE\n IAP7QCVTlgMdzJDGT1fxFnnIpzqPym3dlbVOEWgtGPE1+8xX9dkaynr5y0yt+wG+M0eKzKkMxu1\n /Jdprxtk9xxcxwQsJKA==","X-Proofpoint-GUID":"zFQgIQJbyfURPZo8g_BsaMxSAU-5Ka-2","X-Proofpoint-Virus-Version":"vendor=baseguard\n engine=ICAP:2.0.293,Aquarius:18.0.1143,Hydra:6.1.51,FMLib:17.12.100.49\n definitions=2026-05-07_02,2026-05-06_01,2025-10-01_01","X-Proofpoint-Spam-Details":"rule=outbound_notspam policy=outbound score=0\n impostorscore=0 malwarescore=0 phishscore=0 clxscore=1015 spamscore=0\n priorityscore=1501 adultscore=0 suspectscore=0 lowpriorityscore=0 bulkscore=0\n classifier=typeunknown authscore=0 authtc= authcc= route=outbound adjust=0\n reason=mlx scancount=1 engine=8.22.0-2604200000 definitions=main-2605070237","X-BeenThere":"gcc-patches@gcc.gnu.org","X-Mailman-Version":"2.1.30","Precedence":"list","List-Id":"Gcc-patches mailing list <gcc-patches.gcc.gnu.org>","List-Unsubscribe":"<https://gcc.gnu.org/mailman/options/gcc-patches>,\n <mailto:gcc-patches-request@gcc.gnu.org?subject=unsubscribe>","List-Archive":"<https://gcc.gnu.org/pipermail/gcc-patches/>","List-Post":"<mailto:gcc-patches@gcc.gnu.org>","List-Help":"<mailto:gcc-patches-request@gcc.gnu.org?subject=help>","List-Subscribe":"<https://gcc.gnu.org/mailman/listinfo/gcc-patches>,\n <mailto:gcc-patches-request@gcc.gnu.org?subject=subscribe>","Errors-To":"gcc-patches-bounces~incoming=patchwork.ozlabs.org@gcc.gnu.org"}}]