Contract Name:
ConfigurationFacet
Contract Source Code:
<i class='far fa-question-circle text-muted ms-2' data-bs-trigger='hover' data-bs-toggle='tooltip' data-bs-html='true' data-bs-title='Click on the check box to select individual contract to compare. Only 1 contract can be selected from each side.'></i>
// SPDX-License-Identifier: BUSL-1.1
pragma solidity 0.8.28;
import {MoreVaultsLib} from "../libraries/MoreVaultsLib.sol";
import {AccessControlLib} from "../libraries/AccessControlLib.sol";
import {IConfigurationFacet} from "../interfaces/facets/IConfigurationFacet.sol";
import {BaseFacetInitializer} from "./BaseFacetInitializer.sol";
import {EnumerableSet} from "@openzeppelin/contracts/utils/structs/EnumerableSet.sol";
import {IMoreVaultsRegistry} from "../interfaces/IMoreVaultsRegistry.sol";
contract ConfigurationFacet is BaseFacetInitializer, IConfigurationFacet {
using EnumerableSet for EnumerableSet.Bytes32Set;
function INITIALIZABLE_STORAGE_SLOT() internal pure override returns (bytes32) {
return keccak256("MoreVaults.storage.initializable.ConfigurationFacetV1.0.1");
}
function facetName() external pure returns (string memory) {
return "ConfigurationFacet";
}
function facetVersion() external pure returns (string memory) {
return "1.0.1";
}
function initialize(bytes calldata data) external initializerFacet {
uint256 maxSlippagePercent = abi.decode(data, (uint256));
MoreVaultsLib.MoreVaultsStorage storage ds = MoreVaultsLib.moreVaultsStorage();
ds.supportedInterfaces[type(IConfigurationFacet).interfaceId] = true;
ds.maxSlippagePercent = maxSlippagePercent;
}
function onFacetRemoval(bool) external {
MoreVaultsLib.MoreVaultsStorage storage ds = MoreVaultsLib.moreVaultsStorage();
ds.supportedInterfaces[type(IConfigurationFacet).interfaceId] = false;
}
/**
* @inheritdoc IConfigurationFacet
*/
function setMaxSlippagePercent(uint256 _newPercent) external {
AccessControlLib.validateDiamond(msg.sender);
MoreVaultsLib.MoreVaultsStorage storage ds = MoreVaultsLib.moreVaultsStorage();
if (_newPercent > 2000) revert SlippageTooHigh();
ds.maxSlippagePercent = _newPercent;
emit MaxSlippagePercentSet(_newPercent);
}
/**
* @inheritdoc IConfigurationFacet
*/
function setGasLimitForAccounting(
uint48 _availableTokenAccountingGas,
uint48 _heldTokenAccountingGas,
uint48 _facetAccountingGas,
uint48 _newLimit
) external {
AccessControlLib.validateDiamond(msg.sender);
MoreVaultsLib.GasLimit storage gl = MoreVaultsLib.moreVaultsStorage().gasLimit;
gl.availableTokenAccountingGas = _availableTokenAccountingGas;
gl.heldTokenAccountingGas = _heldTokenAccountingGas;
gl.facetAccountingGas = _facetAccountingGas;
gl.value = _newLimit;
}
/**
* @inheritdoc IConfigurationFacet
*/
function setFeeRecipient(address recipient) external {
AccessControlLib.validateOwner(msg.sender);
MoreVaultsLib._setFeeRecipient(recipient);
}
/**
* @inheritdoc IConfigurationFacet
*/
function setDepositCapacity(uint256 capacity) external {
AccessControlLib.validateCurator(msg.sender);
MoreVaultsLib._setDepositCapacity(capacity);
}
/**
* @inheritdoc IConfigurationFacet
*/
function setDepositWhitelist(address[] calldata depositors, uint256[] calldata underlyingAssetCaps) external {
if (depositors.length != underlyingAssetCaps.length) {
revert ArraysLengthsMismatch();
}
AccessControlLib.validateOwner(msg.sender);
MoreVaultsLib._setDepositWhitelist(depositors, underlyingAssetCaps);
}
/**
* @inheritdoc IConfigurationFacet
*/
function enableDepositWhitelist() external {
AccessControlLib.validateOwner(msg.sender);
MoreVaultsLib._setWhitelistFlag(true);
}
/**
* @inheritdoc IConfigurationFacet
*/
function disableDepositWhitelist() external {
AccessControlLib.validateDiamond(msg.sender);
MoreVaultsLib._setWhitelistFlag(false);
}
/**
* @inheritdoc IConfigurationFacet
*/
function setTimeLockPeriod(uint256 period) external {
AccessControlLib.validateDiamond(msg.sender);
MoreVaultsLib._setTimeLockPeriod(period);
}
/**
* @inheritdoc IConfigurationFacet
*/
function addAvailableAsset(address asset) external {
AccessControlLib.validateCurator(msg.sender);
MoreVaultsLib._addAvailableAsset(asset);
MoreVaultsLib.checkGasLimitOverflow();
}
/**
* @inheritdoc IConfigurationFacet
*/
function addAvailableAssets(address[] calldata assets) external {
AccessControlLib.validateCurator(msg.sender);
for (uint256 i = 0; i < assets.length;) {
MoreVaultsLib._addAvailableAsset(assets[i]);
unchecked {
++i;
}
}
MoreVaultsLib.checkGasLimitOverflow();
}
/**
* @inheritdoc IConfigurationFacet
*/
function enableAssetToDeposit(address asset) external {
AccessControlLib.validateDiamond(msg.sender);
MoreVaultsLib._enableAssetToDeposit(asset);
}
/**
* @inheritdoc IConfigurationFacet
*/
function disableAssetToDeposit(address asset) external {
AccessControlLib.validateCurator(msg.sender);
MoreVaultsLib._disableAssetToDeposit(asset);
}
/**
* @inheritdoc IConfigurationFacet
*/
function setWithdrawalTimelock(uint64 _duration) external {
AccessControlLib.validateDiamond(msg.sender);
MoreVaultsLib.MoreVaultsStorage storage ds = MoreVaultsLib.moreVaultsStorage();
ds.witdrawTimelock = _duration;
emit WithdrawalTimelockSet(_duration);
}
/**
* @inheritdoc IConfigurationFacet
*/
function setWithdrawalFee(uint96 _fee) external {
AccessControlLib.validateDiamond(msg.sender);
MoreVaultsLib.MoreVaultsStorage storage ds = MoreVaultsLib.moreVaultsStorage();
if (_fee > MoreVaultsLib.MAX_FEE) revert FeeIsTooHigh();
ds.withdrawalFee = _fee;
emit WithdrawalFeeSet(_fee);
}
/**
* @inheritdoc IConfigurationFacet
*/
function updateWithdrawalQueueStatus(bool _status) external {
AccessControlLib.validateDiamond(msg.sender);
MoreVaultsLib.MoreVaultsStorage storage ds = MoreVaultsLib.moreVaultsStorage();
ds.isWithdrawalQueueEnabled = _status;
emit WithdrawalQueueStatusSet(_status);
}
/**
* @inheritdoc IConfigurationFacet
*/
function setCrossChainAccountingManager(address manager) external {
AccessControlLib.validateDiamond(msg.sender);
MoreVaultsLib.MoreVaultsStorage storage ds = MoreVaultsLib.moreVaultsStorage();
AccessControlLib.AccessControlStorage storage acs = AccessControlLib.accessControlStorage();
if (!IMoreVaultsRegistry(acs.moreVaultsRegistry).isCrossChainAccountingManager(manager)) {
revert InvalidManager();
}
ds.crossChainAccountingManager = manager;
emit CrossChainAccountingManagerSet(manager);
}
/**
* @inheritdoc IConfigurationFacet
*/
function getWithdrawalFee() external view returns (uint96) {
MoreVaultsLib.MoreVaultsStorage storage ds = MoreVaultsLib.moreVaultsStorage();
return ds.withdrawalFee;
}
/**
* @inheritdoc IConfigurationFacet
*/
function getWithdrawalQueueStatus() external view returns (bool) {
MoreVaultsLib.MoreVaultsStorage storage ds = MoreVaultsLib.moreVaultsStorage();
return ds.isWithdrawalQueueEnabled;
}
/**
* @inheritdoc IConfigurationFacet
*/
function isAssetDepositable(address asset) external view returns (bool) {
return MoreVaultsLib.moreVaultsStorage().isAssetDepositable[asset];
}
/**
* @inheritdoc IConfigurationFacet
*/
function isAssetAvailable(address asset) external view returns (bool) {
return MoreVaultsLib.moreVaultsStorage().isAssetAvailable[asset];
}
/**
* @inheritdoc IConfigurationFacet
*/
function getAvailableAssets() external view returns (address[] memory) {
return MoreVaultsLib.moreVaultsStorage().availableAssets;
}
/**
* @inheritdoc IConfigurationFacet
*/
function getDepositableAssets() external view returns (address[] memory) {
return MoreVaultsLib.moreVaultsStorage().depositableAssets;
}
/**
* @inheritdoc IConfigurationFacet
*/
function fee() external view returns (uint96) {
return MoreVaultsLib.moreVaultsStorage().fee;
}
/**
* @inheritdoc IConfigurationFacet
*/
function feeRecipient() external view returns (address) {
return MoreVaultsLib.moreVaultsStorage().feeRecipient;
}
/**
* @inheritdoc IConfigurationFacet
*/
function depositCapacity() external view returns (uint256) {
return MoreVaultsLib.moreVaultsStorage().depositCapacity;
}
/**
* @inheritdoc IConfigurationFacet
*/
function timeLockPeriod() external view returns (uint256) {
return MoreVaultsLib.moreVaultsStorage().timeLockPeriod;
}
/**
* @inheritdoc IConfigurationFacet
*/
function getDepositWhitelist(address depositor) external view returns (uint256) {
return MoreVaultsLib.moreVaultsStorage().depositWhitelist[depositor];
}
/**
* @inheritdoc IConfigurationFacet
*/
function isDepositWhitelistEnabled() external view returns (bool) {
return MoreVaultsLib.moreVaultsStorage().isWhitelistEnabled;
}
/**
* @inheritdoc IConfigurationFacet
*/
function isHub() external view returns (bool) {
return MoreVaultsLib.moreVaultsStorage().isHub;
}
/**
* @inheritdoc IConfigurationFacet
*/
function lockedTokensAmountOfAsset(address asset) external view returns (uint256) {
MoreVaultsLib.MoreVaultsStorage storage ds = MoreVaultsLib.moreVaultsStorage();
return ds.lockedTokens[asset];
}
/**
* @inheritdoc IConfigurationFacet
*/
function getStakingAddresses(bytes32 stakingFacetId) external view returns (address[] memory) {
MoreVaultsLib.MoreVaultsStorage storage ds = MoreVaultsLib.moreVaultsStorage();
return EnumerableSet.values(ds.stakingAddresses[stakingFacetId]);
}
/**
* @inheritdoc IConfigurationFacet
*/
function tokensHeld(bytes32 tokenId) external view returns (address[] memory) {
MoreVaultsLib.MoreVaultsStorage storage ds = MoreVaultsLib.moreVaultsStorage();
return EnumerableSet.values(ds.tokensHeld[tokenId]);
}
/**
* @inheritdoc IConfigurationFacet
*/
function getWithdrawalTimelock() external view returns (uint64) {
MoreVaultsLib.MoreVaultsStorage storage ds = MoreVaultsLib.moreVaultsStorage();
return ds.witdrawTimelock;
}
/**
* @inheritdoc IConfigurationFacet
*/
function getCrossChainAccountingManager() external view returns (address) {
MoreVaultsLib.MoreVaultsStorage storage ds = MoreVaultsLib.moreVaultsStorage();
return MoreVaultsLib._getCrossChainAccountingManager();
}
} <i class='far fa-question-circle text-muted ms-2' data-bs-trigger='hover' data-bs-toggle='tooltip' data-bs-html='true' data-bs-title='Click on the check box to select individual contract to compare. Only 1 contract can be selected from each side.'></i>
// SPDX-License-Identifier: BUSL-1.1
pragma solidity 0.8.28;
import {AccessControlLib} from "./AccessControlLib.sol";
import {IDiamondCut} from "../interfaces/facets/IDiamondCut.sol";
import {EnumerableSet} from "@openzeppelin/contracts/utils/structs/EnumerableSet.sol";
import {IOracleRegistry} from "../interfaces/IOracleRegistry.sol";
import {IMoreVaultsRegistry} from "../interfaces/IMoreVaultsRegistry.sol";
import {IVaultsFactory} from "../interfaces/IVaultsFactory.sol";
import {IAggregatorV2V3Interface} from "../interfaces/Chainlink/IAggregatorV2V3Interface.sol";
import {Math} from "@openzeppelin/contracts/utils/math/Math.sol";
import {IERC20Metadata} from "@openzeppelin/contracts/token/ERC20/extensions/IERC20Metadata.sol";
import {IERC20} from "@openzeppelin/contracts/interfaces/IERC20.sol";
import {
IGenericMoreVaultFacet,
IGenericMoreVaultFacetInitializable
} from "../interfaces/facets/IGenericMoreVaultFacetInitializable.sol";
bytes32 constant BEFORE_ACCOUNTING_SELECTOR = 0xa85367f800000000000000000000000000000000000000000000000000000000;
bytes32 constant BEFORE_ACCOUNTING_FAILED_ERROR = 0xc5361f8d00000000000000000000000000000000000000000000000000000000;
bytes32 constant ACCOUNTING_FAILED_ERROR = 0x712f778400000000000000000000000000000000000000000000000000000000;
bytes32 constant BALANCE_OF_SELECTOR = 0x70a0823100000000000000000000000000000000000000000000000000000000;
bytes32 constant TOTAL_ASSETS_SELECTOR = 0x01e1d11400000000000000000000000000000000000000000000000000000000;
bytes32 constant TOTAL_ASSETS_RUN_FAILED = 0xb5a7047700000000000000000000000000000000000000000000000000000000;
uint256 constant MAX_WITHDRAWAL_DELAY = 14 days;
library MoreVaultsLib {
error InitializationFunctionReverted(address _initializationContractAddress, bytes _calldata);
error UnsupportedAsset(address);
error FacetNotAllowed(address facet);
error SelectorNotAllowed(bytes4 selector);
error InvalidSelectorForFacet(bytes4 selector, address facet);
error IncorrectFacetCutAction(uint8 action);
error ContractDoesntHaveCode(string errorMessage);
error ZeroAddress();
error ImmutableFunction();
error FunctionDoesNotExist();
error NoSelectorsInFacetToCut();
error FunctionAlreadyExists(address oldFacetAddress, bytes4 selector);
error OraclePriceIsOld();
error OraclePriceIsNegative();
error InvalidFee();
error AssetAlreadyAvailable();
error InvalidAddress();
error NoOracleForAsset();
error FacetHasBalance(uint256 amount);
error AccountingFailed(bytes32 selector);
error UnsupportedProtocol(address protocol);
error AccountingGasLimitExceeded(uint256 limit, uint256 consumption);
error RestrictedActionInsideMulticall();
error OnFacetRemovalFailed(address facet, bytes data);
error FacetNameFailed(address facet);
using EnumerableSet for EnumerableSet.AddressSet;
using EnumerableSet for EnumerableSet.Bytes32Set;
using Math for uint256;
// 32 bytes keccak hash of a string to use as a diamond storage location.
bytes32 constant MORE_VAULTS_STORAGE_POSITION = keccak256("MoreVaults.diamond.storage");
uint96 constant FEE_BASIS_POINT = 10000; // 100%
uint96 constant MAX_FEE = 5000; // 50%
struct ERC4626Storage {
IERC20 _asset;
uint8 _underlyingDecimals;
}
// keccak256(abi.encode(uint256(keccak256("openzeppelin.storage.ERC4626")) - 1)) & ~bytes32(uint256(0xff))
bytes32 constant ERC4626StorageLocation = 0x0773e532dfede91f04b12a73d3d2acd361424f41f76b4fb79f090161e36b4e00;
struct FacetAddressAndPosition {
address facetAddress;
uint96 functionSelectorPosition; // position in facetFunctionSelectors.functionSelectors array
}
struct FacetFunctionSelectors {
bytes4[] functionSelectors;
uint256 facetAddressPosition; // position of facetAddress in facetAddresses array
}
struct PendingActions {
bytes[] actionsData;
uint256 pendingUntil;
}
struct GasLimit {
uint48 availableTokenAccountingGas;
uint48 heldTokenAccountingGas;
uint48 facetAccountingGas;
uint48 stakingTokenAccountingGas;
uint48 nestedVaultsGas;
uint48 value;
}
struct WithdrawRequest {
uint256 timelockEndsAt;
uint256 shares;
}
enum TokenType {
HeldToken,
StakingToken
}
enum ActionType {
DEPOSIT,
MINT,
WITHDRAW,
REDEEM,
MULTI_ASSETS_DEPOSIT
}
struct CrossChainRequestInfo {
address initiator;
uint64 timestamp;
ActionType actionType;
bytes actionCallData;
bool fulfilled;
bool finalized;
uint256 totalAssets;
uint256 finalizationResult;
uint256 minAmountOut; // Minimum expected result amount for slippage check (0 = check not required)
}
struct MoreVaultsStorage {
// maps function selector to the facet address and
// the position of the selector in the facetFunctionSelectors.selectors array
mapping(bytes4 => FacetAddressAndPosition) selectorToFacetAndPosition;
// maps facet addresses to function selectors
mapping(address => FacetFunctionSelectors) facetFunctionSelectors;
// facet addresses
address[] facetAddresses;
bytes32[] facetsForAccounting;
// Used to query if a contract implements an interface.
// Used to implement ERC-165.
mapping(bytes4 => bool) supportedInterfaces;
mapping(address => bool) isAssetAvailable;
address[] availableAssets;
mapping(address => bool) isAssetDepositable;
mapping(bytes32 => EnumerableSet.AddressSet) tokensHeld;
address wrappedNative;
address feeRecipient;
uint96 fee;
uint256 depositCapacity;
uint256 lastTotalAssets;
uint256 actionNonce;
mapping(uint256 => PendingActions) pendingActions;
uint256 timeLockPeriod;
mapping(bytes32 => EnumerableSet.AddressSet) stakingAddresses;
mapping(address => uint256) lockedTokens;
address minter;
bool isNativeDeposit;
address[] beforeAccountingFacets;
mapping(address => address) stakingTokenToGauge;
mapping(address => address) stakingTokenToMultiRewards;
GasLimit gasLimit;
mapping(TokenType => EnumerableSet.Bytes32Set) vaultExternalAssets;
uint64 witdrawTimelock;
mapping(address => WithdrawRequest) withdrawalRequests;
uint256 maxSlippagePercent;
bool isMulticall;
address factory;
mapping(address => uint256) curvePoolLength;
mapping(address => uint256) depositWhitelist;
mapping(address => bool) isNecessaryToCheckLock;
bool isWhitelistEnabled;
address[] depositableAssets;
bool isHub;
bool oraclesCrossChainAccounting;
address crossChainAccountingManager;
mapping(bytes32 => CrossChainRequestInfo) guidToCrossChainRequestInfo;
bytes32 finalizationGuid;
bool isWithdrawalQueueEnabled;
uint96 withdrawalFee;
mapping(address => uint256) userHighWaterMarkPerShare;
}
event DiamondCut(IDiamondCut.FacetCut[] _diamondCut);
event FeeSet(uint96 previousFee, uint96 newFee);
event FeeRecipientSet(address indexed previousRecipient, address indexed newRecipient);
event AssetToManageAdded(address indexed asset);
event AssetToDepositEnabled(address indexed asset);
event AssetToDepositDisabled(address indexed asset);
event TimeLockPeriodSet(uint256 previousPeriod, uint256 newPeriod);
event DepositCapacitySet(uint256 previousCapacity, uint256 newCapacity);
function moreVaultsStorage() internal pure returns (MoreVaultsStorage storage ds) {
bytes32 position = MORE_VAULTS_STORAGE_POSITION;
// assigns struct storage slot to the storage position
assembly {
ds.slot := position
}
}
function getERC4626Storage() internal pure returns (ERC4626Storage storage $) {
assembly {
$.slot := ERC4626StorageLocation
}
}
function validateAddressWhitelisted(address protocol) internal view {
AccessControlLib.AccessControlStorage storage acs = AccessControlLib.accessControlStorage();
if (!IMoreVaultsRegistry(acs.moreVaultsRegistry).isWhitelisted(protocol)) revert UnsupportedProtocol(protocol);
}
function validateAssetAvailable(address asset) internal view {
MoreVaultsStorage storage ds = moreVaultsStorage();
if (asset == address(0)) asset = ds.wrappedNative;
if (!ds.isAssetAvailable[asset]) revert UnsupportedAsset(asset);
}
function validateAssetDepositable(address asset) internal view {
MoreVaultsStorage storage ds = moreVaultsStorage();
if (asset == address(0)) asset = ds.wrappedNative;
if (!ds.isAssetDepositable[asset]) revert UnsupportedAsset(asset);
}
function validateNotMulticall() internal view {
MoreVaultsStorage storage ds = moreVaultsStorage();
if (ds.isMulticall) {
revert RestrictedActionInsideMulticall();
}
}
function removeTokenIfnecessary(EnumerableSet.AddressSet storage tokensHeld, address token) internal {
MoreVaultsStorage storage ds = moreVaultsStorage();
if (IERC20(token).balanceOf(address(this)) + ds.lockedTokens[token] < 10e3) {
tokensHeld.remove(token);
}
}
function convertToUnderlying(address _token, uint256 amount, Math.Rounding rounding)
internal
view
returns (uint256)
{
if (amount == 0) return 0;
// Scope 1: Token validation and setup
address resolvedToken;
address underlyingToken;
{
MoreVaultsStorage storage ds = moreVaultsStorage();
resolvedToken = _token == address(0) ? address(ds.wrappedNative) : _token;
underlyingToken = address(getERC4626Storage()._asset);
if (resolvedToken == underlyingToken) {
return amount;
}
}
// Scope 2: Oracle setup and input token price
uint256 inputTokenPrice;
uint8 inputTokenOracleDecimals;
address oracleDenominationAsset;
{
IMoreVaultsRegistry registry = IMoreVaultsRegistry(AccessControlLib.vaultRegistry());
IOracleRegistry oracle = registry.oracle();
oracleDenominationAsset = registry.getDenominationAsset();
IAggregatorV2V3Interface aggregator =
IAggregatorV2V3Interface(oracle.getOracleInfo(resolvedToken).aggregator);
inputTokenPrice = oracle.getAssetPrice(resolvedToken);
inputTokenOracleDecimals = aggregator.decimals();
}
// Scope 3: Price conversion calculation
uint256 finalPriceForConversion = inputTokenPrice;
if (underlyingToken != oracleDenominationAsset) {
IMoreVaultsRegistry registry = IMoreVaultsRegistry(AccessControlLib.vaultRegistry());
IOracleRegistry oracle = registry.oracle();
IAggregatorV2V3Interface aggregator =
IAggregatorV2V3Interface(oracle.getOracleInfo(underlyingToken).aggregator);
uint256 underlyingTokenPrice = oracle.getAssetPrice(underlyingToken);
uint8 underlyingTokenOracleDecimals = aggregator.decimals();
finalPriceForConversion =
inputTokenPrice.mulDiv(10 ** underlyingTokenOracleDecimals, underlyingTokenPrice, rounding);
}
// Final conversion calculation
return amount.mulDiv(
finalPriceForConversion * 10 ** IERC20Metadata(underlyingToken).decimals(),
10 ** (inputTokenOracleDecimals + IERC20Metadata(resolvedToken).decimals()),
rounding
);
}
function convertUnderlyingToUsd(uint256 amount, Math.Rounding rounding) internal view returns (uint256) {
IOracleRegistry oracle = IMoreVaultsRegistry(AccessControlLib.vaultRegistry()).oracle();
address underlyingToken = address(getERC4626Storage()._asset);
return amount.mulDiv(
oracle.getAssetPrice(underlyingToken), 10 ** IERC20Metadata(underlyingToken).decimals(), rounding
);
}
function convertUsdToUnderlying(uint256 amount, Math.Rounding rounding) internal view returns (uint256) {
IOracleRegistry oracle = IMoreVaultsRegistry(AccessControlLib.vaultRegistry()).oracle();
address underlyingToken = address(getERC4626Storage()._asset);
return amount.mulDiv(
10 ** IERC20Metadata(underlyingToken).decimals(), oracle.getAssetPrice(underlyingToken), rounding
);
}
function _setFeeRecipient(address recipient) internal {
MoreVaultsStorage storage ds = moreVaultsStorage();
if (recipient == address(0)) {
revert ZeroAddress();
}
address previousRecipient = ds.feeRecipient;
ds.feeRecipient = recipient;
emit FeeRecipientSet(previousRecipient, recipient);
}
function _setFee(uint96 fee) internal {
MoreVaultsStorage storage ds = moreVaultsStorage();
uint96 previousFee = ds.fee;
if (fee > MAX_FEE) {
revert InvalidFee();
}
ds.fee = fee;
emit FeeSet(previousFee, fee);
}
function _setDepositCapacity(uint256 capacity) internal {
MoreVaultsStorage storage ds = moreVaultsStorage();
uint256 previousCapacity = ds.depositCapacity;
ds.depositCapacity = capacity;
emit DepositCapacitySet(previousCapacity, capacity);
}
function _setDepositWhitelist(address[] calldata depositors, uint256[] calldata undelyingAssetCaps) internal {
MoreVaultsStorage storage ds = moreVaultsStorage();
for (uint256 i; i < depositors.length;) {
ds.depositWhitelist[depositors[i]] = undelyingAssetCaps[i];
unchecked {
++i;
}
}
}
function _setTimeLockPeriod(uint256 period) internal {
MoreVaultsStorage storage ds = moreVaultsStorage();
uint256 previousPeriod = ds.timeLockPeriod;
ds.timeLockPeriod = period;
emit TimeLockPeriodSet(previousPeriod, period);
}
function _addAvailableAsset(address asset) internal {
if (asset == address(0)) {
revert InvalidAddress();
}
MoreVaultsLib.MoreVaultsStorage storage ds = MoreVaultsLib.moreVaultsStorage();
if (ds.isAssetAvailable[asset]) {
revert AssetAlreadyAvailable();
}
AccessControlLib.AccessControlStorage storage acs = AccessControlLib.accessControlStorage();
IMoreVaultsRegistry registry = IMoreVaultsRegistry(acs.moreVaultsRegistry);
IOracleRegistry oracle = registry.oracle();
if (address(oracle.getOracleInfo(asset).aggregator) == address(0)) {
revert NoOracleForAsset();
}
ds.isAssetAvailable[asset] = true;
ds.availableAssets.push(asset);
emit AssetToManageAdded(asset);
}
function _enableAssetToDeposit(address asset) internal {
if (asset == address(0)) {
revert InvalidAddress();
}
MoreVaultsLib.MoreVaultsStorage storage ds = MoreVaultsLib.moreVaultsStorage();
if (!ds.isAssetAvailable[asset]) {
revert UnsupportedAsset(asset);
}
if (ds.isAssetDepositable[asset]) {
revert AssetAlreadyAvailable();
}
ds.isAssetDepositable[asset] = true;
ds.depositableAssets.push(asset);
emit AssetToDepositEnabled(asset);
}
function _disableAssetToDeposit(address asset) internal {
if (asset == address(0)) {
revert InvalidAddress();
}
MoreVaultsLib.MoreVaultsStorage storage ds = MoreVaultsLib.moreVaultsStorage();
if (!ds.isAssetDepositable[asset]) {
revert UnsupportedAsset(asset);
}
ds.isAssetDepositable[asset] = false;
for (uint256 i; i < ds.depositableAssets.length;) {
if (ds.depositableAssets[i] == asset) {
ds.depositableAssets[i] = ds.depositableAssets[ds.depositableAssets.length - 1];
ds.depositableAssets.pop();
break;
}
unchecked {
++i;
}
}
emit AssetToDepositDisabled(asset);
}
// Internal function version of diamondCut
function diamondCut(IDiamondCut.FacetCut[] memory _diamondCut) internal {
AccessControlLib.AccessControlStorage storage acs = AccessControlLib.accessControlStorage();
IMoreVaultsRegistry registry = IMoreVaultsRegistry(acs.moreVaultsRegistry);
for (uint256 facetIndex; facetIndex < _diamondCut.length;) {
IDiamondCut.FacetCutAction action = _diamondCut[facetIndex].action;
address facetAddress = _diamondCut[facetIndex].facetAddress;
// Validate facet and selectors for Add and Replace actions
if (action == IDiamondCut.FacetCutAction.Add || action == IDiamondCut.FacetCutAction.Replace) {
// Check if facet is allowed in registry
if (!registry.isPermissionless()) {
if (!registry.isFacetAllowed(facetAddress)) {
revert FacetNotAllowed(facetAddress);
}
for (uint256 selectorIndex; selectorIndex < _diamondCut[facetIndex].functionSelectors.length;) {
if (
registry.selectorToFacet(_diamondCut[facetIndex].functionSelectors[selectorIndex])
!= facetAddress
) {
revert SelectorNotAllowed(_diamondCut[facetIndex].functionSelectors[selectorIndex]);
}
unchecked {
++selectorIndex;
}
}
}
}
if (action == IDiamondCut.FacetCutAction.Add) {
addFunctions(_diamondCut[facetIndex].facetAddress, _diamondCut[facetIndex].functionSelectors);
initializeAfterAddition(_diamondCut[facetIndex].facetAddress, _diamondCut[facetIndex].initData);
} else if (action == IDiamondCut.FacetCutAction.Replace) {
replaceFunctions(_diamondCut[facetIndex].facetAddress, _diamondCut[facetIndex].functionSelectors);
initializeAfterAddition(_diamondCut[facetIndex].facetAddress, _diamondCut[facetIndex].initData);
} else if (action == IDiamondCut.FacetCutAction.Remove) {
removeFunctions(_diamondCut[facetIndex].facetAddress, _diamondCut[facetIndex].functionSelectors);
} else {
revert IncorrectFacetCutAction(uint8(action));
}
unchecked {
++facetIndex;
}
}
emit DiamondCut(_diamondCut);
}
function addFunctions(address _facetAddress, bytes4[] memory _functionSelectors) internal {
if (_functionSelectors.length == 0) {
revert NoSelectorsInFacetToCut();
}
MoreVaultsStorage storage ds = moreVaultsStorage();
if (_facetAddress == address(0)) {
revert ZeroAddress();
}
uint96 selectorPosition = uint96(ds.facetFunctionSelectors[_facetAddress].functionSelectors.length);
// add new facet address if it does not exist
if (selectorPosition == 0) {
addFacet(ds, _facetAddress);
}
for (uint256 selectorIndex; selectorIndex < _functionSelectors.length;) {
bytes4 selector = _functionSelectors[selectorIndex];
address oldFacetAddress = ds.selectorToFacetAndPosition[selector].facetAddress;
if (oldFacetAddress != address(0)) {
revert FunctionAlreadyExists(oldFacetAddress, selector);
}
addFunction(ds, selector, selectorPosition, _facetAddress);
selectorPosition++;
unchecked {
++selectorIndex;
}
}
// if factory is not set, then it is deployment of diamond, so link will be done on factory side
if (factoryAddress() != address(0)) {
IVaultsFactory(ds.factory).link(_facetAddress);
}
}
function replaceFunctions(address _facetAddress, bytes4[] memory _functionSelectors) internal {
if (_functionSelectors.length == 0) {
revert NoSelectorsInFacetToCut();
}
MoreVaultsStorage storage ds = moreVaultsStorage();
if (_facetAddress == address(0)) {
revert ZeroAddress();
}
uint96 selectorPosition = uint96(ds.facetFunctionSelectors[_facetAddress].functionSelectors.length);
// add new facet address if it does not exist
if (selectorPosition == 0) {
addFacet(ds, _facetAddress);
}
address factory = ds.factory;
for (uint256 selectorIndex; selectorIndex < _functionSelectors.length;) {
bytes4 selector = _functionSelectors[selectorIndex];
address oldFacetAddress = ds.selectorToFacetAndPosition[selector].facetAddress;
if (oldFacetAddress == _facetAddress) {
revert FunctionAlreadyExists(oldFacetAddress, selector);
}
removeFunction(ds, oldFacetAddress, selector, true);
addFunction(ds, selector, selectorPosition, _facetAddress);
selectorPosition++;
unchecked {
++selectorIndex;
}
}
IVaultsFactory(factory).link(_facetAddress);
}
function removeFunctions(address _facetAddress, bytes4[] memory _functionSelectors) internal {
if (_functionSelectors.length == 0) {
revert NoSelectorsInFacetToCut();
}
MoreVaultsStorage storage ds = moreVaultsStorage();
// if function does not exist then do nothing and return
if (_facetAddress != address(0)) {
revert ZeroAddress();
}
for (uint256 selectorIndex; selectorIndex < _functionSelectors.length;) {
bytes4 selector = _functionSelectors[selectorIndex];
address oldFacetAddress = ds.selectorToFacetAndPosition[selector].facetAddress;
removeFunction(ds, oldFacetAddress, selector, false);
unchecked {
++selectorIndex;
}
}
}
function addFacet(MoreVaultsStorage storage ds, address _facetAddress) internal {
enforceHasContractCode(_facetAddress, "MoreVaultsLibCut: New facet has no code");
ds.facetFunctionSelectors[_facetAddress].facetAddressPosition = ds.facetAddresses.length;
ds.facetAddresses.push(_facetAddress);
}
function addFunction(
MoreVaultsStorage storage ds,
bytes4 _selector,
uint96 _selectorPosition,
address _facetAddress
) internal {
ds.selectorToFacetAndPosition[_selector].functionSelectorPosition = _selectorPosition;
ds.facetFunctionSelectors[_facetAddress].functionSelectors.push(_selector);
ds.selectorToFacetAndPosition[_selector].facetAddress = _facetAddress;
}
function removeFunction(MoreVaultsStorage storage ds, address _facetAddress, bytes4 _selector, bool _isReplacing)
internal
{
if (_facetAddress == address(0)) {
revert FunctionDoesNotExist();
}
// an immutable function is a function defined directly in a diamond
if (_facetAddress == address(this)) {
revert ImmutableFunction();
}
// replace selector with last selector, then delete last selector
uint256 selectorPosition = ds.selectorToFacetAndPosition[_selector].functionSelectorPosition;
uint256 lastSelectorPosition = ds.facetFunctionSelectors[_facetAddress].functionSelectors.length - 1;
// if not the same then replace _selector with lastSelector
if (selectorPosition != lastSelectorPosition) {
bytes4 lastSelector = ds.facetFunctionSelectors[_facetAddress].functionSelectors[lastSelectorPosition];
ds.facetFunctionSelectors[_facetAddress].functionSelectors[selectorPosition] = lastSelector;
ds.selectorToFacetAndPosition[lastSelector].functionSelectorPosition = uint96(selectorPosition);
}
// if no more selectors for facet address then delete the facet address
if (lastSelectorPosition == 0) {
// replace facet address with last facet address and delete last facet address
uint256 lastFacetAddressPosition = ds.facetAddresses.length - 1;
uint256 facetAddressPosition = ds.facetFunctionSelectors[_facetAddress].facetAddressPosition;
if (facetAddressPosition != lastFacetAddressPosition) {
address lastFacetAddress = ds.facetAddresses[lastFacetAddressPosition];
ds.facetAddresses[facetAddressPosition] = lastFacetAddress;
ds.facetFunctionSelectors[lastFacetAddress].facetAddressPosition = facetAddressPosition;
}
ds.facetAddresses.pop();
delete ds.facetFunctionSelectors[_facetAddress].facetAddressPosition;
address factory = ds.factory;
IVaultsFactory(factory).unlink(_facetAddress);
(bool success, bytes memory result) = address(_facetAddress)
.delegatecall(
abi.encodeWithSelector(
bytes4(IGenericMoreVaultFacetInitializable.onFacetRemoval.selector), _isReplacing
)
);
// revert if onFacetRemoval exists on facet and failed
if (!success && result.length > 0) {
revert OnFacetRemovalFailed(_facetAddress, result);
}
}
// delete the last selector
ds.facetFunctionSelectors[_facetAddress].functionSelectors.pop();
delete ds.selectorToFacetAndPosition[_selector];
}
function initializeAfterAddition(address _facetAddress, bytes memory _initData) internal {
enforceHasContractCode(_facetAddress, "MoreVaultsLibCut: _facetAddress has no code");
bytes memory callData =
abi.encodeWithSelector(IGenericMoreVaultFacetInitializable.initialize.selector, _initData);
(bool success, bytes memory error) = _facetAddress.delegatecall(callData);
// 0x0dc149f0 is selector of error AlreadyInitialized()
if (bytes4(error) == bytes4(hex"0dc149f0")) {
return;
}
if (!success) {
if (error.length > 0) {
// bubble up error
/// @solidity memory-safe-assembly
assembly {
let returndata_size := mload(error)
revert(add(32, error), returndata_size)
}
} else {
revert InitializationFunctionReverted(_facetAddress, callData);
}
}
}
function removeFromBeforeAccounting(MoreVaultsStorage storage ds, address _facetAddress, bool _isReplacing)
internal
{
for (uint256 i; i < ds.beforeAccountingFacets.length;) {
if (ds.beforeAccountingFacets[i] == _facetAddress) {
if (!_isReplacing) {
(bool success,) =
address(_facetAddress).delegatecall(abi.encodeWithSelector(bytes4(BEFORE_ACCOUNTING_SELECTOR)));
assembly {
if iszero(success) {
mstore(0x40, BEFORE_ACCOUNTING_FAILED_ERROR)
mstore(add(0x40, 0x04), _facetAddress)
revert(0x40, 0x24)
}
}
}
ds.beforeAccountingFacets[i] = ds.beforeAccountingFacets[ds.beforeAccountingFacets.length - 1];
ds.beforeAccountingFacets.pop();
break;
}
unchecked {
++i;
}
}
}
function removeFromFacetsForAccounting(MoreVaultsStorage storage ds, bytes4 selector, bool _isReplacing) internal {
for (uint256 i; i < ds.facetsForAccounting.length;) {
if (ds.facetsForAccounting[i] == selector) {
if (!_isReplacing) {
// Skip balance check for accountingBridgeFacet - it reports remote spoke funds,
// not local funds, and a failing oracle should not prevent disabling oracle accounting
bytes4 accountingBridgeFacetSelector =
bytes4(keccak256(abi.encodePacked("accountingBridgeFacet()")));
if (selector != accountingBridgeFacetSelector) {
(bool success, bytes memory result) = address(this).staticcall(abi.encodeWithSelector(selector));
if (!success) {
revert AccountingFailed(selector);
}
uint256 decodedAmount = abi.decode(result, (uint256));
if (decodedAmount > 10e4) {
revert FacetHasBalance(decodedAmount);
}
}
}
ds.facetsForAccounting[i] = ds.facetsForAccounting[ds.facetsForAccounting.length - 1];
ds.facetsForAccounting.pop();
break;
}
unchecked {
++i;
}
}
}
function enforceHasContractCode(address _contract, string memory _errorMessage) internal view {
uint256 contractSize;
assembly {
contractSize := extcodesize(_contract)
}
if (contractSize == 0) {
revert ContractDoesntHaveCode(_errorMessage);
}
}
function checkGasLimitOverflow() internal view {
MoreVaultsStorage storage ds = moreVaultsStorage();
GasLimit storage gl = ds.gasLimit;
if (gl.value == 0) return;
bytes32[] memory stakingIds = ds.vaultExternalAssets[TokenType.StakingToken].values();
bytes32[] memory heldIds = ds.vaultExternalAssets[TokenType.HeldToken].values();
uint256 stakingTokensLength;
for (uint256 i = 0; i < stakingIds.length;) {
unchecked {
stakingTokensLength += ds.stakingAddresses[stakingIds[i]].length();
++i;
}
}
uint256 tokensHeldLength;
for (uint256 i = 0; i < heldIds.length;) {
unchecked {
tokensHeldLength += ds.tokensHeld[heldIds[i]].length();
++i;
}
}
uint256 consumption;
unchecked {
consumption = tokensHeldLength * gl.heldTokenAccountingGas + stakingTokensLength
* gl.stakingTokenAccountingGas + ds.availableAssets.length * gl.availableTokenAccountingGas
+ ds.facetsForAccounting.length * gl.facetAccountingGas + gl.nestedVaultsGas;
}
if (consumption > ds.gasLimit.value) {
revert AccountingGasLimitExceeded(ds.gasLimit.value, consumption);
}
}
function withdrawFromRequest(address _msgSender, address _requester, uint256 _shares) internal returns (bool) {
MoreVaultsStorage storage ds = moreVaultsStorage();
WithdrawRequest storage request = ds.withdrawalRequests[_requester];
// if withdrawal queue is disabled, request can be processed immediately
if (!ds.isWithdrawalQueueEnabled) {
// only allow for the shares owner to withdraw in this case
return _msgSender == _requester;
}
if (isWithdrawableRequest(request.timelockEndsAt, ds.witdrawTimelock) && request.shares >= _shares) {
request.shares -= _shares;
return true;
}
return false;
}
function isWithdrawableRequest(uint256 _timelockEndsAt, uint256 _witdrawTimelock) private view returns (bool) {
uint256 requestTimestamp = _timelockEndsAt - _witdrawTimelock;
return block.timestamp >= _timelockEndsAt && block.timestamp - requestTimestamp <= MAX_WITHDRAWAL_DELAY;
}
function factoryAddress() internal view returns (address) {
MoreVaultsStorage storage ds = moreVaultsStorage();
return ds.factory;
}
function _setWhitelistFlag(bool isEnabled) internal {
MoreVaultsStorage storage ds = moreVaultsStorage();
ds.isWhitelistEnabled = isEnabled;
}
function _beforeAccounting(address[] storage _baf) internal {
assembly {
let freePtr := mload(0x40)
let length := sload(_baf.slot)
mstore(0, _baf.slot)
let slot := keccak256(0, 0x20)
mstore(freePtr, BEFORE_ACCOUNTING_SELECTOR)
for { let i := 0 } lt(i, length) { i := add(i, 1) } {
let facet := sload(add(slot, i))
let res := delegatecall(gas(), facet, freePtr, 4, 0, 0) // call facets for acounting, ignore return values
// if delegatecall fails, revert with the error
if iszero(res) {
mstore(freePtr, BEFORE_ACCOUNTING_FAILED_ERROR)
mstore(add(freePtr, 0x04), facet)
revert(freePtr, 0x24)
}
}
}
}
function _getCrossChainAccountingManager() internal view returns (address) {
MoreVaultsStorage storage ds = moreVaultsStorage();
AccessControlLib.AccessControlStorage storage acs = AccessControlLib.accessControlStorage();
if (ds.crossChainAccountingManager == address(0)) {
return IMoreVaultsRegistry(acs.moreVaultsRegistry).defaultCrossChainAccountingManager();
}
return ds.crossChainAccountingManager;
}
} <i class='far fa-question-circle text-muted ms-2' data-bs-trigger='hover' data-bs-toggle='tooltip' data-bs-html='true' data-bs-title='Click on the check box to select individual contract to compare. Only 1 contract can be selected from each side.'></i>
// SPDX-License-Identifier: BUSL-1.1
pragma solidity 0.8.28;
import {IDiamondCut} from "../interfaces/facets/IDiamondCut.sol";
import {IAccessControlFacet} from "../interfaces/facets/IAccessControlFacet.sol";
import {IConfigurationFacet} from "../interfaces/facets/IConfigurationFacet.sol";
import {IVaultFacet} from "../interfaces/facets/IVaultFacet.sol";
import {IBridgeFacet} from "../interfaces/facets/IBridgeFacet.sol";
/**
* @title AccessControlLib
* @notice Library for managing access control in diamond proxy
*/
library AccessControlLib {
/**
* @dev Custom errors for access control
*/
error UnauthorizedAccess();
error ZeroAddress();
error SameAddress();
error NotPendingOwner();
bytes32 constant ACCESS_CONTROL_STORAGE_POSITION = keccak256("MoreVaults.accessControl.storage");
struct AccessControlStorage {
address owner;
address curator;
address guardian;
address moreVaultsRegistry;
address pendingOwner;
}
/**
* @dev Emitted when owner address is changed
*/
event OwnerChanged(address indexed previousOwner, address indexed newOwner);
/**
* @dev Emitted when pending owner address is changed
*/
event PendingOwnerSet(address indexed newPendingOwner);
/**
* @dev Emitted when curator address is changed
*/
event CuratorChanged(address indexed previousCurator, address indexed newCurator);
/**
* @dev Emitted when guardian address is changed
*/
event GuardianChanged(address indexed previousGuardian, address indexed newGuardian);
/**
* @dev Emitted when more vault registry address is changed
*/
event MoreVaultRegistrySet(address indexed previousRegistry, address indexed newRegistry);
function accessControlStorage() internal pure returns (AccessControlStorage storage acs) {
bytes32 position = ACCESS_CONTROL_STORAGE_POSITION;
// assigns struct storage slot to the storage position
assembly {
acs.slot := position
}
}
/**
* @notice Validates if caller is owner
* @param caller Address to validate
*/
function validateOwner(address caller) internal view {
if (caller != accessControlStorage().owner) {
revert UnauthorizedAccess();
}
}
function validatePendingOwner(address caller) internal view {
if (caller != accessControlStorage().pendingOwner) {
revert UnauthorizedAccess();
}
}
/**
* @notice Validates if caller is curator
* @param caller Address to validate
*/
function validateCurator(address caller) internal view {
if (caller != accessControlStorage().curator && accessControlStorage().owner != caller) {
revert UnauthorizedAccess();
}
}
/**
* @notice Validates if caller is guardian or owner
* @param caller Address to validate
*/
function validateGuardian(address caller) internal view {
if (accessControlStorage().guardian != caller) {
revert UnauthorizedAccess();
}
}
function validateDiamond(address caller) internal view {
if (caller != address(this)) {
revert UnauthorizedAccess();
}
}
function validatePermissionForSelector(address caller, bytes4 selector) internal view {
if (
selector == IDiamondCut.diamondCut.selector || selector == IAccessControlFacet.transferOwnership.selector
|| selector == IAccessControlFacet.transferCuratorship.selector
|| selector == IAccessControlFacet.transferGuardian.selector
|| selector == IConfigurationFacet.disableDepositWhitelist.selector
|| selector == IConfigurationFacet.enableAssetToDeposit.selector
|| selector == IConfigurationFacet.setGasLimitForAccounting.selector
|| selector == IConfigurationFacet.setMaxSlippagePercent.selector
|| selector == IConfigurationFacet.setTimeLockPeriod.selector
|| selector == IConfigurationFacet.setWithdrawalTimelock.selector
|| selector == IConfigurationFacet.setWithdrawalFee.selector
|| selector == IConfigurationFacet.updateWithdrawalQueueStatus.selector
|| selector == IConfigurationFacet.setCrossChainAccountingManager.selector
|| selector == IVaultFacet.setFee.selector || selector == IBridgeFacet.initVaultActionRequest.selector
) {
validateOwner(caller);
} else {
validateCurator(caller);
}
}
function setPendingOwner(address _newPendingOwner) internal {
if (_newPendingOwner == accessControlStorage().owner) {
revert SameAddress();
}
accessControlStorage().pendingOwner = _newPendingOwner;
emit PendingOwnerSet(_newPendingOwner);
}
/**
* @notice Sets new owner address
* @param _newOwner Address of new owner
*/
function setVaultOwner(address _newOwner) internal {
if (_newOwner == address(0)) {
revert ZeroAddress();
}
AccessControlStorage storage acs = accessControlStorage();
if (_newOwner == acs.owner) {
revert SameAddress();
}
address previousOwner = acs.owner;
acs.owner = _newOwner;
emit OwnerChanged(previousOwner, _newOwner);
}
/**
* @notice Sets new curator address
* @param _newCurator Address of new curator
*/
function setVaultCurator(address _newCurator) internal {
if (_newCurator == address(0)) {
revert ZeroAddress();
}
AccessControlStorage storage acs = accessControlStorage();
if (_newCurator == acs.curator) {
revert SameAddress();
}
address previousCurator = acs.curator;
acs.curator = _newCurator;
emit CuratorChanged(previousCurator, _newCurator);
}
/**
* @notice Sets new guardian address
* @param _newGuardian Address of new guardian
*/
function setVaultGuardian(address _newGuardian) internal {
if (_newGuardian == address(0)) {
revert ZeroAddress();
}
AccessControlStorage storage acs = accessControlStorage();
if (_newGuardian == acs.guardian) {
revert SameAddress();
}
address previousGuardian = acs.guardian;
acs.guardian = _newGuardian;
emit GuardianChanged(previousGuardian, _newGuardian);
}
function setMoreVaultsRegistry(address _newRegistry) internal {
if (_newRegistry == address(0)) {
revert ZeroAddress();
}
AccessControlStorage storage acs = accessControlStorage();
if (_newRegistry == acs.moreVaultsRegistry) {
revert SameAddress();
}
acs.moreVaultsRegistry = _newRegistry;
}
/**
* @notice Gets current owner address
* @return Address of current owner
*/
function vaultOwner() internal view returns (address) {
return accessControlStorage().owner;
}
function pendingOwner() internal view returns (address) {
return accessControlStorage().pendingOwner;
}
/**
* @notice Gets current curator address
* @return Address of current curator
*/
function vaultCurator() internal view returns (address) {
return accessControlStorage().curator;
}
/**
* @notice Gets current guardian address
* @return Address of current guardian
*/
function vaultGuardian() internal view returns (address) {
return accessControlStorage().guardian;
}
/**
* @notice Gets current more vault registry address
* @return Address of current more vault registry
*/
function vaultRegistry() internal view returns (address) {
return accessControlStorage().moreVaultsRegistry;
}
function setVaultRegistry(address newRegistry) internal {
if (newRegistry == address(0)) {
revert ZeroAddress();
}
AccessControlStorage storage acs = accessControlStorage();
address previousRegistry = acs.moreVaultsRegistry;
acs.moreVaultsRegistry = newRegistry;
emit MoreVaultRegistrySet(previousRegistry, newRegistry);
}
} <i class='far fa-question-circle text-muted ms-2' data-bs-trigger='hover' data-bs-toggle='tooltip' data-bs-html='true' data-bs-title='Click on the check box to select individual contract to compare. Only 1 contract can be selected from each side.'></i>
// SPDX-License-Identifier: MIT
pragma solidity 0.8.28;
import {IGenericMoreVaultFacetInitializable} from "./IGenericMoreVaultFacetInitializable.sol";
interface IConfigurationFacet is IGenericMoreVaultFacetInitializable {
/**
* @dev Custom errors
*/
error InvalidAddress();
error InvalidPeriod();
error AssetAlreadyAvailable();
error AssetNotAvailable();
error TimeLockPeriodNotExpired();
error NothingSubmitted();
error ArraysLengthsMismatch();
error InvalidManager();
error SlippageTooHigh();
error FeeIsTooHigh();
/**
* @dev Events
*/
/// @notice Emitted when the MoreVaults registry is set
event MoreVaultRegistrySet(address indexed previousRegistry, address indexed newRegistry);
/// @notice Emitted when a new asset is added
event AssetAdded(address indexed asset);
/// @notice Emitted when an asset is removed
event AssetRemoved(address indexed asset);
/// @notice Emitted when the withdrawal fee is set
event WithdrawalFeeSet(uint96 fee);
/// @notice Emitted when the withdrawal queue status is set
event WithdrawalQueueStatusSet(bool status);
/// @notice Emitted when the withdrawal timelock is set
event WithdrawalTimelockSet(uint64 duration);
/// @notice Emitted when the cross chain accounting manager is set
event CrossChainAccountingManagerSet(address indexed manager);
/// @notice Emitted when the max slippage percent is set
event MaxSlippagePercentSet(uint256 percent);
/**
* @notice Sets fee recipient address, callable by owner
* @param recipient New fee recipient address
*/
function setFeeRecipient(address recipient) external;
/**
* @notice Sets time lock period, callable by owner through `submitActions` and timelocked
* @param period New time lock period (in seconds)
*/
function setTimeLockPeriod(uint256 period) external;
/**
* @notice Sets deposit capacity, callable by curator or owner
* @param capacity New deposit capacity
*/
function setDepositCapacity(uint256 capacity) external;
/**
* @notice Sets deposit whitelist, callable by owner
* @param depositors Array of depositors
* @param undelyingAssetCaps Array of underlying asset caps
*/
function setDepositWhitelist(address[] calldata depositors, uint256[] calldata undelyingAssetCaps) external;
/**
* @notice Enables deposit whitelist, callable by owner
*/
function enableDepositWhitelist() external;
/**
* @notice Disables deposit whitelist, callable by owner through `submitActions` and timelocked
*/
function disableDepositWhitelist() external;
/**
* @notice Disables deposit whitelist
*/
/**
* @notice Gets deposit whitelist
* @param depositor Depositor address
* @return Undelying asset cap
*/
function getDepositWhitelist(address depositor) external view returns (uint256);
/**
* @notice Adds new available asset, callable by curator or owner
* @param asset Asset address to add
*/
function addAvailableAsset(address asset) external;
/**
* @notice Batch adds new available assets, callable by curator or owner
* @param assets Array of asset addresses to add
*/
function addAvailableAssets(address[] calldata assets) external;
/**
* @notice Enables asset to deposit, callable by curator or owner through `submitActions` and timelocked
* @param asset Asset address to enable
*/
function enableAssetToDeposit(address asset) external;
/**
* @notice Disables asset to deposit, callable by curator
* @param asset Asset address to disable
*/
function disableAssetToDeposit(address asset) external;
/**
* @notice Set the withdrawal fee, callable by owner through `submitActions` and timelocked
* @param _fee New withdrawal fee
*/
function setWithdrawalFee(uint96 _fee) external;
/**
* @notice Update the withdraw timelock duration, callable by owner through `submitActions` and timelocked
* @param duration New withdraw timelock duration
*/
function setWithdrawalTimelock(uint64 duration) external;
/**
* @notice Update the withdrawal queue status, callable by owner through `submitActions` and timelocked
* @param _status New withdrawal queue status
*/
function updateWithdrawalQueueStatus(bool _status) external;
/**
* @notice Sets gas limit for accounting, callable by curator or owner through `submitActions` and timelocked
* @param _availableTokenAccountingGas Gas limit for available token accounting
* @param _heldTokenAccountingGas Gas limit for held token accounting
* @param _facetAccountingGas Gas limit for facet accounting
* @param _newLimit New gas limit
*/
function setGasLimitForAccounting(
uint48 _availableTokenAccountingGas,
uint48 _heldTokenAccountingGas,
uint48 _facetAccountingGas,
uint48 _newLimit
) external;
/**
* @notice Sets max slippage percent, callable by curator or owner through `submitActions` and timelocked
* @param _newPercent New max slippage percent
*/
function setMaxSlippagePercent(uint256 _newPercent) external;
/**
* @notice Sets cross chain accounting manager, callable by owner through `submitActions` and timelocked
* @param manager New cross chain accounting manager
*/
function setCrossChainAccountingManager(address manager) external;
/**
* @notice Get the current withdrawal fee
* @return The current withdrawal fee in basis points
*/
function getWithdrawalFee() external view returns (uint96);
/**
* @notice Get the current withdrawal queue status
* @return The current withdrawal queue status
*/
function getWithdrawalQueueStatus() external view returns (bool);
/**
* @notice Gets list of depositable assets
* @return Array of depositable asset addresses
*/
function getDepositableAssets() external view returns (address[] memory);
/**
* @notice Checks if asset is available
* @param asset Asset address to check
* @return true if asset is available
*/
function isAssetAvailable(address asset) external view returns (bool);
/**
* @notice Checks if asset is depositable
* @param asset Asset address to check
* @return true if asset is depositable
*/
function isAssetDepositable(address asset) external view returns (bool);
/**
* @notice Checks if deposit whitelist is enabled
* @return true if deposit whitelist is enabled
*/
function isDepositWhitelistEnabled() external view returns (bool);
/**
* @notice Checks if vault is hub
* @return true if vault is hub
*/
function isHub() external view returns (bool);
/**
* @notice Gets list of all available assets
* @return Array of available asset addresses
*/
function getAvailableAssets() external view returns (address[] memory);
/**
* @notice Gets fee amount
* @return Fee amount
*/
function fee() external view returns (uint96);
/**
* @notice Gets fee recipient address
* @return Fee recipient address
*/
function feeRecipient() external view returns (address);
/**
* @notice Gets deposit capacity
* @return Deposit capacity
*/
function depositCapacity() external view returns (uint256);
/**
* @notice Gets time lock period
* @return Time lock period
*/
function timeLockPeriod() external view returns (uint256);
/// @notice Returns the withdrawal timelock duration
/// @return duration The withdrawal timelock duration
function getWithdrawalTimelock() external view returns (uint64);
/// @notice Get the lockedTokens amount of an asset
/// @param asset The asset to get the lockedTokens amount of
/// @return The lockedTokens amount of the asset
function lockedTokensAmountOfAsset(address asset) external view returns (uint256);
/// @notice Get the staking addresses for a given staking facet
/// @param stakingFacetId The staking facet to get the staking addresses of
/// @return The staking addresses for the given staking facet
function getStakingAddresses(bytes32 stakingFacetId) external view returns (address[] memory);
/// @notice Returns array of tokens held in the vault based on their IDs
/// @param tokenId token type ID
/// @return array of token addresses
function tokensHeld(bytes32 tokenId) external view returns (address[] memory);
/// @notice Get the cross chain accounting manager
/// @return The cross chain accounting manager
function getCrossChainAccountingManager() external view returns (address);
} <i class='far fa-question-circle text-muted ms-2' data-bs-trigger='hover' data-bs-toggle='tooltip' data-bs-html='true' data-bs-title='Click on the check box to select individual contract to compare. Only 1 contract can be selected from each side.'></i>
// SPDX-License-Identifier: MIT
pragma solidity 0.8.28;
/**
* @dev This is a base storage for the initialization function for upgradeable diamond facet contracts
*
*/
abstract contract BaseFacetInitializer {
error InvalidParameters();
error AlreadyInitialized();
error FacetNotInitializing();
struct Layout {
/*
* Indicates that the contract has been initialized.
*/
bool _initialized;
/*
* Indicates that the contract is in the process of being initialized.
*/
bool _initializing;
}
/**
* @dev Returns the storage slot for this contract
* @return bytes32 The storage slot
*/
function INITIALIZABLE_STORAGE_SLOT() internal pure virtual returns (bytes32);
function layoutInitializableStorage() internal pure returns (Layout storage l) {
bytes32 slot = INITIALIZABLE_STORAGE_SLOT();
assembly {
l.slot := slot
}
}
/**
* @dev Modifier to protect an initializer function from being invoked twice.
*/
modifier initializerFacet() {
if (layoutInitializableStorage()._initializing ? !_isConstructor() : layoutInitializableStorage()._initialized)
{
revert AlreadyInitialized();
}
bool isTopLevelCall = !layoutInitializableStorage()._initializing;
if (isTopLevelCall) {
layoutInitializableStorage()._initializing = true;
layoutInitializableStorage()._initialized = true;
}
_;
if (isTopLevelCall) {
layoutInitializableStorage()._initializing = false;
}
}
/**
* @dev Modifier to protect an initialization function so that it can only be invoked by functions with the
* {initializer} modifier, directly or indirectly.
*/
modifier onlyInitializingFacet() {
if (!layoutInitializableStorage()._initializing) {
revert FacetNotInitializing();
}
_;
}
/// @dev Returns true if and only if the function is running in the constructor
function _isConstructor() private view returns (bool) {
// extcodesize checks the size of the code stored in an address, and
// address returns the current address. Since the code is still not
// deployed when running a constructor, any checks on its code size will
// yield zero, making it an effective way to detect if a contract is
// under construction or not.
address self = address(this);
uint256 cs;
assembly {
cs := extcodesize(self)
}
return cs == 0;
}
} <i class='far fa-question-circle text-muted ms-2' data-bs-trigger='hover' data-bs-toggle='tooltip' data-bs-html='true' data-bs-title='Click on the check box to select individual contract to compare. Only 1 contract can be selected from each side.'></i>
// SPDX-License-Identifier: MIT
// OpenZeppelin Contracts (last updated v5.4.0) (utils/structs/EnumerableSet.sol)
// This file was procedurally generated from scripts/generate/templates/EnumerableSet.js.
pragma solidity ^0.8.20;
import {Arrays} from "../Arrays.sol";
import {Math} from "../math/Math.sol";
/**
* @dev Library for managing
* https://en.wikipedia.org/wiki/Set_(abstract_data_type)[sets] of primitive
* types.
*
* Sets have the following properties:
*
* - Elements are added, removed, and checked for existence in constant time
* (O(1)).
* - Elements are enumerated in O(n). No guarantees are made on the ordering.
* - Set can be cleared (all elements removed) in O(n).
*
* ```solidity
* contract Example {
* // Add the library methods
* using EnumerableSet for EnumerableSet.AddressSet;
*
* // Declare a set state variable
* EnumerableSet.AddressSet private mySet;
* }
* ```
*
* The following types are supported:
*
* - `bytes32` (`Bytes32Set`) since v3.3.0
* - `address` (`AddressSet`) since v3.3.0
* - `uint256` (`UintSet`) since v3.3.0
* - `string` (`StringSet`) since v5.4.0
* - `bytes` (`BytesSet`) since v5.4.0
*
* [WARNING]
* ====
* Trying to delete such a structure from storage will likely result in data corruption, rendering the structure
* unusable.
* See https://github.com/ethereum/solidity/pull/11843[ethereum/solidity#11843] for more info.
*
* In order to clean an EnumerableSet, you can either remove all elements one by one or create a fresh instance using an
* array of EnumerableSet.
* ====
*/
library EnumerableSet {
// To implement this library for multiple types with as little code
// repetition as possible, we write it in terms of a generic Set type with
// bytes32 values.
// The Set implementation uses private functions, and user-facing
// implementations (such as AddressSet) are just wrappers around the
// underlying Set.
// This means that we can only create new EnumerableSets for types that fit
// in bytes32.
struct Set {
// Storage of set values
bytes32[] _values;
// Position is the index of the value in the `values` array plus 1.
// Position 0 is used to mean a value is not in the set.
mapping(bytes32 value => uint256) _positions;
}
/**
* @dev Add a value to a set. O(1).
*
* Returns true if the value was added to the set, that is if it was not
* already present.
*/
function _add(Set storage set, bytes32 value) private returns (bool) {
if (!_contains(set, value)) {
set._values.push(value);
// The value is stored at length-1, but we add 1 to all indexes
// and use 0 as a sentinel value
set._positions[value] = set._values.length;
return true;
} else {
return false;
}
}
/**
* @dev Removes a value from a set. O(1).
*
* Returns true if the value was removed from the set, that is if it was
* present.
*/
function _remove(Set storage set, bytes32 value) private returns (bool) {
// We cache the value's position to prevent multiple reads from the same storage slot
uint256 position = set._positions[value];
if (position != 0) {
// Equivalent to contains(set, value)
// To delete an element from the _values array in O(1), we swap the element to delete with the last one in
// the array, and then remove the last element (sometimes called as 'swap and pop').
// This modifies the order of the array, as noted in {at}.
uint256 valueIndex = position - 1;
uint256 lastIndex = set._values.length - 1;
if (valueIndex != lastIndex) {
bytes32 lastValue = set._values[lastIndex];
// Move the lastValue to the index where the value to delete is
set._values[valueIndex] = lastValue;
// Update the tracked position of the lastValue (that was just moved)
set._positions[lastValue] = position;
}
// Delete the slot where the moved value was stored
set._values.pop();
// Delete the tracked position for the deleted slot
delete set._positions[value];
return true;
} else {
return false;
}
}
/**
* @dev Removes all the values from a set. O(n).
*
* WARNING: This function has an unbounded cost that scales with set size. Developers should keep in mind that
* using it may render the function uncallable if the set grows to the point where clearing it consumes too much
* gas to fit in a block.
*/
function _clear(Set storage set) private {
uint256 len = _length(set);
for (uint256 i = 0; i < len; ++i) {
delete set._positions[set._values[i]];
}
Arrays.unsafeSetLength(set._values, 0);
}
/**
* @dev Returns true if the value is in the set. O(1).
*/
function _contains(Set storage set, bytes32 value) private view returns (bool) {
return set._positions[value] != 0;
}
/**
* @dev Returns the number of values on the set. O(1).
*/
function _length(Set storage set) private view returns (uint256) {
return set._values.length;
}
/**
* @dev Returns the value stored at position `index` in the set. O(1).
*
* Note that there are no guarantees on the ordering of values inside the
* array, and it may change when more values are added or removed.
*
* Requirements:
*
* - `index` must be strictly less than {length}.
*/
function _at(Set storage set, uint256 index) private view returns (bytes32) {
return set._values[index];
}
/**
* @dev Return the entire set in an array
*
* WARNING: This operation will copy the entire storage to memory, which can be quite expensive. This is designed
* to mostly be used by view accessors that are queried without any gas fees. Developers should keep in mind that
* this function has an unbounded cost, and using it as part of a state-changing function may render the function
* uncallable if the set grows to a point where copying to memory consumes too much gas to fit in a block.
*/
function _values(Set storage set) private view returns (bytes32[] memory) {
return set._values;
}
/**
* @dev Return a slice of the set in an array
*
* WARNING: This operation will copy the entire storage to memory, which can be quite expensive. This is designed
* to mostly be used by view accessors that are queried without any gas fees. Developers should keep in mind that
* this function has an unbounded cost, and using it as part of a state-changing function may render the function
* uncallable if the set grows to a point where copying to memory consumes too much gas to fit in a block.
*/
function _values(Set storage set, uint256 start, uint256 end) private view returns (bytes32[] memory) {
unchecked {
end = Math.min(end, _length(set));
start = Math.min(start, end);
uint256 len = end - start;
bytes32[] memory result = new bytes32[](len);
for (uint256 i = 0; i < len; ++i) {
result[i] = Arrays.unsafeAccess(set._values, start + i).value;
}
return result;
}
}
// Bytes32Set
struct Bytes32Set {
Set _inner;
}
/**
* @dev Add a value to a set. O(1).
*
* Returns true if the value was added to the set, that is if it was not
* already present.
*/
function add(Bytes32Set storage set, bytes32 value) internal returns (bool) {
return _add(set._inner, value);
}
/**
* @dev Removes a value from a set. O(1).
*
* Returns true if the value was removed from the set, that is if it was
* present.
*/
function remove(Bytes32Set storage set, bytes32 value) internal returns (bool) {
return _remove(set._inner, value);
}
/**
* @dev Removes all the values from a set. O(n).
*
* WARNING: Developers should keep in mind that this function has an unbounded cost and using it may render the
* function uncallable if the set grows to the point where clearing it consumes too much gas to fit in a block.
*/
function clear(Bytes32Set storage set) internal {
_clear(set._inner);
}
/**
* @dev Returns true if the value is in the set. O(1).
*/
function contains(Bytes32Set storage set, bytes32 value) internal view returns (bool) {
return _contains(set._inner, value);
}
/**
* @dev Returns the number of values in the set. O(1).
*/
function length(Bytes32Set storage set) internal view returns (uint256) {
return _length(set._inner);
}
/**
* @dev Returns the value stored at position `index` in the set. O(1).
*
* Note that there are no guarantees on the ordering of values inside the
* array, and it may change when more values are added or removed.
*
* Requirements:
*
* - `index` must be strictly less than {length}.
*/
function at(Bytes32Set storage set, uint256 index) internal view returns (bytes32) {
return _at(set._inner, index);
}
/**
* @dev Return the entire set in an array
*
* WARNING: This operation will copy the entire storage to memory, which can be quite expensive. This is designed
* to mostly be used by view accessors that are queried without any gas fees. Developers should keep in mind that
* this function has an unbounded cost, and using it as part of a state-changing function may render the function
* uncallable if the set grows to a point where copying to memory consumes too much gas to fit in a block.
*/
function values(Bytes32Set storage set) internal view returns (bytes32[] memory) {
bytes32[] memory store = _values(set._inner);
bytes32[] memory result;
assembly ("memory-safe") {
result := store
}
return result;
}
/**
* @dev Return a slice of the set in an array
*
* WARNING: This operation will copy the entire storage to memory, which can be quite expensive. This is designed
* to mostly be used by view accessors that are queried without any gas fees. Developers should keep in mind that
* this function has an unbounded cost, and using it as part of a state-changing function may render the function
* uncallable if the set grows to a point where copying to memory consumes too much gas to fit in a block.
*/
function values(Bytes32Set storage set, uint256 start, uint256 end) internal view returns (bytes32[] memory) {
bytes32[] memory store = _values(set._inner, start, end);
bytes32[] memory result;
assembly ("memory-safe") {
result := store
}
return result;
}
// AddressSet
struct AddressSet {
Set _inner;
}
/**
* @dev Add a value to a set. O(1).
*
* Returns true if the value was added to the set, that is if it was not
* already present.
*/
function add(AddressSet storage set, address value) internal returns (bool) {
return _add(set._inner, bytes32(uint256(uint160(value))));
}
/**
* @dev Removes a value from a set. O(1).
*
* Returns true if the value was removed from the set, that is if it was
* present.
*/
function remove(AddressSet storage set, address value) internal returns (bool) {
return _remove(set._inner, bytes32(uint256(uint160(value))));
}
/**
* @dev Removes all the values from a set. O(n).
*
* WARNING: Developers should keep in mind that this function has an unbounded cost and using it may render the
* function uncallable if the set grows to the point where clearing it consumes too much gas to fit in a block.
*/
function clear(AddressSet storage set) internal {
_clear(set._inner);
}
/**
* @dev Returns true if the value is in the set. O(1).
*/
function contains(AddressSet storage set, address value) internal view returns (bool) {
return _contains(set._inner, bytes32(uint256(uint160(value))));
}
/**
* @dev Returns the number of values in the set. O(1).
*/
function length(AddressSet storage set) internal view returns (uint256) {
return _length(set._inner);
}
/**
* @dev Returns the value stored at position `index` in the set. O(1).
*
* Note that there are no guarantees on the ordering of values inside the
* array, and it may change when more values are added or removed.
*
* Requirements:
*
* - `index` must be strictly less than {length}.
*/
function at(AddressSet storage set, uint256 index) internal view returns (address) {
return address(uint160(uint256(_at(set._inner, index))));
}
/**
* @dev Return the entire set in an array
*
* WARNING: This operation will copy the entire storage to memory, which can be quite expensive. This is designed
* to mostly be used by view accessors that are queried without any gas fees. Developers should keep in mind that
* this function has an unbounded cost, and using it as part of a state-changing function may render the function
* uncallable if the set grows to a point where copying to memory consumes too much gas to fit in a block.
*/
function values(AddressSet storage set) internal view returns (address[] memory) {
bytes32[] memory store = _values(set._inner);
address[] memory result;
assembly ("memory-safe") {
result := store
}
return result;
}
/**
* @dev Return a slice of the set in an array
*
* WARNING: This operation will copy the entire storage to memory, which can be quite expensive. This is designed
* to mostly be used by view accessors that are queried without any gas fees. Developers should keep in mind that
* this function has an unbounded cost, and using it as part of a state-changing function may render the function
* uncallable if the set grows to a point where copying to memory consumes too much gas to fit in a block.
*/
function values(AddressSet storage set, uint256 start, uint256 end) internal view returns (address[] memory) {
bytes32[] memory store = _values(set._inner, start, end);
address[] memory result;
assembly ("memory-safe") {
result := store
}
return result;
}
// UintSet
struct UintSet {
Set _inner;
}
/**
* @dev Add a value to a set. O(1).
*
* Returns true if the value was added to the set, that is if it was not
* already present.
*/
function add(UintSet storage set, uint256 value) internal returns (bool) {
return _add(set._inner, bytes32(value));
}
/**
* @dev Removes a value from a set. O(1).
*
* Returns true if the value was removed from the set, that is if it was
* present.
*/
function remove(UintSet storage set, uint256 value) internal returns (bool) {
return _remove(set._inner, bytes32(value));
}
/**
* @dev Removes all the values from a set. O(n).
*
* WARNING: Developers should keep in mind that this function has an unbounded cost and using it may render the
* function uncallable if the set grows to the point where clearing it consumes too much gas to fit in a block.
*/
function clear(UintSet storage set) internal {
_clear(set._inner);
}
/**
* @dev Returns true if the value is in the set. O(1).
*/
function contains(UintSet storage set, uint256 value) internal view returns (bool) {
return _contains(set._inner, bytes32(value));
}
/**
* @dev Returns the number of values in the set. O(1).
*/
function length(UintSet storage set) internal view returns (uint256) {
return _length(set._inner);
}
/**
* @dev Returns the value stored at position `index` in the set. O(1).
*
* Note that there are no guarantees on the ordering of values inside the
* array, and it may change when more values are added or removed.
*
* Requirements:
*
* - `index` must be strictly less than {length}.
*/
function at(UintSet storage set, uint256 index) internal view returns (uint256) {
return uint256(_at(set._inner, index));
}
/**
* @dev Return the entire set in an array
*
* WARNING: This operation will copy the entire storage to memory, which can be quite expensive. This is designed
* to mostly be used by view accessors that are queried without any gas fees. Developers should keep in mind that
* this function has an unbounded cost, and using it as part of a state-changing function may render the function
* uncallable if the set grows to a point where copying to memory consumes too much gas to fit in a block.
*/
function values(UintSet storage set) internal view returns (uint256[] memory) {
bytes32[] memory store = _values(set._inner);
uint256[] memory result;
assembly ("memory-safe") {
result := store
}
return result;
}
/**
* @dev Return a slice of the set in an array
*
* WARNING: This operation will copy the entire storage to memory, which can be quite expensive. This is designed
* to mostly be used by view accessors that are queried without any gas fees. Developers should keep in mind that
* this function has an unbounded cost, and using it as part of a state-changing function may render the function
* uncallable if the set grows to a point where copying to memory consumes too much gas to fit in a block.
*/
function values(UintSet storage set, uint256 start, uint256 end) internal view returns (uint256[] memory) {
bytes32[] memory store = _values(set._inner, start, end);
uint256[] memory result;
assembly ("memory-safe") {
result := store
}
return result;
}
struct StringSet {
// Storage of set values
string[] _values;
// Position is the index of the value in the `values` array plus 1.
// Position 0 is used to mean a value is not in the set.
mapping(string value => uint256) _positions;
}
/**
* @dev Add a value to a set. O(1).
*
* Returns true if the value was added to the set, that is if it was not
* already present.
*/
function add(StringSet storage set, string memory value) internal returns (bool) {
if (!contains(set, value)) {
set._values.push(value);
// The value is stored at length-1, but we add 1 to all indexes
// and use 0 as a sentinel value
set._positions[value] = set._values.length;
return true;
} else {
return false;
}
}
/**
* @dev Removes a value from a set. O(1).
*
* Returns true if the value was removed from the set, that is if it was
* present.
*/
function remove(StringSet storage set, string memory value) internal returns (bool) {
// We cache the value's position to prevent multiple reads from the same storage slot
uint256 position = set._positions[value];
if (position != 0) {
// Equivalent to contains(set, value)
// To delete an element from the _values array in O(1), we swap the element to delete with the last one in
// the array, and then remove the last element (sometimes called as 'swap and pop').
// This modifies the order of the array, as noted in {at}.
uint256 valueIndex = position - 1;
uint256 lastIndex = set._values.length - 1;
if (valueIndex != lastIndex) {
string memory lastValue = set._values[lastIndex];
// Move the lastValue to the index where the value to delete is
set._values[valueIndex] = lastValue;
// Update the tracked position of the lastValue (that was just moved)
set._positions[lastValue] = position;
}
// Delete the slot where the moved value was stored
set._values.pop();
// Delete the tracked position for the deleted slot
delete set._positions[value];
return true;
} else {
return false;
}
}
/**
* @dev Removes all the values from a set. O(n).
*
* WARNING: Developers should keep in mind that this function has an unbounded cost and using it may render the
* function uncallable if the set grows to the point where clearing it consumes too much gas to fit in a block.
*/
function clear(StringSet storage set) internal {
uint256 len = length(set);
for (uint256 i = 0; i < len; ++i) {
delete set._positions[set._values[i]];
}
Arrays.unsafeSetLength(set._values, 0);
}
/**
* @dev Returns true if the value is in the set. O(1).
*/
function contains(StringSet storage set, string memory value) internal view returns (bool) {
return set._positions[value] != 0;
}
/**
* @dev Returns the number of values on the set. O(1).
*/
function length(StringSet storage set) internal view returns (uint256) {
return set._values.length;
}
/**
* @dev Returns the value stored at position `index` in the set. O(1).
*
* Note that there are no guarantees on the ordering of values inside the
* array, and it may change when more values are added or removed.
*
* Requirements:
*
* - `index` must be strictly less than {length}.
*/
function at(StringSet storage set, uint256 index) internal view returns (string memory) {
return set._values[index];
}
/**
* @dev Return the entire set in an array
*
* WARNING: This operation will copy the entire storage to memory, which can be quite expensive. This is designed
* to mostly be used by view accessors that are queried without any gas fees. Developers should keep in mind that
* this function has an unbounded cost, and using it as part of a state-changing function may render the function
* uncallable if the set grows to a point where copying to memory consumes too much gas to fit in a block.
*/
function values(StringSet storage set) internal view returns (string[] memory) {
return set._values;
}
/**
* @dev Return a slice of the set in an array
*
* WARNING: This operation will copy the entire storage to memory, which can be quite expensive. This is designed
* to mostly be used by view accessors that are queried without any gas fees. Developers should keep in mind that
* this function has an unbounded cost, and using it as part of a state-changing function may render the function
* uncallable if the set grows to a point where copying to memory consumes too much gas to fit in a block.
*/
function values(StringSet storage set, uint256 start, uint256 end) internal view returns (string[] memory) {
unchecked {
end = Math.min(end, length(set));
start = Math.min(start, end);
uint256 len = end - start;
string[] memory result = new string[](len);
for (uint256 i = 0; i < len; ++i) {
result[i] = Arrays.unsafeAccess(set._values, start + i).value;
}
return result;
}
}
struct BytesSet {
// Storage of set values
bytes[] _values;
// Position is the index of the value in the `values` array plus 1.
// Position 0 is used to mean a value is not in the set.
mapping(bytes value => uint256) _positions;
}
/**
* @dev Add a value to a set. O(1).
*
* Returns true if the value was added to the set, that is if it was not
* already present.
*/
function add(BytesSet storage set, bytes memory value) internal returns (bool) {
if (!contains(set, value)) {
set._values.push(value);
// The value is stored at length-1, but we add 1 to all indexes
// and use 0 as a sentinel value
set._positions[value] = set._values.length;
return true;
} else {
return false;
}
}
/**
* @dev Removes a value from a set. O(1).
*
* Returns true if the value was removed from the set, that is if it was
* present.
*/
function remove(BytesSet storage set, bytes memory value) internal returns (bool) {
// We cache the value's position to prevent multiple reads from the same storage slot
uint256 position = set._positions[value];
if (position != 0) {
// Equivalent to contains(set, value)
// To delete an element from the _values array in O(1), we swap the element to delete with the last one in
// the array, and then remove the last element (sometimes called as 'swap and pop').
// This modifies the order of the array, as noted in {at}.
uint256 valueIndex = position - 1;
uint256 lastIndex = set._values.length - 1;
if (valueIndex != lastIndex) {
bytes memory lastValue = set._values[lastIndex];
// Move the lastValue to the index where the value to delete is
set._values[valueIndex] = lastValue;
// Update the tracked position of the lastValue (that was just moved)
set._positions[lastValue] = position;
}
// Delete the slot where the moved value was stored
set._values.pop();
// Delete the tracked position for the deleted slot
delete set._positions[value];
return true;
} else {
return false;
}
}
/**
* @dev Removes all the values from a set. O(n).
*
* WARNING: Developers should keep in mind that this function has an unbounded cost and using it may render the
* function uncallable if the set grows to the point where clearing it consumes too much gas to fit in a block.
*/
function clear(BytesSet storage set) internal {
uint256 len = length(set);
for (uint256 i = 0; i < len; ++i) {
delete set._positions[set._values[i]];
}
Arrays.unsafeSetLength(set._values, 0);
}
/**
* @dev Returns true if the value is in the set. O(1).
*/
function contains(BytesSet storage set, bytes memory value) internal view returns (bool) {
return set._positions[value] != 0;
}
/**
* @dev Returns the number of values on the set. O(1).
*/
function length(BytesSet storage set) internal view returns (uint256) {
return set._values.length;
}
/**
* @dev Returns the value stored at position `index` in the set. O(1).
*
* Note that there are no guarantees on the ordering of values inside the
* array, and it may change when more values are added or removed.
*
* Requirements:
*
* - `index` must be strictly less than {length}.
*/
function at(BytesSet storage set, uint256 index) internal view returns (bytes memory) {
return set._values[index];
}
/**
* @dev Return the entire set in an array
*
* WARNING: This operation will copy the entire storage to memory, which can be quite expensive. This is designed
* to mostly be used by view accessors that are queried without any gas fees. Developers should keep in mind that
* this function has an unbounded cost, and using it as part of a state-changing function may render the function
* uncallable if the set grows to a point where copying to memory consumes too much gas to fit in a block.
*/
function values(BytesSet storage set) internal view returns (bytes[] memory) {
return set._values;
}
/**
* @dev Return a slice of the set in an array
*
* WARNING: This operation will copy the entire storage to memory, which can be quite expensive. This is designed
* to mostly be used by view accessors that are queried without any gas fees. Developers should keep in mind that
* this function has an unbounded cost, and using it as part of a state-changing function may render the function
* uncallable if the set grows to a point where copying to memory consumes too much gas to fit in a block.
*/
function values(BytesSet storage set, uint256 start, uint256 end) internal view returns (bytes[] memory) {
unchecked {
end = Math.min(end, length(set));
start = Math.min(start, end);
uint256 len = end - start;
bytes[] memory result = new bytes[](len);
for (uint256 i = 0; i < len; ++i) {
result[i] = Arrays.unsafeAccess(set._values, start + i).value;
}
return result;
}
}
} <i class='far fa-question-circle text-muted ms-2' data-bs-trigger='hover' data-bs-toggle='tooltip' data-bs-html='true' data-bs-title='Click on the check box to select individual contract to compare. Only 1 contract can be selected from each side.'></i>
// SPDX-License-Identifier: MIT
pragma solidity 0.8.28;
import {IOracleRegistry} from "./IOracleRegistry.sol";
/**
* @title IVaultRegistry
* @notice Interface for VaultRegistry contract that manages allowed facets and their selectors
*/
interface IMoreVaultsRegistry {
error ZeroAddress();
error FacetAlreadyExists(address facet);
error FacetNotAllowed(address facet);
error SelectorAlreadyExists(address facet, bytes4 selector);
struct ProtocolFeeInfo {
address recipient;
uint96 fee;
}
/**
* @dev Emitted when new facet is added with its selectors
* @param facet Address of added facet
* @param selectors Array of function selectors
*/
event FacetAdded(address indexed facet, bytes4[] selectors);
/**
* @dev Emitted when facet is edited
* @param facet Address of edited facet
* @param selectors Array of function selectors
* @param addOrRemove Array with flags for add/remove of selector with same index
*/
event FacetEdited(address indexed facet, bytes4[] selectors, bool[] addOrRemove);
/**
* @dev Emitted when facet is removed
* @param facet Address of removed facet
*/
event FacetRemoved(address indexed facet);
/**
* @dev Emitted when oracle registry address is updated
* @param oldOracleRegistry Previous oracle registry address
* @param newOracleRegistry New oracle registry address
*/
event OracleRegistryUpdated(address indexed oldOracleRegistry, address indexed newOracleRegistry);
/**
* @dev Emitted when protocol fee info is updated
* @param vault Address of the vault
* @param recipient Address of the protocol fee recipient
* @param fee Protocol fee
*/
event ProtocolFeeInfoUpdated(address indexed vault, address indexed recipient, uint96 fee);
/**
* @dev Emitted when protocol is whitelisted
* @param protocol Address of the protocol
* @param whitelisted True if protocol is whitelisted, false otherwise
*/
event AddressWhitelisted(address indexed protocol, bool whitelisted);
/**
* @dev Emitted when bridge is allowed
* @param bridge Address of the bridge
* @param allowed True if bridge is allowed, false otherwise
*/
event BridgeUpdated(address indexed bridge, bool allowed);
/**
* @dev Emitted when cross chain accounting manager is updated
* @param manager Address of the cross chain accounting manager
* @param isManager True if cross chain accounting manager is allowed, false otherwise
*/
event CrossChainAccountingManagerSet(address indexed manager, bool isManager);
/**
* @dev Emitted when default cross chain accounting manager is set
* @param manager Address of the default cross chain accounting manager
*/
event DefaultCrossChainAccountingManagerSet(address indexed manager);
/**
* @notice Initialize the registry
* @param _owner Address of the owner
* @param _oracle Address of the oracle
* @param _usdStableTokenAddress Address of the USD stable token
*/
function initialize(address _owner, address _oracle, address _usdStableTokenAddress) external;
/**
* @notice returns bool flag if registry is permissionless
* @return bool flag if registry permissionless or not
*/
function isPermissionless() external view returns (bool);
/**
* @notice Add new facet with its selectors, also can add new selectors to existing facet
* @param facet Address of the facet contract
* @param selectors Array of function selectors
*/
function addFacet(address facet, bytes4[] calldata selectors) external;
/**
* @notice Edit selectors for the facet
* @param facet Address of the facet contract
* @param selectors Array of function selectors
* @param addOrRemove Array with flags for add/remove of selector with same index
*/
function editFacet(address facet, bytes4[] calldata selectors, bool[] calldata addOrRemove) external;
/**
* @notice Remove facet and all its selectors
* @param facet Address of the facet contract
*/
function removeFacet(address facet) external;
/**
* @notice Update oracle address
* @param newOracleRegistry Address of new oracle registry
*/
function updateOracleRegistry(address newOracleRegistry) external;
/**
* @notice Set protocol fee info
* @param vault Address of the vault
* @param recipient Address of the protocol fee recipient
* @param fee Protocol fee
*/
function setProtocolFeeInfo(address vault, address recipient, uint96 fee) external;
/**
* @notice Set selector allowed
* @param vault Address of the vault
* @param selector Function selector
* @param allowed True if selector is allowed, false otherwise
* @param mask Mask for the selector
*/
function setSelectorAndMask(address vault, bytes4 selector, bool allowed, bytes memory mask) external;
/**
* @notice Set default cross chain accounting manager
* @param manager Address of the default cross chain accounting manager
*/
function setDefaultCrossChainAccountingManager(address manager) external;
/**
* @notice Set is cross chain accounting manager
* @param manager Address of the cross chain accounting manager
* @param isManager True if cross chain accounting manager is allowed, false otherwise
*/
function setIsCrossChainAccountingManager(address manager, bool isManager) external;
/**
* @notice Get all selectors for facet
* @param facet Address of the facet contract
* @return Array of selectors
*/
function getFacetSelectors(address facet) external view returns (bytes4[] memory);
/**
* @notice Get list of all allowed facets
* @return Array of facet addresses
*/
function getAllowedFacets() external view returns (address[] memory);
/**
* @notice Get protocol fee info
* @param vault Address of the vault
* @return address Address of the protocol fee recipient
* @return uint96 Protocol fee
*/
function protocolFeeInfo(address vault) external view returns (address, uint96);
/**
* @notice Get oracle address
* @return IOracleRegistry Oracle registry contract
*/
function oracle() external view returns (IOracleRegistry);
/**
* @notice Get facet address for selector
* @param selector Function selector
* @return address Facet address
*/
function selectorToFacet(bytes4 selector) external view returns (address);
/**
* @notice Get facet address by index
* @param index Index in facets list
* @return address Facet address
*/
function facetsList(uint256 index) external view returns (address);
/**
* @notice Get denomination asset decimals
* @return uint8 Decimals of denomination asset
*/
function getDenominationAssetDecimals() external view returns (uint8);
/**
* @notice Get denomination asset
* @return address Denomination asset
*/
function getDenominationAsset() external view returns (address);
/**
* @notice Check if facet is allowed
* @param facet Address to check
* @return bool True if facet is allowed
*/
function isFacetAllowed(address facet) external view returns (bool);
/**
* @notice Add protocol to whitelist
* @param protocol Address of the protocol
*/
function addToWhitelist(address protocol) external;
/**
* @notice Remove protocol from whitelist
* @param protocol Address of the protocol
*/
function removeFromWhitelist(address protocol) external;
/**
* @notice Check if protocol is whitelisted
* @param protocol Address of the protocol
* @return bool True if protocol is whitelisted
*/
function isWhitelisted(address protocol) external view returns (bool);
/**
* @notice Add bridge to allowed list
* @param bridge Address of the bridge
* @param allowed True if bridge is allowed, false otherwise
*/
function setBridge(address bridge, bool allowed) external;
/**
* @notice Check if bridge is allowed
* @param bridge Address of the bridge
* @return bool True if bridge is allowed
*/
function isBridgeAllowed(address bridge) external view returns (bool);
/**
* @notice Check if selector is allowed
* @param vault Address of the vault
* @param selector Function selector
* @return bool True if selector is allowed
* @return bytes Mask for the selector
*/
function selectorInfo(address vault, bytes4 selector) external view returns (bool, bytes memory);
/**
* @notice Check if an address is a cross chain accounting manager
* @param manager Address of the manager to check
* @return bool True if the address is a cross chain accounting manager, false otherwise
*/
function isCrossChainAccountingManager(address manager) external view returns (bool);
/**
* @notice Get default cross chain accounting manager
* @return address Default cross chain accounting manager
*/
function defaultCrossChainAccountingManager() external view returns (address);
} <i class='far fa-question-circle text-muted ms-2' data-bs-trigger='hover' data-bs-toggle='tooltip' data-bs-html='true' data-bs-title='Click on the check box to select individual contract to compare. Only 1 contract can be selected from each side.'></i>
// SPDX-License-Identifier: MIT
pragma solidity 0.8.28;
import {IGenericMoreVaultFacetInitializable} from "./IGenericMoreVaultFacetInitializable.sol";
interface IDiamondCut is IGenericMoreVaultFacetInitializable {
enum FacetCutAction {
Add,
Replace,
Remove
}
// Add=0, Replace=1, Remove=2
struct FacetCut {
address facetAddress;
FacetCutAction action;
bytes4[] functionSelectors;
bytes initData;
}
/// @notice Add/replace/remove any number of functions and optionally execute
/// a function with delegatecall
/// @param _diamondCut Contains the facet addresses and function selectors
function diamondCut(FacetCut[] calldata _diamondCut) external;
event DiamondCut(FacetCut[] _diamondCut);
} <i class='far fa-question-circle text-muted ms-2' data-bs-trigger='hover' data-bs-toggle='tooltip' data-bs-html='true' data-bs-title='Click on the check box to select individual contract to compare. Only 1 contract can be selected from each side.'></i>
// SPDX-License-Identifier: BUSL-1.1
pragma solidity ^0.8.10;
import {IAggregatorV2V3Interface} from "../interfaces/Chainlink/IAggregatorV2V3Interface.sol";
/**
* @title IOracleRegistry
* @author MORE Labs
* @notice Interface for the OracleRegistry contract to get asset prices and manage price sources
*/
interface IOracleRegistry {
error PriceIsNotAvailable();
error InconsistentParamsLength();
error OraclePriceIsOld();
error AggregatorNotSet();
/**
* @notice Struct describing the asset price source and staleness threshold
* @param aggregator The Chainlink aggregator interface for the asset
* @param stalenessThreshold The maximum allowed staleness for the price data
*/
struct OracleInfo {
IAggregatorV2V3Interface aggregator;
uint96 stalenessThreshold;
}
/**
* @notice Emitted when the base currency is set
* @param baseCurrency The address of the base currency
* @param baseCurrencyUnit The unit of the base currency
*/
event BaseCurrencySet(address indexed baseCurrency, uint256 baseCurrencyUnit);
/**
* @notice Emitted when an asset source is updated
* @param asset The address of the asset
* @param info The new OracleInfo struct for the asset
*/
event OracleInfoUpdated(address indexed asset, OracleInfo info);
event SpokeOracleInfoUpdated(address indexed hub, uint32 indexed chaindId, OracleInfo info);
/**
* @notice Returns the base currency address used for price quotes
* @return The address of the base currency (e.g., 0x0 for USD)
*/
function BASE_CURRENCY() external view returns (address);
/**
* @notice Returns the unit of the base currency
* @return The unit of the base currency (e.g., 1e8 for USD)
*/
function BASE_CURRENCY_UNIT() external view returns (uint256);
/**
* @notice Sets the price sources for a list of assets
* @dev Only callable by accounts with the ORACLE_MANAGER_ROLE
* @param assets The addresses of the assets
* @param infos The OracleInfo struct for each asset
*/
function setOracleInfos(address[] calldata assets, OracleInfo[] calldata infos) external;
function setSpokeOracleInfos(address hub, uint32[] calldata chainIds, OracleInfo[] calldata infos) external;
function getSpokeValue(address hub, uint32 chainId) external view returns (uint256);
function getSpokeOracleInfo(address hub, uint32 chainId) external view returns (OracleInfo memory);
/**
* @notice Returns the price of a given asset
* @param asset The address of the asset
* @return The price of the asset in the base currency
*/
function getAssetPrice(address asset) external view returns (uint256);
/**
* @notice Returns the prices of a list of assets
* @param assets The addresses of the assets
* @return An array of prices for each asset in the base currency
*/
function getAssetsPrices(address[] calldata assets) external view returns (uint256[] memory);
/**
* @notice Returns the OracleInfo struct for a given asset
* @param asset The address of the asset
* @return The OracleInfo struct containing aggregator and staleness threshold
*/
function getOracleInfo(address asset) external view returns (OracleInfo memory);
} <i class='far fa-question-circle text-muted ms-2' data-bs-trigger='hover' data-bs-toggle='tooltip' data-bs-html='true' data-bs-title='Click on the check box to select individual contract to compare. Only 1 contract can be selected from each side.'></i>
// SPDX-License-Identifier: BUSL-1.1
pragma solidity 0.8.28;
import {IMoreVaultsRegistry} from "./IMoreVaultsRegistry.sol";
import {IDiamondCut} from "./facets/IDiamondCut.sol";
interface IVaultsFactory {
error InvalidSelector(address facet, bytes4 selector);
error ZeroAddress();
error EmptyFacets();
error InvalidTimeLock();
error InvalidFee();
error ComposerInitializationFailed();
event VaultDeployed(address indexed vault, address registry, address wrappedNative, IDiamondCut.FacetCut[] facets);
event DiamondCutFacetUpdated(address indexed newDiamondCutFacet);
event AccessControlFacetUpdated(address indexed newAccessControlFacet);
event MaxFinalizationTimeUpdated(uint96 indexed newMaxFinalizationTime);
event CrossChainLinkRequested(
uint32 indexed dstChainId, address indexed initiator, address indexed vaultToLink, address remoteVault
);
event CrossChainLinked(uint32 indexed linkedVaultChainId, address indexed linkedVault, address indexed localVault);
event SetFacetRestricted(address indexed _facet, bool indexed _isRestricted);
event LzAdapterUpdated(address indexed newLzAdapter);
event VaultComposerUpdated(address indexed vault, address indexed composer);
event ComposerImplementationUpdated(address indexed newImplementation);
event OFTAdapterFactoryUpdated(address indexed newOFTAdapterFactory);
event VaultFailedToPause(address indexed vault);
/**
* @notice Initialize the factory
* @param _owner Owner address
* @param _registry Registry contract address
* @param _diamondCutFacet Diamond cut facet address
* @param _accessControlFacet Access control facet address
* @param _wrappedNative Wrapped native token address
* @param _localEid LayerZero endpoint id for this chain
* @param _maxFinalizationTime Maximum finalization time of block for a chain
* @param _lzAdapter LayerZero adapter address
* @param _composerImplementation MoreVaultsComposer implementation address
* @param _oftAdapterFactory OFT adapter factory address
*/
function initialize(
address _owner,
address _registry,
address _diamondCutFacet,
address _accessControlFacet,
address _wrappedNative,
uint32 _localEid,
uint96 _maxFinalizationTime,
address _lzAdapter,
address _composerImplementation,
address _oftAdapterFactory
) external;
/**
* @notice Spoke requests registration on Hub
*/
function requestRegisterSpoke(uint32 _hubEid, address _hubVault, address _spokeVault, bytes calldata _options)
external
payable;
/**
* @notice Get registry contract address
* @return address Registry address
*/
function registry() external view returns (IMoreVaultsRegistry);
/**
* @notice Check if vault was deployed by this factory
* @param vault Address to check
* @return bool True if vault was deployed by this factory
*/
function isFactoryVault(address vault) external view returns (bool);
/**
* @notice Get vault by index
* @param index Index of vault
* @return address Vault address
*/
function deployedVaults(uint256 index) external view returns (address);
/**
* @notice Deploy new vault instance
* @param facetCuts Array of facets to add
* @param accessControlFacetInitData encoded data that contains addresses of owner, curator and guardian
* @return vault Address of deployed vault
*/
function deployVault(
IDiamondCut.FacetCut[] calldata facetCuts,
bytes memory accessControlFacetInitData,
bool isHub,
bytes32 salt
) external returns (address vault);
/**
* @notice link the vault to the facet
* @param facet address of the facet
*/
function link(address facet) external;
/**
* @notice unlink the vault from the facet
* @param facet address of the facet
*/
function unlink(address facet) external;
/**
* @notice pauses all vaults using this facet
* @param facet address of the facet
*/
function pauseFacet(address facet) external;
/**
* @notice sets the lz adapter for the factory
* @param lzAdapter address of the lz adapter
*/
function setLzAdapter(address lzAdapter) external;
/**
* @notice sets the vault composer for a vault
* @param vault address of the vault
* @param composer address of the composer
*/
function setVaultComposer(address vault, address composer) external;
/**
* @notice sets the composer implementation
* @param composerImplementation address of the composer implementation
*/
function setComposerImplementation(address composerImplementation) external;
/**
* @notice sets the OFT adapter factory
* @param oftAdapterFactory address of the OFT adapter factory
*/
function setOFTAdapterFactory(address oftAdapterFactory) external;
/**
* @notice sets restricted flag for facet
* @param _facet address of facet
* @param _isRestricted bool flag
*/
function setFacetRestricted(address _facet, bool _isRestricted) external;
/**
* @notice Get all deployed vaults
* @return Array of vault addresses
*/
function getDeployedVaults() external view returns (address[] memory);
/**
* @notice Get number of deployed vaults
* @return Number of vaults
*/
function getVaultsCount() external view returns (uint256);
/**
* @notice Returns vaults addresses using this facet
* @param _facet address of the facet
*/
function getLinkedVaults(address _facet) external returns (address[] memory vaults);
/**
* @notice Returns bool flag if vault linked to the facet
* @param _facet address of the facet
* @param _vault address of the vault
*/
function isVaultLinked(address _facet, address _vault) external returns (bool);
/**
* @notice Returns facet addresses that are restricted
* @return facets addresses of the restricted facets
*/
function getRestrictedFacets() external returns (address[] memory facets);
/**
* @notice Returns hub to spokes
* @param _chainId chain id
* @param _hubVault hub vault
* @return eids endpoint ids of spokes
* @return vaults addresses of spokes
*/
function hubToSpokes(uint32 _chainId, address _hubVault)
external
view
returns (uint32[] memory eids, address[] memory vaults);
/**
* @notice Returns spoke to hub
* @param _chainId chain id
* @param _spokeVault spoke vault
* @return eid endpoint id of hub
* @return vault address of hub vault
*/
function spokeToHub(uint32 _chainId, address _spokeVault) external view returns (uint32 eid, address vault);
/**
* @notice Checks whether a hub has a given spoke linked
* @param _hubEid Hub endpoint id
* @param _hubVault Hub vault address
* @param _spokeEid Spoke endpoint id
* @param _spokeVault Spoke vault address
* @return bool True if the spoke is linked to the hub
*/
function isSpokeOfHub(uint32 _hubEid, address _hubVault, uint32 _spokeEid, address _spokeVault)
external
view
returns (bool);
/**
* @notice Checks whether a vault is a cross-chain vault
* @param _chainId Chain id
* @param _vault Vault address
* @return bool True if the vault is a cross-chain vault
*/
function isCrossChainVault(uint32 _chainId, address _vault) external view returns (bool);
/**
* @notice Returns local EID
* @return local EID
*/
function localEid() external view returns (uint32);
/**
* @notice Returns vault composer for a vault
* @param _vault Vault address
* @return composer address of the composer
*/
function vaultComposer(address _vault) external view returns (address);
/**
* @notice Returns LayerZero adapter address
* @return LayerZero adapter address
*/
function lzAdapter() external view returns (address);
/**
* @notice Returns MoreVaultsComposer implementation address
* @return MoreVaultsComposer implementation address
*/
function composerImplementation() external view returns (address);
/**
* @notice Returns OFT adapter factory address
* @return OFT adapter factory address
*/
function oftAdapterFactory() external view returns (address);
/**
* @notice Returns max finalization time
* @return max finalization time
*/
function maxFinalizationTime() external view returns (uint96);
} <i class='far fa-question-circle text-muted ms-2' data-bs-trigger='hover' data-bs-toggle='tooltip' data-bs-html='true' data-bs-title='Click on the check box to select individual contract to compare. Only 1 contract can be selected from each side.'></i>
// SPDX-License-Identifier: AGPL-3.0
pragma solidity 0.8.28;
// solhint-disable-next-line interface-starts-with-i
interface IAggregatorV2V3Interface {
function decimals() external view returns (uint8);
function description() external view returns (string memory);
function version() external view returns (uint256);
function latestAnswer() external view returns (int256);
function latestTimestamp() external view returns (uint256);
function latestRound() external view returns (uint256);
function getAnswer(uint256 roundId) external view returns (int256);
function getTimestamp(uint256 roundId) external view returns (uint256);
event AnswerUpdated(int256 indexed current, uint256 indexed roundId, uint256 updatedAt);
event NewRound(uint256 indexed roundId, address indexed startedBy, uint256 startedAt);
function getRoundData(uint80 _roundId)
external
view
returns (uint80 roundId, int256 answer, uint256 startedAt, uint256 updatedAt, uint80 answeredInRound);
function latestRoundData()
external
view
returns (uint80 roundId, int256 answer, uint256 startedAt, uint256 updatedAt, uint80 answeredInRound);
} <i class='far fa-question-circle text-muted ms-2' data-bs-trigger='hover' data-bs-toggle='tooltip' data-bs-html='true' data-bs-title='Click on the check box to select individual contract to compare. Only 1 contract can be selected from each side.'></i>
// SPDX-License-Identifier: MIT
// OpenZeppelin Contracts (last updated v5.3.0) (utils/math/Math.sol)
pragma solidity ^0.8.20;
import {Panic} from "../Panic.sol";
import {SafeCast} from "./SafeCast.sol";
/**
* @dev Standard math utilities missing in the Solidity language.
*/
library Math {
enum Rounding {
Floor, // Toward negative infinity
Ceil, // Toward positive infinity
Trunc, // Toward zero
Expand // Away from zero
}
/**
* @dev Return the 512-bit addition of two uint256.
*
* The result is stored in two 256 variables such that sum = high * 2²⁵⁶ + low.
*/
function add512(uint256 a, uint256 b) internal pure returns (uint256 high, uint256 low) {
assembly ("memory-safe") {
low := add(a, b)
high := lt(low, a)
}
}
/**
* @dev Return the 512-bit multiplication of two uint256.
*
* The result is stored in two 256 variables such that product = high * 2²⁵⁶ + low.
*/
function mul512(uint256 a, uint256 b) internal pure returns (uint256 high, uint256 low) {
// 512-bit multiply [high low] = x * y. Compute the product mod 2²⁵⁶ and mod 2²⁵⁶ - 1, then use
// the Chinese Remainder Theorem to reconstruct the 512 bit result. The result is stored in two 256
// variables such that product = high * 2²⁵⁶ + low.
assembly ("memory-safe") {
let mm := mulmod(a, b, not(0))
low := mul(a, b)
high := sub(sub(mm, low), lt(mm, low))
}
}
/**
* @dev Returns the addition of two unsigned integers, with a success flag (no overflow).
*/
function tryAdd(uint256 a, uint256 b) internal pure returns (bool success, uint256 result) {
unchecked {
uint256 c = a + b;
success = c >= a;
result = c * SafeCast.toUint(success);
}
}
/**
* @dev Returns the subtraction of two unsigned integers, with a success flag (no overflow).
*/
function trySub(uint256 a, uint256 b) internal pure returns (bool success, uint256 result) {
unchecked {
uint256 c = a - b;
success = c <= a;
result = c * SafeCast.toUint(success);
}
}
/**
* @dev Returns the multiplication of two unsigned integers, with a success flag (no overflow).
*/
function tryMul(uint256 a, uint256 b) internal pure returns (bool success, uint256 result) {
unchecked {
uint256 c = a * b;
assembly ("memory-safe") {
// Only true when the multiplication doesn't overflow
// (c / a == b) || (a == 0)
success := or(eq(div(c, a), b), iszero(a))
}
// equivalent to: success ? c : 0
result = c * SafeCast.toUint(success);
}
}
/**
* @dev Returns the division of two unsigned integers, with a success flag (no division by zero).
*/
function tryDiv(uint256 a, uint256 b) internal pure returns (bool success, uint256 result) {
unchecked {
success = b > 0;
assembly ("memory-safe") {
// The `DIV` opcode returns zero when the denominator is 0.
result := div(a, b)
}
}
}
/**
* @dev Returns the remainder of dividing two unsigned integers, with a success flag (no division by zero).
*/
function tryMod(uint256 a, uint256 b) internal pure returns (bool success, uint256 result) {
unchecked {
success = b > 0;
assembly ("memory-safe") {
// The `MOD` opcode returns zero when the denominator is 0.
result := mod(a, b)
}
}
}
/**
* @dev Unsigned saturating addition, bounds to `2²⁵⁶ - 1` instead of overflowing.
*/
function saturatingAdd(uint256 a, uint256 b) internal pure returns (uint256) {
(bool success, uint256 result) = tryAdd(a, b);
return ternary(success, result, type(uint256).max);
}
/**
* @dev Unsigned saturating subtraction, bounds to zero instead of overflowing.
*/
function saturatingSub(uint256 a, uint256 b) internal pure returns (uint256) {
(, uint256 result) = trySub(a, b);
return result;
}
/**
* @dev Unsigned saturating multiplication, bounds to `2²⁵⁶ - 1` instead of overflowing.
*/
function saturatingMul(uint256 a, uint256 b) internal pure returns (uint256) {
(bool success, uint256 result) = tryMul(a, b);
return ternary(success, result, type(uint256).max);
}
/**
* @dev Branchless ternary evaluation for `a ? b : c`. Gas costs are constant.
*
* IMPORTANT: This function may reduce bytecode size and consume less gas when used standalone.
* However, the compiler may optimize Solidity ternary operations (i.e. `a ? b : c`) to only compute
* one branch when needed, making this function more expensive.
*/
function ternary(bool condition, uint256 a, uint256 b) internal pure returns (uint256) {
unchecked {
// branchless ternary works because:
// b ^ (a ^ b) == a
// b ^ 0 == b
return b ^ ((a ^ b) * SafeCast.toUint(condition));
}
}
/**
* @dev Returns the largest of two numbers.
*/
function max(uint256 a, uint256 b) internal pure returns (uint256) {
return ternary(a > b, a, b);
}
/**
* @dev Returns the smallest of two numbers.
*/
function min(uint256 a, uint256 b) internal pure returns (uint256) {
return ternary(a < b, a, b);
}
/**
* @dev Returns the average of two numbers. The result is rounded towards
* zero.
*/
function average(uint256 a, uint256 b) internal pure returns (uint256) {
// (a + b) / 2 can overflow.
return (a & b) + (a ^ b) / 2;
}
/**
* @dev Returns the ceiling of the division of two numbers.
*
* This differs from standard division with `/` in that it rounds towards infinity instead
* of rounding towards zero.
*/
function ceilDiv(uint256 a, uint256 b) internal pure returns (uint256) {
if (b == 0) {
// Guarantee the same behavior as in a regular Solidity division.
Panic.panic(Panic.DIVISION_BY_ZERO);
}
// The following calculation ensures accurate ceiling division without overflow.
// Since a is non-zero, (a - 1) / b will not overflow.
// The largest possible result occurs when (a - 1) / b is type(uint256).max,
// but the largest value we can obtain is type(uint256).max - 1, which happens
// when a = type(uint256).max and b = 1.
unchecked {
return SafeCast.toUint(a > 0) * ((a - 1) / b + 1);
}
}
/**
* @dev Calculates floor(x * y / denominator) with full precision. Throws if result overflows a uint256 or
* denominator == 0.
*
* Original credit to Remco Bloemen under MIT license (https://xn--2-umb.com/21/muldiv) with further edits by
* Uniswap Labs also under MIT license.
*/
function mulDiv(uint256 x, uint256 y, uint256 denominator) internal pure returns (uint256 result) {
unchecked {
(uint256 high, uint256 low) = mul512(x, y);
// Handle non-overflow cases, 256 by 256 division.
if (high == 0) {
// Solidity will revert if denominator == 0, unlike the div opcode on its own.
// The surrounding unchecked block does not change this fact.
// See https://docs.soliditylang.org/en/latest/control-structures.html#checked-or-unchecked-arithmetic.
return low / denominator;
}
// Make sure the result is less than 2²⁵⁶. Also prevents denominator == 0.
if (denominator <= high) {
Panic.panic(ternary(denominator == 0, Panic.DIVISION_BY_ZERO, Panic.UNDER_OVERFLOW));
}
///////////////////////////////////////////////
// 512 by 256 division.
///////////////////////////////////////////////
// Make division exact by subtracting the remainder from [high low].
uint256 remainder;
assembly ("memory-safe") {
// Compute remainder using mulmod.
remainder := mulmod(x, y, denominator)
// Subtract 256 bit number from 512 bit number.
high := sub(high, gt(remainder, low))
low := sub(low, remainder)
}
// Factor powers of two out of denominator and compute largest power of two divisor of denominator.
// Always >= 1. See https://cs.stackexchange.com/q/138556/92363.
uint256 twos = denominator & (0 - denominator);
assembly ("memory-safe") {
// Divide denominator by twos.
denominator := div(denominator, twos)
// Divide [high low] by twos.
low := div(low, twos)
// Flip twos such that it is 2²⁵⁶ / twos. If twos is zero, then it becomes one.
twos := add(div(sub(0, twos), twos), 1)
}
// Shift in bits from high into low.
low |= high * twos;
// Invert denominator mod 2²⁵⁶. Now that denominator is an odd number, it has an inverse modulo 2²⁵⁶ such
// that denominator * inv ≡ 1 mod 2²⁵⁶. Compute the inverse by starting with a seed that is correct for
// four bits. That is, denominator * inv ≡ 1 mod 2⁴.
uint256 inverse = (3 * denominator) ^ 2;
// Use the Newton-Raphson iteration to improve the precision. Thanks to Hensel's lifting lemma, this also
// works in modular arithmetic, doubling the correct bits in each step.
inverse *= 2 - denominator * inverse; // inverse mod 2⁸
inverse *= 2 - denominator * inverse; // inverse mod 2¹⁶
inverse *= 2 - denominator * inverse; // inverse mod 2³²
inverse *= 2 - denominator * inverse; // inverse mod 2⁶⁴
inverse *= 2 - denominator * inverse; // inverse mod 2¹²⁸
inverse *= 2 - denominator * inverse; // inverse mod 2²⁵⁶
// Because the division is now exact we can divide by multiplying with the modular inverse of denominator.
// This will give us the correct result modulo 2²⁵⁶. Since the preconditions guarantee that the outcome is
// less than 2²⁵⁶, this is the final result. We don't need to compute the high bits of the result and high
// is no longer required.
result = low * inverse;
return result;
}
}
/**
* @dev Calculates x * y / denominator with full precision, following the selected rounding direction.
*/
function mulDiv(uint256 x, uint256 y, uint256 denominator, Rounding rounding) internal pure returns (uint256) {
return mulDiv(x, y, denominator) + SafeCast.toUint(unsignedRoundsUp(rounding) && mulmod(x, y, denominator) > 0);
}
/**
* @dev Calculates floor(x * y >> n) with full precision. Throws if result overflows a uint256.
*/
function mulShr(uint256 x, uint256 y, uint8 n) internal pure returns (uint256 result) {
unchecked {
(uint256 high, uint256 low) = mul512(x, y);
if (high >= 1 << n) {
Panic.panic(Panic.UNDER_OVERFLOW);
}
return (high << (256 - n)) | (low >> n);
}
}
/**
* @dev Calculates x * y >> n with full precision, following the selected rounding direction.
*/
function mulShr(uint256 x, uint256 y, uint8 n, Rounding rounding) internal pure returns (uint256) {
return mulShr(x, y, n) + SafeCast.toUint(unsignedRoundsUp(rounding) && mulmod(x, y, 1 << n) > 0);
}
/**
* @dev Calculate the modular multiplicative inverse of a number in Z/nZ.
*
* If n is a prime, then Z/nZ is a field. In that case all elements are inversible, except 0.
* If n is not a prime, then Z/nZ is not a field, and some elements might not be inversible.
*
* If the input value is not inversible, 0 is returned.
*
* NOTE: If you know for sure that n is (big) a prime, it may be cheaper to use Fermat's little theorem and get the
* inverse using `Math.modExp(a, n - 2, n)`. See {invModPrime}.
*/
function invMod(uint256 a, uint256 n) internal pure returns (uint256) {
unchecked {
if (n == 0) return 0;
// The inverse modulo is calculated using the Extended Euclidean Algorithm (iterative version)
// Used to compute integers x and y such that: ax + ny = gcd(a, n).
// When the gcd is 1, then the inverse of a modulo n exists and it's x.
// ax + ny = 1
// ax = 1 + (-y)n
// ax ≡ 1 (mod n) # x is the inverse of a modulo n
// If the remainder is 0 the gcd is n right away.
uint256 remainder = a % n;
uint256 gcd = n;
// Therefore the initial coefficients are:
// ax + ny = gcd(a, n) = n
// 0a + 1n = n
int256 x = 0;
int256 y = 1;
while (remainder != 0) {
uint256 quotient = gcd / remainder;
(gcd, remainder) = (
// The old remainder is the next gcd to try.
remainder,
// Compute the next remainder.
// Can't overflow given that (a % gcd) * (gcd // (a % gcd)) <= gcd
// where gcd is at most n (capped to type(uint256).max)
gcd - remainder * quotient
);
(x, y) = (
// Increment the coefficient of a.
y,
// Decrement the coefficient of n.
// Can overflow, but the result is casted to uint256 so that the
// next value of y is "wrapped around" to a value between 0 and n - 1.
x - y * int256(quotient)
);
}
if (gcd != 1) return 0; // No inverse exists.
return ternary(x < 0, n - uint256(-x), uint256(x)); // Wrap the result if it's negative.
}
}
/**
* @dev Variant of {invMod}. More efficient, but only works if `p` is known to be a prime greater than `2`.
*
* From https://en.wikipedia.org/wiki/Fermat%27s_little_theorem[Fermat's little theorem], we know that if p is
* prime, then `a**(p-1) ≡ 1 mod p`. As a consequence, we have `a * a**(p-2) ≡ 1 mod p`, which means that
* `a**(p-2)` is the modular multiplicative inverse of a in Fp.
*
* NOTE: this function does NOT check that `p` is a prime greater than `2`.
*/
function invModPrime(uint256 a, uint256 p) internal view returns (uint256) {
unchecked {
return Math.modExp(a, p - 2, p);
}
}
/**
* @dev Returns the modular exponentiation of the specified base, exponent and modulus (b ** e % m)
*
* Requirements:
* - modulus can't be zero
* - underlying staticcall to precompile must succeed
*
* IMPORTANT: The result is only valid if the underlying call succeeds. When using this function, make
* sure the chain you're using it on supports the precompiled contract for modular exponentiation
* at address 0x05 as specified in https://eips.ethereum.org/EIPS/eip-198[EIP-198]. Otherwise,
* the underlying function will succeed given the lack of a revert, but the result may be incorrectly
* interpreted as 0.
*/
function modExp(uint256 b, uint256 e, uint256 m) internal view returns (uint256) {
(bool success, uint256 result) = tryModExp(b, e, m);
if (!success) {
Panic.panic(Panic.DIVISION_BY_ZERO);
}
return result;
}
/**
* @dev Returns the modular exponentiation of the specified base, exponent and modulus (b ** e % m).
* It includes a success flag indicating if the operation succeeded. Operation will be marked as failed if trying
* to operate modulo 0 or if the underlying precompile reverted.
*
* IMPORTANT: The result is only valid if the success flag is true. When using this function, make sure the chain
* you're using it on supports the precompiled contract for modular exponentiation at address 0x05 as specified in
* https://eips.ethereum.org/EIPS/eip-198[EIP-198]. Otherwise, the underlying function will succeed given the lack
* of a revert, but the result may be incorrectly interpreted as 0.
*/
function tryModExp(uint256 b, uint256 e, uint256 m) internal view returns (bool success, uint256 result) {
if (m == 0) return (false, 0);
assembly ("memory-safe") {
let ptr := mload(0x40)
// | Offset | Content | Content (Hex) |
// |-----------|------------|--------------------------------------------------------------------|
// | 0x00:0x1f | size of b | 0x0000000000000000000000000000000000000000000000000000000000000020 |
// | 0x20:0x3f | size of e | 0x0000000000000000000000000000000000000000000000000000000000000020 |
// | 0x40:0x5f | size of m | 0x0000000000000000000000000000000000000000000000000000000000000020 |
// | 0x60:0x7f | value of b | 0x<.............................................................b> |
// | 0x80:0x9f | value of e | 0x<.............................................................e> |
// | 0xa0:0xbf | value of m | 0x<.............................................................m> |
mstore(ptr, 0x20)
mstore(add(ptr, 0x20), 0x20)
mstore(add(ptr, 0x40), 0x20)
mstore(add(ptr, 0x60), b)
mstore(add(ptr, 0x80), e)
mstore(add(ptr, 0xa0), m)
// Given the result < m, it's guaranteed to fit in 32 bytes,
// so we can use the memory scratch space located at offset 0.
success := staticcall(gas(), 0x05, ptr, 0xc0, 0x00, 0x20)
result := mload(0x00)
}
}
/**
* @dev Variant of {modExp} that supports inputs of arbitrary length.
*/
function modExp(bytes memory b, bytes memory e, bytes memory m) internal view returns (bytes memory) {
(bool success, bytes memory result) = tryModExp(b, e, m);
if (!success) {
Panic.panic(Panic.DIVISION_BY_ZERO);
}
return result;
}
/**
* @dev Variant of {tryModExp} that supports inputs of arbitrary length.
*/
function tryModExp(
bytes memory b,
bytes memory e,
bytes memory m
) internal view returns (bool success, bytes memory result) {
if (_zeroBytes(m)) return (false, new bytes(0));
uint256 mLen = m.length;
// Encode call args in result and move the free memory pointer
result = abi.encodePacked(b.length, e.length, mLen, b, e, m);
assembly ("memory-safe") {
let dataPtr := add(result, 0x20)
// Write result on top of args to avoid allocating extra memory.
success := staticcall(gas(), 0x05, dataPtr, mload(result), dataPtr, mLen)
// Overwrite the length.
// result.length > returndatasize() is guaranteed because returndatasize() == m.length
mstore(result, mLen)
// Set the memory pointer after the returned data.
mstore(0x40, add(dataPtr, mLen))
}
}
/**
* @dev Returns whether the provided byte array is zero.
*/
function _zeroBytes(bytes memory byteArray) private pure returns (bool) {
for (uint256 i = 0; i < byteArray.length; ++i) {
if (byteArray[i] != 0) {
return false;
}
}
return true;
}
/**
* @dev Returns the square root of a number. If the number is not a perfect square, the value is rounded
* towards zero.
*
* This method is based on Newton's method for computing square roots; the algorithm is restricted to only
* using integer operations.
*/
function sqrt(uint256 a) internal pure returns (uint256) {
unchecked {
// Take care of easy edge cases when a == 0 or a == 1
if (a <= 1) {
return a;
}
// In this function, we use Newton's method to get a root of `f(x) := x² - a`. It involves building a
// sequence x_n that converges toward sqrt(a). For each iteration x_n, we also define the error between
// the current value as `ε_n = | x_n - sqrt(a) |`.
//
// For our first estimation, we consider `e` the smallest power of 2 which is bigger than the square root
// of the target. (i.e. `2**(e-1) ≤ sqrt(a) < 2**e`). We know that `e ≤ 128` because `(2¹²⁸)² = 2²⁵⁶` is
// bigger than any uint256.
//
// By noticing that
// `2**(e-1) ≤ sqrt(a) < 2**e → (2**(e-1))² ≤ a < (2**e)² → 2**(2*e-2) ≤ a < 2**(2*e)`
// we can deduce that `e - 1` is `log2(a) / 2`. We can thus compute `x_n = 2**(e-1)` using a method similar
// to the msb function.
uint256 aa = a;
uint256 xn = 1;
if (aa >= (1 << 128)) {
aa >>= 128;
xn <<= 64;
}
if (aa >= (1 << 64)) {
aa >>= 64;
xn <<= 32;
}
if (aa >= (1 << 32)) {
aa >>= 32;
xn <<= 16;
}
if (aa >= (1 << 16)) {
aa >>= 16;
xn <<= 8;
}
if (aa >= (1 << 8)) {
aa >>= 8;
xn <<= 4;
}
if (aa >= (1 << 4)) {
aa >>= 4;
xn <<= 2;
}
if (aa >= (1 << 2)) {
xn <<= 1;
}
// We now have x_n such that `x_n = 2**(e-1) ≤ sqrt(a) < 2**e = 2 * x_n`. This implies ε_n ≤ 2**(e-1).
//
// We can refine our estimation by noticing that the middle of that interval minimizes the error.
// If we move x_n to equal 2**(e-1) + 2**(e-2), then we reduce the error to ε_n ≤ 2**(e-2).
// This is going to be our x_0 (and ε_0)
xn = (3 * xn) >> 1; // ε_0 := | x_0 - sqrt(a) | ≤ 2**(e-2)
// From here, Newton's method give us:
// x_{n+1} = (x_n + a / x_n) / 2
//
// One should note that:
// x_{n+1}² - a = ((x_n + a / x_n) / 2)² - a
// = ((x_n² + a) / (2 * x_n))² - a
// = (x_n⁴ + 2 * a * x_n² + a²) / (4 * x_n²) - a
// = (x_n⁴ + 2 * a * x_n² + a² - 4 * a * x_n²) / (4 * x_n²)
// = (x_n⁴ - 2 * a * x_n² + a²) / (4 * x_n²)
// = (x_n² - a)² / (2 * x_n)²
// = ((x_n² - a) / (2 * x_n))²
// ≥ 0
// Which proves that for all n ≥ 1, sqrt(a) ≤ x_n
//
// This gives us the proof of quadratic convergence of the sequence:
// ε_{n+1} = | x_{n+1} - sqrt(a) |
// = | (x_n + a / x_n) / 2 - sqrt(a) |
// = | (x_n² + a - 2*x_n*sqrt(a)) / (2 * x_n) |
// = | (x_n - sqrt(a))² / (2 * x_n) |
// = | ε_n² / (2 * x_n) |
// = ε_n² / | (2 * x_n) |
//
// For the first iteration, we have a special case where x_0 is known:
// ε_1 = ε_0² / | (2 * x_0) |
// ≤ (2**(e-2))² / (2 * (2**(e-1) + 2**(e-2)))
// ≤ 2**(2*e-4) / (3 * 2**(e-1))
// ≤ 2**(e-3) / 3
// ≤ 2**(e-3-log2(3))
// ≤ 2**(e-4.5)
//
// For the following iterations, we use the fact that, 2**(e-1) ≤ sqrt(a) ≤ x_n:
// ε_{n+1} = ε_n² / | (2 * x_n) |
// ≤ (2**(e-k))² / (2 * 2**(e-1))
// ≤ 2**(2*e-2*k) / 2**e
// ≤ 2**(e-2*k)
xn = (xn + a / xn) >> 1; // ε_1 := | x_1 - sqrt(a) | ≤ 2**(e-4.5) -- special case, see above
xn = (xn + a / xn) >> 1; // ε_2 := | x_2 - sqrt(a) | ≤ 2**(e-9) -- general case with k = 4.5
xn = (xn + a / xn) >> 1; // ε_3 := | x_3 - sqrt(a) | ≤ 2**(e-18) -- general case with k = 9
xn = (xn + a / xn) >> 1; // ε_4 := | x_4 - sqrt(a) | ≤ 2**(e-36) -- general case with k = 18
xn = (xn + a / xn) >> 1; // ε_5 := | x_5 - sqrt(a) | ≤ 2**(e-72) -- general case with k = 36
xn = (xn + a / xn) >> 1; // ε_6 := | x_6 - sqrt(a) | ≤ 2**(e-144) -- general case with k = 72
// Because e ≤ 128 (as discussed during the first estimation phase), we know have reached a precision
// ε_6 ≤ 2**(e-144) < 1. Given we're operating on integers, then we can ensure that xn is now either
// sqrt(a) or sqrt(a) + 1.
return xn - SafeCast.toUint(xn > a / xn);
}
}
/**
* @dev Calculates sqrt(a), following the selected rounding direction.
*/
function sqrt(uint256 a, Rounding rounding) internal pure returns (uint256) {
unchecked {
uint256 result = sqrt(a);
return result + SafeCast.toUint(unsignedRoundsUp(rounding) && result * result < a);
}
}
/**
* @dev Return the log in base 2 of a positive value rounded towards zero.
* Returns 0 if given 0.
*/
function log2(uint256 x) internal pure returns (uint256 r) {
// If value has upper 128 bits set, log2 result is at least 128
r = SafeCast.toUint(x > 0xffffffffffffffffffffffffffffffff) << 7;
// If upper 64 bits of 128-bit half set, add 64 to result
r |= SafeCast.toUint((x >> r) > 0xffffffffffffffff) << 6;
// If upper 32 bits of 64-bit half set, add 32 to result
r |= SafeCast.toUint((x >> r) > 0xffffffff) << 5;
// If upper 16 bits of 32-bit half set, add 16 to result
r |= SafeCast.toUint((x >> r) > 0xffff) << 4;
// If upper 8 bits of 16-bit half set, add 8 to result
r |= SafeCast.toUint((x >> r) > 0xff) << 3;
// If upper 4 bits of 8-bit half set, add 4 to result
r |= SafeCast.toUint((x >> r) > 0xf) << 2;
// Shifts value right by the current result and use it as an index into this lookup table:
//
// | x (4 bits) | index | table[index] = MSB position |
// |------------|---------|-----------------------------|
// | 0000 | 0 | table[0] = 0 |
// | 0001 | 1 | table[1] = 0 |
// | 0010 | 2 | table[2] = 1 |
// | 0011 | 3 | table[3] = 1 |
// | 0100 | 4 | table[4] = 2 |
// | 0101 | 5 | table[5] = 2 |
// | 0110 | 6 | table[6] = 2 |
// | 0111 | 7 | table[7] = 2 |
// | 1000 | 8 | table[8] = 3 |
// | 1001 | 9 | table[9] = 3 |
// | 1010 | 10 | table[10] = 3 |
// | 1011 | 11 | table[11] = 3 |
// | 1100 | 12 | table[12] = 3 |
// | 1101 | 13 | table[13] = 3 |
// | 1110 | 14 | table[14] = 3 |
// | 1111 | 15 | table[15] = 3 |
//
// The lookup table is represented as a 32-byte value with the MSB positions for 0-15 in the last 16 bytes.
assembly ("memory-safe") {
r := or(r, byte(shr(r, x), 0x0000010102020202030303030303030300000000000000000000000000000000))
}
}
/**
* @dev Return the log in base 2, following the selected rounding direction, of a positive value.
* Returns 0 if given 0.
*/
function log2(uint256 value, Rounding rounding) internal pure returns (uint256) {
unchecked {
uint256 result = log2(value);
return result + SafeCast.toUint(unsignedRoundsUp(rounding) && 1 << result < value);
}
}
/**
* @dev Return the log in base 10 of a positive value rounded towards zero.
* Returns 0 if given 0.
*/
function log10(uint256 value) internal pure returns (uint256) {
uint256 result = 0;
unchecked {
if (value >= 10 ** 64) {
value /= 10 ** 64;
result += 64;
}
if (value >= 10 ** 32) {
value /= 10 ** 32;
result += 32;
}
if (value >= 10 ** 16) {
value /= 10 ** 16;
result += 16;
}
if (value >= 10 ** 8) {
value /= 10 ** 8;
result += 8;
}
if (value >= 10 ** 4) {
value /= 10 ** 4;
result += 4;
}
if (value >= 10 ** 2) {
value /= 10 ** 2;
result += 2;
}
if (value >= 10 ** 1) {
result += 1;
}
}
return result;
}
/**
* @dev Return the log in base 10, following the selected rounding direction, of a positive value.
* Returns 0 if given 0.
*/
function log10(uint256 value, Rounding rounding) internal pure returns (uint256) {
unchecked {
uint256 result = log10(value);
return result + SafeCast.toUint(unsignedRoundsUp(rounding) && 10 ** result < value);
}
}
/**
* @dev Return the log in base 256 of a positive value rounded towards zero.
* Returns 0 if given 0.
*
* Adding one to the result gives the number of pairs of hex symbols needed to represent `value` as a hex string.
*/
function log256(uint256 x) internal pure returns (uint256 r) {
// If value has upper 128 bits set, log2 result is at least 128
r = SafeCast.toUint(x > 0xffffffffffffffffffffffffffffffff) << 7;
// If upper 64 bits of 128-bit half set, add 64 to result
r |= SafeCast.toUint((x >> r) > 0xffffffffffffffff) << 6;
// If upper 32 bits of 64-bit half set, add 32 to result
r |= SafeCast.toUint((x >> r) > 0xffffffff) << 5;
// If upper 16 bits of 32-bit half set, add 16 to result
r |= SafeCast.toUint((x >> r) > 0xffff) << 4;
// Add 1 if upper 8 bits of 16-bit half set, and divide accumulated result by 8
return (r >> 3) | SafeCast.toUint((x >> r) > 0xff);
}
/**
* @dev Return the log in base 256, following the selected rounding direction, of a positive value.
* Returns 0 if given 0.
*/
function log256(uint256 value, Rounding rounding) internal pure returns (uint256) {
unchecked {
uint256 result = log256(value);
return result + SafeCast.toUint(unsignedRoundsUp(rounding) && 1 << (result << 3) < value);
}
}
/**
* @dev Returns whether a provided rounding mode is considered rounding up for unsigned integers.
*/
function unsignedRoundsUp(Rounding rounding) internal pure returns (bool) {
return uint8(rounding) % 2 == 1;
}
/**
* @dev Counts the number of leading zero bits in a uint256.
*/
function clz(uint256 x) internal pure returns (uint256) {
return ternary(x == 0, 256, 255 - log2(x));
}
} <i class='far fa-question-circle text-muted ms-2' data-bs-trigger='hover' data-bs-toggle='tooltip' data-bs-html='true' data-bs-title='Click on the check box to select individual contract to compare. Only 1 contract can be selected from each side.'></i>
// SPDX-License-Identifier: MIT
// OpenZeppelin Contracts (last updated v5.4.0) (token/ERC20/extensions/IERC20Metadata.sol)
pragma solidity >=0.6.2;
import {IERC20} from "../IERC20.sol";
/**
* @dev Interface for the optional metadata functions from the ERC-20 standard.
*/
interface IERC20Metadata is IERC20 {
/**
* @dev Returns the name of the token.
*/
function name() external view returns (string memory);
/**
* @dev Returns the symbol of the token.
*/
function symbol() external view returns (string memory);
/**
* @dev Returns the decimals places of the token.
*/
function decimals() external view returns (uint8);
} <i class='far fa-question-circle text-muted ms-2' data-bs-trigger='hover' data-bs-toggle='tooltip' data-bs-html='true' data-bs-title='Click on the check box to select individual contract to compare. Only 1 contract can be selected from each side.'></i>
// SPDX-License-Identifier: MIT
// OpenZeppelin Contracts (last updated v5.4.0) (interfaces/IERC20.sol)
pragma solidity >=0.4.16;
import {IERC20} from "../token/ERC20/IERC20.sol"; <i class='far fa-question-circle text-muted ms-2' data-bs-trigger='hover' data-bs-toggle='tooltip' data-bs-html='true' data-bs-title='Click on the check box to select individual contract to compare. Only 1 contract can be selected from each side.'></i>
// SPDX-License-Identifier: MIT
pragma solidity 0.8.28;
import {IGenericMoreVaultFacet} from "./IGenericMoreVaultFacet.sol";
interface IGenericMoreVaultFacetInitializable is IGenericMoreVaultFacet {
function initialize(bytes calldata data) external;
function onFacetRemoval(bool isReplacing) external;
} <i class='far fa-question-circle text-muted ms-2' data-bs-trigger='hover' data-bs-toggle='tooltip' data-bs-html='true' data-bs-title='Click on the check box to select individual contract to compare. Only 1 contract can be selected from each side.'></i>
// SPDX-License-Identifier: MIT
pragma solidity 0.8.28;
import {IGenericMoreVaultFacetInitializable} from "./IGenericMoreVaultFacetInitializable.sol";
interface IAccessControlFacet is IGenericMoreVaultFacetInitializable {
error VaultHasNotAllowedFacet(address facet);
error VaultHasNotAllowedSelector(address facet, bytes4 selector);
error UnaibleToChangeRegistryToPermissionless();
/**
* @notice Transfers owner role to a new address
* @param _newOwner Address of the new owner
*/
function transferOwnership(address _newOwner) external;
/**
* @notice Accepts ownership role
*/
function acceptOwnership() external;
/**
* @notice Transfers curator role to a new address
* @param _newCurator Address of the new curator
*/
function transferCuratorship(address _newCurator) external;
/**
* @notice Transfers guardian role to a new address
* @param _newGuardian Address of the new guardian
*/
function transferGuardian(address _newGuardian) external;
/**
* @notice Returns the current owner address
* @return Address of the current owner
*/
function owner() external view returns (address);
/**
* @notice Returns the current pending owner address
* @return Address of the current pending owner
*/
function pendingOwner() external view returns (address);
/**
* @notice Returns the current curator address
* @return Address of the current curator
*/
function curator() external view returns (address);
/**
* @notice Returns the current guardian address
* @return Address of the current guardian
*/
function guardian() external view returns (address);
/**
* @notice Returns the current more vault registry address
* @return Address of the current more vault registry
*/
function moreVaultsRegistry() external view returns (address);
} <i class='far fa-question-circle text-muted ms-2' data-bs-trigger='hover' data-bs-toggle='tooltip' data-bs-html='true' data-bs-title='Click on the check box to select individual contract to compare. Only 1 contract can be selected from each side.'></i>
// SPDX-License-Identifier: MIT
pragma solidity 0.8.28;
import {IERC4626} from "@openzeppelin/contracts/interfaces/IERC4626.sol";
import {IGenericMoreVaultFacetInitializable} from "./IGenericMoreVaultFacetInitializable.sol";
interface IVaultFacet is IERC4626, IGenericMoreVaultFacetInitializable {
/// @dev Errors
error BeforeAccountingFailed(address facet);
error UnsupportedAsset(address);
error ArraysLengthsDontMatch(uint256, uint256);
error WithdrawFailed(string);
error VaultDebtIsGreaterThanAssets();
error NotAnERC4626CompatibleVault();
error WithdrawSchedulerInvalidTimestamp(uint256 timestamp);
error CantCoverWithdrawRequests(uint256, uint256);
error InvalidSharesAmount();
error InvalidAssetsAmount();
error CantProcessWithdrawRequest();
error VaultIsUsingRestrictedFacet(address);
error WithdrawalQueueDisabled();
error NotAHub();
error InvalidActionType();
error OnlyCrossChainAccountingManager();
error SyncActionsDisabledInThisVault();
error RequestWasntFulfilled();
error RequestWithdrawDisabled();
error ZeroAddress();
/// @dev Events
event Deposit(address indexed sender, address indexed owner, address[] tokens, uint256[] assets, uint256 shares);
event AccrueInterest(uint256 newTotalAssets, uint256 interestAccrued);
event WithdrawRequestCreated(address requester, uint256 sharesAmount, uint256 endsAt);
event WithdrawRequestFulfilled(address requester, address receiver, uint256 sharesAmount, uint256 assetAmount);
event WithdrawRequestDeleted(address requester);
/// @notice Pauses all vault operations
function pause() external;
/// @notice Unpauses all vault operations
function unpause() external;
/// @notice Returns whether the contract is paused
function paused() external view returns (bool);
/// @notice Returns the total amount of the underlying asset that is "managed" by Vault
function totalAssets() external view override returns (uint256);
/// @notice Returns the total amount of the underlying asset that is "managed" by Vault in USD
/// @return totalAssets The total amount of the underlying asset that is "managed" by Vault in USD
/// @return success Whether the totalAssetsUsd calculation was successful
function totalAssetsUsd() external returns (uint256, bool success);
/// @notice Returns the request for a given owner
/// @param _owner The owner of the request
/// @return shares The shares of the request
/// @return timelockEndsAt The timelock end time of the request
function getWithdrawalRequest(address _owner) external view returns (uint256 shares, uint256 timelockEndsAt);
/// @notice Allows deposit of multiple tokens in a single transaction
/// @param tokens Array of token addresses to deposit
/// @param assets Array of amounts to deposit for each token
/// @param receiver Address that will receive the vault shares
/// @return shares Amount of vault shares minted
function deposit(address[] calldata tokens, uint256[] calldata assets, address receiver)
external
payable
returns (uint256 shares);
/// @notice Deposit a single asset for shares
/// @param assets Amount of asset to deposit
/// @param receiver Address that will receive the vault shares
/// @return shares Amount of vault shares minted
function deposit(uint256 assets, address receiver) external returns (uint256 shares);
/// @notice Mint exact amount of shares by depositing assets
/// @param shares Amount of shares to mint
/// @param receiver Address that will receive the vault shares
/// @return assets Amount of assets deposited
function mint(uint256 shares, address receiver) external returns (uint256 assets);
/// @notice Withdraw assets by burning shares
/// @param assets Amount of assets to withdraw
/// @param receiver Address that will receive the assets
/// @param owner Owner of the shares
/// @return shares Amount of shares burned
function withdraw(uint256 assets, address receiver, address owner) external returns (uint256 shares);
/// @notice Redeem shares for assets
/// @param shares Amount of shares to redeem
/// @param receiver Address that will receive the assets
/// @param owner Owner of the shares
/// @return assets Amount of assets withdrawn
function redeem(uint256 shares, address receiver, address owner) external returns (uint256 assets);
/**
* @notice Sets fee amount
* @param fee New fee amount (in basis points, max 10000 = 100%)
*/
function setFee(uint96 fee) external;
/**
* @notice Request a redeem of shares
* @param shares Amount of shares to redeem
*/
function requestRedeem(uint256 shares) external;
/**
* @notice Request a withdraw of assets
* @param assets Amount of assets to withdraw
*/
function requestWithdraw(uint256 assets) external;
/**
* @notice Clear a request
*/
function clearRequest() external;
} <i class='far fa-question-circle text-muted ms-2' data-bs-trigger='hover' data-bs-toggle='tooltip' data-bs-html='true' data-bs-title='Click on the check box to select individual contract to compare. Only 1 contract can be selected from each side.'></i>
// SPDX-License-Identifier: BUSL-1.1
pragma solidity 0.8.28;
import {MoreVaultsLib} from "../../libraries/MoreVaultsLib.sol";
import {IGenericMoreVaultFacetInitializable} from "./IGenericMoreVaultFacetInitializable.sol";
/**
* @title IBridgeFacet
* @dev Interface for the bridge facet providing cross-chain functionality for vaults
* @notice This interface defines methods for managing cross-chain operations between hub and spoke vaults
*/
interface IBridgeFacet is IGenericMoreVaultFacetInitializable {
error CrossChainRequestWasntFulfilled(bytes32);
error InvalidActionType();
error OnlyCrossChainAccountingManager();
error RequestWasntFulfilled();
error FinalizationCallFailed();
error OracleWasntSetForSpoke(address, uint32);
error NoOracleForSpoke(uint32);
error AlreadySet();
error AccountingViaOracles();
error AdapterNotAllowed(address);
error RequestTimedOut();
error RequestAlreadyFinalized();
error NotEnoughMsgValueProvided();
error SlippageExceeded(uint256 amountLD, uint256 minAmountLD);
/**
* @dev Returns the sum of assets from all spoke vaults in USD
* @return sum Sum of assets from all spoke vaults
* @return isPositive Flag indicating that the value is positive
* @notice Used for calculating the total value of assets in cross-chain vault
*/
function accountingBridgeFacet() external view returns (uint256 sum, bool isPositive);
/**
* @dev Enables or disables the use of oracles for cross-chain accounting
* @param isTrue true to enable oracles, false to disable
* @notice Only the owner can call this function
* @notice When enabling, checks for the presence of oracles for all spoke chains
*/
function setOraclesCrossChainAccounting(bool isTrue) external;
/**
* @dev Returns whether oracle-based cross-chain accounting is enabled
* @return true if oracle accounting is enabled, false otherwise
*/
function oraclesCrossChainAccounting() external view returns (bool);
/**
* @dev Quotes the native fee required to initiate cross-chain accounting
* @param extraOptions Additional options for the cross-chain read (adapter-specific)
* @return nativeFee The estimated native token fee required
*/
function quoteAccountingFee(bytes calldata extraOptions) external view returns (uint256 nativeFee);
/**
* @dev Executes a cross-chain bridge operation
* @param adapter Address of the adapter to use
* @param token Address of the token to bridge
* @param amount Amount of the token to bridge
* @param bridgeSpecificParams Bridge-specific parameters
*/
function executeBridging(address adapter, address token, uint256 amount, bytes calldata bridgeSpecificParams)
external
payable;
/**
* @dev Initiates a request to perform an action in a cross-chain vault
* @param actionType Type of action to perform (deposit, withdraw, mint, etc.)
* @param actionCallData Action call data
* @param minAmountOut Minimum expected output amount for slippage protection (0 = no slippage check)
* @param extraOptions Additional options for cross-chain transfer
* @return guid Unique request number for tracking
* @notice Function requires gas payment for cross-chain transfer
* @notice Available only when the contract is not paused
* @notice minAmountOut is used for slippage protection for all actions except SET_FEE
*/
function initVaultActionRequest(
MoreVaultsLib.ActionType actionType,
bytes calldata actionCallData,
uint256 minAmountOut,
bytes calldata extraOptions
) external payable returns (bytes32 guid);
/**
* @dev Updates accounting information for a request
* @param guid Request number to update
* @param sumOfSpokesUsdValue Sum of USD value of all spoke vaults
* @param readSuccess Flag indicating if the read operation was successful
* @notice Can only be called by the cross-chain accounting manager
* @notice Updates total assets and marks the request as fulfilled
*/
function updateAccountingInfoForRequest(bytes32 guid, uint256 sumOfSpokesUsdValue, bool readSuccess) external;
/**
* @dev Executes a cross-chain request action (deposit, mint, withdraw, etc.)
* @param guid Request number to execute
* @notice Can only be called by the cross-chain accounting manager
* @notice Requires the request to be fulfilled
* @notice Executes the action and performs slippage check
*/
function executeRequest(bytes32 guid) external;
/**
*
**
* @dev Returns the request info for a given guid
* @param guid Request number to get info for
* @return Request info
*/
function getRequestInfo(bytes32 guid) external view returns (MoreVaultsLib.CrossChainRequestInfo memory);
/**
* @dev Returns the finalization result for a given guid
* @param guid Request number to get finalization result for
* @return result The finalization result (e.g., shares amount for deposits)
*/
function getFinalizationResult(bytes32 guid) external view returns (uint256 result);
} <i class='far fa-question-circle text-muted ms-2' data-bs-trigger='hover' data-bs-toggle='tooltip' data-bs-html='true' data-bs-title='Click on the check box to select individual contract to compare. Only 1 contract can be selected from each side.'></i>
// SPDX-License-Identifier: MIT
// OpenZeppelin Contracts (last updated v5.4.0) (utils/Arrays.sol)
// This file was procedurally generated from scripts/generate/templates/Arrays.js.
pragma solidity ^0.8.20;
import {Comparators} from "./Comparators.sol";
import {SlotDerivation} from "./SlotDerivation.sol";
import {StorageSlot} from "./StorageSlot.sol";
import {Math} from "./math/Math.sol";
/**
* @dev Collection of functions related to array types.
*/
library Arrays {
using SlotDerivation for bytes32;
using StorageSlot for bytes32;
/**
* @dev Sort an array of uint256 (in memory) following the provided comparator function.
*
* This function does the sorting "in place", meaning that it overrides the input. The object is returned for
* convenience, but that returned value can be discarded safely if the caller has a memory pointer to the array.
*
* NOTE: this function's cost is `O(n · log(n))` in average and `O(n²)` in the worst case, with n the length of the
* array. Using it in view functions that are executed through `eth_call` is safe, but one should be very careful
* when executing this as part of a transaction. If the array being sorted is too large, the sort operation may
* consume more gas than is available in a block, leading to potential DoS.
*
* IMPORTANT: Consider memory side-effects when using custom comparator functions that access memory in an unsafe way.
*/
function sort(
uint256[] memory array,
function(uint256, uint256) pure returns (bool) comp
) internal pure returns (uint256[] memory) {
_quickSort(_begin(array), _end(array), comp);
return array;
}
/**
* @dev Variant of {sort} that sorts an array of uint256 in increasing order.
*/
function sort(uint256[] memory array) internal pure returns (uint256[] memory) {
sort(array, Comparators.lt);
return array;
}
/**
* @dev Sort an array of address (in memory) following the provided comparator function.
*
* This function does the sorting "in place", meaning that it overrides the input. The object is returned for
* convenience, but that returned value can be discarded safely if the caller has a memory pointer to the array.
*
* NOTE: this function's cost is `O(n · log(n))` in average and `O(n²)` in the worst case, with n the length of the
* array. Using it in view functions that are executed through `eth_call` is safe, but one should be very careful
* when executing this as part of a transaction. If the array being sorted is too large, the sort operation may
* consume more gas than is available in a block, leading to potential DoS.
*
* IMPORTANT: Consider memory side-effects when using custom comparator functions that access memory in an unsafe way.
*/
function sort(
address[] memory array,
function(address, address) pure returns (bool) comp
) internal pure returns (address[] memory) {
sort(_castToUint256Array(array), _castToUint256Comp(comp));
return array;
}
/**
* @dev Variant of {sort} that sorts an array of address in increasing order.
*/
function sort(address[] memory array) internal pure returns (address[] memory) {
sort(_castToUint256Array(array), Comparators.lt);
return array;
}
/**
* @dev Sort an array of bytes32 (in memory) following the provided comparator function.
*
* This function does the sorting "in place", meaning that it overrides the input. The object is returned for
* convenience, but that returned value can be discarded safely if the caller has a memory pointer to the array.
*
* NOTE: this function's cost is `O(n · log(n))` in average and `O(n²)` in the worst case, with n the length of the
* array. Using it in view functions that are executed through `eth_call` is safe, but one should be very careful
* when executing this as part of a transaction. If the array being sorted is too large, the sort operation may
* consume more gas than is available in a block, leading to potential DoS.
*
* IMPORTANT: Consider memory side-effects when using custom comparator functions that access memory in an unsafe way.
*/
function sort(
bytes32[] memory array,
function(bytes32, bytes32) pure returns (bool) comp
) internal pure returns (bytes32[] memory) {
sort(_castToUint256Array(array), _castToUint256Comp(comp));
return array;
}
/**
* @dev Variant of {sort} that sorts an array of bytes32 in increasing order.
*/
function sort(bytes32[] memory array) internal pure returns (bytes32[] memory) {
sort(_castToUint256Array(array), Comparators.lt);
return array;
}
/**
* @dev Performs a quick sort of a segment of memory. The segment sorted starts at `begin` (inclusive), and stops
* at end (exclusive). Sorting follows the `comp` comparator.
*
* Invariant: `begin <= end`. This is the case when initially called by {sort} and is preserved in subcalls.
*
* IMPORTANT: Memory locations between `begin` and `end` are not validated/zeroed. This function should
* be used only if the limits are within a memory array.
*/
function _quickSort(uint256 begin, uint256 end, function(uint256, uint256) pure returns (bool) comp) private pure {
unchecked {
if (end - begin < 0x40) return;
// Use first element as pivot
uint256 pivot = _mload(begin);
// Position where the pivot should be at the end of the loop
uint256 pos = begin;
for (uint256 it = begin + 0x20; it < end; it += 0x20) {
if (comp(_mload(it), pivot)) {
// If the value stored at the iterator's position comes before the pivot, we increment the
// position of the pivot and move the value there.
pos += 0x20;
_swap(pos, it);
}
}
_swap(begin, pos); // Swap pivot into place
_quickSort(begin, pos, comp); // Sort the left side of the pivot
_quickSort(pos + 0x20, end, comp); // Sort the right side of the pivot
}
}
/**
* @dev Pointer to the memory location of the first element of `array`.
*/
function _begin(uint256[] memory array) private pure returns (uint256 ptr) {
assembly ("memory-safe") {
ptr := add(array, 0x20)
}
}
/**
* @dev Pointer to the memory location of the first memory word (32bytes) after `array`. This is the memory word
* that comes just after the last element of the array.
*/
function _end(uint256[] memory array) private pure returns (uint256 ptr) {
unchecked {
return _begin(array) + array.length * 0x20;
}
}
/**
* @dev Load memory word (as a uint256) at location `ptr`.
*/
function _mload(uint256 ptr) private pure returns (uint256 value) {
assembly {
value := mload(ptr)
}
}
/**
* @dev Swaps the elements memory location `ptr1` and `ptr2`.
*/
function _swap(uint256 ptr1, uint256 ptr2) private pure {
assembly {
let value1 := mload(ptr1)
let value2 := mload(ptr2)
mstore(ptr1, value2)
mstore(ptr2, value1)
}
}
/// @dev Helper: low level cast address memory array to uint256 memory array
function _castToUint256Array(address[] memory input) private pure returns (uint256[] memory output) {
assembly {
output := input
}
}
/// @dev Helper: low level cast bytes32 memory array to uint256 memory array
function _castToUint256Array(bytes32[] memory input) private pure returns (uint256[] memory output) {
assembly {
output := input
}
}
/// @dev Helper: low level cast address comp function to uint256 comp function
function _castToUint256Comp(
function(address, address) pure returns (bool) input
) private pure returns (function(uint256, uint256) pure returns (bool) output) {
assembly {
output := input
}
}
/// @dev Helper: low level cast bytes32 comp function to uint256 comp function
function _castToUint256Comp(
function(bytes32, bytes32) pure returns (bool) input
) private pure returns (function(uint256, uint256) pure returns (bool) output) {
assembly {
output := input
}
}
/**
* @dev Searches a sorted `array` and returns the first index that contains
* a value greater or equal to `element`. If no such index exists (i.e. all
* values in the array are strictly less than `element`), the array length is
* returned. Time complexity O(log n).
*
* NOTE: The `array` is expected to be sorted in ascending order, and to
* contain no repeated elements.
*
* IMPORTANT: Deprecated. This implementation behaves as {lowerBound} but lacks
* support for repeated elements in the array. The {lowerBound} function should
* be used instead.
*/
function findUpperBound(uint256[] storage array, uint256 element) internal view returns (uint256) {
uint256 low = 0;
uint256 high = array.length;
if (high == 0) {
return 0;
}
while (low < high) {
uint256 mid = Math.average(low, high);
// Note that mid will always be strictly less than high (i.e. it will be a valid array index)
// because Math.average rounds towards zero (it does integer division with truncation).
if (unsafeAccess(array, mid).value > element) {
high = mid;
} else {
low = mid + 1;
}
}
// At this point `low` is the exclusive upper bound. We will return the inclusive upper bound.
if (low > 0 && unsafeAccess(array, low - 1).value == element) {
return low - 1;
} else {
return low;
}
}
/**
* @dev Searches an `array` sorted in ascending order and returns the first
* index that contains a value greater or equal than `element`. If no such index
* exists (i.e. all values in the array are strictly less than `element`), the array
* length is returned. Time complexity O(log n).
*
* See C++'s https://en.cppreference.com/w/cpp/algorithm/lower_bound[lower_bound].
*/
function lowerBound(uint256[] storage array, uint256 element) internal view returns (uint256) {
uint256 low = 0;
uint256 high = array.length;
if (high == 0) {
return 0;
}
while (low < high) {
uint256 mid = Math.average(low, high);
// Note that mid will always be strictly less than high (i.e. it will be a valid array index)
// because Math.average rounds towards zero (it does integer division with truncation).
if (unsafeAccess(array, mid).value < element) {
// this cannot overflow because mid < high
unchecked {
low = mid + 1;
}
} else {
high = mid;
}
}
return low;
}
/**
* @dev Searches an `array` sorted in ascending order and returns the first
* index that contains a value strictly greater than `element`. If no such index
* exists (i.e. all values in the array are strictly less than `element`), the array
* length is returned. Time complexity O(log n).
*
* See C++'s https://en.cppreference.com/w/cpp/algorithm/upper_bound[upper_bound].
*/
function upperBound(uint256[] storage array, uint256 element) internal view returns (uint256) {
uint256 low = 0;
uint256 high = array.length;
if (high == 0) {
return 0;
}
while (low < high) {
uint256 mid = Math.average(low, high);
// Note that mid will always be strictly less than high (i.e. it will be a valid array index)
// because Math.average rounds towards zero (it does integer division with truncation).
if (unsafeAccess(array, mid).value > element) {
high = mid;
} else {
// this cannot overflow because mid < high
unchecked {
low = mid + 1;
}
}
}
return low;
}
/**
* @dev Same as {lowerBound}, but with an array in memory.
*/
function lowerBoundMemory(uint256[] memory array, uint256 element) internal pure returns (uint256) {
uint256 low = 0;
uint256 high = array.length;
if (high == 0) {
return 0;
}
while (low < high) {
uint256 mid = Math.average(low, high);
// Note that mid will always be strictly less than high (i.e. it will be a valid array index)
// because Math.average rounds towards zero (it does integer division with truncation).
if (unsafeMemoryAccess(array, mid) < element) {
// this cannot overflow because mid < high
unchecked {
low = mid + 1;
}
} else {
high = mid;
}
}
return low;
}
/**
* @dev Same as {upperBound}, but with an array in memory.
*/
function upperBoundMemory(uint256[] memory array, uint256 element) internal pure returns (uint256) {
uint256 low = 0;
uint256 high = array.length;
if (high == 0) {
return 0;
}
while (low < high) {
uint256 mid = Math.average(low, high);
// Note that mid will always be strictly less than high (i.e. it will be a valid array index)
// because Math.average rounds towards zero (it does integer division with truncation).
if (unsafeMemoryAccess(array, mid) > element) {
high = mid;
} else {
// this cannot overflow because mid < high
unchecked {
low = mid + 1;
}
}
}
return low;
}
/**
* @dev Access an array in an "unsafe" way. Skips solidity "index-out-of-range" check.
*
* WARNING: Only use if you are certain `pos` is lower than the array length.
*/
function unsafeAccess(address[] storage arr, uint256 pos) internal pure returns (StorageSlot.AddressSlot storage) {
bytes32 slot;
assembly ("memory-safe") {
slot := arr.slot
}
return slot.deriveArray().offset(pos).getAddressSlot();
}
/**
* @dev Access an array in an "unsafe" way. Skips solidity "index-out-of-range" check.
*
* WARNING: Only use if you are certain `pos` is lower than the array length.
*/
function unsafeAccess(bytes32[] storage arr, uint256 pos) internal pure returns (StorageSlot.Bytes32Slot storage) {
bytes32 slot;
assembly ("memory-safe") {
slot := arr.slot
}
return slot.deriveArray().offset(pos).getBytes32Slot();
}
/**
* @dev Access an array in an "unsafe" way. Skips solidity "index-out-of-range" check.
*
* WARNING: Only use if you are certain `pos` is lower than the array length.
*/
function unsafeAccess(uint256[] storage arr, uint256 pos) internal pure returns (StorageSlot.Uint256Slot storage) {
bytes32 slot;
assembly ("memory-safe") {
slot := arr.slot
}
return slot.deriveArray().offset(pos).getUint256Slot();
}
/**
* @dev Access an array in an "unsafe" way. Skips solidity "index-out-of-range" check.
*
* WARNING: Only use if you are certain `pos` is lower than the array length.
*/
function unsafeAccess(bytes[] storage arr, uint256 pos) internal pure returns (StorageSlot.BytesSlot storage) {
bytes32 slot;
assembly ("memory-safe") {
slot := arr.slot
}
return slot.deriveArray().offset(pos).getBytesSlot();
}
/**
* @dev Access an array in an "unsafe" way. Skips solidity "index-out-of-range" check.
*
* WARNING: Only use if you are certain `pos` is lower than the array length.
*/
function unsafeAccess(string[] storage arr, uint256 pos) internal pure returns (StorageSlot.StringSlot storage) {
bytes32 slot;
assembly ("memory-safe") {
slot := arr.slot
}
return slot.deriveArray().offset(pos).getStringSlot();
}
/**
* @dev Access an array in an "unsafe" way. Skips solidity "index-out-of-range" check.
*
* WARNING: Only use if you are certain `pos` is lower than the array length.
*/
function unsafeMemoryAccess(address[] memory arr, uint256 pos) internal pure returns (address res) {
assembly {
res := mload(add(add(arr, 0x20), mul(pos, 0x20)))
}
}
/**
* @dev Access an array in an "unsafe" way. Skips solidity "index-out-of-range" check.
*
* WARNING: Only use if you are certain `pos` is lower than the array length.
*/
function unsafeMemoryAccess(bytes32[] memory arr, uint256 pos) internal pure returns (bytes32 res) {
assembly {
res := mload(add(add(arr, 0x20), mul(pos, 0x20)))
}
}
/**
* @dev Access an array in an "unsafe" way. Skips solidity "index-out-of-range" check.
*
* WARNING: Only use if you are certain `pos` is lower than the array length.
*/
function unsafeMemoryAccess(uint256[] memory arr, uint256 pos) internal pure returns (uint256 res) {
assembly {
res := mload(add(add(arr, 0x20), mul(pos, 0x20)))
}
}
/**
* @dev Access an array in an "unsafe" way. Skips solidity "index-out-of-range" check.
*
* WARNING: Only use if you are certain `pos` is lower than the array length.
*/
function unsafeMemoryAccess(bytes[] memory arr, uint256 pos) internal pure returns (bytes memory res) {
assembly {
res := mload(add(add(arr, 0x20), mul(pos, 0x20)))
}
}
/**
* @dev Access an array in an "unsafe" way. Skips solidity "index-out-of-range" check.
*
* WARNING: Only use if you are certain `pos` is lower than the array length.
*/
function unsafeMemoryAccess(string[] memory arr, uint256 pos) internal pure returns (string memory res) {
assembly {
res := mload(add(add(arr, 0x20), mul(pos, 0x20)))
}
}
/**
* @dev Helper to set the length of a dynamic array. Directly writing to `.length` is forbidden.
*
* WARNING: this does not clear elements if length is reduced, of initialize elements if length is increased.
*/
function unsafeSetLength(address[] storage array, uint256 len) internal {
assembly ("memory-safe") {
sstore(array.slot, len)
}
}
/**
* @dev Helper to set the length of a dynamic array. Directly writing to `.length` is forbidden.
*
* WARNING: this does not clear elements if length is reduced, of initialize elements if length is increased.
*/
function unsafeSetLength(bytes32[] storage array, uint256 len) internal {
assembly ("memory-safe") {
sstore(array.slot, len)
}
}
/**
* @dev Helper to set the length of a dynamic array. Directly writing to `.length` is forbidden.
*
* WARNING: this does not clear elements if length is reduced, of initialize elements if length is increased.
*/
function unsafeSetLength(uint256[] storage array, uint256 len) internal {
assembly ("memory-safe") {
sstore(array.slot, len)
}
}
/**
* @dev Helper to set the length of a dynamic array. Directly writing to `.length` is forbidden.
*
* WARNING: this does not clear elements if length is reduced, of initialize elements if length is increased.
*/
function unsafeSetLength(bytes[] storage array, uint256 len) internal {
assembly ("memory-safe") {
sstore(array.slot, len)
}
}
/**
* @dev Helper to set the length of a dynamic array. Directly writing to `.length` is forbidden.
*
* WARNING: this does not clear elements if length is reduced, of initialize elements if length is increased.
*/
function unsafeSetLength(string[] storage array, uint256 len) internal {
assembly ("memory-safe") {
sstore(array.slot, len)
}
}
} <i class='far fa-question-circle text-muted ms-2' data-bs-trigger='hover' data-bs-toggle='tooltip' data-bs-html='true' data-bs-title='Click on the check box to select individual contract to compare. Only 1 contract can be selected from each side.'></i>
// SPDX-License-Identifier: MIT
// OpenZeppelin Contracts (last updated v5.1.0) (utils/Panic.sol)
pragma solidity ^0.8.20;
/**
* @dev Helper library for emitting standardized panic codes.
*
* ```solidity
* contract Example {
* using Panic for uint256;
*
* // Use any of the declared internal constants
* function foo() { Panic.GENERIC.panic(); }
*
* // Alternatively
* function foo() { Panic.panic(Panic.GENERIC); }
* }
* ```
*
* Follows the list from https://github.com/ethereum/solidity/blob/v0.8.24/libsolutil/ErrorCodes.h[libsolutil].
*
* _Available since v5.1._
*/
// slither-disable-next-line unused-state
library Panic {
/// @dev generic / unspecified error
uint256 internal constant GENERIC = 0x00;
/// @dev used by the assert() builtin
uint256 internal constant ASSERT = 0x01;
/// @dev arithmetic underflow or overflow
uint256 internal constant UNDER_OVERFLOW = 0x11;
/// @dev division or modulo by zero
uint256 internal constant DIVISION_BY_ZERO = 0x12;
/// @dev enum conversion error
uint256 internal constant ENUM_CONVERSION_ERROR = 0x21;
/// @dev invalid encoding in storage
uint256 internal constant STORAGE_ENCODING_ERROR = 0x22;
/// @dev empty array pop
uint256 internal constant EMPTY_ARRAY_POP = 0x31;
/// @dev array out of bounds access
uint256 internal constant ARRAY_OUT_OF_BOUNDS = 0x32;
/// @dev resource error (too large allocation or too large array)
uint256 internal constant RESOURCE_ERROR = 0x41;
/// @dev calling invalid internal function
uint256 internal constant INVALID_INTERNAL_FUNCTION = 0x51;
/// @dev Reverts with a panic code. Recommended to use with
/// the internal constants with predefined codes.
function panic(uint256 code) internal pure {
assembly ("memory-safe") {
mstore(0x00, 0x4e487b71)
mstore(0x20, code)
revert(0x1c, 0x24)
}
}
} <i class='far fa-question-circle text-muted ms-2' data-bs-trigger='hover' data-bs-toggle='tooltip' data-bs-html='true' data-bs-title='Click on the check box to select individual contract to compare. Only 1 contract can be selected from each side.'></i>
// SPDX-License-Identifier: MIT
// OpenZeppelin Contracts (last updated v5.1.0) (utils/math/SafeCast.sol)
// This file was procedurally generated from scripts/generate/templates/SafeCast.js.
pragma solidity ^0.8.20;
/**
* @dev Wrappers over Solidity's uintXX/intXX/bool casting operators with added overflow
* checks.
*
* Downcasting from uint256/int256 in Solidity does not revert on overflow. This can
* easily result in undesired exploitation or bugs, since developers usually
* assume that overflows raise errors. `SafeCast` restores this intuition by
* reverting the transaction when such an operation overflows.
*
* Using this library instead of the unchecked operations eliminates an entire
* class of bugs, so it's recommended to use it always.
*/
library SafeCast {
/**
* @dev Value doesn't fit in an uint of `bits` size.
*/
error SafeCastOverflowedUintDowncast(uint8 bits, uint256 value);
/**
* @dev An int value doesn't fit in an uint of `bits` size.
*/
error SafeCastOverflowedIntToUint(int256 value);
/**
* @dev Value doesn't fit in an int of `bits` size.
*/
error SafeCastOverflowedIntDowncast(uint8 bits, int256 value);
/**
* @dev An uint value doesn't fit in an int of `bits` size.
*/
error SafeCastOverflowedUintToInt(uint256 value);
/**
* @dev Returns the downcasted uint248 from uint256, reverting on
* overflow (when the input is greater than largest uint248).
*
* Counterpart to Solidity's `uint248` operator.
*
* Requirements:
*
* - input must fit into 248 bits
*/
function toUint248(uint256 value) internal pure returns (uint248) {
if (value > type(uint248).max) {
revert SafeCastOverflowedUintDowncast(248, value);
}
return uint248(value);
}
/**
* @dev Returns the downcasted uint240 from uint256, reverting on
* overflow (when the input is greater than largest uint240).
*
* Counterpart to Solidity's `uint240` operator.
*
* Requirements:
*
* - input must fit into 240 bits
*/
function toUint240(uint256 value) internal pure returns (uint240) {
if (value > type(uint240).max) {
revert SafeCastOverflowedUintDowncast(240, value);
}
return uint240(value);
}
/**
* @dev Returns the downcasted uint232 from uint256, reverting on
* overflow (when the input is greater than largest uint232).
*
* Counterpart to Solidity's `uint232` operator.
*
* Requirements:
*
* - input must fit into 232 bits
*/
function toUint232(uint256 value) internal pure returns (uint232) {
if (value > type(uint232).max) {
revert SafeCastOverflowedUintDowncast(232, value);
}
return uint232(value);
}
/**
* @dev Returns the downcasted uint224 from uint256, reverting on
* overflow (when the input is greater than largest uint224).
*
* Counterpart to Solidity's `uint224` operator.
*
* Requirements:
*
* - input must fit into 224 bits
*/
function toUint224(uint256 value) internal pure returns (uint224) {
if (value > type(uint224).max) {
revert SafeCastOverflowedUintDowncast(224, value);
}
return uint224(value);
}
/**
* @dev Returns the downcasted uint216 from uint256, reverting on
* overflow (when the input is greater than largest uint216).
*
* Counterpart to Solidity's `uint216` operator.
*
* Requirements:
*
* - input must fit into 216 bits
*/
function toUint216(uint256 value) internal pure returns (uint216) {
if (value > type(uint216).max) {
revert SafeCastOverflowedUintDowncast(216, value);
}
return uint216(value);
}
/**
* @dev Returns the downcasted uint208 from uint256, reverting on
* overflow (when the input is greater than largest uint208).
*
* Counterpart to Solidity's `uint208` operator.
*
* Requirements:
*
* - input must fit into 208 bits
*/
function toUint208(uint256 value) internal pure returns (uint208) {
if (value > type(uint208).max) {
revert SafeCastOverflowedUintDowncast(208, value);
}
return uint208(value);
}
/**
* @dev Returns the downcasted uint200 from uint256, reverting on
* overflow (when the input is greater than largest uint200).
*
* Counterpart to Solidity's `uint200` operator.
*
* Requirements:
*
* - input must fit into 200 bits
*/
function toUint200(uint256 value) internal pure returns (uint200) {
if (value > type(uint200).max) {
revert SafeCastOverflowedUintDowncast(200, value);
}
return uint200(value);
}
/**
* @dev Returns the downcasted uint192 from uint256, reverting on
* overflow (when the input is greater than largest uint192).
*
* Counterpart to Solidity's `uint192` operator.
*
* Requirements:
*
* - input must fit into 192 bits
*/
function toUint192(uint256 value) internal pure returns (uint192) {
if (value > type(uint192).max) {
revert SafeCastOverflowedUintDowncast(192, value);
}
return uint192(value);
}
/**
* @dev Returns the downcasted uint184 from uint256, reverting on
* overflow (when the input is greater than largest uint184).
*
* Counterpart to Solidity's `uint184` operator.
*
* Requirements:
*
* - input must fit into 184 bits
*/
function toUint184(uint256 value) internal pure returns (uint184) {
if (value > type(uint184).max) {
revert SafeCastOverflowedUintDowncast(184, value);
}
return uint184(value);
}
/**
* @dev Returns the downcasted uint176 from uint256, reverting on
* overflow (when the input is greater than largest uint176).
*
* Counterpart to Solidity's `uint176` operator.
*
* Requirements:
*
* - input must fit into 176 bits
*/
function toUint176(uint256 value) internal pure returns (uint176) {
if (value > type(uint176).max) {
revert SafeCastOverflowedUintDowncast(176, value);
}
return uint176(value);
}
/**
* @dev Returns the downcasted uint168 from uint256, reverting on
* overflow (when the input is greater than largest uint168).
*
* Counterpart to Solidity's `uint168` operator.
*
* Requirements:
*
* - input must fit into 168 bits
*/
function toUint168(uint256 value) internal pure returns (uint168) {
if (value > type(uint168).max) {
revert SafeCastOverflowedUintDowncast(168, value);
}
return uint168(value);
}
/**
* @dev Returns the downcasted uint160 from uint256, reverting on
* overflow (when the input is greater than largest uint160).
*
* Counterpart to Solidity's `uint160` operator.
*
* Requirements:
*
* - input must fit into 160 bits
*/
function toUint160(uint256 value) internal pure returns (uint160) {
if (value > type(uint160).max) {
revert SafeCastOverflowedUintDowncast(160, value);
}
return uint160(value);
}
/**
* @dev Returns the downcasted uint152 from uint256, reverting on
* overflow (when the input is greater than largest uint152).
*
* Counterpart to Solidity's `uint152` operator.
*
* Requirements:
*
* - input must fit into 152 bits
*/
function toUint152(uint256 value) internal pure returns (uint152) {
if (value > type(uint152).max) {
revert SafeCastOverflowedUintDowncast(152, value);
}
return uint152(value);
}
/**
* @dev Returns the downcasted uint144 from uint256, reverting on
* overflow (when the input is greater than largest uint144).
*
* Counterpart to Solidity's `uint144` operator.
*
* Requirements:
*
* - input must fit into 144 bits
*/
function toUint144(uint256 value) internal pure returns (uint144) {
if (value > type(uint144).max) {
revert SafeCastOverflowedUintDowncast(144, value);
}
return uint144(value);
}
/**
* @dev Returns the downcasted uint136 from uint256, reverting on
* overflow (when the input is greater than largest uint136).
*
* Counterpart to Solidity's `uint136` operator.
*
* Requirements:
*
* - input must fit into 136 bits
*/
function toUint136(uint256 value) internal pure returns (uint136) {
if (value > type(uint136).max) {
revert SafeCastOverflowedUintDowncast(136, value);
}
return uint136(value);
}
/**
* @dev Returns the downcasted uint128 from uint256, reverting on
* overflow (when the input is greater than largest uint128).
*
* Counterpart to Solidity's `uint128` operator.
*
* Requirements:
*
* - input must fit into 128 bits
*/
function toUint128(uint256 value) internal pure returns (uint128) {
if (value > type(uint128).max) {
revert SafeCastOverflowedUintDowncast(128, value);
}
return uint128(value);
}
/**
* @dev Returns the downcasted uint120 from uint256, reverting on
* overflow (when the input is greater than largest uint120).
*
* Counterpart to Solidity's `uint120` operator.
*
* Requirements:
*
* - input must fit into 120 bits
*/
function toUint120(uint256 value) internal pure returns (uint120) {
if (value > type(uint120).max) {
revert SafeCastOverflowedUintDowncast(120, value);
}
return uint120(value);
}
/**
* @dev Returns the downcasted uint112 from uint256, reverting on
* overflow (when the input is greater than largest uint112).
*
* Counterpart to Solidity's `uint112` operator.
*
* Requirements:
*
* - input must fit into 112 bits
*/
function toUint112(uint256 value) internal pure returns (uint112) {
if (value > type(uint112).max) {
revert SafeCastOverflowedUintDowncast(112, value);
}
return uint112(value);
}
/**
* @dev Returns the downcasted uint104 from uint256, reverting on
* overflow (when the input is greater than largest uint104).
*
* Counterpart to Solidity's `uint104` operator.
*
* Requirements:
*
* - input must fit into 104 bits
*/
function toUint104(uint256 value) internal pure returns (uint104) {
if (value > type(uint104).max) {
revert SafeCastOverflowedUintDowncast(104, value);
}
return uint104(value);
}
/**
* @dev Returns the downcasted uint96 from uint256, reverting on
* overflow (when the input is greater than largest uint96).
*
* Counterpart to Solidity's `uint96` operator.
*
* Requirements:
*
* - input must fit into 96 bits
*/
function toUint96(uint256 value) internal pure returns (uint96) {
if (value > type(uint96).max) {
revert SafeCastOverflowedUintDowncast(96, value);
}
return uint96(value);
}
/**
* @dev Returns the downcasted uint88 from uint256, reverting on
* overflow (when the input is greater than largest uint88).
*
* Counterpart to Solidity's `uint88` operator.
*
* Requirements:
*
* - input must fit into 88 bits
*/
function toUint88(uint256 value) internal pure returns (uint88) {
if (value > type(uint88).max) {
revert SafeCastOverflowedUintDowncast(88, value);
}
return uint88(value);
}
/**
* @dev Returns the downcasted uint80 from uint256, reverting on
* overflow (when the input is greater than largest uint80).
*
* Counterpart to Solidity's `uint80` operator.
*
* Requirements:
*
* - input must fit into 80 bits
*/
function toUint80(uint256 value) internal pure returns (uint80) {
if (value > type(uint80).max) {
revert SafeCastOverflowedUintDowncast(80, value);
}
return uint80(value);
}
/**
* @dev Returns the downcasted uint72 from uint256, reverting on
* overflow (when the input is greater than largest uint72).
*
* Counterpart to Solidity's `uint72` operator.
*
* Requirements:
*
* - input must fit into 72 bits
*/
function toUint72(uint256 value) internal pure returns (uint72) {
if (value > type(uint72).max) {
revert SafeCastOverflowedUintDowncast(72, value);
}
return uint72(value);
}
/**
* @dev Returns the downcasted uint64 from uint256, reverting on
* overflow (when the input is greater than largest uint64).
*
* Counterpart to Solidity's `uint64` operator.
*
* Requirements:
*
* - input must fit into 64 bits
*/
function toUint64(uint256 value) internal pure returns (uint64) {
if (value > type(uint64).max) {
revert SafeCastOverflowedUintDowncast(64, value);
}
return uint64(value);
}
/**
* @dev Returns the downcasted uint56 from uint256, reverting on
* overflow (when the input is greater than largest uint56).
*
* Counterpart to Solidity's `uint56` operator.
*
* Requirements:
*
* - input must fit into 56 bits
*/
function toUint56(uint256 value) internal pure returns (uint56) {
if (value > type(uint56).max) {
revert SafeCastOverflowedUintDowncast(56, value);
}
return uint56(value);
}
/**
* @dev Returns the downcasted uint48 from uint256, reverting on
* overflow (when the input is greater than largest uint48).
*
* Counterpart to Solidity's `uint48` operator.
*
* Requirements:
*
* - input must fit into 48 bits
*/
function toUint48(uint256 value) internal pure returns (uint48) {
if (value > type(uint48).max) {
revert SafeCastOverflowedUintDowncast(48, value);
}
return uint48(value);
}
/**
* @dev Returns the downcasted uint40 from uint256, reverting on
* overflow (when the input is greater than largest uint40).
*
* Counterpart to Solidity's `uint40` operator.
*
* Requirements:
*
* - input must fit into 40 bits
*/
function toUint40(uint256 value) internal pure returns (uint40) {
if (value > type(uint40).max) {
revert SafeCastOverflowedUintDowncast(40, value);
}
return uint40(value);
}
/**
* @dev Returns the downcasted uint32 from uint256, reverting on
* overflow (when the input is greater than largest uint32).
*
* Counterpart to Solidity's `uint32` operator.
*
* Requirements:
*
* - input must fit into 32 bits
*/
function toUint32(uint256 value) internal pure returns (uint32) {
if (value > type(uint32).max) {
revert SafeCastOverflowedUintDowncast(32, value);
}
return uint32(value);
}
/**
* @dev Returns the downcasted uint24 from uint256, reverting on
* overflow (when the input is greater than largest uint24).
*
* Counterpart to Solidity's `uint24` operator.
*
* Requirements:
*
* - input must fit into 24 bits
*/
function toUint24(uint256 value) internal pure returns (uint24) {
if (value > type(uint24).max) {
revert SafeCastOverflowedUintDowncast(24, value);
}
return uint24(value);
}
/**
* @dev Returns the downcasted uint16 from uint256, reverting on
* overflow (when the input is greater than largest uint16).
*
* Counterpart to Solidity's `uint16` operator.
*
* Requirements:
*
* - input must fit into 16 bits
*/
function toUint16(uint256 value) internal pure returns (uint16) {
if (value > type(uint16).max) {
revert SafeCastOverflowedUintDowncast(16, value);
}
return uint16(value);
}
/**
* @dev Returns the downcasted uint8 from uint256, reverting on
* overflow (when the input is greater than largest uint8).
*
* Counterpart to Solidity's `uint8` operator.
*
* Requirements:
*
* - input must fit into 8 bits
*/
function toUint8(uint256 value) internal pure returns (uint8) {
if (value > type(uint8).max) {
revert SafeCastOverflowedUintDowncast(8, value);
}
return uint8(value);
}
/**
* @dev Converts a signed int256 into an unsigned uint256.
*
* Requirements:
*
* - input must be greater than or equal to 0.
*/
function toUint256(int256 value) internal pure returns (uint256) {
if (value < 0) {
revert SafeCastOverflowedIntToUint(value);
}
return uint256(value);
}
/**
* @dev Returns the downcasted int248 from int256, reverting on
* overflow (when the input is less than smallest int248 or
* greater than largest int248).
*
* Counterpart to Solidity's `int248` operator.
*
* Requirements:
*
* - input must fit into 248 bits
*/
function toInt248(int256 value) internal pure returns (int248 downcasted) {
downcasted = int248(value);
if (downcasted != value) {
revert SafeCastOverflowedIntDowncast(248, value);
}
}
/**
* @dev Returns the downcasted int240 from int256, reverting on
* overflow (when the input is less than smallest int240 or
* greater than largest int240).
*
* Counterpart to Solidity's `int240` operator.
*
* Requirements:
*
* - input must fit into 240 bits
*/
function toInt240(int256 value) internal pure returns (int240 downcasted) {
downcasted = int240(value);
if (downcasted != value) {
revert SafeCastOverflowedIntDowncast(240, value);
}
}
/**
* @dev Returns the downcasted int232 from int256, reverting on
* overflow (when the input is less than smallest int232 or
* greater than largest int232).
*
* Counterpart to Solidity's `int232` operator.
*
* Requirements:
*
* - input must fit into 232 bits
*/
function toInt232(int256 value) internal pure returns (int232 downcasted) {
downcasted = int232(value);
if (downcasted != value) {
revert SafeCastOverflowedIntDowncast(232, value);
}
}
/**
* @dev Returns the downcasted int224 from int256, reverting on
* overflow (when the input is less than smallest int224 or
* greater than largest int224).
*
* Counterpart to Solidity's `int224` operator.
*
* Requirements:
*
* - input must fit into 224 bits
*/
function toInt224(int256 value) internal pure returns (int224 downcasted) {
downcasted = int224(value);
if (downcasted != value) {
revert SafeCastOverflowedIntDowncast(224, value);
}
}
/**
* @dev Returns the downcasted int216 from int256, reverting on
* overflow (when the input is less than smallest int216 or
* greater than largest int216).
*
* Counterpart to Solidity's `int216` operator.
*
* Requirements:
*
* - input must fit into 216 bits
*/
function toInt216(int256 value) internal pure returns (int216 downcasted) {
downcasted = int216(value);
if (downcasted != value) {
revert SafeCastOverflowedIntDowncast(216, value);
}
}
/**
* @dev Returns the downcasted int208 from int256, reverting on
* overflow (when the input is less than smallest int208 or
* greater than largest int208).
*
* Counterpart to Solidity's `int208` operator.
*
* Requirements:
*
* - input must fit into 208 bits
*/
function toInt208(int256 value) internal pure returns (int208 downcasted) {
downcasted = int208(value);
if (downcasted != value) {
revert SafeCastOverflowedIntDowncast(208, value);
}
}
/**
* @dev Returns the downcasted int200 from int256, reverting on
* overflow (when the input is less than smallest int200 or
* greater than largest int200).
*
* Counterpart to Solidity's `int200` operator.
*
* Requirements:
*
* - input must fit into 200 bits
*/
function toInt200(int256 value) internal pure returns (int200 downcasted) {
downcasted = int200(value);
if (downcasted != value) {
revert SafeCastOverflowedIntDowncast(200, value);
}
}
/**
* @dev Returns the downcasted int192 from int256, reverting on
* overflow (when the input is less than smallest int192 or
* greater than largest int192).
*
* Counterpart to Solidity's `int192` operator.
*
* Requirements:
*
* - input must fit into 192 bits
*/
function toInt192(int256 value) internal pure returns (int192 downcasted) {
downcasted = int192(value);
if (downcasted != value) {
revert SafeCastOverflowedIntDowncast(192, value);
}
}
/**
* @dev Returns the downcasted int184 from int256, reverting on
* overflow (when the input is less than smallest int184 or
* greater than largest int184).
*
* Counterpart to Solidity's `int184` operator.
*
* Requirements:
*
* - input must fit into 184 bits
*/
function toInt184(int256 value) internal pure returns (int184 downcasted) {
downcasted = int184(value);
if (downcasted != value) {
revert SafeCastOverflowedIntDowncast(184, value);
}
}
/**
* @dev Returns the downcasted int176 from int256, reverting on
* overflow (when the input is less than smallest int176 or
* greater than largest int176).
*
* Counterpart to Solidity's `int176` operator.
*
* Requirements:
*
* - input must fit into 176 bits
*/
function toInt176(int256 value) internal pure returns (int176 downcasted) {
downcasted = int176(value);
if (downcasted != value) {
revert SafeCastOverflowedIntDowncast(176, value);
}
}
/**
* @dev Returns the downcasted int168 from int256, reverting on
* overflow (when the input is less than smallest int168 or
* greater than largest int168).
*
* Counterpart to Solidity's `int168` operator.
*
* Requirements:
*
* - input must fit into 168 bits
*/
function toInt168(int256 value) internal pure returns (int168 downcasted) {
downcasted = int168(value);
if (downcasted != value) {
revert SafeCastOverflowedIntDowncast(168, value);
}
}
/**
* @dev Returns the downcasted int160 from int256, reverting on
* overflow (when the input is less than smallest int160 or
* greater than largest int160).
*
* Counterpart to Solidity's `int160` operator.
*
* Requirements:
*
* - input must fit into 160 bits
*/
function toInt160(int256 value) internal pure returns (int160 downcasted) {
downcasted = int160(value);
if (downcasted != value) {
revert SafeCastOverflowedIntDowncast(160, value);
}
}
/**
* @dev Returns the downcasted int152 from int256, reverting on
* overflow (when the input is less than smallest int152 or
* greater than largest int152).
*
* Counterpart to Solidity's `int152` operator.
*
* Requirements:
*
* - input must fit into 152 bits
*/
function toInt152(int256 value) internal pure returns (int152 downcasted) {
downcasted = int152(value);
if (downcasted != value) {
revert SafeCastOverflowedIntDowncast(152, value);
}
}
/**
* @dev Returns the downcasted int144 from int256, reverting on
* overflow (when the input is less than smallest int144 or
* greater than largest int144).
*
* Counterpart to Solidity's `int144` operator.
*
* Requirements:
*
* - input must fit into 144 bits
*/
function toInt144(int256 value) internal pure returns (int144 downcasted) {
downcasted = int144(value);
if (downcasted != value) {
revert SafeCastOverflowedIntDowncast(144, value);
}
}
/**
* @dev Returns the downcasted int136 from int256, reverting on
* overflow (when the input is less than smallest int136 or
* greater than largest int136).
*
* Counterpart to Solidity's `int136` operator.
*
* Requirements:
*
* - input must fit into 136 bits
*/
function toInt136(int256 value) internal pure returns (int136 downcasted) {
downcasted = int136(value);
if (downcasted != value) {
revert SafeCastOverflowedIntDowncast(136, value);
}
}
/**
* @dev Returns the downcasted int128 from int256, reverting on
* overflow (when the input is less than smallest int128 or
* greater than largest int128).
*
* Counterpart to Solidity's `int128` operator.
*
* Requirements:
*
* - input must fit into 128 bits
*/
function toInt128(int256 value) internal pure returns (int128 downcasted) {
downcasted = int128(value);
if (downcasted != value) {
revert SafeCastOverflowedIntDowncast(128, value);
}
}
/**
* @dev Returns the downcasted int120 from int256, reverting on
* overflow (when the input is less than smallest int120 or
* greater than largest int120).
*
* Counterpart to Solidity's `int120` operator.
*
* Requirements:
*
* - input must fit into 120 bits
*/
function toInt120(int256 value) internal pure returns (int120 downcasted) {
downcasted = int120(value);
if (downcasted != value) {
revert SafeCastOverflowedIntDowncast(120, value);
}
}
/**
* @dev Returns the downcasted int112 from int256, reverting on
* overflow (when the input is less than smallest int112 or
* greater than largest int112).
*
* Counterpart to Solidity's `int112` operator.
*
* Requirements:
*
* - input must fit into 112 bits
*/
function toInt112(int256 value) internal pure returns (int112 downcasted) {
downcasted = int112(value);
if (downcasted != value) {
revert SafeCastOverflowedIntDowncast(112, value);
}
}
/**
* @dev Returns the downcasted int104 from int256, reverting on
* overflow (when the input is less than smallest int104 or
* greater than largest int104).
*
* Counterpart to Solidity's `int104` operator.
*
* Requirements:
*
* - input must fit into 104 bits
*/
function toInt104(int256 value) internal pure returns (int104 downcasted) {
downcasted = int104(value);
if (downcasted != value) {
revert SafeCastOverflowedIntDowncast(104, value);
}
}
/**
* @dev Returns the downcasted int96 from int256, reverting on
* overflow (when the input is less than smallest int96 or
* greater than largest int96).
*
* Counterpart to Solidity's `int96` operator.
*
* Requirements:
*
* - input must fit into 96 bits
*/
function toInt96(int256 value) internal pure returns (int96 downcasted) {
downcasted = int96(value);
if (downcasted != value) {
revert SafeCastOverflowedIntDowncast(96, value);
}
}
/**
* @dev Returns the downcasted int88 from int256, reverting on
* overflow (when the input is less than smallest int88 or
* greater than largest int88).
*
* Counterpart to Solidity's `int88` operator.
*
* Requirements:
*
* - input must fit into 88 bits
*/
function toInt88(int256 value) internal pure returns (int88 downcasted) {
downcasted = int88(value);
if (downcasted != value) {
revert SafeCastOverflowedIntDowncast(88, value);
}
}
/**
* @dev Returns the downcasted int80 from int256, reverting on
* overflow (when the input is less than smallest int80 or
* greater than largest int80).
*
* Counterpart to Solidity's `int80` operator.
*
* Requirements:
*
* - input must fit into 80 bits
*/
function toInt80(int256 value) internal pure returns (int80 downcasted) {
downcasted = int80(value);
if (downcasted != value) {
revert SafeCastOverflowedIntDowncast(80, value);
}
}
/**
* @dev Returns the downcasted int72 from int256, reverting on
* overflow (when the input is less than smallest int72 or
* greater than largest int72).
*
* Counterpart to Solidity's `int72` operator.
*
* Requirements:
*
* - input must fit into 72 bits
*/
function toInt72(int256 value) internal pure returns (int72 downcasted) {
downcasted = int72(value);
if (downcasted != value) {
revert SafeCastOverflowedIntDowncast(72, value);
}
}
/**
* @dev Returns the downcasted int64 from int256, reverting on
* overflow (when the input is less than smallest int64 or
* greater than largest int64).
*
* Counterpart to Solidity's `int64` operator.
*
* Requirements:
*
* - input must fit into 64 bits
*/
function toInt64(int256 value) internal pure returns (int64 downcasted) {
downcasted = int64(value);
if (downcasted != value) {
revert SafeCastOverflowedIntDowncast(64, value);
}
}
/**
* @dev Returns the downcasted int56 from int256, reverting on
* overflow (when the input is less than smallest int56 or
* greater than largest int56).
*
* Counterpart to Solidity's `int56` operator.
*
* Requirements:
*
* - input must fit into 56 bits
*/
function toInt56(int256 value) internal pure returns (int56 downcasted) {
downcasted = int56(value);
if (downcasted != value) {
revert SafeCastOverflowedIntDowncast(56, value);
}
}
/**
* @dev Returns the downcasted int48 from int256, reverting on
* overflow (when the input is less than smallest int48 or
* greater than largest int48).
*
* Counterpart to Solidity's `int48` operator.
*
* Requirements:
*
* - input must fit into 48 bits
*/
function toInt48(int256 value) internal pure returns (int48 downcasted) {
downcasted = int48(value);
if (downcasted != value) {
revert SafeCastOverflowedIntDowncast(48, value);
}
}
/**
* @dev Returns the downcasted int40 from int256, reverting on
* overflow (when the input is less than smallest int40 or
* greater than largest int40).
*
* Counterpart to Solidity's `int40` operator.
*
* Requirements:
*
* - input must fit into 40 bits
*/
function toInt40(int256 value) internal pure returns (int40 downcasted) {
downcasted = int40(value);
if (downcasted != value) {
revert SafeCastOverflowedIntDowncast(40, value);
}
}
/**
* @dev Returns the downcasted int32 from int256, reverting on
* overflow (when the input is less than smallest int32 or
* greater than largest int32).
*
* Counterpart to Solidity's `int32` operator.
*
* Requirements:
*
* - input must fit into 32 bits
*/
function toInt32(int256 value) internal pure returns (int32 downcasted) {
downcasted = int32(value);
if (downcasted != value) {
revert SafeCastOverflowedIntDowncast(32, value);
}
}
/**
* @dev Returns the downcasted int24 from int256, reverting on
* overflow (when the input is less than smallest int24 or
* greater than largest int24).
*
* Counterpart to Solidity's `int24` operator.
*
* Requirements:
*
* - input must fit into 24 bits
*/
function toInt24(int256 value) internal pure returns (int24 downcasted) {
downcasted = int24(value);
if (downcasted != value) {
revert SafeCastOverflowedIntDowncast(24, value);
}
}
/**
* @dev Returns the downcasted int16 from int256, reverting on
* overflow (when the input is less than smallest int16 or
* greater than largest int16).
*
* Counterpart to Solidity's `int16` operator.
*
* Requirements:
*
* - input must fit into 16 bits
*/
function toInt16(int256 value) internal pure returns (int16 downcasted) {
downcasted = int16(value);
if (downcasted != value) {
revert SafeCastOverflowedIntDowncast(16, value);
}
}
/**
* @dev Returns the downcasted int8 from int256, reverting on
* overflow (when the input is less than smallest int8 or
* greater than largest int8).
*
* Counterpart to Solidity's `int8` operator.
*
* Requirements:
*
* - input must fit into 8 bits
*/
function toInt8(int256 value) internal pure returns (int8 downcasted) {
downcasted = int8(value);
if (downcasted != value) {
revert SafeCastOverflowedIntDowncast(8, value);
}
}
/**
* @dev Converts an unsigned uint256 into a signed int256.
*
* Requirements:
*
* - input must be less than or equal to maxInt256.
*/
function toInt256(uint256 value) internal pure returns (int256) {
// Note: Unsafe cast below is okay because `type(int256).max` is guaranteed to be positive
if (value > uint256(type(int256).max)) {
revert SafeCastOverflowedUintToInt(value);
}
return int256(value);
}
/**
* @dev Cast a boolean (false or true) to a uint256 (0 or 1) with no jump.
*/
function toUint(bool b) internal pure returns (uint256 u) {
assembly ("memory-safe") {
u := iszero(iszero(b))
}
}
} <i class='far fa-question-circle text-muted ms-2' data-bs-trigger='hover' data-bs-toggle='tooltip' data-bs-html='true' data-bs-title='Click on the check box to select individual contract to compare. Only 1 contract can be selected from each side.'></i>
// SPDX-License-Identifier: MIT
// OpenZeppelin Contracts (last updated v5.4.0) (token/ERC20/IERC20.sol)
pragma solidity >=0.4.16;
/**
* @dev Interface of the ERC-20 standard as defined in the ERC.
*/
interface IERC20 {
/**
* @dev Emitted when `value` tokens are moved from one account (`from`) to
* another (`to`).
*
* Note that `value` may be zero.
*/
event Transfer(address indexed from, address indexed to, uint256 value);
/**
* @dev Emitted when the allowance of a `spender` for an `owner` is set by
* a call to {approve}. `value` is the new allowance.
*/
event Approval(address indexed owner, address indexed spender, uint256 value);
/**
* @dev Returns the value of tokens in existence.
*/
function totalSupply() external view returns (uint256);
/**
* @dev Returns the value of tokens owned by `account`.
*/
function balanceOf(address account) external view returns (uint256);
/**
* @dev Moves a `value` amount of tokens from the caller's account to `to`.
*
* Returns a boolean value indicating whether the operation succeeded.
*
* Emits a {Transfer} event.
*/
function transfer(address to, uint256 value) external returns (bool);
/**
* @dev Returns the remaining number of tokens that `spender` will be
* allowed to spend on behalf of `owner` through {transferFrom}. This is
* zero by default.
*
* This value changes when {approve} or {transferFrom} are called.
*/
function allowance(address owner, address spender) external view returns (uint256);
/**
* @dev Sets a `value` amount of tokens as the allowance of `spender` over the
* caller's tokens.
*
* Returns a boolean value indicating whether the operation succeeded.
*
* IMPORTANT: Beware that changing an allowance with this method brings the risk
* that someone may use both the old and the new allowance by unfortunate
* transaction ordering. One possible solution to mitigate this race
* condition is to first reduce the spender's allowance to 0 and set the
* desired value afterwards:
* https://github.com/ethereum/EIPs/issues/20#issuecomment-263524729
*
* Emits an {Approval} event.
*/
function approve(address spender, uint256 value) external returns (bool);
/**
* @dev Moves a `value` amount of tokens from `from` to `to` using the
* allowance mechanism. `value` is then deducted from the caller's
* allowance.
*
* Returns a boolean value indicating whether the operation succeeded.
*
* Emits a {Transfer} event.
*/
function transferFrom(address from, address to, uint256 value) external returns (bool);
} <i class='far fa-question-circle text-muted ms-2' data-bs-trigger='hover' data-bs-toggle='tooltip' data-bs-html='true' data-bs-title='Click on the check box to select individual contract to compare. Only 1 contract can be selected from each side.'></i>
// SPDX-License-Identifier: MIT
pragma solidity 0.8.28;
interface IGenericMoreVaultFacet {
function facetName() external view returns (string memory);
function facetVersion() external view returns (string memory);
} <i class='far fa-question-circle text-muted ms-2' data-bs-trigger='hover' data-bs-toggle='tooltip' data-bs-html='true' data-bs-title='Click on the check box to select individual contract to compare. Only 1 contract can be selected from each side.'></i>
// SPDX-License-Identifier: MIT
// OpenZeppelin Contracts (last updated v5.4.0) (interfaces/IERC4626.sol)
pragma solidity >=0.6.2;
import {IERC20} from "../token/ERC20/IERC20.sol";
import {IERC20Metadata} from "../token/ERC20/extensions/IERC20Metadata.sol";
/**
* @dev Interface of the ERC-4626 "Tokenized Vault Standard", as defined in
* https://eips.ethereum.org/EIPS/eip-4626[ERC-4626].
*/
interface IERC4626 is IERC20, IERC20Metadata {
event Deposit(address indexed sender, address indexed owner, uint256 assets, uint256 shares);
event Withdraw(
address indexed sender,
address indexed receiver,
address indexed owner,
uint256 assets,
uint256 shares
);
/**
* @dev Returns the address of the underlying token used for the Vault for accounting, depositing, and withdrawing.
*
* - MUST be an ERC-20 token contract.
* - MUST NOT revert.
*/
function asset() external view returns (address assetTokenAddress);
/**
* @dev Returns the total amount of the underlying asset that is “managed” by Vault.
*
* - SHOULD include any compounding that occurs from yield.
* - MUST be inclusive of any fees that are charged against assets in the Vault.
* - MUST NOT revert.
*/
function totalAssets() external view returns (uint256 totalManagedAssets);
/**
* @dev Returns the amount of shares that the Vault would exchange for the amount of assets provided, in an ideal
* scenario where all the conditions are met.
*
* - MUST NOT be inclusive of any fees that are charged against assets in the Vault.
* - MUST NOT show any variations depending on the caller.
* - MUST NOT reflect slippage or other on-chain conditions, when performing the actual exchange.
* - MUST NOT revert.
*
* NOTE: This calculation MAY NOT reflect the “per-user” price-per-share, and instead should reflect the
* “average-user’s” price-per-share, meaning what the average user should expect to see when exchanging to and
* from.
*/
function convertToShares(uint256 assets) external view returns (uint256 shares);
/**
* @dev Returns the amount of assets that the Vault would exchange for the amount of shares provided, in an ideal
* scenario where all the conditions are met.
*
* - MUST NOT be inclusive of any fees that are charged against assets in the Vault.
* - MUST NOT show any variations depending on the caller.
* - MUST NOT reflect slippage or other on-chain conditions, when performing the actual exchange.
* - MUST NOT revert.
*
* NOTE: This calculation MAY NOT reflect the “per-user” price-per-share, and instead should reflect the
* “average-user’s” price-per-share, meaning what the average user should expect to see when exchanging to and
* from.
*/
function convertToAssets(uint256 shares) external view returns (uint256 assets);
/**
* @dev Returns the maximum amount of the underlying asset that can be deposited into the Vault for the receiver,
* through a deposit call.
*
* - MUST return a limited value if receiver is subject to some deposit limit.
* - MUST return 2 ** 256 - 1 if there is no limit on the maximum amount of assets that may be deposited.
* - MUST NOT revert.
*/
function maxDeposit(address receiver) external view returns (uint256 maxAssets);
/**
* @dev Allows an on-chain or off-chain user to simulate the effects of their deposit at the current block, given
* current on-chain conditions.
*
* - MUST return as close to and no more than the exact amount of Vault shares that would be minted in a deposit
* call in the same transaction. I.e. deposit should return the same or more shares as previewDeposit if called
* in the same transaction.
* - MUST NOT account for deposit limits like those returned from maxDeposit and should always act as though the
* deposit would be accepted, regardless if the user has enough tokens approved, etc.
* - MUST be inclusive of deposit fees. Integrators should be aware of the existence of deposit fees.
* - MUST NOT revert.
*
* NOTE: any unfavorable discrepancy between convertToShares and previewDeposit SHOULD be considered slippage in
* share price or some other type of condition, meaning the depositor will lose assets by depositing.
*/
function previewDeposit(uint256 assets) external view returns (uint256 shares);
/**
* @dev Mints shares Vault shares to receiver by depositing exactly amount of underlying tokens.
*
* - MUST emit the Deposit event.
* - MAY support an additional flow in which the underlying tokens are owned by the Vault contract before the
* deposit execution, and are accounted for during deposit.
* - MUST revert if all of assets cannot be deposited (due to deposit limit being reached, slippage, the user not
* approving enough underlying tokens to the Vault contract, etc).
*
* NOTE: most implementations will require pre-approval of the Vault with the Vault’s underlying asset token.
*/
function deposit(uint256 assets, address receiver) external returns (uint256 shares);
/**
* @dev Returns the maximum amount of the Vault shares that can be minted for the receiver, through a mint call.
* - MUST return a limited value if receiver is subject to some mint limit.
* - MUST return 2 ** 256 - 1 if there is no limit on the maximum amount of shares that may be minted.
* - MUST NOT revert.
*/
function maxMint(address receiver) external view returns (uint256 maxShares);
/**
* @dev Allows an on-chain or off-chain user to simulate the effects of their mint at the current block, given
* current on-chain conditions.
*
* - MUST return as close to and no fewer than the exact amount of assets that would be deposited in a mint call
* in the same transaction. I.e. mint should return the same or fewer assets as previewMint if called in the
* same transaction.
* - MUST NOT account for mint limits like those returned from maxMint and should always act as though the mint
* would be accepted, regardless if the user has enough tokens approved, etc.
* - MUST be inclusive of deposit fees. Integrators should be aware of the existence of deposit fees.
* - MUST NOT revert.
*
* NOTE: any unfavorable discrepancy between convertToAssets and previewMint SHOULD be considered slippage in
* share price or some other type of condition, meaning the depositor will lose assets by minting.
*/
function previewMint(uint256 shares) external view returns (uint256 assets);
/**
* @dev Mints exactly shares Vault shares to receiver by depositing amount of underlying tokens.
*
* - MUST emit the Deposit event.
* - MAY support an additional flow in which the underlying tokens are owned by the Vault contract before the mint
* execution, and are accounted for during mint.
* - MUST revert if all of shares cannot be minted (due to deposit limit being reached, slippage, the user not
* approving enough underlying tokens to the Vault contract, etc).
*
* NOTE: most implementations will require pre-approval of the Vault with the Vault’s underlying asset token.
*/
function mint(uint256 shares, address receiver) external returns (uint256 assets);
/**
* @dev Returns the maximum amount of the underlying asset that can be withdrawn from the owner balance in the
* Vault, through a withdraw call.
*
* - MUST return a limited value if owner is subject to some withdrawal limit or timelock.
* - MUST NOT revert.
*/
function maxWithdraw(address owner) external view returns (uint256 maxAssets);
/**
* @dev Allows an on-chain or off-chain user to simulate the effects of their withdrawal at the current block,
* given current on-chain conditions.
*
* - MUST return as close to and no fewer than the exact amount of Vault shares that would be burned in a withdraw
* call in the same transaction. I.e. withdraw should return the same or fewer shares as previewWithdraw if
* called
* in the same transaction.
* - MUST NOT account for withdrawal limits like those returned from maxWithdraw and should always act as though
* the withdrawal would be accepted, regardless if the user has enough shares, etc.
* - MUST be inclusive of withdrawal fees. Integrators should be aware of the existence of withdrawal fees.
* - MUST NOT revert.
*
* NOTE: any unfavorable discrepancy between convertToShares and previewWithdraw SHOULD be considered slippage in
* share price or some other type of condition, meaning the depositor will lose assets by depositing.
*/
function previewWithdraw(uint256 assets) external view returns (uint256 shares);
/**
* @dev Burns shares from owner and sends exactly assets of underlying tokens to receiver.
*
* - MUST emit the Withdraw event.
* - MAY support an additional flow in which the underlying tokens are owned by the Vault contract before the
* withdraw execution, and are accounted for during withdraw.
* - MUST revert if all of assets cannot be withdrawn (due to withdrawal limit being reached, slippage, the owner
* not having enough shares, etc).
*
* Note that some implementations will require pre-requesting to the Vault before a withdrawal may be performed.
* Those methods should be performed separately.
*/
function withdraw(uint256 assets, address receiver, address owner) external returns (uint256 shares);
/**
* @dev Returns the maximum amount of Vault shares that can be redeemed from the owner balance in the Vault,
* through a redeem call.
*
* - MUST return a limited value if owner is subject to some withdrawal limit or timelock.
* - MUST return balanceOf(owner) if owner is not subject to any withdrawal limit or timelock.
* - MUST NOT revert.
*/
function maxRedeem(address owner) external view returns (uint256 maxShares);
/**
* @dev Allows an on-chain or off-chain user to simulate the effects of their redemption at the current block,
* given current on-chain conditions.
*
* - MUST return as close to and no more than the exact amount of assets that would be withdrawn in a redeem call
* in the same transaction. I.e. redeem should return the same or more assets as previewRedeem if called in the
* same transaction.
* - MUST NOT account for redemption limits like those returned from maxRedeem and should always act as though the
* redemption would be accepted, regardless if the user has enough shares, etc.
* - MUST be inclusive of withdrawal fees. Integrators should be aware of the existence of withdrawal fees.
* - MUST NOT revert.
*
* NOTE: any unfavorable discrepancy between convertToAssets and previewRedeem SHOULD be considered slippage in
* share price or some other type of condition, meaning the depositor will lose assets by redeeming.
*/
function previewRedeem(uint256 shares) external view returns (uint256 assets);
/**
* @dev Burns exactly shares from owner and sends assets of underlying tokens to receiver.
*
* - MUST emit the Withdraw event.
* - MAY support an additional flow in which the underlying tokens are owned by the Vault contract before the
* redeem execution, and are accounted for during redeem.
* - MUST revert if all of shares cannot be redeemed (due to withdrawal limit being reached, slippage, the owner
* not having enough shares, etc).
*
* NOTE: some implementations will require pre-requesting to the Vault before a withdrawal may be performed.
* Those methods should be performed separately.
*/
function redeem(uint256 shares, address receiver, address owner) external returns (uint256 assets);
} <i class='far fa-question-circle text-muted ms-2' data-bs-trigger='hover' data-bs-toggle='tooltip' data-bs-html='true' data-bs-title='Click on the check box to select individual contract to compare. Only 1 contract can be selected from each side.'></i>
// SPDX-License-Identifier: MIT
// OpenZeppelin Contracts (last updated v5.1.0) (utils/Comparators.sol)
pragma solidity ^0.8.20;
/**
* @dev Provides a set of functions to compare values.
*
* _Available since v5.1._
*/
library Comparators {
function lt(uint256 a, uint256 b) internal pure returns (bool) {
return a < b;
}
function gt(uint256 a, uint256 b) internal pure returns (bool) {
return a > b;
}
} <i class='far fa-question-circle text-muted ms-2' data-bs-trigger='hover' data-bs-toggle='tooltip' data-bs-html='true' data-bs-title='Click on the check box to select individual contract to compare. Only 1 contract can be selected from each side.'></i>
// SPDX-License-Identifier: MIT
// OpenZeppelin Contracts (last updated v5.3.0) (utils/SlotDerivation.sol)
// This file was procedurally generated from scripts/generate/templates/SlotDerivation.js.
pragma solidity ^0.8.20;
/**
* @dev Library for computing storage (and transient storage) locations from namespaces and deriving slots
* corresponding to standard patterns. The derivation method for array and mapping matches the storage layout used by
* the solidity language / compiler.
*
* See https://docs.soliditylang.org/en/v0.8.20/internals/layout_in_storage.html#mappings-and-dynamic-arrays[Solidity docs for mappings and dynamic arrays.].
*
* Example usage:
* ```solidity
* contract Example {
* // Add the library methods
* using StorageSlot for bytes32;
* using SlotDerivation for bytes32;
*
* // Declare a namespace
* string private constant _NAMESPACE = "<namespace>"; // eg. OpenZeppelin.Slot
*
* function setValueInNamespace(uint256 key, address newValue) internal {
* _NAMESPACE.erc7201Slot().deriveMapping(key).getAddressSlot().value = newValue;
* }
*
* function getValueInNamespace(uint256 key) internal view returns (address) {
* return _NAMESPACE.erc7201Slot().deriveMapping(key).getAddressSlot().value;
* }
* }
* ```
*
* TIP: Consider using this library along with {StorageSlot}.
*
* NOTE: This library provides a way to manipulate storage locations in a non-standard way. Tooling for checking
* upgrade safety will ignore the slots accessed through this library.
*
* _Available since v5.1._
*/
library SlotDerivation {
/**
* @dev Derive an ERC-7201 slot from a string (namespace).
*/
function erc7201Slot(string memory namespace) internal pure returns (bytes32 slot) {
assembly ("memory-safe") {
mstore(0x00, sub(keccak256(add(namespace, 0x20), mload(namespace)), 1))
slot := and(keccak256(0x00, 0x20), not(0xff))
}
}
/**
* @dev Add an offset to a slot to get the n-th element of a structure or an array.
*/
function offset(bytes32 slot, uint256 pos) internal pure returns (bytes32 result) {
unchecked {
return bytes32(uint256(slot) + pos);
}
}
/**
* @dev Derive the location of the first element in an array from the slot where the length is stored.
*/
function deriveArray(bytes32 slot) internal pure returns (bytes32 result) {
assembly ("memory-safe") {
mstore(0x00, slot)
result := keccak256(0x00, 0x20)
}
}
/**
* @dev Derive the location of a mapping element from the key.
*/
function deriveMapping(bytes32 slot, address key) internal pure returns (bytes32 result) {
assembly ("memory-safe") {
mstore(0x00, and(key, shr(96, not(0))))
mstore(0x20, slot)
result := keccak256(0x00, 0x40)
}
}
/**
* @dev Derive the location of a mapping element from the key.
*/
function deriveMapping(bytes32 slot, bool key) internal pure returns (bytes32 result) {
assembly ("memory-safe") {
mstore(0x00, iszero(iszero(key)))
mstore(0x20, slot)
result := keccak256(0x00, 0x40)
}
}
/**
* @dev Derive the location of a mapping element from the key.
*/
function deriveMapping(bytes32 slot, bytes32 key) internal pure returns (bytes32 result) {
assembly ("memory-safe") {
mstore(0x00, key)
mstore(0x20, slot)
result := keccak256(0x00, 0x40)
}
}
/**
* @dev Derive the location of a mapping element from the key.
*/
function deriveMapping(bytes32 slot, uint256 key) internal pure returns (bytes32 result) {
assembly ("memory-safe") {
mstore(0x00, key)
mstore(0x20, slot)
result := keccak256(0x00, 0x40)
}
}
/**
* @dev Derive the location of a mapping element from the key.
*/
function deriveMapping(bytes32 slot, int256 key) internal pure returns (bytes32 result) {
assembly ("memory-safe") {
mstore(0x00, key)
mstore(0x20, slot)
result := keccak256(0x00, 0x40)
}
}
/**
* @dev Derive the location of a mapping element from the key.
*/
function deriveMapping(bytes32 slot, string memory key) internal pure returns (bytes32 result) {
assembly ("memory-safe") {
let length := mload(key)
let begin := add(key, 0x20)
let end := add(begin, length)
let cache := mload(end)
mstore(end, slot)
result := keccak256(begin, add(length, 0x20))
mstore(end, cache)
}
}
/**
* @dev Derive the location of a mapping element from the key.
*/
function deriveMapping(bytes32 slot, bytes memory key) internal pure returns (bytes32 result) {
assembly ("memory-safe") {
let length := mload(key)
let begin := add(key, 0x20)
let end := add(begin, length)
let cache := mload(end)
mstore(end, slot)
result := keccak256(begin, add(length, 0x20))
mstore(end, cache)
}
}
} <i class='far fa-question-circle text-muted ms-2' data-bs-trigger='hover' data-bs-toggle='tooltip' data-bs-html='true' data-bs-title='Click on the check box to select individual contract to compare. Only 1 contract can be selected from each side.'></i>
// SPDX-License-Identifier: MIT
// OpenZeppelin Contracts (last updated v5.1.0) (utils/StorageSlot.sol)
// This file was procedurally generated from scripts/generate/templates/StorageSlot.js.
pragma solidity ^0.8.20;
/**
* @dev Library for reading and writing primitive types to specific storage slots.
*
* Storage slots are often used to avoid storage conflict when dealing with upgradeable contracts.
* This library helps with reading and writing to such slots without the need for inline assembly.
*
* The functions in this library return Slot structs that contain a `value` member that can be used to read or write.
*
* Example usage to set ERC-1967 implementation slot:
* ```solidity
* contract ERC1967 {
* // Define the slot. Alternatively, use the SlotDerivation library to derive the slot.
* bytes32 internal constant _IMPLEMENTATION_SLOT = 0x360894a13ba1a3210667c828492db98dca3e2076cc3735a920a3ca505d382bbc;
*
* function _getImplementation() internal view returns (address) {
* return StorageSlot.getAddressSlot(_IMPLEMENTATION_SLOT).value;
* }
*
* function _setImplementation(address newImplementation) internal {
* require(newImplementation.code.length > 0);
* StorageSlot.getAddressSlot(_IMPLEMENTATION_SLOT).value = newImplementation;
* }
* }
* ```
*
* TIP: Consider using this library along with {SlotDerivation}.
*/
library StorageSlot {
struct AddressSlot {
address value;
}
struct BooleanSlot {
bool value;
}
struct Bytes32Slot {
bytes32 value;
}
struct Uint256Slot {
uint256 value;
}
struct Int256Slot {
int256 value;
}
struct StringSlot {
string value;
}
struct BytesSlot {
bytes value;
}
/**
* @dev Returns an `AddressSlot` with member `value` located at `slot`.
*/
function getAddressSlot(bytes32 slot) internal pure returns (AddressSlot storage r) {
assembly ("memory-safe") {
r.slot := slot
}
}
/**
* @dev Returns a `BooleanSlot` with member `value` located at `slot`.
*/
function getBooleanSlot(bytes32 slot) internal pure returns (BooleanSlot storage r) {
assembly ("memory-safe") {
r.slot := slot
}
}
/**
* @dev Returns a `Bytes32Slot` with member `value` located at `slot`.
*/
function getBytes32Slot(bytes32 slot) internal pure returns (Bytes32Slot storage r) {
assembly ("memory-safe") {
r.slot := slot
}
}
/**
* @dev Returns a `Uint256Slot` with member `value` located at `slot`.
*/
function getUint256Slot(bytes32 slot) internal pure returns (Uint256Slot storage r) {
assembly ("memory-safe") {
r.slot := slot
}
}
/**
* @dev Returns a `Int256Slot` with member `value` located at `slot`.
*/
function getInt256Slot(bytes32 slot) internal pure returns (Int256Slot storage r) {
assembly ("memory-safe") {
r.slot := slot
}
}
/**
* @dev Returns a `StringSlot` with member `value` located at `slot`.
*/
function getStringSlot(bytes32 slot) internal pure returns (StringSlot storage r) {
assembly ("memory-safe") {
r.slot := slot
}
}
/**
* @dev Returns an `StringSlot` representation of the string storage pointer `store`.
*/
function getStringSlot(string storage store) internal pure returns (StringSlot storage r) {
assembly ("memory-safe") {
r.slot := store.slot
}
}
/**
* @dev Returns a `BytesSlot` with member `value` located at `slot`.
*/
function getBytesSlot(bytes32 slot) internal pure returns (BytesSlot storage r) {
assembly ("memory-safe") {
r.slot := slot
}
}
/**
* @dev Returns an `BytesSlot` representation of the bytes storage pointer `store`.
*/
function getBytesSlot(bytes storage store) internal pure returns (BytesSlot storage r) {
assembly ("memory-safe") {
r.slot := store.slot
}
}
}