225 lines
7.5 KiB
Ruby
Raw Normal View History

# frozen_string_literal: true
require "formula"
require "ostruct"
2019-04-17 18:25:08 +09:00
require "cli/parser"
require "cask/caskroom"
require "dependencies_helpers"
module Homebrew
extend DependenciesHelpers
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
2019-08-06 14:17:17 -04:00
`deps` [<options>] [<formula>]
2019-01-23 08:34:24 +05:30
Show dependencies for <formula>. Additional options specific to <formula>
may be appended to the command. When given multiple formula arguments,
show the intersection of dependencies for each formula.
2019-01-23 08:34:24 +05:30
EOS
switch "-n",
description: "Sort dependencies in topological order."
switch "--1",
2019-04-30 08:44:35 +01:00
description: "Only show dependencies one level down, instead of recursing."
2019-01-23 08:34:24 +05:30
switch "--union",
2019-04-30 08:44:35 +01:00
description: "Show the union of dependencies for multiple <formula>, instead of the intersection."
2019-01-23 08:34:24 +05:30
switch "--full-name",
2019-04-30 08:44:35 +01:00
description: "List dependencies by their full name."
2019-01-23 08:34:24 +05:30
switch "--include-build",
2019-04-30 08:44:35 +01:00
description: "Include `:build` dependencies for <formula>."
2019-01-23 08:34:24 +05:30
switch "--include-optional",
2019-04-30 08:44:35 +01:00
description: "Include `:optional` dependencies for <formula>."
2019-01-23 08:34:24 +05:30
switch "--include-test",
2019-04-30 08:44:35 +01:00
description: "Include `:test` dependencies for <formula> (non-recursive)."
2019-01-23 08:34:24 +05:30
switch "--skip-recommended",
2019-04-30 08:44:35 +01:00
description: "Skip `:recommended` dependencies for <formula>."
2019-01-23 08:34:24 +05:30
switch "--include-requirements",
2019-04-30 08:44:35 +01:00
description: "Include requirements in addition to dependencies for <formula>."
2019-01-23 08:34:24 +05:30
switch "--tree",
2019-04-30 08:44:35 +01:00
description: "Show dependencies as a tree. When given multiple formula arguments, "\
"show individual trees for each formula."
2019-03-06 23:44:46 -05:00
switch "--annotate",
2019-04-30 08:44:35 +01:00
description: "Mark any build, test, optional, or recommended dependencies as "\
"such in the output."
switch "--installed",
2019-04-30 08:44:35 +01:00
description: "List dependencies for formulae that are currently installed. If <formula> is "\
"specified, list only its dependencies that are currently installed."
switch "--all",
2019-04-30 08:44:35 +01:00
description: "List dependencies for all available formulae."
2019-01-23 08:34:24 +05:30
switch "--for-each",
2019-04-30 08:44:35 +01:00
description: "Switch into the mode used by the `--all` option, but only list dependencies "\
"for each provided <formula>, one formula per line. This is used for "\
2019-04-30 08:44:35 +01:00
"debugging the `--installed`/`--all` display mode."
2020-07-30 18:40:10 +02:00
conflicts "--installed", "--all"
formula_options
2019-01-23 08:34:24 +05:30
end
end
def deps
2020-07-30 18:40:10 +02:00
args = deps_args.parse
2019-11-06 10:20:33 +00:00
Formulary.enable_factory_cache!
2019-11-06 10:20:20 +00:00
recursive = !args.send("1?")
installed = args.installed? || dependents(args.named.to_formulae_and_casks).all?(&:any_version_installed?)
@use_runtime_dependencies = installed && recursive &&
!args.tree? &&
!args.include_build? &&
!args.include_test? &&
!args.include_optional? &&
!args.skip_recommended?
2019-11-06 10:20:20 +00:00
if args.tree?
dependents = if args.named.present?
sorted_dependents(args.named.to_formulae_and_casks)
elsif args.installed?
sorted_dependents(Formula.installed + Cask::Caskroom.casks)
2017-08-03 00:41:51 -04:00
else
raise FormulaUnspecifiedError
2017-08-03 00:41:51 -04:00
end
2020-08-19 17:12:32 +01:00
puts_deps_tree dependents, recursive: recursive, args: args
return
2019-11-06 10:20:20 +00:00
elsif args.all?
2020-08-19 17:12:32 +01:00
puts_deps sorted_dependents(Formula.to_a + Cask::Cask.to_a), recursive: recursive, args: args
return
elsif !args.no_named? && args.for_each?
puts_deps sorted_dependents(args.named.to_formulae_and_casks), recursive: recursive, args: args
return
end
if args.no_named?
2019-11-06 10:20:20 +00:00
raise FormulaUnspecifiedError unless args.installed?
2018-09-17 02:45:00 +02:00
2020-08-19 17:12:32 +01:00
puts_deps sorted_dependents(Formula.installed + Cask::Caskroom.casks), recursive: recursive, args: args
return
end
dependents = dependents(args.named.to_formulae_and_casks)
2020-08-19 17:12:32 +01:00
all_deps = deps_for_dependents(dependents, recursive: recursive, args: args, &(args.union? ? :| : :&))
2020-08-01 12:52:37 -04:00
condense_requirements(all_deps, args: args)
all_deps.map! { |d| dep_display_name(d, args: args) }
all_deps.uniq!
2019-11-06 10:20:20 +00:00
all_deps.sort! unless args.n?
puts all_deps
end
def sorted_dependents(formulae_or_casks)
dependents(formulae_or_casks).sort_by(&:name)
end
2020-08-01 12:52:37 -04:00
def condense_requirements(deps, args:)
deps.select! { |dep| dep.is_a?(Dependency) } unless args.include_requirements?
deps.select! { |dep| dep.is_a?(Requirement) || dep.installed? } if args.installed?
2017-08-03 00:41:51 -04:00
end
def dep_display_name(dep, args:)
2017-08-03 00:41:51 -04:00
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?
2019-03-06 23:44:46 -05:00
str = "#{str} " if args.tree?
str = "#{str} [build]" if dep.build?
str = "#{str} [test]" if dep.test?
str = "#{str} [optional]" if dep.optional?
str = "#{str} [recommended]" if dep.recommended?
2017-08-03 00:41:51 -04:00
end
2017-08-03 00:41:51 -04:00
str
end
2020-08-19 17:12:32 +01:00
def deps_for_dependent(d, recursive: false, args:)
includes, ignores = args_includes_ignores(args)
deps = d.runtime_dependencies if @use_runtime_dependencies
if recursive
deps ||= recursive_includes(Dependency, d, includes, ignores)
reqs = recursive_includes(Requirement, d, includes, ignores)
else
deps ||= reject_ignores(d.deps, ignores, includes)
reqs = reject_ignores(d.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
2020-08-19 17:12:32 +01:00
def deps_for_dependents(dependents, recursive: false, args:, &block)
dependents.map { |d| deps_for_dependent(d, recursive: recursive, args: args) }.reduce(&block)
2013-06-22 12:54:45 -05:00
end
2020-08-19 17:12:32 +01:00
def puts_deps(dependents, recursive: false, args:)
dependents.each do |dependent|
2020-08-19 17:12:32 +01:00
deps = deps_for_dependent(dependent, recursive: recursive, args: args)
2020-08-01 12:52:37 -04:00
condense_requirements(deps, args: args)
deps.sort_by!(&:name)
deps.map! { |d| dep_display_name(d, args: args) }
puts "#{dependent.full_name}: #{deps.join(" ")}"
end
2013-06-22 12:54:45 -05:00
end
2020-08-19 17:12:32 +01:00
def puts_deps_tree(dependents, recursive: false, args:)
dependents.each do |d|
puts d.full_name
2017-08-03 00:41:51 -04:00
@dep_stack = []
recursive_deps_tree(d, "", recursive, args: args)
2013-06-22 12:54:45 -05:00
puts
end
end
def recursive_deps_tree(f, prefix, recursive, args:)
includes, ignores = args_includes_ignores(args)
dependables = @use_runtime_dependencies ? f.runtime_dependencies : f.deps
deps = reject_ignores(dependables, ignores, includes)
reqs = reject_ignores(f.requirements, ignores, includes)
2017-08-03 00:41:51 -04:00
dependables = reqs + deps
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
display_s = "#{tree_lines} #{dep_display_name(dep, args: args)}"
2017-08-03 00:41:51 -04:00
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
if dep.is_a? Dependency
recursive_deps_tree(Formulary.factory(dep.name), prefix + prefix_addition, true, args: args)
end
end
2017-08-03 00:41:51 -04:00
@dep_stack.pop
end
end