pytorch
diff --git a/‎torch/_inductor/compile_fx.py
Lines changed: 15 additions & 10 deletions b/‎torch/_inductor/compile_fx.py
Lines changed: 15 additions & 10 deletions
diff --git a/‎torch/_inductor/fx_passes/post_grad.py
Lines changed: 5 additions & 2 deletions b/‎torch/_inductor/fx_passes/post_grad.py
Lines changed: 5 additions & 2 deletions
diff --git a/‎torch/fx/graph.py
Lines changed: 11 additions & 2 deletions b/‎torch/fx/graph.py
Lines changed: 11 additions & 2 deletions
@@ -396,20 +396,25 @@ def _unlift_graph(
 def _get_subgraph_names(
     gm: GraphModule, skip_invoke_subgraph: bool = False
 ) -> Generator[str, None, None]:
-    subgraph_names: OrderedSet[str] = OrderedSet()
-    for child_name, child_mod in gm.named_children():
-        if isinstance(child_mod, torch.fx.GraphModule):
-            subgraph_names.add(child_name)
+    all_subgraph_names: OrderedSet[str] = OrderedSet(
+        x.target for x in gm.graph.find_nodes(op="get_attr")
+    )
+    fx_subgraph_names: OrderedSet[str] = OrderedSet()
+    for child_name, child_module in gm.named_children():
+        # Sometimes an owning_module can have unused children. Skip them
+        # by checking them from get_attr node targets.
+        if child_name in all_subgraph_names and isinstance(
+            child_module, torch.fx.GraphModule
+        ):
+            fx_subgraph_names.add(child_name)
 
     if skip_invoke_subgraph:
-        for node in sorted(
-            gm.graph.find_nodes(
-                op="call_function", target=torch.ops.higher_order.invoke_subgraph
-            )
+        for node in gm.graph.find_nodes(
+            op="call_function", target=torch.ops.higher_order.invoke_subgraph
         ):
-            subgraph_names.discard(node.args[0].target)
+            fx_subgraph_names.discard(node.args[0].target)
 
-    yield from subgraph_names
+    yield from fx_subgraph_names
 
 
 def _recursive_pre_grad_passes(
 
@@ -1202,9 +1202,12 @@ def view_to_reshape(gm):
     """
     Replace view ops in the GraphModule to reshape ops.
     """
+    subgraph_names: OrderedSet[str] = OrderedSet(
+        x.target for x in gm.graph.find_nodes(op="get_attr")
+    )
 
-    for child_mod in gm.children():
-        if isinstance(child_mod, torch.fx.GraphModule):
+    for child_name, child_mod in gm.named_children():
+        if child_name in subgraph_names and isinstance(child_mod, torch.fx.GraphModule):
             view_to_reshape(child_mod)
 
     for nd in gm.graph.find_nodes(
 
@@ -1779,6 +1779,8 @@ def forward(self, x):
             of functional operations or you supply your own custom
             function for detecting side-effectful nodes.
         """
+        from torch.utils._ordered_set import OrderedSet
+
         # Lint the graph first to make sure its topologically sorted, otherwise
         # DCE below will not behave as expected.
         self.lint()
@@ -1803,8 +1805,15 @@ def has_side_effect(node):
 
         # Call DCE on the subgraphs
         if self.owning_module is not None:
-            for child_module in self.owning_module.children():
-                if isinstance(child_module, torch.fx.GraphModule):
+            subgraph_names = OrderedSet(
+                x.target for x in self.find_nodes(op="get_attr")
+            )
+            for child_name, child_module in self.owning_module.named_children():
+                # Sometimes an owning_module can have unused children. Skip them
+                # by checking them from get_attr node targets.
+                if child_name in subgraph_names and isinstance(
+                    child_module, torch.fx.GraphModule
+                ):
                     changed |= child_module.graph.eliminate_dead_code()
                     child_module.recompile()