On Wednesday 21 October 2009, Øyvind Harboe wrote: > >> Are there any shortest paths that are ambiguous? > > > > I don't understand what you mean by "ambiguous"; > > at any TCK edge, TMS will have only one value so > > only one state will be entered. > > There are many ways to get from A to B. The "shortest" > from A to B is, presumably unambiguous so one can > then use endstate + pathmove to get a predictable behavior.
So you're asking if there are cases where there are two or more paths A --> B of the same length, where there is no shorter path? Don't think there could be. But again, we're not anywhere near there. It suffices to specify start and end state, given requirements like IR-Pause --> DR-Pause needing to pass through IR-Update but not Run. _______________________________________________ Openocd-development mailing list [email protected] https://lists.berlios.de/mailman/listinfo/openocd-development
