forked from OSchip/llvm-project
7e3050ca1a
This analyzes the dependency graph and computes all minimal cycles. Equivalent cycles that differ only by rotation are excluded, as are cycles that are "super-cycles" of other smaller cycles. For example, if we discover the cycle A -> C -> A, and then later A -> B -> C -> D -> A, this latter cycle is not considered. Thus, it is possible that after eliminating some cycles, new ones will appear. However, this is the only way to make the algorithm terminate in a reasonable amount of time. llvm-svn: 298324 |
||
---|---|---|
.. | ||
Python | ||
Xcode | ||
interface | ||
swig_bot_lib | ||
CMakeLists.txt | ||
analyze-project-deps.py | ||
build-lldb-llvm-clang | ||
buildbot.py | ||
checkpoint-llvm.pl | ||
disasm-gdb-remote.pl | ||
finish-swig-wrapper-classes.sh | ||
finishSwigWrapperClasses.py | ||
generate-vers.pl | ||
get_relative_lib_dir.py | ||
install-lldb.sh | ||
install_custom_python.py | ||
lldb.swig | ||
prepare_bindings.py | ||
sed-sources | ||
shush | ||
swig_bot.py | ||
use_lldb_suite.py | ||
utilsArgsParse.py | ||
utilsDebug.py | ||
utilsOsType.py | ||
verify_api.py |