sui_adapter_latest/static_programmable_transactions/linkage/

single_linkage.rs

// Copyright (c) Mysten Labs, Inc.
// SPDX-License-Identifier: Apache-2.0

use crate::{
    data_store::VerifiedPackageStore,
    static_programmable_transactions::{
        linkage::{
            analysis::LinkageAnalyzer,
            resolution::{ResolutionTable, VersionConstraint, add_and_unify, get_package},
            resolved_linkage::{ExecutableLinkage, ResolvedLinkage},
        },
        loading::ast::{
            Argument, Command, DeserializedPackage, InputArg, InputType, Inputs, LoadedFunction,
            PackagePayload, Transaction, Type, module_has_init,
        },
    },
};
use move_binary_format::file_format::Visibility;
use move_vm_runtime::validation::verification::ast::Package as VerifiedPackage;
use std::{
    collections::{BTreeMap, BTreeSet},
    sync::Arc,
};
use sui_protocol_config::ProtocolConfig;
use sui_types::{
    Identifier,
    base_types::ObjectID,
    error::ExecutionErrorTrait,
    execution_status::{ExecutionErrorKind, PackageUpgradeError},
};

/// Replace each command's per-call linkage with a single linkage shared by the whole transaction.
///
/// Done in two passes:
///   1. Fold every command's package and type-argument constraints into one `ResolutionTable`,
///      unifying as we go (an error here means the commands cannot agree on a single set of
///      package versions).
///      - Top level functions are pinned `exact`, while their dependencies are
///        pinned `exact` or `at_least` based on the visibility of the top-level function.
///        Type-argument packages are always `at_least`.
///      - Publishes and upgrades introduce their own constraints to the linkage, but only if
///        they have an `init` function (otherwise they do not contribute to the linkage). See
///        comments on each of the command arms for details on this.
///   2. Write the resulting unified linkage back into every `MoveCall`.
///
/// Because all calls end up sharing one linkage, every package version selection is consistent
/// across the transaction.
pub fn refine_to_single_linkage<E: ExecutionErrorTrait>(
    txn: &mut Transaction,
    linkage_analysis: &LinkageAnalyzer,
    package_store: &VerifiedPackageStore<'_>,
    protocol_config: &ProtocolConfig,
) -> Result<(), E> {
    let mut base_linkage = linkage_analysis
        .config()
        .resolution_table_with_native_packages::<E, _>(package_store)?;
    let mut seen_fixed_inputs = BTreeSet::new();

    for (i, command) in txn.commands.iter().enumerate() {
        analyze_command::<E>(command, &mut base_linkage, package_store, protocol_config)
            .map_err(|e| e.with_command_index(i))?;
        add_used_input_linkage::<E>(
            command.arguments(),
            &txn.inputs,
            &mut base_linkage,
            &mut seen_fixed_inputs,
            package_store,
            protocol_config,
        )
        .map_err(|e| e.with_command_index(i))?;
    }

    add_withdrawal_compatibility_input_linkage::<E>(
        &txn.inputs,
        &mut base_linkage,
        package_store,
        protocol_config,
    )?;

    if protocol_config.enable_order_independent_upgrade_init_linkage() {
        for (i, command) in txn.commands.iter().enumerate() {
            let Command::Upgrade(payload, _, current_package_id, _, resolved_linkage) = command
            else {
                continue;
            };
            analyze_upgrade_command::<E>(
                payload,
                current_package_id,
                resolved_linkage,
                &mut base_linkage,
                package_store,
                protocol_config,
            )
            .map_err(|e| e.with_command_index(i))?;
        }
    }

    // Constraint-level invariant check, run before `from_resolution_table` erases the
    // underlying constraints.
    if protocol_config.harden_linkage_consistency() {
        for (i, command) in txn.commands.iter().enumerate() {
            validate_init_linkage_pinning::<E>(command, &base_linkage, package_store)
                .map_err(|e| e.with_command_index(i))?;
        }
    }

    let resolved_linkage =
        ExecutableLinkage::new(ResolvedLinkage::from_resolution_table(base_linkage));

    // harden_linkage_consistency ==> every package in the unified linkage must resolve to a specific version.
    assert_invariant!(
        !protocol_config.harden_linkage_consistency()
            || resolved_linkage
                .0
                .linkage_resolution
                .iter()
                .all(|(_, resolution)| { resolution.version.is_some() }),
        "Unified linkage must resolve every package to a specific version, but found: {:?}",
        resolved_linkage
    );

    for (i, command) in txn.commands.iter_mut().enumerate() {
        write_back_linkage::<E>(command, &resolved_linkage).map_err(|e| e.with_command_index(i))?;
    }

    txn.unified_linkage = Some(resolved_linkage);

    Ok(())
}

