brew/Library/Homebrew/dependency.rb

265 lines
7.1 KiB
Ruby
Raw Normal View History

# typed: true
# frozen_string_literal: true
require "dependable"
# A dependency on another Homebrew formula.
#
# @api private
class Dependency
extend Forwardable
include Dependable
extend Cachable
2023-06-19 04:37:55 +01:00
attr_reader :name, :env_proc, :option_names, :tap
2019-04-19 21:46:20 +09:00
DEFAULT_ENV_PROC = proc {}.freeze
private_constant :DEFAULT_ENV_PROC
2023-06-19 04:37:55 +01:00
def initialize(name, tags = [], env_proc = DEFAULT_ENV_PROC, option_names = [name&.split("/")&.last])
raise ArgumentError, "Dependency must have a name!" unless name
@name = name
@tags = tags
@env_proc = env_proc
@option_names = option_names
2023-06-19 04:37:55 +01:00
@tap = Tap.fetch(Regexp.last_match(1), Regexp.last_match(2)) if name =~ HOMEBREW_TAP_FORMULA_REGEX
end
def to_s
name
end
def ==(other)
2014-11-21 16:08:37 -06:00
instance_of?(other.class) && name == other.name && tags == other.tags
end
2016-09-23 18:13:48 +02:00
alias eql? ==
def hash
2022-04-23 01:48:15 +01:00
[name, tags].hash
end
def to_formula
formula = Formulary.factory(name)
formula.build = BuildOptions.new(options, formula.options)
formula
end
def installed?
to_formula.latest_version_installed?
2023-06-19 04:37:55 +01:00
rescue FormulaUnavailableError
false
end
2023-05-16 18:45:37 -05:00
def satisfied?(inherited_options = [])
installed? && missing_options(inherited_options).empty?
end
2014-08-23 22:41:35 -05:00
def missing_options(inherited_options)
formula = to_formula
required = options
required |= inherited_options
required &= formula.options.to_a
required -= Tab.for_formula(formula).used_options
required
end
def modify_build_environment
2017-09-24 19:24:46 +01:00
env_proc&.call
end
sig { overridable.returns(T::Boolean) }
def uses_from_macos?
false
end
2020-10-20 12:03:48 +02:00
sig { returns(String) }
2013-06-07 20:36:13 -05:00
def inspect
"#<#{self.class.name}: #{name.inspect} #{tags.inspect}>"
2013-06-07 20:36:13 -05:00
end
# Define marshaling semantics because we cannot serialize @env_proc.
def _dump(*)
Marshal.dump([name, tags])
end
def self._load(marshaled)
new(*Marshal.load(marshaled)) # rubocop:disable Security/MarshalLoad
end
sig { params(formula: Formula).returns(T.self_type) }
def dup_with_formula_name(formula)
self.class.new(formula.full_name.to_s, tags, env_proc, option_names)
end
2013-05-10 23:45:05 -05:00
class << self
# Expand the dependencies of each dependent recursively, optionally yielding
# `[dependent, dep]` pairs to allow callers to apply arbitrary filters to
2013-05-10 23:45:05 -05:00
# the list.
# The default filter, which is applied when a block is not given, omits
# optionals and recommendeds based on what the dependent has asked for
2022-06-14 15:03:55 -04:00
def expand(dependent, deps = dependent.deps, cache_key: nil, &block)
# Keep track dependencies to avoid infinite cyclic dependency recursion.
@expand_stack ||= []
@expand_stack.push dependent.name
if cache_key.present?
cache[cache_key] ||= {}
return cache[cache_key][cache_id dependent].dup if cache[cache_key][cache_id dependent]
end
expanded_deps = []
deps.each do |dep|
next if dependent.name == dep.name
2022-06-14 15:03:55 -04:00
case action(dependent, dep, &block)
2013-07-22 21:36:11 -05:00
when :prune
next
2013-07-22 21:36:11 -05:00
when :skip
next if @expand_stack.include? dep.name
2018-09-17 02:45:00 +02:00
2022-06-14 15:03:55 -04:00
expanded_deps.concat(expand(dep.to_formula, cache_key: cache_key, &block))
when :keep_but_prune_recursive_deps
expanded_deps << dep
2013-05-10 23:45:05 -05:00
else
next if @expand_stack.include? dep.name
2018-09-17 02:45:00 +02:00
dep_formula = dep.to_formula
expanded_deps.concat(expand(dep_formula, cache_key: cache_key, &block))
# Fixes names for renamed/aliased formulae.
dep = dep.dup_with_formula_name(dep_formula)
expanded_deps << dep
2013-05-10 23:45:05 -05:00
end
end
expanded_deps = merge_repeats(expanded_deps)
cache[cache_key][cache_id dependent] = expanded_deps.dup if cache_key.present?
expanded_deps
ensure
@expand_stack.pop
2013-05-10 23:45:05 -05:00
end
2022-06-14 15:03:55 -04:00
def action(dependent, dep, &block)
2013-07-22 21:36:11 -05:00
catch(:action) do
2020-11-16 22:18:56 +01:00
if block
yield dependent, dep
elsif dep.optional? || dep.recommended?
prune unless dependent.build.with?(dep)
end
end
2013-05-10 23:45:05 -05:00
end
# Prune a dependency and its dependencies recursively.
2020-10-20 12:03:48 +02:00
sig { void }
2013-05-10 23:45:05 -05:00
def prune
2013-07-22 21:36:11 -05:00
throw(:action, :prune)
end
# Prune a single dependency but do not prune its dependencies.
2020-10-20 12:03:48 +02:00
sig { void }
2013-07-22 21:36:11 -05:00
def skip
throw(:action, :skip)
2013-05-10 23:45:05 -05:00
end
# Keep a dependency, but prune its dependencies.
2020-10-20 12:03:48 +02:00
sig { void }
def keep_but_prune_recursive_deps
throw(:action, :keep_but_prune_recursive_deps)
end
2014-11-21 16:08:37 -06:00
def merge_repeats(all)
grouped = all.group_by(&:name)
all.map(&:name).uniq.map do |name|
deps = grouped.fetch(name)
2014-11-21 16:08:37 -06:00
dep = deps.first
tags = merge_tags(deps)
option_names = deps.flat_map(&:option_names).uniq
kwargs = {}
kwargs[:bounds] = dep.bounds if dep.uses_from_macos?
# TODO: simpify to just **kwargs when we require Ruby >= 2.7
if kwargs.empty?
dep.class.new(name, tags, dep.env_proc, option_names)
else
dep.class.new(name, tags, dep.env_proc, option_names, **kwargs)
end
end
end
private
def cache_id(dependent)
"#{dependent.full_name}_#{dependent.class}"
end
def merge_tags(deps)
other_tags = deps.flat_map(&:option_tags).uniq
other_tags << :test if deps.flat_map(&:tags).include?(:test)
merge_necessity(deps) + merge_temporality(deps) + other_tags
end
def merge_necessity(deps)
# Cannot use `deps.any?(&:required?)` here due to its definition.
if deps.any? { |dep| !dep.recommended? && !dep.optional? }
[] # Means required dependency.
elsif deps.any?(&:recommended?)
[:recommended]
else # deps.all?(&:optional?)
[:optional]
end
end
def merge_temporality(deps)
new_tags = []
new_tags << :build if deps.all?(&:build?)
new_tags << :implicit if deps.all?(&:implicit?)
new_tags
end
end
end
# A dependency that marked as "installed" on macOS
class UsesFromMacOSDependency < Dependency
attr_reader :bounds
def initialize(name, tags = [], env_proc = DEFAULT_ENV_PROC, option_names = [name], bounds:)
super(name, tags, env_proc, option_names)
@bounds = bounds
end
def installed?
use_macos_install? || super
end
sig { returns(T::Boolean) }
def use_macos_install?
# Check whether macOS is new enough for dependency to not be required.
if Homebrew::SimulateSystem.simulating_or_running_on_macos?
# Assume the oldest macOS version when simulating a generic macOS version
return true if Homebrew::SimulateSystem.current_os == :macos && !bounds.key?(:since)
if Homebrew::SimulateSystem.current_os != :macos
current_os = MacOSVersion.from_symbol(Homebrew::SimulateSystem.current_os)
since_os = MacOSVersion.from_symbol(bounds[:since]) if bounds.key?(:since)
return true if current_os >= since_os
end
end
false
end
sig { override.returns(T::Boolean) }
def uses_from_macos?
true
end
sig { override.params(formula: Formula).returns(T.self_type) }
def dup_with_formula_name(formula)
self.class.new(formula.full_name.to_s, tags, env_proc, option_names, bounds: bounds)
end
end