@@ -108,7 +108,7 @@ using Test
108
108
# # @test LoopVectorization.choose_order(lscolsum) == (Symbol[:j,:i], :j, :i, :j, Unum, Tnum)
109
109
# @test LoopVectorization.choose_order(lscolsum) == (Symbol[:j,:i], :j, :i, :j, 1, 1)
110
110
# end
111
- @test LoopVectorization. choose_order (lscolsum) == (Symbol[:j ,:i ], :j , Symbol (" ##undefined##" ), :j , 4 , - 1 )
111
+ @test LoopVectorization. choose_order (lscolsum) == (Symbol[:j ,:i ], :j , Symbol (" ##undefined##" ), :j , 8 , - 1 )
112
112
# my colsum is wrong (by 0.25), but slightly more interesting
113
113
function mycolsum! (x, A)
114
114
@. x = 0
@@ -144,7 +144,7 @@ using Test
144
144
lsvar = LoopVectorization. LoopSet (varq);
145
145
# LoopVectorization.choose_order(lsvar)
146
146
# @test LoopVectorization.choose_order(lsvar) == (Symbol[:j,:i], :j, :i, :j, Unum, Tnum)
147
- @test LoopVectorization. choose_order (lsvar) == (Symbol[:j ,:i ], :j , Symbol (" ##undefined##" ), :j , 4 , - 1 )
147
+ @test LoopVectorization. choose_order (lsvar) == (Symbol[:j ,:i ], :j , Symbol (" ##undefined##" ), :j , 8 , - 1 )
148
148
# if LoopVectorization.REGISTER_COUNT == 32
149
149
# @test LoopVectorization.choose_order(lsvar) == (Symbol[:j,:i], :j, :i, :j, 2, 10)
150
150
# elseif LoopVectorization.REGISTER_COUNT == 16
0 commit comments