fn add_used_input_linkage<'a, E: ExecutionErrorTrait>(
    arguments: impl IntoIterator<Item = &'a Argument>,
    inputs: &Inputs,
    resolution_table: &mut ResolutionTable,
    seen_fixed_inputs: &mut BTreeSet<u16>,
    store: &VerifiedPackageStore<'_>,
    protocol_config: &ProtocolConfig,
) -> Result<(), E> {
    if !protocol_config.harden_linkage_consistency() {
        return Ok(());
    }

    for argument in arguments {
        if let Argument::Input(i) = argument
            && let Some((_, InputType::Fixed(ty))) = inputs.get(*i as usize)
            && seen_fixed_inputs.insert(*i)
        {
            add_type_packages::<E>(resolution_table, std::iter::once(ty), store)?;
        }
    }
    Ok(())
}

fn add_withdrawal_compatibility_input_linkage<E: ExecutionErrorTrait>(
    inputs: &Inputs,
    resolution_table: &mut ResolutionTable,
    store: &VerifiedPackageStore<'_>,
    protocol_config: &ProtocolConfig,
) -> Result<(), E> {
    if !protocol_config.harden_linkage_consistency() {
        return Ok(());
    }

    add_type_packages::<E>(
        resolution_table,
        inputs.iter().filter_map(|(input_arg, input_ty)| {
            if let InputArg::FundsWithdrawal(withdrawal) = input_arg
                && withdrawal.from_compatibility_object
                && let InputType::Fixed(ty) = input_ty
            {
                Some(ty)
            } else {
                None
            }
        }),
        store,
    )
}

/// A publish or upgrade that runs an `init` executes it under the linkage declared by that command
/// so every dependency the command declares must be pinned `exact`ly to the version it declared in
/// the larger unified linkage.
fn validate_init_linkage_pinning<E: ExecutionErrorTrait>(
    command: &Command,
    resolution_table: &ResolutionTable,
    store: &VerifiedPackageStore<'_>,
) -> Result<(), E> {
    let validate_package_init_linkage = |declared_linkage: &ResolvedLinkage, err_context| {
        for (original_id, version_id) in &declared_linkage.linkage {
            match resolution_table.resolution_table.get(original_id) {
                Some(VersionConstraint::Exact(_, pinned_id)) if pinned_id == version_id => (),
                other => {
                    invariant_violation!(
                        "{err_context} runs an `init` that requires package {original_id} at \
                        {version_id}, but the transaction linkage pins it to {other:?}"
                    )
                }
            }
        }
        Ok(())
    };

    match command {
        Command::Publish(PackagePayload::Deserialized(pkg), _, resolved_linkage) => {
            if pkg.has_potential_init() {
                validate_package_init_linkage(resolved_linkage, "publish")
            } else {
                Ok(())
            }
        }
        Command::Upgrade(
            PackagePayload::Deserialized(pkg),
            _,
            current_package_id,
            _,
            resolved_linkage,
        ) => {
            if upgrade_introduces_new_init::<E>(current_package_id, &pkg.modules_with_init, store)?
            {
                validate_package_init_linkage(resolved_linkage, "upgrade")
            } else {
                Ok(())
            }
        }
        Command::Publish(PackagePayload::Serialized(_), ..) => {
            invariant_violation!("Unexpected serialized package payload in linkage analysis")
        }
        Command::Upgrade(PackagePayload::Serialized(_), ..) => {
            invariant_violation!("Unexpected serialized package payload in linkage analysis")
        }
        Command::MoveCall(_)
        | Command::MakeMoveVec(_, _)
        | Command::TransferObjects(_, _)
        | Command::SplitCoins(_, _)
        | Command::MergeCoins(_, _) => Ok(()),
    }
}

