X7ROOT File Manager
Current Path:
/usr/src/kernels/3.10.0-957.10.1.el7.x86_64/scripts
usr
/
src
/
kernels
/
3.10.0-957.10.1.el7.x86_64
/
scripts
/
📁
..
📄
Kbuild.include
(10.25 KB)
📄
Lindent
(460 B)
📄
Makefile
(1.39 KB)
📄
Makefile.asm-generic
(684 B)
📄
Makefile.build
(15.91 KB)
📄
Makefile.clean
(3.23 KB)
📄
Makefile.fwinst
(2.03 KB)
📄
Makefile.headersinst
(4.72 KB)
📄
Makefile.help
(68 B)
📄
Makefile.host
(6.46 KB)
📄
Makefile.lib
(13.57 KB)
📄
Makefile.modbuiltin
(1.78 KB)
📄
Makefile.modinst
(1.16 KB)
📄
Makefile.modpost
(5.15 KB)
📄
Makefile.modsign
(1003 B)
📄
asn1_compiler
(22.39 KB)
📄
asn1_compiler.c
(33.97 KB)
📁
basic
📄
bloat-o-meter
(1.75 KB)
📄
bootgraph.pl
(5.62 KB)
📄
checkincludes.pl
(1.77 KB)
📄
checkkconfigsymbols.sh
(1.82 KB)
📄
checkpatch.pl
(101.34 KB)
📄
checkstack.pl
(5.33 KB)
📄
checksyscalls.sh
(5.64 KB)
📄
checkversion.pl
(1.86 KB)
📄
cleanfile
(3.41 KB)
📄
cleanpatch
(5.01 KB)
📄
coccicheck
(3.78 KB)
📁
coccinelle
📄
config
(3.65 KB)
📄
conmakehash
(10.22 KB)
📄
conmakehash.c
(6 KB)
📄
decodecode
(2.15 KB)
📄
depmod.sh
(1.67 KB)
📄
diffconfig
(3.54 KB)
📄
docproc.c
(13.69 KB)
📁
dtc
📄
export_report.pl
(4.53 KB)
📄
extract-ikconfig
(1.64 KB)
📄
extract-vmlinux
(1.6 KB)
📄
gcc-goto.sh
(465 B)
📄
gcc-version.sh
(822 B)
📄
gcc-x86_32-has-stack-protector.sh
(184 B)
📄
gcc-x86_64-has-stack-protector.sh
(200 B)
📄
gen_initramfs_list.sh
(7.38 KB)
📁
genksyms
📄
get_maintainer.pl
(54.11 KB)
📄
gfp-translate
(1.71 KB)
📄
headerdep.pl
(3.46 KB)
📄
headers.sh
(530 B)
📄
headers_check.pl
(3.6 KB)
📄
headers_install.sh
(1.28 KB)
📄
kallsyms
(14.46 KB)
📄
kallsyms.c
(16.52 KB)
📁
kconfig
📄
kernel-doc
(71.41 KB)
📁
ksymoops
📄
link-vmlinux.sh
(5.65 KB)
📄
makelst
(773 B)
📄
markup_oops.pl
(8.08 KB)
📄
mkcompile_h
(2.46 KB)
📄
mkmakefile
(1.17 KB)
📄
mksysmap
(1.32 KB)
📄
mkuboot.sh
(379 B)
📄
mkversion
(74 B)
📁
mod
📄
module-common.lds
(757 B)
📄
modules.order
(0 B)
📄
namespace.pl
(13 KB)
📁
package
📄
patch-kernel
(9.91 KB)
📄
pnmtologo
(14.24 KB)
📄
pnmtologo.c
(11.91 KB)
📄
profile2linkerlist.pl
(375 B)
📄
recordmcount
(18.34 KB)
📄
recordmcount.c
(12.4 KB)
📄
recordmcount.h
(16.34 KB)
📄
recordmcount.pl
(17.5 KB)
📁
rt-tester
📁
selinux
📄
setlocalversion
(3.94 KB)
📄
show_delta
(2.98 KB)
📄
sign-file
(12.16 KB)
📄
sortextable
(14.24 KB)
📄
sortextable.c
(7.41 KB)
📄
sortextable.h
(5.48 KB)
📄
tags.sh
(9.87 KB)
📁
tracing
📄
unifdef
(26.39 KB)
📄
unifdef.c
(34.8 KB)
📄
ver_linux
(3.09 KB)
📄
xz_wrap.sh
(562 B)
Editing: headerdep.pl
#! /usr/bin/perl # # Detect cycles in the header file dependency graph # Vegard Nossum <vegardno@ifi.uio.no> # use strict; use warnings; 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 @queue = @_; while(@queue) { my $header = pop @queue; next if exists $deps{$header}; $deps{$header} = [] unless exists $deps{$header}; my $path = search($header); next unless $path; open(my $file, '<', $path) or die($!); chomp(my @lines = <$file>); close($file); for my $i (0 .. $#lines) { my $line = $lines[$i]; if(my($dep) = ($line =~ m/^#\s*include\s*<(.*?)>/)) { push @queue, $dep; push @{$deps{$header}}, [$i + 1, $dep]; } } } } sub print_cycle { # $cycle[n] includes $cycle[n + 1]; # $cycle[-1] will be the culprit my $cycle = shift; # Adjust the line numbers for my $i (0 .. $#$cycle - 1) { $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", $msg, $last->[1] if defined $last; for my $header (reverse @$cycle) { printf "%s from %s:%d%s\n", " " x length $msg, $header->[1], $header->[0], $header->[1] eq $last->[1] ? ' <-- here' : ''; } printf "%s:%d: warning: recursive header inclusion\n", $first->[1], $first->[0]; } # Find and print the smallest cycle starting in the specified node. sub detect_cycles { my @queue = map { [[0, $_]] } @_; while(@queue) { my $top = pop @queue; my $name = $top->[-1]->[1]; for my $dep (@{$deps{$name}}) { my $chain = [@$top, [$dep->[0], $dep->[1]]]; # If the dep already exists in the chain, we have a # cycle... if(grep { $_->[1] eq $dep->[1] } @$top) { print_cycle($chain); next if $opt_all; return; } push @queue, $chain; } } } sub mangle { $_ = shift; s/\//__/g; s/\./_/g; s/-/_/g; $_; } # Output dependency graph in GraphViz language. sub graph { print "digraph {\n"; print "\t/* vertices */\n"; for my $header (keys %deps) { printf "\t%s [label=\"%s\"];\n", mangle($header), $header; } print "\n"; print "\t/* edges */\n"; for my $header (keys %deps) { for my $dep (@{$deps{$header}}) { printf "\t%s -> %s;\n", mangle($header), mangle($dep->[1]); } } print "}\n"; }
Upload File
Create Folder