211 lines
6.3 KiB
Ruby
Raw Normal View History

require "formula"
require "ostruct"
2019-01-23 08:34:24 +05:30
require "cli_parser"
module Homebrew
2016-09-26 01:44:51 +02:00
module_function
2019-01-23 08:34:24 +05:30
def deps_args
Homebrew::CLI::Parser.new do
usage_banner <<~EOS
`deps` [<options>] <formula>
2019-01-23 08:34:24 +05:30
Show dependencies for <formula>. When given multiple formula arguments,
show the intersection of dependencies for <formula>.
2019-01-23 08:34:24 +05:30
EOS
switch "--1",
description: "Only show dependencies one level down, instead of recursing."
switch "-n",
description: "Show dependencies in topological order."
switch "--union",
description: "Show the union of dependencies for <formula>, instead of the intersection."
2019-01-23 08:34:24 +05:30
switch "--full-name",
description: "List dependencies by their full name."
switch "--installed",
description: "Only list those dependencies that are currently installed."
switch "--all",
description: "List all the dependencies for all available formulae."
2019-01-23 08:34:24 +05:30
switch "--include-build",
description: "Show `:build` type dependencies for <formula>."
2019-01-23 08:34:24 +05:30
switch "--include-optional",
description: "Show `:optional` dependencies for <formula>."
2019-01-23 08:34:24 +05:30
switch "--include-test",
description: "Show `:test` dependencies for <formula> (non-recursive)."
2019-01-23 08:34:24 +05:30
switch "--skip-recommended",
description: "Skip `:recommended` type dependencies for <formula>."
2019-01-23 08:34:24 +05:30
switch "--include-requirements",
description: "Include requirements in addition to dependencies for <formula>."
2019-01-23 08:34:24 +05:30
switch "--tree",
description: "Show dependencies as a tree. When given multiple formula arguments "\
"output individual trees for every formula."
switch "--for-each",
description: "Switch into the mode used by `deps --all`, but only list dependencies "\
"for specified formula one specified formula per line. This is used for "\
"debugging the `--installed`/`--all` display mode."
switch :verbose
switch :debug
conflicts "--installed", "--all"
formula_options
2019-01-23 08:34:24 +05:30
end
end
def deps
2019-01-23 08:34:24 +05:30
deps_args.parse
mode = OpenStruct.new(
2019-01-23 08:34:24 +05:30
installed?: args.installed?,
tree?: args.tree?,
all?: args.all?,
topo_order?: args.n?,
union?: args.union?,
for_each?: args.for_each?,
)
2017-08-03 00:41:51 -04:00
if mode.tree?
if mode.installed?
2019-01-23 08:34:24 +05:30
puts_deps_tree Formula.installed.sort, !args.send("1?")
2017-08-03 00:41:51 -04:00
else
2019-01-23 08:34:24 +05:30
raise FormulaUnspecifiedError if args.remaining.empty?
2018-09-17 02:45:00 +02:00
2019-01-23 08:34:24 +05:30
puts_deps_tree ARGV.formulae, !args.send("1?")
2017-08-03 00:41:51 -04:00
end
return
elsif mode.all?
puts_deps Formula.sort
return
2019-01-23 08:34:24 +05:30
elsif !args.remaining.empty? && mode.for_each?
puts_deps ARGV.formulae
return
end
2019-01-23 08:34:24 +05:30
@only_installed_arg = args.installed? &&
!args.include_build? &&
!args.include_test? &&
!args.include_optional? &&
!args.skip_recommended?
2019-01-23 08:34:24 +05:30
if args.remaining.empty?
raise FormulaUnspecifiedError unless mode.installed?
2018-09-17 02:45:00 +02:00
puts_deps Formula.installed.sort
return
end
2019-01-23 08:34:24 +05:30
all_deps = deps_for_formulae(ARGV.formulae, !args.send("1?"), &(mode.union? ? :| : :&))
all_deps = condense_requirements(all_deps)
all_deps.select!(&:installed?) if mode.installed?
all_deps.map!(&method(:dep_display_name))
all_deps.uniq!
all_deps.sort! unless mode.topo_order?
puts all_deps
end
2017-08-03 00:41:51 -04:00
def condense_requirements(deps)
2019-01-23 08:34:24 +05:30
return deps if args.include_requirements?
2018-09-17 02:45:00 +02:00
deps.select { |dep| dep.is_a? Dependency }
2017-08-03 00:41:51 -04:00
end
def dep_display_name(dep)
str = if dep.is_a? Requirement
2019-01-23 08:34:24 +05:30
if args.include_requirements?
":#{dep.display_s}"
2017-08-03 00:41:51 -04:00
else
# This shouldn't happen, but we'll put something here to help debugging
"::#{dep.name}"
end
2019-01-23 08:34:24 +05:30
elsif args.full_name?
dep.to_formula.full_name
2017-08-03 00:41:51 -04:00
else
dep.name
2017-08-03 00:41:51 -04:00
end
2019-01-23 08:34:24 +05:30
if args.annotate?
2017-08-03 00:41:51 -04:00
str = "#{str} [build]" if dep.build?
str = "#{str} [test]" if dep.test?
str = "#{str} [optional]" if dep.optional?
2017-08-03 00:41:51 -04:00
str = "#{str} [recommended]" if dep.recommended?
end
2017-08-03 00:41:51 -04:00
str
end
def deps_for_formula(f, recursive = false)
includes, ignores = argv_includes_ignores(ARGV)
deps = f.runtime_dependencies if @only_installed_arg
if recursive
deps ||= recursive_includes(Dependency, f, includes, ignores)
reqs = recursive_includes(Requirement, f, includes, ignores)
else
deps ||= reject_ignores(f.deps, ignores, includes)
reqs = reject_ignores(f.requirements, ignores, includes)
end
2014-02-27 12:56:42 -06:00
2017-08-03 00:41:51 -04:00
deps + reqs.to_a
end
def deps_for_formulae(formulae, recursive = false, &block)
formulae.map { |f| deps_for_formula(f, recursive) }.reduce(&block)
2013-06-22 12:54:45 -05:00
end
2013-06-22 12:54:45 -05:00
def puts_deps(formulae)
formulae.each do |f|
2017-08-03 00:41:51 -04:00
deps = deps_for_formula(f)
deps = condense_requirements(deps)
deps.sort_by!(&:name)
deps.map!(&method(:dep_display_name))
puts "#{f.full_name}: #{deps.join(" ")}"
end
2013-06-22 12:54:45 -05:00
end
2017-08-03 00:41:51 -04:00
def puts_deps_tree(formulae, recursive = false)
2013-06-22 12:54:45 -05:00
formulae.each do |f|
2017-08-03 00:41:51 -04:00
puts f.full_name
@dep_stack = []
recursive_deps_tree(f, "", recursive)
2013-06-22 12:54:45 -05:00
puts
end
end
2017-08-03 00:41:51 -04:00
def recursive_deps_tree(f, prefix, recursive)
reqs = f.requirements
deps = f.deps
dependables = reqs + deps
2019-01-23 08:34:24 +05:30
dependables.reject!(&:optional?) unless args.include_optional?
dependables.reject!(&:build?) unless args.include_build?
dependables.reject!(&:test?) unless args.include_test?
dependables.reject!(&:recommended?) if args.skip_recommended?
2017-08-03 00:41:51 -04:00
max = dependables.length - 1
@dep_stack.push f.name
dependables.each_with_index do |dep, i|
2019-01-23 08:34:24 +05:30
next if !args.include_requirements? && dep.is_a?(Requirement)
2017-08-03 00:41:51 -04:00
tree_lines = if i == max
"└──"
else
"├──"
end
2017-08-03 00:41:51 -04:00
display_s = "#{tree_lines} #{dep_display_name(dep)}"
is_circular = @dep_stack.include?(dep.name)
display_s = "#{display_s} (CIRCULAR DEPENDENCY)" if is_circular
puts "#{prefix}#{display_s}"
2017-08-03 00:41:51 -04:00
next if !recursive || is_circular
2017-08-03 00:41:51 -04:00
prefix_addition = if i == max
" "
else
2017-08-03 00:41:51 -04:00
""
end
2017-08-03 00:41:51 -04:00
if dep.is_a? Dependency
recursive_deps_tree(Formulary.factory(dep.name), prefix + prefix_addition, true)
end
end
2017-08-03 00:41:51 -04:00
@dep_stack.pop
end
end