summaryrefslogtreecommitdiff
path: root/testsuite.py
diff options
context:
space:
mode:
Diffstat (limited to 'testsuite.py')
-rw-r--r--testsuite.py62
1 files changed, 32 insertions, 30 deletions
diff --git a/testsuite.py b/testsuite.py
index 9ebcef7..4cfc245 100644
--- a/testsuite.py
+++ b/testsuite.py
@@ -1700,39 +1700,41 @@ g
c = Kconfig("Kconfiglib/tests/Kdep")
- def verify_dependent(sym_name, deps_names):
- sym = c.syms[sym_name]
- deps = [c.syms[name] for name in deps_names]
- sym_deps = sym._get_dependent()
- verify(len(sym_deps) == len(set(sym_deps)),
- "{}'s dependencies contains duplicates".format(sym_name))
- sym_deps = [item for item in sym_deps
- if not isinstance(item, Choice)]
- verify(len(sym_deps) == len(deps),
- "Wrong number of dependent symbols for {}".format(sym_name))
- for dep in deps:
- verify(dep in sym_deps, "{} should depend on {}".
- format(dep.name, sym_name))
-
- # Test twice to cover dependency caching
- for i in range(0, 2):
- n_deps = 39
- # Verify that D1, D2, .., D<n_deps> are dependent on D
- verify_dependent("D", ("D{}".format(i) for i in range(1, n_deps + 1)))
- # Choices
- verify_dependent("A", ("B", "C"))
- verify_dependent("B", ("A", "C"))
- verify_dependent("C", ("A", "B"))
- verify_dependent("S", ("A", "B", "C"))
+ # TODO: reintroduce these somehow
+
+ #def verify_dependent(sym_name, deps_names):
+ # sym = c.syms[sym_name]
+ # deps = [c.syms[name] for name in deps_names]
+ # sym_deps = sym._get_dependent()
+ # verify(len(sym_deps) == len(set(sym_deps)),
+ # "{}'s dependencies contains duplicates".format(sym_name))
+ # sym_deps = [item for item in sym_deps
+ # if not isinstance(item, Choice)]
+ # verify(len(sym_deps) == len(deps),
+ # "Wrong number of dependent symbols for {}".format(sym_name))
+ # for dep in deps:
+ # verify(dep in sym_deps, "{} should depend on {}".
+ # format(dep.name, sym_name))
+
+ ## Test twice to cover dependency caching
+ #for i in range(0, 2):
+ # n_deps = 39
+ # # Verify that D1, D2, .., D<n_deps> are dependent on D
+ # verify_dependent("D", ("D{}".format(i) for i in range(1, n_deps + 1)))
+ # # Choices
+ # verify_dependent("A", ("B", "C"))
+ # verify_dependent("B", ("A", "C"))
+ # verify_dependent("C", ("A", "B"))
+ # verify_dependent("S", ("A", "B", "C"))
# Verify that the last symbol depends on the first in a long chain of
# dependencies. Test twice to cover dependency caching.
- c = Kconfig("Kconfiglib/tests/Kchain")
+ #c = Kconfig("Kconfiglib/tests/Kchain")
- for i in range(0, 2):
- verify(c.syms["CHAIN_26"] in c.syms["CHAIN_1"]._get_dependent(),
- "Dependency chain broken")
+ #for i in range(0, 2):
+ # verify(c.syms["CHAIN_26"] in c.syms["CHAIN_1"]._get_dependent(),
+ # "Dependency chain broken")
print("Testing compatibility with weird selects/implies...")
@@ -1920,7 +1922,7 @@ def test_sanity(conf, arch):
verify(sym not in conf.const_syms,
sym.name + " in both 'syms' and 'const_syms'")
- for dep in sym._direct_dependents:
+ for dep in sym._dependents:
verify(not dep.is_constant,
"the constant symbol {} depends on {}"
.format(dep.name, sym.name))
@@ -1956,7 +1958,7 @@ def test_sanity(conf, arch):
verify(not sym.nodes,
'"{}" is constant but has menu nodes'.format(sym.name))
- verify(not sym._direct_dependents,
+ verify(not sym._dependents,
'"{}" is constant but is a dependency of some symbol'
.format(sym.name))