// Copyright 2019-2020 Parity Technologies (UK) Ltd.
// This file is part of Polkadot.
// Polkadot 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.
// Polkadot 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 Polkadot. If not, see .
//! Auctioning system to determine the set of Parachains in operation. This includes logic for the
//! auctioning mechanism and for reserving balance as part of the "payment". Unreserving the balance
//! happens elsewhere.
use sp_std::{prelude::*, mem::swap};
use sp_runtime::traits::{CheckedSub, Zero, One, Saturating};
use frame_support::{
decl_module, decl_storage, decl_event, decl_error, ensure, dispatch::DispatchResult,
traits::{Randomness, Currency, ReservableCurrency, Get, EnsureOrigin},
weights::{DispatchClass, Weight},
};
use primitives::v1::Id as ParaId;
use frame_system::{ensure_signed, ensure_root};
use crate::slot_range::SlotRange;
use crate::traits::{Leaser, LeaseError, Auctioneer, Registrar};
use parity_scale_codec::Decode;
type CurrencyOf = <::Leaser as Leaser>::Currency;
type BalanceOf =
<<::Leaser as Leaser>::Currency as Currency<::AccountId>>::Balance;
pub trait WeightInfo {
fn new_auction() -> Weight;
fn bid() -> Weight;
fn cancel_auction() -> Weight;
fn on_initialize() -> Weight;
}
pub struct TestWeightInfo;
impl WeightInfo for TestWeightInfo {
fn new_auction() -> Weight { 0 }
fn bid() -> Weight { 0 }
fn cancel_auction() -> Weight { 0 }
fn on_initialize() -> Weight { 0 }
}
/// The module's configuration trait.
pub trait Config: frame_system::Config {
/// The overarching event type.
type Event: From> + Into<::Event>;
/// The type representing the leasing system.
type Leaser: Leaser;
/// The parachain registrar type.
type Registrar: Registrar;
/// The number of blocks over which an auction may be retroactively ended.
type EndingPeriod: Get;
/// The length of each sample to take during the ending period.
///
/// EndingPeriod / SampleLength = Total # of Samples
type SampleLength: Get;
/// Something that provides randomness in the runtime.
type Randomness: Randomness;
/// The origin which may initiate auctions.
type InitiateOrigin: EnsureOrigin;
/// Weight Information for the Extrinsics in the Pallet
type WeightInfo: WeightInfo;
}
/// An auction index. We count auctions in this type.
pub type AuctionIndex = u32;
type LeasePeriodOf = <::Leaser as Leaser>::LeasePeriod;
// Winning data type. This encodes the top bidders of each range together with their bid.
type WinningData =
[Option<(::AccountId, ParaId, BalanceOf)>; SlotRange::SLOT_RANGE_COUNT];
// Winners data type. This encodes each of the final winners of a parachain auction, the parachain
// index assigned to them, their winning bid and the range that they won.
type WinnersData = Vec<(::AccountId, ParaId, BalanceOf, SlotRange)>;
// This module's storage items.
decl_storage! {
trait Store for Module as Auctions {
/// Number of auctions started so far.
pub AuctionCounter: AuctionIndex;
/// Information relating to the current auction, if there is one.
///
/// The first item in the tuple is the lease period index that the first of the four
/// contiguous lease periods on auction is for. The second is the block number when the
/// auction will "begin to end", i.e. the first block of the Ending Period of the auction.
pub AuctionInfo get(fn auction_info): Option<(LeasePeriodOf, T::BlockNumber)>;
/// Amounts currently reserved in the accounts of the bidders currently winning
/// (sub-)ranges.
pub ReservedAmounts get(fn reserved_amounts):
map hasher(twox_64_concat) (T::AccountId, ParaId) => Option>;
/// The winning bids for each of the 10 ranges at each sample in the final Ending Period of
/// the current auction. The map's key is the 0-based index into the Sample Size. The
/// first sample of the ending period is 0; the last is `Sample Size - 1`.
pub Winning get(fn winning): map hasher(twox_64_concat) T::BlockNumber => Option>;
}
}
decl_event!(
pub enum Event where
AccountId = ::AccountId,
BlockNumber = ::BlockNumber,
LeasePeriod = LeasePeriodOf,
ParaId = ParaId,
Balance = BalanceOf,
{
/// An auction started. Provides its index and the block number where it will begin to
/// close and the first lease period of the quadruplet that is auctioned.
/// [auction_index, lease_period, ending]
AuctionStarted(AuctionIndex, LeasePeriod, BlockNumber),
/// An auction ended. All funds become unreserved. [auction_index]
AuctionClosed(AuctionIndex),
/// Someone won the right to deploy a parachain. Balance amount is deducted for deposit.
/// [bidder, range, parachain_id, amount]
WonDeploy(AccountId, SlotRange, ParaId, Balance),
/// An existing parachain won the right to continue.
/// First balance is the extra amount reseved. Second is the total amount reserved.
/// [parachain_id, begin, count, total_amount]
WonRenewal(ParaId, LeasePeriod, LeasePeriod, Balance),
/// Funds were reserved for a winning bid. First balance is the extra amount reserved.
/// Second is the total. [bidder, extra_reserved, total_amount]
Reserved(AccountId, Balance, Balance),
/// Funds were unreserved since bidder is no longer active. [bidder, amount]
Unreserved(AccountId, Balance),
/// Someone attempted to lease the same slot twice for a parachain. The amount is held in reserve
/// but no parachain slot has been leased.
/// \[parachain_id, leaser, amount\]
ReserveConfiscated(ParaId, AccountId, Balance),
/// A new bid has been accepted as the current winner.
/// \[who, para_id, amount, first_slot, last_slot\]
BidAccepted(AccountId, ParaId, Balance, LeasePeriod, LeasePeriod),
/// The winning offset was chosen for an auction. This will map into the `Winning` storage map.
/// \[auction_index, block_number\]
WinningOffset(AuctionIndex, BlockNumber),
}
);
decl_error! {
pub enum Error for Module {
/// This auction is already in progress.
AuctionInProgress,
/// The lease period is in the past.
LeasePeriodInPast,
/// The origin for this call must be a parachain.
NotParaOrigin,
/// Para is not registered
ParaNotRegistered,
/// The parachain ID is not on-boarding.
ParaNotOnboarding,
/// The origin for this call must be the origin who registered the parachain.
InvalidOrigin,
/// Parachain is already registered.
AlreadyRegistered,
/// The code must correspond to the hash.
InvalidCode,
/// Deployment data has not been set for this parachain.
UnsetDeployData,
/// Not a current auction.
NotCurrentAuction,
/// Not an auction.
NotAuction,
/// Given code size is too large.
CodeTooLarge,
/// Given initial head data is too large.
HeadDataTooLarge,
/// Auction has already ended.
AuctionEnded,
}
}
decl_module! {
pub struct Module for enum Call where origin: T::Origin {
type Error = Error;
const EndingPeriod: T::BlockNumber = T::EndingPeriod::get();
const SampleLength: T::BlockNumber = T::SampleLength::get();
const SlotRangeCount: u32 = SlotRange::SLOT_RANGE_COUNT as u32;
const LeasePeriodsPerSlot: u32 = SlotRange::LEASE_PERIODS_PER_SLOT as u32;
fn deposit_event() = default;
fn on_initialize(n: T::BlockNumber) -> Weight {
let mut weight = T::DbWeight::get().reads(1);
// If the current auction was in its ending period last block, then ensure that the (sub-)range
// winner information is duplicated from the previous block in case no bids happened in the
// last block.
if let Some(offset) = Self::is_ending(n) {
weight = weight.saturating_add(T::DbWeight::get().reads(1));
if !Winning::::contains_key(&offset) {
weight = weight.saturating_add(T::DbWeight::get().writes(1));
let winning_data = offset.checked_sub(&One::one())
.and_then(Winning::::get)
.unwrap_or([Self::EMPTY; SlotRange::SLOT_RANGE_COUNT]);
Winning::::insert(offset, winning_data);
}
}
// Check to see if an auction just ended.
if let Some((winning_ranges, auction_lease_period_index)) = Self::check_auction_end(n) {
// Auction is ended now. We have the winning ranges and the lease period index which
// acts as the offset. Handle it.
Self::manage_auction_end(
auction_lease_period_index,
winning_ranges,
);
weight = weight.saturating_add(T::WeightInfo::on_initialize());
}
weight
}
/// Create a new auction.
///
/// This can only happen when there isn't already an auction in progress and may only be
/// called by the root origin. Accepts the `duration` of this auction and the
/// `lease_period_index` of the initial lease period of the four that are to be auctioned.
#[weight = (T::WeightInfo::new_auction(), DispatchClass::Operational)]
pub fn new_auction(origin,
#[compact] duration: T::BlockNumber,
#[compact] lease_period_index: LeasePeriodOf,
) {
T::InitiateOrigin::ensure_origin(origin)?;
ensure!(!Self::is_in_progress(), Error::::AuctionInProgress);
ensure!(lease_period_index >= T::Leaser::lease_period_index(), Error::::LeasePeriodInPast);
// Bump the counter.
let n = AuctionCounter::mutate(|n| { *n += 1; *n });
// Set the information.
let ending = frame_system::Pallet::::block_number().saturating_add(duration);
AuctionInfo::::put((lease_period_index, ending));
Self::deposit_event(RawEvent::AuctionStarted(n, lease_period_index, ending))
}
/// Make a new bid from an account (including a parachain account) for deploying a new
/// parachain.
///
/// Multiple simultaneous bids from the same bidder are allowed only as long as all active
/// bids overlap each other (i.e. are mutually exclusive). Bids cannot be redacted.
///
/// - `sub` is the sub-bidder ID, allowing for multiple competing bids to be made by (and
/// funded by) the same account.
/// - `auction_index` is the index of the auction to bid on. Should just be the present
/// value of `AuctionCounter`.
/// - `first_slot` is the first lease period index of the range to bid on. This is the
/// absolute lease period index value, not an auction-specific offset.
/// - `last_slot` is the last lease period index of the range to bid on. This is the
/// absolute lease period index value, not an auction-specific offset.
/// - `amount` is the amount to bid to be held as deposit for the parachain should the
/// bid win. This amount is held throughout the range.
#[weight = T::WeightInfo::bid()]
pub fn bid(origin,
#[compact] para: ParaId,
#[compact] auction_index: AuctionIndex,
#[compact] first_slot: LeasePeriodOf,
#[compact] last_slot: LeasePeriodOf,
#[compact] amount: BalanceOf
) {
let who = ensure_signed(origin)?;
Self::handle_bid(who, para, auction_index, first_slot, last_slot, amount)?;
}
/// Cancel an in-progress auction.
///
/// Can only be called by Root origin.
#[weight = T::WeightInfo::cancel_auction()]
pub fn cancel_auction(origin) {
ensure_root(origin)?;
// Unreserve all bids.
for ((bidder, _), amount) in ReservedAmounts::::drain() {
CurrencyOf::::unreserve(&bidder, amount);
}
Winning::::remove_all();
AuctionInfo::::kill();
}
}
}
impl Auctioneer for Module {
type AccountId = T::AccountId;
type BlockNumber = T::BlockNumber;
type LeasePeriod = T::BlockNumber;
type Currency = CurrencyOf;
fn new_auction(
duration: T::BlockNumber,
lease_period_index: LeasePeriodOf,
) -> DispatchResult {
Self::do_new_auction(duration, lease_period_index)
}
// Returns whether the auction is ending, and which sample number we are on.
fn is_ending(now: Self::BlockNumber) -> Option {
if let Some((_, early_end)) = AuctionInfo::::get() {
if let Some(after_early_end) = now.checked_sub(&early_end) {
if after_early_end < T::EndingPeriod::get() {
return Some(after_early_end / T::SampleLength::get())
}
}
}
None
}
fn place_bid(
bidder: T::AccountId,
para: ParaId,
first_slot: LeasePeriodOf,
last_slot: LeasePeriodOf,
amount: BalanceOf,
) -> DispatchResult {
Self::handle_bid(bidder, para, AuctionCounter::get(), first_slot, last_slot, amount)
}
fn lease_period_index() -> Self::LeasePeriod {
T::Leaser::lease_period_index()
}
fn lease_period() -> Self::LeasePeriod {
T::Leaser::lease_period()
}
fn has_won_an_auction(para: ParaId, bidder: &T::AccountId) -> bool {
!T::Leaser::deposit_held(para, bidder).is_zero()
}
}
impl Module {
// A trick to allow me to initialize large arrays with nothing in them.
const EMPTY: Option<(::AccountId, ParaId, BalanceOf)> = None;
/// True if an auction is in progress.
pub fn is_in_progress() -> bool {
AuctionInfo::::get().map_or(false, |(_, early_end)| {
let late_end = early_end.saturating_add(T::EndingPeriod::get());
// We need to check that the auction isn't in the period where it has definitely ended, but yeah we keep the
// info around because we haven't yet decided *exactly* when in the `EndingPeriod` that it ended.
let now = frame_system::Pallet::::block_number();
now < late_end
})
}
/// Create a new auction.
///
/// This can only happen when there isn't already an auction in progress. Accepts the `duration`
/// of this auction and the `lease_period_index` of the initial lease period of the four that
/// are to be auctioned.
fn do_new_auction(
duration: T::BlockNumber,
lease_period_index: LeasePeriodOf,
) -> DispatchResult {
ensure!(!Self::is_in_progress(), Error::::AuctionInProgress);
ensure!(lease_period_index >= T::Leaser::lease_period_index(), Error::::LeasePeriodInPast);
// Bump the counter.
let n = AuctionCounter::mutate(|n| { *n += 1; *n });
// Set the information.
let ending = frame_system::Pallet::::block_number().saturating_add(duration);
AuctionInfo::::put((lease_period_index, ending));
Self::deposit_event(RawEvent::AuctionStarted(n, lease_period_index, ending));
Ok(())
}
/// Actually place a bid in the current auction.
///
/// - `bidder`: The account that will be funding this bid.
/// - `auction_index`: The auction index of the bid. For this to succeed, must equal
/// the current value of `AuctionCounter`.
/// - `first_slot`: The first lease period index of the range to be bid on.
/// - `last_slot`: The last lease period index of the range to be bid on (inclusive).
/// - `amount`: The total amount to be the bid for deposit over the range.
pub fn handle_bid(
bidder: T::AccountId,
para: ParaId,
auction_index: u32,
first_slot: LeasePeriodOf,
last_slot: LeasePeriodOf,
amount: BalanceOf,
) -> DispatchResult {
// Ensure para is registered before placing a bid on it.
ensure!(T::Registrar::is_registered(para), Error::::ParaNotRegistered);
// Bidding on latest auction.
ensure!(auction_index == AuctionCounter::get(), Error::::NotCurrentAuction);
// Assume it's actually an auction (this should never fail because of above).
let (first_lease_period, early_end) = AuctionInfo::::get().ok_or(Error::::NotAuction)?;
let late_end = early_end.saturating_add(T::EndingPeriod::get());
// We need to check that the auction isn't in the period where it has definitely ended, but yeah we keep the
// info around because we haven't yet decided *exactly* when in the `EndingPeriod` that it ended.
let now = frame_system::Pallet::::block_number();
ensure!(now < late_end, Error::::AuctionEnded);
// Our range.
let range = SlotRange::new_bounded(first_lease_period, first_slot, last_slot)?;
// Range as an array index.
let range_index = range as u8 as usize;
// The offset into the ending samples of the auction.
let offset = Self::is_ending(frame_system::Pallet::::block_number()).unwrap_or_default();
// The current winning ranges.
let mut current_winning = Winning::::get(offset)
.or_else(|| offset.checked_sub(&One::one()).and_then(Winning::::get))
.unwrap_or([Self::EMPTY; SlotRange::SLOT_RANGE_COUNT]);
// If this bid beat the previous winner of our range.
if current_winning[range_index].as_ref().map_or(true, |last| amount > last.2) {
// Ok; we are the new winner of this range - reserve the additional amount and record.
// Get the amount already held on deposit if this is a renewal bid (i.e. there's
// an existing lease on the same para by the same leaser).
let existing_lease_deposit = T::Leaser::deposit_held(para, &bidder);
let reserve_required = amount.saturating_sub(existing_lease_deposit);
// Get the amount already reserved in any prior and still active bids by us.
let bidder_para = (bidder.clone(), para);
let already_reserved = ReservedAmounts::::get(&bidder_para).unwrap_or_default();
// If these don't already cover the bid...
if let Some(additional) = reserve_required.checked_sub(&already_reserved) {
// ...then reserve some more funds from their account, failing if there's not
// enough funds.
CurrencyOf::::reserve(&bidder, additional)?;
// ...and record the amount reserved.
ReservedAmounts::::insert(&bidder_para, reserve_required);
Self::deposit_event(RawEvent::Reserved(
bidder.clone(),
additional,
reserve_required,
));
}
// Return any funds reserved for the previous winner if they no longer have any active
// bids.
let mut outgoing_winner = Some((bidder.clone(), para, amount));
swap(&mut current_winning[range_index], &mut outgoing_winner);
if let Some((who, para, _amount)) = outgoing_winner {
if current_winning.iter()
.filter_map(Option::as_ref)
.all(|&(ref other, other_para, _)| other != &who || other_para != para)
{
// Previous bidder is no longer winning any ranges: unreserve their funds.
if let Some(amount) = ReservedAmounts::::take(&(who.clone(), para)) {
// It really should be reserved; there's not much we can do here on fail.
let err_amt = CurrencyOf::::unreserve(&who, amount);
debug_assert!(err_amt.is_zero());
Self::deposit_event(RawEvent::Unreserved(who, amount));
}
}
}
// Update the range winner.
Winning::::insert(offset, ¤t_winning);
Self::deposit_event(RawEvent::BidAccepted(bidder, para, amount, first_slot, last_slot));
}
Ok(())
}
/// Some when the auction's end is known (with the end block number). None if it is unknown.
/// If `Some` then the block number must be at most the previous block and at least the
/// previous block minus `T::EndingPeriod::get()`.
///
/// This mutates the state, cleaning up `AuctionInfo` and `Winning` in the case of an auction
/// ending. An immediately subsequent call with the same argument will always return `None`.
fn check_auction_end(now: T::BlockNumber) -> Option<(WinningData, LeasePeriodOf)> {
if let Some((lease_period_index, early_end)) = AuctionInfo::::get() {
let ending_period = T::EndingPeriod::get();
let late_end = early_end.saturating_add(ending_period);
let is_ended = now >= late_end;
if is_ended {
// auction definitely ended.
// check to see if we can determine the actual ending point.
let (raw_offset, known_since) = T::Randomness::random(&b"para_auction"[..]);
if late_end <= known_since {
// Our random seed was known only after the auction ended. Good to use.
let raw_offset_block_number = ::decode(&mut raw_offset.as_ref())
.expect("secure hashes should always be bigger than the block number; qed");
let offset = (raw_offset_block_number % ending_period) / T::SampleLength::get();
let auction_counter = AuctionCounter::get();
Self::deposit_event(RawEvent::WinningOffset(auction_counter, offset));
let res = Winning::::get(offset).unwrap_or([Self::EMPTY; SlotRange::SLOT_RANGE_COUNT]);
let mut i = T::BlockNumber::zero();
while i < ending_period {
Winning::::remove(i);
i += One::one();
}
AuctionInfo::::kill();
return Some((res, lease_period_index))
}
}
}
None
}
/// Auction just ended. We have the current lease period, the auction's lease period (which
/// is guaranteed to be at least the current period) and the bidders that were winning each
/// range at the time of the auction's close.
fn manage_auction_end(
auction_lease_period_index: LeasePeriodOf,
winning_ranges: WinningData,
) {
// First, unreserve all amounts that were reserved for the bids. We will later re-reserve the
// amounts from the bidders that ended up being assigned the slot so there's no need to
// special-case them here.
for ((bidder, _), amount) in ReservedAmounts::::drain() {
CurrencyOf::::unreserve(&bidder, amount);
}
// Next, calculate the winning combination of slots and thus the final winners of the
// auction.
let winners = Self::calculate_winners(winning_ranges);
// Go through those winners and re-reserve their bid, updating our table of deposits
// accordingly.
for (leaser, para, amount, range) in winners.into_iter() {
let begin_offset = LeasePeriodOf::::from(range.as_pair().0 as u32);
let period_begin = auction_lease_period_index + begin_offset;
let period_count = LeasePeriodOf::::from(range.len() as u32);
match T::Leaser::lease_out(para, &leaser, amount, period_begin, period_count) {
Err(LeaseError::ReserveFailed) | Err(LeaseError::AlreadyEnded) => {
// Should never happen since we just unreserved this amount (and our offset is from the
// present period). But if it does, there's not much we can do.
}
Err(LeaseError::AlreadyLeased) => {
// The leaser attempted to get a second lease on the same para ID, possibly griefing us. Let's
// keep the amount reserved and let governance sort it out.
if CurrencyOf::::reserve(&leaser, amount).is_ok() {
Self::deposit_event(RawEvent::ReserveConfiscated(para, leaser, amount));
}
}
Ok(()) => {}, // Nothing to report.
}
}
Self::deposit_event(RawEvent::AuctionClosed(AuctionCounter::get()));
}
/// Calculate the final winners from the winning slots.
///
/// This is a simple dynamic programming algorithm designed by Al, the original code is at:
/// https://github.com/w3f/consensus/blob/master/NPoS/auctiondynamicthing.py
fn calculate_winners(
mut winning: WinningData
) -> WinnersData {
let winning_ranges = {
let mut best_winners_ending_at:
[(Vec, BalanceOf); SlotRange::LEASE_PERIODS_PER_SLOT] = Default::default();
let best_bid = |range: SlotRange| {
winning[range as u8 as usize].as_ref()
.map(|(_, _, amount)| *amount * (range.len() as u32).into())
};
for i in 0..SlotRange::LEASE_PERIODS_PER_SLOT {
let r = SlotRange::new_bounded(0, 0, i as u32).expect("`i < 4`; qed");
if let Some(bid) = best_bid(r) {
best_winners_ending_at[i] = (vec![r], bid);
}
for j in 0..i {
let r = SlotRange::new_bounded(0, j as u32 + 1, i as u32)
.expect("`i < LPPS`; `j < i`; `j + 1 < LPPS`; qed");
if let Some(mut bid) = best_bid(r) {
bid += best_winners_ending_at[j].1;
if bid > best_winners_ending_at[i].1 {
let mut new_winners = best_winners_ending_at[j].0.clone();
new_winners.push(r);
best_winners_ending_at[i] = (new_winners, bid);
}
} else {
if best_winners_ending_at[j].1 > best_winners_ending_at[i].1 {
best_winners_ending_at[i] = best_winners_ending_at[j].clone();
}
}
}
}
best_winners_ending_at[SlotRange::LEASE_PERIODS_PER_SLOT - 1].0.clone()
};
winning_ranges.into_iter().map(|range| {
let mut final_winner = Default::default();
swap(&mut final_winner, winning[range as u8 as usize].as_mut()
.expect("none values are filtered out in previous logic; qed"));
let (bidder, para, amount) = final_winner;
(bidder, para, amount, range)
}).collect::>()
}
}
/// tests for this module
#[cfg(test)]
mod tests {
use super::*;
use std::{collections::BTreeMap, cell::RefCell};
use sp_core::H256;
use sp_runtime::traits::{BlakeTwo256, IdentityLookup};
use frame_support::{
parameter_types, ord_parameter_types, assert_ok, assert_noop, assert_storage_noop,
traits::{OnInitialize, OnFinalize},
dispatch::DispatchError::BadOrigin,
};
use frame_system::{EnsureSignedBy, EnsureOneOf, EnsureRoot};
use pallet_balances;
use crate::{auctions, mock::TestRegistrar};
use primitives::v1::{BlockNumber, Header, Id as ParaId};
type UncheckedExtrinsic = frame_system::mocking::MockUncheckedExtrinsic;
type Block = frame_system::mocking::MockBlock;
frame_support::construct_runtime!(
pub enum Test where
Block = Block,
NodeBlock = Block,
UncheckedExtrinsic = UncheckedExtrinsic,
{
System: frame_system::{Pallet, Call, Config, Storage, Event},
Balances: pallet_balances::{Pallet, Call, Storage, Config, Event},
Auctions: auctions::{Pallet, Call, Storage, Event},
}
);
parameter_types! {
pub const BlockHashCount: u32 = 250;
}
impl frame_system::Config for Test {
type BaseCallFilter = ();
type BlockWeights = ();
type BlockLength = ();
type DbWeight = ();
type Origin = Origin;
type Call = Call;
type Index = u64;
type BlockNumber = BlockNumber;
type Hash = H256;
type Hashing = BlakeTwo256;
type AccountId = u64;
type Lookup = IdentityLookup;
type Header = Header;
type Event = Event;
type BlockHashCount = BlockHashCount;
type Version = ();
type PalletInfo = PalletInfo;
type AccountData = pallet_balances::AccountData;
type OnNewAccount = ();
type OnKilledAccount = ();
type SystemWeightInfo = ();
type SS58Prefix = ();
type OnSetCode = ();
}
parameter_types! {
pub const ExistentialDeposit: u64 = 1;
}
impl pallet_balances::Config for Test {
type Balance = u64;
type DustRemoval = ();
type Event = Event;
type ExistentialDeposit = ExistentialDeposit;
type AccountStore = System;
type WeightInfo = ();
type MaxLocks = ();
}
#[derive(Eq, PartialEq, Ord, PartialOrd, Clone, Copy, Debug)]
pub struct LeaseData {
leaser: u64,
amount: u64,
}
thread_local! {
pub static LEASES:
RefCell> = RefCell::new(BTreeMap::new());
}
fn leases() -> Vec<((ParaId, BlockNumber), LeaseData)> {
LEASES.with(|p| (&*p.borrow()).clone().into_iter().collect::>())
}
pub struct TestLeaser;
impl Leaser for TestLeaser {
type AccountId = u64;
type LeasePeriod = BlockNumber;
type Currency = Balances;
fn lease_out(
para: ParaId,
leaser: &Self::AccountId,
amount: >::Balance,
period_begin: Self::LeasePeriod,
period_count: Self::LeasePeriod,
) -> Result<(), LeaseError> {
LEASES.with(|l| {
let mut leases = l.borrow_mut();
if period_begin < Self::lease_period_index() {
return Err(LeaseError::AlreadyEnded)
}
for period in period_begin..(period_begin + period_count) {
if leases.contains_key(&(para, period)) {
return Err(LeaseError::AlreadyLeased)
}
leases.insert((para, period), LeaseData { leaser: leaser.clone(), amount });
}
Ok(())
})
}
fn deposit_held(
para: ParaId,
leaser: &Self::AccountId
) -> >::Balance {
leases().iter()
.filter_map(|((id, _period), data)|
if id == ¶ && &data.leaser == leaser { Some(data.amount) } else { None }
)
.max()
.unwrap_or_default()
}
fn lease_period() -> Self::LeasePeriod {
10
}
fn lease_period_index() -> Self::LeasePeriod {
(System::block_number() / Self::lease_period()).into()
}
}
ord_parameter_types!{
pub const Six: u64 = 6;
}
type RootOrSix = EnsureOneOf<
u64,
EnsureRoot,
EnsureSignedBy,
>;
thread_local! {
pub static LAST_RANDOM: RefCell