/// Fold a single command's contribution into the shared `resolution_table` (pass 1). Only commands
/// that pull packages into the runtime linkage contribute; the rest are no-ops.
fn analyze_command<E: ExecutionErrorTrait>(
    command: &Command,
    resolution_table: &mut ResolutionTable,
    store: &VerifiedPackageStore<'_>,
    protocol_config: &ProtocolConfig,
) -> Result<(), E> {
    match command {
        Command::MoveCall(move_call) => {
            add_call_to_table::<E>(resolution_table, &move_call.function, store)?;
        }
        Command::Publish(PackagePayload::Serialized(_), ..) => {
            invariant_violation!("Unexpected serialized package payload in linkage analysis")
        }
        Command::Publish(PackagePayload::Deserialized(pkg), _, resolved_linkage) => {
            // A publish only affects the transaction's linkage if the package has an `init`
            // function: `init` runs as part of the publish, so its dependencies must be resolvable
            // in this transaction. Without an `init` the freshly published package is not called
            // and contributes nothing.
            //
            // `modules` is guaranteed to be non-empty by the `deserialize_modules` function.
            if pkg.has_potential_init() {
                for resolved in resolved_linkage.linkage.values() {
                    add_and_unify(resolved, store, resolution_table, VersionConstraint::exact)?;
                }
            }
        }
        Command::Upgrade(_, _, _, _, _)
            if protocol_config.enable_order_independent_upgrade_init_linkage() => {}
        Command::Upgrade(payload, _, current_package_id, _, resolved_linkage) => {
            analyze_upgrade_command::<E>(
                payload,
                current_package_id,
                resolved_linkage,
                resolution_table,
                store,
                protocol_config,
            )?;
        }
        Command::MakeMoveVec(Some(ty), _) => {
            add_type_packages::<E>(resolution_table, std::iter::once(ty), store)?;
        }
        Command::MakeMoveVec(None, _) => (),
        Command::TransferObjects(_, _) | Command::SplitCoins(_, _) | Command::MergeCoins(_, _) => {}
    };
    Ok(())
}

/// Analyze the linkage contribution of an upgrade command.
fn analyze_upgrade_command<E: ExecutionErrorTrait>(
    payload: &PackagePayload,
    current_package_id: &ObjectID,
    resolved_linkage: &ResolvedLinkage,
    resolution_table: &mut ResolutionTable,
    store: &VerifiedPackageStore<'_>,
    protocol_config: &ProtocolConfig,
) -> Result<(), E> {
    if !protocol_config.enable_init_on_upgrade() {
        return Ok(());
    }

    let current_pkg = get_package(current_package_id, store)?;

    assert_invariant!(
        protocol_config.enable_unified_linkage(),
        "Unified linkage must be enabled before init on upgrade is supported"
    );

    let upgrade_modules_with_init = match payload {
        PackagePayload::Serialized(_) => {
            invariant_violation!("Unexpected serialized package payload in linkage analysis")
        }
        PackagePayload::Deserialized(DeserializedPackage {
            modules_with_init, ..
        }) => modules_with_init,
    };

    // Whether each module already present in the current package defines an `init`.
    let current_module_inits = current_pkg
        .modules()
        .iter()
        .map(|(module_id, module)| {
            (
                module_id.name().as_str(),
                module_has_init(module.compiled_module()),
            )
        })
        .collect::<BTreeMap<_, _>>();

    // reject upgrades where an existing module adds an `init`.
    reject_existing_module_added_init::<E>(&current_module_inits, upgrade_modules_with_init)?;

    // only newly-introduced modules with an `init` contribute to the linkage.
    if has_new_module_init(
        current_module_inits.keys().copied().collect(),
        upgrade_modules_with_init,
    ) {
        add_upgrade_init_linkage_to_table::<E>(
            resolution_table,
            current_package_id,
            resolved_linkage,
            store,
            protocol_config,
        )?;
    }

    Ok(())
}

