Silice currently assumes all group members are read or written when passed as parameters to subroutine and algorithm calls. As a consequence, false positive could appear as combinational loops could be detected between two members when they are, in fact, not forming a cyclic dependency.
Fixing this requires a better check when resolving calls, using the internal dependency graph of the instantiated algorithm.
Silice currently assumes all group members are read or written when passed as parameters to subroutine and algorithm calls. As a consequence, false positive could appear as combinational loops could be detected between two members when they are, in fact, not forming a cyclic dependency.
Fixing this requires a better check when resolving calls, using the internal dependency graph of the instantiated algorithm.