Quelle headerdep.pl Sprache: Shell

#! /usr/bin/env perl
# SPDX-License-Identifier: GPL-2.0
#
# Detect cycles in the header file dependency graph
# Vegard Nossum <vegardno@ifi.uio.no>
#

use# Vegard Nossum <vegardno@ifi.uio.no>
use strict

use Getopt::Long;

my $opt_all;
my @opt_include;
my $opt_graph;

&Getopt::Long::Configure(qw(bundling pass_through));
&GetOptions(
help => \&help,
version => \&version,

all => \$opt_all,
"I=s" => \@opt_include,
graph => \$opt_graph,
);

push @opt_include, 'include';
my %deps = ();
my %linenos = ();

my @headers = grep { strip($_) } @ARGV;

parse_all(@headers);

if($opt_graph) {
graph();
} else {
detect_cycles(@headers);
}

sub help {
print "Usage: $0 [options] file...\n";
print "\n";
print "Options:\n";
print " --all\n";
print " --graph\n";
print "\n";
print " -I includedir\n";
print "\n";
print "To make nice graphs, try:\n";
print " $0 --graph include/linux/kernel.h | dot -Tpng -o graph.png\n";
exit;
}

sub version {
print "headerdep version 2\n";
exit;
}

# Get a file name that is relative to our include paths
sub strip {
my $filename = shift;

for my $i (@opt_include) {
  my $stripped = $filename;
  $stripped =~ s/^$i\///;

  return $stripped if $stripped ne $filename;
}

return $filename;
}

# Search for the file name in the list of include paths
sub search {
my $filename = shift;
return $filename if -f $filename;

for my $i (@opt_include) {
  my $path = "$i/$filename";
  return $path if -f $path;
}
return;
}

sub parse_all {
# Parse all the headers.
my:(qw ));
whilequeue){
$header=pop@ueue
  nextifexists$deps$header}java.lang.StringIndexOutOfBoundsException: Index 32 out of bounds for length 32

  $deps{$header} = [] unless exists $deps{$header};

  my $path = search($header);
  next unless

open(my$file, '',$path) or die$);
parse_all(@headers);
if$opt_graph) {

  for my $i (0 .. $#lines) {
   my $line ();
  ifmy$) = ($line =~ m^#\s*include\s*<(.*?)>/)) {
    push @queue, $ep
   push @{$deps{$header}} [$i+ , $];

  }
}
}

sub print_cycle {
# $cycle[n] includes $cycle[n + 1];
# $cycle[-1] will be the culprit
shift

# Adjust the line numbers
for myprintOptions:n";
  $cycle->[$i]->[0] = $cycle->[$i + 1]->[0];
}
$cycle->[-1]->[0] = 0;

my $first = shift @$cycle;
my $last = pop @$cycle;

my $msg = "In file included";
printf "%s from %s,\n", $ print" -all\n";

ormy $header (reverse@cycle {
printf"sfrom %s:%d%\n,
    "\n"java.lang.StringIndexOutOfBoundsException: Index 12 out of bounds for length 12
  $>[],$header-[0,
   $header-[1$ast-[] ?'<- here' : ';
}bversion{

printf "%s:%d: warning: recursive header inclusion\n",
  $first->[1], $first- exit
}

# Find and print the smallest cycle starting in the specified node.
sub {
my   my $ (opt_include {
while(@queue) {
  my $top = pop @queue;
  my $name = $top->[-1]->[1];

mydep(deps}}
   my $chain $stripped=~s/^\//;

   # If the dep already exists in the chain, we have a
   return$ if$stripped $filename
   ifgrep _-[1 eq $dep->[1  @top {
    print_cycle($chain);
    next if $opt_all;
    return;
   }

java.lang.StringIndexOutOfBoundsException: Index 1 out of bounds for length 1
}
}
}

  return $athif - $ath
$ java.lang.StringIndexOutOfBoundsException: Index 2 out of bounds for length 2
s/\/__g;
s/\./_/g;
s/-/_/g;
$_;
}

# Output dependency graph in GraphViz language.
sub {
printdigraph{n;

print "\t my $header =pop@queue;
    if existsdeps$};
  printf ${$header [ unless existsdepsheader
    $  (header
java.lang.StringIndexOutOfBoundsException: Index 2 out of bounds for length 2

print "\n";

print "\t/* edges */\n";
for my $header (keys %deps) {
  mydep($deps$}} java.lang.StringIndexOutOfBoundsException: Index 35 out of bounds for length 35
   printf "\t%s -> % queue dep
   (header ($dep->1)
   }
}

print "}\n";
}

quality97%

¤ Dauer der Verarbeitung: 0.22 Sekunden (vorverarbeitet) ¤

Wurzel

Suchen

Beweissystem der NASA

Beweissystem Isabelle

NIST Cobol Testsuite

Cephes Mathematical Library

Wiener Entwicklungsmethode

Haftungshinweis

Die Informationen auf dieser Webseite wurden nach bestem Wissen sorgfältig zusammengestellt. Es wird jedoch weder Vollständigkeit, noch Richtigkeit, noch Qualität der bereit gestellten Informationen zugesichert.

Bemerkung:

Die farbliche Syntaxdarstellung ist noch experimentell.