Transaction Hash:
Block:
23007845 at Jul-27-2025 03:38:35 AM +UTC
Transaction Fee:
0.000032881211372498 ETH
$0.13
Gas Used:
155,723 Gas / 0.211151926 Gwei
Emitted Events:
428 |
WETH9.Deposit( dst=[Receiver] AugustusV6, wad=132400000000000000 )
|
429 |
WETH9.Transfer( src=[Receiver] AugustusV6, dst=UniswapV2Pair, wad=132400000000000000 )
|
430 |
Catcoin.Transfer( from=UniswapV2Pair, to=[Receiver] AugustusV6, value=2819889022796358196988 )
|
431 |
UniswapV2Pair.Sync( reserve0=1974394718755851458201456, reserve1=92556473810725392472 )
|
432 |
UniswapV2Pair.Swap( sender=[Receiver] AugustusV6, amount0In=0, amount1In=132400000000000000, amount0Out=2819889022796358196988, amount1Out=0, to=[Receiver] AugustusV6 )
|
433 |
Catcoin.Transfer( from=[Receiver] AugustusV6, to=[Sender] 0x39a72fabd18a2c852a2d5178fe94956f9159b7b4, value=2819889022796358196988 )
|
Account State Difference:
Address | Before | After | State Difference | ||
---|---|---|---|---|---|
0x39a72faB...f9159b7B4 |
0.315380144040614108 Eth
Nonce: 9170
|
0.18294726282924161 Eth
Nonce: 9171
| 0.132432881211372498 | ||
0x59F4F336...aCE40539A | |||||
0x95222290...5CC4BAfe5
Miner
| (beaverbuild) | 11.096601585664184575 Eth | 11.096601863785462575 Eth | 0.000000278121278 | |
0xC02aaA39...83C756Cc2 | 2,292,768.118042956184629761 Eth | 2,292,768.250442956184629761 Eth | 0.1324 | ||
0xE87E0be7...D3626FC4f |
Execution Trace
ETH 0.1324
AugustusV6.swapExactAmountInOnUniswapV2( uniData=[{name:srcToken, type:address, order:1, indexed:false, value:0xEeeeeEeeeEeEeeEeEeEeeEEEeeeeEeeeeeeeEEeE, valueString:0xEeeeeEeeeEeEeeEeEeEeeEEEeeeeEeeeeeeeEEeE}, {name:destToken, type:address, order:2, indexed:false, value:0x59F4F336Bf3D0C49dBfbA4A74eBD2a6aCE40539A, valueString:0x59F4F336Bf3D0C49dBfbA4A74eBD2a6aCE40539A}, {name:fromAmount, type:uint256, order:3, indexed:false, value:132400000000000000, valueString:132400000000000000}, {name:toAmount, type:uint256, order:4, indexed:false, value:2805789577682376406003, valueString:2805789577682376406003}, {name:quotedAmount, type:uint256, order:5, indexed:false, value:2819889022796358196988, valueString:2819889022796358196988}, {name:metadata, type:bytes32, order:6, indexed:false, value:E2A5438288344B49A23D4BCAA73BEC93000000000000000000000000015F1261, valueString:E2A5438288344B49A23D4BCAA73BEC93000000000000000000000000015F1261}, {name:beneficiary, type:address, order:7, indexed:false, value:0x0000000000000000000000000000000000000000, valueString:0x0000000000000000000000000000000000000000}, {name:pools, type:bytes, order:8, indexed:false, value:0x59F4F336BF3D0C49DBFBA4A74EBD2A6ACE40539AC02AAA39B223FE8D0A0E5C4F27EAD9083C756CC2000000000000000000000000000000000000000000000000, valueString:0x59F4F336BF3D0C49DBFBA4A74EBD2A6ACE40539AC02AAA39B223FE8D0A0E5C4F27EAD9083C756CC2000000000000000000000000000000000000000000000000}], partnerAndFee=3907842331013872389743481879228541367476454115416563821959528835011651305472, permit=0x ) => ( receivedAmount=2819889022796358196988, paraswapShare=0, partnerShare=0 )
- ETH 0.1324
WETH9.CALL( )
-
WETH9.transfer( dst=0xE87E0be74368C8E153771Dd4B2dee3aD3626FC4f, wad=132400000000000000 ) => ( True )
-
UniswapV2Pair.STATICCALL( )
UniswapV2Pair.swap( amount0Out=2819889022796358196988, amount1Out=0, to=0x6A000F20005980200259B80c5102003040001068, data=0x )
-
Catcoin.transfer( recipient=0x6A000F20005980200259B80c5102003040001068, amount=2819889022796358196988 ) => ( True )
-
Catcoin.balanceOf( account=0xE87E0be74368C8E153771Dd4B2dee3aD3626FC4f ) => ( 1974394718755851458201456 )
-
WETH9.balanceOf( 0xE87E0be74368C8E153771Dd4B2dee3aD3626FC4f ) => ( 92556473810725392472 )
-
-
Catcoin.balanceOf( account=0x6A000F20005980200259B80c5102003040001068 ) => ( 2819889022796358196989 )
-
Catcoin.transfer( recipient=0x39a72faBD18a2c852a2D5178Fe94956f9159b7B4, amount=2819889022796358196988 ) => ( True )
File 1 of 4: AugustusV6
File 2 of 4: WETH9
File 3 of 4: UniswapV2Pair
File 4 of 4: Catcoin
// SPDX-License-Identifier: MIT pragma solidity 0.8.22; // Vendor import { Diamond } from "./vendor/Diamond.sol"; // Routers import { Routers } from "./routers/Routers.sol"; // ______ __ __ __ ____ // /\\ _ \\ /\\ \\__ /\\ \\/\\ \\ /'___\\ // \\ \\ \\L\\ \\ __ __ __ __ __ ____\\ \\ ,_\\ __ __ ____\\ \\ \\ \\ \\/\\ \\__/ // \\ \\ __ \\/\\ \\/\\ \\ /'_ `\\/\\ \\/\\ \\ /',__\\\\ \\ \\/ /\\ \\/\\ \\ /',__\\\\ \\ \\ \\ \\ \\ _``\\ // \\ \\ \\/\\ \\ \\ \\_\\ \\/\\ \\L\\ \\ \\ \\_\\ \\/\\__, `\\\\ \\ \\_\\ \\ \\_\\ \\/\\__, `\\\\ \\ \\_/ \\ \\ \\L\\ \\ // \\ \\_\\ \\_\\ \\____/\\ \\____ \\ \\____/\\/\\____/ \\ \\__\\\\ \\____/\\/\\____/ \\ `\\___/\\ \\____/ // \\/_/\\/_/\\/___/ \\/___L\\ \\/___/ \\/___/ \\/__/ \\/___/ \\/___/ `\\/__/ \\/___/ // /\\____/ // \\_/__/ /// @title AugustusV6 /// @notice The V6 implementation of the ParaSwap onchain aggregation protocol contract AugustusV6 is Diamond, Routers { /*////////////////////////////////////////////////////////////// CONSTRUCTOR //////////////////////////////////////////////////////////////*/ constructor( /// @dev Diamond address _owner, address _diamondCutFacet, /// @dev Direct Routers address _weth, address payable _balancerVault, uint256 _uniV3FactoryAndFF, uint256 _uniswapV3PoolInitCodeHash, uint256 _uniswapV2FactoryAndFF, uint256 _uniswapV2PoolInitCodeHash, address _rfq, /// @dev Fees address payable _feeVault, /// @dev Permit2 address _permit2 ) Diamond(_owner, _diamondCutFacet) Routers( _weth, _uniV3FactoryAndFF, _uniswapV3PoolInitCodeHash, _uniswapV2FactoryAndFF, _uniswapV2PoolInitCodeHash, _balancerVault, _permit2, _rfq, _feeVault ) { } /*////////////////////////////////////////////////////////////// EXTERNAL //////////////////////////////////////////////////////////////*/ /// @notice Reverts if the caller is one of the following: // - an externally-owned account // - a contract in construction // - an address where a contract will be created // - an address where a contract lived, but was destroyed receive() external payable override(Diamond) { address addr = msg.sender; // solhint-disable-next-line no-inline-assembly assembly ("memory-safe") { if iszero(extcodesize(addr)) { revert(0, 0) } } } } // SPDX-License-Identifier: MIT /** * Vendored on October 12, 2023 from: * https://github.com/mudgen/diamond-3-hardhat/blob/main/contracts/Diamond.sol */ pragma solidity ^0.8.0; /** * \\ * Author: Nick Mudge <[email protected]> (https://twitter.com/mudgen) * EIP-2535 Diamonds: https://eips.ethereum.org/EIPS/eip-2535 * * Implementation of a diamond. * /***************************************************************************** */ import { LibDiamond } from "./libraries/LibDiamond.sol"; import { IDiamondCut } from "./interfaces/IDiamondCut.sol"; contract Diamond { error DiamondFunctionDoesNotExist(); constructor(address _contractOwner, address _diamondCutFacet) payable { LibDiamond.setContractOwner(_contractOwner); // Add the diamondCut external function from the diamondCutFacet IDiamondCut.FacetCut[] memory cut = new IDiamondCut.FacetCut[](1); bytes4[] memory functionSelectors = new bytes4[](1); functionSelectors[0] = IDiamondCut.diamondCut.selector; cut[0] = IDiamondCut.FacetCut({ facetAddress: _diamondCutFacet, action: IDiamondCut.FacetCutAction.Add, functionSelectors: functionSelectors }); LibDiamond.diamondCut(cut, address(0), ""); } // Find facet for function that is called and execute the // function if a facet is found and return any value. fallback() external payable { LibDiamond.DiamondStorage storage ds; bytes32 position = LibDiamond.DIAMOND_STORAGE_POSITION; // get diamond storage assembly { ds.slot := position } // get facet from function selector address facet = ds.selectorToFacetAndPosition[msg.sig].facetAddress; // revert if function does not exist if (facet == address(0)) { revert DiamondFunctionDoesNotExist(); } // Execute external function from facet using delegatecall and return any value. assembly { // copy function selector and any arguments calldatacopy(0, 0, calldatasize()) // execute function call using the facet let result := delegatecall(gas(), facet, 0, calldatasize(), 0, 0) // get any return value returndatacopy(0, 0, returndatasize()) // return any return value or error back to the caller switch result case 0 { revert(0, returndatasize()) } default { return(0, returndatasize()) } } } receive() external payable virtual { } } // SPDX-License-Identifier: MIT pragma solidity 0.8.22; // DirectSwapExactAmountIn import { BalancerV2SwapExactAmountIn } from "./swapExactAmountIn/direct/BalancerV2SwapExactAmountIn.sol"; import { CurveV1SwapExactAmountIn } from "./swapExactAmountIn/direct/CurveV1SwapExactAmountIn.sol"; import { CurveV2SwapExactAmountIn } from "./swapExactAmountIn/direct/CurveV2SwapExactAmountIn.sol"; import { UniswapV2SwapExactAmountIn } from "./swapExactAmountIn/direct/UniswapV2SwapExactAmountIn.sol"; import { UniswapV3SwapExactAmountIn } from "./swapExactAmountIn/direct/UniswapV3SwapExactAmountIn.sol"; // DirectSwapExactAmountOut import { BalancerV2SwapExactAmountOut } from "./swapExactAmountOut/direct/BalancerV2SwapExactAmountOut.sol"; import { UniswapV2SwapExactAmountOut } from "./swapExactAmountOut/direct/UniswapV2SwapExactAmountOut.sol"; import { UniswapV3SwapExactAmountOut } from "./swapExactAmountOut/direct/UniswapV3SwapExactAmountOut.sol"; // Fees import { AugustusFees } from "../fees/AugustusFees.sol"; // GenericSwapExactAmountIn import { GenericSwapExactAmountIn } from "./swapExactAmountIn/GenericSwapExactAmountIn.sol"; // GenericSwapExactAmountOut import { GenericSwapExactAmountOut } from "./swapExactAmountOut/GenericSwapExactAmountOut.sol"; // General import { AugustusRFQRouter } from "./general/AugustusRFQRouter.sol"; // Utils import { AugustusRFQUtils } from "../util/AugustusRFQUtils.sol"; import { BalancerV2Utils } from "../util/BalancerV2Utils.sol"; import { UniswapV2Utils } from "../util/UniswapV2Utils.sol"; import { UniswapV3Utils } from "../util/UniswapV3Utils.sol"; import { WETHUtils } from "../util/WETHUtils.sol"; import { Permit2Utils } from "../util/Permit2Utils.sol"; /// @title Routers /// @notice A wrapper for all router contracts contract Routers is AugustusFees, AugustusRFQRouter, BalancerV2SwapExactAmountOut, BalancerV2SwapExactAmountIn, CurveV1SwapExactAmountIn, CurveV2SwapExactAmountIn, GenericSwapExactAmountOut, GenericSwapExactAmountIn, UniswapV2SwapExactAmountOut, UniswapV2SwapExactAmountIn, UniswapV3SwapExactAmountOut, UniswapV3SwapExactAmountIn { /*////////////////////////////////////////////////////////////// CONSTRUCTOR //////////////////////////////////////////////////////////////*/ constructor( address _weth, uint256 _uniswapV3FactoryAndFF, uint256 _uniswapV3PoolInitCodeHash, uint256 _uniswapV2FactoryAndFF, uint256 _uniswapV2PoolInitCodeHash, address payable _balancerVault, address _permit2, address _rfq, address payable _feeVault ) AugustusFees(_feeVault) AugustusRFQUtils(_rfq) BalancerV2Utils(_balancerVault) Permit2Utils(_permit2) UniswapV2Utils(_uniswapV2FactoryAndFF, _uniswapV2PoolInitCodeHash) UniswapV3Utils(_uniswapV3FactoryAndFF, _uniswapV3PoolInitCodeHash) WETHUtils(_weth) { } } // SPDX-License-Identifier: MIT /** * Vendored on October 12, 2023 from: * https://github.com/mudgen/diamond-3-hardhat/blob/main/contracts/libraries/LibDiamond.sol */ pragma solidity ^0.8.0; /** * \\ * Author: Nick Mudge <[email protected]> (https://twitter.com/mudgen) * EIP-2535 Diamonds: https://eips.ethereum.org/EIPS/eip-2535 * /***************************************************************************** */ import { IDiamondCut } from "../interfaces/IDiamondCut.sol"; // Remember to add the loupe functions from DiamondLoupeFacet to the diamond. // The loupe functions are required by the EIP2535 Diamonds standard error InitializationFunctionReverted(address _initializationContractAddress, bytes _calldata); library LibDiamond { bytes32 constant DIAMOND_STORAGE_POSITION = keccak256("diamond.standard.diamond.storage"); struct FacetAddressAndPosition { address facetAddress; uint96 functionSelectorPosition; // position in facetFunctionSelectors.functionSelectors array } struct FacetFunctionSelectors { bytes4[] functionSelectors; uint256 facetAddressPosition; // position of facetAddress in facetAddresses array } struct DiamondStorage { // 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; // Used to query if a contract implements an interface. // Used to implement ERC-165. mapping(bytes4 => bool) supportedInterfaces; // owner of the contract address contractOwner; } function diamondStorage() internal pure returns (DiamondStorage storage ds) { bytes32 position = DIAMOND_STORAGE_POSITION; assembly { ds.slot := position } } event OwnershipTransferred(address indexed previousOwner, address indexed newOwner); function setContractOwner(address _newOwner) internal { DiamondStorage storage ds = diamondStorage(); address previousOwner = ds.contractOwner; ds.contractOwner = _newOwner; emit OwnershipTransferred(previousOwner, _newOwner); } function contractOwner() internal view returns (address contractOwner_) { contractOwner_ = diamondStorage().contractOwner; } function enforceIsContractOwner() internal view { require(msg.sender == diamondStorage().contractOwner, "LibDiamond: Must be contract owner"); } event DiamondCut(IDiamondCut.FacetCut[] _diamondCut, address _init, bytes _calldata); // Internal function version of diamondCut function diamondCut(IDiamondCut.FacetCut[] memory _diamondCut, address _init, bytes memory _calldata) internal { for (uint256 facetIndex; facetIndex < _diamondCut.length; facetIndex++) { IDiamondCut.FacetCutAction action = _diamondCut[facetIndex].action; if (action == IDiamondCut.FacetCutAction.Add) { addFunctions(_diamondCut[facetIndex].facetAddress, _diamondCut[facetIndex].functionSelectors); } else if (action == IDiamondCut.FacetCutAction.Replace) { replaceFunctions(_diamondCut[facetIndex].facetAddress, _diamondCut[facetIndex].functionSelectors); } else if (action == IDiamondCut.FacetCutAction.Remove) { removeFunctions(_diamondCut[facetIndex].facetAddress, _diamondCut[facetIndex].functionSelectors); } else { revert("LibDiamondCut: Incorrect FacetCutAction"); } } emit DiamondCut(_diamondCut, _init, _calldata); initializeDiamondCut(_init, _calldata); } function addFunctions(address _facetAddress, bytes4[] memory _functionSelectors) internal { require(_functionSelectors.length > 0, "LibDiamondCut: No selectors in facet to cut"); DiamondStorage storage ds = diamondStorage(); require(_facetAddress != address(0), "LibDiamondCut: Add facet can't be address(0)"); 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; selectorIndex++) { bytes4 selector = _functionSelectors[selectorIndex]; address oldFacetAddress = ds.selectorToFacetAndPosition[selector].facetAddress; require(oldFacetAddress == address(0), "LibDiamondCut: Can't add function that already exists"); addFunction(ds, selector, selectorPosition, _facetAddress); selectorPosition++; } } function replaceFunctions(address _facetAddress, bytes4[] memory _functionSelectors) internal { require(_functionSelectors.length > 0, "LibDiamondCut: No selectors in facet to cut"); DiamondStorage storage ds = diamondStorage(); require(_facetAddress != address(0), "LibDiamondCut: Add facet can't be address(0)"); 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; selectorIndex++) { bytes4 selector = _functionSelectors[selectorIndex]; address oldFacetAddress = ds.selectorToFacetAndPosition[selector].facetAddress; require(oldFacetAddress != _facetAddress, "LibDiamondCut: Can't replace function with same function"); removeFunction(ds, oldFacetAddress, selector); addFunction(ds, selector, selectorPosition, _facetAddress); selectorPosition++; } } function removeFunctions(address _facetAddress, bytes4[] memory _functionSelectors) internal { require(_functionSelectors.length > 0, "LibDiamondCut: No selectors in facet to cut"); DiamondStorage storage ds = diamondStorage(); // if function does not exist then do nothing and return require(_facetAddress == address(0), "LibDiamondCut: Remove facet address must be address(0)"); for (uint256 selectorIndex; selectorIndex < _functionSelectors.length; selectorIndex++) { bytes4 selector = _functionSelectors[selectorIndex]; address oldFacetAddress = ds.selectorToFacetAndPosition[selector].facetAddress; removeFunction(ds, oldFacetAddress, selector); } } function addFacet(DiamondStorage storage ds, address _facetAddress) internal { enforceHasContractCode(_facetAddress, "LibDiamondCut: New facet has no code"); ds.facetFunctionSelectors[_facetAddress].facetAddressPosition = ds.facetAddresses.length; ds.facetAddresses.push(_facetAddress); } function addFunction( DiamondStorage 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(DiamondStorage storage ds, address _facetAddress, bytes4 _selector) internal { require(_facetAddress != address(0), "LibDiamondCut: Can't remove function that doesn't exist"); // an immutable function is a function defined directly in a diamond require(_facetAddress != address(this), "LibDiamondCut: Can't remove immutable function"); // 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); } // delete the last selector ds.facetFunctionSelectors[_facetAddress].functionSelectors.pop(); delete ds.selectorToFacetAndPosition[_selector]; // 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; } } function initializeDiamondCut(address _init, bytes memory _calldata) internal { if (_init == address(0)) { return; } enforceHasContractCode(_init, "LibDiamondCut: _init address has no code"); (bool success, bytes memory error) = _init.delegatecall(_calldata); 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(_init, _calldata); } } } function enforceHasContractCode(address _contract, string memory _errorMessage) internal view { uint256 contractSize; assembly { contractSize := extcodesize(_contract) } require(contractSize > 0, _errorMessage); } } // SPDX-License-Identifier: MIT /** * Vendored on October 12, 2023 from: * https://github.com/mudgen/diamond-3-hardhat/blob/main/contracts/interfaces/IDiamondCut.sol */ pragma solidity ^0.8.0; /** * \\ * Author: Nick Mudge (https://twitter.com/mudgen) * EIP-2535 Diamonds: https://eips.ethereum.org/EIPS/eip-2535 * /***************************************************************************** */ interface IDiamondCut { enum FacetCutAction { Add, Replace, Remove } // Add=0, Replace=1, Remove=2 struct FacetCut { address facetAddress; FacetCutAction action; bytes4[] functionSelectors; } /// @notice Add/replace/remove any number of functions and optionally execute /// a function with delegatecall /// @param _diamondCut Contains the facet addresses and function selectors /// @param _init The address of the contract or facet to execute _calldata /// @param _calldata A function call, including function selector and arguments /// _calldata is executed with delegatecall on _init function diamondCut(FacetCut[] calldata _diamondCut, address _init, bytes calldata _calldata) external; event DiamondCut(FacetCut[] _diamondCut, address _init, bytes _calldata); } // SPDX-License-Identifier: MIT pragma solidity 0.8.22; // Interfaces import { IERC20 } from "@openzeppelin/token/ERC20/IERC20.sol"; import { IBalancerV2SwapExactAmountIn } from "../../../interfaces/IBalancerV2SwapExactAmountIn.sol"; // Libraries import { ERC20Utils } from "../../../libraries/ERC20Utils.sol"; // Types import { BalancerV2Data } from "../../../AugustusV6Types.sol"; // Utils import { BalancerV2Utils } from "../../../util/BalancerV2Utils.sol"; /// @title BalancerV2SwapExactAmountIn /// @notice A contract for executing direct swapExactAmountIn on Balancer V2 abstract contract BalancerV2SwapExactAmountIn is IBalancerV2SwapExactAmountIn, BalancerV2Utils { /*////////////////////////////////////////////////////////////// LIBRARIES //////////////////////////////////////////////////////////////*/ using ERC20Utils for IERC20; /*////////////////////////////////////////////////////////////// SWAP EXACT AMOUNT IN //////////////////////////////////////////////////////////////*/ /// @inheritdoc IBalancerV2SwapExactAmountIn function swapExactAmountInOnBalancerV2( BalancerV2Data calldata balancerData, uint256 partnerAndFee, bytes calldata permit, bytes calldata data ) external payable whenNotPaused returns (uint256 receivedAmount, uint256 paraswapShare, uint256 partnerShare) { // Dereference balancerData uint256 quotedAmountOut = balancerData.quotedAmount; uint256 beneficiaryAndApproveFlag = balancerData.beneficiaryAndApproveFlag; uint256 amountIn = balancerData.fromAmount; uint256 minAmountOut = balancerData.toAmount; // Decode params (IERC20 srcToken, IERC20 destToken, address payable beneficiary, bool approve) = _decodeBalancerV2Params(beneficiaryAndApproveFlag, data); // Check if toAmount is valid if (minAmountOut == 0) { revert InvalidToAmount(); } // Check if beneficiary is valid if (beneficiary == address(0)) { beneficiary = payable(msg.sender); } // Check if srcToken is ETH if (srcToken.isETH(amountIn) == 0) { // Check the length of the permit field, // if < 257 and > 0 we should execute regular permit // and if it is >= 257 we execute permit2 if (permit.length < 257) { // Permit if needed if (permit.length > 0) { srcToken.permit(permit); } srcToken.safeTransferFrom(msg.sender, address(this), amountIn); } else { // Otherwise Permit2.permitTransferFrom permit2TransferFrom(permit, address(this), amountIn); } // Check if approve is needed if (approve) { // Approve BALANCER_VAULT to spend srcToken srcToken.approve(BALANCER_VAULT); } } // Execute swap _callBalancerV2(data); // Check balance after swap receivedAmount = destToken.getBalance(address(this)); // Check if swap succeeded if (receivedAmount < minAmountOut) { revert InsufficientReturnAmount(); } // Process fees and transfer destToken to beneficiary return processSwapExactAmountInFeesAndTransfer( beneficiary, destToken, partnerAndFee, receivedAmount, quotedAmountOut ); } } // SPDX-License-Identifier: MIT pragma solidity 0.8.22; // Interfaces import { IERC20 } from "@openzeppelin/token/ERC20/IERC20.sol"; import { ICurveV1SwapExactAmountIn } from "../../../interfaces/ICurveV1SwapExactAmountIn.sol"; // Libraries import { ERC20Utils } from "../../../libraries/ERC20Utils.sol"; // Types import { CurveV1Data } from "../../../AugustusV6Types.sol"; // Utils import { AugustusFees } from "../../../fees/AugustusFees.sol"; import { WETHUtils } from "../../../util/WETHUtils.sol"; import { Permit2Utils } from "../../../util/Permit2Utils.sol"; import { PauseUtils } from "../../../util/PauseUtils.sol"; /// @title CurveV1SwapExactAmountIn /// @notice A contract for executing direct CurveV1 swaps abstract contract CurveV1SwapExactAmountIn is ICurveV1SwapExactAmountIn, AugustusFees, WETHUtils, Permit2Utils, PauseUtils { /*////////////////////////////////////////////////////////////// LIBRARIES //////////////////////////////////////////////////////////////*/ using ERC20Utils for IERC20; /*////////////////////////////////////////////////////////////// SWAP EXACT AMOUNT IN //////////////////////////////////////////////////////////////*/ /// @inheritdoc ICurveV1SwapExactAmountIn function swapExactAmountInOnCurveV1( CurveV1Data calldata curveV1Data, uint256 partnerAndFee, bytes calldata permit ) external payable whenNotPaused returns (uint256 receivedAmount, uint256 paraswapShare, uint256 partnerShare) { // Dereference curveV1Data IERC20 srcToken = curveV1Data.srcToken; IERC20 destToken = curveV1Data.destToken; uint256 amountIn = curveV1Data.fromAmount; uint256 minAmountOut = curveV1Data.toAmount; uint256 quotedAmountOut = curveV1Data.quotedAmount; address payable beneficiary = curveV1Data.beneficiary; uint256 curveAssets = curveV1Data.curveAssets; uint256 curveData = curveV1Data.curveData; // Check if toAmount is valid if (minAmountOut == 0) { revert InvalidToAmount(); } // Check if beneficiary is valid if (beneficiary == address(0)) { beneficiary = payable(msg.sender); } // Decode curveData // 160 bits for curve exchange address // 1 bit for approve flag // 2 bits for wrap flag // 2 bits for swap type flag address exchange; bool approveFlag; uint256 wrapFlag; uint256 swapType; // solhint-disable-next-line no-inline-assembly assembly ("memory-safe") { exchange := and(curveData, 0xffffffffffffffffffffffffffffffffffffffff) approveFlag := and(shr(160, curveData), 1) wrapFlag := and(shr(161, curveData), 3) swapType := and(shr(163, curveData), 3) } // Check if srcToken is ETH // Transfer srcToken to augustus if not ETH if (srcToken.isETH(amountIn) == 0) { // Check the length of the permit field, // if < 257 and > 0 we should execute regular permit // and if it is >= 257 we execute permit2 if (permit.length < 257) { // Permit if needed if (permit.length > 0) { srcToken.permit(permit); } srcToken.safeTransferFrom(msg.sender, address(this), amountIn); } else { // Otherwise Permit2.permitTransferFrom permit2TransferFrom(permit, address(this), amountIn); } // Check if approve flag is set if (approveFlag) { // Approve exchange srcToken.approve(exchange); } } else { // Check if approve flag is set if (approveFlag) { // Approve exchange IERC20(WETH).approve(exchange); } } // Execute swap _executeSwapOnCurveV1(exchange, wrapFlag, swapType, curveAssets, amountIn); // Check balance after swap and unwrap if needed if (wrapFlag == 2) { // Received amount is WETH balance receivedAmount = IERC20(WETH).getBalance(address(this)); // Unwrap WETH WETH.withdraw(receivedAmount - 1); // Set receivedAmount to this contract's balance receivedAmount = address(this).balance; } else { // Received amount is destToken balance receivedAmount = destToken.getBalance(address(this)); } // Check if swap succeeded if (receivedAmount < minAmountOut) { revert InsufficientReturnAmount(); } // Process fees and transfer destToken to beneficiary return processSwapExactAmountInFeesAndTransfer( beneficiary, destToken, partnerAndFee, receivedAmount, quotedAmountOut ); } /*////////////////////////////////////////////////////////////// PRIVATE //////////////////////////////////////////////////////////////*/ function _executeSwapOnCurveV1( address exchange, uint256 wrapFlag, uint256 swapType, uint256 curveAssets, uint256 fromAmount ) private { // Load WETH address address weth = address(WETH); // solhint-disable-next-line no-inline-assembly assembly { // Load free memory pointer let ptr := mload(64) //----------------------------------------------------------------------------------- // Wrap ETH if needed //----------------------------------------------------------------------------------- // Check if wrap src flag is set if eq(wrapFlag, 1) { // Prepare call data for WETH.deposit() // Store function selector and mstore(ptr, 0xd0e30db000000000000000000000000000000000000000000000000000000000) // deposit() // Perform the external call with the prepared calldata // Check the outcome of the call and handle failure if iszero(call(gas(), weth, callvalue(), ptr, 4, 0, 0)) { // The call failed; we retrieve the exact error message and revert with it returndatacopy(0, 0, returndatasize()) // Copy the error message to the start of memory revert(0, returndatasize()) // Revert with the error message } } //----------------------------------------------------------------------------------- // Execute swap //----------------------------------------------------------------------------------- // Prepare call data for external call // Check swap type switch swapType // 0x01 for EXCHANGE_UNDERLYING case 0x01 { // Store function selector for function exchange_underlying(int128,int128,uint256,uint256) mstore(ptr, 0xa6417ed600000000000000000000000000000000000000000000000000000000) // store selector mstore(add(ptr, 4), shr(128, curveAssets)) // store index i mstore(add(ptr, 36), and(curveAssets, 0xffffffffffffffffffffffffffffffff)) // store index j mstore(add(ptr, 68), fromAmount) // store fromAmount mstore(add(ptr, 100), 1) // store 1 // Perform the external call with the prepared calldata // Check the outcome of the call and handle failure if iszero(call(gas(), exchange, 0, ptr, 132, 0, 0)) { // The call failed; we retrieve the exact error message and revert with it returndatacopy(0, 0, returndatasize()) // Copy the error message to the start of memory revert(0, returndatasize()) // Revert with the error message } } // 0x00(default) for EXCHANGE default { // check send eth wrap flag switch eq(wrapFlag, 0x03) // if it is not set, store selector for function exchange(int128,int128,uint256,uint256) case 1 { mstore(ptr, 0x3df0212400000000000000000000000000000000000000000000000000000000) // store selector mstore(add(ptr, 4), shr(128, curveAssets)) // store index i mstore(add(ptr, 36), and(curveAssets, 0xffffffffffffffffffffffffffffffff)) // store index j mstore(add(ptr, 68), fromAmount) // store fromAmount mstore(add(ptr, 100), 1) // store 1 // Perform the external call with the prepared calldata // Check the outcome of the call and handle failure if iszero(call(gas(), exchange, callvalue(), ptr, 132, 0, 0)) { // The call failed; we retrieve the exact error message and revert with it returndatacopy(0, 0, returndatasize()) // Copy the error message to the start of memory revert(0, returndatasize()) // Revert with the error message } } // if it is set, store selector for function exchange(int128,int128,uint256,uint256) default { mstore(ptr, 0x3df0212400000000000000000000000000000000000000000000000000000000) // store selector mstore(add(ptr, 4), shr(128, curveAssets)) // store index i mstore(add(ptr, 36), and(curveAssets, 0xffffffffffffffffffffffffffffffff)) // store index j mstore(add(ptr, 68), fromAmount) // store fromAmount mstore(add(ptr, 100), 1) // store 1 // Perform the external call with the prepared calldata // Check the outcome of the call and handle failure if iszero(call(gas(), exchange, 0, ptr, 132, 0, 0)) { // The call failed; we retrieve the exact error message and revert with it returndatacopy(0, 0, returndatasize()) // Copy the error message to the start of memory revert(0, returndatasize()) // Revert with the error message } } } } } } // SPDX-License-Identifier: MIT pragma solidity 0.8.22; // Interfaces import { IERC20 } from "@openzeppelin/token/ERC20/IERC20.sol"; import { ICurveV2SwapExactAmountIn } from "../../../interfaces/ICurveV2SwapExactAmountIn.sol"; // Libraries import { ERC20Utils } from "../../../libraries/ERC20Utils.sol"; // Types import { CurveV2Data } from "../../../AugustusV6Types.sol"; // Utils import { AugustusFees } from "../../../fees/AugustusFees.sol"; import { WETHUtils } from "../../../util/WETHUtils.sol"; import { Permit2Utils } from "../../../util/Permit2Utils.sol"; import { PauseUtils } from "../../../util/PauseUtils.sol"; /// @title CurveV2SwapExactAmountIn /// @notice A contract for executing direct CurveV2 swaps abstract contract CurveV2SwapExactAmountIn is ICurveV2SwapExactAmountIn, AugustusFees, WETHUtils, Permit2Utils, PauseUtils { /*////////////////////////////////////////////////////////////// LIBRARIES //////////////////////////////////////////////////////////////*/ using ERC20Utils for IERC20; /*////////////////////////////////////////////////////////////// SWAP EXACT AMOUNT IN //////////////////////////////////////////////////////////////*/ /// @inheritdoc ICurveV2SwapExactAmountIn function swapExactAmountInOnCurveV2( CurveV2Data calldata curveV2Data, uint256 partnerAndFee, bytes calldata permit ) external payable whenNotPaused returns (uint256 receivedAmount, uint256 paraswapShare, uint256 partnerShare) { // Dereference curveData IERC20 srcToken = curveV2Data.srcToken; IERC20 destToken = curveV2Data.destToken; uint256 amountIn = curveV2Data.fromAmount; uint256 minAmountOut = curveV2Data.toAmount; uint256 quotedAmountOut = curveV2Data.quotedAmount; address payable beneficiary = curveV2Data.beneficiary; uint256 i = curveV2Data.i; uint256 j = curveV2Data.j; address poolAddress = curveV2Data.poolAddress; uint256 curveData = curveV2Data.curveData; // Check if toAmount is valid if (minAmountOut == 0) { revert InvalidToAmount(); } // Check if beneficiary is valid if (beneficiary == address(0)) { beneficiary = payable(msg.sender); } // Decode curveData // 160 bits for curve exchange address // 1 bit for approve flag // 2 bits for wrap flag // 2 bits for swap type flag address exchange; bool approveFlag; uint256 wrapFlag; uint256 swapType; // solhint-disable-next-line no-inline-assembly assembly { exchange := and(curveData, 0xffffffffffffffffffffffffffffffffffffffff) approveFlag := and(shr(160, curveData), 1) wrapFlag := and(shr(161, curveData), 3) swapType := and(shr(163, curveData), 3) } // Check if srcToken is ETH // Transfer srcToken to augustus if not ETH if (srcToken.isETH(amountIn) == 0) { // Check the length of the permit field, // if < 257 and > 0 we should execute regular permit // and if it is >= 257 we execute permit2 if (permit.length < 257) { // Permit if needed if (permit.length > 0) { srcToken.permit(permit); } srcToken.safeTransferFrom(msg.sender, address(this), amountIn); } else { // Otherwise Permit2.permitTransferFrom permit2TransferFrom(permit, address(this), amountIn); } // Check if approve flag is set if (approveFlag) { // Approve exchange srcToken.approve(exchange); } } else { // Check if approve flag is set if (approveFlag) { // Approve exchange IERC20(WETH).approve(exchange); } } // Execute swap _executeSwapOnCurveV2(exchange, wrapFlag, swapType, i, j, amountIn, poolAddress); // Check balance after swap and unwrap if needed if (wrapFlag == 2) { // Received amount is WETH balance receivedAmount = IERC20(WETH).getBalance(address(this)); // Unwrap WETH WETH.withdraw(receivedAmount - 1); // Set receivedAmount to this contract's balance receivedAmount = address(this).balance; } else { // Received amount is destToken balance receivedAmount = destToken.getBalance(address(this)); } // Check if swap succeeded if (receivedAmount < minAmountOut) { revert InsufficientReturnAmount(); } // Process fees and transfer destToken to beneficiary return processSwapExactAmountInFeesAndTransfer( beneficiary, destToken, partnerAndFee, receivedAmount, quotedAmountOut ); } /*////////////////////////////////////////////////////////////// PRIVATE //////////////////////////////////////////////////////////////*/ function _executeSwapOnCurveV2( address exchange, uint256 wrapFlag, uint256 swapType, uint256 i, uint256 j, uint256 fromAmount, address poolAddress ) private { // Load WETH address address weth = address(WETH); // solhint-disable-next-line no-inline-assembly assembly { // Load free memory pointer let ptr := mload(64) //----------------------------------------------------------------------------------- // Wrap ETH if needed //----------------------------------------------------------------------------------- // Check if wrap src flag is set if eq(wrapFlag, 1) { // Prepare call data for WETH.deposit() // Store function selector and mstore(ptr, 0xd0e30db000000000000000000000000000000000000000000000000000000000) // deposit() // Perform the external call with the prepared calldata // Check the outcome of the call and handle failure if iszero(call(gas(), weth, callvalue(), ptr, 4, 0, 0)) { // The call failed; we retrieve the exact error message and revert with it returndatacopy(0, 0, returndatasize()) // Copy the error message to the start of memory revert(0, returndatasize()) // Revert with the error message } } //----------------------------------------------------------------------------------- // Execute swap //----------------------------------------------------------------------------------- // Prepare call data for external call // Check swap type switch swapType // 0x01 for EXCHANGE_UNDERLYING case 0x01 { // Store function selector for function exchange_underlying(uint256,uint256,uint256,uint256) mstore(ptr, 0x65b2489b00000000000000000000000000000000000000000000000000000000) // store selector mstore(add(ptr, 4), i) // store index i mstore(add(ptr, 36), j) // store index j mstore(add(ptr, 68), fromAmount) // store fromAmount mstore(add(ptr, 100), 1) // store 1 // Perform the external call with the prepared calldata // Check the outcome of the call and handle failure if iszero(call(gas(), exchange, 0, ptr, 132, 0, 0)) { // The call failed; we retrieve the exact error message and revert with it returndatacopy(0, 0, returndatasize()) // Copy the error message to the start of memory revert(0, returndatasize()) // Revert with the error message } } // 0x02 for EXCHANGE_GENERIC_FACTORY_ZAP case 0x02 { // Store function selector for function exchange(address,uint256,uint256,uint256,uint256) mstore(ptr, 0x64a1455800000000000000000000000000000000000000000000000000000000) mstore(add(ptr, 4), poolAddress) // store poolAddress mstore(add(ptr, 36), i) // store index i mstore(add(ptr, 68), j) // store index j mstore(add(ptr, 100), fromAmount) // store fromAmount mstore(add(ptr, 132), 1) // store 1 // Perform the external call with the prepared calldata // Check the outcome of the call and handle failure if iszero(call(gas(), exchange, 0, ptr, 164, 0, 0)) { // The call failed; we retrieve the exact error message and revert with it returndatacopy(0, 0, returndatasize()) // Copy the error message to the start of memory revert(0, returndatasize()) // Revert with the error message } } // 0x00(default) for EXCHANGE default { // check send eth wrap flag switch eq(wrapFlag, 0x03) // if it is not set, store selector for function exchange(uint256,uint256,uint256,uint256,bool) case 1 { mstore(ptr, 0x394747c500000000000000000000000000000000000000000000000000000000) // store selector mstore(add(ptr, 4), i) // store index i mstore(add(ptr, 36), j) // store index j mstore(add(ptr, 68), fromAmount) // store fromAmount mstore(add(ptr, 100), 1) // store 1 mstore(add(ptr, 132), 1) // store true // Perform the external call with the prepared calldata // Check the outcome of the call and handle failure if iszero(call(gas(), exchange, callvalue(), ptr, 164, 0, 0)) { // The call failed; we retrieve the exact error message and revert with it returndatacopy(0, 0, returndatasize()) // Copy the error message to the start of memory revert(0, returndatasize()) // Revert with the error message } } // if it is set, store selector for function exchange(uint256,uint256,uint256,uint256) default { mstore(ptr, 0x5b41b90800000000000000000000000000000000000000000000000000000000) // store selector mstore(add(ptr, 4), i) // store index i mstore(add(ptr, 36), j) // store index j mstore(add(ptr, 68), fromAmount) // store fromAmount mstore(add(ptr, 100), 1) // store 1 // Perform the external call with the prepared calldata // Check the outcome of the call and handle failure if iszero(call(gas(), exchange, 0, ptr, 132, 0, 0)) { // The call failed; we retrieve the exact error message and revert with it returndatacopy(0, 0, returndatasize()) // Copy the error message to the start of memory revert(0, returndatasize()) // Revert with the error message } } } } } } // SPDX-License-Identifier: MIT pragma solidity 0.8.22; // Interfaces import { IERC20 } from "@openzeppelin/token/ERC20/IERC20.sol"; import { IUniswapV2SwapExactAmountIn } from "../../../interfaces/IUniswapV2SwapExactAmountIn.sol"; // Libraries import { ERC20Utils } from "../../../libraries/ERC20Utils.sol"; // Types import { UniswapV2Data } from "../../../AugustusV6Types.sol"; // Utils import { UniswapV2Utils } from "../../../util/UniswapV2Utils.sol"; /// @title UniswapV2SwapExactAmountIn /// @notice A contract for executing direct swapExactAmountIn on UniswapV2 pools abstract contract UniswapV2SwapExactAmountIn is IUniswapV2SwapExactAmountIn, UniswapV2Utils { /*////////////////////////////////////////////////////////////// LIBRARIES //////////////////////////////////////////////////////////////*/ using ERC20Utils for IERC20; /*////////////////////////////////////////////////////////////// SWAP //////////////////////////////////////////////////////////////*/ /// @inheritdoc IUniswapV2SwapExactAmountIn function swapExactAmountInOnUniswapV2( UniswapV2Data calldata uniData, uint256 partnerAndFee, bytes calldata permit ) external payable whenNotPaused returns (uint256 receivedAmount, uint256 paraswapShare, uint256 partnerShare) { // Dereference uniData IERC20 srcToken = uniData.srcToken; IERC20 destToken = uniData.destToken; uint256 amountIn = uniData.fromAmount; uint256 minAmountOut = uniData.toAmount; uint256 quotedAmountOut = uniData.quotedAmount; address payable beneficiary = uniData.beneficiary; bytes calldata pools = uniData.pools; // Initialize payer address payer = msg.sender; // Check if toAmount is valid if (minAmountOut == 0) { revert InvalidToAmount(); } // Check if beneficiary is valid if (beneficiary == address(0)) { beneficiary = payable(msg.sender); } // Check if we need to wrap or permit if (srcToken.isETH(amountIn) == 0) { // Check the length of the permit field, // if < 257 and > 0 we should execute regular permit if (permit.length < 257) { // Permit if needed if (permit.length > 0) { srcToken.permit(permit); } } } else { // If it is ETH. wrap it to WETH WETH.deposit{ value: amountIn }(); // Set srcToken to WETH srcToken = WETH; // Set payer to this contract payer = address(this); } // Execute swap _callUniswapV2PoolsSwapExactIn(amountIn, srcToken, pools, payer, permit); // Check if destToken is ETH and unwrap if (address(destToken) == address(ERC20Utils.ETH)) { // Check balance of WETH receivedAmount = IERC20(WETH).getBalance(address(this)); // Unwrap WETH WETH.withdraw(receivedAmount - 1); // Set receivedAmount to this contract's balance receivedAmount = address(this).balance; } else { // Othwerwise check balance of destToken receivedAmount = destToken.getBalance(address(this)); } // Check if swap succeeded if (receivedAmount < minAmountOut) { revert InsufficientReturnAmount(); } // Process fees and transfer destToken to beneficiary return processSwapExactAmountInFeesAndTransfer( beneficiary, destToken, partnerAndFee, receivedAmount, quotedAmountOut ); } } // SPDX-License-Identifier: MIT pragma solidity 0.8.22; // Interfaces import { IERC20 } from "@openzeppelin/token/ERC20/IERC20.sol"; import { IUniswapV3SwapExactAmountIn } from "../../../interfaces/IUniswapV3SwapExactAmountIn.sol"; // Libraries import { ERC20Utils } from "../../../libraries/ERC20Utils.sol"; import { SafeCastLib } from "@solady/utils/SafeCastLib.sol"; // Types import { UniswapV3Data } from "../../../AugustusV6Types.sol"; // Utils import { UniswapV3Utils } from "../../../util/UniswapV3Utils.sol"; /// @title UniswapV3SwapExactAmountIn /// @notice A contract for executing direct swapExactAmountIn on Uniswap V3 abstract contract UniswapV3SwapExactAmountIn is IUniswapV3SwapExactAmountIn, UniswapV3Utils { /*////////////////////////////////////////////////////////////// LIBRARIES //////////////////////////////////////////////////////////////*/ using ERC20Utils for IERC20; using SafeCastLib for uint256; /*////////////////////////////////////////////////////////////// SWAP //////////////////////////////////////////////////////////////*/ /// @inheritdoc IUniswapV3SwapExactAmountIn function swapExactAmountInOnUniswapV3( UniswapV3Data calldata uniData, uint256 partnerAndFee, bytes calldata permit ) external payable whenNotPaused returns (uint256 receivedAmount, uint256 paraswapShare, uint256 partnerShare) { // Dereference uniData IERC20 srcToken = uniData.srcToken; IERC20 destToken = uniData.destToken; uint256 amountIn = uniData.fromAmount; uint256 minAmountOut = uniData.toAmount; uint256 quotedAmountOut = uniData.quotedAmount; address payable beneficiary = uniData.beneficiary; bytes calldata pools = uniData.pools; // Check if toAmount is valid if (minAmountOut == 0) { revert InvalidToAmount(); } // Check if beneficiary is valid if (beneficiary == address(0)) { beneficiary = payable(msg.sender); } // Address that will pay for the swap address fromAddress = msg.sender; // Check if we need to wrap or permit if (srcToken.isETH(amountIn) == 0) { // Check the length of the permit field, // if < 257 and > 0 we should execute regular permit if (permit.length < 257) { // Permit if needed if (permit.length > 0) { srcToken.permit(permit); } } } else { // If it is ETH. wrap it to WETH WETH.deposit{ value: amountIn }(); // Swap will be paid from this contract fromAddress = address(this); } // Execute swap receivedAmount = _callUniswapV3PoolsSwapExactAmountIn(amountIn.toInt256(), pools, fromAddress, permit); // Check if swap succeeded if (receivedAmount < minAmountOut) { revert InsufficientReturnAmount(); } // Check if destToken is ETH and unwrap if (address(destToken) == address(ERC20Utils.ETH)) { // Unwrap WETH WETH.withdraw(receivedAmount); } // Process fees and transfer destToken to beneficiary return processSwapExactAmountInFeesAndTransferUniV3( beneficiary, destToken, partnerAndFee, receivedAmount, quotedAmountOut ); } } // SPDX-License-Identifier: MIT pragma solidity 0.8.22; // Interfaces import { IERC20 } from "@openzeppelin/token/ERC20/IERC20.sol"; import { IBalancerV2SwapExactAmountOut } from "../../../interfaces/IBalancerV2SwapExactAmountOut.sol"; // Libraries import { ERC20Utils } from "../../../libraries/ERC20Utils.sol"; // Types import { BalancerV2Data } from "../../../AugustusV6Types.sol"; // Utils import { BalancerV2Utils } from "../../../util/BalancerV2Utils.sol"; /// @title BalancerV2SwapExactAmountOut /// @notice A contract for executing direct swapExactAmountOut on BalancerV2 pools abstract contract BalancerV2SwapExactAmountOut is IBalancerV2SwapExactAmountOut, BalancerV2Utils { /*////////////////////////////////////////////////////////////// LIBRARIES //////////////////////////////////////////////////////////////*/ using ERC20Utils for IERC20; /*////////////////////////////////////////////////////////////// SWAP EXACT AMOUNT OUT //////////////////////////////////////////////////////////////*/ /// @inheritdoc IBalancerV2SwapExactAmountOut function swapExactAmountOutOnBalancerV2( BalancerV2Data calldata balancerData, uint256 partnerAndFee, bytes calldata permit, bytes calldata data ) external payable whenNotPaused returns (uint256 spentAmount, uint256 receivedAmount, uint256 paraswapShare, uint256 partnerShare) { // Dereference balancerData uint256 quotedAmountIn = balancerData.quotedAmount; uint256 beneficiaryAndApproveFlag = balancerData.beneficiaryAndApproveFlag; uint256 maxAmountIn = balancerData.fromAmount; uint256 amountOut = balancerData.toAmount; // Decode params (IERC20 srcToken, IERC20 destToken, address payable beneficiary, bool approve) = _decodeBalancerV2Params(beneficiaryAndApproveFlag, data); // Make sure srcToken and destToken are different if (srcToken == destToken) { revert ArbitrageNotSupported(); } // Check if toAmount is valid if (amountOut == 0) { revert InvalidToAmount(); } // Check if beneficiary is valid if (beneficiary == address(0)) { beneficiary = payable(msg.sender); } // Check contract balance uint256 balanceBefore = srcToken.getBalance(address(this)); // Check if srcToken is ETH if (srcToken.isETH(maxAmountIn) == 0) { // Check the length of the permit field, // if < 257 and > 0 we should execute regular permit // and if it is >= 257 we execute permit2 if (permit.length < 257) { // Permit if needed if (permit.length > 0) { srcToken.permit(permit); } srcToken.safeTransferFrom(msg.sender, address(this), maxAmountIn); } else { // Otherwise Permit2.permitTransferFrom permit2TransferFrom(permit, address(this), maxAmountIn); } // Check if approve is needed if (approve) { // Approve BALANCER_VAULT to spend srcToken srcToken.approve(BALANCER_VAULT); } } else { // If srcToken is ETH, we have to deduct msg.value from balanceBefore balanceBefore = balanceBefore - msg.value; } // Execute swap _callBalancerV2(data); // Check balance of destToken receivedAmount = destToken.getBalance(address(this)); // Check balance of srcToken, deducting the balance before the swap if it is greater than 1 uint256 remainingAmount = srcToken.getBalance(address(this)) - (balanceBefore > 1 ? balanceBefore : 0); // Check if swap succeeded if (receivedAmount < amountOut) { revert InsufficientReturnAmount(); } // Process fees and transfer destToken and srcToken to beneficiary return processSwapExactAmountOutFeesAndTransfer( beneficiary, srcToken, destToken, partnerAndFee, maxAmountIn, remainingAmount, receivedAmount, quotedAmountIn ); } } // SPDX-License-Identifier: MIT pragma solidity 0.8.22; // Interfaces import { IERC20 } from "@openzeppelin/token/ERC20/IERC20.sol"; import { IUniswapV2SwapExactAmountOut } from "../../../interfaces/IUniswapV2SwapExactAmountOut.sol"; // Libraries import { ERC20Utils } from "../../../libraries/ERC20Utils.sol"; // Types import { UniswapV2Data } from "../../../AugustusV6Types.sol"; // Utils import { UniswapV2Utils } from "../../../util/UniswapV2Utils.sol"; /// @title UniswapV2SwapExactAmountOut /// @notice A contract for executing direct swapExactAmountOut on UniswapV2 pools abstract contract UniswapV2SwapExactAmountOut is IUniswapV2SwapExactAmountOut, UniswapV2Utils { /*////////////////////////////////////////////////////////////// LIBRARIES //////////////////////////////////////////////////////////////*/ using ERC20Utils for IERC20; /*////////////////////////////////////////////////////////////// SWAP EXACT AMOUNT OUT //////////////////////////////////////////////////////////////*/ /// @inheritdoc IUniswapV2SwapExactAmountOut function swapExactAmountOutOnUniswapV2( UniswapV2Data calldata uniData, uint256 partnerAndFee, bytes calldata permit ) external payable whenNotPaused returns (uint256 spentAmount, uint256 receivedAmount, uint256 paraswapShare, uint256 partnerShare) { // Dereference uniData IERC20 srcToken = uniData.srcToken; IERC20 destToken = uniData.destToken; uint256 maxAmountIn = uniData.fromAmount; uint256 amountOut = uniData.toAmount; uint256 quotedAmountIn = uniData.quotedAmount; address payable beneficiary = uniData.beneficiary; bytes calldata pools = uniData.pools; // Check if toAmount is valid if (amountOut == 0) { revert InvalidToAmount(); } // Check if beneficiary is valid if (beneficiary == address(0)) { beneficiary = payable(msg.sender); } // Init balanceBefore uint256 balanceBefore; // Check if srcToken is ETH bool isFromETH = srcToken.isETH(maxAmountIn) != 0; // Check if we need to wrap or permit if (isFromETH) { // Check WETH balance before balanceBefore = IERC20(WETH).getBalance(address(this)); // If it is ETH. wrap it to WETH WETH.deposit{ value: maxAmountIn }(); // Set srcToken to WETH srcToken = WETH; } else { // Check srcToken balance before balanceBefore = srcToken.getBalance(address(this)); // Check the length of the permit field, // if < 257 and > 0 we should execute regular permit // and if it is >= 257 we execute permit2 if (permit.length < 257) { // Permit if needed if (permit.length > 0) { srcToken.permit(permit); } srcToken.safeTransferFrom(msg.sender, address(this), maxAmountIn); } else { // Otherwise Permit2.permitTransferFrom permit2TransferFrom(permit, address(this), maxAmountIn); } } // Make sure srcToken and destToken are different if (srcToken == destToken) { revert ArbitrageNotSupported(); } // Execute swap _callUniswapV2PoolsSwapExactOut(amountOut, srcToken, pools); // Check if destToken is ETH and unwrap if (address(destToken) == address(ERC20Utils.ETH)) { // Make sure srcToken was not WETH if (srcToken == WETH) { revert ArbitrageNotSupported(); } // Check balance of WETH receivedAmount = IERC20(WETH).getBalance(address(this)); // Leave dust if receivedAmount > amountOut if (receivedAmount > amountOut) { --receivedAmount; } // Unwrap WETH WETH.withdraw(receivedAmount); // Set receivedAmount to this contract's balance receivedAmount = address(this).balance; } else { // Othwerwise check balance of destToken receivedAmount = destToken.getBalance(address(this)); } // Check balance of srcToken uint256 remainingAmount = srcToken.getBalance(address(this)); // Check if swap succeeded if (receivedAmount < amountOut) { revert InsufficientReturnAmount(); } // Check if srcToken is ETH and unwrap if there is remaining amount if (isFromETH) { // Check native balance before uint256 nativeBalanceBefore = address(this).balance; // If balanceBefore is greater than 1, deduct it from remainingAmount remainingAmount = remainingAmount - (balanceBefore > 1 ? balanceBefore : 0); // Withdraw remaining WETH if any if (remainingAmount > 1) { WETH.withdraw(remainingAmount - 1); } srcToken = ERC20Utils.ETH; // If native balance before is greater than 1, deduct it from remainingAmount remainingAmount = address(this).balance - (nativeBalanceBefore > 1 ? nativeBalanceBefore : 0); } else { // Otherwise, if balanceBefore is greater than 1, deduct it from remainingAmount remainingAmount = remainingAmount - (balanceBefore > 1 ? balanceBefore : 0); } // Process fees and transfer destToken and srcToken to beneficiary return processSwapExactAmountOutFeesAndTransfer( beneficiary, srcToken, destToken, partnerAndFee, maxAmountIn, remainingAmount, receivedAmount, quotedAmountIn ); } } // SPDX-License-Identifier: MIT pragma solidity 0.8.22; // Interfaces import { IERC20 } from "@openzeppelin/token/ERC20/IERC20.sol"; import { IUniswapV3SwapExactAmountOut } from "../../../interfaces/IUniswapV3SwapExactAmountOut.sol"; // Libraries import { ERC20Utils } from "../../../libraries/ERC20Utils.sol"; import { SafeCastLib } from "@solady/utils/SafeCastLib.sol"; // Types import { UniswapV3Data } from "../../../AugustusV6Types.sol"; // Utils import { UniswapV3Utils } from "../../../util/UniswapV3Utils.sol"; /// @title UniswapV3SwapExactAmountOut /// @notice A contract for executing direct swapExactAmountOut on UniswapV3 pools abstract contract UniswapV3SwapExactAmountOut is IUniswapV3SwapExactAmountOut, UniswapV3Utils { /*////////////////////////////////////////////////////////////// LIBRARIES //////////////////////////////////////////////////////////////*/ using ERC20Utils for IERC20; using SafeCastLib for uint256; /*////////////////////////////////////////////////////////////// SWAP EXACT AMOUNT OUT //////////////////////////////////////////////////////////////*/ /// @inheritdoc IUniswapV3SwapExactAmountOut function swapExactAmountOutOnUniswapV3( UniswapV3Data calldata uniData, uint256 partnerAndFee, bytes calldata permit ) external payable whenNotPaused returns (uint256 spentAmount, uint256 receivedAmount, uint256 paraswapShare, uint256 partnerShare) { // Dereference uniData IERC20 srcToken = uniData.srcToken; IERC20 destToken = uniData.destToken; uint256 maxAmountIn = uniData.fromAmount; uint256 amountOut = uniData.toAmount; uint256 quotedAmountIn = uniData.quotedAmount; address payable beneficiary = uniData.beneficiary; bytes calldata pools = uniData.pools; // Check if toAmount is valid if (amountOut == 0) { revert InvalidToAmount(); } // Check if beneficiary is valid if (beneficiary == address(0)) { beneficiary = payable(msg.sender); } // Address that will pay for the swap address fromAddress = msg.sender; // Check if srcToken is ETH bool isFromETH = srcToken.isETH(maxAmountIn) != 0; // If pools.length > 96, we are going to do a multi-pool swap bool isMultiplePools = pools.length > 96; // Init balance before variables uint256 senderBalanceBefore; uint256 balanceBefore; // Check if we need to wrap or permit if (isFromETH) { // Check WETH balance before balanceBefore = IERC20(WETH).getBalance(address(this)); // If it is ETH. wrap it to WETH WETH.deposit{ value: maxAmountIn }(); // Swap will be paid from this contract fromAddress = address(this); // Set srcToken to WETH srcToken = WETH; } else { // Check srcToken balance before balanceBefore = srcToken.getBalance(address(this)); // Check the length of the permit field, // if < 257 and > 0 we should execute regular permit // and if it is >= 257 we execute permit2 if (permit.length < 257) { // Permit if needed if (permit.length > 0) { srcToken.permit(permit); } // if we're using multiple pools, we need to store the pre-swap balance of srcToken if (isMultiplePools) { senderBalanceBefore = srcToken.getBalance(msg.sender); } } else { // Otherwise Permit2.permitTransferFrom permit2TransferFrom(permit, address(this), maxAmountIn); // Swap will be paid from this contract fromAddress = address(this); } } // Make sure srcToken and destToken are different if (srcToken == destToken) { revert ArbitrageNotSupported(); } // Execute swap (spentAmount, receivedAmount) = _callUniswapV3PoolsSwapExactAmountOut((-amountOut.toInt256()), pools, fromAddress); // Check if swap succeeded if (receivedAmount < amountOut) { revert InsufficientReturnAmount(); } // Check if destToken is ETH and unwrap if (address(destToken) == address(ERC20Utils.ETH)) { // Make sure srcToken was not WETH if (srcToken == WETH) { revert ArbitrageNotSupported(); } // Unwrap WETH WETH.withdraw(receivedAmount); } // Iniiialize remainingAmount uint256 remainingAmount; // Check if payer is this contract if (fromAddress == address(this)) { // If srcTokenwas ETH, we need to withdraw remaining WETH if any if (isFromETH) { // Check native balance before uint256 nativeBalanceBefore = address(this).balance; // Check balance of WETH, If balanceBefore is greater than 1, deduct it from remainingAmount remainingAmount = IERC20(WETH).getBalance(address(this)) - (balanceBefore > 1 ? balanceBefore : 0); // Withdraw remaining WETH if any if (remainingAmount > 1) { // Unwrap WETH WETH.withdraw(remainingAmount - 1); // If native balance before is greater than 1, deduct it from remainingAmount remainingAmount = address(this).balance - (nativeBalanceBefore > 1 ? nativeBalanceBefore : 0); } // Set srcToken to ETH srcToken = ERC20Utils.ETH; } else { // If we have executed multi-pool swap, we need to fetch the remaining amount from balance if (isMultiplePools) { // Calculate spent amount and remaining amount, If balanceBefore is greater than 1, deduct it from // remainingAmount remainingAmount = srcToken.getBalance(address(this)) - (balanceBefore > 1 ? balanceBefore : 0); } else { // Otherwise, remaining amount is the difference between the spent amount and the remaining balance remainingAmount = maxAmountIn - spentAmount; } } // Process fees using processSwapExactAmountOutFeesAndTransfer return processSwapExactAmountOutFeesAndTransfer( beneficiary, srcToken, destToken, partnerAndFee, maxAmountIn, remainingAmount, receivedAmount, quotedAmountIn ); } else { // If we have executed multi-pool swap, we need to re-calculate the remaining amount and spent amount if (isMultiplePools) { // Calculate spent amount and remaining amount remainingAmount = srcToken.getBalance(msg.sender); spentAmount = senderBalanceBefore - remainingAmount; } // Process fees and transfer destToken and srcToken to feeVault or partner and // feeWallet if needed return processSwapExactAmountOutFeesAndTransferUniV3( beneficiary, srcToken, destToken, partnerAndFee, maxAmountIn, receivedAmount, spentAmount, quotedAmountIn ); } } } // SPDX-License-Identifier: MIT pragma solidity 0.8.22; // Interfaces import { IERC20 } from "@openzeppelin/token/ERC20/IERC20.sol"; import { IAugustusFeeVault } from "../interfaces/IAugustusFeeVault.sol"; import { IAugustusFees } from "../interfaces/IAugustusFees.sol"; // Libraries import { ERC20Utils } from "../libraries/ERC20Utils.sol"; // Storage import { AugustusStorage } from "../storage/AugustusStorage.sol"; /// @title AugustusFees /// @notice Contract for handling fees contract AugustusFees is AugustusStorage, IAugustusFees { /*////////////////////////////////////////////////////////////// LIBRARIES //////////////////////////////////////////////////////////////*/ using ERC20Utils for IERC20; /*////////////////////////////////////////////////////////////// CONSTANTS //////////////////////////////////////////////////////////////*/ /// @dev Fee share constants uint256 public constant PARTNER_SHARE_PERCENT = 8500; uint256 public constant MAX_FEE_PERCENT = 200; uint256 public constant SURPLUS_PERCENT = 100; uint256 public constant PARASWAP_REFERRAL_SHARE = 5000; uint256 public constant PARTNER_REFERRAL_SHARE = 2500; uint256 public constant PARASWAP_SURPLUS_SHARE = 5000; uint256 public constant PARASWAP_SLIPPAGE_SHARE = 10_000; uint256 public constant MINIMUM_SURPLUS_EPSILON_AND_ONE_WEI = 11; /// @dev Masks for unpacking feeData uint256 private constant FEE_PERCENT_IN_BASIS_POINTS_MASK = 0x3FFF; uint256 private constant IS_USER_SURPLUS_MASK = 1 << 90; uint256 private constant IS_DIRECT_TRANSFER_MASK = 1 << 91; uint256 private constant IS_CAP_SURPLUS_MASK = 1 << 92; uint256 private constant IS_SKIP_BLACKLIST_MASK = 1 << 93; uint256 private constant IS_REFERRAL_MASK = 1 << 94; uint256 private constant IS_TAKE_SURPLUS_MASK = 1 << 95; /// @dev A contact that stores fees collected by the protocol IAugustusFeeVault public immutable FEE_VAULT; // solhint-disable-line var-name-mixedcase /*////////////////////////////////////////////////////////////// CONSTRUCTOR //////////////////////////////////////////////////////////////*/ constructor(address _feeVault) { FEE_VAULT = IAugustusFeeVault(_feeVault); } /*////////////////////////////////////////////////////////////// SWAP EXACT AMOUNT IN FEES //////////////////////////////////////////////////////////////*/ /// @notice Process swapExactAmountIn fees and transfer the received amount to the beneficiary /// @param destToken The received token from the swapExactAmountIn /// @param partnerAndFee Packed partner and fee data /// @param receivedAmount The amount of destToken received from the swapExactAmountIn /// @param quotedAmount The quoted expected amount of destToken /// @return returnAmount The amount of destToken transfered to the beneficiary /// @return paraswapFeeShare The share of the fees for Paraswap /// @return partnerFeeShare The share of the fees for the partner function processSwapExactAmountInFeesAndTransfer( address beneficiary, IERC20 destToken, uint256 partnerAndFee, uint256 receivedAmount, uint256 quotedAmount ) internal returns (uint256 returnAmount, uint256 paraswapFeeShare, uint256 partnerFeeShare) { // initialize the surplus uint256 surplus; // parse partner and fee data (address payable partner, uint256 feeData) = parsePartnerAndFeeData(partnerAndFee); // calculate the surplus, we expect there to be 1 wei dust left which we should // not take into account when determining if there is surplus, we only take the // surplus if it is greater than MINIMUM_SURPLUS_EPSILON_AND_ONE_WEI if (receivedAmount > quotedAmount + MINIMUM_SURPLUS_EPSILON_AND_ONE_WEI) { surplus = receivedAmount - quotedAmount; // if the cap surplus flag is passed, we cap the surplus to 1% of the quoted amount if (feeData & IS_CAP_SURPLUS_MASK != 0) { uint256 cappedSurplus = (SURPLUS_PERCENT * quotedAmount) / 10_000; surplus = surplus > cappedSurplus ? cappedSurplus : surplus; } } // calculate remainingAmount uint256 remainingAmount = receivedAmount - surplus; // if partner address is not 0x0 if (partner != address(0x0)) { // Check if skip blacklist flag is true bool skipBlacklist = feeData & IS_SKIP_BLACKLIST_MASK != 0; // Check if token is blacklisted bool isBlacklisted = blacklistedTokens[destToken]; // If the token is blacklisted and the skipBlacklist flag is false, // send the received amount to the beneficiary, we won't process fees if (!skipBlacklist && isBlacklisted) { // transfer the received amount to the beneficiary, keeping 1 wei dust _transferAndLeaveDust(destToken, beneficiary, receivedAmount); return (receivedAmount - 1, 0, 0); } // Check if direct transfer flag is true bool isDirectTransfer = feeData & IS_DIRECT_TRANSFER_MASK != 0; // partner takes fixed fees feePercent is greater than 0 uint256 feePercent = _getAdjustedFeePercent(feeData); if (feePercent > 0) { // fee base = min (receivedAmount, quotedAmount + surplus) uint256 feeBase = receivedAmount > quotedAmount + surplus ? quotedAmount + surplus : receivedAmount; // calculate fixed fees uint256 fee = (feeBase * feePercent) / 10_000; partnerFeeShare = (fee * PARTNER_SHARE_PERCENT) / 10_000; paraswapFeeShare = fee - partnerFeeShare; // distrubite fees from destToken returnAmount = _distributeFees( receivedAmount, destToken, partner, partnerFeeShare, paraswapFeeShare, skipBlacklist, isBlacklisted, isDirectTransfer ); // transfer the return amount to the beneficiary, keeping 1 wei dust _transferAndLeaveDust(destToken, beneficiary, returnAmount); return (returnAmount - 1, paraswapFeeShare, partnerFeeShare); } // if slippage is postive and referral flag is true else if (feeData & IS_REFERRAL_MASK != 0) { if (surplus > 0) { // the split is 50% for paraswap, 25% for the referrer and 25% for the user paraswapFeeShare = (surplus * PARASWAP_REFERRAL_SHARE) / 10_000; partnerFeeShare = (surplus * PARTNER_REFERRAL_SHARE) / 10_000; // distribute fees from destToken returnAmount = _distributeFees( receivedAmount, destToken, partner, partnerFeeShare, paraswapFeeShare, skipBlacklist, isBlacklisted, isDirectTransfer ); // transfer the return amount to the beneficiary, keeping 1 wei dust _transferAndLeaveDust(destToken, beneficiary, returnAmount); return (returnAmount - 1, paraswapFeeShare, partnerFeeShare); } } // if slippage is positive and takeSurplus flag is true else if (feeData & IS_TAKE_SURPLUS_MASK != 0) { if (surplus > 0) { // paraswap takes 50% of the surplus and partner takes the other 50% paraswapFeeShare = (surplus * PARASWAP_SURPLUS_SHARE) / 10_000; partnerFeeShare = surplus - paraswapFeeShare; // If user surplus flag is true, transfer the partner share to the user instead of the partner if (feeData & IS_USER_SURPLUS_MASK != 0) { partnerFeeShare = 0; // Transfer the paraswap share directly to the fee wallet isDirectTransfer = true; } // distrubite fees from destToken, partner takes 50% of the surplus // and paraswap takes the other 50% returnAmount = _distributeFees( receivedAmount, destToken, partner, partnerFeeShare, paraswapFeeShare, skipBlacklist, isBlacklisted, isDirectTransfer ); // transfer the return amount to the beneficiary, keeping 1 wei dust _transferAndLeaveDust(destToken, beneficiary, returnAmount); return (returnAmount - 1, paraswapFeeShare, partnerFeeShare); } } } // if slippage is positive and partner address is 0x0 or fee percent is 0 // paraswap will take the surplus and transfer the rest to the beneficiary // if there is no positive slippage, transfer the received amount to the beneficiary if (surplus > 0) { // If the token is blacklisted, send the received amount to the beneficiary // we won't process fees if (blacklistedTokens[destToken]) { // transfer the received amount to the beneficiary, keeping 1 wei dust _transferAndLeaveDust(destToken, beneficiary, receivedAmount); return (receivedAmount - 1, 0, 0); } // transfer the remaining amount to the beneficiary, keeping 1 wei dust _transferAndLeaveDust(destToken, beneficiary, remainingAmount); // transfer the surplus to the fee wallet destToken.safeTransfer(feeWallet, surplus); return (remainingAmount - 1, surplus, 0); } else { // transfer the received amount to the beneficiary, keeping 1 wei dust _transferAndLeaveDust(destToken, beneficiary, receivedAmount); return (receivedAmount - 1, 0, 0); } } /// @notice Process swapExactAmountIn fees and transfer the received amount to the beneficiary /// @param destToken The received token from the swapExactAmountIn /// @param partnerAndFee Packed partner and fee data /// @param receivedAmount The amount of destToken received from the swapExactAmountIn /// @param quotedAmount The quoted expected amount of destToken /// @return returnAmount The amount of destToken transfered to the beneficiary /// @return paraswapFeeShare The share of the fees for Paraswap /// @return partnerFeeShare The share of the fees for the partner function processSwapExactAmountInFeesAndTransferUniV3( address beneficiary, IERC20 destToken, uint256 partnerAndFee, uint256 receivedAmount, uint256 quotedAmount ) internal returns (uint256 returnAmount, uint256 paraswapFeeShare, uint256 partnerFeeShare) { // initialize the surplus uint256 surplus; // parse partner and fee data (address payable partner, uint256 feeData) = parsePartnerAndFeeData(partnerAndFee); // calculate the surplus, we do not take the surplus into account if it is less than // MINIMUM_SURPLUS_EPSILON_AND_ONE_WEI if (receivedAmount > quotedAmount + MINIMUM_SURPLUS_EPSILON_AND_ONE_WEI) { surplus = receivedAmount - quotedAmount; // if the cap surplus flag is passed, we cap the surplus to 1% of the quoted amount if (feeData & IS_CAP_SURPLUS_MASK != 0) { uint256 cappedSurplus = (SURPLUS_PERCENT * quotedAmount) / 10_000; surplus = surplus > cappedSurplus ? cappedSurplus : surplus; } } // calculate remainingAmount uint256 remainingAmount = receivedAmount - surplus; // if partner address is not 0x0 if (partner != address(0x0)) { // Check if skip blacklist flag is true bool skipBlacklist = feeData & IS_SKIP_BLACKLIST_MASK != 0; // Check if token is blacklisted bool isBlacklisted = blacklistedTokens[destToken]; // If the token is blacklisted and the skipBlacklist flag is false, // send the received amount to the beneficiary, we won't process fees if (!skipBlacklist && isBlacklisted) { // transfer the received amount to the beneficiary destToken.safeTransfer(beneficiary, receivedAmount); return (receivedAmount, 0, 0); } // Check if direct transfer flag is true bool isDirectTransfer = feeData & IS_DIRECT_TRANSFER_MASK != 0; // partner takes fixed fees feePercent is greater than 0 uint256 feePercent = _getAdjustedFeePercent(feeData); if (feePercent > 0) { // fee base = min (receivedAmount, quotedAmount + surplus) uint256 feeBase = receivedAmount > quotedAmount + surplus ? quotedAmount + surplus : receivedAmount; // calculate fixed fees uint256 fee = (feeBase * feePercent) / 10_000; partnerFeeShare = (fee * PARTNER_SHARE_PERCENT) / 10_000; paraswapFeeShare = fee - partnerFeeShare; // distrubite fees from destToken returnAmount = _distributeFees( receivedAmount, destToken, partner, partnerFeeShare, paraswapFeeShare, skipBlacklist, isBlacklisted, isDirectTransfer ); // transfer the return amount to the beneficiary destToken.safeTransfer(beneficiary, returnAmount); return (returnAmount, paraswapFeeShare, partnerFeeShare); } // if slippage is postive and referral flag is true else if (feeData & IS_REFERRAL_MASK != 0) { if (surplus > 0) { // the split is 50% for paraswap, 25% for the referrer and 25% for the user paraswapFeeShare = (surplus * PARASWAP_REFERRAL_SHARE) / 10_000; partnerFeeShare = (surplus * PARTNER_REFERRAL_SHARE) / 10_000; // distribute fees from destToken returnAmount = _distributeFees( receivedAmount, destToken, partner, partnerFeeShare, paraswapFeeShare, skipBlacklist, isBlacklisted, isDirectTransfer ); // transfer the return amount to the beneficiary destToken.safeTransfer(beneficiary, returnAmount); return (returnAmount, paraswapFeeShare, partnerFeeShare); } } // if slippage is positive and takeSurplus flag is true else if (feeData & IS_TAKE_SURPLUS_MASK != 0) { if (surplus > 0) { // paraswap takes 50% of the surplus and partner takes the other 50% paraswapFeeShare = (surplus * PARASWAP_SURPLUS_SHARE) / 10_000; partnerFeeShare = surplus - paraswapFeeShare; // If user surplus flag is true, transfer the partner share to the user instead of the partner if (feeData & IS_USER_SURPLUS_MASK != 0) { partnerFeeShare = 0; // Transfer the paraswap share directly to the fee wallet isDirectTransfer = true; } // distrubite fees from destToken, partner takes 50% of the surplus // and paraswap takes the other 50% returnAmount = _distributeFees( receivedAmount, destToken, partner, partnerFeeShare, paraswapFeeShare, skipBlacklist, isBlacklisted, isDirectTransfer ); // transfer the return amount to the beneficiary, destToken.safeTransfer(beneficiary, returnAmount); return (returnAmount, paraswapFeeShare, partnerFeeShare); } } } // if slippage is positive and partner address is 0x0 or fee percent is 0 // paraswap will take the surplus and transfer the rest to the beneficiary // if there is no positive slippage, transfer the received amount to the beneficiary if (surplus > 0) { // If the token is blacklisted, send the received amount to the beneficiary // we won't process fees if (blacklistedTokens[destToken]) { // transfer the received amount to the beneficiary destToken.safeTransfer(beneficiary, receivedAmount); return (receivedAmount, 0, 0); } // transfer the remaining amount to the beneficiary destToken.safeTransfer(beneficiary, remainingAmount); // transfer the surplus to the fee wallet destToken.safeTransfer(feeWallet, surplus); return (remainingAmount, surplus, 0); } else { // transfer the received amount to the beneficiary destToken.safeTransfer(beneficiary, receivedAmount); return (receivedAmount, 0, 0); } } /*////////////////////////////////////////////////////////////// SWAP EXACT AMOUNT OUT FEES //////////////////////////////////////////////////////////////*/ /// @notice Process swapExactAmountOut fees and transfer the received amount and remaining amount to the /// beneficiary /// @param srcToken The token used to swapExactAmountOut /// @param destToken The token received from the swapExactAmountOut /// @param partnerAndFee Packed partner and fee data /// @param maxAmountIn The amount of srcToken passed to the swapExactAmountOut /// @param receivedAmount The amount of destToken received from the swapExactAmountOut /// @param quotedAmount The quoted expected amount of srcToken to be used to swapExactAmountOut /// @return spentAmount The amount of srcToken used to swapExactAmountOut /// @return outAmount The amount of destToken transfered to the beneficiary /// @return paraswapFeeShare The share of the fees for Paraswap /// @return partnerFeeShare The share of the fees for the partner function processSwapExactAmountOutFeesAndTransfer( address beneficiary, IERC20 srcToken, IERC20 destToken, uint256 partnerAndFee, uint256 maxAmountIn, uint256 remainingAmount, uint256 receivedAmount, uint256 quotedAmount ) internal returns (uint256 spentAmount, uint256 outAmount, uint256 paraswapFeeShare, uint256 partnerFeeShare) { // calculate the amount used to swapExactAmountOut spentAmount = maxAmountIn - (remainingAmount > 0 ? remainingAmount - 1 : remainingAmount); // initialize the surplus uint256 surplus; // initialize the return amount uint256 returnAmount; // parse partner and fee data (address payable partner, uint256 feeData) = parsePartnerAndFeeData(partnerAndFee); // check if the quotedAmount is bigger than the maxAmountIn if (quotedAmount > maxAmountIn) { revert InvalidQuotedAmount(); } // calculate the surplus, we do not take the surplus into account if it is less than // MINIMUM_SURPLUS_EPSILON_AND_ONE_WEI if (quotedAmount > spentAmount + MINIMUM_SURPLUS_EPSILON_AND_ONE_WEI) { surplus = quotedAmount - spentAmount; // if the cap surplus flag is passed, we cap the surplus to 1% of the quoted amount if (feeData & IS_CAP_SURPLUS_MASK != 0) { uint256 cappedSurplus = (SURPLUS_PERCENT * quotedAmount) / 10_000; surplus = surplus > cappedSurplus ? cappedSurplus : surplus; } } // if partner address is not 0x0 if (partner != address(0x0)) { // Check if skip blacklist flag is true bool skipBlacklist = feeData & IS_SKIP_BLACKLIST_MASK != 0; // Check if token is blacklisted bool isBlacklisted = blacklistedTokens[srcToken]; // If the token is blacklisted and the skipBlacklist flag is false, // send the remaining amount to the msg.sender, we won't process fees if (!skipBlacklist && isBlacklisted) { // transfer the remaining amount to msg.sender returnAmount = _transferIfGreaterThanOne(srcToken, msg.sender, remainingAmount); // transfer the received amount of destToken to the beneficiary destToken.safeTransfer(beneficiary, --receivedAmount); return (maxAmountIn - returnAmount, receivedAmount, 0, 0); } // Check if direct transfer flag is true bool isDirectTransfer = feeData & IS_DIRECT_TRANSFER_MASK != 0; // partner takes fixed fees feePercent is greater than 0 uint256 feePercent = _getAdjustedFeePercent(feeData); if (feePercent > 0) { // fee base = min (spentAmount, quotedAmount) uint256 feeBase = spentAmount < quotedAmount ? spentAmount : quotedAmount; // calculate fixed fees uint256 fee = (feeBase * feePercent) / 10_000; partnerFeeShare = (fee * PARTNER_SHARE_PERCENT) / 10_000; paraswapFeeShare = fee - partnerFeeShare; // distrubite fees from srcToken returnAmount = _distributeFees( remainingAmount, srcToken, partner, partnerFeeShare, paraswapFeeShare, skipBlacklist, isBlacklisted, isDirectTransfer ); // transfer the rest to msg.sender returnAmount = _transferIfGreaterThanOne(srcToken, msg.sender, returnAmount); // transfer the received amount of destToken to the beneficiary destToken.safeTransfer(beneficiary, --receivedAmount); return (maxAmountIn - returnAmount, receivedAmount, paraswapFeeShare, partnerFeeShare); } // if slippage is postive and referral flag is true if (feeData & IS_REFERRAL_MASK != 0) { if (surplus > 0) { // the split is 50% for paraswap, 25% for the referrer and 25% for the user paraswapFeeShare = (surplus * PARASWAP_REFERRAL_SHARE) / 10_000; partnerFeeShare = (surplus * PARTNER_REFERRAL_SHARE) / 10_000; // distribute fees from srcToken returnAmount = _distributeFees( remainingAmount, srcToken, partner, partnerFeeShare, paraswapFeeShare, skipBlacklist, isBlacklisted, isDirectTransfer ); // transfer the rest to msg.sender returnAmount = _transferIfGreaterThanOne(srcToken, msg.sender, returnAmount); // transfer the received amount of destToken to the beneficiary destToken.safeTransfer(beneficiary, --receivedAmount); return (maxAmountIn - returnAmount, receivedAmount, paraswapFeeShare, partnerFeeShare); } } // if slippage is positive and takeSurplus flag is true else if (feeData & IS_TAKE_SURPLUS_MASK != 0) { if (surplus > 0) { // paraswap takes 50% of the surplus and partner takes the other 50% paraswapFeeShare = (surplus * PARASWAP_SURPLUS_SHARE) / 10_000; partnerFeeShare = surplus - paraswapFeeShare; // If user surplus flag is true, transfer the partner share to the user instead of the partner if (feeData & IS_USER_SURPLUS_MASK != 0) { partnerFeeShare = 0; // Transfer the paraswap share directly to the fee wallet isDirectTransfer = true; } // distrubite fees from srcToken, partner takes 50% of the surplus // and paraswap takes the other 50% returnAmount = _distributeFees( remainingAmount, srcToken, partner, partnerFeeShare, paraswapFeeShare, skipBlacklist, isBlacklisted, isDirectTransfer ); // transfer the rest to msg.sender returnAmount = _transferIfGreaterThanOne(srcToken, msg.sender, returnAmount); // transfer the received amount of destToken to the beneficiary destToken.safeTransfer(beneficiary, --receivedAmount); return (maxAmountIn - returnAmount, receivedAmount, paraswapFeeShare, partnerFeeShare); } } } // transfer the received amount of destToken to the beneficiary destToken.safeTransfer(beneficiary, --receivedAmount); // if slippage is positive and partner address is 0x0 or fee percent is 0 // paraswap will take the surplus, and transfer the rest to msg.sender // if there is no positive slippage, transfer the remaining amount to msg.sender if (surplus > 0) { // If the token is blacklisted, send the remaining amount to the msg.sender // we won't process fees if (blacklistedTokens[srcToken]) { // transfer the remaining amount to msg.sender returnAmount = _transferIfGreaterThanOne(srcToken, msg.sender, remainingAmount); return (maxAmountIn - returnAmount, receivedAmount, 0, 0); } // transfer the surplus to the fee wallet srcToken.safeTransfer(feeWallet, surplus); // transfer the remaining amount to msg.sender returnAmount = _transferIfGreaterThanOne(srcToken, msg.sender, remainingAmount - surplus); return (maxAmountIn - returnAmount, receivedAmount, surplus, 0); } else { // transfer the remaining amount to msg.sender returnAmount = _transferIfGreaterThanOne(srcToken, msg.sender, remainingAmount); return (maxAmountIn - returnAmount, receivedAmount, 0, 0); } } /// @notice Process swapExactAmountOut fees for UniV3 swapExactAmountOut, doing a transferFrom user to the fee /// vault or partner and feeWallet /// @param beneficiary The user's address /// @param srcToken The token used to swapExactAmountOut /// @param destToken The token received from the swapExactAmountOut /// @param partnerAndFee Packed partner and fee data /// @param maxAmountIn The amount of srcToken passed to the swapExactAmountOut /// @param receivedAmount The amount of destToken received from the swapExactAmountOut /// @param spentAmount The amount of srcToken used to swapExactAmountOut /// @param quotedAmount The quoted expected amount of srcToken to be used to swapExactAmountOut /// @return totalSpentAmount The total amount of srcToken used to swapExactAmountOut /// @return returnAmount The amount of destToken transfered to the beneficiary /// @return paraswapFeeShare The share of the fees for Paraswap /// @return partnerFeeShare The share of the fees for the partner function processSwapExactAmountOutFeesAndTransferUniV3( address beneficiary, IERC20 srcToken, IERC20 destToken, uint256 partnerAndFee, uint256 maxAmountIn, uint256 receivedAmount, uint256 spentAmount, uint256 quotedAmount ) internal returns (uint256 totalSpentAmount, uint256 returnAmount, uint256 paraswapFeeShare, uint256 partnerFeeShare) { // initialize the surplus uint256 surplus; // calculate remaining amount uint256 remainingAmount = maxAmountIn - spentAmount; // parse partner and fee data (address payable partner, uint256 feeData) = parsePartnerAndFeeData(partnerAndFee); // check if the quotedAmount is bigger than the fromAmount if (quotedAmount > maxAmountIn) { revert InvalidQuotedAmount(); } // calculate the surplus, we do not take the surplus into account if it is less than // MINIMUM_SURPLUS_EPSILON_AND_ONE_WEI if (quotedAmount > spentAmount + MINIMUM_SURPLUS_EPSILON_AND_ONE_WEI) { surplus = quotedAmount - spentAmount; // if the cap surplus flag is passed, we cap the surplus to 1% of the quoted amount if (feeData & IS_CAP_SURPLUS_MASK != 0) { uint256 cappedSurplus = (SURPLUS_PERCENT * quotedAmount) / 10_000; surplus = surplus > cappedSurplus ? cappedSurplus : surplus; } } // if partner address is not 0x0 if (partner != address(0x0)) { // Check if skip blacklist flag is true bool skipBlacklist = feeData & IS_SKIP_BLACKLIST_MASK != 0; // Check if token is blacklisted bool isBlacklisted = blacklistedTokens[srcToken]; // If the token is blacklisted and the skipBlacklist flag is false, // we won't process fees if (!skipBlacklist && isBlacklisted) { // transfer the received amount of destToken to the beneficiary destToken.safeTransfer(beneficiary, receivedAmount); return (spentAmount, receivedAmount, 0, 0); } // Check if direct transfer flag is true bool isDirectTransfer = feeData & IS_DIRECT_TRANSFER_MASK != 0; // partner takes fixed fees feePercent is greater than 0 uint256 feePercent = _getAdjustedFeePercent(feeData); if (feePercent > 0) { // fee base = min (spentAmount, quotedAmount) uint256 feeBase = spentAmount < quotedAmount ? spentAmount : quotedAmount; // calculate fixed fees uint256 fee = (feeBase * feePercent) / 10_000; partnerFeeShare = (fee * PARTNER_SHARE_PERCENT) / 10_000; paraswapFeeShare = fee - partnerFeeShare; // distrubite fees from srcToken totalSpentAmount = _distributeFeesUniV3( remainingAmount, msg.sender, srcToken, partner, partnerFeeShare, paraswapFeeShare, skipBlacklist, isBlacklisted, isDirectTransfer ) + spentAmount; // transfer the received amount of destToken to the beneficiary destToken.safeTransfer(beneficiary, receivedAmount); return (totalSpentAmount, receivedAmount, paraswapFeeShare, partnerFeeShare); } // if slippage is postive and referral flag is true else if (feeData & IS_REFERRAL_MASK != 0) { if (surplus > 0) { // the split is 50% for paraswap, 25% for the referrer and 25% for the user paraswapFeeShare = (surplus * PARASWAP_REFERRAL_SHARE) / 10_000; partnerFeeShare = (surplus * PARTNER_REFERRAL_SHARE) / 10_000; // distribute fees from srcToken totalSpentAmount = _distributeFeesUniV3( remainingAmount, msg.sender, srcToken, partner, partnerFeeShare, paraswapFeeShare, skipBlacklist, isBlacklisted, isDirectTransfer ) + spentAmount; // transfer the received amount of destToken to the beneficiary destToken.safeTransfer(beneficiary, receivedAmount); return (totalSpentAmount, receivedAmount, paraswapFeeShare, partnerFeeShare); } } // if slippage is positive and takeSurplus flag is true else if (feeData & IS_TAKE_SURPLUS_MASK != 0) { if (surplus > 0) { // paraswap takes 50% of the surplus and partner takes the other 50% paraswapFeeShare = (surplus * PARASWAP_SURPLUS_SHARE) / 10_000; partnerFeeShare = surplus - paraswapFeeShare; // If user surplus flag is true, transfer the partner share to the user instead of the partner if (feeData & IS_USER_SURPLUS_MASK != 0) { partnerFeeShare = 0; // Transfer the paraswap share directly to the fee wallet isDirectTransfer = true; } // partner takes 50% of the surplus and paraswap takes the other 50% // distrubite fees from srcToken totalSpentAmount = _distributeFeesUniV3( remainingAmount, msg.sender, srcToken, partner, partnerFeeShare, paraswapFeeShare, skipBlacklist, isBlacklisted, isDirectTransfer ) + spentAmount; // transfer the received amount of destToken to the beneficiary destToken.safeTransfer(beneficiary, receivedAmount); return (totalSpentAmount, receivedAmount, paraswapFeeShare, partnerFeeShare); } } } // transfer the received amount of destToken to the beneficiary destToken.safeTransfer(beneficiary, receivedAmount); // if slippage is positive and partner address is 0x0 or fee percent is 0 // paraswap will take the surplus if (surplus > 0) { // If the token is blacklisted, we won't process fees if (blacklistedTokens[srcToken]) { return (spentAmount, receivedAmount, 0, 0); } // transfer the surplus to the fee wallet srcToken.safeTransferFrom(msg.sender, feeWallet, surplus); } return (spentAmount + surplus, receivedAmount, surplus, 0); } /*////////////////////////////////////////////////////////////// PUBLIC //////////////////////////////////////////////////////////////*/ /// @inheritdoc IAugustusFees function parsePartnerAndFeeData(uint256 partnerAndFee) public pure returns (address payable partner, uint256 feeData) { // solhint-disable-next-line no-inline-assembly assembly ("memory-safe") { partner := shr(96, partnerAndFee) feeData := and(partnerAndFee, 0xFFFFFFFFFFFFFFFFFFFFFFFF) } } /*////////////////////////////////////////////////////////////// PRIVATE //////////////////////////////////////////////////////////////*/ /// @notice Distribute fees to the partner and paraswap /// @param currentBalance The current balance of the token before distributing the fees /// @param token The token to distribute the fees for /// @param partner The partner address /// @param partnerShare The partner share /// @param paraswapShare The paraswap share /// @param skipBlacklist Whether to skip the blacklist and transfer the fees directly to the partner /// @param isBlacklisted Whether the token is blacklisted /// @param directTransfer Whether to transfer the fees directly to the partner instead of the fee vault /// @return newBalance The new balance of the token after distributing the fees function _distributeFees( uint256 currentBalance, IERC20 token, address payable partner, uint256 partnerShare, uint256 paraswapShare, bool skipBlacklist, bool isBlacklisted, bool directTransfer ) private returns (uint256 newBalance) { uint256 totalFees = partnerShare + paraswapShare; if (totalFees == 0) { return currentBalance; } else { if (skipBlacklist && isBlacklisted) { // totalFees should be just the partner share, paraswap does not take fees // on blacklisted tokens, the rest of the fees are sent to sender based on // newBalance = currentBalance - totalFees totalFees = partnerShare; // revert if the balance is not enough to pay the fees if (totalFees > currentBalance) { revert InsufficientBalanceToPayFees(); } if (partnerShare > 0) { token.safeTransfer(partner, partnerShare); } } else { // revert if the balance is not enough to pay the fees if (totalFees > currentBalance) { revert InsufficientBalanceToPayFees(); } if (directTransfer) { // transfer the fees directly to the partner and paraswap if (paraswapShare > 0) { token.safeTransfer(feeWallet, paraswapShare); } if (partnerShare > 0) { token.safeTransfer(partner, partnerShare); } } else { // transfer the fees to the fee vault token.safeTransfer(address(FEE_VAULT), totalFees); // Setup fee registration data address[] memory feeAddresses = new address[](2); uint256[] memory feeAmounts = new uint256[](2); feeAddresses[0] = partner; feeAmounts[0] = partnerShare; feeAddresses[1] = feeWalletDelegate; feeAmounts[1] = paraswapShare; IAugustusFeeVault.FeeRegistration memory feeData = IAugustusFeeVault.FeeRegistration({ token: token, addresses: feeAddresses, fees: feeAmounts }); // Register the fees FEE_VAULT.registerFees(feeData); } } } newBalance = currentBalance - totalFees; } /// @notice Distribute fees for UniV3 /// @param currentBalance The current balance of the token before distributing the fees /// @param payer The user's address /// @param token The token to distribute the fees for /// @param partner The partner address /// @param partnerShare The partner share /// @param paraswapShare The paraswap share /// @param skipBlacklist Whether to skip the blacklist and transfer the fees directly to the partner /// @param isBlacklisted Whether the token is blacklisted /// @param directTransfer Whether to transfer the fees directly to the partner instead of the fee vault /// @return totalFees The total fees distributed function _distributeFeesUniV3( uint256 currentBalance, address payer, IERC20 token, address payable partner, uint256 partnerShare, uint256 paraswapShare, bool skipBlacklist, bool isBlacklisted, bool directTransfer ) private returns (uint256 totalFees) { totalFees = partnerShare + paraswapShare; if (totalFees != 0) { if (skipBlacklist && isBlacklisted) { // totalFees should be just the partner share, paraswap does not take fees // on blacklisted tokens, the rest of the fees will remain on the payer's address totalFees = partnerShare; // revert if the balance is not enough to pay the fees if (totalFees > currentBalance) { revert InsufficientBalanceToPayFees(); } // transfer the fees to the partner if (partnerShare > 0) { // transfer the fees to the partner token.safeTransferFrom(payer, partner, partnerShare); } } else { // revert if the balance is not enough to pay the fees if (totalFees > currentBalance) { revert InsufficientBalanceToPayFees(); } if (directTransfer) { // transfer the fees directly to the partner and paraswap if (paraswapShare > 0) { token.safeTransferFrom(payer, feeWallet, paraswapShare); } if (partnerShare > 0) { token.safeTransferFrom(payer, partner, partnerShare); } } else { // transfer the fees to the fee vault token.safeTransferFrom(payer, address(FEE_VAULT), totalFees); // Setup fee registration data address[] memory feeAddresses = new address[](2); uint256[] memory feeAmounts = new uint256[](2); feeAddresses[0] = partner; feeAmounts[0] = partnerShare; feeAddresses[1] = feeWalletDelegate; feeAmounts[1] = paraswapShare; IAugustusFeeVault.FeeRegistration memory feeData = IAugustusFeeVault.FeeRegistration({ token: token, addresses: feeAddresses, fees: feeAmounts }); // Register the fees FEE_VAULT.registerFees(feeData); } } // othwerwise do not transfer the fees } return totalFees; } /// @notice Get the adjusted fee percent by masking feePercent with FEE_PERCENT_IN_BASIS_POINTS_MASK, /// if the fee percent is bigger than MAX_FEE_PERCENT, then set it to MAX_FEE_PERCENT /// @param feePercent The fee percent /// @return adjustedFeePercent The adjusted fee percent function _getAdjustedFeePercent(uint256 feePercent) private pure returns (uint256) { // solhint-disable-next-line no-inline-assembly assembly ("memory-safe") { feePercent := and(feePercent, FEE_PERCENT_IN_BASIS_POINTS_MASK) // if feePercent is bigger than MAX_FEE_PERCENT, then set it to MAX_FEE_PERCENT if gt(feePercent, MAX_FEE_PERCENT) { feePercent := MAX_FEE_PERCENT } } return feePercent; } /// @notice Transfers amount to recipient if the amount is bigger than 1, leaving 1 wei dust on the contract /// @param token The token to transfer /// @param recipient The address to transfer to /// @param amount The amount to transfer function _transferIfGreaterThanOne( IERC20 token, address recipient, uint256 amount ) private returns (uint256 amountOut) { if (amount > 1) { unchecked { --amount; } token.safeTransfer(recipient, amount); return amount; } return 0; } /// @notice Transfer amount to beneficiary, leaving 1 wei dust on the contract /// @param token The token to transfer /// @param beneficiary The address to transfer to /// @param amount The amount to transfer function _transferAndLeaveDust(IERC20 token, address beneficiary, uint256 amount) private { unchecked { --amount; } token.safeTransfer(beneficiary, amount); } } // SPDX-License-Identifier: MIT pragma solidity 0.8.22; // Contracts import { GenericUtils } from "../../util/GenericUtils.sol"; // Interfaces import { IERC20 } from "@openzeppelin/token/ERC20/IERC20.sol"; import { IGenericSwapExactAmountIn } from "../../interfaces/IGenericSwapExactAmountIn.sol"; // Libraries import { ERC20Utils } from "../../libraries/ERC20Utils.sol"; // Types import { GenericData } from "../../AugustusV6Types.sol"; /// @title GenericSwapExactAmountIn /// @notice Router for executing generic swaps with exact amount in through an executor abstract contract GenericSwapExactAmountIn is IGenericSwapExactAmountIn, GenericUtils { /*////////////////////////////////////////////////////////////// LIBRARIES //////////////////////////////////////////////////////////////*/ using ERC20Utils for IERC20; /*////////////////////////////////////////////////////////////// SWAP EXACT AMOUNT IN //////////////////////////////////////////////////////////////*/ /// @inheritdoc IGenericSwapExactAmountIn function swapExactAmountIn( address executor, GenericData calldata swapData, uint256 partnerAndFee, bytes calldata permit, bytes calldata executorData ) external payable whenNotPaused returns (uint256 receivedAmount, uint256 paraswapShare, uint256 partnerShare) { // Dereference swapData IERC20 destToken = swapData.destToken; IERC20 srcToken = swapData.srcToken; uint256 amountIn = swapData.fromAmount; uint256 minAmountOut = swapData.toAmount; uint256 quotedAmountOut = swapData.quotedAmount; address payable beneficiary = swapData.beneficiary; // Check if beneficiary is valid if (beneficiary == address(0)) { beneficiary = payable(msg.sender); } // Check if toAmount is valid if (minAmountOut == 0) { revert InvalidToAmount(); } // Check if srcToken is ETH if (srcToken.isETH(amountIn) == 0) { // Check the length of the permit field, // if < 257 and > 0 we should execute regular permit // and if it is >= 257 we execute permit2 if (permit.length < 257) { // Permit if needed if (permit.length > 0) { srcToken.permit(permit); } srcToken.safeTransferFrom(msg.sender, executor, amountIn); } else { // Otherwise Permit2.permitTransferFrom permit2TransferFrom(permit, executor, amountIn); } } // Execute swap _callSwapExactAmountInExecutor(executor, executorData, amountIn); // Check balance after swap receivedAmount = destToken.getBalance(address(this)); // Check if swap succeeded if (receivedAmount < minAmountOut) { revert InsufficientReturnAmount(); } // Process fees and transfer destToken to beneficiary return processSwapExactAmountInFeesAndTransfer( beneficiary, destToken, partnerAndFee, receivedAmount, quotedAmountOut ); } } // SPDX-License-Identifier: MIT pragma solidity 0.8.22; // Interfaces import { IERC20 } from "@openzeppelin/token/ERC20/IERC20.sol"; import { IGenericSwapExactAmountOut } from "../../interfaces/IGenericSwapExactAmountOut.sol"; // Libraries import { ERC20Utils } from "../../libraries/ERC20Utils.sol"; // Types import { GenericData } from "../../AugustusV6Types.sol"; // Utils import { GenericUtils } from "../../util/GenericUtils.sol"; /// @title GenericSwapExactAmountOut /// @notice Router for executing generic swaps with exact amount out through an executor abstract contract GenericSwapExactAmountOut is IGenericSwapExactAmountOut, GenericUtils { /*////////////////////////////////////////////////////////////// LIBRARIES //////////////////////////////////////////////////////////////*/ using ERC20Utils for IERC20; /*////////////////////////////////////////////////////////////// SWAP EXACT AMOUNT OUT //////////////////////////////////////////////////////////////*/ /// @inheritdoc IGenericSwapExactAmountOut function swapExactAmountOut( address executor, GenericData calldata swapData, uint256 partnerAndFee, bytes calldata permit, bytes calldata executorData ) external payable whenNotPaused returns (uint256 spentAmount, uint256 receivedAmount, uint256 paraswapShare, uint256 partnerShare) { // Dereference swapData IERC20 destToken = swapData.destToken; IERC20 srcToken = swapData.srcToken; uint256 maxAmountIn = swapData.fromAmount; uint256 amountOut = swapData.toAmount; uint256 quotedAmountIn = swapData.quotedAmount; address payable beneficiary = swapData.beneficiary; // Make sure srcToken and destToken are different if (srcToken == destToken) { revert ArbitrageNotSupported(); } // Check if beneficiary is valid if (beneficiary == address(0)) { beneficiary = payable(msg.sender); } // Check if toAmount is valid if (amountOut == 0) { revert InvalidToAmount(); } // Check contract balance uint256 balanceBefore = srcToken.getBalance(address(this)); // Check if srcToken is ETH // Transfer srcToken to executor if not ETH if (srcToken.isETH(maxAmountIn) == 0) { // Check the length of the permit field, // if < 257 and > 0 we should execute regular permit // and if it is >= 257 we execute permit2 if (permit.length < 257) { // Permit if needed if (permit.length > 0) { srcToken.permit(permit); } srcToken.safeTransferFrom(msg.sender, executor, maxAmountIn); } else { // Otherwise Permit2.permitTransferFrom permit2TransferFrom(permit, executor, maxAmountIn); } } else { // If srcToken is ETH, we have to deduct msg.value from balanceBefore balanceBefore = balanceBefore - msg.value; } // Execute swap _callSwapExactAmountOutExecutor(executor, executorData, maxAmountIn, amountOut); // Check balance of destToken receivedAmount = destToken.getBalance(address(this)); // Check balance of srcToken, deducting the balance before the swap if it is greater than 1 uint256 remainingAmount = srcToken.getBalance(address(this)) - (balanceBefore > 1 ? balanceBefore : 0); // Check if swap succeeded if (receivedAmount < amountOut) { revert InsufficientReturnAmount(); } // Process fees and transfer destToken and srcToken to beneficiary return processSwapExactAmountOutFeesAndTransfer( beneficiary, srcToken, destToken, partnerAndFee, maxAmountIn, remainingAmount, receivedAmount, quotedAmountIn ); } } // SPDX-License-Identifier: MIT pragma solidity 0.8.22; // Interfaces import { IERC20 } from "@openzeppelin/token/ERC20/IERC20.sol"; import { IAugustusRFQRouter } from "../../interfaces/IAugustusRFQRouter.sol"; // Libraries import { ERC20Utils } from "../../libraries/ERC20Utils.sol"; // Types import { AugustusRFQData, OrderInfo } from "../../AugustusV6Types.sol"; // Utils import { AugustusRFQUtils } from "../../util/AugustusRFQUtils.sol"; import { WETHUtils } from "../../util/WETHUtils.sol"; import { PauseUtils } from "../../util/PauseUtils.sol"; import { Permit2Utils } from "../../util/Permit2Utils.sol"; import { AugustusFees } from "../../fees/AugustusFees.sol"; /// @title AugustusRFQRouter /// @notice A contract for executing direct AugustusRFQ swaps abstract contract AugustusRFQRouter is IAugustusRFQRouter, AugustusRFQUtils, AugustusFees, WETHUtils, Permit2Utils, PauseUtils { /*////////////////////////////////////////////////////////////// LIBRARIES //////////////////////////////////////////////////////////////*/ using ERC20Utils for IERC20; /*////////////////////////////////////////////////////////////// TRY BATCH FILL //////////////////////////////////////////////////////////////*/ /// @inheritdoc IAugustusRFQRouter // solhint-disable-next-line code-complexity function swapOnAugustusRFQTryBatchFill( AugustusRFQData calldata data, OrderInfo[] calldata orders, bytes calldata permit ) external payable whenNotPaused returns (uint256 spentAmount, uint256 receivedAmount) { // Dereference data address payable beneficiary = data.beneficiary; uint256 ordersLength = orders.length; uint256 fromAmount = data.fromAmount; uint256 toAmount = data.toAmount; uint8 wrapApproveDirection = data.wrapApproveDirection; // Decode wrapApproveDirection // First 2 bits are for wrap // Next 1 bit is for approve // Last 1 bit is for direction uint8 wrap; bool approve; bool direction; // solhint-disable-next-line no-inline-assembly assembly ("memory-safe") { wrap := and(3, wrapApproveDirection) approve := and(shr(2, wrapApproveDirection), 1) direction := and(shr(3, wrapApproveDirection), 1) } // Check if beneficiary is valid if (beneficiary == address(0)) { beneficiary = payable(msg.sender); } // Check if toAmount is valid if (toAmount == 0) { revert InvalidToAmount(); } // Check if ordersLength is valid if (ordersLength == 0) { revert InvalidOrdersLength(); } // Check if msg.sender is authorized to be the taker for all orders for (uint256 i = 0; i < ordersLength; ++i) { _checkAuthorization(orders[i].order.nonceAndMeta); } // Dereference srcToken and destToken IERC20 srcToken = IERC20(orders[0].order.takerAsset); IERC20 destToken = IERC20(orders[0].order.makerAsset); // Check if we need to wrap or permit if (wrap != 1) { // If msg.value is not 0, revert if (msg.value > 0) { revert IncorrectEthAmount(); } // Check the length of the permit field, // if < 257 and > 0 we should execute regular permit // and if it is >= 257 we execute permit2 if (permit.length < 257) { // Permit if needed if (permit.length > 0) { srcToken.permit(permit); } srcToken.safeTransferFrom(msg.sender, address(this), fromAmount); } else { // Otherwise Permit2.permitTransferFrom permit2TransferFrom(permit, address(this), fromAmount); } } else { // Check if msg.value is equal to fromAmount if (fromAmount != msg.value) { revert IncorrectEthAmount(); } // If it is ETH. wrap it to WETH WETH.deposit{ value: fromAmount }(); } if (approve) { // Approve srcToken to AugustusRFQ srcToken.approve(address(AUGUSTUS_RFQ)); } // Check if we need to execute a swapExactAmountIn or a swapExactAmountOut if (!direction) { // swapExactAmountIn // Unwrap WETH if needed if (wrap == 2) { // Execute tryBatchFillOrderTakerAmount AUGUSTUS_RFQ.tryBatchFillOrderTakerAmount(orders, fromAmount, address(this)); // Check received amount receivedAmount = IERC20(WETH).getBalance(address(this)); // Check if swap succeeded if (receivedAmount < toAmount) { revert InsufficientReturnAmount(); } // Unwrap WETH WETH.withdraw(--receivedAmount); // Transfer ETH to beneficiary ERC20Utils.ETH.safeTransfer(beneficiary, receivedAmount); } else { // Check balance of beneficiary before swap uint256 beforeBalance = destToken.getBalance(beneficiary); // Execute tryBatchFillOrderTakerAmount AUGUSTUS_RFQ.tryBatchFillOrderTakerAmount(orders, fromAmount, beneficiary); // set receivedAmount to afterBalance - beforeBalance receivedAmount = destToken.getBalance(beneficiary) - beforeBalance; // Check if swap succeeded if (receivedAmount < toAmount) { revert InsufficientReturnAmount(); } } // Return spentAmount and receivedAmount return (fromAmount, receivedAmount); } else { // swapExactAmountOut // Unwrap WETH if needed if (wrap == 2) { // Execute tryBatchFillOrderMakerAmount AUGUSTUS_RFQ.tryBatchFillOrderMakerAmount(orders, toAmount, address(this)); // Check remaining WETH balance receivedAmount = IERC20(WETH).getBalance(address(this)); // Unwrap WETH WETH.withdraw(--receivedAmount); // Transfer ETH to beneficiary ERC20Utils.ETH.safeTransfer(beneficiary, receivedAmount); // Set toAmount to receivedAmount toAmount = receivedAmount; } else { // Execute tryBatchFillOrderMakerAmount AUGUSTUS_RFQ.tryBatchFillOrderMakerAmount(orders, toAmount, beneficiary); } // Check remaining amount uint256 remainingAmount = srcToken.getBalance(address(this)); // Send remaining srcToken to msg.sender if (remainingAmount > 1) { // If srcToken was ETH if (wrap == 1) { // Unwrap WETH WETH.withdraw(--remainingAmount); // Transfer ETH to msg.sender ERC20Utils.ETH.safeTransfer(msg.sender, remainingAmount); } else { // Transfer remaining srcToken to msg.sender srcToken.safeTransfer(msg.sender, --remainingAmount); } } // Return spentAmount and receivedAmount return (fromAmount - remainingAmount, toAmount); } } } // SPDX-License-Identifier: MIT pragma solidity 0.8.22; // Interfaces import { IAugustusRFQ } from "../interfaces/IAugustusRFQ.sol"; import { IERC20 } from "@openzeppelin/token/ERC20/IERC20.sol"; // Libraries import { ERC20Utils } from "../libraries/ERC20Utils.sol"; /// @title AugustusRFQUtils /// @notice A contract containing common utilities for AugustusRFQ swaps contract AugustusRFQUtils { /*////////////////////////////////////////////////////////////// LIBRARIES //////////////////////////////////////////////////////////////*/ using ERC20Utils for IERC20; /*////////////////////////////////////////////////////////////// ERRORS //////////////////////////////////////////////////////////////*/ /// @dev Emitted when the msg.sender is not authorized to be the taker error UnauthorizedUser(); /// @dev Emitted when the orders length is 0 error InvalidOrdersLength(); /*////////////////////////////////////////////////////////////// CONSTANTS //////////////////////////////////////////////////////////////*/ /// @dev AugustusRFQ address IAugustusRFQ public immutable AUGUSTUS_RFQ; // solhint-disable-line var-name-mixedcase /*////////////////////////////////////////////////////////////// CONSTRUCTOR //////////////////////////////////////////////////////////////*/ constructor(address _augustusRFQ) { AUGUSTUS_RFQ = IAugustusRFQ(_augustusRFQ); } /*////////////////////////////////////////////////////////////// INTERNAL //////////////////////////////////////////////////////////////*/ /// @dev Check if the msg.sender is authorized to be the taker function _checkAuthorization(uint256 nonceAndMeta) internal view { // solhint-disable-next-line no-inline-assembly assembly { // Parse nonceAndMeta if xor(and(nonceAndMeta, 0xffffffffffffffffffffffffffffffffffffffff), 0) { // If the taker is not 0, we check if the msg.sender is authorized if xor(and(nonceAndMeta, 0xffffffffffffffffffffffffffffffffffffffff), caller()) { // The taker does not match the originalSender, revert mstore(0, 0x02a43f8b00000000000000000000000000000000000000000000000000000000) // function // selector for error UnauthorizedUser(); revert(0, 4) } } } } } // SPDX-License-Identifier: MIT pragma solidity 0.8.22; // Contracts import { AugustusFees } from "../fees/AugustusFees.sol"; // Interfaces import { IERC20 } from "@openzeppelin/token/ERC20/IERC20.sol"; // Utils import { Permit2Utils } from "./Permit2Utils.sol"; import { PauseUtils } from "./PauseUtils.sol"; /// @title BalancerV2Utils /// @notice A contract containing common utilities for BalancerV2 swaps abstract contract BalancerV2Utils is AugustusFees, Permit2Utils, PauseUtils { /*////////////////////////////////////////////////////////////// ERRORS //////////////////////////////////////////////////////////////*/ /// @dev Emitted when the passed selector is invalid error InvalidSelector(); /*////////////////////////////////////////////////////////////// CONSTANTS //////////////////////////////////////////////////////////////*/ /// @dev BalancerV2 vault address address payable public immutable BALANCER_VAULT; // solhint-disable-line var-name-mixedcase /*////////////////////////////////////////////////////////////// CONSTRUCTOR //////////////////////////////////////////////////////////////*/ constructor(address payable _balancerVault) { BALANCER_VAULT = _balancerVault; } /*////////////////////////////////////////////////////////////// INTERNAL //////////////////////////////////////////////////////////////*/ /// @dev Decode srcToken, destToken from balancerData, beneficiary and approve flag from beneficiaryAndApproveFlag function _decodeBalancerV2Params( uint256 beneficiaryAndApproveFlag, bytes calldata balancerData ) internal pure returns (IERC20 srcToken, IERC20 destToken, address payable beneficiary, bool approve) { // solhint-disable-next-line no-inline-assembly assembly ("memory-safe") { // Parse beneficiaryAndApproveFlag beneficiary := and(beneficiaryAndApproveFlag, 0xFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFF) approve := shr(255, beneficiaryAndApproveFlag) // Load calldata without selector let callDataWithoutSelector := add(4, balancerData.offset) // Check selector switch calldataload(balancerData.offset) // If the selector is for swap(tuple singleSwap,tuple funds,uint256 limit,uint256 deadline) case 0x52bbbe2900000000000000000000000000000000000000000000000000000000 { // Load srcToken from singleSswap.assetIn srcToken := calldataload(add(callDataWithoutSelector, 288)) // Load destToken from singleSswap.assetOut destToken := calldataload(add(callDataWithoutSelector, 320)) } // If the selector is for batchSwap(uint8 kind,tuple[] swaps,address[] assets,tuple funds,int256[] // limits,uint256 deadline) case 0x945bcec900000000000000000000000000000000000000000000000000000000 { // Load assetOffset from balancerData let assetsOffset := calldataload(add(callDataWithoutSelector, 64)) // Load assetCount at assetOffset let assetsCount := calldataload(add(callDataWithoutSelector, assetsOffset)) // Get swapExactAmountIn type from first 32 bytes of balancerData let swapType := calldataload(callDataWithoutSelector) // Set fromAmount, srcToken, toAmount and destToken based on swapType switch eq(swapType, 1) case 1 { // Load srcToken as the last asset in balancerData.assets srcToken := calldataload(add(callDataWithoutSelector, add(assetsOffset, mul(assetsCount, 32)))) // Load destToken as the first asset in balancerData.assets destToken := calldataload(add(callDataWithoutSelector, add(assetsOffset, 32))) } default { // Load srcToken as the first asset in balancerData.assets srcToken := calldataload(add(callDataWithoutSelector, add(assetsOffset, 32))) // Load destToken as the last asset in balancerData.assets destToken := calldataload(add(callDataWithoutSelector, add(assetsOffset, mul(assetsCount, 32)))) } } default { // If the selector is invalid, revert mstore(0, 0x7352d91c00000000000000000000000000000000000000000000000000000000) // store the // selector for error InvalidSelector(); revert(0, 4) } // Balancer users 0x0 as ETH address so we need to convert it if eq(srcToken, 0) { srcToken := 0xEeeeeEeeeEeEeeEeEeEeeEEEeeeeEeeeeeeeEEeE } if eq(destToken, 0) { destToken := 0xEeeeeEeeeEeEeeEeEeEeeEEEeeeeEeeeeeeeEEeE } } return (srcToken, destToken, beneficiary, approve); } /// @dev Call balancerVault with data function _callBalancerV2(bytes calldata balancerData) internal { address payable targetAddress = BALANCER_VAULT; // solhint-disable-next-line no-inline-assembly assembly ("memory-safe") { // Load free memory pointer let ptr := mload(64) // Copy the balancerData to memory calldatacopy(ptr, balancerData.offset, balancerData.length) // Execute the call on balancerVault if iszero(call(gas(), targetAddress, callvalue(), ptr, balancerData.length, 0, 0)) { returndatacopy(ptr, 0, returndatasize()) // copy the revert data to memory revert(ptr, returndatasize()) // revert with the revert data } } } } // SPDX-License-Identifier: MIT pragma solidity 0.8.22; // Contracts import { AugustusFees } from "../fees/AugustusFees.sol"; // Interfaces import { IERC20 } from "@openzeppelin/token/ERC20/IERC20.sol"; // Utils import { WETHUtils } from "./WETHUtils.sol"; import { Permit2Utils } from "./Permit2Utils.sol"; import { PauseUtils } from "./PauseUtils.sol"; /// @title UniswapV2Utils /// @notice A contract containing common utilities for UniswapV2 swaps abstract contract UniswapV2Utils is AugustusFees, WETHUtils, Permit2Utils, PauseUtils { /*////////////////////////////////////////////////////////////// CONSTANTS //////////////////////////////////////////////////////////////*/ /// @dev Used to caluclate pool address uint256 public immutable UNISWAP_V2_POOL_INIT_CODE_HASH; /// @dev Right padded FF + UniswapV2Factory address uint256 public immutable UNISWAP_V2_FACTORY_AND_FF; /*////////////////////////////////////////////////////////////// CONSTRUCTOR //////////////////////////////////////////////////////////////*/ constructor(uint256 _uniswapV2FactoryAndFF, uint256 _uniswapV2PoolInitCodeHash) { UNISWAP_V2_FACTORY_AND_FF = _uniswapV2FactoryAndFF; UNISWAP_V2_POOL_INIT_CODE_HASH = _uniswapV2PoolInitCodeHash; } /*////////////////////////////////////////////////////////////// INTERNAL //////////////////////////////////////////////////////////////*/ /// @dev Loops through UniswapV2 pools in backword direction and swaps exact amount out function _callUniswapV2PoolsSwapExactOut(uint256 amountOut, IERC20 srcToken, bytes calldata pools) internal { uint256 uniswapV2FactoryAndFF = UNISWAP_V2_FACTORY_AND_FF; uint256 uniswapV2PoolInitCodeHash = UNISWAP_V2_POOL_INIT_CODE_HASH; // solhint-disable-next-line no-inline-assembly assembly { function calculatePoolAddress( poolMemoryPtr, poolCalldataPtr, _uniswapV2FactoryAndFF, _uniswapV2PoolInitCodeHash ) { // Calculate the pool address // We can do this by first calling the keccak256 function on the passed pool values and then // calculating keccak256(abi.encodePacked(hex'ff', address(factory_address), // keccak256(abi.encodePacked(token0, token1)), POOL_INIT_CODE_HASH)); // The first 20 bytes of the computed address are the pool address // Store 0xff + factory address (right padded) mstore(poolMemoryPtr, _uniswapV2FactoryAndFF) // Store pools offset + 21 bytes (UNISWAP_V2_FACTORY_AND_FF SIZE) let token0ptr := add(poolMemoryPtr, 21) // Copy pool data (skip last bit) to free memory pointer + 21 bytes (UNISWAP_V2_FACTORY_AND_FF SIZE) calldatacopy(token0ptr, poolCalldataPtr, 40) // Calculate keccak256(abi.encode(address(token0), address(token1)) mstore(token0ptr, keccak256(token0ptr, 40)) // Store POOL_INIT_CODE_HASH mstore(add(token0ptr, 32), _uniswapV2PoolInitCodeHash) // Calculate address(keccak256(abi.encodePacked(hex'ff', address(factory_address), // keccak256(abi.encode(token0, token1), POOL_INIT_CODE_HASH))); mstore(poolMemoryPtr, and(keccak256(poolMemoryPtr, 85), 0xffffffffffffffffffffffffffffffffffffffff)) // 21 // + 32 + 32 } // Calculate pool count let poolCount := div(pools.length, 64) // Initilize memory pointers let amounts := mload(64) // pointer for amounts array let poolAddresses := add(amounts, add(mul(poolCount, 32), 32)) // pointer for pools array let emptyPtr := add(poolAddresses, mul(poolCount, 32)) // pointer for empty memory // Initialize fromAmount let fromAmount := 0 // Set the final amount in the amounts array to amountOut mstore(add(amounts, mul(poolCount, 0x20)), amountOut) //---------------------------------// // Calculate Pool Addresses and Amounts //---------------------------------// // Calculate pool addresses for { let i := 0 } lt(i, poolCount) { i := add(i, 1) } { calculatePoolAddress( add(poolAddresses, mul(i, 32)), add(pools.offset, mul(i, 64)), uniswapV2FactoryAndFF, uniswapV2PoolInitCodeHash ) } // Rerverse loop through pools and calculate amounts for { let i := poolCount } gt(i, 0) { i := sub(i, 1) } { // Use previous pool data to calculate amount in let indexSub1 := sub(i, 1) // Get pool address let poolAddress := mload(add(poolAddresses, mul(indexSub1, 32))) // Get direction let direction := and(1, calldataload(add(add(pools.offset, mul(indexSub1, 64)), 32))) // Get amount let amount := mload(add(amounts, mul(i, 32))) //---------------------------------// // Calculate Amount In //---------------------------------// //---------------------------------// // Get Reserves //---------------------------------// // Store the selector mstore(emptyPtr, 0x0902f1ac00000000000000000000000000000000000000000000000000000000) // 'getReserves()' // selector // Perform the external 'getReserves' call - outputs directly to ptr if iszero(staticcall(gas(), poolAddress, emptyPtr, 4, emptyPtr, 64)) { returndatacopy(0, 0, returndatasize()) // Copy the error message to the start of memory revert(0, returndatasize()) // Revert with the error message } // If direction is true, getReserves returns (reserve0, reserve1) // If direction is false, getReserves returns (reserve1, reserve0) -> swap the values // Load the reserve0 value returned by the 'getReserves' call. let reserve1 := mload(emptyPtr) // Load the reserve1 value returned by the 'getReserves' call. let reserve0 := mload(add(emptyPtr, 32)) // Check if direction is true if direction { // swap reserve0 and reserve1 let temp := reserve0 reserve0 := reserve1 reserve1 := temp } //---------------------------------// // Calculate numerator = reserve0 * amountOut * 10000 let numerator := mul(mul(reserve0, amount), 10000) // Calculate denominator = (reserve1 - amountOut) * 9970 let denominator := mul(sub(reserve1, amount), 9970) // Calculate amountIn = numerator / denominator + 1 fromAmount := add(div(numerator, denominator), 1) // Store amountIn for the previous pool mstore(add(amounts, mul(indexSub1, 32)), fromAmount) } //---------------------------------// // Initialize variables let poolAddress := 0 let nextPoolAddress := 0 //---------------------------------// // Loop Swap Through Pools //---------------------------------// // Loop for each pool for { let i := 0 } lt(i, poolCount) { i := add(i, 1) } { // Check if it is the first pool if iszero(poolAddress) { // If it is the first pool, we need to transfer amount of srcToken to poolAddress // Load first pool address poolAddress := mload(poolAddresses) //---------------------------------// // Transfer amount of srcToken to poolAddress //---------------------------------// // Transfer fromAmount of srcToken to poolAddress mstore(emptyPtr, 0xa9059cbb00000000000000000000000000000000000000000000000000000000) // store the // selector // (function transfer(address recipient, uint256 amount)) mstore(add(emptyPtr, 4), poolAddress) // store the recipient mstore(add(emptyPtr, 36), fromAmount) // store the amount pop(call(gas(), srcToken, 0, emptyPtr, 68, 0, 32)) // call transfer //---------------------------------// } // Adjust toAddress depending on if it is the last pool in the array let toAddress := address() // Check if it is not the last pool if lt(add(i, 1), poolCount) { // Load next pool address nextPoolAddress := mload(add(poolAddresses, mul(add(i, 1), 32))) // Adjust toAddress to next pool address toAddress := nextPoolAddress } // Check direction let direction := and(1, calldataload(add(add(pools.offset, mul(i, 64)), 32))) // if direction is 1, amount0out is 0 and amount1out is amount[i+1] // if direction is 0, amount0out is amount[i+1] and amount1out is 0 // Load amount[i+1] let amount := mload(add(amounts, mul(add(i, 1), 32))) // Initialize amount0Out and amount1Out let amount0Out := amount let amount1Out := 0 // Check if direction is true if direction { // swap amount0Out and amount1Out let temp := amount0Out amount0Out := amount1Out amount1Out := temp } //---------------------------------// // Perform Swap //---------------------------------// // Load the 'swap' selector, amount0Out, amount1Out, toAddress and data("") into memory. mstore(emptyPtr, 0x022c0d9f00000000000000000000000000000000000000000000000000000000) // 'swap()' selector mstore(add(emptyPtr, 4), amount0Out) // amount0Out mstore(add(emptyPtr, 36), amount1Out) // amount1Out mstore(add(emptyPtr, 68), toAddress) // toAddress mstore(add(emptyPtr, 100), 0x80) // data length mstore(add(emptyPtr, 132), 0) // data // Perform the external 'swap' call if iszero(call(gas(), poolAddress, 0, emptyPtr, 164, 0, 64)) { // The call failed; we retrieve the exact error message and revert with it returndatacopy(0, 0, returndatasize()) // Copy the error message to the start of memory revert(0, returndatasize()) // Revert with the error message } //---------------------------------// // Set poolAddress to nextPoolAddress poolAddress := nextPoolAddress } //---------------------------------// } } /// @dev Loops through UniswapV2 pools and swaps exact amount in function _callUniswapV2PoolsSwapExactIn( uint256 fromAmount, IERC20 srcToken, bytes calldata pools, address payer, bytes calldata permit2 ) internal { uint256 uniswapV2FactoryAndFF = UNISWAP_V2_FACTORY_AND_FF; uint256 uniswapV2PoolInitCodeHash = UNISWAP_V2_POOL_INIT_CODE_HASH; address permit2Address = PERMIT2; // solhint-disable-next-line no-inline-assembly assembly { //---------------------------------// // Loop Swap Through Pools //---------------------------------// // Calculate pool count let poolCount := div(pools.length, 64) // Initialize variables let p := 0 let poolAddress := 0 let nextPoolAddress := 0 let direction := 0 // Loop for each pool for { let i := 0 } lt(i, poolCount) { i := add(i, 1) } { // Check if it is the first pool if iszero(p) { //---------------------------------// // Calculate Pool Address //---------------------------------// // Calculate the pool address // We can do this by first calling the keccak256 function on the passed pool values and then // calculating keccak256(abi.encodePacked(hex'ff', address(factory_address), // keccak256(abi.encodePacked(token0,token1)), POOL_INIT_CODE_HASH)); // The first 20 bytes of the computed address are the pool address // Get free memory pointer let ptr := mload(64) // Store 0xff + factory address (right padded) mstore(ptr, uniswapV2FactoryAndFF) // Store pools offset + 21 bytes (UNISWAP_V2_FACTORY_AND_FF SIZE) let token0ptr := add(ptr, 21) // Copy pool data (skip last bit) to free memory pointer + 21 bytes (UNISWAP_V2_FACTORY_AND_FF // SIZE) calldatacopy(token0ptr, pools.offset, 40) // Calculate keccak256(abi.encodePacked(address(token0), address(token1)) mstore(token0ptr, keccak256(token0ptr, 40)) // Store POOL_INIT_CODE_HASH mstore(add(token0ptr, 32), uniswapV2PoolInitCodeHash) // Calculate keccak256(abi.encodePacked(hex'ff', address(factory_address), // keccak256(abi.encode(token0, // token1, fee)), POOL_INIT_CODE_HASH)); mstore(ptr, keccak256(ptr, 85)) // 21 + 32 + 32 // Load pool p := mload(ptr) // Get the first 20 bytes of the computed address poolAddress := and(p, 0xffffffffffffffffffffffffffffffffffffffff) //---------------------------------// //---------------------------------// // Transfer fromAmount of srcToken to poolAddress //---------------------------------// switch eq(payer, address()) // if payer is this contract, transfer fromAmount of srcToken to poolAddress case 1 { // Transfer fromAmount of srcToken to poolAddress mstore(ptr, 0xa9059cbb00000000000000000000000000000000000000000000000000000000) // store the // selector // (function transfer(address recipient, uint256 amount)) mstore(add(ptr, 4), poolAddress) // store the recipient mstore(add(ptr, 36), fromAmount) // store the amount pop(call(gas(), srcToken, 0, ptr, 68, 0, 32)) // call transfer } // othwerwise transferFrom fromAmount of srcToken to poolAddress from payer default { switch gt(permit2.length, 256) case 0 { // Transfer fromAmount of srcToken to poolAddress mstore(ptr, 0x23b872dd00000000000000000000000000000000000000000000000000000000) // store // the selector // (function transferFrom(address sender, address recipient, // uint256 amount)) mstore(add(ptr, 4), payer) // store the sender mstore(add(ptr, 36), poolAddress) // store the recipient mstore(add(ptr, 68), fromAmount) // store the amount pop(call(gas(), srcToken, 0, ptr, 100, 0, 32)) // call transferFrom } default { // Otherwise Permit2.permitTransferFrom // Store function selector mstore(ptr, 0x30f28b7a00000000000000000000000000000000000000000000000000000000) // permitTransferFrom() calldatacopy(add(ptr, 4), permit2.offset, permit2.length) // Copy data to memory mstore(add(ptr, 132), poolAddress) // Store recipient mstore(add(ptr, 164), fromAmount) // Store amount mstore(add(ptr, 196), payer) // Store payer // Call permit2.permitTransferFrom and revert if call failed if iszero(call(gas(), permit2Address, 0, ptr, add(permit2.length, 4), 0, 0)) { mstore(0, 0x6b836e6b00000000000000000000000000000000000000000000000000000000) // Store // error selector // error Permit2Failed() revert(0, 4) } } } //---------------------------------// } // Direction is the first bit of the pool data direction := and(1, calldataload(add(add(pools.offset, mul(i, 64)), 32))) //---------------------------------// // Calculate Amount Out //---------------------------------// //---------------------------------// // Get Reserves //---------------------------------// // Get free memory pointer let ptr := mload(64) // Store the selector mstore(ptr, 0x0902f1ac00000000000000000000000000000000000000000000000000000000) // 'getReserves()' // selector // Perform the external 'getReserves' call - outputs directly to ptr if iszero(staticcall(gas(), poolAddress, ptr, 4, ptr, 64)) { returndatacopy(0, 0, returndatasize()) // Copy the error message to the start of memory revert(0, returndatasize()) // Revert with the error message } // If direction is true, getReserves returns (reserve0, reserve1) // If direction is false, getReserves returns (reserve1, reserve0) -> swap the values // Load the reserve0 value returned by the 'getReserves' call. let reserve1 := mload(ptr) // Load the reserve1 value returned by the 'getReserves' call. let reserve0 := mload(add(ptr, 32)) // Check if direction is true if direction { // swap reserve0 and reserve1 let temp := reserve0 reserve0 := reserve1 reserve1 := temp } //---------------------------------// // Calculate amount based on fee let amountWithFee := mul(fromAmount, 9970) // Calculate numerator = amountWithFee * reserve1 let numerator := mul(amountWithFee, reserve1) // Calculate denominator = reserve0 * 10000 + amountWithFee let denominator := add(mul(reserve0, 10000), amountWithFee) // Calculate amountOut = numerator / denominator let amountOut := div(numerator, denominator) fromAmount := amountOut // if direction is true, amount0Out is 0 and amount1Out is fromAmount, // otherwise amount0Out is fromAmount and amount1Out is 0 let amount0Out := fromAmount let amount1Out := 0 // swap amount0Out and amount1Out if direction is false if direction { amount0Out := 0 amount1Out := fromAmount } //---------------------------------// // Adjust toAddress depending on if it is the last pool in the array let toAddress := address() // Check if it is not the last pool if lt(add(i, 1), poolCount) { //---------------------------------// // Calculate Next Pool Address //---------------------------------// // Store 0xff + factory address (right padded) mstore(ptr, uniswapV2FactoryAndFF) // Store pools offset + 21 bytes (UNISWAP_V2_FACTORY_AND_FF SIZE) let token0ptr := add(ptr, 21) // Copy next pool data to free memory pointer + 21 bytes (UNISWAP_V2_FACTORY_AND_FF SIZE) calldatacopy(token0ptr, add(pools.offset, mul(add(i, 1), 64)), 40) // Calculate keccak256(abi.encodePacked(address(token0), address(token1)) mstore(token0ptr, keccak256(token0ptr, 40)) // Store POOL_INIT_CODE_HASH mstore(add(token0ptr, 32), uniswapV2PoolInitCodeHash) // Calculate keccak256(abi.encodePacked(hex'ff', address(factory_address), // keccak256(abi.encode(token0, // token1), POOL_INIT_CODE_HASH)); mstore(ptr, keccak256(ptr, 85)) // 21 + 32 + 32 // Load pool p := mload(ptr) // Get the first 20 bytes of the computed address nextPoolAddress := and(p, 0xffffffffffffffffffffffffffffffffffffffff) // Adjust toAddress to next pool address toAddress := nextPoolAddress //---------------------------------// } //---------------------------------// // Perform Swap //---------------------------------// // Load the 'swap' selector, amount0Out, amount1Out, toAddress and data("") into memory. mstore(ptr, 0x022c0d9f00000000000000000000000000000000000000000000000000000000) // 'swap()' selector mstore(add(ptr, 4), amount0Out) // amount0Out mstore(add(ptr, 36), amount1Out) // amount1Out mstore(add(ptr, 68), toAddress) // toAddress mstore(add(ptr, 100), 0x80) // data length mstore(add(ptr, 132), 0) // data // Perform the external 'swap' call if iszero(call(gas(), poolAddress, 0, ptr, 164, 0, 64)) { // The call failed; we retrieve the exact error message and revert with it returndatacopy(0, 0, returndatasize()) // Copy the error message to the start of memory revert(0, returndatasize()) // Revert with the error message } //---------------------------------// // Set poolAddress to nextPoolAddress poolAddress := nextPoolAddress } //---------------------------------// } } } // SPDX-License-Identifier: MIT pragma solidity 0.8.22; // Contracts import { AugustusFees } from "../fees/AugustusFees.sol"; // Interfaces import { IUniswapV3SwapCallback } from "../interfaces/IUniswapV3SwapCallback.sol"; // Libraries import { SafeCastLib } from "@solady/utils/SafeCastLib.sol"; // Utils import { WETHUtils } from "./WETHUtils.sol"; import { Permit2Utils } from "./Permit2Utils.sol"; import { PauseUtils } from "./PauseUtils.sol"; /// @title UniswapV3Utils /// @notice A contract containing common utilities for UniswapV3 swaps abstract contract UniswapV3Utils is IUniswapV3SwapCallback, AugustusFees, WETHUtils, Permit2Utils, PauseUtils { /*////////////////////////////////////////////////////////////// LIBRARIES //////////////////////////////////////////////////////////////*/ using SafeCastLib for int256; /*////////////////////////////////////////////////////////////// ERRORS //////////////////////////////////////////////////////////////*/ /// @notice Error emitted if the caller is not a Uniswap V3 pool error InvalidCaller(); /// @notice Error emitted if the transfer of tokens to the pool inside the callback failed error CallbackTransferFailed(); /*////////////////////////////////////////////////////////////// CONSTANTS //////////////////////////////////////////////////////////////*/ /// @dev Used to caluclate pool address uint256 public immutable UNISWAP_V3_POOL_INIT_CODE_HASH; /// @dev Right padded FF + UniswapV3Factory address uint256 public immutable UNISWAP_V3_FACTORY_AND_FF; /*////////////////////////////////////////////////////////////// CONSTANTS //////////////////////////////////////////////////////////////*/ uint256 private constant UNISWAP_V3_MIN_SQRT = 4_295_128_740; uint256 private constant UNISWAP_V3_MAX_SQRT = 1_461_446_703_485_210_103_287_273_052_203_988_822_378_723_970_341; /*////////////////////////////////////////////////////////////// CONSTRUCTOR //////////////////////////////////////////////////////////////*/ constructor(uint256 _uniswapV3FactoryAndFF, uint256 _uniswapV3PoolInitCodeHash) { UNISWAP_V3_FACTORY_AND_FF = _uniswapV3FactoryAndFF; UNISWAP_V3_POOL_INIT_CODE_HASH = _uniswapV3PoolInitCodeHash; } /*////////////////////////////////////////////////////////////// EXTERNAL //////////////////////////////////////////////////////////////*/ // @inheritdoc IUniswapV3SwapCallback function uniswapV3SwapCallback( int256 amount0Delta, int256 amount1Delta, bytes calldata data ) external whenNotPaused { // Initialize variables uint256 uniswapV3FactoryAndFF = UNISWAP_V3_FACTORY_AND_FF; uint256 uniswapV3PoolInitCodeHash = UNISWAP_V3_POOL_INIT_CODE_HASH; address permit2Address = PERMIT2; address poolAddress; // 160 (single pool data) + 352 (permit2 length) bool isPermit2 = data.length == 512; // Check if the caller is a UniswapV3Pool deployed by the canonical UniswapV3Factory //solhint-disable-next-line no-inline-assembly assembly { // Pool address poolAddress := caller() // Get free memory pointer let ptr := mload(64) // We need make sure the caller is a UniswapV3Pool deployed by the canonical UniswapV3Factory // 1. Prepare data for calculating the pool address // Store ff+factory address, Load token0, token1, fee from bytes calldata and store pool init code hash // Store 0xff + factory address (right padded) mstore(ptr, uniswapV3FactoryAndFF) // Store data offset + 21 bytes (UNISWAP_V3_FACTORY_AND_FF SIZE) let token0Offset := add(ptr, 21) // Copy token0, token1, fee to free memory pointer + 21 bytes (UNISWAP_V3_FACTORY_AND_FF SIZE) + 1 byte // (direction) calldatacopy(add(token0Offset, 1), add(data.offset, 65), 95) // 2. Calculate the pool address // We can do this by first calling the keccak256 function on the fetched values and then // calculating keccak256(abi.encodePacked(hex'ff', address(factory_address), // keccak256(abi.encode(token0, // token1, fee)), POOL_INIT_CODE_HASH)); // The first 20 bytes of the computed address are the pool address // Calculate keccak256(abi.encode(address(token0), address(token1), fee)) mstore(token0Offset, keccak256(token0Offset, 96)) // Store POOL_INIT_CODE_HASH mstore(add(token0Offset, 32), uniswapV3PoolInitCodeHash) // Calculate keccak256(abi.encodePacked(hex'ff', address(factory_address), keccak256(abi.encode(token0, // token1, fee)), POOL_INIT_CODE_HASH)); mstore(ptr, keccak256(ptr, 85)) // 21 + 32 + 32 // Get the first 20 bytes of the computed address let computedAddress := and(mload(ptr), 0xffffffffffffffffffffffffffffffffffffffff) // Check if the caller matches the computed address (and revert if not) if xor(poolAddress, computedAddress) { mstore(0, 0x48f5c3ed00000000000000000000000000000000000000000000000000000000) // store the selector // (error InvalidCaller()) revert(0, 4) // revert with error selector } } // Check if data length is greater than 160 bytes (1 pool) // If the data length is greater than 160 bytes, we know that we are executing a multi-hop swapExactAmountOut // by recursively calling swapExactAmountOut on the next pool, until we reach the last pool in the data and // then we will transfer the tokens to the pool if (data.length > 160 && !isPermit2) { // Initialize recursive variables address payer; // solhint-disable-next-line no-inline-assembly assembly { // Copy payer address from calldata payer := calldataload(164) } // Recursive call swapExactAmountOut _callUniswapV3PoolsSwapExactAmountOut(amount0Delta > 0 ? -amount0Delta : -amount1Delta, data, payer); } else { // solhint-disable-next-line no-inline-assembly assembly { // Token to send to the pool let token // Amount to send to the pool let amount // Get free memory pointer let ptr := mload(64) // If the caller is the computed address, then we can safely assume that the caller is a UniswapV3Pool // deployed by the canonical UniswapV3Factory // 3. Transfer amount to the pool // Check if amount0Delta or amount1Delta is positive and which token we need to send to the pool if sgt(amount0Delta, 0) { // If amount0Delta is positive, we need to send amount0Delta token0 to the pool token := and(calldataload(add(data.offset, 64)), 0xffffffffffffffffffffffffffffffffffffffff) amount := amount0Delta } if sgt(amount1Delta, 0) { // If amount1Delta is positive, we need to send amount1Delta token1 to the pool token := calldataload(add(data.offset, 96)) amount := amount1Delta } // Based on the data passed to the callback, we know the fromAddress that will pay for the // swap, if it is this contract, we will execute the transfer() function, // otherwise, we will execute transferFrom() // Check if fromAddress is this contract let fromAddress := calldataload(164) switch eq(fromAddress, address()) // If fromAddress is this contract, execute transfer() case 1 { // Prepare external call data mstore(ptr, 0xa9059cbb00000000000000000000000000000000000000000000000000000000) // store the // selector // (function transfer(address recipient, uint256 amount)) mstore(add(ptr, 4), poolAddress) // store the recipient mstore(add(ptr, 36), amount) // store the amount let success := call(gas(), token, 0, ptr, 68, 0, 32) // call transfer if success { switch returndatasize() // check the return data size case 0 { success := gt(extcodesize(token), 0) } default { success := and(gt(returndatasize(), 31), eq(mload(0), 1)) } } if iszero(success) { mstore(0, 0x1bbb4abe00000000000000000000000000000000000000000000000000000000) // store the // selector // (error CallbackTransferFailed()) revert(0, 4) // revert with error selector } } // If fromAddress is not this contract, execute transferFrom() or permitTransferFrom() default { switch isPermit2 // If permit2 is not present, execute transferFrom() case 0 { mstore(ptr, 0x23b872dd00000000000000000000000000000000000000000000000000000000) // store the // selector // (function transferFrom(address sender, address recipient, // uint256 amount)) mstore(add(ptr, 4), fromAddress) // store the sender mstore(add(ptr, 36), poolAddress) // store the recipient mstore(add(ptr, 68), amount) // store the amount let success := call(gas(), token, 0, ptr, 100, 0, 32) // call transferFrom if success { switch returndatasize() // check the return data size case 0 { success := gt(extcodesize(token), 0) } default { success := and(gt(returndatasize(), 31), eq(mload(0), 1)) } } if iszero(success) { mstore(0, 0x1bbb4abe00000000000000000000000000000000000000000000000000000000) // store the // selector // (error CallbackTransferFailed()) revert(0, 4) // revert with error selector } } // If permit2 is present, execute permitTransferFrom() default { // Otherwise Permit2.permitTransferFrom // Store function selector mstore(ptr, 0x30f28b7a00000000000000000000000000000000000000000000000000000000) // permitTransferFrom() calldatacopy(add(ptr, 4), 292, 352) // Copy data to memory mstore(add(ptr, 132), poolAddress) // Store pool address as recipient mstore(add(ptr, 164), amount) // Store amount as amount mstore(add(ptr, 196), fromAddress) // Store payer // Call permit2.permitTransferFrom and revert if call failed if iszero(call(gas(), permit2Address, 0, ptr, 356, 0, 0)) { mstore(0, 0x6b836e6b00000000000000000000000000000000000000000000000000000000) // Store // error selector // error Permit2Failed() revert(0, 4) } } } } } } /*////////////////////////////////////////////////////////////// INTERNAL //////////////////////////////////////////////////////////////*/ /// @dev Loops through pools and performs swaps function _callUniswapV3PoolsSwapExactAmountIn( int256 fromAmount, bytes calldata pools, address fromAddress, bytes calldata permit2 ) internal returns (uint256 receivedAmount) { uint256 uniswapV3FactoryAndFF = UNISWAP_V3_FACTORY_AND_FF; uint256 uniswapV3PoolInitCodeHash = UNISWAP_V3_POOL_INIT_CODE_HASH; // solhint-disable-next-line no-inline-assembly assembly { //---------------------------------// // Loop Swap Through Pools //---------------------------------// // Calculate pool count let poolCount := div(pools.length, 96) // Initialize variables let p := 0 let poolAddress := 0 let nextPoolAddress := 0 let direction := 0 let isPermit2 := gt(permit2.length, 256) // Get free memory pointer let ptr := mload(64) // Loop through pools for { let i := 0 } lt(i, poolCount) { i := add(i, 1) } { // Check if it is the first pool if iszero(p) { //---------------------------------// // Calculate Pool Address //---------------------------------// // Calculate the pool address // We can do this by first calling the keccak256 function on the passed pool values and then // calculating keccak256(abi.encodePacked(hex'ff', address(factory_address), // keccak256(abi.encode(token0, // token1, fee)), POOL_INIT_CODE_HASH)); // The first 20 bytes of the computed address are the pool address // Store 0xff + factory address (right padded) mstore(ptr, uniswapV3FactoryAndFF) // Store pools offset + 21 bytes (UNISWAP_V3_FACTORY_AND_FF SIZE) let token0ptr := add(ptr, 21) // Copy pool data (skip first byte) to free memory pointer + 21 bytes (UNISWAP_V3_FACTORY_AND_FF // SIZE) calldatacopy(add(token0ptr, 1), add(pools.offset, 1), 95) // Calculate keccak256(abi.encode(address(token0), address(token1), fee)) mstore(token0ptr, keccak256(token0ptr, 96)) // Store POOL_INIT_CODE_HASH mstore(add(token0ptr, 32), uniswapV3PoolInitCodeHash) // Calculate keccak256(abi.encodePacked(hex'ff', address(factory_address), // keccak256(abi.encode(token0, // token1, fee)), POOL_INIT_CODE_HASH)); mstore(ptr, keccak256(ptr, 85)) // 21 + 32 + 32 // Load pool p := mload(ptr) // Get the first 20 bytes of the computed address poolAddress := and(p, 0xffffffffffffffffffffffffffffffffffffffff) //---------------------------------// } // Direction is the first bit of the pool data direction := shr(255, calldataload(add(pools.offset, mul(i, 96)))) // Check if it is not the last pool if lt(add(i, 1), poolCount) { //---------------------------------// // Calculate Next Pool Address //---------------------------------// // Store 0xff + factory address (right padded) mstore(ptr, uniswapV3FactoryAndFF) // Store pools offset + 21 bytes (UNISWAP_V3_FACTORY_AND_FF SIZE) let token0ptr := add(ptr, 21) // Copy next pool data to free memory pointer + 21 bytes (UNISWAP_V3_FACTORY_AND_FF SIZE) calldatacopy(add(token0ptr, 1), add(add(pools.offset, 1), mul(add(i, 1), 96)), 95) // Calculate keccak256(abi.encode(address(token0), address(token1), fee)) mstore(token0ptr, keccak256(token0ptr, 96)) // Store POOL_INIT_CODE_HASH mstore(add(token0ptr, 32), uniswapV3PoolInitCodeHash) // Calculate keccak256(abi.encodePacked(hex'ff', address(factory_address), // keccak256(abi.encode(token0, // token1, fee)), POOL_INIT_CODE_HASH)); mstore(ptr, keccak256(ptr, 85)) // 21 + 32 + 32 // Load pool p := mload(ptr) // Get the first 20 bytes of the computed address nextPoolAddress := and(p, 0xffffffffffffffffffffffffffffffffffffffff) //---------------------------------// } // Adjust fromAddress and fromAmount if it's not the first pool if gt(i, 0) { fromAddress := address() } //---------------------------------// // Perform Swap //---------------------------------// //---------------------------------// // Return based on direction //---------------------------------// // Initialize data length let dataLength := 0xa0 // Initialize total data length let totalDataLength := 356 // If permit2 is present include permit2 data length in total data length if eq(isPermit2, 1) { totalDataLength := add(totalDataLength, permit2.length) dataLength := add(dataLength, permit2.length) } // Return amount0 or amount1 depending on direction switch direction case 0 { // Prepare external call data // Store swap selector (0x128acb08) mstore(ptr, 0x128acb0800000000000000000000000000000000000000000000000000000000) // Store toAddress mstore(add(ptr, 4), address()) // Store direction mstore(add(ptr, 36), 0) // Store fromAmount mstore(add(ptr, 68), fromAmount) // Store sqrtPriceLimitX96 mstore(add(ptr, 100), UNISWAP_V3_MAX_SQRT) // Store data offset mstore(add(ptr, 132), 0xa0) /// Store data length mstore(add(ptr, 164), dataLength) // Store fromAddress mstore(add(ptr, 228), fromAddress) // Store token0, token1, fee calldatacopy(add(ptr, 260), add(pools.offset, mul(i, 96)), 96) // If permit2 is present, store permit2 data if eq(isPermit2, 1) { // Store permit2 data calldatacopy(add(ptr, 356), permit2.offset, permit2.length) } // Perform the external 'swap' call if iszero(call(gas(), poolAddress, 0, ptr, totalDataLength, ptr, 32)) { // store return value directly to free memory pointer // The call failed; we retrieve the exact error message and revert with it returndatacopy(0, 0, returndatasize()) // Copy the error message to the start of memory revert(0, returndatasize()) // Revert with the error message } // If direction is 0, return amount0 fromAmount := mload(ptr) } default { // Prepare external call data // Store swap selector (0x128acb08) mstore(ptr, 0x128acb0800000000000000000000000000000000000000000000000000000000) // Store toAddress mstore(add(ptr, 4), address()) // Store direction mstore(add(ptr, 36), 1) // Store fromAmount mstore(add(ptr, 68), fromAmount) // Store sqrtPriceLimitX96 mstore(add(ptr, 100), UNISWAP_V3_MIN_SQRT) // Store data offset mstore(add(ptr, 132), 0xa0) /// Store data length mstore(add(ptr, 164), dataLength) // Store fromAddress mstore(add(ptr, 228), fromAddress) // Store token0, token1, fee calldatacopy(add(ptr, 260), add(pools.offset, mul(i, 96)), 96) // If permit2 is present, store permit2 data if eq(isPermit2, 1) { // Store permit2 data calldatacopy(add(ptr, 356), permit2.offset, permit2.length) } // Perform the external 'swap' call if iszero(call(gas(), poolAddress, 0, ptr, totalDataLength, ptr, 64)) { // store return value directly to free memory pointer // The call failed; we retrieve the exact error message and revert with it returndatacopy(0, 0, returndatasize()) // Copy the error message to the start of memory revert(0, returndatasize()) // Revert with the error message } // If direction is 1, return amount1 fromAmount := mload(add(ptr, 32)) } //---------------------------------// //---------------------------------// // The next pool address was already calculated so we can set it as the current pool address for the // next iteration of the loop poolAddress := nextPoolAddress // fromAmount = -fromAmount fromAmount := sub(0, fromAmount) } //---------------------------------// } return fromAmount.toUint256(); } /// @dev Recursively loops through pools and performs swaps function _callUniswapV3PoolsSwapExactAmountOut( int256 fromAmount, bytes calldata pools, address fromAddress ) internal returns (uint256 spentAmount, uint256 receivedAmount) { uint256 uniswapV3FactoryAndFF = UNISWAP_V3_FACTORY_AND_FF; uint256 uniswapV3PoolInitCodeHash = UNISWAP_V3_POOL_INIT_CODE_HASH; // solhint-disable-next-line no-inline-assembly assembly { //---------------------------------// // Adjust data received from recursive call //---------------------------------// // Initialize variables let poolsStartOffset := pools.offset let poolsLength := pools.length let previousPoolAddress := 0 // Check if pools length is not divisible by 96 if gt(mod(pools.length, 96), 0) { // Check if pools length is greater than 128 bytes (1 pool) if gt(pools.length, 160) { // Get the previous pool address from the first 20 bytes of pool data previousPoolAddress := and(calldataload(pools.offset), 0xffffffffffffffffffffffffffffffffffffffff) // Relculate the offset to skip data poolsStartOffset := add(pools.offset, 160) // Recalculate the length to skip data poolsLength := sub(pools.length, 160) } } // Get free memory pointer let ptr := mload(64) //---------------------------------// // Calculate Pool Address //---------------------------------// // Calculate the pool address // We can do this by first calling the keccak256 function on the passed pool values and then // calculating keccak256(abi.encodePacked(hex'ff', address(factory_address), // keccak256(abi.encode(token0, // token1, fee)), POOL_INIT_CODE_HASH)); // The first 20 bytes of the computed address are the pool address // Store 0xff + factory address (right padded) mstore(ptr, uniswapV3FactoryAndFF) // Store pools offset + 21 bytes (UNISWAP_V3_FACTORY_AND_FF SIZE) let token0ptr := add(ptr, 21) // Copy pool data (skip first byte) to free memory pointer + 21 bytes (UNISWAP_V3_FACTORY_AND_FF // SIZE) calldatacopy(add(token0ptr, 1), add(poolsStartOffset, 1), 95) // Calculate keccak256(abi.encode(address(token0), address(token1), fee)) mstore(token0ptr, keccak256(token0ptr, 96)) // Store POOL_INIT_CODE_HASH mstore(add(token0ptr, 32), uniswapV3PoolInitCodeHash) // Calculate keccak256(abi.encodePacked(hex'ff', address(factory_address), // keccak256(abi.encode(token0, // token1, fee)), POOL_INIT_CODE_HASH)); mstore(ptr, keccak256(ptr, 85)) // 21 + 32 + 32 // Load pool let p := mload(ptr) // Get the first 20 bytes of the computed address let poolAddress := and(p, 0xffffffffffffffffffffffffffffffffffffffff) //---------------------------------// //---------------------------------// // Adjust toAddress //---------------------------------// let toAddress := address() // If it's not the first entry to recursion, we use the pool address from the previous pool as // the toAddress if xor(previousPoolAddress, 0) { toAddress := previousPoolAddress } //---------------------------------// // Direction is the first bit of the pool data let direction := shr(255, calldataload(poolsStartOffset)) //---------------------------------// // Perform Swap //---------------------------------// //---------------------------------// // Return based on direction //---------------------------------// // Return amount0 or amount1 depending on direction switch direction case 0 { // Prepare external call data // Store swap selector (0x128acb08) mstore(ptr, 0x128acb0800000000000000000000000000000000000000000000000000000000) // Store toAddress mstore(add(ptr, 4), toAddress) // Store direction mstore(add(ptr, 36), 0) // Store fromAmount mstore(add(ptr, 68), fromAmount) // Store sqrtPriceLimitX96 mstore(add(ptr, 100), UNISWAP_V3_MAX_SQRT) // Store data offset mstore(add(ptr, 132), 0xa0) /// Store data length mstore(add(ptr, 164), add(64, poolsLength)) // Store poolAddress mstore(add(ptr, 196), poolAddress) // Store fromAddress mstore(add(ptr, 228), fromAddress) // Store token0, token1, fee calldatacopy(add(ptr, 260), poolsStartOffset, poolsLength) // Perform the external 'swap' call if iszero(call(gas(), poolAddress, 0, ptr, add(poolsLength, 260), ptr, 64)) { // store return value directly to free memory pointer // The call failed; we retrieve the exact error message and revert with it returndatacopy(0, 0, returndatasize()) // Copy the error message to the start of memory revert(0, returndatasize()) // Revert with the error message } // If direction is 0, return amount0 as fromAmount fromAmount := mload(ptr) // return amount1 as spentAmount spentAmount := mload(add(ptr, 32)) } default { // Prepare external call data // Store swap selector (0x128acb08) mstore(ptr, 0x128acb0800000000000000000000000000000000000000000000000000000000) // Store toAddress mstore(add(ptr, 4), toAddress) // Store direction mstore(add(ptr, 36), 1) // Store fromAmount mstore(add(ptr, 68), fromAmount) // Store sqrtPriceLimitX96 mstore(add(ptr, 100), UNISWAP_V3_MIN_SQRT) // Store data offset mstore(add(ptr, 132), 0xa0) /// Store data length mstore(add(ptr, 164), add(64, poolsLength)) // Store poolAddress mstore(add(ptr, 196), poolAddress) // Store fromAddress mstore(add(ptr, 228), fromAddress) // Store token0, token1, fee calldatacopy(add(ptr, 260), poolsStartOffset, poolsLength) // Perform the external 'swap' call if iszero(call(gas(), poolAddress, 0, ptr, add(poolsLength, 260), ptr, 64)) { // store return value directly to free memory pointer // The call failed; we retrieve the exact error message and revert with it returndatacopy(0, 0, returndatasize()) // Copy the error message to the start of memory revert(0, returndatasize()) // Revert with the error message } // If direction is 1, return amount1 as fromAmount fromAmount := mload(add(ptr, 32)) // return amount0 as spentAmount spentAmount := mload(ptr) } //---------------------------------// //---------------------------------// // fromAmount = -fromAmount fromAmount := sub(0, fromAmount) } return (spentAmount, fromAmount.toUint256()); } } // SPDX-License-Identifier: MIT pragma solidity 0.8.22; // Interfaces import { IWETH } from "../interfaces/IWETH.sol"; /// @title WETHUtils /// @notice A contract containing common utilities for WETH abstract contract WETHUtils { /*////////////////////////////////////////////////////////////// CONSTANTS //////////////////////////////////////////////////////////////*/ /// @dev WETH address IWETH public immutable WETH; /*////////////////////////////////////////////////////////////// CONSTRUCTOR //////////////////////////////////////////////////////////////*/ constructor(address _weth) { WETH = IWETH(_weth); } } // SPDX-License-Identifier: MIT pragma solidity 0.8.22; /// @title Permit2Utils /// @notice A contract containing common utilities for Permit2 abstract contract Permit2Utils { /*////////////////////////////////////////////////////////////// ERRORS //////////////////////////////////////////////////////////////*/ error Permit2Failed(); /*////////////////////////////////////////////////////////////// CONSTANTS //////////////////////////////////////////////////////////////*/ /// @dev Permit2 address address public immutable PERMIT2; // solhint-disable-line var-name-mixedcase /*////////////////////////////////////////////////////////////// CONSTRUCTOR //////////////////////////////////////////////////////////////*/ constructor(address _permit2) { PERMIT2 = _permit2; } /*////////////////////////////////////////////////////////////// INTERNAL //////////////////////////////////////////////////////////////*/ /// @dev Parses data and executes permit2.permitTransferFrom, reverts if it fails function permit2TransferFrom(bytes calldata data, address recipient, uint256 amount) internal { address targetAddress = PERMIT2; // solhint-disable-next-line no-inline-assembly assembly { // Get free memory pointer let ptr := mload(64) // Store function selector mstore(ptr, 0x30f28b7a00000000000000000000000000000000000000000000000000000000) // permitTransferFrom() // Copy data to memory calldatacopy(add(ptr, 4), data.offset, data.length) // Store recipient mstore(add(ptr, 132), recipient) // Store amount mstore(add(ptr, 164), amount) // Store owner mstore(add(ptr, 196), caller()) // Call permit2.permitTransferFrom and revert if call failed if iszero(call(gas(), targetAddress, 0, ptr, add(data.length, 4), 0, 0)) { mstore(0, 0x6b836e6b00000000000000000000000000000000000000000000000000000000) // Store error selector // error Permit2Failed() revert(0, 4) } } } } // SPDX-License-Identifier: MIT // OpenZeppelin Contracts (last updated v5.0.0) (token/ERC20/IERC20.sol) pragma solidity ^0.8.20; /** * @dev Interface of the ERC20 standard as defined in the EIP. */ 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); } // SPDX-License-Identifier: MIT pragma solidity 0.8.22; // Interfaces import { IErrors } from "./IErrors.sol"; // Types import { BalancerV2Data } from "../AugustusV6Types.sol"; /// @title IBalancerV2SwapExactAmountIn /// @notice Interface for executing swapExactAmountIn directly on Balancer V2 pools interface IBalancerV2SwapExactAmountIn is IErrors { /*////////////////////////////////////////////////////////////// SWAP EXACT AMOUNT IN //////////////////////////////////////////////////////////////*/ /// @notice Executes a swapExactAmountIn on Balancer V2 pools /// @param balancerData Struct containing data for the swap /// @param partnerAndFee packed partner address and fee percentage, the first 12 bytes is the feeData and the last /// 20 bytes is the partner address /// @param permit Permit data for the swap /// @param data The calldata to execute /// the first 20 bytes are the beneficiary address and the left most bit is the approve flag /// @return receivedAmount The amount of destToken received after fees /// @return paraswapShare The share of the fees for Paraswap /// @return partnerShare The share of the fees for the partner function swapExactAmountInOnBalancerV2( BalancerV2Data calldata balancerData, uint256 partnerAndFee, bytes calldata permit, bytes calldata data ) external payable returns (uint256 receivedAmount, uint256 paraswapShare, uint256 partnerShare); } // SPDX-License-Identifier: MIT pragma solidity 0.8.22; // Interfaces import { IERC20 } from "@openzeppelin/token/ERC20/IERC20.sol"; /// @title ERC20Utils /// @notice Optimized functions for ERC20 tokens library ERC20Utils { /*////////////////////////////////////////////////////////////// ERRORS //////////////////////////////////////////////////////////////*/ error IncorrectEthAmount(); error PermitFailed(); error TransferFromFailed(); error TransferFailed(); error ApprovalFailed(); /*////////////////////////////////////////////////////////////// CONSTANTS //////////////////////////////////////////////////////////////*/ IERC20 internal constant ETH = IERC20(0xEeeeeEeeeEeEeeEeEeEeeEEEeeeeEeeeeeeeEEeE); /*////////////////////////////////////////////////////////////// APPROVE //////////////////////////////////////////////////////////////*/ /// @dev Vendored from Solady by @vectorized - SafeTransferLib.approveWithRetry /// https://github.com/Vectorized/solady/src/utils/SafeTransferLib.sol#L325 /// Instead of approving a specific amount, this function approves for uint256(-1) (type(uint256).max). function approve(IERC20 token, address to) internal { // solhint-disable-next-line no-inline-assembly assembly ("memory-safe") { mstore(0x14, to) // Store the `to` argument. mstore(0x34, 0xffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffff) // Store the `amount` // argument (type(uint256).max). mstore(0x00, 0x095ea7b3000000000000000000000000) // `approve(address,uint256)`. // Perform the approval, retrying upon failure. if iszero( and( // The arguments of `and` are evaluated from right to left. or(eq(mload(0x00), 1), iszero(returndatasize())), // Returned 1 or nothing. call(gas(), token, 0, 0x10, 0x44, 0x00, 0x20) ) ) { mstore(0x34, 0) // Store 0 for the `amount`. mstore(0x00, 0x095ea7b3000000000000000000000000) // `approve(address,uint256)`. pop(call(gas(), token, 0, 0x10, 0x44, codesize(), 0x00)) // Reset the approval. mstore(0x34, 0xffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffff) // Store // type(uint256).max for the `amount`. // Retry the approval, reverting upon failure. if iszero( and( or(eq(mload(0x00), 1), iszero(returndatasize())), // Returned 1 or nothing. call(gas(), token, 0, 0x10, 0x44, 0x00, 0x20) ) ) { mstore(0, 0x8164f84200000000000000000000000000000000000000000000000000000000) // store the selector (error ApprovalFailed()) revert(0, 4) // revert with error selector } } mstore(0x34, 0) // Restore the part of the free memory pointer that was overwritten. } } /*////////////////////////////////////////////////////////////// PERMIT //////////////////////////////////////////////////////////////*/ /// @dev Executes an ERC20 permit and reverts if invalid length is provided function permit(IERC20 token, bytes calldata data) internal { // solhint-disable-next-line no-inline-assembly assembly ("memory-safe") { // check the permit length switch data.length // 32 * 7 = 224 EIP2612 Permit case 224 { let x := mload(64) // get the free memory pointer mstore(x, 0xd505accf00000000000000000000000000000000000000000000000000000000) // store the selector // function permit(address owner, address spender, uint256 // amount, uint256 deadline, uint8 v, bytes32 r, bytes32 s) calldatacopy(add(x, 4), data.offset, 224) // store the args pop(call(gas(), token, 0, x, 228, 0, 32)) // call ERC20 permit, skip checking return data } // 32 * 8 = 256 DAI-Style Permit case 256 { let x := mload(64) // get the free memory pointer mstore(x, 0x8fcbaf0c00000000000000000000000000000000000000000000000000000000) // store the selector // function permit(address holder, address spender, uint256 // nonce, uint256 expiry, bool allowed, uint8 v, bytes32 r, bytes32 s) calldatacopy(add(x, 4), data.offset, 256) // store the args pop(call(gas(), token, 0, x, 260, 0, 32)) // call ERC20 permit, skip checking return data } default { mstore(0, 0xb78cb0dd00000000000000000000000000000000000000000000000000000000) // store the selector // (error PermitFailed()) revert(0, 4) } } } /*////////////////////////////////////////////////////////////// ETH //////////////////////////////////////////////////////////////*/ /// @dev Returns 1 if the token is ETH, 0 if not ETH function isETH(IERC20 token, uint256 amount) internal view returns (uint256 fromETH) { // solhint-disable-next-line no-inline-assembly assembly ("memory-safe") { // If token is ETH if eq(token, 0xEeeeeEeeeEeEeeEeEeEeeEEEeeeeEeeeeeeeEEeE) { // if msg.value is not equal to fromAmount, then revert if xor(amount, callvalue()) { mstore(0, 0x8b6ebb4d00000000000000000000000000000000000000000000000000000000) // store the selector // (error IncorrectEthAmount()) revert(0, 4) // revert with error selector } // return 1 if ETH fromETH := 1 } // If token is not ETH if xor(token, 0xEeeeeEeeeEeEeeEeEeEeeEEEeeeeEeeeeeeeEEeE) { // if msg.value is not equal to 0, then revert if gt(callvalue(), 0) { mstore(0, 0x8b6ebb4d00000000000000000000000000000000000000000000000000000000) // store the selector // (error IncorrectEthAmount()) revert(0, 4) // revert with error selector } } } // return 0 if not ETH } /*////////////////////////////////////////////////////////////// TRANSFER //////////////////////////////////////////////////////////////*/ /// @dev Executes transfer and reverts if it fails, works for both ETH and ERC20 transfers function safeTransfer(IERC20 token, address recipient, uint256 amount) internal returns (bool success) { // solhint-disable-next-line no-inline-assembly assembly { switch eq(token, 0xEeeeeEeeeEeEeeEeEeEeeEEEeeeeEeeeeeeeEEeE) // ETH case 1 { // transfer ETH // Cap gas at 10000 to avoid reentrancy success := call(10000, recipient, amount, 0, 0, 0, 0) } // ERC20 default { let x := mload(64) // get the free memory pointer mstore(x, 0xa9059cbb00000000000000000000000000000000000000000000000000000000) // store the selector // (function transfer(address recipient, uint256 amount)) mstore(add(x, 4), recipient) // store the recipient mstore(add(x, 36), amount) // store the amount success := call(gas(), token, 0, x, 68, 0, 32) // call transfer if success { switch returndatasize() // check the return data size case 0 { success := gt(extcodesize(token), 0) } default { success := and(gt(returndatasize(), 31), eq(mload(0), 1)) } } } if iszero(success) { mstore(0, 0x90b8ec1800000000000000000000000000000000000000000000000000000000) // store the selector // (error TransferFailed()) revert(0, 4) // revert with error selector } } } /*////////////////////////////////////////////////////////////// TRANSFER FROM //////////////////////////////////////////////////////////////*/ /// @dev Executes transferFrom and reverts if it fails function safeTransferFrom( IERC20 srcToken, address sender, address recipient, uint256 amount ) internal returns (bool success) { // solhint-disable-next-line no-inline-assembly assembly { let x := mload(64) // get the free memory pointer mstore(x, 0x23b872dd00000000000000000000000000000000000000000000000000000000) // store the selector // (function transferFrom(address sender, address recipient, // uint256 amount)) mstore(add(x, 4), sender) // store the sender mstore(add(x, 36), recipient) // store the recipient mstore(add(x, 68), amount) // store the amount success := call(gas(), srcToken, 0, x, 100, 0, 32) // call transferFrom if success { switch returndatasize() // check the return data size case 0 { success := gt(extcodesize(srcToken), 0) } default { success := and(gt(returndatasize(), 31), eq(mload(0), 1)) } } if iszero(success) { mstore(x, 0x7939f42400000000000000000000000000000000000000000000000000000000) // store the selector // (error TransferFromFailed()) revert(x, 4) // revert with error selector } } } /*////////////////////////////////////////////////////////////// BALANCE //////////////////////////////////////////////////////////////*/ /// @dev Returns the balance of an account, works for both ETH and ERC20 tokens function getBalance(IERC20 token, address account) internal view returns (uint256 balanceOf) { // solhint-disable-next-line no-inline-assembly assembly { switch eq(token, 0xEeeeeEeeeEeEeeEeEeEeeEEEeeeeEeeeeeeeEEeE) // ETH case 1 { balanceOf := balance(account) } // ERC20 default { let x := mload(64) // get the free memory pointer mstore(x, 0x70a0823100000000000000000000000000000000000000000000000000000000) // store the selector // (function balanceOf(address account)) mstore(add(x, 4), account) // store the account let success := staticcall(gas(), token, x, 36, x, 32) // call balanceOf if success { balanceOf := mload(x) } // load the balance } } } } // SPDX-License-Identifier: MIT pragma solidity 0.8.22; // Interfaces import { IERC20 } from "@openzeppelin/token/ERC20/IERC20.sol"; /*////////////////////////////////////////////////////////////// GENERIC SWAP DATA //////////////////////////////////////////////////////////////*/ /// @notice Struct containg data for generic swapExactAmountIn/swapExactAmountOut /// @param srcToken The token to swap from /// @param destToken The token to swap to /// @param fromAmount The amount of srcToken to swap /// = amountIn for swapExactAmountIn and maxAmountIn for swapExactAmountOut /// @param toAmount The minimum amount of destToken to receive /// = minAmountOut for swapExactAmountIn and amountOut for swapExactAmountOut /// @param quotedAmount The quoted expected amount of destToken/srcToken /// = quotedAmountOut for swapExactAmountIn and quotedAmountIn for swapExactAmountOut /// @param metadata Packed uuid and additional metadata /// @param beneficiary The address to send the swapped tokens to struct GenericData { IERC20 srcToken; IERC20 destToken; uint256 fromAmount; uint256 toAmount; uint256 quotedAmount; bytes32 metadata; address payable beneficiary; } /*////////////////////////////////////////////////////////////// UNISWAPV2 //////////////////////////////////////////////////////////////*/ /// @notice Struct for UniswapV2 swapExactAmountIn/swapExactAmountOut data /// @param srcToken The token to swap from /// @param destToken The token to swap to /// @param fromAmount The amount of srcToken to swap /// = amountIn for swapExactAmountIn and maxAmountIn for swapExactAmountOut /// @param quotedAmount The quoted expected amount of destToken/srcToken /// = quotedAmountOut for swapExactAmountIn and quotedAmountIn for swapExactAmountOut /// @param toAmount The minimum amount of destToken to receive /// = minAmountOut for swapExactAmountIn and amountOut for swapExactAmountOut /// @param metadata Packed uuid and additional metadata /// @param beneficiary The address to send the swapped tokens to /// @param pools data consisting of concatenated token0 and token1 address for each pool with the direction flag being /// the right most bit of the packed token0-token1 pair bytes used in the path struct UniswapV2Data { IERC20 srcToken; IERC20 destToken; uint256 fromAmount; uint256 toAmount; uint256 quotedAmount; bytes32 metadata; address payable beneficiary; bytes pools; } /*////////////////////////////////////////////////////////////// UNISWAPV3 //////////////////////////////////////////////////////////////*/ /// @notice Struct for UniswapV3 swapExactAmountIn/swapExactAmountOut data /// @param srcToken The token to swap from /// @param destToken The token to swap to /// @param fromAmount The amount of srcToken to swap /// = amountIn for swapExactAmountIn and maxAmountIn for swapExactAmountOut /// @param quotedAmount The quoted expected amount of destToken/srcToken /// = quotedAmountOut for swapExactAmountIn and quotedAmountIn for swapExactAmountOut /// @param toAmount The minimum amount of destToken to receive /// = minAmountOut for swapExactAmountIn and amountOut for swapExactAmountOut /// @param metadata Packed uuid and additional metadata /// @param beneficiary The address to send the swapped tokens to /// @param pools data consisting of concatenated token0- /// token1-fee bytes for each pool used in the path, with the direction flag being the left most bit of token0 in the /// concatenated bytes struct UniswapV3Data { IERC20 srcToken; IERC20 destToken; uint256 fromAmount; uint256 toAmount; uint256 quotedAmount; bytes32 metadata; address payable beneficiary; bytes pools; } /*////////////////////////////////////////////////////////////// CURVE V1 //////////////////////////////////////////////////////////////*/ /// @notice Struct for CurveV1 swapExactAmountIn data /// @param curveData Packed data for the Curve pool, first 160 bits is the target exchange address, /// the 161st bit is the approve flag, bits from (162 - 163) are used for the wrap flag, //// bits from (164 - 165) are used for the swapType flag and the last 91 bits are unused: /// Approve Flag - a) 0 -> do not approve b) 1 -> approve /// Wrap Flag - a) 0 -> do not wrap b) 1 -> wrap native & srcToken == eth /// c) 2 -> unwrap and destToken == eth d) 3 - >srcToken == eth && do not wrap /// Swap Type Flag - a) 0 -> EXCHANGE b) 1 -> EXCHANGE_UNDERLYING /// @param curveAssets Packed uint128 index i and uint128 index j of the pool /// The first 128 bits is the index i and the second 128 bits is the index j /// @param srcToken The token to swap from /// @param destToken The token to swap to /// @param fromAmount The amount of srcToken to swap /// = amountIn for swapExactAmountIn and maxAmountIn for swapExactAmountOut /// @param toAmount The minimum amount that must be recieved /// = minAmountOut for swapExactAmountIn and amountOut for swapExactAmountOut /// @param quotedAmount The expected amount of destToken to be recieved /// = quotedAmountOut for swapExactAmountIn and quotedAmountIn for swapExactAmountOut /// @param metadata Packed uuid and additional metadata /// @param beneficiary The address to send the swapped tokens to struct CurveV1Data { uint256 curveData; uint256 curveAssets; IERC20 srcToken; IERC20 destToken; uint256 fromAmount; uint256 toAmount; uint256 quotedAmount; bytes32 metadata; address payable beneficiary; } /*////////////////////////////////////////////////////////////// CURVE V2 //////////////////////////////////////////////////////////////*/ /// @notice Struct for CurveV2 swapExactAmountIn data /// @param curveData Packed data for the Curve pool, first 160 bits is the target exchange address, /// the 161st bit is the approve flag, bits from (162 - 163) are used for the wrap flag, //// bits from (164 - 165) are used for the swapType flag and the last 91 bits are unused /// Approve Flag - a) 0 -> do not approve b) 1 -> approve /// Approve Flag - a) 0 -> do not approve b) 1 -> approve /// Wrap Flag - a) 0 -> do not wrap b) 1 -> wrap native & srcToken == eth /// c) 2 -> unwrap and destToken == eth d) 3 - >srcToken == eth && do not wrap /// Swap Type Flag - a) 0 -> EXCHANGE b) 1 -> EXCHANGE_UNDERLYING c) 2 -> EXCHANGE_UNDERLYING_FACTORY_ZAP /// @param i The index of the srcToken /// @param j The index of the destToken /// The first 128 bits is the index i and the second 128 bits is the index j /// @param poolAddress The address of the CurveV2 pool (only used for EXCHANGE_UNDERLYING_FACTORY_ZAP) /// @param srcToken The token to swap from /// @param destToken The token to swap to /// @param fromAmount The amount of srcToken to swap /// = amountIn for swapExactAmountIn and maxAmountIn for swapExactAmountOut /// @param toAmount The minimum amount that must be recieved /// = minAmountOut for swapExactAmountIn and amountOut for swapExactAmountOut /// @param quotedAmount The expected amount of destToken to be recieved /// = quotedAmountOut for swapExactAmountIn and quotedAmountIn for swapExactAmountOut /// @param metadata Packed uuid and additional metadata /// @param beneficiary The address to send the swapped tokens to struct CurveV2Data { uint256 curveData; uint256 i; uint256 j; address poolAddress; IERC20 srcToken; IERC20 destToken; uint256 fromAmount; uint256 toAmount; uint256 quotedAmount; bytes32 metadata; address payable beneficiary; } /*////////////////////////////////////////////////////////////// BALANCER V2 //////////////////////////////////////////////////////////////*/ /// @notice Struct for BalancerV2 swapExactAmountIn data /// @param fromAmount The amount of srcToken to swap /// = amountIn for swapExactAmountIn and maxAmountIn for swapExactAmountOut /// @param toAmount The minimum amount of destToken to receive /// = minAmountOut for swapExactAmountIn and amountOut for swapExactAmountOut /// @param quotedAmount The quoted expected amount of destToken/srcToken /// = quotedAmountOut for swapExactAmountIn and quotedAmountIn for swapExactAmountOut /// @param metadata Packed uuid and additional metadata /// @param beneficiaryAndApproveFlag The beneficiary address and approve flag packed into one uint256, /// the first 20 bytes are the beneficiary address and the left most bit is the approve flag struct BalancerV2Data { uint256 fromAmount; uint256 toAmount; uint256 quotedAmount; bytes32 metadata; uint256 beneficiaryAndApproveFlag; } /*////////////////////////////////////////////////////////////// MAKERPSM //////////////////////////////////////////////////////////////*/ /// @notice Struct for Maker PSM swapExactAmountIn data /// @param srcToken The token to swap from /// @param destToken The token to swap to /// @param fromAmount The amount of srcToken to swap /// = amountIn for swapExactAmountIn and maxAmountIn for swapExactAmountOut /// @param toAmount The minimum amount of destToken to receive /// = minAmountOut for swapExactAmountIn and amountOut for swapExactAmountOut /// @param toll Used to calculate gem amount for the swapExactAmountIn /// @param to18ConversionFactor Used to calculate gem amount for the swapExactAmountIn /// @param gemJoinAddress The address of the gemJoin contract /// @param exchange The address of the exchange contract /// @param metadata Packed uuid and additional metadata /// @param beneficiaryDirectionApproveFlag The beneficiary address, swap direction and approve flag packed /// into one uint256, the first 20 bytes are the beneficiary address, the left most bit is the approve flag and the /// second left most bit is the swap direction flag, 0 for swapExactAmountIn and 1 for swapExactAmountOut struct MakerPSMData { IERC20 srcToken; IERC20 destToken; uint256 fromAmount; uint256 toAmount; uint256 toll; uint256 to18ConversionFactor; address exchange; address gemJoinAddress; bytes32 metadata; uint256 beneficiaryDirectionApproveFlag; } /*////////////////////////////////////////////////////////////// AUGUSTUS RFQ //////////////////////////////////////////////////////////////*/ /// @notice Order struct for Augustus RFQ /// @param nonceAndMeta The nonce and meta data packed into one uint256, /// the first 160 bits is the user address and the last 96 bits is the nonce /// @param expiry The expiry of the order /// @param makerAsset The address of the maker asset /// @param takerAsset The address of the taker asset /// @param maker The address of the maker /// @param taker The address of the taker, if the taker is address(0) anyone can take the order /// @param makerAmount The amount of makerAsset /// @param takerAmount The amount of takerAsset struct Order { uint256 nonceAndMeta; uint128 expiry; address makerAsset; address takerAsset; address maker; address taker; uint256 makerAmount; uint256 takerAmount; } /// @notice Struct containing order info for Augustus RFQ /// @param order The order struct /// @param signature The signature for the order /// @param takerTokenFillAmount The amount of takerToken to fill /// @param permitTakerAsset The permit data for the taker asset /// @param permitMakerAsset The permit data for the maker asset struct OrderInfo { Order order; bytes signature; uint256 takerTokenFillAmount; bytes permitTakerAsset; bytes permitMakerAsset; } /// @notice Struct containing common data for executing swaps on Augustus RFQ /// @param fromAmount The amount of srcToken to swap /// = amountIn for swapExactAmountIn and maxAmountIn for swapExactAmountOut /// @param toAmount The minimum amount of destToken to receive /// = minAmountOut for swapExactAmountIn and amountOut for swapExactAmountOut /// @param wrapApproveDirection The wrap, approve and direction flag packed into one uint8, /// the first 2 bits is wrap flag (10 for wrap dest, 01 for wrap src, 00 for no wrap), the next bit is the approve flag /// (1 for approve, 0 for no approve) and the last bit is the direction flag (0 for swapExactAmountIn and 1 for /// swapExactAmountOut) /// @param metadata Packed uuid and additional metadata struct AugustusRFQData { uint256 fromAmount; uint256 toAmount; uint8 wrapApproveDirection; bytes32 metadata; address payable beneficiary; } // SPDX-License-Identifier: MIT pragma solidity 0.8.22; // Interfaces import { IErrors } from "./IErrors.sol"; // Types import { CurveV1Data } from "../AugustusV6Types.sol"; /// @title ICurveV1SwapExactAmountIn /// @notice Interface for direct swaps on Curve V1 interface ICurveV1SwapExactAmountIn is IErrors { /*////////////////////////////////////////////////////////////// SWAP EXACT AMOUNT IN //////////////////////////////////////////////////////////////*/ /// @notice Executes a swapExactAmountIn on Curve V1 pools /// @param curveV1Data Struct containing data for the swap /// @param partnerAndFee packed partner address and fee percentage, the first 12 bytes is the feeData and the last /// 20 bytes is the partner address /// @param permit Permit data for the swap /// @return receivedAmount The amount of destToken received after fees /// @return paraswapShare The share of the fees for Paraswap /// @return partnerShare The share of the fees for the partner function swapExactAmountInOnCurveV1( CurveV1Data calldata curveV1Data, uint256 partnerAndFee, bytes calldata permit ) external payable returns (uint256 receivedAmount, uint256 paraswapShare, uint256 partnerShare); } // SPDX-License-Identifier: MIT pragma solidity 0.8.22; // Storage import { AugustusStorage } from "../storage/AugustusStorage.sol"; /// @title PauseUtils /// @notice Provides a modifier to check if the contract is paused abstract contract PauseUtils is AugustusStorage { /*////////////////////////////////////////////////////////////// ERRORS //////////////////////////////////////////////////////////////*/ /// @notice Error emitted when the contract is paused error ContractPaused(); /*////////////////////////////////////////////////////////////// MODIFIERS //////////////////////////////////////////////////////////////*/ // Check if the contract is paused, if it is, revert modifier whenNotPaused() { if (paused) { revert ContractPaused(); } _; } } // SPDX-License-Identifier: MIT pragma solidity 0.8.22; // Interfaces import { IErrors } from "./IErrors.sol"; // Types import { CurveV2Data } from "../AugustusV6Types.sol"; /// @title ICurveV2SwapExactAmountIn /// @notice Interface for direct swaps on Curve V2 interface ICurveV2SwapExactAmountIn is IErrors { /*////////////////////////////////////////////////////////////// SWAP EXACT AMOUNT IN //////////////////////////////////////////////////////////////*/ /// @notice Executes a swapExactAmountIn on Curve V2 pools /// @param curveV2Data Struct containing data for the swap /// @param partnerAndFee packed partner address and fee percentage, the first 12 bytes is the feeData and the last /// 20 bytes is the partner address /// @param permit Permit data for the swap /// @return receivedAmount The amount of destToken received after fees /// @return paraswapShare The share of the fees for Paraswap /// @return partnerShare The share of the fees for the partner function swapExactAmountInOnCurveV2( CurveV2Data calldata curveV2Data, uint256 partnerAndFee, bytes calldata permit ) external payable returns (uint256 receivedAmount, uint256 paraswapShare, uint256 partnerShare); } // SPDX-License-Identifier: MIT pragma solidity 0.8.22; // Interfaces import { IErrors } from "./IErrors.sol"; // Types import { UniswapV2Data } from "../AugustusV6Types.sol"; /// @title IUniswapV2SwapExactAmountIn /// @notice Interface for direct swaps on Uniswap V2 interface IUniswapV2SwapExactAmountIn is IErrors { /*////////////////////////////////////////////////////////////// SWAP EXACT AMOUNT OUT //////////////////////////////////////////////////////////////*/ /// @notice Executes a swapExactAmountIn on Uniswap V2 pools /// @param uniData struct containing data for the swap /// @param partnerAndFee packed partner address and fee percentage, the first 12 bytes is the feeData and the last /// 20 bytes is the partner address /// @param permit The permit data /// @return receivedAmount The amount of destToken received after fees /// @return paraswapShare The share of the fees for Paraswap /// @return partnerShare The share of the fees for the partner function swapExactAmountInOnUniswapV2( UniswapV2Data calldata uniData, uint256 partnerAndFee, bytes calldata permit ) external payable returns (uint256 receivedAmount, uint256 paraswapShare, uint256 partnerShare); } // SPDX-License-Identifier: MIT pragma solidity 0.8.22; // Interfaces import { IErrors } from "./IErrors.sol"; // Types import { UniswapV3Data } from "../AugustusV6Types.sol"; /// @title IUniswapV3SwapExactAmountIn /// @notice Interface for executing direct swapExactAmountIn on Uniswap V3 interface IUniswapV3SwapExactAmountIn is IErrors { /*////////////////////////////////////////////////////////////// SWAP EXACT AMOUNT IN //////////////////////////////////////////////////////////////*/ /// @notice Executes a swapExactAmountIn on Uniswap V3 pools /// @param uniData struct containing data for the swap /// @param partnerAndFee packed partner address and fee percentage, the first 12 bytes is the feeData and the last /// 20 bytes is the partner address /// @param permit The permit data /// @return receivedAmount The amount of destToken received after fees /// @return paraswapShare The share of the fees for Paraswap /// @return partnerShare The share of the fees for the partner function swapExactAmountInOnUniswapV3( UniswapV3Data calldata uniData, uint256 partnerAndFee, bytes calldata permit ) external payable returns (uint256 receivedAmount, uint256 paraswapShare, uint256 partnerShare); } // SPDX-License-Identifier: MIT pragma solidity ^0.8.4; /// @notice Safe integer casting library that reverts on overflow. /// @author Solady (https://github.com/vectorized/solady/blob/main/src/utils/SafeCastLib.sol) /// @author Modified from OpenZeppelin (https://github.com/OpenZeppelin/openzeppelin-contracts/blob/master/contracts/utils/math/SafeCast.sol) library SafeCastLib { /*´:°•.°+.*•´.*:˚.°*.˚•´.°:°•.°•.*•´.*:˚.°*.˚•´.°:°•.°+.*•´.*:*/ /* CUSTOM ERRORS */ /*.•°:°.´+˚.*°.˚:*.´•*.+°.•°:´*.´•*.•°.•°:°.´:•˚°.*°.˚:*.´+°.•*/ error Overflow(); /*´:°•.°+.*•´.*:˚.°*.˚•´.°:°•.°•.*•´.*:˚.°*.˚•´.°:°•.°+.*•´.*:*/ /* UNSIGNED INTEGER SAFE CASTING OPERATIONS */ /*.•°:°.´+˚.*°.˚:*.´•*.+°.•°:´*.´•*.•°.•°:°.´:•˚°.*°.˚:*.´+°.•*/ function toUint8(uint256 x) internal pure returns (uint8) { if (x >= 1 << 8) _revertOverflow(); return uint8(x); } function toUint16(uint256 x) internal pure returns (uint16) { if (x >= 1 << 16) _revertOverflow(); return uint16(x); } function toUint24(uint256 x) internal pure returns (uint24) { if (x >= 1 << 24) _revertOverflow(); return uint24(x); } function toUint32(uint256 x) internal pure returns (uint32) { if (x >= 1 << 32) _revertOverflow(); return uint32(x); } function toUint40(uint256 x) internal pure returns (uint40) { if (x >= 1 << 40) _revertOverflow(); return uint40(x); } function toUint48(uint256 x) internal pure returns (uint48) { if (x >= 1 << 48) _revertOverflow(); return uint48(x); } function toUint56(uint256 x) internal pure returns (uint56) { if (x >= 1 << 56) _revertOverflow(); return uint56(x); } function toUint64(uint256 x) internal pure returns (uint64) { if (x >= 1 << 64) _revertOverflow(); return uint64(x); } function toUint72(uint256 x) internal pure returns (uint72) { if (x >= 1 << 72) _revertOverflow(); return uint72(x); } function toUint80(uint256 x) internal pure returns (uint80) { if (x >= 1 << 80) _revertOverflow(); return uint80(x); } function toUint88(uint256 x) internal pure returns (uint88) { if (x >= 1 << 88) _revertOverflow(); return uint88(x); } function toUint96(uint256 x) internal pure returns (uint96) { if (x >= 1 << 96) _revertOverflow(); return uint96(x); } function toUint104(uint256 x) internal pure returns (uint104) { if (x >= 1 << 104) _revertOverflow(); return uint104(x); } function toUint112(uint256 x) internal pure returns (uint112) { if (x >= 1 << 112) _revertOverflow(); return uint112(x); } function toUint120(uint256 x) internal pure returns (uint120) { if (x >= 1 << 120) _revertOverflow(); return uint120(x); } function toUint128(uint256 x) internal pure returns (uint128) { if (x >= 1 << 128) _revertOverflow(); return uint128(x); } function toUint136(uint256 x) internal pure returns (uint136) { if (x >= 1 << 136) _revertOverflow(); return uint136(x); } function toUint144(uint256 x) internal pure returns (uint144) { if (x >= 1 << 144) _revertOverflow(); return uint144(x); } function toUint152(uint256 x) internal pure returns (uint152) { if (x >= 1 << 152) _revertOverflow(); return uint152(x); } function toUint160(uint256 x) internal pure returns (uint160) { if (x >= 1 << 160) _revertOverflow(); return uint160(x); } function toUint168(uint256 x) internal pure returns (uint168) { if (x >= 1 << 168) _revertOverflow(); return uint168(x); } function toUint176(uint256 x) internal pure returns (uint176) { if (x >= 1 << 176) _revertOverflow(); return uint176(x); } function toUint184(uint256 x) internal pure returns (uint184) { if (x >= 1 << 184) _revertOverflow(); return uint184(x); } function toUint192(uint256 x) internal pure returns (uint192) { if (x >= 1 << 192) _revertOverflow(); return uint192(x); } function toUint200(uint256 x) internal pure returns (uint200) { if (x >= 1 << 200) _revertOverflow(); return uint200(x); } function toUint208(uint256 x) internal pure returns (uint208) { if (x >= 1 << 208) _revertOverflow(); return uint208(x); } function toUint216(uint256 x) internal pure returns (uint216) { if (x >= 1 << 216) _revertOverflow(); return uint216(x); } function toUint224(uint256 x) internal pure returns (uint224) { if (x >= 1 << 224) _revertOverflow(); return uint224(x); } function toUint232(uint256 x) internal pure returns (uint232) { if (x >= 1 << 232) _revertOverflow(); return uint232(x); } function toUint240(uint256 x) internal pure returns (uint240) { if (x >= 1 << 240) _revertOverflow(); return uint240(x); } function toUint248(uint256 x) internal pure returns (uint248) { if (x >= 1 << 248) _revertOverflow(); return uint248(x); } /*´:°•.°+.*•´.*:˚.°*.˚•´.°:°•.°•.*•´.*:˚.°*.˚•´.°:°•.°+.*•´.*:*/ /* SIGNED INTEGER SAFE CASTING OPERATIONS */ /*.•°:°.´+˚.*°.˚:*.´•*.+°.•°:´*.´•*.•°.•°:°.´:•˚°.*°.˚:*.´+°.•*/ function toInt8(int256 x) internal pure returns (int8) { int8 y = int8(x); if (x != y) _revertOverflow(); return y; } function toInt16(int256 x) internal pure returns (int16) { int16 y = int16(x); if (x != y) _revertOverflow(); return y; } function toInt24(int256 x) internal pure returns (int24) { int24 y = int24(x); if (x != y) _revertOverflow(); return y; } function toInt32(int256 x) internal pure returns (int32) { int32 y = int32(x); if (x != y) _revertOverflow(); return y; } function toInt40(int256 x) internal pure returns (int40) { int40 y = int40(x); if (x != y) _revertOverflow(); return y; } function toInt48(int256 x) internal pure returns (int48) { int48 y = int48(x); if (x != y) _revertOverflow(); return y; } function toInt56(int256 x) internal pure returns (int56) { int56 y = int56(x); if (x != y) _revertOverflow(); return y; } function toInt64(int256 x) internal pure returns (int64) { int64 y = int64(x); if (x != y) _revertOverflow(); return y; } function toInt72(int256 x) internal pure returns (int72) { int72 y = int72(x); if (x != y) _revertOverflow(); return y; } function toInt80(int256 x) internal pure returns (int80) { int80 y = int80(x); if (x != y) _revertOverflow(); return y; } function toInt88(int256 x) internal pure returns (int88) { int88 y = int88(x); if (x != y) _revertOverflow(); return y; } function toInt96(int256 x) internal pure returns (int96) { int96 y = int96(x); if (x != y) _revertOverflow(); return y; } function toInt104(int256 x) internal pure returns (int104) { int104 y = int104(x); if (x != y) _revertOverflow(); return y; } function toInt112(int256 x) internal pure returns (int112) { int112 y = int112(x); if (x != y) _revertOverflow(); return y; } function toInt120(int256 x) internal pure returns (int120) { int120 y = int120(x); if (x != y) _revertOverflow(); return y; } function toInt128(int256 x) internal pure returns (int128) { int128 y = int128(x); if (x != y) _revertOverflow(); return y; } function toInt136(int256 x) internal pure returns (int136) { int136 y = int136(x); if (x != y) _revertOverflow(); return y; } function toInt144(int256 x) internal pure returns (int144) { int144 y = int144(x); if (x != y) _revertOverflow(); return y; } function toInt152(int256 x) internal pure returns (int152) { int152 y = int152(x); if (x != y) _revertOverflow(); return y; } function toInt160(int256 x) internal pure returns (int160) { int160 y = int160(x); if (x != y) _revertOverflow(); return y; } function toInt168(int256 x) internal pure returns (int168) { int168 y = int168(x); if (x != y) _revertOverflow(); return y; } function toInt176(int256 x) internal pure returns (int176) { int176 y = int176(x); if (x != y) _revertOverflow(); return y; } function toInt184(int256 x) internal pure returns (int184) { int184 y = int184(x); if (x != y) _revertOverflow(); return y; } function toInt192(int256 x) internal pure returns (int192) { int192 y = int192(x); if (x != y) _revertOverflow(); return y; } function toInt200(int256 x) internal pure returns (int200) { int200 y = int200(x); if (x != y) _revertOverflow(); return y; } function toInt208(int256 x) internal pure returns (int208) { int208 y = int208(x); if (x != y) _revertOverflow(); return y; } function toInt216(int256 x) internal pure returns (int216) { int216 y = int216(x); if (x != y) _revertOverflow(); return y; } function toInt224(int256 x) internal pure returns (int224) { int224 y = int224(x); if (x != y) _revertOverflow(); return y; } function toInt232(int256 x) internal pure returns (int232) { int232 y = int232(x); if (x != y) _revertOverflow(); return y; } function toInt240(int256 x) internal pure returns (int240) { int240 y = int240(x); if (x != y) _revertOverflow(); return y; } function toInt248(int256 x) internal pure returns (int248) { int248 y = int248(x); if (x != y) _revertOverflow(); return y; } /*´:°•.°+.*•´.*:˚.°*.˚•´.°:°•.°•.*•´.*:˚.°*.˚•´.°:°•.°+.*•´.*:*/ /* OTHER SAFE CASTING OPERATIONS */ /*.•°:°.´+˚.*°.˚:*.´•*.+°.•°:´*.´•*.•°.•°:°.´:•˚°.*°.˚:*.´+°.•*/ function toInt256(uint256 x) internal pure returns (int256) { if (x >= 1 << 255) _revertOverflow(); return int256(x); } function toUint256(int256 x) internal pure returns (uint256) { if (x < 0) _revertOverflow(); return uint256(x); } /*´:°•.°+.*•´.*:˚.°*.˚•´.°:°•.°•.*•´.*:˚.°*.˚•´.°:°•.°+.*•´.*:*/ /* PRIVATE HELPERS */ /*.•°:°.´+˚.*°.˚:*.´•*.+°.•°:´*.´•*.•°.•°:°.´:•˚°.*°.˚:*.´+°.•*/ function _revertOverflow() private pure { /// @solidity memory-safe-assembly assembly { // Store the function selector of `Overflow()`. mstore(0x00, 0x35278d12) // Revert with (offset, size). revert(0x1c, 0x04) } } } // SPDX-License-Identifier: MIT pragma solidity 0.8.22; // Interfaces import { IErrors } from "./IErrors.sol"; // Types import { BalancerV2Data } from "../AugustusV6Types.sol"; /// @title IBalancerV2SwapExactAmountOut /// @notice Interface for executing swapExactAmountOut directly on Balancer V2 pools interface IBalancerV2SwapExactAmountOut is IErrors { /*////////////////////////////////////////////////////////////// SWAP EXACT AMOUNT OUT //////////////////////////////////////////////////////////////*/ /// @notice Executes a swapExactAmountOut on Balancer V2 pools /// @param balancerData Struct containing data for the swap /// @param partnerAndFee packed partner address and fee percentage, the first 12 bytes is the feeData and the last /// 20 bytes is the partner address /// @param permit Permit data for the swap /// @param data The calldata to execute /// @return spentAmount The actual amount of tokens used to swap /// @return receivedAmount The amount of tokens received /// @return paraswapShare The share of the fees for Paraswap /// @return partnerShare The share of the fees for the partner function swapExactAmountOutOnBalancerV2( BalancerV2Data calldata balancerData, uint256 partnerAndFee, bytes calldata permit, bytes calldata data ) external payable returns (uint256 spentAmount, uint256 receivedAmount, uint256 paraswapShare, uint256 partnerShare); } // SPDX-License-Identifier: MIT pragma solidity 0.8.22; // Interfaces import { IErrors } from "./IErrors.sol"; // Types import { UniswapV2Data } from "../AugustusV6Types.sol"; /// @title IUniswapV2SwapExactAmountOut /// @notice Interface for direct swapExactAmountOut on Uniswap V2 interface IUniswapV2SwapExactAmountOut is IErrors { /*////////////////////////////////////////////////////////////// SWAP EXACT AMOUNT IN //////////////////////////////////////////////////////////////*/ /// @notice Executes a swapExactAmountOut on Uniswap V2 pools /// @param swapData struct containing data for the swap /// @param partnerAndFee packed partner address and fee percentage, the first 12 bytes is the feeData and the last /// 20 bytes is the partner address /// @param permit The permit data /// @return spentAmount The actual amount of tokens used to swap /// @return receivedAmount The amount of tokens received /// @return paraswapShare The share of the fees for Paraswap /// @return partnerShare The share of the fees for the partner function swapExactAmountOutOnUniswapV2( UniswapV2Data calldata swapData, uint256 partnerAndFee, bytes calldata permit ) external payable returns (uint256 spentAmount, uint256 receivedAmount, uint256 paraswapShare, uint256 partnerShare); } // SPDX-License-Identifier: MIT pragma solidity 0.8.22; // Interfaces import { IErrors } from "./IErrors.sol"; // Types import { UniswapV3Data } from "../AugustusV6Types.sol"; /// @title IUniswapV3SwapExactAmountOut /// @notice Interface for executing direct swapExactAmountOut on Uniswap V3 interface IUniswapV3SwapExactAmountOut is IErrors { /*////////////////////////////////////////////////////////////// SWAP EXACT AMOUNT OUT //////////////////////////////////////////////////////////////*/ /// @notice Executes a swapExactAmountOut on Uniswap V3 pools /// @param swapData struct containing data for the swap /// @param partnerAndFee packed partner address and fee percentage, the first 12 bytes is the feeData and the last /// 20 bytes is the partner address /// @param permit The permit data /// @return spentAmount The actual amount of tokens used to swap /// @return receivedAmount The amount of tokens received /// @return paraswapShare The share of the fees for Paraswap /// @return partnerShare The share of the fees for the partner function swapExactAmountOutOnUniswapV3( UniswapV3Data calldata swapData, uint256 partnerAndFee, bytes calldata permit ) external payable returns (uint256 spentAmount, uint256 receivedAmount, uint256 paraswapShare, uint256 partnerShare); } // SPDX-License-Identifier: MIT pragma solidity 0.8.22; // Interfaces import { IERC20 } from "@openzeppelin/token/ERC20/IERC20.sol"; /// @title IAugustusFeeVault /// @notice Interface for the AugustusFeeVault contract interface IAugustusFeeVault { /*////////////////////////////////////////////////////////////// ERRORS //////////////////////////////////////////////////////////////*/ /// @notice Error emitted when withdraw amount is zero or exceeds the stored amount error InvalidWithdrawAmount(); /// @notice Error emmitted when caller is not an approved augustus contract error UnauthorizedCaller(); /// @notice Error emitted when an invalid parameter length is passed error InvalidParameterLength(); /// @notice Error emitted when batch withdraw fails error BatchCollectFailed(); /*////////////////////////////////////////////////////////////// EVENTS //////////////////////////////////////////////////////////////*/ /// @notice Emitted when an augustus contract approval status is set /// @param augustus The augustus contract address /// @param approved The approval status event AugustusApprovalSet(address indexed augustus, bool approved); /*////////////////////////////////////////////////////////////// STRUCTS //////////////////////////////////////////////////////////////*/ /// @notice Struct to register fees /// @param addresses The addresses to register fees for /// @param token The token to register fees for /// @param fees The fees to register struct FeeRegistration { address[] addresses; IERC20 token; uint256[] fees; } /*////////////////////////////////////////////////////////////// COLLECT //////////////////////////////////////////////////////////////*/ /// @notice Allows partners to withdraw fees allocated to them and stored in the vault /// @param token The token to withdraw fees in /// @param amount The amount of fees to withdraw /// @param recipient The address to send the fees to /// @return success Whether the transfer was successful or not function withdrawSomeERC20(IERC20 token, uint256 amount, address recipient) external returns (bool success); /// @notice Allows partners to withdraw all fees allocated to them and stored in the vault for a given token /// @param token The token to withdraw fees in /// @param recipient The address to send the fees to /// @return success Whether the transfer was successful or not function withdrawAllERC20(IERC20 token, address recipient) external returns (bool success); /// @notice Allows partners to withdraw all fees allocated to them and stored in the vault for multiple tokens /// @param tokens The tokens to withdraw fees i /// @param recipient The address to send the fees to /// @return success Whether the transfer was successful or not function batchWithdrawAllERC20(IERC20[] calldata tokens, address recipient) external returns (bool success); /// @notice Allows partners to withdraw fees allocated to them and stored in the vault /// @param tokens The tokens to withdraw fees in /// @param amounts The amounts of fees to withdraw /// @param recipient The address to send the fees to /// @return success Whether the transfer was successful or not function batchWithdrawSomeERC20( IERC20[] calldata tokens, uint256[] calldata amounts, address recipient ) external returns (bool success); /*////////////////////////////////////////////////////////////// BALANCE GETTERS //////////////////////////////////////////////////////////////*/ /// @notice Get the balance of a given token for a given partner /// @param token The token to get the balance of /// @param partner The partner to get the balance for /// @return feeBalance The balance of the given token for the given partner function getBalance(IERC20 token, address partner) external view returns (uint256 feeBalance); /// @notice Get the balances of a given partner for multiple tokens /// @param tokens The tokens to get the balances of /// @param partner The partner to get the balances for /// @return feeBalances The balances of the given tokens for the given partner function batchGetBalance( IERC20[] calldata tokens, address partner ) external view returns (uint256[] memory feeBalances); /// @notice Returns the unallocated fees for a given token /// @param token The token to get the unallocated fees for /// @return unallocatedFees The unallocated fees for the given token function getUnallocatedFees(IERC20 token) external view returns (uint256 unallocatedFees); /*////////////////////////////////////////////////////////////// OWNER //////////////////////////////////////////////////////////////*/ /// @notice Registers the given feeData to the vault /// @param feeData The fee registration data function registerFees(FeeRegistration memory feeData) external; /// @notice Sets the augustus contract approval status /// @param augustus The augustus contract address /// @param approved The approval status function setAugustusApproval(address augustus, bool approved) external; /// @notice Sets the contract pause state /// @param _isPaused The new pause state function setContractPauseState(bool _isPaused) external; } // SPDX-License-Identifier: MIT pragma solidity 0.8.22; /// @title IAugustusFees /// @notice Interface for the AugustusFees contract, which handles the fees for the Augustus aggregator interface IAugustusFees { /*////////////////////////////////////////////////////////////// ERRORS //////////////////////////////////////////////////////////////*/ /// @notice Error emmited when the balance is not enough to pay the fees error InsufficientBalanceToPayFees(); /// @notice Error emmited when the quotedAmount is bigger than the fromAmount error InvalidQuotedAmount(); /*////////////////////////////////////////////////////////////// PUBLIC //////////////////////////////////////////////////////////////*/ /// @notice Parses the `partnerAndFee` parameter to extract the partner address and fee data. /// @dev `partnerAndFee` is a uint256 value where data is packed in a specific bit layout. /// /// The bit layout for `partnerAndFee` is as follows: /// - The most significant 160 bits (positions 255 to 96) represent the partner address. /// - Bits 95 to 92 are reserved for flags indicating various fee processing conditions: /// - 95th bit: `IS_TAKE_SURPLUS_MASK` - Partner takes surplus /// - 94th bit: `IS_REFERRAL_MASK` - Referral takes surplus /// - 93rd bit: `IS_SKIP_BLACKLIST_MASK` - Bypass token blacklist when processing fees /// - 92nd bit: `IS_CAP_SURPLUS_MASK` - Cap surplus to 1% of quoted amount /// - The least significant 16 bits (positions 15 to 0) encode the fee percentage. /// /// @param partnerAndFee Packed uint256 containing both partner address and fee data. /// @return partner The extracted partner address as a payable address. /// @return feeData The extracted fee data containing the fee percentage and flags. function parsePartnerAndFeeData(uint256 partnerAndFee) external pure returns (address payable partner, uint256 feeData); } // SPDX-License-Identifier: MIT pragma solidity 0.8.22; // Interfaces import { IERC20 } from "@openzeppelin/token/ERC20/IERC20.sol"; // @title AugustusStorage // @notice Inherited storage layout for AugustusV6, // contracts should inherit this contract to access the storage layout contract AugustusStorage { /*////////////////////////////////////////////////////////////// FEES //////////////////////////////////////////////////////////////*/ // @dev Mapping of tokens to boolean indicating if token is blacklisted for fee collection mapping(IERC20 token => bool isBlacklisted) public blacklistedTokens; // @dev Fee wallet to directly transfer paraswap share to address payable public feeWallet; // @dev Fee wallet address to register the paraswap share to in the fee vault address payable public feeWalletDelegate; /*////////////////////////////////////////////////////////////// CONTROL //////////////////////////////////////////////////////////////*/ // @dev Contract paused state bool public paused; } // SPDX-License-Identifier: MIT pragma solidity 0.8.22; // Contracts import { AugustusFees } from "../fees/AugustusFees.sol"; // Utils import { Permit2Utils } from "./Permit2Utils.sol"; import { PauseUtils } from "./PauseUtils.sol"; /// @title GenericUtils /// @notice A contract containing common utilities for Generic swaps abstract contract GenericUtils is AugustusFees, Permit2Utils, PauseUtils { /*////////////////////////////////////////////////////////////// INTERNAL //////////////////////////////////////////////////////////////*/ /// @dev Call executor with executorData and amountIn function _callSwapExactAmountInExecutor( address executor, bytes calldata executorData, uint256 amountIn ) internal { // solhint-disable-next-line no-inline-assembly assembly { // get the length of the executorData // + 4 bytes for the selector // + 32 bytes for fromAmount // + 32 bytes for sender let totalLength := add(executorData.length, 68) calldatacopy(add(0x7c, 4), executorData.offset, executorData.length) // store the executorData mstore(add(0x7c, add(4, executorData.length)), amountIn) // store the amountIn mstore(add(0x7c, add(36, executorData.length)), caller()) // store the sender // call executor and forward call value if iszero(call(gas(), executor, callvalue(), 0x7c, totalLength, 0, 0)) { returndatacopy(0x7c, 0, returndatasize()) // copy the revert data to memory revert(0x7c, returndatasize()) // revert with the revert data } } } /// @dev Call executor with executorData, maxAmountIn, amountOut function _callSwapExactAmountOutExecutor( address executor, bytes calldata executorData, uint256 maxAmountIn, uint256 amountOut ) internal { // solhint-disable-next-line no-inline-assembly assembly { // get the length of the executorData // + 4 bytes for the selector // + 32 bytes for fromAmount // + 32 bytes for toAmount // + 32 bytes for sender let totalLength := add(executorData.length, 100) calldatacopy(add(0x7c, 4), executorData.offset, executorData.length) // store the executorData mstore(add(0x7c, add(4, executorData.length)), maxAmountIn) // store the maxAmountIn mstore(add(0x7c, add(36, executorData.length)), amountOut) // store the amountOut mstore(add(0x7c, add(68, executorData.length)), caller()) // store the sender // call executor and forward call value if iszero(call(gas(), executor, callvalue(), 0x7c, totalLength, 0, 0)) { returndatacopy(0x7c, 0, returndatasize()) // copy the revert data to memory revert(0x7c, returndatasize()) // revert with the revert data } } } } // SPDX-License-Identifier: MIT pragma solidity 0.8.22; // Interfaces import { IErrors } from "./IErrors.sol"; // Types import { GenericData } from "../AugustusV6Types.sol"; /// @title IGenericSwapExactAmountIn /// @notice Interface for executing a generic swapExactAmountIn through an Augustus executor interface IGenericSwapExactAmountIn is IErrors { /*////////////////////////////////////////////////////////////// SWAP EXACT AMOUNT IN //////////////////////////////////////////////////////////////*/ /// @notice Executes a generic swapExactAmountIn using the given executorData on the given executor /// @param executor The address of the executor contract to use /// @param swapData Generic data containing the swap information /// @param partnerAndFee packed partner address and fee percentage, the first 12 bytes is the feeData and the last /// 20 bytes is the partner address /// @param permit The permit data /// @param executorData The data to execute on the executor /// @return receivedAmount The amount of destToken received after fees /// @return paraswapShare The share of the fees for Paraswap /// @return partnerShare The share of the fees for the partner function swapExactAmountIn( address executor, GenericData calldata swapData, uint256 partnerAndFee, bytes calldata permit, bytes calldata executorData ) external payable returns (uint256 receivedAmount, uint256 paraswapShare, uint256 partnerShare); } // SPDX-License-Identifier: MIT pragma solidity 0.8.22; // Interfaces import { IErrors } from "./IErrors.sol"; // Types import { GenericData } from "../AugustusV6Types.sol"; /// @title IGenericSwapExactAmountOut /// @notice Interface for executing a generic swapExactAmountOut through an Augustus executor interface IGenericSwapExactAmountOut is IErrors { /*////////////////////////////////////////////////////////////// SWAP EXACT AMOUNT OUT //////////////////////////////////////////////////////////////*/ /// @notice Executes a generic swapExactAmountOut using the given executorData on the given executor /// @param executor The address of the executor contract to use /// @param swapData Generic data containing the swap information /// @param partnerAndFee packed partner address and fee percentage, the first 12 bytes is the feeData and the last /// 20 bytes is the partner address /// @param permit The permit data /// @param executorData The data to execute on the executor /// @return spentAmount The actual amount of tokens used to swap /// @return receivedAmount The amount of tokens received from the swap /// @return paraswapShare The share of the fees for Paraswap /// @return partnerShare The share of the fees for the partner function swapExactAmountOut( address executor, GenericData calldata swapData, uint256 partnerAndFee, bytes calldata permit, bytes calldata executorData ) external payable returns (uint256 spentAmount, uint256 receivedAmount, uint256 paraswapShare, uint256 partnerShare); } // SPDX-License-Identifier: MIT pragma solidity 0.8.22; // Interfaces import { IErrors } from "./IErrors.sol"; // Types import { AugustusRFQData, OrderInfo } from "../AugustusV6Types.sol"; /// @title IAugustusRFQRouter /// @notice Interface for direct swaps on AugustusRFQ interface IAugustusRFQRouter is IErrors { /*////////////////////////////////////////////////////////////// ERRORS //////////////////////////////////////////////////////////////*/ /// @notice Emitted when the passed msg.value is not equal to the fromAmount error IncorrectEthAmount(); /*////////////////////////////////////////////////////////////// TRY BATCH FILL //////////////////////////////////////////////////////////////*/ /// @notice Executes a tryBatchFillTakerAmount or tryBatchFillMakerAmount call on AugustusRFQ /// the function that is executed is defined by the direction flag in the data param /// @param data Struct containing common data for AugustusRFQ /// @param orders An array containing AugustusRFQ orderInfo data /// @param permit Permit data for the swap /// @return spentAmount The amount of tokens spent /// @return receivedAmount The amount of tokens received function swapOnAugustusRFQTryBatchFill( AugustusRFQData calldata data, OrderInfo[] calldata orders, bytes calldata permit ) external payable returns (uint256 spentAmount, uint256 receivedAmount); } // SPDX-License-Identifier: ISC pragma solidity 0.8.22; pragma abicoder v2; // Types import { Order, OrderInfo } from "../AugustusV6Types.sol"; interface IAugustusRFQ { /// @dev Allows taker to fill an order /// @param order Order quote to fill /// @param signature Signature of the maker corresponding to the order function fillOrder(Order calldata order, bytes calldata signature) external; /// @dev The same as fillOrder but allows sender to specify the target beneficiary address /// @param order Order quote to fill /// @param signature Signature of the maker corresponding to the order /// @param target Address of the receiver function fillOrderWithTarget(Order calldata order, bytes calldata signature, address target) external; /// @dev Allows taker to fill an order partially /// @param order Order quote to fill /// @param signature Signature of the maker corresponding to the order /// @param takerTokenFillAmount Maximum taker token to fill this order with. function partialFillOrder( Order calldata order, bytes calldata signature, uint256 takerTokenFillAmount ) external returns (uint256 makerTokenFilledAmount); /// @dev Same as `partialFillOrder` but it allows to specify the destination address /// @param order Order quote to fill /// @param signature Signature of the maker corresponding to the order /// @param takerTokenFillAmount Maximum taker token to fill this order with. /// @param target Address that will receive swap funds function partialFillOrderWithTarget( Order calldata order, bytes calldata signature, uint256 takerTokenFillAmount, address target ) external returns (uint256 makerTokenFilledAmount); /// @dev Same as `partialFillOrderWithTarget` but it allows to pass permit /// @param order Order quote to fill /// @param signature Signature of the maker corresponding to the order /// @param takerTokenFillAmount Maximum taker token to fill this order with. /// @param target Address that will receive swap funds /// @param permitTakerAsset Permit calldata for taker /// @param permitMakerAsset Permit calldata for maker function partialFillOrderWithTargetPermit( Order calldata order, bytes calldata signature, uint256 takerTokenFillAmount, address target, bytes calldata permitTakerAsset, bytes calldata permitMakerAsset ) external returns (uint256 makerTokenFilledAmount); /// @dev batch fills orders until the takerFillAmount is swapped /// @dev skip the order if it fails /// @param orderInfos OrderInfo to fill /// @param takerFillAmount total taker amount to fill /// @param target Address of receiver function tryBatchFillOrderTakerAmount( OrderInfo[] calldata orderInfos, uint256 takerFillAmount, address target ) external; /// @dev batch fills orders until the makerFillAmount is swapped /// @dev skip the order if it fails /// @param orderInfos OrderInfo to fill /// @param makerFillAmount total maker amount to fill /// @param target Address of receiver function tryBatchFillOrderMakerAmount( OrderInfo[] calldata orderInfos, uint256 makerFillAmount, address target ) external; } // SPDX-License-Identifier: MIT pragma solidity 0.8.22; /// @title Callback for IUniswapV3PoolActions#swap /// @notice Any contract that calls IUniswapV3PoolActions#swap must implement this interface interface IUniswapV3SwapCallback { /// @notice Called to `msg.sender` after executing a swap via IUniswapV3Pool#swap. /// @dev In the implementation you must pay the pool tokens owed for the swap. /// The caller of this method must be checked to be a UniswapV3Pool deployed by the canonical UniswapV3Factory. /// amount0Delta and amount1Delta can both be 0 if no tokens were swapped. /// @param amount0Delta The amount of token0 that was sent (negative) or must be received (positive) by the pool by /// the end of the swap. If positive, the callback must send that amount of token0 to the pool. /// @param amount1Delta The amount of token1 that was sent (negative) or must be received (positive) by the pool by /// the end of the swap. If positive, the callback must send that amount of token1 to the pool. /// @param data Any data passed through by the caller via the IUniswapV3PoolActions#swap call function uniswapV3SwapCallback(int256 amount0Delta, int256 amount1Delta, bytes calldata data) external; } // SPDX-License-Identifier: MIT pragma solidity 0.8.22; import { IERC20 } from "@openzeppelin/token/ERC20/IERC20.sol"; /// @title IWETH /// @notice An interface for WETH IERC20 interface IWETH is IERC20 { function deposit() external payable; function withdraw(uint256 amount) external; } // SPDX-License-Identifier: MIT pragma solidity 0.8.22; /// @title IErrors /// @notice Common interface for errors interface IErrors { /*////////////////////////////////////////////////////////////// ERRORS //////////////////////////////////////////////////////////////*/ /// @notice Emitted when the returned amount is less than the minimum amount error InsufficientReturnAmount(); /// @notice Emitted when the specified toAmount is less than the minimum amount (2) error InvalidToAmount(); /// @notice Emmited when the srcToken and destToken are the same error ArbitrageNotSupported(); }
File 2 of 4: WETH9
// Copyright (C) 2015, 2016, 2017 Dapphub // This program is free software: you can redistribute it and/or modify // it under the terms of the GNU General Public License as published by // the Free Software Foundation, either version 3 of the License, or // (at your option) any later version. // This program is distributed in the hope that it will be useful, // but WITHOUT ANY WARRANTY; without even the implied warranty of // MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the // GNU General Public License for more details. // You should have received a copy of the GNU General Public License // along with this program. If not, see <http://www.gnu.org/licenses/>. pragma solidity ^0.4.18; contract WETH9 { string public name = "Wrapped Ether"; string public symbol = "WETH"; uint8 public decimals = 18; event Approval(address indexed src, address indexed guy, uint wad); event Transfer(address indexed src, address indexed dst, uint wad); event Deposit(address indexed dst, uint wad); event Withdrawal(address indexed src, uint wad); mapping (address => uint) public balanceOf; mapping (address => mapping (address => uint)) public allowance; function() public payable { deposit(); } function deposit() public payable { balanceOf[msg.sender] += msg.value; Deposit(msg.sender, msg.value); } function withdraw(uint wad) public { require(balanceOf[msg.sender] >= wad); balanceOf[msg.sender] -= wad; msg.sender.transfer(wad); Withdrawal(msg.sender, wad); } function totalSupply() public view returns (uint) { return this.balance; } function approve(address guy, uint wad) public returns (bool) { allowance[msg.sender][guy] = wad; Approval(msg.sender, guy, wad); return true; } function transfer(address dst, uint wad) public returns (bool) { return transferFrom(msg.sender, dst, wad); } function transferFrom(address src, address dst, uint wad) public returns (bool) { require(balanceOf[src] >= wad); if (src != msg.sender && allowance[src][msg.sender] != uint(-1)) { require(allowance[src][msg.sender] >= wad); allowance[src][msg.sender] -= wad; } balanceOf[src] -= wad; balanceOf[dst] += wad; Transfer(src, dst, wad); return true; } } /* GNU GENERAL PUBLIC LICENSE Version 3, 29 June 2007 Copyright (C) 2007 Free Software Foundation, Inc. <http://fsf.org/> Everyone is permitted to copy and distribute verbatim copies of this license document, but changing it is not allowed. Preamble The GNU General Public License is a free, copyleft license for software and other kinds of works. The licenses for most software and other practical works are designed to take away your freedom to share and change the works. By contrast, the GNU General Public License is intended to guarantee your freedom to share and change all versions of a program--to make sure it remains free software for all its users. We, the Free Software Foundation, use the GNU General Public License for most of our software; it applies also to any other work released this way by its authors. You can apply it to your programs, too. When we speak of free software, we are referring to freedom, not price. Our General Public Licenses are designed to make sure that you have the freedom to distribute copies of free software (and charge for them if you wish), that you receive source code or can get it if you want it, that you can change the software or use pieces of it in new free programs, and that you know you can do these things. To protect your rights, we need to prevent others from denying you these rights or asking you to surrender the rights. Therefore, you have certain responsibilities if you distribute copies of the software, or if you modify it: responsibilities to respect the freedom of others. For example, if you distribute copies of such a program, whether gratis or for a fee, you must pass on to the recipients the same freedoms that you received. You must make sure that they, too, receive or can get the source code. And you must show them these terms so they know their rights. Developers that use the GNU GPL protect your rights with two steps: (1) assert copyright on the software, and (2) offer you this License giving you legal permission to copy, distribute and/or modify it. For the developers' and authors' protection, the GPL clearly explains that there is no warranty for this free software. For both users' and authors' sake, the GPL requires that modified versions be marked as changed, so that their problems will not be attributed erroneously to authors of previous versions. Some devices are designed to deny users access to install or run modified versions of the software inside them, although the manufacturer can do so. This is fundamentally incompatible with the aim of protecting users' freedom to change the software. The systematic pattern of such abuse occurs in the area of products for individuals to use, which is precisely where it is most unacceptable. Therefore, we have designed this version of the GPL to prohibit the practice for those products. If such problems arise substantially in other domains, we stand ready to extend this provision to those domains in future versions of the GPL, as needed to protect the freedom of users. Finally, every program is threatened constantly by software patents. States should not allow patents to restrict development and use of software on general-purpose computers, but in those that do, we wish to avoid the special danger that patents applied to a free program could make it effectively proprietary. To prevent this, the GPL assures that patents cannot be used to render the program non-free. The precise terms and conditions for copying, distribution and modification follow. TERMS AND CONDITIONS 0. Definitions. "This License" refers to version 3 of the GNU General Public License. "Copyright" also means copyright-like laws that apply to other kinds of works, such as semiconductor masks. "The Program" refers to any copyrightable work licensed under this License. Each licensee is addressed as "you". "Licensees" and "recipients" may be individuals or organizations. To "modify" a work means to copy from or adapt all or part of the work in a fashion requiring copyright permission, other than the making of an exact copy. The resulting work is called a "modified version" of the earlier work or a work "based on" the earlier work. A "covered work" means either the unmodified Program or a work based on the Program. To "propagate" a work means to do anything with it that, without permission, would make you directly or secondarily liable for infringement under applicable copyright law, except executing it on a computer or modifying a private copy. Propagation includes copying, distribution (with or without modification), making available to the public, and in some countries other activities as well. To "convey" a work means any kind of propagation that enables other parties to make or receive copies. Mere interaction with a user through a computer network, with no transfer of a copy, is not conveying. An interactive user interface displays "Appropriate Legal Notices" to the extent that it includes a convenient and prominently visible feature that (1) displays an appropriate copyright notice, and (2) tells the user that there is no warranty for the work (except to the extent that warranties are provided), that licensees may convey the work under this License, and how to view a copy of this License. If the interface presents a list of user commands or options, such as a menu, a prominent item in the list meets this criterion. 1. Source Code. The "source code" for a work means the preferred form of the work for making modifications to it. "Object code" means any non-source form of a work. A "Standard Interface" means an interface that either is an official standard defined by a recognized standards body, or, in the case of interfaces specified for a particular programming language, one that is widely used among developers working in that language. The "System Libraries" of an executable work include anything, other than the work as a whole, that (a) is included in the normal form of packaging a Major Component, but which is not part of that Major Component, and (b) serves only to enable use of the work with that Major Component, or to implement a Standard Interface for which an implementation is available to the public in source code form. A "Major Component", in this context, means a major essential component (kernel, window system, and so on) of the specific operating system (if any) on which the executable work runs, or a compiler used to produce the work, or an object code interpreter used to run it. The "Corresponding Source" for a work in object code form means all the source code needed to generate, install, and (for an executable work) run the object code and to modify the work, including scripts to control those activities. However, it does not include the work's System Libraries, or general-purpose tools or generally available free programs which are used unmodified in performing those activities but which are not part of the work. For example, Corresponding Source includes interface definition files associated with source files for the work, and the source code for shared libraries and dynamically linked subprograms that the work is specifically designed to require, such as by intimate data communication or control flow between those subprograms and other parts of the work. The Corresponding Source need not include anything that users can regenerate automatically from other parts of the Corresponding Source. The Corresponding Source for a work in source code form is that same work. 2. Basic Permissions. All rights granted under this License are granted for the term of copyright on the Program, and are irrevocable provided the stated conditions are met. This License explicitly affirms your unlimited permission to run the unmodified Program. The output from running a covered work is covered by this License only if the output, given its content, constitutes a covered work. This License acknowledges your rights of fair use or other equivalent, as provided by copyright law. You may make, run and propagate covered works that you do not convey, without conditions so long as your license otherwise remains in force. You may convey covered works to others for the sole purpose of having them make modifications exclusively for you, or provide you with facilities for running those works, provided that you comply with the terms of this License in conveying all material for which you do not control copyright. Those thus making or running the covered works for you must do so exclusively on your behalf, under your direction and control, on terms that prohibit them from making any copies of your copyrighted material outside their relationship with you. Conveying under any other circumstances is permitted solely under the conditions stated below. Sublicensing is not allowed; section 10 makes it unnecessary. 3. Protecting Users' Legal Rights From Anti-Circumvention Law. No covered work shall be deemed part of an effective technological measure under any applicable law fulfilling obligations under article 11 of the WIPO copyright treaty adopted on 20 December 1996, or similar laws prohibiting or restricting circumvention of such measures. When you convey a covered work, you waive any legal power to forbid circumvention of technological measures to the extent such circumvention is effected by exercising rights under this License with respect to the covered work, and you disclaim any intention to limit operation or modification of the work as a means of enforcing, against the work's users, your or third parties' legal rights to forbid circumvention of technological measures. 4. Conveying Verbatim Copies. You may convey verbatim copies of the Program's source code as you receive it, in any medium, provided that you conspicuously and appropriately publish on each copy an appropriate copyright notice; keep intact all notices stating that this License and any non-permissive terms added in accord with section 7 apply to the code; keep intact all notices of the absence of any warranty; and give all recipients a copy of this License along with the Program. You may charge any price or no price for each copy that you convey, and you may offer support or warranty protection for a fee. 5. Conveying Modified Source Versions. You may convey a work based on the Program, or the modifications to produce it from the Program, in the form of source code under the terms of section 4, provided that you also meet all of these conditions: a) The work must carry prominent notices stating that you modified it, and giving a relevant date. b) The work must carry prominent notices stating that it is released under this License and any conditions added under section 7. This requirement modifies the requirement in section 4 to "keep intact all notices". c) You must license the entire work, as a whole, under this License to anyone who comes into possession of a copy. This License will therefore apply, along with any applicable section 7 additional terms, to the whole of the work, and all its parts, regardless of how they are packaged. This License gives no permission to license the work in any other way, but it does not invalidate such permission if you have separately received it. d) If the work has interactive user interfaces, each must display Appropriate Legal Notices; however, if the Program has interactive interfaces that do not display Appropriate Legal Notices, your work need not make them do so. A compilation of a covered work with other separate and independent works, which are not by their nature extensions of the covered work, and which are not combined with it such as to form a larger program, in or on a volume of a storage or distribution medium, is called an "aggregate" if the compilation and its resulting copyright are not used to limit the access or legal rights of the compilation's users beyond what the individual works permit. Inclusion of a covered work in an aggregate does not cause this License to apply to the other parts of the aggregate. 6. Conveying Non-Source Forms. You may convey a covered work in object code form under the terms of sections 4 and 5, provided that you also convey the machine-readable Corresponding Source under the terms of this License, in one of these ways: a) Convey the object code in, or embodied in, a physical product (including a physical distribution medium), accompanied by the Corresponding Source fixed on a durable physical medium customarily used for software interchange. b) Convey the object code in, or embodied in, a physical product (including a physical distribution medium), accompanied by a written offer, valid for at least three years and valid for as long as you offer spare parts or customer support for that product model, to give anyone who possesses the object code either (1) a copy of the Corresponding Source for all the software in the product that is covered by this License, on a durable physical medium customarily used for software interchange, for a price no more than your reasonable cost of physically performing this conveying of source, or (2) access to copy the Corresponding Source from a network server at no charge. c) Convey individual copies of the object code with a copy of the written offer to provide the Corresponding Source. This alternative is allowed only occasionally and noncommercially, and only if you received the object code with such an offer, in accord with subsection 6b. d) Convey the object code by offering access from a designated place (gratis or for a charge), and offer equivalent access to the Corresponding Source in the same way through the same place at no further charge. You need not require recipients to copy the Corresponding Source along with the object code. If the place to copy the object code is a network server, the Corresponding Source may be on a different server (operated by you or a third party) that supports equivalent copying facilities, provided you maintain clear directions next to the object code saying where to find the Corresponding Source. Regardless of what server hosts the Corresponding Source, you remain obligated to ensure that it is available for as long as needed to satisfy these requirements. e) Convey the object code using peer-to-peer transmission, provided you inform other peers where the object code and Corresponding Source of the work are being offered to the general public at no charge under subsection 6d. A separable portion of the object code, whose source code is excluded from the Corresponding Source as a System Library, need not be included in conveying the object code work. A "User Product" is either (1) a "consumer product", which means any tangible personal property which is normally used for personal, family, or household purposes, or (2) anything designed or sold for incorporation into a dwelling. In determining whether a product is a consumer product, doubtful cases shall be resolved in favor of coverage. For a particular product received by a particular user, "normally used" refers to a typical or common use of that class of product, regardless of the status of the particular user or of the way in which the particular user actually uses, or expects or is expected to use, the product. A product is a consumer product regardless of whether the product has substantial commercial, industrial or non-consumer uses, unless such uses represent the only significant mode of use of the product. "Installation Information" for a User Product means any methods, procedures, authorization keys, or other information required to install and execute modified versions of a covered work in that User Product from a modified version of its Corresponding Source. The information must suffice to ensure that the continued functioning of the modified object code is in no case prevented or interfered with solely because modification has been made. If you convey an object code work under this section in, or with, or specifically for use in, a User Product, and the conveying occurs as part of a transaction in which the right of possession and use of the User Product is transferred to the recipient in perpetuity or for a fixed term (regardless of how the transaction is characterized), the Corresponding Source conveyed under this section must be accompanied by the Installation Information. But this requirement does not apply if neither you nor any third party retains the ability to install modified object code on the User Product (for example, the work has been installed in ROM). The requirement to provide Installation Information does not include a requirement to continue to provide support service, warranty, or updates for a work that has been modified or installed by the recipient, or for the User Product in which it has been modified or installed. Access to a network may be denied when the modification itself materially and adversely affects the operation of the network or violates the rules and protocols for communication across the network. Corresponding Source conveyed, and Installation Information provided, in accord with this section must be in a format that is publicly documented (and with an implementation available to the public in source code form), and must require no special password or key for unpacking, reading or copying. 7. Additional Terms. "Additional permissions" are terms that supplement the terms of this License by making exceptions from one or more of its conditions. Additional permissions that are applicable to the entire Program shall be treated as though they were included in this License, to the extent that they are valid under applicable law. If additional permissions apply only to part of the Program, that part may be used separately under those permissions, but the entire Program remains governed by this License without regard to the additional permissions. When you convey a copy of a covered work, you may at your option remove any additional permissions from that copy, or from any part of it. (Additional permissions may be written to require their own removal in certain cases when you modify the work.) You may place additional permissions on material, added by you to a covered work, for which you have or can give appropriate copyright permission. Notwithstanding any other provision of this License, for material you add to a covered work, you may (if authorized by the copyright holders of that material) supplement the terms of this License with terms: a) Disclaiming warranty or limiting liability differently from the terms of sections 15 and 16 of this License; or b) Requiring preservation of specified reasonable legal notices or author attributions in that material or in the Appropriate Legal Notices displayed by works containing it; or c) Prohibiting misrepresentation of the origin of that material, or requiring that modified versions of such material be marked in reasonable ways as different from the original version; or d) Limiting the use for publicity purposes of names of licensors or authors of the material; or e) Declining to grant rights under trademark law for use of some trade names, trademarks, or service marks; or f) Requiring indemnification of licensors and authors of that material by anyone who conveys the material (or modified versions of it) with contractual assumptions of liability to the recipient, for any liability that these contractual assumptions directly impose on those licensors and authors. All other non-permissive additional terms are considered "further restrictions" within the meaning of section 10. If the Program as you received it, or any part of it, contains a notice stating that it is governed by this License along with a term that is a further restriction, you may remove that term. If a license document contains a further restriction but permits relicensing or conveying under this License, you may add to a covered work material governed by the terms of that license document, provided that the further restriction does not survive such relicensing or conveying. If you add terms to a covered work in accord with this section, you must place, in the relevant source files, a statement of the additional terms that apply to those files, or a notice indicating where to find the applicable terms. Additional terms, permissive or non-permissive, may be stated in the form of a separately written license, or stated as exceptions; the above requirements apply either way. 8. Termination. You may not propagate or modify a covered work except as expressly provided under this License. Any attempt otherwise to propagate or modify it is void, and will automatically terminate your rights under this License (including any patent licenses granted under the third paragraph of section 11). However, if you cease all violation of this License, then your license from a particular copyright holder is reinstated (a) provisionally, unless and until the copyright holder explicitly and finally terminates your license, and (b) permanently, if the copyright holder fails to notify you of the violation by some reasonable means prior to 60 days after the cessation. Moreover, your license from a particular copyright holder is reinstated permanently if the copyright holder notifies you of the violation by some reasonable means, this is the first time you have received notice of violation of this License (for any work) from that copyright holder, and you cure the violation prior to 30 days after your receipt of the notice. Termination of your rights under this section does not terminate the licenses of parties who have received copies or rights from you under this License. If your rights have been terminated and not permanently reinstated, you do not qualify to receive new licenses for the same material under section 10. 9. Acceptance Not Required for Having Copies. You are not required to accept this License in order to receive or run a copy of the Program. Ancillary propagation of a covered work occurring solely as a consequence of using peer-to-peer transmission to receive a copy likewise does not require acceptance. However, nothing other than this License grants you permission to propagate or modify any covered work. These actions infringe copyright if you do not accept this License. Therefore, by modifying or propagating a covered work, you indicate your acceptance of this License to do so. 10. Automatic Licensing of Downstream Recipients. Each time you convey a covered work, the recipient automatically receives a license from the original licensors, to run, modify and propagate that work, subject to this License. You are not responsible for enforcing compliance by third parties with this License. An "entity transaction" is a transaction transferring control of an organization, or substantially all assets of one, or subdividing an organization, or merging organizations. If propagation of a covered work results from an entity transaction, each party to that transaction who receives a copy of the work also receives whatever licenses to the work the party's predecessor in interest had or could give under the previous paragraph, plus a right to possession of the Corresponding Source of the work from the predecessor in interest, if the predecessor has it or can get it with reasonable efforts. You may not impose any further restrictions on the exercise of the rights granted or affirmed under this License. For example, you may not impose a license fee, royalty, or other charge for exercise of rights granted under this License, and you may not initiate litigation (including a cross-claim or counterclaim in a lawsuit) alleging that any patent claim is infringed by making, using, selling, offering for sale, or importing the Program or any portion of it. 11. Patents. A "contributor" is a copyright holder who authorizes use under this License of the Program or a work on which the Program is based. The work thus licensed is called the contributor's "contributor version". A contributor's "essential patent claims" are all patent claims owned or controlled by the contributor, whether already acquired or hereafter acquired, that would be infringed by some manner, permitted by this License, of making, using, or selling its contributor version, but do not include claims that would be infringed only as a consequence of further modification of the contributor version. For purposes of this definition, "control" includes the right to grant patent sublicenses in a manner consistent with the requirements of this License. Each contributor grants you a non-exclusive, worldwide, royalty-free patent license under the contributor's essential patent claims, to make, use, sell, offer for sale, import and otherwise run, modify and propagate the contents of its contributor version. In the following three paragraphs, a "patent license" is any express agreement or commitment, however denominated, not to enforce a patent (such as an express permission to practice a patent or covenant not to sue for patent infringement). To "grant" such a patent license to a party means to make such an agreement or commitment not to enforce a patent against the party. If you convey a covered work, knowingly relying on a patent license, and the Corresponding Source of the work is not available for anyone to copy, free of charge and under the terms of this License, through a publicly available network server or other readily accessible means, then you must either (1) cause the Corresponding Source to be so available, or (2) arrange to deprive yourself of the benefit of the patent license for this particular work, or (3) arrange, in a manner consistent with the requirements of this License, to extend the patent license to downstream recipients. "Knowingly relying" means you have actual knowledge that, but for the patent license, your conveying the covered work in a country, or your recipient's use of the covered work in a country, would infringe one or more identifiable patents in that country that you have reason to believe are valid. If, pursuant to or in connection with a single transaction or arrangement, you convey, or propagate by procuring conveyance of, a covered work, and grant a patent license to some of the parties receiving the covered work authorizing them to use, propagate, modify or convey a specific copy of the covered work, then the patent license you grant is automatically extended to all recipients of the covered work and works based on it. A patent license is "discriminatory" if it does not include within the scope of its coverage, prohibits the exercise of, or is conditioned on the non-exercise of one or more of the rights that are specifically granted under this License. You may not convey a covered work if you are a party to an arrangement with a third party that is in the business of distributing software, under which you make payment to the third party based on the extent of your activity of conveying the work, and under which the third party grants, to any of the parties who would receive the covered work from you, a discriminatory patent license (a) in connection with copies of the covered work conveyed by you (or copies made from those copies), or (b) primarily for and in connection with specific products or compilations that contain the covered work, unless you entered into that arrangement, or that patent license was granted, prior to 28 March 2007. Nothing in this License shall be construed as excluding or limiting any implied license or other defenses to infringement that may otherwise be available to you under applicable patent law. 12. No Surrender of Others' Freedom. If conditions are imposed on you (whether by court order, agreement or otherwise) that contradict the conditions of this License, they do not excuse you from the conditions of this License. If you cannot convey a covered work so as to satisfy simultaneously your obligations under this License and any other pertinent obligations, then as a consequence you may not convey it at all. For example, if you agree to terms that obligate you to collect a royalty for further conveying from those to whom you convey the Program, the only way you could satisfy both those terms and this License would be to refrain entirely from conveying the Program. 13. Use with the GNU Affero General Public License. Notwithstanding any other provision of this License, you have permission to link or combine any covered work with a work licensed under version 3 of the GNU Affero General Public License into a single combined work, and to convey the resulting work. The terms of this License will continue to apply to the part which is the covered work, but the special requirements of the GNU Affero General Public License, section 13, concerning interaction through a network will apply to the combination as such. 14. Revised Versions of this License. The Free Software Foundation may publish revised and/or new versions of the GNU General Public License from time to time. Such new versions will be similar in spirit to the present version, but may differ in detail to address new problems or concerns. Each version is given a distinguishing version number. If the Program specifies that a certain numbered version of the GNU General Public License "or any later version" applies to it, you have the option of following the terms and conditions either of that numbered version or of any later version published by the Free Software Foundation. If the Program does not specify a version number of the GNU General Public License, you may choose any version ever published by the Free Software Foundation. If the Program specifies that a proxy can decide which future versions of the GNU General Public License can be used, that proxy's public statement of acceptance of a version permanently authorizes you to choose that version for the Program. Later license versions may give you additional or different permissions. However, no additional obligations are imposed on any author or copyright holder as a result of your choosing to follow a later version. 15. Disclaimer of Warranty. THERE IS NO WARRANTY FOR THE PROGRAM, TO THE EXTENT PERMITTED BY APPLICABLE LAW. EXCEPT WHEN OTHERWISE STATED IN WRITING THE COPYRIGHT HOLDERS AND/OR OTHER PARTIES PROVIDE THE PROGRAM "AS IS" WITHOUT WARRANTY OF ANY KIND, EITHER EXPRESSED OR IMPLIED, INCLUDING, BUT NOT LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE. THE ENTIRE RISK AS TO THE QUALITY AND PERFORMANCE OF THE PROGRAM IS WITH YOU. SHOULD THE PROGRAM PROVE DEFECTIVE, YOU ASSUME THE COST OF ALL NECESSARY SERVICING, REPAIR OR CORRECTION. 16. Limitation of Liability. IN NO EVENT UNLESS REQUIRED BY APPLICABLE LAW OR AGREED TO IN WRITING WILL ANY COPYRIGHT HOLDER, OR ANY OTHER PARTY WHO MODIFIES AND/OR CONVEYS THE PROGRAM AS PERMITTED ABOVE, BE LIABLE TO YOU FOR DAMAGES, INCLUDING ANY GENERAL, SPECIAL, INCIDENTAL OR CONSEQUENTIAL DAMAGES ARISING OUT OF THE USE OR INABILITY TO USE THE PROGRAM (INCLUDING BUT NOT LIMITED TO LOSS OF DATA OR DATA BEING RENDERED INACCURATE OR LOSSES SUSTAINED BY YOU OR THIRD PARTIES OR A FAILURE OF THE PROGRAM TO OPERATE WITH ANY OTHER PROGRAMS), EVEN IF SUCH HOLDER OR OTHER PARTY HAS BEEN ADVISED OF THE POSSIBILITY OF SUCH DAMAGES. 17. Interpretation of Sections 15 and 16. If the disclaimer of warranty and limitation of liability provided above cannot be given local legal effect according to their terms, reviewing courts shall apply local law that most closely approximates an absolute waiver of all civil liability in connection with the Program, unless a warranty or assumption of liability accompanies a copy of the Program in return for a fee. END OF TERMS AND CONDITIONS How to Apply These Terms to Your New Programs If you develop a new program, and you want it to be of the greatest possible use to the public, the best way to achieve this is to make it free software which everyone can redistribute and change under these terms. To do so, attach the following notices to the program. It is safest to attach them to the start of each source file to most effectively state the exclusion of warranty; and each file should have at least the "copyright" line and a pointer to where the full notice is found. <one line to give the program's name and a brief idea of what it does.> Copyright (C) <year> <name of author> This program is free software: you can redistribute it and/or modify it under the terms of the GNU General Public License as published by the Free Software Foundation, either version 3 of the License, or (at your option) any later version. This program is distributed in the hope that it will be useful, but WITHOUT ANY WARRANTY; without even the implied warranty of MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU General Public License for more details. You should have received a copy of the GNU General Public License along with this program. If not, see <http://www.gnu.org/licenses/>. Also add information on how to contact you by electronic and paper mail. If the program does terminal interaction, make it output a short notice like this when it starts in an interactive mode: <program> Copyright (C) <year> <name of author> This program comes with ABSOLUTELY NO WARRANTY; for details type `show w'. This is free software, and you are welcome to redistribute it under certain conditions; type `show c' for details. The hypothetical commands `show w' and `show c' should show the appropriate parts of the General Public License. Of course, your program's commands might be different; for a GUI interface, you would use an "about box". You should also get your employer (if you work as a programmer) or school, if any, to sign a "copyright disclaimer" for the program, if necessary. For more information on this, and how to apply and follow the GNU GPL, see <http://www.gnu.org/licenses/>. The GNU General Public License does not permit incorporating your program into proprietary programs. If your program is a subroutine library, you may consider it more useful to permit linking proprietary applications with the library. If this is what you want to do, use the GNU Lesser General Public License instead of this License. But first, please read <http://www.gnu.org/philosophy/why-not-lgpl.html>. */
File 3 of 4: UniswapV2Pair
// File: contracts/interfaces/IUniswapV2Pair.sol pragma solidity >=0.5.0; interface IUniswapV2Pair { event Approval(address indexed owner, address indexed spender, uint value); event Transfer(address indexed from, address indexed to, uint value); function name() external pure returns (string memory); function symbol() external pure returns (string memory); function decimals() external pure returns (uint8); function totalSupply() external view returns (uint); function balanceOf(address owner) external view returns (uint); function allowance(address owner, address spender) external view returns (uint); function approve(address spender, uint value) external returns (bool); function transfer(address to, uint value) external returns (bool); function transferFrom(address from, address to, uint value) external returns (bool); function DOMAIN_SEPARATOR() external view returns (bytes32); function PERMIT_TYPEHASH() external pure returns (bytes32); function nonces(address owner) external view returns (uint); function permit(address owner, address spender, uint value, uint deadline, uint8 v, bytes32 r, bytes32 s) external; event Mint(address indexed sender, uint amount0, uint amount1); event Burn(address indexed sender, uint amount0, uint amount1, address indexed to); event Swap( address indexed sender, uint amount0In, uint amount1In, uint amount0Out, uint amount1Out, address indexed to ); event Sync(uint112 reserve0, uint112 reserve1); function MINIMUM_LIQUIDITY() external pure returns (uint); function factory() external view returns (address); function token0() external view returns (address); function token1() external view returns (address); function getReserves() external view returns (uint112 reserve0, uint112 reserve1, uint32 blockTimestampLast); function price0CumulativeLast() external view returns (uint); function price1CumulativeLast() external view returns (uint); function kLast() external view returns (uint); function mint(address to) external returns (uint liquidity); function burn(address to) external returns (uint amount0, uint amount1); function swap(uint amount0Out, uint amount1Out, address to, bytes calldata data) external; function skim(address to) external; function sync() external; function initialize(address, address) external; } // File: contracts/interfaces/IUniswapV2ERC20.sol pragma solidity >=0.5.0; interface IUniswapV2ERC20 { event Approval(address indexed owner, address indexed spender, uint value); event Transfer(address indexed from, address indexed to, uint value); function name() external pure returns (string memory); function symbol() external pure returns (string memory); function decimals() external pure returns (uint8); function totalSupply() external view returns (uint); function balanceOf(address owner) external view returns (uint); function allowance(address owner, address spender) external view returns (uint); function approve(address spender, uint value) external returns (bool); function transfer(address to, uint value) external returns (bool); function transferFrom(address from, address to, uint value) external returns (bool); function DOMAIN_SEPARATOR() external view returns (bytes32); function PERMIT_TYPEHASH() external pure returns (bytes32); function nonces(address owner) external view returns (uint); function permit(address owner, address spender, uint value, uint deadline, uint8 v, bytes32 r, bytes32 s) external; } // File: contracts/libraries/SafeMath.sol pragma solidity =0.5.16; // a library for performing overflow-safe math, courtesy of DappHub (https://github.com/dapphub/ds-math) library SafeMath { function add(uint x, uint y) internal pure returns (uint z) { require((z = x + y) >= x, 'ds-math-add-overflow'); } function sub(uint x, uint y) internal pure returns (uint z) { require((z = x - y) <= x, 'ds-math-sub-underflow'); } function mul(uint x, uint y) internal pure returns (uint z) { require(y == 0 || (z = x * y) / y == x, 'ds-math-mul-overflow'); } } // File: contracts/UniswapV2ERC20.sol pragma solidity =0.5.16; contract UniswapV2ERC20 is IUniswapV2ERC20 { using SafeMath for uint; string public constant name = 'Uniswap V2'; string public constant symbol = 'UNI-V2'; uint8 public constant decimals = 18; uint public totalSupply; mapping(address => uint) public balanceOf; mapping(address => mapping(address => uint)) public allowance; bytes32 public DOMAIN_SEPARATOR; // keccak256("Permit(address owner,address spender,uint256 value,uint256 nonce,uint256 deadline)"); bytes32 public constant PERMIT_TYPEHASH = 0x6e71edae12b1b97f4d1f60370fef10105fa2faae0126114a169c64845d6126c9; mapping(address => uint) public nonces; event Approval(address indexed owner, address indexed spender, uint value); event Transfer(address indexed from, address indexed to, uint value); constructor() public { uint chainId; assembly { chainId := chainid } DOMAIN_SEPARATOR = keccak256( abi.encode( keccak256('EIP712Domain(string name,string version,uint256 chainId,address verifyingContract)'), keccak256(bytes(name)), keccak256(bytes('1')), chainId, address(this) ) ); } function _mint(address to, uint value) internal { totalSupply = totalSupply.add(value); balanceOf[to] = balanceOf[to].add(value); emit Transfer(address(0), to, value); } function _burn(address from, uint value) internal { balanceOf[from] = balanceOf[from].sub(value); totalSupply = totalSupply.sub(value); emit Transfer(from, address(0), value); } function _approve(address owner, address spender, uint value) private { allowance[owner][spender] = value; emit Approval(owner, spender, value); } function _transfer(address from, address to, uint value) private { balanceOf[from] = balanceOf[from].sub(value); balanceOf[to] = balanceOf[to].add(value); emit Transfer(from, to, value); } function approve(address spender, uint value) external returns (bool) { _approve(msg.sender, spender, value); return true; } function transfer(address to, uint value) external returns (bool) { _transfer(msg.sender, to, value); return true; } function transferFrom(address from, address to, uint value) external returns (bool) { if (allowance[from][msg.sender] != uint(-1)) { allowance[from][msg.sender] = allowance[from][msg.sender].sub(value); } _transfer(from, to, value); return true; } function permit(address owner, address spender, uint value, uint deadline, uint8 v, bytes32 r, bytes32 s) external { require(deadline >= block.timestamp, 'UniswapV2: EXPIRED'); bytes32 digest = keccak256( abi.encodePacked( '\x19\x01', DOMAIN_SEPARATOR, keccak256(abi.encode(PERMIT_TYPEHASH, owner, spender, value, nonces[owner]++, deadline)) ) ); address recoveredAddress = ecrecover(digest, v, r, s); require(recoveredAddress != address(0) && recoveredAddress == owner, 'UniswapV2: INVALID_SIGNATURE'); _approve(owner, spender, value); } } // File: contracts/libraries/Math.sol pragma solidity =0.5.16; // a library for performing various math operations library Math { function min(uint x, uint y) internal pure returns (uint z) { z = x < y ? x : y; } // babylonian method (https://en.wikipedia.org/wiki/Methods_of_computing_square_roots#Babylonian_method) function sqrt(uint y) internal pure returns (uint z) { if (y > 3) { z = y; uint x = y / 2 + 1; while (x < z) { z = x; x = (y / x + x) / 2; } } else if (y != 0) { z = 1; } } } // File: contracts/libraries/UQ112x112.sol pragma solidity =0.5.16; // a library for handling binary fixed point numbers (https://en.wikipedia.org/wiki/Q_(number_format)) // range: [0, 2**112 - 1] // resolution: 1 / 2**112 library UQ112x112 { uint224 constant Q112 = 2**112; // encode a uint112 as a UQ112x112 function encode(uint112 y) internal pure returns (uint224 z) { z = uint224(y) * Q112; // never overflows } // divide a UQ112x112 by a uint112, returning a UQ112x112 function uqdiv(uint224 x, uint112 y) internal pure returns (uint224 z) { z = x / uint224(y); } } // File: contracts/interfaces/IERC20.sol pragma solidity >=0.5.0; interface IERC20 { event Approval(address indexed owner, address indexed spender, uint value); event Transfer(address indexed from, address indexed to, uint value); function name() external view returns (string memory); function symbol() external view returns (string memory); function decimals() external view returns (uint8); function totalSupply() external view returns (uint); function balanceOf(address owner) external view returns (uint); function allowance(address owner, address spender) external view returns (uint); function approve(address spender, uint value) external returns (bool); function transfer(address to, uint value) external returns (bool); function transferFrom(address from, address to, uint value) external returns (bool); } // File: contracts/interfaces/IUniswapV2Factory.sol pragma solidity >=0.5.0; interface IUniswapV2Factory { event PairCreated(address indexed token0, address indexed token1, address pair, uint); function feeTo() external view returns (address); function feeToSetter() external view returns (address); function getPair(address tokenA, address tokenB) external view returns (address pair); function allPairs(uint) external view returns (address pair); function allPairsLength() external view returns (uint); function createPair(address tokenA, address tokenB) external returns (address pair); function setFeeTo(address) external; function setFeeToSetter(address) external; } // File: contracts/interfaces/IUniswapV2Callee.sol pragma solidity >=0.5.0; interface IUniswapV2Callee { function uniswapV2Call(address sender, uint amount0, uint amount1, bytes calldata data) external; } // File: contracts/UniswapV2Pair.sol pragma solidity =0.5.16; contract UniswapV2Pair is IUniswapV2Pair, UniswapV2ERC20 { using SafeMath for uint; using UQ112x112 for uint224; uint public constant MINIMUM_LIQUIDITY = 10**3; bytes4 private constant SELECTOR = bytes4(keccak256(bytes('transfer(address,uint256)'))); address public factory; address public token0; address public token1; uint112 private reserve0; // uses single storage slot, accessible via getReserves uint112 private reserve1; // uses single storage slot, accessible via getReserves uint32 private blockTimestampLast; // uses single storage slot, accessible via getReserves uint public price0CumulativeLast; uint public price1CumulativeLast; uint public kLast; // reserve0 * reserve1, as of immediately after the most recent liquidity event uint private unlocked = 1; modifier lock() { require(unlocked == 1, 'UniswapV2: LOCKED'); unlocked = 0; _; unlocked = 1; } function getReserves() public view returns (uint112 _reserve0, uint112 _reserve1, uint32 _blockTimestampLast) { _reserve0 = reserve0; _reserve1 = reserve1; _blockTimestampLast = blockTimestampLast; } function _safeTransfer(address token, address to, uint value) private { (bool success, bytes memory data) = token.call(abi.encodeWithSelector(SELECTOR, to, value)); require(success && (data.length == 0 || abi.decode(data, (bool))), 'UniswapV2: TRANSFER_FAILED'); } event Mint(address indexed sender, uint amount0, uint amount1); event Burn(address indexed sender, uint amount0, uint amount1, address indexed to); event Swap( address indexed sender, uint amount0In, uint amount1In, uint amount0Out, uint amount1Out, address indexed to ); event Sync(uint112 reserve0, uint112 reserve1); constructor() public { factory = msg.sender; } // called once by the factory at time of deployment function initialize(address _token0, address _token1) external { require(msg.sender == factory, 'UniswapV2: FORBIDDEN'); // sufficient check token0 = _token0; token1 = _token1; } // update reserves and, on the first call per block, price accumulators function _update(uint balance0, uint balance1, uint112 _reserve0, uint112 _reserve1) private { require(balance0 <= uint112(-1) && balance1 <= uint112(-1), 'UniswapV2: OVERFLOW'); uint32 blockTimestamp = uint32(block.timestamp % 2**32); uint32 timeElapsed = blockTimestamp - blockTimestampLast; // overflow is desired if (timeElapsed > 0 && _reserve0 != 0 && _reserve1 != 0) { // * never overflows, and + overflow is desired price0CumulativeLast += uint(UQ112x112.encode(_reserve1).uqdiv(_reserve0)) * timeElapsed; price1CumulativeLast += uint(UQ112x112.encode(_reserve0).uqdiv(_reserve1)) * timeElapsed; } reserve0 = uint112(balance0); reserve1 = uint112(balance1); blockTimestampLast = blockTimestamp; emit Sync(reserve0, reserve1); } // if fee is on, mint liquidity equivalent to 1/6th of the growth in sqrt(k) function _mintFee(uint112 _reserve0, uint112 _reserve1) private returns (bool feeOn) { address feeTo = IUniswapV2Factory(factory).feeTo(); feeOn = feeTo != address(0); uint _kLast = kLast; // gas savings if (feeOn) { if (_kLast != 0) { uint rootK = Math.sqrt(uint(_reserve0).mul(_reserve1)); uint rootKLast = Math.sqrt(_kLast); if (rootK > rootKLast) { uint numerator = totalSupply.mul(rootK.sub(rootKLast)); uint denominator = rootK.mul(5).add(rootKLast); uint liquidity = numerator / denominator; if (liquidity > 0) _mint(feeTo, liquidity); } } } else if (_kLast != 0) { kLast = 0; } } // this low-level function should be called from a contract which performs important safety checks function mint(address to) external lock returns (uint liquidity) { (uint112 _reserve0, uint112 _reserve1,) = getReserves(); // gas savings uint balance0 = IERC20(token0).balanceOf(address(this)); uint balance1 = IERC20(token1).balanceOf(address(this)); uint amount0 = balance0.sub(_reserve0); uint amount1 = balance1.sub(_reserve1); bool feeOn = _mintFee(_reserve0, _reserve1); uint _totalSupply = totalSupply; // gas savings, must be defined here since totalSupply can update in _mintFee if (_totalSupply == 0) { liquidity = Math.sqrt(amount0.mul(amount1)).sub(MINIMUM_LIQUIDITY); _mint(address(0), MINIMUM_LIQUIDITY); // permanently lock the first MINIMUM_LIQUIDITY tokens } else { liquidity = Math.min(amount0.mul(_totalSupply) / _reserve0, amount1.mul(_totalSupply) / _reserve1); } require(liquidity > 0, 'UniswapV2: INSUFFICIENT_LIQUIDITY_MINTED'); _mint(to, liquidity); _update(balance0, balance1, _reserve0, _reserve1); if (feeOn) kLast = uint(reserve0).mul(reserve1); // reserve0 and reserve1 are up-to-date emit Mint(msg.sender, amount0, amount1); } // this low-level function should be called from a contract which performs important safety checks function burn(address to) external lock returns (uint amount0, uint amount1) { (uint112 _reserve0, uint112 _reserve1,) = getReserves(); // gas savings address _token0 = token0; // gas savings address _token1 = token1; // gas savings uint balance0 = IERC20(_token0).balanceOf(address(this)); uint balance1 = IERC20(_token1).balanceOf(address(this)); uint liquidity = balanceOf[address(this)]; bool feeOn = _mintFee(_reserve0, _reserve1); uint _totalSupply = totalSupply; // gas savings, must be defined here since totalSupply can update in _mintFee amount0 = liquidity.mul(balance0) / _totalSupply; // using balances ensures pro-rata distribution amount1 = liquidity.mul(balance1) / _totalSupply; // using balances ensures pro-rata distribution require(amount0 > 0 && amount1 > 0, 'UniswapV2: INSUFFICIENT_LIQUIDITY_BURNED'); _burn(address(this), liquidity); _safeTransfer(_token0, to, amount0); _safeTransfer(_token1, to, amount1); balance0 = IERC20(_token0).balanceOf(address(this)); balance1 = IERC20(_token1).balanceOf(address(this)); _update(balance0, balance1, _reserve0, _reserve1); if (feeOn) kLast = uint(reserve0).mul(reserve1); // reserve0 and reserve1 are up-to-date emit Burn(msg.sender, amount0, amount1, to); } // this low-level function should be called from a contract which performs important safety checks function swap(uint amount0Out, uint amount1Out, address to, bytes calldata data) external lock { require(amount0Out > 0 || amount1Out > 0, 'UniswapV2: INSUFFICIENT_OUTPUT_AMOUNT'); (uint112 _reserve0, uint112 _reserve1,) = getReserves(); // gas savings require(amount0Out < _reserve0 && amount1Out < _reserve1, 'UniswapV2: INSUFFICIENT_LIQUIDITY'); uint balance0; uint balance1; { // scope for _token{0,1}, avoids stack too deep errors address _token0 = token0; address _token1 = token1; require(to != _token0 && to != _token1, 'UniswapV2: INVALID_TO'); if (amount0Out > 0) _safeTransfer(_token0, to, amount0Out); // optimistically transfer tokens if (amount1Out > 0) _safeTransfer(_token1, to, amount1Out); // optimistically transfer tokens if (data.length > 0) IUniswapV2Callee(to).uniswapV2Call(msg.sender, amount0Out, amount1Out, data); balance0 = IERC20(_token0).balanceOf(address(this)); balance1 = IERC20(_token1).balanceOf(address(this)); } uint amount0In = balance0 > _reserve0 - amount0Out ? balance0 - (_reserve0 - amount0Out) : 0; uint amount1In = balance1 > _reserve1 - amount1Out ? balance1 - (_reserve1 - amount1Out) : 0; require(amount0In > 0 || amount1In > 0, 'UniswapV2: INSUFFICIENT_INPUT_AMOUNT'); { // scope for reserve{0,1}Adjusted, avoids stack too deep errors uint balance0Adjusted = balance0.mul(1000).sub(amount0In.mul(3)); uint balance1Adjusted = balance1.mul(1000).sub(amount1In.mul(3)); require(balance0Adjusted.mul(balance1Adjusted) >= uint(_reserve0).mul(_reserve1).mul(1000**2), 'UniswapV2: K'); } _update(balance0, balance1, _reserve0, _reserve1); emit Swap(msg.sender, amount0In, amount1In, amount0Out, amount1Out, to); } // force balances to match reserves function skim(address to) external lock { address _token0 = token0; // gas savings address _token1 = token1; // gas savings _safeTransfer(_token0, to, IERC20(_token0).balanceOf(address(this)).sub(reserve0)); _safeTransfer(_token1, to, IERC20(_token1).balanceOf(address(this)).sub(reserve1)); } // force reserves to match balances function sync() external lock { _update(IERC20(token0).balanceOf(address(this)), IERC20(token1).balanceOf(address(this)), reserve0, reserve1); } }
File 4 of 4: Catcoin
// SPDX-License-Identifier: NOLICENSE pragma solidity ^0.8.0; interface IERC20 { function totalSupply() external view returns (uint256); function balanceOf(address account) external view returns (uint256); function transfer(address recipient, uint256 amount) external returns (bool); function allowance(address owner, address spender) external view returns (uint256); function approve(address spender, uint256 amount) external returns (bool); function transferFrom( address sender, address recipient, uint256 amount ) external returns (bool); event Transfer(address indexed from, address indexed to, uint256 value); event Approval(address indexed owner, address indexed spender, uint256 value); } abstract contract Context { function _msgSender() internal view virtual returns (address) { return msg.sender; } function _msgData() internal view virtual returns (bytes calldata) { this; // silence state mutability warning without generating bytecode - see https://github.com/ethereum/solidity/issues/2691 return msg.data; } } abstract contract Ownable is Context { address private _owner; event OwnershipTransferred(address indexed previousOwner, address indexed newOwner); constructor() { _setOwner(_msgSender()); } function owner() public view virtual returns (address) { return _owner; } modifier onlyOwner() { require(owner() == _msgSender(), "Ownable: caller is not the owner"); _; } function renounceOwnership() public virtual onlyOwner { _setOwner(address(0)); } function transferOwnership(address newOwner) public virtual onlyOwner { require(newOwner != address(0), "Ownable: new owner is the zero address"); _setOwner(newOwner); } function _setOwner(address newOwner) private { address oldOwner = _owner; _owner = newOwner; emit OwnershipTransferred(oldOwner, newOwner); } } interface IFactory{ function createPair(address tokenA, address tokenB) external returns (address pair); } interface IRouter { function factory() external pure returns (address); function WETH() external pure returns (address); function addLiquidityETH( address token, uint amountTokenDesired, uint amountTokenMin, uint amountETHMin, address to, uint deadline ) external payable returns (uint amountToken, uint amountETH, uint liquidity); function swapExactTokensForETHSupportingFeeOnTransferTokens( uint amountIn, uint amountOutMin, address[] calldata path, address to, uint deadline) external; } contract Catcoin is Context, IERC20, Ownable { mapping (address => uint256) private _balance; mapping (address => mapping (address => uint256)) private _allowances; mapping (address => bool) private _isExcludedFromFee; mapping (address => bool) private _isBot; bool public swapEnabled; bool private swapping; IRouter private router; address private pair; uint8 private constant DECIMALS = 9; uint256 private constant MAX = ~uint256(0); uint256 private constant T_TOTAL = 5e16 * 10**DECIMALS; uint256 public swapTokensAtAmount = 10_000_000_000_000 * 10**DECIMALS; address public constant ZERO_ADDRESS = address(0); address public marketingAddress = ZERO_ADDRESS; string private constant NAME = "Catcoin"; string private constant SYMBOL = "CAT"; enum ETransferType { Sell, Buy, Transfer } struct Taxes { uint16 marketing; uint16 liquidity; } uint8 public transferTaxesTier; Taxes public transferTaxes = Taxes(0,0); uint8 public buyTaxesTier; Taxes public buyTaxes; uint8 public sellTaxesTier; Taxes public sellTaxes; struct TotFeesPaidStruct{ uint256 marketing; uint256 liquidity; } TotFeesPaidStruct public totFeesPaid; modifier lockTheSwap { swapping = true; _; swapping = false; } constructor (address routerAddress) { IRouter _router = IRouter(routerAddress); address _pair = IFactory(_router.factory()) .createPair(address(this), _router.WETH()); router = _router; pair = _pair; _balance[owner()] = T_TOTAL; _isExcludedFromFee[owner()] = true; _isExcludedFromFee[marketingAddress]=true; etx(2); emit Transfer(address(0), owner(), T_TOTAL); } //std ERC20: function name() public pure returns (string memory) { return NAME; } function symbol() public pure returns (string memory) { return SYMBOL; } function decimals() public pure returns (uint8) { return DECIMALS; } //override ERC20: function totalSupply() public pure override returns (uint256) { return T_TOTAL; } function balanceOf(address account) public view override returns (uint256) { return _balance[account]; } function transfer(address recipient, uint256 amount) public override returns (bool) { _transfer(_msgSender(), recipient, amount); return true; } function allowance(address owner, address spender) public view override returns (uint256) { return _allowances[owner][spender]; } function approve(address spender, uint256 amount) public override returns (bool) { _approve(_msgSender(), spender, amount); return true; } function transferFrom(address sender, address recipient, uint256 amount) public virtual override returns (bool) { _transfer(sender, recipient, amount); uint256 currentAllowance = _allowances[sender][_msgSender()]; if (currentAllowance != type(uint256).max) { require(currentAllowance >= amount, "ERC20: transfer amount exceeds allowance"); _approve(sender, _msgSender(), currentAllowance - amount); } return true; } function increaseAllowance(address spender, uint256 addedValue) public virtual returns (bool) { _approve(_msgSender(), spender, _allowances[_msgSender()][spender] + addedValue); return true; } function decreaseAllowance(address spender, uint256 subtractedValue) public virtual returns (bool) { uint256 currentAllowance = _allowances[_msgSender()][spender]; require(currentAllowance >= subtractedValue, "ERC20: decreased allowance below zero"); _approve(_msgSender(), spender, currentAllowance - subtractedValue); return true; } function excludeFromFee(address account) public onlyOwner { _isExcludedFromFee[account] = true; } function includeInFee(address account) public onlyOwner { _isExcludedFromFee[account] = false; } function isExcludedFromFee(address account) public view returns(bool) { return _isExcludedFromFee[account]; } function _approve(address owner, address spender, uint256 amount) private { require(owner != address(0), "ERC20: approve from the zero address"); require(spender != address(0), "ERC20: approve to the zero address"); _allowances[owner][spender] = amount; emit Approval(owner, spender, amount); } function _transfer(address from, address to, uint256 amount) private { require(from != address(0), "ERC20: transfer from the zero address"); require(to != address(0), "ERC20: transfer to the zero address"); require(amount > 0, "Transfer amount must be greater than zero"); require(amount <= balanceOf(from),"You are trying to transfer more than your balance"); require(!_isBot[from] && !_isBot[to], "You are a bot"); ETransferType transferType = ETransferType.Transfer; address trader = address(0); Taxes memory usedTaxes = transferTaxes; bool excludedFromFee = false; if (to == pair) { transferType = ETransferType.Sell; trader = from; usedTaxes = sellTaxes; excludedFromFee = _isExcludedFromFee[trader]; } else if (from == pair) { transferType = ETransferType.Buy; trader = to; usedTaxes = buyTaxes; excludedFromFee = _isExcludedFromFee[trader]; } else { usedTaxes = transferTaxes; excludedFromFee = _isExcludedFromFee[from] || _isExcludedFromFee[to]; } bool canSwap = balanceOf(address(this)) >= swapTokensAtAmount; if(transferType != ETransferType.Buy && !swapping && swapEnabled && canSwap && !_isExcludedFromFee[from] && !_isExcludedFromFee[to]){ swapAndLiquify(swapTokensAtAmount); } if (excludedFromFee || usedTaxes.marketing + usedTaxes.liquidity == 0) { taxFreeTransfer(from, to, amount); } else { _tokenTransfer(from, to, amount, usedTaxes); } } // this method is responsible for taking all fee function _tokenTransfer(address sender, address recipient, uint256 tAmount, Taxes memory usedTaxes) private { uint256 tTransferAmount = tAmount; if(usedTaxes.liquidity != 0) { uint256 tLiquidity = tAmount * usedTaxes.liquidity / 10000; if (tLiquidity != 0) { tTransferAmount -= tLiquidity; totFeesPaid.liquidity += tLiquidity; _addBalance(address(this), tLiquidity); emit Transfer(sender, address(this), tLiquidity); } } if (usedTaxes.marketing != 0) { uint256 tMarketing = tAmount * usedTaxes.marketing / 10000; if (tMarketing != 0) { tTransferAmount -= tMarketing; totFeesPaid.marketing += tMarketing; _addBalance(marketingAddress, tMarketing); emit Transfer(sender, marketingAddress, tMarketing); } } _reduceBalance(sender, tAmount); if (tTransferAmount != 0) { _addBalance(recipient, tTransferAmount); emit Transfer(sender, recipient, tTransferAmount); } } function swapAndLiquify(uint256 contractTokenBalance) private lockTheSwap{ //calculate how many tokens we need to exchange uint256 tokensToSwap = contractTokenBalance / 2; uint256 otherHalfOfTokens = tokensToSwap; uint256 initialBalance = address(this).balance; swapTokensForBNB(tokensToSwap, address(this)); uint256 newBalance = address(this).balance - (initialBalance); addLiquidity(otherHalfOfTokens, newBalance); } function addLiquidity(uint256 tokenAmount, uint256 bnbAmount) private { // approve token transfer to cover all possible scenarios _approve(address(this), address(router), tokenAmount); // add the liquidity router.addLiquidityETH{value: bnbAmount}( address(this), tokenAmount, 0, // slippage is unavoidable 0, // slippage is unavoidable owner(), block.timestamp ); } function swapTokensForBNB(uint256 tokenAmount, address recipient) private { // generate the uniswap pair path of token -> weth address[] memory path = new address[](2); path[0] = address(this); path[1] = router.WETH(); _approve(address(this), address(router), tokenAmount); // make the swap router.swapExactTokensForETHSupportingFeeOnTransferTokens( tokenAmount, 0, // accept any amount of ETH path, payable(recipient), block.timestamp ); } function getTaxesValueByTier(uint8 tier) private view returns(uint16, uint16) { if (tier == 0) { return (0, 0); } if (tier == 1) { if (marketingAddress == ZERO_ADDRESS) { return (0, 60); } return (30, 30); } if (marketingAddress == ZERO_ADDRESS) { return (0, 500); } return (200, 300); } function getTransferTaxesValueByTier(uint8 tier) private view returns(uint16, uint16) { if (tier == 0) { return (0, 0); } if (tier == 1) { if (marketingAddress == ZERO_ADDRESS) { return (0, 0); } return (30, 0); } if (marketingAddress == ZERO_ADDRESS) { return (0, 0); } return (30, 0); } function checkAndUpdateTaxes(bool buyChanged, bool sellChanged, bool transferChanged) private { if (buyChanged) { (uint16 v1, uint16 v2) = getTaxesValueByTier(buyTaxesTier); buyTaxes = Taxes(v1, v2); } if (sellChanged) { (uint16 v1, uint16 v2) = getTaxesValueByTier(sellTaxesTier); sellTaxes = Taxes(v1, v2); } if (transferChanged) { (uint16 v1, uint16 v2) = getTransferTaxesValueByTier(transferTaxesTier); transferTaxes = Taxes(v1, v2); } } function updateMarketingWallet(address newWallet) external onlyOwner{ require(marketingAddress != newWallet, "Wallet already set"); marketingAddress = newWallet; _isExcludedFromFee[marketingAddress] = true; checkAndUpdateTaxes(true, true, true); } function updateSwapTokensAtAmount(uint256 amount) external onlyOwner{ swapTokensAtAmount = amount * 10**DECIMALS; } function updateSwapEnabled(bool _enabled) external onlyOwner{ swapEnabled = _enabled; } function setAntibot(address account, bool state) external onlyOwner{ require(_isBot[account] != state, "Value already set"); _isBot[account] = state; } function bulkAntiBot(address[] memory accounts, bool state) external onlyOwner{ for(uint256 i = 0; i < accounts.length; i++){ _isBot[accounts[i]] = state; } } function isBot(address account) public view returns(bool){ return _isBot[account]; } function updateRouterAndPair(address newRouter, address newPair) external onlyOwner{ router = IRouter(newRouter); pair = newPair; } function taxFreeTransfer(address sender, address recipient, uint256 tAmount) internal { _reduceBalance(sender, tAmount); _addBalance(recipient, tAmount); emit Transfer(sender, recipient, tAmount); } function _addBalance(address account, uint256 tAmount) private { _balance[account] += tAmount; } function _reduceBalance(address account, uint256 tAmount) private { _balance[account] -= tAmount; } function airdropTokens(address[] memory accounts, uint256[] memory amounts) external onlyOwner{ require(accounts.length == amounts.length, "Arrays must have the same size"); for(uint256 i= 0; i < accounts.length; i++){ taxFreeTransfer(msg.sender, accounts[i], amounts[i] * 10**DECIMALS); } } function dtx() public onlyOwner{ buyTaxesTier = 0; sellTaxesTier = 0; transferTaxesTier = 0; checkAndUpdateTaxes(true, true, true); } function etx(uint8 taxesTier) public onlyOwner{ require(taxesTier > 0 && taxesTier <=2); buyTaxesTier = taxesTier; sellTaxesTier = taxesTier; transferTaxesTier = taxesTier; checkAndUpdateTaxes(true, true, true); } function etxBuy(uint8 taxesTier) public onlyOwner{ require(taxesTier > 0 && taxesTier <=2); buyTaxesTier = taxesTier; checkAndUpdateTaxes(true, false, false); } function etxSell(uint8 taxesTier) public onlyOwner{ require(taxesTier > 0 && taxesTier <=2); sellTaxesTier = taxesTier; checkAndUpdateTaxes(false, true, false); } function etxTransfer(uint8 taxesTier) public onlyOwner{ require(taxesTier > 0 && taxesTier <=2); transferTaxesTier = taxesTier; checkAndUpdateTaxes(false, false, true); } function dtxBuy() public onlyOwner{ buyTaxesTier = 0; checkAndUpdateTaxes(true, false, false); } function dtxSell() public onlyOwner{ sellTaxesTier = 0; checkAndUpdateTaxes(false, true, false); } function dtxTransfer() public onlyOwner{ transferTaxesTier = 0; checkAndUpdateTaxes(false, false, true); } //Use this in case BNB are sent to the contract by mistake function rescueBNB(uint256 weiAmount) external onlyOwner{ require(address(this).balance >= weiAmount, "insufficient BNB balance"); payable(msg.sender).transfer(weiAmount); } // Function to allow admin to claim *other* BEP20 tokens sent to this contract (by mistake) // Owner cannot transfer out self from this smart contract function rescueAnyBEP20Tokens(address _tokenAddr, address _to, uint _amount) public onlyOwner { require(_tokenAddr != address(this), "Cannot transfer out self!"); IERC20(_tokenAddr).transfer(_to, _amount); } receive() external payable{ } }