|
633 | 633 | C[m,n] = ΔCₘₙ
|
634 | 634 | end) |> LoopVectorization.loopset;
|
635 | 635 | if LoopVectorization.register_count() == 32
|
636 |
| - if LoopVectorization.register_size() == 64 |
637 |
| - # @test LoopVectorization.choose_order(lsAtmulBt8) == ([:n, :m, :k], :m, :n, :m, 1, 8) |
638 |
| - @test LoopVectorization.choose_order(lsAtmulBt8) == ([:n, :m, :k], :k, :n, :m, 1, 8) |
639 |
| - elseif LoopVectorization.register_size() == 16 |
640 |
| - @test LoopVectorization.choose_order(lsAtmulBt8) == ([:n, :m, :k], :m, :n, :m, 4, 4) |
641 |
| - end |
| 636 | + if LoopVectorization.register_size() == 64 |
| 637 | + @test LoopVectorization.choose_order(lsAtmulBt8) == ([:n, :m, :k], :m, :n, :m, 1, 8) |
| 638 | + # @test LoopVectorization.choose_order(lsAtmulBt8) == ([:n, :m, :k], :k, :n, :m, 1, 8) |
| 639 | + elseif LoopVectorization.register_size() == 16 |
| 640 | + @test LoopVectorization.choose_order(lsAtmulBt8) == ([:n, :m, :k], :m, :n, :m, 4, 4) |
| 641 | + end |
642 | 642 | elseif LoopVectorization.register_count() == 16
|
643 |
| - # @test LoopVectorization.choose_order(lsAtmulBt8) == ([:n, :m, :k], :m, :n, :m, 2, 4) |
644 |
| - @test LoopVectorization.choose_order(lsAtmulBt8) == ([:n, :m, :k], :n, :m, :n, 2, 4) |
| 643 | + @test LoopVectorization.choose_order(lsAtmulBt8) == ([:n, :m, :k], :m, :n, :m, 2, 4) |
| 644 | + # @test LoopVectorization.choose_order(lsAtmulBt8) == ([:n, :m, :k], :n, :m, :n, 2, 4) |
645 | 645 | elseif LoopVectorization.register_count() == 8
|
646 |
| - @test LoopVectorization.choose_order(lsAtmulBt8) == ([:n, :m, :k], :m, :n, :m, 1, 4) |
| 646 | + @test LoopVectorization.choose_order(lsAtmulBt8) == ([:n, :m, :k], :m, :n, :m, 1, 4) |
647 | 647 | end
|
648 | 648 |
|
649 | 649 | struct SizedMatrix{M,N,T} <: DenseMatrix{T}
|
|
0 commit comments