if (m_bitfld_load)
{
tree t4;
- if (!save_first)
+ if (!save_first && !save_cast_conditional)
t4 = m_data[m_bitfld_load + 1];
else
t4 = make_ssa_name (m_limb_type);
if (edge_true_true)
add_phi_arg (phi, m_data[m_bitfld_load], edge_true_true,
UNKNOWN_LOCATION);
+ if (save_cast_conditional)
+ for (basic_block bb = gsi_bb (m_gsi);;)
+ {
+ edge e1 = single_succ_edge (bb);
+ edge e2 = find_edge (e1->dest, m_bb), e3;
+ tree t5 = ((e2 && !save_first) ? m_data[m_bitfld_load + 1]
+ : make_ssa_name (m_limb_type));
+ phi = create_phi_node (t5, e1->dest);
+ edge_iterator ei;
+ FOR_EACH_EDGE (e3, ei, e1->dest->preds)
+ add_phi_arg (phi, (e3 == e1 ? t4
+ : build_zero_cst (m_limb_type)),
+ e3, UNKNOWN_LOCATION);
+ t4 = t5;
+ if (e2)
+ break;
+ bb = e1->dest;
+ }
m_data[m_bitfld_load] = t4;
m_data[m_bitfld_load + 2] = t4;
m_bitfld_load = 0;
--- /dev/null
+/* PR tree-optimization/114555 */
+/* { dg-do compile { target bitint } } */
+/* { dg-options "-std=c23 -O2" } */
+
+#if __BITINT_MAXWIDTH__ >= 1225
+struct S { _BitInt(512) : 98; _BitInt(1225) b : 509; } s;
+_BitInt(1225) a;
+#endif
+
+void
+foo (void)
+{
+#if __BITINT_MAXWIDTH__ >= 1225
+ a ^= (unsigned _BitInt(1025)) s.b;
+#endif
+}
--- /dev/null
+/* PR tree-optimization/114555 */
+/* { dg-do compile { target bitint } } */
+/* { dg-options "-std=c23 -O -fno-tree-forwprop" } */
+
+#if __BITINT_MAXWIDTH__ >= 4139
+struct S { _BitInt(31) : 6; _BitInt(513) b : 241; } s;
+_BitInt(4139) a;
+#endif
+
+void
+foo (void)
+{
+#if __BITINT_MAXWIDTH__ >= 4139
+ int i = 0;
+ a -= s.b << i;
+#endif
+}