oe-depends-dot 6.3 KB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130131132133134135136137138139140141142143144145146147148149150151152153154155156157158159160161162163164165166167168169170171172173174175176177178179180181
  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 task-depends.dot generated by bitbake -g",
  16. formatter_class=argparse.RawDescriptionHelpFormatter)
  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. parser.epilog = """
  33. Examples:
  34. First generate the .dot file:
  35. bitbake -g core-image-minimal
  36. To find out why a package is being built:
  37. %(prog)s -k <package> -w ./task-depends.dot
  38. To find out what a package depends on:
  39. %(prog)s -k <package> -d ./task-depends.dot
  40. Reduce the .dot file packages only, no tasks:
  41. %(prog)s -r ./task-depends.dot
  42. """
  43. self.args = parser.parse_args()
  44. if len(sys.argv) != 3 and len(sys.argv) < 5:
  45. print('ERROR: Not enough args, see --help for usage')
  46. @staticmethod
  47. def insert_dep_chain(chain, rdeps, alldeps):
  48. """
  49. insert elements to chain from rdeps, according to alldeps
  50. """
  51. # chain should at least contain one element
  52. if len(chain) == 0:
  53. raise
  54. inserted_elements = []
  55. for rdep in rdeps:
  56. if rdep in chain:
  57. continue
  58. else:
  59. for i in range(0, len(chain)-1):
  60. if chain[i] in alldeps[rdep] and rdep in alldeps[chain[i+1]]:
  61. chain.insert(i+1, rdep)
  62. inserted_elements.append(rdep)
  63. break
  64. if chain[-1] in alldeps[rdep] and rdep not in chain:
  65. chain.append(rdep)
  66. inserted_elements.append(rdep)
  67. return inserted_elements
  68. @staticmethod
  69. def print_dep_chains(key, rdeps, alldeps):
  70. rlist = rdeps.copy()
  71. chain = []
  72. removed_rdeps = [] # hold rdeps removed from rlist
  73. chain.append(key)
  74. while (len(rlist) != 0):
  75. # insert chain from rlist
  76. inserted_elements = Dot.insert_dep_chain(chain, rlist, alldeps)
  77. if not inserted_elements:
  78. if chain[-1] in rlist:
  79. rlist.remove(chain[-1])
  80. removed_rdeps.append(chain[-1])
  81. chain.pop()
  82. continue
  83. else:
  84. # insert chain from removed_rdeps
  85. Dot.insert_dep_chain(chain, removed_rdeps, alldeps)
  86. print(' -> '.join(list(reversed(chain))))
  87. def main(self):
  88. #print(self.args.dotfile[0])
  89. # The format is {key: depends}
  90. depends = {}
  91. with open(self.args.dotfile[0], 'r') as f:
  92. for line in f.readlines():
  93. if ' -> ' not in line:
  94. continue
  95. line_no_quotes = line.replace('"', '')
  96. m = re.match("(.*) -> (.*)", line_no_quotes)
  97. if not m:
  98. print('WARNING: Found unexpected line: %s' % line)
  99. continue
  100. key = m.group(1)
  101. if key == "meta-world-pkgdata":
  102. continue
  103. dep = m.group(2)
  104. key = key.split('.')[0]
  105. dep = dep.split('.')[0]
  106. if key == dep:
  107. continue
  108. if key in depends:
  109. if not key in depends[key]:
  110. depends[key].add(dep)
  111. else:
  112. print('WARNING: Fonud duplicated line: %s' % line)
  113. else:
  114. depends[key] = set()
  115. depends[key].add(dep)
  116. if self.args.remove:
  117. reduced_depends = {}
  118. for k, deps in depends.items():
  119. child_deps = set()
  120. added = set()
  121. # Both direct and indirect depends are already in the dict, so
  122. # we don't have to do this recursively.
  123. for dep in deps:
  124. if dep in depends:
  125. child_deps |= depends[dep]
  126. reduced_depends[k] = deps - child_deps
  127. outfile= '%s-reduced%s' % (self.args.dotfile[0][:-4], self.args.dotfile[0][-4:])
  128. with open(outfile, 'w') as f:
  129. print('Saving reduced dot file to %s' % outfile)
  130. f.write('digraph depends {\n')
  131. for k, v in reduced_depends.items():
  132. for dep in v:
  133. f.write('"%s" -> "%s"\n' % (k, dep))
  134. f.write('}\n')
  135. sys.exit(0)
  136. if self.args.key not in depends:
  137. print("ERROR: Can't find key %s in %s" % (self.args.key, self.args.dotfile[0]))
  138. sys.exit(1)
  139. if self.args.depends:
  140. if self.args.key in depends:
  141. print('Depends: %s' % ' '.join(depends[self.args.key]))
  142. reverse_deps = []
  143. if self.args.why:
  144. key_list = [self.args.key]
  145. current_key = self.args.key
  146. while (len(key_list) != 0):
  147. current_key = key_list.pop()
  148. for k, v in depends.items():
  149. if current_key in v and not k in reverse_deps:
  150. reverse_deps.append(k)
  151. key_list.append(k)
  152. print('Because: %s' % ' '.join(reverse_deps))
  153. Dot.print_dep_chains(self.args.key, reverse_deps, depends)
  154. if __name__ == "__main__":
  155. try:
  156. dot = Dot()
  157. ret = dot.main()
  158. except Exception as esc:
  159. ret = 1
  160. import traceback
  161. traceback.print_exc()
  162. sys.exit(ret)