yobx.xoptim.patterns.onnx_where#

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

Replaces the sequence Where(Not(cond), X, Y) -> Where(cond, Y, X).

        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_A(["A INT64(a, b)"])
    I_X(["X BOOL(a, b)"])
    I_B(["B INT64(a, b)"])

    Not_0[["Not(.)"]]
    Where_1[["Where(., ., .)"]]

    I_X -->|"BOOL(a, b)"| Not_0
    Not_0 -->|"BOOL(a, b)"| Where_1
    I_A -->|"INT64(a, b)"| Where_1
    I_B -->|"INT64(a, b)"| Where_1

    O_Y(["Y INT64(a, b)"])
    Where_1 --> O_Y

    class I_A,I_X,I_B,O_Y ioNode
    class Not_0,Where_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_A(["A INT64(a, b)"])
    I_X(["X BOOL(a, b)"])
    I_B(["B INT64(a, b)"])

    Where_0[["Where(., ., .)"]]

    I_X -->|"BOOL(a, b)"| Where_0
    I_B -->|"INT64(a, b)"| Where_0
    I_A -->|"INT64(a, b)"| Where_0

    O_Y(["Y INT64(a, b)"])
    Where_0 --> O_Y

    class I_A,I_X,I_B,O_Y ioNode
    class Where_0 opNode

apply(g: GraphBuilder, not_node: NodeProto, where_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_where.WhereAddPattern(verbose: int = 0, priority: int = 1, min_opset: int = 1)[source]#

Replaces the sequence Add(X, Where(bool_mask, 0, -inf)) -> Where(bool_mask, X, -inf).

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_inf(["inf FLOAT(1)"])
    I_X(["X FLOAT(a, b)"])
    I_mask(["mask BOOL(a, b)"])

    Constant_0[["Constant() -#gt; inf"]]
    Where_1[["Where(., [0.0], .)"]]
    Add_2[["Add(., .)"]]

    I_mask -->|"BOOL(a, b)"| Where_1
    Constant_0 -->|"FLOAT(1)"| Where_1
    Where_1 -->|"FLOAT(a, b)"| Add_2
    I_X -->|"FLOAT(a, b)"| Add_2

    O_Y(["Y FLOAT(a, b)"])
    Add_2 --> O_Y

    class I_inf,I_X,I_mask,O_Y ioNode
    class Constant_0 constNode
    class Where_1,Add_2 opNode