/// Reject an upgrade in which a module that already exists in the current package (and did not
/// previously define an `init`) introduces one. Only the upgraded `init`-defining module names are
/// looked up in the current package.
fn reject_existing_module_added_init<E: ExecutionErrorTrait>(
    current_module_inits: &BTreeMap<&str, bool>,
    upgrade_modules_with_init: &BTreeSet<Identifier>,
) -> Result<(), E> {
    for module_name in upgrade_modules_with_init {
        if current_module_inits.get(module_name.as_str()) == Some(&false) {
            return Err(<E>::from_kind(ExecutionErrorKind::PackageUpgradeError {
                upgrade_error: PackageUpgradeError::IncompatibleUpgrade,
            }));
        }
    }
    Ok(())
}

/// Return true if the upgrade introduces at least one new module (absent from the current package)
/// that defines an `init` function. Existing modules never count (rejected by `reject_existing_module_added_init`).
fn has_new_module_init(
    current_module_names: BTreeSet<&str>,
    upgrade_modules_with_init: &BTreeSet<Identifier>,
) -> bool {
    upgrade_modules_with_init
        .iter()
        .any(|module_name| !current_module_names.contains(module_name.as_str()))
}

/// Whether this upgrade introduces a module that is absent from the current package and defines an
/// `init` -- i.e. whether this upgrade will run an `init`.
pub(crate) fn upgrade_introduces_new_init<E: ExecutionErrorTrait>(
    current_package_id: &ObjectID,
    upgrade_modules_with_init: &BTreeSet<Identifier>,
    store: &VerifiedPackageStore<'_>,
) -> Result<bool, E> {
    let current_pkg = get_package(current_package_id, store)?;
    Ok(has_new_module_init(
        current_pkg
            .modules()
            .keys()
            .map(|module_id| module_id.name().as_str())
            .collect(),
        upgrade_modules_with_init,
    ))
}

/// Add the linkage constraints introduced by an upgrade, there are two cases based on whether the
/// upgraded package already participates in the transaction-wide (Lumpy) linkage:
///
/// - If the upgraded package's original id is not already in the resolution table, the upgrade
///   is treated like a fresh publish-with-init: every entry of its resolved linkage is added as an
///   `exact` constraint.
/// - If the upgraded package's original id is in the resolution table, then for any `(original_id,
///   version_id)` as defined in the `Upgrade` command either:
///   a. It is not in the existing Lumpy linkage, and a `original_id -> exact(version_id)` constraint is introduced; or
///   b. It is in the existing Lumpy linkage, in which case Lumpy[original_id].id must equal `version_id`, and that entry is fixed to `exact(version_id)`.
fn add_upgrade_init_linkage_to_table<E: ExecutionErrorTrait>(
    resolution_table: &mut ResolutionTable,
    current_package_id: &ObjectID,
    resolved_linkage: &ResolvedLinkage,
    store: &VerifiedPackageStore<'_>,
    protocol_config: &ProtocolConfig,
) -> Result<(), E> {
    let current_pkg = get_package(current_package_id, store)?;
    let pkg_original_id: ObjectID = current_pkg.original_id().into();

    if !resolution_table
        .resolution_table
        .contains_key(&pkg_original_id)
    {
        for resolved in resolved_linkage.linkage.values() {
            add_and_unify(resolved, store, resolution_table, VersionConstraint::exact)?;
        }
        return Ok(());
    }

    for (original_id, version_id) in &resolved_linkage.linkage {
        match resolution_table.resolution_table.get(original_id) {
            None => {
                add_and_unify(
                    version_id,
                    store,
                    resolution_table,
                    VersionConstraint::exact,
                )?;
            }
            Some(existing) if existing.object_id() == *version_id => {
                if protocol_config.harden_linkage_consistency() {
                    add_and_unify(
                        version_id,
                        store,
                        resolution_table,
                        VersionConstraint::exact,
                    )?;
                }
            }
            Some(existing) => {
                return Err(E::new_with_source(
                    ExecutionErrorKind::InvalidLinkage,
                    format!(
                        "upgrade init linkage conflicts with transaction linkage: package \
                         {original_id} resolves to {} in transaction linkage, but upgrade \
                         linkage requires {version_id}",
                        existing.object_id(),
                    ),
                ));
            }
        }
    }

    Ok(())
}

