diff --git a/compiler/rustc_mir_transform/src/inline/cycle.rs b/compiler/rustc_mir_transform/src/inline/cycle.rs
index 9828e90de883e..41b9fb2edd1ce 100644
--- a/compiler/rustc_mir_transform/src/inline/cycle.rs
+++ b/compiler/rustc_mir_transform/src/inline/cycle.rs
@@ -136,14 +136,6 @@ pub(crate) fn mir_callgraph_reachable<'tcx>(
         }
         false
     }
-    // FIXME(-Znext-solver): Remove this hack when trait solver overflow can return an error.
-    // In code like that pointed out in #128887, the type complexity we ask the solver to deal with
-    // grows as we recurse into the call graph. If we use the same recursion limit here and in the
-    // solver, the solver hits the limit first and emits a fatal error. But if we use a reduced
-    // limit, we will hit the limit first and give up on looking for inlining. And in any case,
-    // the default recursion limits are quite generous for us. If we need to recurse 64 times
-    // into the call graph, we're probably not going to find any useful MIR inlining.
-    let recursion_limit = tcx.recursion_limit() / 2;
     process(
         tcx,
         param_env,
@@ -152,7 +144,7 @@ pub(crate) fn mir_callgraph_reachable<'tcx>(
         &mut Vec::new(),
         &mut FxHashSet::default(),
         &mut FxHashMap::default(),
-        recursion_limit,
+        tcx.recursion_limit(),
     )
 }