yobx.xoptim.patterns.onnx_concat — yet-another-onnx-builder 0.1.0 documentation

class yobx.xoptim.patterns.onnx_concat.ConcatEmptyPattern(verbose: int = 0, priority: int = 1, min_opset: int = 1)[source]#

Checks if one of the concatenated values is empty.

Model with nodes to be fused:

        graph TD

    classDef ioNode fill:#dfd,stroke:#333,color:#333
    classDef initNode fill:#cccc00,stroke:#333,color:#333
    classDef constNode fill:#f9f,stroke:#333,stroke-width:2px,color:#333
    classDef opNode fill:#bbf,stroke:#333,stroke-width:2px,color:#333

    I_Y(["Y INT64(b)"])
    I_X(["X INT64(a)"])

    Concat_0[["Concat(., ., [], axis=0)"]]

    I_X -->|"INT64(a)"| Concat_0
    I_Y -->|"INT64(b)"| Concat_0

    O_Z(["Z INT64(c)"])
    Concat_0 --> O_Z

    class I_Y,I_X,O_Z ioNode
    class Concat_0 opNode

Outcome of the fusion:

        graph TD

    classDef ioNode fill:#dfd,stroke:#333,color:#333
    classDef initNode fill:#cccc00,stroke:#333,color:#333
    classDef constNode fill:#f9f,stroke:#333,stroke-width:2px,color:#333
    classDef opNode fill:#bbf,stroke:#333,stroke-width:2px,color:#333

    I_Y(["Y INT64(b)"])
    I_X(["X INT64(a)"])

    Concat_0[["Concat(., ., axis=0)"]]

    I_X -->|"INT64(a)"| Concat_0
    I_Y -->|"INT64(b)"| Concat_0

    O_Z(["Z INT64(c)"])
    Concat_0 --> O_Z

    class I_Y,I_X,O_Z ioNode
    class Concat_0 opNode

apply(g: GraphBuilder, node: NodeProto) → List[NodeProto][source]#

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[source]#

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 optimizer 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 yobx.xoptim.patterns.onnx_concat.ConcatGatherPattern(verbose: int = 0, priority: int = 0)[source]#

Checks if Gather(Concat) can be replaced by Identity.

Model with nodes to be fused:

        graph TD

    classDef ioNode fill:#dfd,stroke:#333,color:#333
    classDef initNode fill:#cccc00,stroke:#333,color:#333
    classDef constNode fill:#f9f,stroke:#333,stroke-width:2px,color:#333
    classDef opNode fill:#bbf,stroke:#333,stroke-width:2px,color:#333

    I_D1(["D1 INT64(1)"])
    I_D2(["D2 INT64(1)"])

    Concat_0[["Concat(., ., axis=0)"]]
    Gather_1[["Gather(., [1])"]]

    I_D1 -->|"INT64(1)"| Concat_0
    I_D2 -->|"INT64(1)"| Concat_0
    Concat_0 -->|"INT64(2)"| Gather_1

    O_Y(["Y INT64(1)"])
    Gather_1 --> O_Y

    class I_D1,I_D2,O_Y ioNode
    class Concat_0,Gather_1 opNode

Outcome of the fusion:

        graph TD

    classDef ioNode fill:#dfd,stroke:#333,color:#333
    classDef initNode fill:#cccc00,stroke:#333,color:#333
    classDef constNode fill:#f9f,stroke:#333,stroke-width:2px,color:#333
    classDef opNode fill:#bbf,stroke:#333,stroke-width:2px,color:#333

    I_D2(["D2 INT64(1)"])

    Identity_0[["Identity(.)"]]

    I_D2 -->|"INT64(1)"| Identity_0

    O_Y(["Y INT64(1)"])
    Identity_0 --> O_Y

    class I_D2,O_Y ioNode
    class Identity_0 opNode

apply(g: GraphBuilder, concat_node: NodeProto, gather_node: NodeProto) → List[NodeProto][source]#

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[source]#

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 optimizer 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 yobx.xoptim.patterns.onnx_concat.ConcatTwiceUnaryPattern(verbose: int = 0, priority: int = 1, min_opset: int = 1)[source]#

Sin(Concat(x,x)) -> Concat(Sin(x), Sin(x)).

Model with nodes to be fused:

        graph TD

    classDef ioNode fill:#dfd,stroke:#333,color:#333
    classDef initNode fill:#cccc00,stroke:#333,color:#333
    classDef constNode fill:#f9f,stroke:#333,stroke-width:2px,color:#333
    classDef opNode fill:#bbf,stroke:#333,stroke-width:2px,color:#333

    I_X(["X FLOAT(b, c)"])

    Concat_0[["Concat(., ., axis=0)"]]
    Sin_1[["Sin(.)"]]

    I_X -->|"FLOAT(b, c)"| Concat_0
    Concat_0 -->|"FLOAT(2*b, c)"| Sin_1

    O_xsin(["xsin FLOAT(2*b, c)"])
    Sin_1 --> O_xsin

    class I_X,O_xsin ioNode
    class Concat_0,Sin_1 opNode

Outcome of the fusion:

        graph TD

    classDef ioNode fill:#dfd,stroke:#333,color:#333
    classDef initNode fill:#cccc00,stroke:#333,color:#333
    classDef constNode fill:#f9f,stroke:#333,stroke-width:2px,color:#333
    classDef opNode fill:#bbf,stroke:#333,stroke-width:2px,color:#333

    I_X(["X FLOAT(b, c)"])

    Sin_0[["Sin(.)"]]
    Concat_1[["Concat(., ., axis=0)"]]

    I_X -->|"FLOAT(b, c)"| Sin_0
    Sin_0 -->|"FLOAT(b, c)"| Concat_1

    O_xsin(["xsin FLOAT(2*b, c)"])
    Concat_1 --> O_xsin

    class I_X,O_xsin ioNode
    class Sin_0,Concat_1 opNode

apply(g: GraphBuilder, concat: NodeProto, unary: NodeProto) → List[NodeProto][source]#

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[source]#

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 optimizer 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.

yobx.xoptim.patterns.onnx_concat#

This Page