You signed in with another tab or window. Reload to refresh your session.You signed out in another tab or window. Reload to refresh your session.You switched accounts on another tab or window. Reload to refresh your session.Dismiss alert
With the example below, the field versioning triggers a bug.
There is a circular dependency with
hC <-, -> hC_t
which does not trigger a field versioning by the algorithm since the SCC does not contain horizontal extent accesses.
However the algorithm also checks that the graph contains (at least one) input only nodes and output only nodes.
When the algorithm inserts (in the backward traversal of statements) the statement, hE = hC[i + 1] * (1 - alpha) + hC[i - 1] * alpha;
the condition that contains (at least one) input only node does not hold true. The algorithm thinks this is due to the SCC of hC <-, -> hC_t, which is not true, since this SCC was inserted before.
With the example below, the field versioning triggers a bug.
There is a circular dependency with
hC <-, -> hC_t
which does not trigger a field versioning by the algorithm since the SCC does not contain horizontal extent accesses.
However the algorithm also checks that the graph contains (at least one) input only nodes and output only nodes.
dawn/dawn/src/dawn/Optimizer/PassFieldVersioning.cpp
Line 226 in 30ba6f1
When the algorithm inserts (in the backward traversal of statements) the statement,
hE = hC[i + 1] * (1 - alpha) + hC[i - 1] * alpha;
the condition that contains (at least one) input only node does not hold true. The algorithm thinks this is due to the SCC of hC <-, -> hC_t, which is not true, since this SCC was inserted before.
Full example:
The text was updated successfully, but these errors were encountered: