|
137 | 137 | # # @test LoopVectorization.choose_order(lscolsum) == (Symbol[:j,:i], :j, :i, :j, Unum, Tnum)
|
138 | 138 | # @test LoopVectorization.choose_order(lscolsum) == (Symbol[:j,:i], :j, :i, :j, 1, 1)
|
139 | 139 | # end
|
140 |
| - @test LoopVectorization.choose_order(lscolsum) == |
141 |
| - (Symbol[:j, :i], :j, Symbol("##undefined##"), :j, 4, -1) |
| 140 | + if Sys.ARCH === :aarch64 |
| 141 | + @test LoopVectorization.choose_order(lscolsum) == |
| 142 | + (Symbol[:j, :i], :j, Symbol("##undefined##"), :j, 8, -1) |
| 143 | + else |
| 144 | + @test LoopVectorization.choose_order(lscolsum) == |
| 145 | + (Symbol[:j, :i], :j, Symbol("##undefined##"), :j, 4, -1) |
| 146 | + end |
142 | 147 | # my colsum is wrong (by 0.25), but slightly more interesting
|
143 | 148 | function mycolsum!(x, A)
|
144 | 149 | @. x = 0
|
|
177 | 182 | # LoopVectorization.choose_order(lsvar)
|
178 | 183 | # @test LoopVectorization.choose_order(lsvar) == (Symbol[:j,:i], :j, :i, :j, Unum, Tnum)
|
179 | 184 | # if LoopVectorization.register_count() == 32
|
180 |
| - @test LoopVectorization.choose_order(lsvar) == |
181 |
| - (Symbol[:j, :i], :j, Symbol("##undefined##"), :j, 4, -1) |
| 185 | + if Sys.ARCH === :aarch64 |
| 186 | + @test LoopVectorization.choose_order(lsvar) == |
| 187 | + (Symbol[:j, :i], :j, Symbol("##undefined##"), :j, 8, -1) |
| 188 | + else |
| 189 | + @test LoopVectorization.choose_order(lsvar) == |
| 190 | + (Symbol[:j, :i], :j, Symbol("##undefined##"), :j, 4, -1) |
| 191 | + end |
182 | 192 | # @test LoopVectorization.choose_order(lsvar) == (Symbol[:j,:i], :j, :i, :j, 2, 10)
|
183 | 193 | # else#if LoopVectorization.register_count() == 16
|
184 | 194 | # @test LoopVectorization.choose_order(lsvar) == (Symbol[:j,:i], :j, Symbol("##undefined##"), :j, 8, -1)
|
|
0 commit comments