3 # Detect cycles in the header file dependency graph
4 # Vegard Nossum <vegardno@ifi.uio.no>
16 &Getopt
::Long
::Configure
(qw(bundling pass_through));
22 "I=s" => \
@opt_include,
26 push @opt_include, 'include';
30 my @headers = grep { strip
($_) } @ARGV;
37 detect_cycles
(@headers);
42 print "Usage: $0 [options] file...\n";
48 print " -I includedir\n";
50 print "To make nice graphs, try:\n";
51 print " $0 --graph include/linux/kernel.h | dot -Tpng -o graph.png\n";
56 print "headerdep version 2\n";
60 # Get a file name that is relative to our include paths
64 for my $i (@opt_include) {
65 my $stripped = $filename;
66 $stripped =~ s/^$i\///;
68 return $stripped if $stripped ne $filename;
74 # Search for the file name in the list of include paths
77 return $filename if -f
$filename;
79 for my $i (@opt_include) {
80 my $path = "$i/$filename";
81 return $path if -f
$path;
88 # Parse all the headers.
91 my $header = pop @queue;
92 next if exists $deps{$header};
94 $deps{$header} = [] unless exists $deps{$header};
96 my $path = search
($header);
99 open(my $file, '<', $path) or die($!);
100 chomp(my @lines = <$file>);
103 for my $i (0 .. $#lines) {
104 my $line = $lines[$i];
105 if(my($dep) = ($line =~ m/^#\s*include\s*<(.*?)>/)) {
107 push @
{$deps{$header}}, [$i + 1, $dep];
114 # $cycle[n] includes $cycle[n + 1];
115 # $cycle[-1] will be the culprit
118 # Adjust the line numbers
119 for my $i (0 .. $#$cycle - 1) {
120 $cycle->[$i]->[0] = $cycle->[$i + 1]->[0];
122 $cycle->[-1]->[0] = 0;
124 my $first = shift @
$cycle;
125 my $last = pop @
$cycle;
127 my $msg = "In file included";
128 printf "%s from %s,\n", $msg, $last->[1] if defined $last;
130 for my $header (reverse @
$cycle) {
131 printf "%s from %s:%d%s\n",
133 $header->[1], $header->[0],
134 $header->[1] eq $last->[1] ?
' <-- here' : '';
137 printf "%s:%d: warning: recursive header inclusion\n",
138 $first->[1], $first->[0];
141 # Find and print the smallest cycle starting in the specified node.
143 my @queue = map { [[0, $_]] } @_;
145 my $top = pop @queue;
146 my $name = $top->[-1]->[1];
148 for my $dep (@
{$deps{$name}}) {
149 my $chain = [@
$top, [$dep->[0], $dep->[1]]];
151 # If the dep already exists in the chain, we have a
153 if(grep { $_->[1] eq $dep->[1] } @
$top) {
172 # Output dependency graph in GraphViz language.
176 print "\t/* vertices */\n";
177 for my $header (keys %deps) {
178 printf "\t%s [label=\"%s\"];\n",
179 mangle
($header), $header;
184 print "\t/* edges */\n";
185 for my $header (keys %deps) {
186 for my $dep (@
{$deps{$header}}) {
187 printf "\t%s -> %s;\n",
188 mangle
($header), mangle
($dep->[1]);
This page took 0.035104 seconds and 5 git commands to generate.