mirror of
https://github.com/zebrajr/pytorch.git
synced 2025-12-08 07:39:33 +01:00
77ef77e5fa
Summary: Pull Request resolved: https://github.com/pytorch/pytorch/pull/43914 Renames `matches` function to `is_match`, since there is also a list named `matches` we are passing around in `Quantizer`, and would be good to decrease name conflicts. Test Plan: ``` python test/test_quantization.py TestQuantizeFxOps ``` Imported from OSS Reviewed By: jerryzh168 Differential Revision: D23435601 fbshipit-source-id: 394af11e0120cfb07dedc79d5219247330d4dfd6
68 lines
2.2 KiB
Python
68 lines
2.2 KiB
Python
from torch.fx import (
|
|
GraphModule,
|
|
)
|
|
|
|
from torch.fx.graph import (
|
|
Graph,
|
|
map_arg,
|
|
)
|
|
|
|
from .pattern_utils import (
|
|
is_match,
|
|
get_fusion_patterns,
|
|
)
|
|
|
|
from .fusion_patterns import * # noqa: F401
|
|
|
|
import copy
|
|
class Fuser:
|
|
def fuse(self, model, inplace=False):
|
|
input_root = model.root
|
|
if not inplace:
|
|
input_root = copy.deepcopy(input_root)
|
|
input_graph = model.graph
|
|
self.modules = dict(input_root.named_modules())
|
|
|
|
fusion_patterns = get_fusion_patterns()
|
|
# find fusion
|
|
fusion_pairs = self._find_matches(input_root, input_graph, fusion_patterns)
|
|
self.fused_graph = Graph()
|
|
env = {}
|
|
|
|
def load_arg(a):
|
|
return map_arg(a, lambda node: env[node.name])
|
|
|
|
for node in input_graph.nodes:
|
|
root_node, obj = fusion_pairs.get(node.name, (None, None))
|
|
if root_node is node:
|
|
env[node.name] = obj.fuse(self, load_arg)
|
|
elif root_node is None:
|
|
env[node.name] = self.fused_graph.node_copy(node, load_arg)
|
|
# node matched in patterns and is not root is removed here
|
|
|
|
self.fused_graph.output(load_arg(input_graph.result))
|
|
return GraphModule(input_root, self.fused_graph)
|
|
|
|
def _find_matches(self, root, graph, patterns):
|
|
modules = dict(root.named_modules())
|
|
match_map = {} # node name -> (root_node, match_value?)
|
|
|
|
def apply_match(pattern, node, match):
|
|
if isinstance(pattern, tuple):
|
|
s, *args = pattern
|
|
apply_match(s, node, match)
|
|
for subpattern, arg in zip(args, node.args):
|
|
apply_match(subpattern, arg, match)
|
|
else:
|
|
# the first pattern matches will take precedence
|
|
if node.name not in match_map:
|
|
match_map[node.name] = match
|
|
|
|
for node in reversed(graph.nodes):
|
|
if node.name not in match_map:
|
|
for pattern, value in patterns.items():
|
|
if is_match(modules, node, pattern):
|
|
apply_match(pattern, node, (node, value(self, node)))
|
|
|
|
return match_map
|