]> git.ipfire.org Git - thirdparty/gcc.git/commitdiff
strlen: do not use cond_expr for boundaries
authorMartin Liska <mliska@suse.cz>
Fri, 23 Dec 2022 14:27:32 +0000 (15:27 +0100)
committerMartin Liska <mliska@suse.cz>
Wed, 11 Jan 2023 11:27:25 +0000 (12:27 +0100)
PR tree-optimization/108137

gcc/ChangeLog:

* tree-ssa-strlen.cc (get_range_strlen_phi): Reject anything
different from INTEGER_CST.

gcc/testsuite/ChangeLog:

* gcc.dg/tree-ssa/pr108137.c: New test.

(cherry picked from commit ee6f262b87fef590729e96e999f1c3b207c251c0)

gcc/testsuite/gcc.dg/tree-ssa/pr108137.c [new file with mode: 0644]
gcc/tree-ssa-strlen.cc

diff --git a/gcc/testsuite/gcc.dg/tree-ssa/pr108137.c b/gcc/testsuite/gcc.dg/tree-ssa/pr108137.c
new file mode 100644 (file)
index 0000000..f0cb71b
--- /dev/null
@@ -0,0 +1,8 @@
+// PR tree-optimization/108137
+// { dg-do compile }
+// { dg-options "-Wformat-overflow" }
+
+void f(unsigned short x_port, unsigned int x_host)
+{
+    __builtin_printf("missing %s", x_port ? "host" : &"host:port"[x_host ? 5 : 0]);
+}
index 9ae25d1dde25be08462e829e84b94383cb2648cd..2d7db6da5bc046e2e0b52336a9ec9c412493d13c 100644 (file)
@@ -1136,14 +1136,15 @@ get_range_strlen_phi (tree src, gphi *phi,
 
       /* Adjust the minimum and maximum length determined so far and
         the upper bound on the array size.  */
-      if (!pdata->minlen
-         || tree_int_cst_lt (argdata.minlen, pdata->minlen))
+      if (TREE_CODE (argdata.minlen) == INTEGER_CST
+         && (!pdata->minlen
+             || tree_int_cst_lt (argdata.minlen, pdata->minlen)))
        pdata->minlen = argdata.minlen;
 
-      if (!pdata->maxlen
-         || (argdata.maxlen
-             && TREE_CODE (argdata.maxlen) == INTEGER_CST
-             && tree_int_cst_lt (pdata->maxlen, argdata.maxlen)))
+      if (TREE_CODE (argdata.maxlen) == INTEGER_CST
+         && (!pdata->maxlen
+             || (argdata.maxlen
+                 && tree_int_cst_lt (pdata->maxlen, argdata.maxlen))))
        pdata->maxlen = argdata.maxlen;
 
       if (!pdata->maxbound