oe-depends-dot 5.6 KB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130131132133134135136137138139140141142143144145146147148149150151152153154155156157
  1. #!/usr/bin/env python3
  2. #
  3. # Copyright (C) 2018 Wind River Systems, Inc.
  4. #
  5. # SPDX-License-Identifier: GPL-2.0-only
  6. #
  7. import os
  8. import sys
  9. import argparse
  10. import logging
  11. import re
  12. class Dot(object):
  13. def __init__(self):
  14. parser = argparse.ArgumentParser(
  15. description="Analyse recipe-depends.dot generated by bitbake -g",
  16. epilog="Use %(prog)s --help to get help")
  17. parser.add_argument("dotfile",
  18. help = "Specify the dotfile", nargs = 1, action='store', default='')
  19. parser.add_argument("-k", "--key",
  20. help = "Specify the key, e.g., recipe name",
  21. action="store", default='')
  22. parser.add_argument("-d", "--depends",
  23. help = "Print the key's dependencies",
  24. action="store_true", default=False)
  25. parser.add_argument("-w", "--why",
  26. help = "Print why the key is built",
  27. action="store_true", default=False)
  28. parser.add_argument("-r", "--remove",
  29. help = "Remove duplicated dependencies to reduce the size of the dot files."
  30. " For example, A->B, B->C, A->C, then A->C can be removed.",
  31. action="store_true", default=False)
  32. self.args = parser.parse_args()
  33. if len(sys.argv) != 3 and len(sys.argv) < 5:
  34. print('ERROR: Not enough args, see --help for usage')
  35. @staticmethod
  36. def insert_dep_chain(chain, rdeps, alldeps):
  37. """
  38. insert elements to chain from rdeps, according to alldeps
  39. """
  40. # chain should at least contain one element
  41. if len(chain) == 0:
  42. raise
  43. inserted_elements = []
  44. for rdep in rdeps:
  45. if rdep in chain:
  46. continue
  47. else:
  48. for i in range(0, len(chain)-1):
  49. if chain[i] in alldeps[rdep] and rdep in alldeps[chain[i+1]]:
  50. chain.insert(i+1, rdep)
  51. inserted_elements.append(rdep)
  52. break
  53. if chain[-1] in alldeps[rdep] and rdep not in chain:
  54. chain.append(rdep)
  55. inserted_elements.append(rdep)
  56. return inserted_elements
  57. @staticmethod
  58. def print_dep_chains(key, rdeps, alldeps):
  59. rlist = rdeps.copy()
  60. chain = []
  61. removed_rdeps = [] # hold rdeps removed from rlist
  62. chain.append(key)
  63. while (len(rlist) != 0):
  64. # insert chain from rlist
  65. inserted_elements = Dot.insert_dep_chain(chain, rlist, alldeps)
  66. if not inserted_elements:
  67. if chain[-1] in rlist:
  68. rlist.remove(chain[-1])
  69. removed_rdeps.append(chain[-1])
  70. chain.pop()
  71. continue
  72. else:
  73. # insert chain from removed_rdeps
  74. Dot.insert_dep_chain(chain, removed_rdeps, alldeps)
  75. print(' -> '.join(list(reversed(chain))))
  76. def main(self):
  77. #print(self.args.dotfile[0])
  78. # The format is {key: depends}
  79. depends = {}
  80. with open(self.args.dotfile[0], 'r') as f:
  81. for line in f.readlines():
  82. if ' -> ' not in line:
  83. continue
  84. line_no_quotes = line.replace('"', '')
  85. m = re.match("(.*) -> (.*)", line_no_quotes)
  86. if not m:
  87. print('WARNING: Found unexpected line: %s' % line)
  88. continue
  89. key = m.group(1)
  90. if key == "meta-world-pkgdata":
  91. continue
  92. dep = m.group(2)
  93. if key in depends:
  94. if not key in depends[key]:
  95. depends[key].add(dep)
  96. else:
  97. print('WARNING: Fonud duplicated line: %s' % line)
  98. else:
  99. depends[key] = set()
  100. depends[key].add(dep)
  101. if self.args.remove:
  102. reduced_depends = {}
  103. for k, deps in depends.items():
  104. child_deps = set()
  105. added = set()
  106. # Both direct and indirect depends are already in the dict, so
  107. # we don't have to do this recursively.
  108. for dep in deps:
  109. if dep in depends:
  110. child_deps |= depends[dep]
  111. reduced_depends[k] = deps - child_deps
  112. outfile= '%s-reduced%s' % (self.args.dotfile[0][:-4], self.args.dotfile[0][-4:])
  113. with open(outfile, 'w') as f:
  114. print('Saving reduced dot file to %s' % outfile)
  115. f.write('digraph depends {\n')
  116. for k, v in reduced_depends.items():
  117. for dep in v:
  118. f.write('"%s" -> "%s"\n' % (k, dep))
  119. f.write('}\n')
  120. sys.exit(0)
  121. if self.args.key not in depends:
  122. print("ERROR: Can't find key %s in %s" % (self.args.key, self.args.dotfile[0]))
  123. sys.exit(1)
  124. if self.args.depends:
  125. if self.args.key in depends:
  126. print('Depends: %s' % ' '.join(depends[self.args.key]))
  127. reverse_deps = []
  128. if self.args.why:
  129. for k, v in depends.items():
  130. if self.args.key in v and not k in reverse_deps:
  131. reverse_deps.append(k)
  132. print('Because: %s' % ' '.join(reverse_deps))
  133. Dot.print_dep_chains(self.args.key, reverse_deps, depends)
  134. if __name__ == "__main__":
  135. try:
  136. dot = Dot()
  137. ret = dot.main()
  138. except Exception as esc:
  139. ret = 1
  140. import traceback
  141. traceback.print_exc()
  142. sys.exit(ret)