|
| 1 | +# Copyright 2026 Arm Limited and/or its affiliates. |
| 2 | +# |
| 3 | +# This source code is licensed under the BSD-style license found in the |
| 4 | +# LICENSE file in the root directory of this source tree. |
| 5 | + |
| 6 | +from typing import Set, Type |
| 7 | + |
| 8 | +import torch |
| 9 | +from executorch.backends.arm._passes import ArmOpTargetedPass |
| 10 | +from executorch.backends.arm._passes.arm_pass_utils import ( |
| 11 | + create_node, |
| 12 | + get_first_fake_tensor, |
| 13 | +) |
| 14 | +from executorch.backends.arm._passes.convert_squeezes_to_view import ( |
| 15 | + ConvertSqueezesToViewPass, |
| 16 | +) |
| 17 | +from executorch.backends.arm._passes.decompose_maxpool2d_with_dilation_pass import ( |
| 18 | + DecomposeMaxPool2dPass, |
| 19 | +) |
| 20 | +from executorch.backends.arm._passes.rewrite_max_pool2d_pass import RewriteMaxPool2dPass |
| 21 | +from executorch.backends.arm._passes.size_adjust_input_pass import SizeAdjustInputPass |
| 22 | +from executorch.exir.dialects._ops import ops as exir_ops |
| 23 | +from executorch.exir.pass_base import ExportPass, PassResult |
| 24 | +from torch.fx import Node |
| 25 | + |
| 26 | + |
| 27 | +class NormalizeMaxPool2dInputRankPass(ArmOpTargetedPass): |
| 28 | + """Normalize unbatched rank-3 max_pool2d inputs to rank 4. |
| 29 | +
|
| 30 | + Unsqueeze inputs from ``[C, H, W]`` to ``[1, C, H, W]``. |
| 31 | +
|
| 32 | + Squeeze the leading dimension after pooling to restore the rank-3 output. |
| 33 | +
|
| 34 | + The complete shape transformation is:: |
| 35 | +
|
| 36 | + [C, H, W] |
| 37 | + -> unsqueeze(0) -> [1, C, H, W] |
| 38 | + -> max_pool2d -> [1, C, H_out, W_out] |
| 39 | + -> squeeze(0) -> [C, H_out, W_out] |
| 40 | +
|
| 41 | + """ |
| 42 | + |
| 43 | + target_ops = (exir_ops.edge.aten.max_pool2d.default,) |
| 44 | + _passes_required_after: Set[Type[ExportPass]] = { |
| 45 | + ConvertSqueezesToViewPass, |
| 46 | + DecomposeMaxPool2dPass, |
| 47 | + RewriteMaxPool2dPass, |
| 48 | + SizeAdjustInputPass, |
| 49 | + } |
| 50 | + |
| 51 | + def call(self, graph_module: torch.fx.GraphModule) -> PassResult: |
| 52 | + graph = graph_module.graph |
| 53 | + modified = False |
| 54 | + pool_nodes = graph.find_nodes(op="call_function", target=self.target_ops[0]) |
| 55 | + |
| 56 | + for pool_node in pool_nodes: |
| 57 | + input_node = pool_node.args[0] |
| 58 | + if not isinstance(input_node, Node): |
| 59 | + raise RuntimeError("Expected max_pool2d input to be a node") |
| 60 | + |
| 61 | + input_fake = get_first_fake_tensor(input_node) |
| 62 | + if input_fake.dim() != 3: |
| 63 | + continue |
| 64 | + |
| 65 | + output_fake = get_first_fake_tensor(pool_node) |
| 66 | + with graph.inserting_before(pool_node): |
| 67 | + unsqueeze = create_node( |
| 68 | + graph, |
| 69 | + exir_ops.edge.aten.unsqueeze_copy.default, |
| 70 | + args=(input_node, 0), |
| 71 | + from_node=pool_node, |
| 72 | + inherit_qparams=False, |
| 73 | + ) |
| 74 | + unsqueeze.meta["val"] = input_fake.unsqueeze(0) |
| 75 | + pool_node.replace_input_with(input_node, unsqueeze) |
| 76 | + |
| 77 | + pool_node.meta["val"] = output_fake.unsqueeze(0) |
| 78 | + original_users = list(pool_node.users) |
| 79 | + with graph.inserting_after(pool_node): |
| 80 | + squeeze = create_node( |
| 81 | + graph, |
| 82 | + exir_ops.edge.aten.squeeze_copy.dims, |
| 83 | + args=(pool_node, [0]), |
| 84 | + from_node=pool_node, |
| 85 | + inherit_qparams=False, |
| 86 | + ) |
| 87 | + squeeze.meta["val"] = output_fake |
| 88 | + for user in original_users: |
| 89 | + user.replace_input_with(pool_node, squeeze) |
| 90 | + |
| 91 | + modified = True |
| 92 | + |
| 93 | + if modified: |
| 94 | + graph.lint() |
| 95 | + graph_module.recompile() |
| 96 | + |
| 97 | + return PassResult(graph_module, modified) |
0 commit comments