public inbox for gcc-bugs@sourceware.org
help / color / mirror / Atom feed
* [Bug tree-optimization/115228] New: Suspicious code in tree-vect-data-refs.cc
@ 2024-05-25 15:34 fxue at os dot amperecomputing.com
  2024-05-27  7:06 ` [Bug tree-optimization/115228] " rguenth at gcc dot gnu.org
  0 siblings, 1 reply; 2+ messages in thread
From: fxue at os dot amperecomputing.com @ 2024-05-25 15:34 UTC (permalink / raw)
  To: gcc-bugs

https://gcc.gnu.org/bugzilla/show_bug.cgi?id=115228

            Bug ID: 115228
           Summary: Suspicious code in tree-vect-data-refs.cc
           Product: gcc
           Version: unknown
            Status: UNCONFIRMED
          Severity: normal
          Priority: P3
         Component: tree-optimization
          Assignee: unassigned at gcc dot gnu.org
          Reporter: fxue at os dot amperecomputing.com
  Target Milestone: ---

Does the below condition code miss the case of "SAD_EXPR", in function
vect_get_smallest_scalar_type():

  if (assign)
    {
      scalar_type = TREE_TYPE (gimple_assign_lhs (assign));
      if (gimple_assign_cast_p (assign)
          || gimple_assign_rhs_code (assign) == DOT_PROD_EXPR
          || gimple_assign_rhs_code (assign) == WIDEN_SUM_EXPR
          || gimple_assign_rhs_code (assign) == WIDEN_MULT_EXPR
          || gimple_assign_rhs_code (assign) == WIDEN_LSHIFT_EXPR
          || gimple_assign_rhs_code (assign) == FLOAT_EXPR)

^ permalink raw reply	[flat|nested] 2+ messages in thread

end of thread, other threads:[~2024-05-27  7:06 UTC | newest]

Thread overview: 2+ messages (download: mbox.gz / follow: Atom feed)
-- links below jump to the message on this page --
2024-05-25 15:34 [Bug tree-optimization/115228] New: Suspicious code in tree-vect-data-refs.cc fxue at os dot amperecomputing.com
2024-05-27  7:06 ` [Bug tree-optimization/115228] " rguenth at gcc dot gnu.org

This is a public inbox, see mirroring instructions
for how to clone and mirror all data and code used for this inbox;
as well as URLs for read-only IMAP folder(s) and NNTP newsgroup(s).