ok thanks for catching this Mike - I just gave it a try and the new IPA
propagated scalars into this function, which allowed for constant folding
of the indexing expressions, and effectively hid the underlying issue. With
disabled IPA, I'm able to reproduce this issue. Interestingly, it only
shows
Generally, the parfor dependency analysis applies a series of tests
including traditional techniques from high-performance compilers combined
with additional rules for common cases. This dependency analysis tries to
proof that there are no loop-carried dependencies - so yes, false positives
can
While working on depthwise convolution, I wanted to make use of a parfor loop
to run multiple convolutions at once (there is a vectorized approach as well,
but that is out of scope for this question), but I'm running into issues with
false flags for loop interdependencies. Within the parfor
