Address performance regressions caused by rebasing on GCC 15.2

gcc/c/c-decl.cc

@@ -9690,10 +9690,6 @@ finish_struct (location_t loc, tree t, tree fieldlist, tree attributes,
       if (DECL_NAME (x)
 	  || RECORD_OR_UNION_TYPE_P (TREE_TYPE (x)))
 	saw_named_field = true;
-
-      if (AGGREGATE_TYPE_P (TREE_TYPE (x))
-	  && TYPE_TYPELESS_STORAGE (TREE_TYPE (x)))
-	TYPE_TYPELESS_STORAGE (t) = true;
     }
 
   detect_field_duplicates (fieldlist);
@@ -9905,7 +9901,6 @@ finish_struct (location_t loc, tree t, tree fieldlist, tree attributes,
       TYPE_FIELDS (x) = TYPE_FIELDS (t);
       TYPE_LANG_SPECIFIC (x) = TYPE_LANG_SPECIFIC (t);
       TYPE_TRANSPARENT_AGGR (x) = TYPE_TRANSPARENT_AGGR (t);
-      TYPE_TYPELESS_STORAGE (x) = TYPE_TYPELESS_STORAGE (t);
       C_TYPE_FIELDS_READONLY (x) = C_TYPE_FIELDS_READONLY (t);
       C_TYPE_FIELDS_VOLATILE (x) = C_TYPE_FIELDS_VOLATILE (t);
       C_TYPE_FIELDS_NON_CONSTEXPR (x) = C_TYPE_FIELDS_NON_CONSTEXPR (t);

gcc/c/c-typeck.cc

@@ -464,21 +464,13 @@ c_build_function_type (tree type, tree args, bool no)
   return c_set_type_bits (ret, type);
 }
 
-/* Build an array type.  This sets typeless storage as required
-   by C2Y and C_TYPE_VARIABLY_MODIFIED and C_TYPE_VARIABLE_SIZE
-   based on the element type and domain.  */
+/* Build an array type.  This sets C_TYPE_VARIABLY_MODIFIED and
+   C_TYPE_VARIABLE_SIZE based on the element type and domain.  */
 
 tree
 c_build_array_type (tree type, tree domain)
 {
-  int type_quals = TYPE_QUALS (type);
-
-  /* Identify typeless storage as introduced in C2Y
-     and supported also in earlier language modes.  */
-  bool typeless = (char_type_p (type) && !(type_quals & TYPE_QUAL_ATOMIC))
-		  || (AGGREGATE_TYPE_P (type) && TYPE_TYPELESS_STORAGE (type));
-
-  tree ret = build_array_type (type, domain, typeless);
+  tree ret = build_array_type (type, domain);
 
   if (domain && TYPE_MAX_VALUE (domain)
       && TREE_CODE (TYPE_MAX_VALUE (domain)) != INTEGER_CST)

gcc/config/riscv/riscv.h

@@ -996,6 +996,8 @@ extern enum riscv_cc get_riscv_cc (const rtx use);
 #define TARGET_VECTOR_MISALIGN_SUPPORTED \
    riscv_vector_unaligned_access_p
 
+#define LOGICAL_OP_NON_SHORT_CIRCUIT 0
+
 /* Control the assembler format that we output.  */
 
 /* Output to assembler file text saying following lines

gcc/doc/invoke.texi

@@ -15901,10 +15901,6 @@ In each case, the @var{value} is an integer.  The following choices
 of @var{name} are recognized for all targets:
 
 @table @gcctabopt
-@item phiopt-factor-max-stmts-live
-When factoring statements out of if/then/else, this is the max # of statements
-after the defining statement to be allow to extend the lifetime of a name
-
 @item predictable-branch-outcome
 When branch is predicted to be taken with probability lower than this threshold
 (in percent), then it is considered well predictable.

gcc/params.opt

@@ -904,10 +904,6 @@ Enum(parloops_schedule_type) String(runtime) Value(PARLOOPS_SCHEDULE_RUNTIME)
 Common Joined UInteger Var(param_partial_inlining_entry_probability) Init(70) Optimization IntegerRange(0, 100) Param
 Maximum probability of the entry BB of split region (in percent relative to entry BB of the function) to make partial inlining happen.
 
--param=phiopt-factor-max-stmts-live=
-Common Joined UInteger Var(param_phiopt_factor_max_stmts_live) Init(5) Optimization IntegerRange(0, 100) Param
-Maximum number of statements allowed inbetween the statement and the end to considered not extending the liferange.
-
 -param=predictable-branch-outcome=
 Common Joined UInteger Var(param_predictable_branch_outcome) Init(2) IntegerRange(0, 50) Param Optimization
 Maximal estimated outcome of branch considered predictable.