mirror of
https://github.com/apple/swift.git
synced 2025-12-14 20:36:38 +01:00
1173 lines
51 KiB
Swift
1173 lines
51 KiB
Swift
//===--- ClosureSpecialization.swift ---------------------------===//
|
|
//
|
|
// This source file is part of the Swift.org open source project
|
|
//
|
|
// Copyright (c) 2014 - 2023 Apple Inc. and the Swift project authors
|
|
// Licensed under Apache License v2.0 with Runtime Library Exception
|
|
//
|
|
// See https://swift.org/LICENSE.txt for license information
|
|
// See https://swift.org/CONTRIBUTORS.txt for the list of Swift project authors
|
|
//
|
|
//===-----------------------------------------------------------------------===//
|
|
|
|
/// This file contains the closure-specialization optimizations for general and differentiable Swift.
|
|
|
|
/// General Closure Specialization
|
|
/// ------------------------------------
|
|
/// TODO: Add description when the functionality is added.
|
|
|
|
/// AutoDiff Closure Specialization
|
|
/// -------------------------------
|
|
/// This optimization performs closure specialization tailored for the patterns seen in Swift Autodiff. In principle,
|
|
/// the optimization does the same thing as the existing closure specialization pass. However, it is tailored to the
|
|
/// patterns of Swift Autodiff.
|
|
///
|
|
/// The compiler performs reverse-mode differentiation on functions marked with `@differentiable(reverse)`. In doing so,
|
|
/// it generates corresponding VJP and Pullback functions, which perform the forward and reverse pass respectively. You
|
|
/// can think of VJPs as functions that "differentiate" an original function and Pullbacks as the calculated
|
|
/// "derivative" of the original function.
|
|
///
|
|
/// VJPs always return a tuple of 2 values -- the original result and the Pullback. Pullbacks are essentially a chain
|
|
/// of closures, where the closure-contexts are implicitly used as the so-called "tape" during the reverse
|
|
/// differentiation process. It is this chain of closures contained within the Pullbacks that this optimization aims
|
|
/// to optimize via closure specialization.
|
|
///
|
|
/// The code patterns that this optimization targets, look similar to the one below:
|
|
/// ``` swift
|
|
///
|
|
/// // Since `foo` is marked with the `differentiable(reverse)` attribute the compiler
|
|
/// // will generate corresponding VJP and Pullback functions in SIL. Let's assume that
|
|
/// // these functions are called `vjp_foo` and `pb_foo` respectively.
|
|
/// @differentiable(reverse)
|
|
/// func foo(_ x: Float) -> Float {
|
|
/// return sin(x)
|
|
/// }
|
|
///
|
|
/// //============== Before closure specialization ==============//
|
|
/// // VJP of `foo`. Returns the original result and the Pullback of `foo`.
|
|
/// sil @vjp_foo: $(Float) -> (originalResult: Float, pullback: (Float) -> Float) {
|
|
/// bb0(%0: $Float):
|
|
/// // __Inlined__ `vjp_sin`: It is important for all intermediate VJPs to have
|
|
/// // been inlined in `vjp_foo`, otherwise `vjp_foo` will not be able to determine
|
|
/// // that `pb_foo` is closing over other closures and no specialization will happen.
|
|
/// \
|
|
/// %originalResult = apply @sin(%0): $(Float) -> Float \__ Inlined `vjp_sin`
|
|
/// %partially_applied_pb_sin = partial_apply pb_sin(%0): $(Float) -> Float /
|
|
/// /
|
|
///
|
|
/// %pb_foo = function_ref @pb_foo: $@convention(thin) (Float, (Float) -> Float) -> Float
|
|
/// %partially_applied_pb_foo = partial_apply %pb_foo(%partially_applied_pb_sin): $(Float, (Float) -> Float) -> Float
|
|
///
|
|
/// return (%originalResult, %partially_applied_pb_foo)
|
|
/// }
|
|
///
|
|
/// // Pullback of `foo`.
|
|
/// //
|
|
/// // It receives what are called as intermediate closures that represent
|
|
/// // the calculations that the Pullback needs to perform to calculate a function's
|
|
/// // derivative.
|
|
/// //
|
|
/// // The intermediate closures may themselves contain intermediate closures and
|
|
/// // that is why the Pullback for a function differentiated at the "top" level
|
|
/// // may end up being a "chain" of closures.
|
|
/// sil @pb_foo: $(Float, (Float) -> Float) -> Float {
|
|
/// bb0(%0: $Float, %pb_sin: $(Float) -> Float):
|
|
/// %derivative_of_sin = apply %pb_sin(%0): $(Float) -> Float
|
|
/// return %derivative_of_sin: Float
|
|
/// }
|
|
///
|
|
/// //============== After closure specialization ==============//
|
|
/// sil @vjp_foo: $(Float) -> (originalResult: Float, pullback: (Float) -> Float) {
|
|
/// bb0(%0: $Float):
|
|
/// %originalResult = apply @sin(%0): $(Float) -> Float
|
|
///
|
|
/// // Before the optimization, pullback of `foo` used to take a closure for computing
|
|
/// // pullback of `sin`. Now, the specialized pullback of `foo` takes the arguments that
|
|
/// // pullback of `sin` used to close over and pullback of `sin` is instead copied over
|
|
/// // inside pullback of `foo`.
|
|
/// %specialized_pb_foo = function_ref @specialized_pb_foo: $@convention(thin) (Float, Float) -> Float
|
|
/// %partially_applied_pb_foo = partial_apply %specialized_pb_foo(%0): $(Float, Float) -> Float
|
|
///
|
|
/// return (%originalResult, %partially_applied_pb_foo)
|
|
/// }
|
|
///
|
|
/// sil @specialized_pb_foo: $(Float, Float) -> Float {
|
|
/// bb0(%0: $Float, %1: $Float):
|
|
/// %2 = partial_apply @pb_sin(%1): $(Float) -> Float
|
|
/// %3 = apply %2(): $() -> Float
|
|
/// return %3: $Float
|
|
/// }
|
|
/// ```
|
|
|
|
import SIL
|
|
|
|
private let verbose = false
|
|
|
|
private func log(_ message: @autoclosure () -> String) {
|
|
if verbose {
|
|
print("### \(message())")
|
|
}
|
|
}
|
|
|
|
// =========== Entry point =========== //
|
|
let generalClosureSpecialization = FunctionPass(name: "experimental-swift-based-closure-specialization") {
|
|
(function: Function, context: FunctionPassContext) in
|
|
// TODO: Implement general closure specialization optimization
|
|
print("NOT IMPLEMENTED")
|
|
}
|
|
|
|
let autodiffClosureSpecialization = FunctionPass(name: "autodiff-closure-specialization") {
|
|
(function: Function, context: FunctionPassContext) in
|
|
// TODO: Pass is a WIP and current implementation is incomplete
|
|
if !function.isAutodiffVJP {
|
|
return
|
|
}
|
|
}
|
|
|
|
// =========== Top-level functions ========== //
|
|
|
|
private let specializationLevelLimit = 2
|
|
|
|
private func gatherCallSites(in caller: Function, _ context: FunctionPassContext) -> [CallSite] {
|
|
/// __Root__ closures created via `partial_apply` or `thin_to_thick_function` may be converted and reabstracted
|
|
/// before finally being used at an apply site. We do not want to handle these intermediate closures separately
|
|
/// as they are handled and cloned into the specialized function as part of the root closures. Therefore, we keep
|
|
/// track of these intermediate closures in a set.
|
|
///
|
|
/// This set is populated via the `markConvertedAndReabstractedClosuresAsUsed` function which is called when we're
|
|
/// handling the different uses of our root closures.
|
|
///
|
|
/// Below SIL example illustrates the above point.
|
|
/// ```
|
|
/// // The below set of a "root" closure and its reabstractions/conversions
|
|
/// // will be handled as a unit and the entire set will be copied over
|
|
/// // in the specialized version of `takesClosure` if we determine that we
|
|
/// // can specialize `takesClosure` against its closure argument.
|
|
/// __
|
|
/// %someFunction = function_ref @someFunction: $@convention(thin) (Int, Int) -> Int \
|
|
/// %rootClosure = partial_apply [callee_guaranteed] %someFunction (%someInt): $(Int, Int) -> Int \
|
|
/// %thunk = function_ref @reabstractionThunk : $@convention(thin) (@callee_guaranteed (Int) -> Int) -> @out Int /
|
|
/// %reabstractedClosure = partial_apply [callee_guaranteed] %thunk(%rootClosure) : /
|
|
/// $@convention(thin) (@callee_guaranteed (Int) -> Int) -> @out Int __/
|
|
///
|
|
/// %takesClosure = function_ref @takesClosure : $@convention(thin) (@owned @callee_guaranteed (Int) -> @out Int) -> Int
|
|
/// %result = partial_apply %takesClosure(%reabstractedClosure) : $@convention(thin) (@owned @callee_guaranteed () -> @out Int) -> Int
|
|
/// ret %result
|
|
/// ```
|
|
var convertedAndReabstractedClosures = InstructionSet(context)
|
|
|
|
defer {
|
|
convertedAndReabstractedClosures.deinitialize()
|
|
}
|
|
|
|
var callSiteMap = CallSiteMap()
|
|
|
|
for inst in caller.instructions {
|
|
if !convertedAndReabstractedClosures.contains(inst),
|
|
let rootClosure = inst.asSupportedClosure
|
|
{
|
|
updateCallSites(for: rootClosure, in: &callSiteMap,
|
|
convertedAndReabstractedClosures: &convertedAndReabstractedClosures, context)
|
|
}
|
|
}
|
|
|
|
return callSiteMap.callSites
|
|
}
|
|
|
|
private func getOrCreateSpecializedFunction(basedOn callSite: CallSite, _ context: FunctionPassContext)
|
|
-> (function: Function, alreadyExists: Bool)
|
|
{
|
|
let specializedFunctionName = callSite.specializedCalleeName(context)
|
|
if let specializedFunction = context.lookupFunction(name: specializedFunctionName) {
|
|
return (specializedFunction, true)
|
|
}
|
|
|
|
let applySiteCallee = callSite.applyCallee
|
|
let specializedParameters = applySiteCallee.convention.getSpecializedParameters(basedOn: callSite)
|
|
|
|
let specializedFunction =
|
|
context.createFunctionForClosureSpecialization(from: applySiteCallee, withName: specializedFunctionName,
|
|
withParams: specializedParameters,
|
|
withSerialization: applySiteCallee.isSerialized)
|
|
|
|
context.buildSpecializedFunction(specializedFunction: specializedFunction,
|
|
buildFn: { (emptySpecializedFunction, functionPassContext) in
|
|
let closureSpecCloner = SpecializationCloner(emptySpecializedFunction: emptySpecializedFunction, functionPassContext)
|
|
closureSpecCloner.cloneAndSpecializeFunctionBody(using: callSite)
|
|
})
|
|
|
|
return (specializedFunction, false)
|
|
}
|
|
|
|
private func rewriteApplyInstruction(in caller: Function, _ context: FunctionPassContext) {
|
|
fatalError("Not implemented")
|
|
}
|
|
|
|
// ===================== Utility functions and extensions ===================== //
|
|
|
|
private func updateCallSites(for rootClosure: SingleValueInstruction, in callSiteMap: inout CallSiteMap,
|
|
convertedAndReabstractedClosures: inout InstructionSet, _ context: FunctionPassContext) {
|
|
var rootClosurePossibleLifeRange = InstructionRange(begin: rootClosure, context)
|
|
defer {
|
|
rootClosurePossibleLifeRange.deinitialize()
|
|
}
|
|
|
|
var rootClosureApplies = OperandWorklist(context)
|
|
defer {
|
|
rootClosureApplies.deinitialize()
|
|
}
|
|
|
|
// A "root" closure undergoing conversions and/or reabstractions has additional restrictions placed upon it, in order
|
|
// for a call site to be specialized against it. We handle conversion/reabstraction uses before we handle apply uses
|
|
// to gather the parameters required to evaluate these restrictions or to skip call site uses of "unsupported"
|
|
// closures altogether.
|
|
//
|
|
// There are currently 2 restrictions that are evaluated prior to specializing a callsite against a converted and/or
|
|
// reabstracted closure -
|
|
// 1. A reabstracted root closure can only be specialized against, if the reabstracted closure is ultimately passed
|
|
// trivially (as a noescape+thick function) into the call site.
|
|
//
|
|
// 2. A root closure may be a partial_apply [stack], in which case we need to make sure that all mark_dependence
|
|
// bases for it will be available in the specialized callee in case the call site is specialized against this root
|
|
// closure.
|
|
|
|
let (foundUnexpectedUse, haveUsedReabstraction) =
|
|
handleNonApplies(for: rootClosure, rootClosureApplies: &rootClosureApplies,
|
|
rootClosurePossibleLifeRange: &rootClosurePossibleLifeRange, context);
|
|
|
|
|
|
if foundUnexpectedUse {
|
|
return
|
|
}
|
|
|
|
let intermediateClosureArgDescriptorData =
|
|
handleApplies(for: rootClosure, callSiteMap: &callSiteMap, rootClosureApplies: &rootClosureApplies,
|
|
rootClosurePossibleLifeRange: &rootClosurePossibleLifeRange,
|
|
convertedAndReabstractedClosures: &convertedAndReabstractedClosures,
|
|
haveUsedReabstraction: haveUsedReabstraction, context)
|
|
|
|
finalizeCallSites(for: rootClosure, in: &callSiteMap,
|
|
rootClosurePossibleLifeRange: rootClosurePossibleLifeRange,
|
|
intermediateClosureArgDescriptorData: intermediateClosureArgDescriptorData, context)
|
|
}
|
|
|
|
/// Handles all non-apply direct and transitive uses of `rootClosure`.
|
|
///
|
|
/// Returns:
|
|
/// haveUsedReabstraction - whether the root closure is reabstracted via a thunk
|
|
/// foundUnexpectedUse - whether the root closure is directly or transitively used in an instruction that we don't know
|
|
/// how to handle. If true, then `rootClosure` should not be specialized against.
|
|
private func handleNonApplies(for rootClosure: SingleValueInstruction,
|
|
rootClosureApplies: inout OperandWorklist,
|
|
rootClosurePossibleLifeRange: inout InstructionRange,
|
|
_ context: FunctionPassContext)
|
|
-> (foundUnexpectedUse: Bool, haveUsedReabstraction: Bool)
|
|
{
|
|
var foundUnexpectedUse = false
|
|
var haveUsedReabstraction = false
|
|
|
|
/// The root closure or an intermediate closure created by reabstracting the root closure may be a `partial_apply
|
|
/// [stack]` and we need to make sure that all `mark_dependence` bases for this `onStack` closure will be available in
|
|
/// the specialized callee, in case the call site is specialized against this root closure.
|
|
///
|
|
/// `possibleMarkDependenceBases` keeps track of all potential values that may be used as bases for creating
|
|
/// `mark_dependence`s for our `onStack` root/reabstracted closures. For root closures these values are non-trivial
|
|
/// closure captures (which are always available as function arguments in the specialized callee). For reabstracted
|
|
/// closures these values may be the root closure or its conversions (below is a short SIL example representing this
|
|
/// case).
|
|
/// ```
|
|
/// %someFunction = function_ref @someFunction : $@convention(thin) (Int) -> Int
|
|
/// %rootClosure = partial_apply [callee_guaranteed] %someFunction(%someInt) : $@convention(thin) (Int) -> Int
|
|
/// %noescapeRootClosure = convert_escape_to_noescape %rootClosure : $@callee_guaranteed () -> Int to $@noescape @callee_guaranteed () -> Int
|
|
/// %thunk = function_ref @reabstractionThunk : $@convention(thin) (@noescape @callee_guaranteed () -> Int) -> @out Int
|
|
/// %thunkedRootClosure = partial_apply [callee_guaranteed] [on_stack] %thunk(%noescapeRootClosure) : $@convention(thin) (@noescape @callee_guaranteed () -> Int) -> @out Int
|
|
/// %dependency = mark_dependence %thunkedRootClosure : $@noescape @callee_guaranteed () -> @out Int on %noescapeClosure : $@noescape @callee_guaranteed () -> Int
|
|
/// %takesClosure = function_ref @takesClosure : $@convention(thin) (@owned @noescape @callee_guaranteed () -> @out Int)
|
|
/// %ret = apply %takesClosure(%dependency) : $@convention(thin) (@owned @noescape @callee_guaranteed () -> @out Int)
|
|
/// ```
|
|
///
|
|
/// Any value outside of the aforementioned values is not going to be available in the specialized callee and a
|
|
/// `mark_dependence` of the root closure on such a value means that we cannot specialize the call site against it.
|
|
var possibleMarkDependenceBases = ValueSet(context)
|
|
defer {
|
|
possibleMarkDependenceBases.deinitialize()
|
|
}
|
|
|
|
var rootClosureConversionsAndReabstractions = OperandWorklist(context)
|
|
rootClosureConversionsAndReabstractions.pushIfNotVisited(contentsOf: rootClosure.uses)
|
|
defer {
|
|
rootClosureConversionsAndReabstractions.deinitialize()
|
|
}
|
|
|
|
if let pai = rootClosure as? PartialApplyInst {
|
|
for arg in pai.arguments {
|
|
possibleMarkDependenceBases.insert(arg)
|
|
}
|
|
}
|
|
|
|
while let use = rootClosureConversionsAndReabstractions.pop() {
|
|
switch use.instruction {
|
|
case let cfi as ConvertFunctionInst:
|
|
rootClosureConversionsAndReabstractions.pushIfNotVisited(contentsOf: cfi.uses)
|
|
possibleMarkDependenceBases.insert(cfi)
|
|
rootClosurePossibleLifeRange.insert(use.instruction)
|
|
|
|
case let cvt as ConvertEscapeToNoEscapeInst:
|
|
rootClosureConversionsAndReabstractions.pushIfNotVisited(contentsOf: cvt.uses)
|
|
possibleMarkDependenceBases.insert(cvt)
|
|
rootClosurePossibleLifeRange.insert(use.instruction)
|
|
|
|
case let pai as PartialApplyInst:
|
|
if !pai.isPullbackInResultOfAutodiffVJP,
|
|
pai.isSupportedClosure,
|
|
pai.isPartialApplyOfThunk,
|
|
// Argument must be a closure
|
|
pai.arguments[0].type.isThickFunction
|
|
{
|
|
rootClosureConversionsAndReabstractions.pushIfNotVisited(contentsOf: pai.uses)
|
|
possibleMarkDependenceBases.insert(pai)
|
|
rootClosurePossibleLifeRange.insert(use.instruction)
|
|
haveUsedReabstraction = true
|
|
} else {
|
|
rootClosureApplies.pushIfNotVisited(use)
|
|
}
|
|
|
|
case let mv as MoveValueInst:
|
|
rootClosureConversionsAndReabstractions.pushIfNotVisited(contentsOf: mv.uses)
|
|
possibleMarkDependenceBases.insert(mv)
|
|
rootClosurePossibleLifeRange.insert(use.instruction)
|
|
|
|
// Uses of a copy of root-closure do not count as
|
|
// uses of the root-closure
|
|
case is CopyValueInst:
|
|
rootClosurePossibleLifeRange.insert(use.instruction)
|
|
|
|
case is DestroyValueInst:
|
|
rootClosurePossibleLifeRange.insert(use.instruction)
|
|
|
|
case let mdi as MarkDependenceInst:
|
|
if possibleMarkDependenceBases.contains(mdi.base),
|
|
mdi.value == use.value,
|
|
mdi.value.type.isNoEscapeFunction,
|
|
mdi.value.type.isThickFunction
|
|
{
|
|
rootClosureConversionsAndReabstractions.pushIfNotVisited(contentsOf: mdi.uses)
|
|
rootClosurePossibleLifeRange.insert(use.instruction)
|
|
}
|
|
|
|
default:
|
|
foundUnexpectedUse = true
|
|
log("Found unexpected direct or transitive user of root closure: \(use.instruction)")
|
|
return (foundUnexpectedUse, haveUsedReabstraction)
|
|
}
|
|
}
|
|
|
|
return (foundUnexpectedUse, haveUsedReabstraction)
|
|
}
|
|
|
|
private typealias IntermediateClosureArgDescriptorDatum = (applySite: SingleValueInstruction, closureArgIndex: Int, paramInfo: ParameterInfo)
|
|
|
|
private func handleApplies(for rootClosure: SingleValueInstruction, callSiteMap: inout CallSiteMap,
|
|
rootClosureApplies: inout OperandWorklist,
|
|
rootClosurePossibleLifeRange: inout InstructionRange,
|
|
convertedAndReabstractedClosures: inout InstructionSet, haveUsedReabstraction: Bool,
|
|
_ context: FunctionPassContext) -> [IntermediateClosureArgDescriptorDatum]
|
|
{
|
|
var intermediateClosureArgDescriptorData: [IntermediateClosureArgDescriptorDatum] = []
|
|
|
|
while let use = rootClosureApplies.pop() {
|
|
rootClosurePossibleLifeRange.insert(use.instruction)
|
|
|
|
// TODO [extend to general swift]: Handle full apply sites
|
|
guard let pai = use.instruction as? PartialApplyInst else {
|
|
continue
|
|
}
|
|
|
|
// TODO: Handling generic closures may be possible but is not yet implemented
|
|
if pai.hasSubstitutions || !pai.calleeIsDynamicFunctionRef || !pai.isPullbackInResultOfAutodiffVJP {
|
|
continue
|
|
}
|
|
|
|
guard let callee = pai.referencedFunction else {
|
|
continue
|
|
}
|
|
|
|
if callee.isAvailableExternally {
|
|
continue
|
|
}
|
|
|
|
// Don't specialize non-fragile (read as non-serialized) callees if the caller is fragile; the specialized callee
|
|
// will have shared linkage, and thus cannot be referenced from the fragile caller.
|
|
let caller = rootClosure.parentFunction
|
|
if caller.isSerialized && !callee.isSerialized {
|
|
continue
|
|
}
|
|
|
|
// If the callee uses a dynamic Self, we cannot specialize it, since the resulting specialization might no longer
|
|
// have 'self' as the last parameter.
|
|
//
|
|
// TODO: We could fix this by inserting new arguments more carefully, or changing how we model dynamic Self
|
|
// altogether.
|
|
if callee.mayBindDynamicSelf {
|
|
continue
|
|
}
|
|
|
|
// Proceed if the closure is passed as an argument (and not called). If it is called we have nothing to do.
|
|
//
|
|
// `closureArgumentIndex` is the index of the closure in the callee's argument list.
|
|
guard let closureArgumentIndex = pai.calleeArgumentIndex(of: use) else {
|
|
continue
|
|
}
|
|
|
|
// Ok, we know that we can perform the optimization but not whether or not the optimization is profitable. Check if
|
|
// the closure is actually called in the callee (or in a function called by the callee).
|
|
if !isClosureApplied(in: callee, closureArgIndex: closureArgumentIndex) {
|
|
continue
|
|
}
|
|
|
|
let onlyHaveThinToThickClosure = rootClosure is ThinToThickFunctionInst && !haveUsedReabstraction
|
|
|
|
guard let closureParamInfo = pai.operandConventions[parameter: use.index] else {
|
|
fatalError("While handling apply uses, parameter info not found for operand: \(use)!")
|
|
}
|
|
|
|
// If we are going to need to release the copied over closure, we must make sure that we understand all the exit
|
|
// blocks, i.e., they terminate with an instruction that clearly indicates whether to release the copied over
|
|
// closure or leak it.
|
|
if closureParamInfo.convention.isGuaranteed,
|
|
!onlyHaveThinToThickClosure,
|
|
!callee.blocks.allSatisfy({ $0.isReachableExitBlock || $0.terminator is UnreachableInst })
|
|
{
|
|
continue
|
|
}
|
|
|
|
// Functions with a readnone, readonly or releasenone effect and a nontrivial context cannot be specialized.
|
|
// Inserting a release in such a function results in miscompilation after other optimizations. For now, the
|
|
// specialization is disabled.
|
|
//
|
|
// TODO: A @noescape closure should never be converted to an @owned argument regardless of the function's effect
|
|
// attribute.
|
|
if !callee.effectAllowsSpecialization && !onlyHaveThinToThickClosure {
|
|
continue
|
|
}
|
|
|
|
// Avoid an infinite specialization loop caused by repeated runs of ClosureSpecializer and CapturePropagation.
|
|
// CapturePropagation propagates constant function-literals. Such function specializations can then be optimized
|
|
// again by the ClosureSpecializer and so on. This happens if a closure argument is called _and_ referenced in
|
|
// another closure, which is passed to a recursive call. E.g.
|
|
//
|
|
// func foo(_ c: @escaping () -> ()) {
|
|
// c() foo({ c() })
|
|
// }
|
|
//
|
|
// A limit of 2 is good enough and will not be exceed in "regular" optimization scenarios.
|
|
let closureCallee = rootClosure is PartialApplyInst
|
|
? (rootClosure as! PartialApplyInst).referencedFunction!
|
|
: (rootClosure as! ThinToThickFunctionInst).referencedFunction!
|
|
|
|
if closureCallee.specializationLevel > specializationLevelLimit {
|
|
continue
|
|
}
|
|
|
|
if haveUsedReabstraction {
|
|
markConvertedAndReabstractedClosuresAsUsed(rootClosure: rootClosure, convertedAndReabstractedClosure: use.value,
|
|
convertedAndReabstractedClosures: &convertedAndReabstractedClosures)
|
|
}
|
|
|
|
if callSiteMap[pai] == nil {
|
|
callSiteMap.insert(key: pai, value: CallSite(applySite: pai))
|
|
}
|
|
|
|
intermediateClosureArgDescriptorData
|
|
.append((applySite: pai, closureArgIndex: closureArgumentIndex, paramInfo: closureParamInfo))
|
|
}
|
|
|
|
return intermediateClosureArgDescriptorData
|
|
}
|
|
|
|
/// Finalizes the call sites for a given root closure by adding a corresponding `ClosureArgDescriptor`
|
|
/// to all call sites where the closure is ultimately passed as an argument.
|
|
private func finalizeCallSites(for rootClosure: SingleValueInstruction, in callSiteMap: inout CallSiteMap,
|
|
rootClosurePossibleLifeRange: InstructionRange,
|
|
intermediateClosureArgDescriptorData: [IntermediateClosureArgDescriptorDatum],
|
|
_ context: FunctionPassContext)
|
|
{
|
|
let closureInfo = ClosureInfo(closure: rootClosure, lifetimeFrontier: Array(rootClosurePossibleLifeRange.ends))
|
|
|
|
for (applySite, closureArgumentIndex, parameterInfo) in intermediateClosureArgDescriptorData {
|
|
guard var callSite = callSiteMap[applySite] else {
|
|
fatalError("While finalizing call sites, call site descriptor not found for call site: \(applySite)!")
|
|
}
|
|
let closureArgDesc = ClosureArgDescriptor(closureInfo: closureInfo, closureArgumentIndex: closureArgumentIndex,
|
|
parameterInfo: parameterInfo)
|
|
callSite.appendClosureArgDescriptor(closureArgDesc)
|
|
callSiteMap.update(key: applySite, value: callSite)
|
|
}
|
|
}
|
|
|
|
private func isClosureApplied(in callee: Function, closureArgIndex index: Int) -> Bool {
|
|
func inner(_ callee: Function, _ index: Int, _ handledFuncs: inout Set<Function>) -> Bool {
|
|
let closureArg = callee.argument(at: index)
|
|
|
|
for use in closureArg.uses {
|
|
if let fai = use.instruction as? FullApplySite {
|
|
if fai.callee == closureArg {
|
|
return true
|
|
}
|
|
|
|
if let faiCallee = fai.referencedFunction,
|
|
!faiCallee.blocks.isEmpty,
|
|
handledFuncs.insert(faiCallee).inserted,
|
|
handledFuncs.count <= recursionBudget
|
|
{
|
|
if inner(faiCallee, fai.calleeArgumentIndex(of: use)!, &handledFuncs) {
|
|
return true
|
|
}
|
|
}
|
|
}
|
|
}
|
|
|
|
return false
|
|
}
|
|
|
|
// Limit the number of recursive calls to not go into exponential behavior in corner cases.
|
|
let recursionBudget = 8
|
|
var handledFuncs: Set<Function> = []
|
|
return inner(callee, index, &handledFuncs)
|
|
}
|
|
|
|
/// Marks any converted/reabstracted closures, corresponding to a given root closure as used. We do not want to
|
|
/// look at such closures separately as during function specialization they will be handled as part of the root closure.
|
|
private func markConvertedAndReabstractedClosuresAsUsed(rootClosure: Value, convertedAndReabstractedClosure: Value,
|
|
convertedAndReabstractedClosures: inout InstructionSet)
|
|
{
|
|
if convertedAndReabstractedClosure != rootClosure {
|
|
switch convertedAndReabstractedClosure {
|
|
case let pai as PartialApplyInst:
|
|
convertedAndReabstractedClosures.insert(pai)
|
|
return
|
|
markConvertedAndReabstractedClosuresAsUsed(rootClosure: rootClosure,
|
|
convertedAndReabstractedClosure: pai.arguments[0],
|
|
convertedAndReabstractedClosures: &convertedAndReabstractedClosures)
|
|
case let cvt as ConvertFunctionInst:
|
|
convertedAndReabstractedClosures.insert(cvt)
|
|
return
|
|
markConvertedAndReabstractedClosuresAsUsed(rootClosure: rootClosure,
|
|
convertedAndReabstractedClosure: cvt.fromFunction,
|
|
convertedAndReabstractedClosures: &convertedAndReabstractedClosures)
|
|
case let cvt as ConvertEscapeToNoEscapeInst:
|
|
convertedAndReabstractedClosures.insert(cvt)
|
|
return
|
|
markConvertedAndReabstractedClosuresAsUsed(rootClosure: rootClosure,
|
|
convertedAndReabstractedClosure: cvt.fromFunction,
|
|
convertedAndReabstractedClosures: &convertedAndReabstractedClosures)
|
|
case let mdi as MarkDependenceInst:
|
|
convertedAndReabstractedClosures.insert(mdi)
|
|
return
|
|
markConvertedAndReabstractedClosuresAsUsed(rootClosure: rootClosure, convertedAndReabstractedClosure: mdi.value,
|
|
convertedAndReabstractedClosures: &convertedAndReabstractedClosures)
|
|
default:
|
|
fatalError("While marking converted/reabstracted closures as used, found unexpected instruction: \(convertedAndReabstractedClosure)")
|
|
}
|
|
}
|
|
}
|
|
|
|
private extension SpecializationCloner {
|
|
func cloneAndSpecializeFunctionBody(using callSite: CallSite) {
|
|
self.cloneEntryBlockArgsWithoutOrigClosures(usingOrigCalleeAt: callSite)
|
|
|
|
let (allSpecializedEntryBlockArgs, closureArgIndexToAllClonedReleasableClosures) = cloneAllClosures(at: callSite)
|
|
|
|
self.cloneFunctionBody(from: callSite.applyCallee, entryBlockArguments: allSpecializedEntryBlockArgs)
|
|
|
|
self.insertCleanupCodeForClonedReleasableClosures(
|
|
from: callSite, closureArgIndexToAllClonedReleasableClosures: closureArgIndexToAllClonedReleasableClosures)
|
|
}
|
|
|
|
private func cloneEntryBlockArgsWithoutOrigClosures(usingOrigCalleeAt callSite: CallSite) {
|
|
let originalEntryBlock = callSite.applyCallee.entryBlock
|
|
let clonedFunction = self.cloned
|
|
let clonedEntryBlock = self.entryBlock
|
|
|
|
originalEntryBlock.arguments
|
|
.enumerated()
|
|
.filter { index, _ in !callSite.hasClosureArg(at: index) }
|
|
.forEach { _, arg in
|
|
let clonedEntryBlockArgType = arg.type.getLoweredType(in: clonedFunction)
|
|
let clonedEntryBlockArg = clonedEntryBlock.addFunctionArgument(type: clonedEntryBlockArgType, self.context)
|
|
clonedEntryBlockArg.copyFlags(from: arg as! FunctionArgument)
|
|
}
|
|
}
|
|
|
|
/// Clones all closures, originally passed to the callee at the given callSite, into the specialized function.
|
|
///
|
|
/// Returns the following -
|
|
/// - allSpecializedEntryBlockArgs: Complete list of entry block arguments for the specialized function. This includes
|
|
/// the original arguments to the function (minus the closure arguments) and the arguments representing the values
|
|
/// originally captured by the skipped closure arguments.
|
|
///
|
|
/// - closureArgIndexToAllClonedReleasableClosures: Mapping from a closure's argument index at `callSite` to the list
|
|
/// of corresponding releasable closures cloned into the specialized function. We have a "list" because we clone
|
|
/// "closure chains", which consist of a "root" closure and its conversions/reabstractions. This map is used to
|
|
/// generate cleanup code for the cloned closures in the specialized function.
|
|
private func cloneAllClosures(at callSite: CallSite)
|
|
-> (allSpecializedEntryBlockArgs: [Value],
|
|
closureArgIndexToAllClonedReleasableClosures: [Int: [SingleValueInstruction]])
|
|
{
|
|
func entryBlockArgsWithOrigClosuresSkipped() -> [Value?] {
|
|
var clonedNonClosureEntryBlockArgs = self.entryBlock.arguments.makeIterator()
|
|
|
|
return callSite.applyCallee
|
|
.entryBlock
|
|
.arguments
|
|
.enumerated()
|
|
.reduce(into: []) { result, origArgTuple in
|
|
let (index, _) = origArgTuple
|
|
if !callSite.hasClosureArg(at: index) {
|
|
result.append(clonedNonClosureEntryBlockArgs.next())
|
|
} else {
|
|
result.append(Optional.none)
|
|
}
|
|
}
|
|
}
|
|
|
|
var entryBlockArgs: [Value?] = entryBlockArgsWithOrigClosuresSkipped()
|
|
var closureArgIndexToAllClonedReleasableClosures: [Int: [SingleValueInstruction]] = [:]
|
|
|
|
for closureArgDesc in callSite.closureArgDescriptors {
|
|
let (finalClonedReabstractedClosure, allClonedReleasableClosures) =
|
|
self.cloneClosureChain(representedBy: closureArgDesc, at: callSite)
|
|
|
|
entryBlockArgs[closureArgDesc.closureArgIndex] = finalClonedReabstractedClosure
|
|
closureArgIndexToAllClonedReleasableClosures[closureArgDesc.closureArgIndex] = allClonedReleasableClosures
|
|
}
|
|
|
|
return (entryBlockArgs.map { $0! }, closureArgIndexToAllClonedReleasableClosures)
|
|
}
|
|
|
|
private func cloneClosureChain(representedBy closureArgDesc: ClosureArgDescriptor, at callSite: CallSite)
|
|
-> (finalClonedReabstractedClosure: SingleValueInstruction, allClonedReleasableClosures: [SingleValueInstruction])
|
|
{
|
|
let (origToClonedValueMap, capturedArgRange) = self.addEntryBlockArgs(forValuesCapturedBy: closureArgDesc)
|
|
let clonedFunction = self.cloned
|
|
let clonedEntryBlock = self.entryBlock
|
|
let clonedClosureArgs = Array(clonedEntryBlock.arguments[capturedArgRange])
|
|
|
|
let builder = clonedEntryBlock.instructions.isEmpty
|
|
? Builder(atStartOf: clonedFunction, self.context)
|
|
: Builder(atEndOf: clonedEntryBlock, location: clonedEntryBlock.instructions.last!.location, self.context)
|
|
|
|
let clonedRootClosure = builder.cloneRootClosure(representedBy: closureArgDesc, capturedArgs: clonedClosureArgs)
|
|
|
|
let (finalClonedReabstractedClosure, releasableClonedReabstractedClosures) =
|
|
builder.cloneRootClosureReabstractions(rootClosure: closureArgDesc.closure, clonedRootClosure: clonedRootClosure,
|
|
reabstractedClosure: callSite.appliedArgForClosure(at: closureArgDesc.closureArgIndex)!,
|
|
origToClonedValueMap: origToClonedValueMap,
|
|
self.context)
|
|
|
|
let allClonedReleasableClosures = [clonedRootClosure] + releasableClonedReabstractedClosures
|
|
return (finalClonedReabstractedClosure, allClonedReleasableClosures)
|
|
}
|
|
|
|
private func addEntryBlockArgs(forValuesCapturedBy closureArgDesc: ClosureArgDescriptor)
|
|
-> (origToClonedValueMap: [HashableValue: Value], capturedArgRange: Range<Int>)
|
|
{
|
|
var origToClonedValueMap: [HashableValue: Value] = [:]
|
|
var capturedArgRange = 0..<0
|
|
let clonedFunction = self.cloned
|
|
let clonedEntryBlock = self.entryBlock
|
|
|
|
if let capturedArgs = closureArgDesc.arguments {
|
|
let capturedArgRangeStart = clonedEntryBlock.arguments.count
|
|
|
|
for arg in capturedArgs {
|
|
let capturedArg = clonedEntryBlock.addFunctionArgument(type: arg.type.getLoweredType(in: clonedFunction),
|
|
self.context)
|
|
origToClonedValueMap[arg] = capturedArg
|
|
}
|
|
|
|
let capturedArgRangeEnd = clonedEntryBlock.arguments.count
|
|
capturedArgRange = capturedArgRangeStart..<capturedArgRangeEnd
|
|
}
|
|
|
|
return (origToClonedValueMap, capturedArgRange)
|
|
}
|
|
|
|
private func insertCleanupCodeForClonedReleasableClosures(from callSite: CallSite,
|
|
closureArgIndexToAllClonedReleasableClosures: [Int: [SingleValueInstruction]])
|
|
{
|
|
for closureArgDesc in callSite.closureArgDescriptors {
|
|
let allClonedReleasableClosures = closureArgIndexToAllClonedReleasableClosures[closureArgDesc.closureArgIndex]!
|
|
|
|
// Insert a `destroy_value`, for all releasable closures, in all reachable exit BBs if the closure was passed as a
|
|
// guaranteed parameter or its type was noescape+thick. This is b/c the closure was passed at +0 originally and we
|
|
// need to balance the initial increment of the newly created closure(s).
|
|
if closureArgDesc.isClosureGuaranteed || closureArgDesc.parameterInfo.isTrivialNoescapeClosure,
|
|
!allClonedReleasableClosures.isEmpty
|
|
{
|
|
for exitBlock in closureArgDesc.reachableExitBBs {
|
|
let clonedExitBlock = self.getClonedBlock(for: exitBlock)
|
|
|
|
let terminator = clonedExitBlock.terminator is UnreachableInst
|
|
? clonedExitBlock.terminator.previous!
|
|
: clonedExitBlock.terminator
|
|
|
|
let builder = Builder(before: terminator, self.context)
|
|
|
|
for closure in allClonedReleasableClosures {
|
|
if let pai = closure as? PartialApplyInst,
|
|
pai.isOnStack
|
|
{
|
|
builder.destroyPartialApplyOnStack(paiOnStack: pai)
|
|
} else{
|
|
builder.createDestroyValue(operand: closure)
|
|
}
|
|
}
|
|
}
|
|
}
|
|
}
|
|
}
|
|
}
|
|
|
|
private extension [HashableValue: Value] {
|
|
subscript(key: Value) -> Value? {
|
|
get {
|
|
self[key.hashable]
|
|
}
|
|
set {
|
|
self[key.hashable] = newValue
|
|
}
|
|
}
|
|
}
|
|
|
|
private extension Builder {
|
|
func cloneRootClosure(representedBy closureArgDesc: ClosureArgDescriptor, capturedArgs: [Value])
|
|
-> SingleValueInstruction
|
|
{
|
|
let function = self.createFunctionRef(closureArgDesc.callee)
|
|
|
|
if let pai = closureArgDesc.closure as? PartialApplyInst {
|
|
return self.createPartialApply(function: function, substitutionMap: SubstitutionMap(),
|
|
capturedArguments: capturedArgs, calleeConvention: pai.calleeConvention,
|
|
hasUnknownResultIsolation: pai.hasUnknownResultIsolation,
|
|
isOnStack: pai.isOnStack)
|
|
} else {
|
|
return self.createThinToThickFunction(thinFunction: function, resultType: closureArgDesc.closure.type)
|
|
}
|
|
}
|
|
|
|
func cloneRootClosureReabstractions(rootClosure: Value, clonedRootClosure: Value, reabstractedClosure: Value,
|
|
origToClonedValueMap: [HashableValue: Value], _ context: FunctionPassContext)
|
|
-> (finalClonedReabstractedClosure: SingleValueInstruction, releasableClonedReabstractedClosures: [PartialApplyInst])
|
|
{
|
|
func inner(_ rootClosure: Value, _ clonedRootClosure: Value, _ reabstractedClosure: Value,
|
|
_ releasableClonedReabstractedClosures: inout [PartialApplyInst],
|
|
_ origToClonedValueMap: inout [HashableValue: Value]) -> Value {
|
|
switch reabstractedClosure {
|
|
case let reabstractedClosure where reabstractedClosure == rootClosure:
|
|
origToClonedValueMap[reabstractedClosure] = clonedRootClosure
|
|
return clonedRootClosure
|
|
|
|
case let cvt as ConvertFunctionInst:
|
|
let toBeReabstracted = inner(rootClosure, clonedRootClosure, cvt.fromFunction,
|
|
&releasableClonedReabstractedClosures, &origToClonedValueMap)
|
|
let reabstracted = self.createConvertFunction(originalFunction: toBeReabstracted, resultType: cvt.type,
|
|
withoutActuallyEscaping: cvt.withoutActuallyEscaping)
|
|
origToClonedValueMap[cvt] = reabstracted
|
|
return reabstracted
|
|
|
|
case let cvt as ConvertEscapeToNoEscapeInst:
|
|
let toBeReabstracted = inner(rootClosure, clonedRootClosure, cvt.fromFunction,
|
|
&releasableClonedReabstractedClosures, &origToClonedValueMap)
|
|
let reabstracted = self.createConvertEscapeToNoEscape(originalFunction: toBeReabstracted, resultType: cvt.type,
|
|
isLifetimeGuaranteed: true)
|
|
origToClonedValueMap[cvt] = reabstracted
|
|
return reabstracted
|
|
|
|
case let pai as PartialApplyInst:
|
|
let toBeReabstracted = inner(rootClosure, clonedRootClosure, pai.arguments[0],
|
|
&releasableClonedReabstractedClosures, &origToClonedValueMap)
|
|
|
|
guard let function = pai.referencedFunction else {
|
|
fatalError("Encountered unsupported reabstraction (via partial_apply) of root closure!")
|
|
}
|
|
|
|
let fri = self.createFunctionRef(function)
|
|
let reabstracted = self.createPartialApply(function: fri, substitutionMap: SubstitutionMap(),
|
|
capturedArguments: [toBeReabstracted],
|
|
calleeConvention: pai.calleeConvention,
|
|
hasUnknownResultIsolation: pai.hasUnknownResultIsolation,
|
|
isOnStack: pai.isOnStack)
|
|
releasableClonedReabstractedClosures.append(reabstracted)
|
|
origToClonedValueMap[pai] = reabstracted
|
|
return reabstracted
|
|
|
|
case let mdi as MarkDependenceInst:
|
|
let toBeReabstracted = inner(rootClosure, clonedRootClosure, mdi.value, &releasableClonedReabstractedClosures,
|
|
&origToClonedValueMap)
|
|
let base = origToClonedValueMap[mdi.base]!
|
|
let reabstracted = self.createMarkDependence(value: toBeReabstracted, base: base, kind: .Escaping)
|
|
origToClonedValueMap[mdi] = reabstracted
|
|
return reabstracted
|
|
|
|
default:
|
|
fatalError("Encountered unsupported reabstraction of root closure: \(reabstractedClosure)")
|
|
}
|
|
}
|
|
|
|
var releasableClonedReabstractedClosures: [PartialApplyInst] = []
|
|
var origToClonedValueMap = origToClonedValueMap
|
|
let finalClonedReabstractedClosure = inner(rootClosure, clonedRootClosure, reabstractedClosure,
|
|
&releasableClonedReabstractedClosures, &origToClonedValueMap)
|
|
return (finalClonedReabstractedClosure as! SingleValueInstruction, releasableClonedReabstractedClosures)
|
|
}
|
|
|
|
func destroyPartialApplyOnStack(paiOnStack: PartialApplyInst) {
|
|
precondition(paiOnStack.isOnStack, "Function must only be called for `partial_apply`s on stack!")
|
|
|
|
for arg in paiOnStack.arguments {
|
|
self.createDestroyValue(operand: arg)
|
|
}
|
|
|
|
self.createDestroyValue(operand: paiOnStack)
|
|
}
|
|
}
|
|
|
|
private extension FunctionConvention {
|
|
func getSpecializedParameters(basedOn callSite: CallSite) -> [ParameterInfo] {
|
|
let applySiteCallee = callSite.applyCallee
|
|
var specializedParamInfoList: [ParameterInfo] = []
|
|
|
|
// Start by adding all original parameters except for the closure parameters.
|
|
let firstParamIndex = applySiteCallee.argumentConventions.firstParameterIndex
|
|
for (index, paramInfo) in applySiteCallee.convention.parameters.enumerated() {
|
|
let argIndex = index + firstParamIndex
|
|
if !callSite.hasClosureArg(at: argIndex) {
|
|
specializedParamInfoList.append(paramInfo)
|
|
}
|
|
}
|
|
|
|
// Now, append parameters captured by each of the original closure parameter.
|
|
//
|
|
// Captured parameters are always appended to the function signature. If the argument type of the captured
|
|
// parameter in the callee is:
|
|
// - direct and trivial, pass the new parameter as Direct_Unowned.
|
|
// - direct and non-trivial, pass the new parameter as Direct_Owned.
|
|
// - indirect, pass the new parameter using the same parameter convention as in
|
|
// the original closure.
|
|
for closureArgDesc in callSite.closureArgDescriptors {
|
|
if let closure = closureArgDesc.closure as? PartialApplyInst {
|
|
let closureCallee = closureArgDesc.callee
|
|
let closureCalleeConvention = closureCallee.convention
|
|
let unappliedArgumentCount = closure.unappliedArgumentCount - closureCalleeConvention.indirectSILResultCount
|
|
|
|
let prevCapturedParameters =
|
|
closureCalleeConvention
|
|
.parameters[unappliedArgumentCount...]
|
|
.enumerated()
|
|
.map { index, paramInfo in
|
|
let argIndexOfParam = closureCallee.argumentConventions.firstParameterIndex + unappliedArgumentCount + index
|
|
let argType = closureCallee.argumentTypes[argIndexOfParam]
|
|
return paramInfo.withSpecializedConvention(isArgTypeTrivial: argType.isTrivial(in: closureCallee))
|
|
}
|
|
|
|
specializedParamInfoList.append(contentsOf: prevCapturedParameters)
|
|
}
|
|
}
|
|
|
|
return specializedParamInfoList
|
|
}
|
|
}
|
|
|
|
private extension ParameterInfo {
|
|
func withSpecializedConvention(isArgTypeTrivial: Bool) -> Self {
|
|
let specializedParamConvention =
|
|
if self.convention.isAllowedIndirectConvForClosureSpec {
|
|
self.convention
|
|
} else {
|
|
isArgTypeTrivial ? ArgumentConvention.directUnowned : ArgumentConvention.directOwned
|
|
}
|
|
|
|
return ParameterInfo(type: self.type, convention: specializedParamConvention, options: self.options,
|
|
hasLoweredAddresses: self.hasLoweredAddresses)
|
|
}
|
|
|
|
var isTrivialNoescapeClosure: Bool {
|
|
self.type.SILFunctionType_isTrivialNoescape()
|
|
}
|
|
}
|
|
|
|
private extension ArgumentConvention {
|
|
var isAllowedIndirectConvForClosureSpec: Bool {
|
|
switch self {
|
|
case .indirectInout, .indirectInoutAliasable:
|
|
return true
|
|
default:
|
|
return false
|
|
}
|
|
}
|
|
}
|
|
|
|
private extension PartialApplyInst {
|
|
/// True, if the closure obtained from this partial_apply is the
|
|
/// pullback returned from an autodiff VJP
|
|
var isPullbackInResultOfAutodiffVJP: Bool {
|
|
if self.parentFunction.isAutodiffVJP,
|
|
let use = self.uses.singleUse,
|
|
let tupleInst = use.instruction as? TupleInst,
|
|
let returnInst = self.parentFunction.returnInstruction,
|
|
tupleInst == returnInst.returnedValue
|
|
{
|
|
return true
|
|
}
|
|
|
|
return false
|
|
}
|
|
|
|
var isPartialApplyOfThunk: Bool {
|
|
if self.numArguments == 1 || self.numArguments == 2,
|
|
let fun = self.referencedFunction,
|
|
fun.thunkKind == .reabstractionThunk || fun.thunkKind == .thunk
|
|
{
|
|
return true
|
|
}
|
|
|
|
return false
|
|
}
|
|
|
|
var hasOnlyInoutIndirectArguments: Bool {
|
|
self.argumentOperands
|
|
.filter { !$0.value.type.isObject }
|
|
.allSatisfy { self.convention(of: $0)!.isInout }
|
|
}
|
|
}
|
|
|
|
private extension Instruction {
|
|
var asSupportedClosure: SingleValueInstruction? {
|
|
switch self {
|
|
case let tttf as ThinToThickFunctionInst where tttf.callee is FunctionRefInst:
|
|
return tttf
|
|
// TODO: figure out what to do with non-inout indirect arguments
|
|
// https://forums.swift.org/t/non-inout-indirect-types-not-supported-in-closure-specialization-optimization/70826
|
|
case let pai as PartialApplyInst where pai.callee is FunctionRefInst && pai.hasOnlyInoutIndirectArguments:
|
|
return pai
|
|
default:
|
|
return nil
|
|
}
|
|
}
|
|
|
|
var isSupportedClosure: Bool {
|
|
asSupportedClosure != nil
|
|
}
|
|
}
|
|
|
|
private extension ApplySite {
|
|
var calleeIsDynamicFunctionRef: Bool {
|
|
return !(callee is DynamicFunctionRefInst || callee is PreviousDynamicFunctionRefInst)
|
|
}
|
|
}
|
|
|
|
private extension Function {
|
|
var effectAllowsSpecialization: Bool {
|
|
switch self.effectAttribute {
|
|
case .readNone, .readOnly, .releaseNone: return false
|
|
default: return true
|
|
}
|
|
}
|
|
}
|
|
|
|
// ===================== Utility Types ===================== //
|
|
private struct OrderedDict<Key: Hashable, Value> {
|
|
private var valueIndexDict: [Key: Int] = [:]
|
|
private var entryList: [(Key, Value)] = []
|
|
|
|
public subscript(key: Key) -> Value? {
|
|
if let index = valueIndexDict[key] {
|
|
return entryList[index].1
|
|
}
|
|
return nil
|
|
}
|
|
|
|
public mutating func insert(key: Key, value: Value) {
|
|
if valueIndexDict[key] == nil {
|
|
valueIndexDict[key] = entryList.count
|
|
entryList.append((key, value))
|
|
}
|
|
}
|
|
|
|
public mutating func update(key: Key, value: Value) {
|
|
if let index = valueIndexDict[key] {
|
|
entryList[index].1 = value
|
|
}
|
|
}
|
|
|
|
public var keys: LazyMapSequence<Array<(Key, Value)>, Key> {
|
|
entryList.lazy.map { $0.0 }
|
|
}
|
|
|
|
public var values: LazyMapSequence<Array<(Key, Value)>, Value> {
|
|
entryList.lazy.map { $0.1 }
|
|
}
|
|
}
|
|
|
|
private typealias CallSiteMap = OrderedDict<SingleValueInstruction, CallSite>
|
|
|
|
private extension CallSiteMap {
|
|
var callSites: [CallSite] {
|
|
Array(self.values)
|
|
}
|
|
}
|
|
|
|
/// Represents all the information required to represent a closure in isolation, i.e., outside of a callsite context
|
|
/// where the closure may be getting passed as an argument.
|
|
///
|
|
/// Composed with other information inside a `ClosureArgDescriptor` to represent a closure as an argument at a callsite.
|
|
private struct ClosureInfo {
|
|
let closure: SingleValueInstruction
|
|
let lifetimeFrontier: [Instruction]
|
|
|
|
init(closure: SingleValueInstruction, lifetimeFrontier: [Instruction]) {
|
|
self.closure = closure
|
|
self.lifetimeFrontier = lifetimeFrontier
|
|
}
|
|
|
|
}
|
|
|
|
/// Represents a closure as an argument at a callsite.
|
|
private struct ClosureArgDescriptor {
|
|
let closureInfo: ClosureInfo
|
|
/// The index of the closure in the callsite's argument list.
|
|
let closureArgumentIndex: Int
|
|
let parameterInfo: ParameterInfo
|
|
|
|
var closure: SingleValueInstruction {
|
|
closureInfo.closure
|
|
}
|
|
|
|
var isPartialApplyOnStack: Bool {
|
|
if let pai = closure as? PartialApplyInst {
|
|
return pai.isOnStack
|
|
}
|
|
return false
|
|
}
|
|
|
|
var callee: Function {
|
|
if let pai = closure as? PartialApplyInst {
|
|
return pai.referencedFunction!
|
|
} else {
|
|
return (closure as! ThinToThickFunctionInst).referencedFunction!
|
|
}
|
|
}
|
|
|
|
var location: Location {
|
|
closure.location
|
|
}
|
|
|
|
var closureArgIndex: Int {
|
|
closureArgumentIndex
|
|
}
|
|
|
|
var closureParamInfo: ParameterInfo {
|
|
parameterInfo
|
|
}
|
|
|
|
var numArguments: Int {
|
|
if let pai = closure as? PartialApplyInst {
|
|
return pai.numArguments
|
|
} else {
|
|
return 0
|
|
}
|
|
}
|
|
|
|
var arguments: LazyMapSequence<OperandArray, Value>? {
|
|
if let pai = closure as? PartialApplyInst {
|
|
return pai.arguments
|
|
}
|
|
return nil as LazyMapSequence<OperandArray, Value>?
|
|
}
|
|
|
|
var isClosureGuaranteed: Bool {
|
|
closureParamInfo.convention.isGuaranteed
|
|
}
|
|
|
|
var isClosureConsumed: Bool {
|
|
closureParamInfo.convention.isConsumed
|
|
}
|
|
|
|
var reachableExitBBs: [BasicBlock] {
|
|
closure.parentFunction.blocks.filter { $0.isReachableExitBlock }
|
|
}
|
|
}
|
|
|
|
/// Represents a callsite containing one or more closure arguments.
|
|
private struct CallSite {
|
|
let applySite: ApplySite
|
|
var closureArgDescriptors: [ClosureArgDescriptor] = []
|
|
|
|
public init(applySite: ApplySite) {
|
|
self.applySite = applySite
|
|
}
|
|
|
|
public mutating func appendClosureArgDescriptor(_ descriptor: ClosureArgDescriptor) {
|
|
self.closureArgDescriptors.append(descriptor)
|
|
}
|
|
|
|
var applyCallee: Function {
|
|
applySite.referencedFunction!
|
|
}
|
|
|
|
func hasClosureArg(at index: Int) -> Bool {
|
|
closureArgDescriptors.contains { $0.closureArgumentIndex == index }
|
|
}
|
|
|
|
func closureArgDesc(at index: Int) -> ClosureArgDescriptor? {
|
|
closureArgDescriptors.first { $0.closureArgumentIndex == index }
|
|
}
|
|
|
|
func appliedArgForClosure(at index: Int) -> Value? {
|
|
if let closureArgDesc = closureArgDesc(at: index) {
|
|
return applySite.arguments[closureArgDesc.closureArgIndex - applySite.unappliedArgumentCount]
|
|
}
|
|
|
|
return nil
|
|
}
|
|
|
|
func specializedCalleeName(_ context: FunctionPassContext) -> String {
|
|
let closureArgs = Array(self.closureArgDescriptors.map { $0.closure })
|
|
let closureIndices = Array(self.closureArgDescriptors.map { $0.closureArgIndex })
|
|
|
|
return context.mangle(withClosureArgs: closureArgs, closureArgIndices: closureIndices,
|
|
from: applyCallee)
|
|
}
|
|
}
|
|
|
|
// ===================== Unit tests ===================== //
|
|
|
|
let gatherCallSitesTest = FunctionTest("closure_specialize_gather_call_sites") { function, arguments, context in
|
|
print("Specializing closures in function: \(function.name)")
|
|
print("===============================================")
|
|
var callSites = gatherCallSites(in: function, context)
|
|
|
|
callSites.forEach { callSite in
|
|
print("PartialApply call site: \(callSite.applySite)")
|
|
print("Passed in closures: ")
|
|
for index in callSite.closureArgDescriptors.indices {
|
|
var closureArgDescriptor = callSite.closureArgDescriptors[index]
|
|
print("\(index+1). \(closureArgDescriptor.closureInfo.closure)")
|
|
}
|
|
}
|
|
print("\n")
|
|
}
|
|
|
|
let specializedFunctionSignatureAndBodyTest = FunctionTest(
|
|
"closure_specialize_specialized_function_signature_and_body") { function, arguments, context in
|
|
|
|
var callSites = gatherCallSites(in: function, context)
|
|
|
|
for callSite in callSites {
|
|
let (specializedFunction, _) = getOrCreateSpecializedFunction(basedOn: callSite, context)
|
|
print("Generated specialized function: \(specializedFunction.name)")
|
|
print("\(specializedFunction)\n")
|
|
}
|
|
}
|