Re: [PATCH v1] tree-optimization: Merge equality comparisons into memcmp

XH ZHOU <[email protected]> Tue, 4 Aug 2026 21:17:16 +0800
Newsgroups gmane.comp.gcc.patches
Message-ID <CAOuhjrwpKz=+SXX6iE+4Vn=3swQbA+QUpSCZjgmQZvZb5p8JNg@mail.gmail.com>
--0000000000000dbcf00658387a0b
Content-Type: text/plain; charset="UTF-8"

I see. In that case I think maybe maybe we can focus on the chain equality
merge first and investigate about the loop case later. Can you help to
review the phase 1 and I would send a new patch for that.

Regards,
Zhou Xuhang

--0000000000000dbcf00658387a0b
Content-Type: text/html; charset="UTF-8"
Content-Transfer-Encoding: quoted-printable

<div dir=3D"ltr">I see. In that case I think maybe maybe we can focus on th=
e chain equality merge first and=C2=A0investigate=C2=A0about the loop case =
later. Can you help to review the phase 1 and I would send a new patch for =
that.<div><br></div><div>Regards,</div><div>Zhou Xuhang</div></div>

--0000000000000dbcf00658387a0b--