experimental_experiment.xoptim.patterns.onnx_mul

class experimental_experiment.xoptim.patterns.onnx_mul.MulMulMulScalarPattern(verbose: int = 0, priority: int = 1, min_opset: int = 1)

Replaces the sequence {Div | Mul} and {Div | Mul} + {Div | Mul} with {Div | Mul} Mul.

apply(g: GraphBuilder, node: NodeProto, node_left: NodeProto, node_right: NodeProto) → List[NodeProto]

The method does the rewriting. It assumes it can happen. It takes a list of nodes impacted by the rewriting assumes no other pattern optimizer will be modify them. It receives the list of nodes returned by method apply. Since it is a list of argument, method match can include None values. The method returns the new nodes. The optimizer considers that any node given to this function is removed from the graph, and any node returned by it are added. If a received node must be kept, it must be added to the list of returned node.

Parameters:

nodes – nodes returned by method match, there are then removed

Returns:

nodes to add to graph.

match(g: GraphBuilderPatternOptimization, node: NodeProto, matched: List[MatchResult]) → MatchResult | None

Determines nodes around node which can be rewritten.

Parameters:

• g – is a GraphBuilderPatternOptimization, it holds all the existing nodes, is able to return any information about type, shape, the node before, the node after another one.

• node – the matching must determine if some nodes around this one are part of set of nodes this pattern optmizer can rewrite. From there, the function explores wherever it needs, checking any condition it needs.

• matched – usually unused, it returns of nodes already matching a pattern

The method must not modify the graph. The method returns None if no match is found or an instance of class MatchResult. It must contain:

• a list of nodes involved in the rewriting. It does not mean all of them will be removed but all of them are needed to do the rewriting and must not be impacted by other pattern optimizer.

• A function doing the rewriting (usually method apply of the pattern class).

• An existing node where the rewritten nodes can be inserted. Knowing it makes it faster to rewriter. If not specified, the optimizer will automatically determine the position of the new nodes.

class experimental_experiment.xoptim.patterns.onnx_mul.SwitchOrderBinaryPattern(verbose: int = 0, priority: int = 1, min_opset: int = 1)

If it makes sense, switches the order of two multiplications or two addtions if the broadcasting reduces one operator to a an insignificant number.

class BroadcastType(value, names=<not given>, *values, module=None, qualname=None, type=None, start=1, boundary=None)

Kind of broadcast.

apply(g: GraphBuilder, node: NodeProto, node_left: NodeProto, node_right: NodeProto) → List[NodeProto]

The method does the rewriting. It assumes it can happen. It takes a list of nodes impacted by the rewriting assumes no other pattern optimizer will be modify them. It receives the list of nodes returned by method apply. Since it is a list of argument, method match can include None values. The method returns the new nodes. The optimizer considers that any node given to this function is removed from the graph, and any node returned by it are added. If a received node must be kept, it must be added to the list of returned node.

Parameters:

nodes – nodes returned by method match, there are then removed

Returns:

nodes to add to graph.

match(g: GraphBuilderPatternOptimization, node: NodeProto, matched: List[MatchResult]) → MatchResult | None

Determines nodes around node which can be rewritten.

Parameters:

• g – is a GraphBuilderPatternOptimization, it holds all the existing nodes, is able to return any information about type, shape, the node before, the node after another one.

• node – the matching must determine if some nodes around this one are part of set of nodes this pattern optmizer can rewrite. From there, the function explores wherever it needs, checking any condition it needs.

• matched – usually unused, it returns of nodes already matching a pattern

The method must not modify the graph. The method returns None if no match is found or an instance of class MatchResult. It must contain:

• a list of nodes involved in the rewriting. It does not mean all of them will be removed but all of them are needed to do the rewriting and must not be impacted by other pattern optimizer.

• A function doing the rewriting (usually method apply of the pattern class).

• An existing node where the rewritten nodes can be inserted. Knowing it makes it faster to rewriter. If not specified, the optimizer will automatically determine the position of the new nodes.

switch_order(shape_left: Tuple[int | torch.SymInt | torch.SymFloat | float | str, ...], shape_right: Tuple[int | torch.SymInt | torch.SymFloat | float | str, ...], shape_before_left: Tuple[int | torch.SymInt | torch.SymFloat | float | str, ...], shape_before_right: Tuple[int | torch.SymInt | torch.SymFloat | float | str, ...], side: int) → int

Tells if the order should be switched. side==0 indicates if shape_left comes from Op(shape_before_left, shape_before_mul).

if side == 0:

• Case 0: (B + C) + A: Op(Op(shape_before_left, shape_before_right), shape_right)

• Case 1: (B + A) + C: Op(Op(shape_before_left, shape_right), shape_before_right)

• Case 2: (A + C) + B: Op(Op(shape_right, shape_before_left), shape_before_left)

The function returns the case.