/// Add a `MoveCall`'s target package and type-argument packages to the resolution table.
///
/// The called package itself is pinned `exact` (we must run exactly the version being called). Its
/// dependencies are constrained by the callee's visibility: a public entrypoint is a stable ABI,
/// so its dependencies may be upgraded (`at_least`); a private/`friend` entrypoint is not, so they
/// are pinned `exact`. Type-argument packages are always `at_least`, since types resolve upwards
/// to later versions. This mirrors `LinkageAnalyzer::compute_call_linkage_`.
fn add_call_to_table<E: ExecutionErrorTrait>(
    resolution_table: &mut ResolutionTable,
    function: &LoadedFunction,
    store: &VerifiedPackageStore<'_>,
) -> Result<(), E> {
    let dep_resolution_fn = match function.visibility {
        Visibility::Public => VersionConstraint::at_least,
        Visibility::Private | Visibility::Friend => VersionConstraint::exact,
    };
    let package: ObjectID = (*function.version_mid.address()).into();
    add_package::<E>(
        &package,
        store,
        resolution_table,
        VersionConstraint::exact,
        dep_resolution_fn,
    )?;
    add_type_packages::<E>(resolution_table, function.type_arguments.iter(), store)
}

/// Resolve every package mentioned by `types`. Types resolve upwards to later versions, so the
/// package and its deps are both `at_least`.
fn add_type_packages<'a, E: ExecutionErrorTrait>(
    resolution_table: &mut ResolutionTable,
    types: impl IntoIterator<Item = &'a Type>,
    store: &VerifiedPackageStore<'_>,
) -> Result<(), E> {
    resolution_table.add_type_linkages_to_table(
        types
            .into_iter()
            .flat_map(|ty| ty.all_addresses())
            .map(ObjectID::from),
        store,
    )
}

/// Add a package and its transitive dependencies to the resolution table. The package itself
/// gets `self_resolution_fn`'s constraint; every transitive dep (per the package's linkage
/// table) gets `dep_resolution_fn`'s constraint.
fn add_package<E: ExecutionErrorTrait>(
    object_id: &ObjectID,
    store: &VerifiedPackageStore<'_>,
    resolution_table: &mut ResolutionTable,
    self_resolution_fn: fn(&Arc<VerifiedPackage>) -> Option<VersionConstraint>,
    dep_resolution_fn: fn(&Arc<VerifiedPackage>) -> Option<VersionConstraint>,
) -> Result<(), E> {
    let pkg = get_package(object_id, store)?;
    let transitive_deps = resolution_table
        .config
        .linkage_table(&pkg)
        .into_values()
        .map(ObjectID::from);
    add_and_unify(object_id, store, resolution_table, self_resolution_fn)?;
    for dep_id in transitive_deps {
        add_and_unify(&dep_id, store, resolution_table, dep_resolution_fn)?;
    }
    Ok(())
}

/// Overwrite each `MoveCall`'s per-call linkage with the unified transaction-wide linkage (pass 2).
/// Only `MoveCall`s carry an executable linkage; the other commands need no write-back.
fn write_back_linkage<E: ExecutionErrorTrait>(
    command: &mut Command,
    ptb_linkage: &ExecutableLinkage,
) -> Result<(), E> {
    match command {
        Command::MoveCall(move_call) => {
            let previous_linkage = &move_call.function.linkage;
            // Stronger than the length check above: every package the per-call linkage resolved
            // must still be present in the per-component linkage. Unification only ever adds
            // packages (the key set is a union across member calls), so a dropped key signals a
            // bug in how component constraints were folded together.
            //
            // Since `linkage`'s keys are a set, this check also implies that
            // `previous_linkage.0.linkage.len() <= ptb_linkage.0.linkage.len()`.
            assert_invariant!(
                previous_linkage
                    .0
                    .linkage
                    .keys()
                    .all(|k| ptb_linkage.0.linkage.contains_key(k)),
                "single linkage drops a package that the per-call linkage of MoveCall had resolved"
            );
            debug_assert!(
                previous_linkage.0.linkage.len() <= ptb_linkage.0.linkage.len(),
                "single linkage has fewer candidates than the per-call linkage of MoveCall"
            );
            move_call.function.linkage = ptb_linkage.clone();
        }
        Command::TransferObjects(_, _)
        | Command::SplitCoins(_, _)
        | Command::MergeCoins(_, _)
        | Command::MakeMoveVec(_, _)
        | Command::Publish(_, _, _)
        | Command::Upgrade(_, _, _, _, _) => (),
    };
    Ok(())
}