mirror of
https://github.com/pezkuwichain/pezkuwi-subxt.git
synced 2026-04-26 16:57:58 +00:00
c7a14db792
* meaningfull -> meaningful * initialise -> initialize * tokans -> tokens * incentivise -> incentivize * lenght -> length * incentivisation -> incentivization * doesnt't -> doesn't * overwriten -> overwritten * lifecycle -> life cycle * lifecycle -> life cycle * usefull -> useful * noone -> no one * spaming -> spamming * defered -> deferred * hieght -> height * sumation -> summation * ingore -> ignore * registed -> registered * Auxialary -> Auxiliary * loggin -> logging * independance -> independence * trailling -> trailing * responsability -> responsibility * trunkated -> truncated * Weither -> Whether * informations -> information * Runtume -> Runtime * choosen -> chosen * delcataion -> declaration * Unchekced -> Unchecked * defintion -> definition * scrach -> scratch * imput -> input * transfered -> transferred * endownment -> endowment * Determinator -> Determiner * relevent -> relevant * emited -> emitted * acocunt -> account * proprotional -> proportional * instantiaion -> instantiation * commited -> committed * tombstonedead -> tombstone * uwnrap -> unwrap * acount -> account * specialised -> specialized * existant -> existent * requried -> required * Anull -> Annul * AUTHORITES -> AUTHORITIES * underyling -> underlying * recognisable -> recognizable * Capitalise -> Capitalize * reportfor -> report for * hearbeat -> heartbeat * onlineness -> being online * creater -> creator * Bytearray -> Byte array * Despoit -> Deposit * substratced -> subtracted * Curent -> Current * imbalanes -> imbalances * countfown -> countdown * inexisting -> inexistent * additionaly -> additionally * substracted -> subtracted * auxilary -> auxiliary * parital -> partial * in't -> isn't * compatability -> compatibility * infomation -> information * etected -> detected * extrinsiscs -> extrinsics * reprensentation -> representation * coonfiguration -> configuration * primtives -> primitives * miscelanious -> miscellaneous * VERISON -> VERSION * endcoded -> encoded * Genrates -> Generates * miliseconds -> milliseconds * occured -> occurred * trully -> truely * truely -> truly * conjuction -> conjunction * encouters -> encounters * customised -> customized * deterministicly -> deterministically * finalisation -> finalization * pluggable -> plugable * wakeup -> wake-up * interemdiate -> intermediate * intepreting -> interpreting * finalzied -> finalized * throgh -> through * extinsic -> extrinsic * convient -> convenient * allocater -> allocator * propagateable -> propagatable * succesfuly -> successfully * finalising -> finalizing * publically -> publicly * phrasee -> phrase * substration -> substractions * substractions -> subtractions * neccessarily -> necessarily * Inlucde -> Include * unefficient -> inefficient * thay -> they * funtion -> function * datastructures -> data structures * infromation -> information * propagatable -> propagable * ecountered -> encountered * recognise -> recognize * intergration -> integration * lastet -> latest * datatypes -> data types * datatype -> data type * Strongarming -> Strong Arming * avaible -> available * Commiting -> Committing * Retreiving -> Retrieving * shoud -> should * canonicaliziation -> canonicalization * comitted -> committed * clonable -> cloneable * Uknown -> Unknown * reponse -> response * arbitary -> arbitrary * Capapbilities -> Capabilities * responsbile -> responsible * initialisation -> initialization * cames -> came * intemediate -> intermediate * reqeust -> request * intance -> instance * explcitly -> explicitly * neighor -> neighbor * reolving -> resolving * untill -> until * Validte -> Validate * deserailize -> deserialize * literaly -> literally * preceeding -> preceding * abpve -> above * chcecked -> checked * numbet -> number * Unknow -> Unknown * halfs -> halves * gossup -> gossip * givent -> given * immediatelly -> immediately * slicable -> sliceable * conensus -> consensus * Mimicks -> Mimics * acccept -> accept * serialise -> serialize * exstrinsics -> extrinsics * panicks -> panics * maintaince -> maintenance * repeatidely -> repeatedly * anecstor -> ancestor * becasue -> because * processer -> processor * Prunning -> Pruning * insterested -> interested * unuseful -> not useful * yeided -> yielded * descendfing -> descending * corresponts -> corresponds * survivew -> survive * keps -> keeps * ligh -> light * prerequisities -> prerequisites * positiion -> position * depedency -> dependency * extrinisic -> extrinsic * atomicaly -> atomically * staticly -> statically * resul -> result * timestamb -> timestamp * Utilites -> Utilities * ammount -> amount * pocess -> process * exteral -> external * Update client/finality-grandpa/src/tests.rs * Update primitives/io/src/lib.rs Co-Authored-By: joe petrowski <25483142+joepetrowski@users.noreply.github.com> * Update primitives/blockchain/src/lib.rs Co-Authored-By: joe petrowski <25483142+joepetrowski@users.noreply.github.com> * Update frame/support/src/weights.rs Co-Authored-By: joe petrowski <25483142+joepetrowski@users.noreply.github.com> * Update bin/node/cli/tests/common.rs Co-Authored-By: joe petrowski <25483142+joepetrowski@users.noreply.github.com> * Update client/api/src/execution_extensions.rs Co-Authored-By: joe petrowski <25483142+joepetrowski@users.noreply.github.com> * Update client/cli/src/params.rs Co-Authored-By: joe petrowski <25483142+joepetrowski@users.noreply.github.com> * Update client/executor/common/src/sandbox.rs Co-Authored-By: joe petrowski <25483142+joepetrowski@users.noreply.github.com> * Update client/api/src/execution_extensions.rs Co-Authored-By: joe petrowski <25483142+joepetrowski@users.noreply.github.com> * Update client/finality-grandpa/src/communication/mod.rs Co-Authored-By: joe petrowski <25483142+joepetrowski@users.noreply.github.com> * Update client/state-db/src/pruning.rs Co-Authored-By: joe petrowski <25483142+joepetrowski@users.noreply.github.com> * Update frame/contracts/src/tests.rs Co-Authored-By: joe petrowski <25483142+joepetrowski@users.noreply.github.com> * Update client/api/src/execution_extensions.rs * bump impl * timestamb -> timestamp Co-authored-by: joe petrowski <25483142+joepetrowski@users.noreply.github.com>
277 lines
8.8 KiB
Rust
277 lines
8.8 KiB
Rust
// Copyright 2020 Parity Technologies (UK) Ltd.
|
|
// This file is part of Substrate.
|
|
|
|
// Substrate 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.
|
|
|
|
// Substrate 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 Substrate. If not, see <http://www.gnu.org/licenses/>.
|
|
|
|
//! Defines data and logic needed for interaction with an WebAssembly instance of a substrate
|
|
//! runtime module.
|
|
|
|
use crate::util;
|
|
use crate::imports::Imports;
|
|
|
|
use sc_executor_common::error::{Error, Result};
|
|
use sp_wasm_interface::{Pointer, WordSize, Value};
|
|
use std::slice;
|
|
use std::marker;
|
|
use wasmtime::{Instance, Module, Memory, Table, Val};
|
|
|
|
/// Wrap the given WebAssembly Instance of a wasm module with Substrate-runtime.
|
|
///
|
|
/// This struct is a handy wrapper around a wasmtime `Instance` that provides substrate specific
|
|
/// routines.
|
|
pub struct InstanceWrapper {
|
|
instance: Instance,
|
|
// The memory instance of the `instance`.
|
|
//
|
|
// It is important to make sure that we don't make any copies of this to make it easier to proof
|
|
// See `memory_as_slice` and `memory_as_slice_mut`.
|
|
memory: Memory,
|
|
table: Option<Table>,
|
|
// Make this struct explicitly !Send & !Sync.
|
|
_not_send_nor_sync: marker::PhantomData<*const ()>,
|
|
}
|
|
|
|
impl InstanceWrapper {
|
|
/// Create a new instance wrapper from the given wasm module.
|
|
pub fn new(module: &Module, imports: &Imports, heap_pages: u32) -> Result<Self> {
|
|
let instance = Instance::new(module, &imports.externs)
|
|
.map_err(|e| Error::from(format!("cannot instantiate: {}", e)))?;
|
|
|
|
let memory = match imports.memory_import_index {
|
|
Some(memory_idx) => {
|
|
imports.externs[memory_idx]
|
|
.memory()
|
|
.expect("only memory can be at the `memory_idx`; qed")
|
|
.clone()
|
|
}
|
|
None => {
|
|
let memory = get_linear_memory(&instance)?;
|
|
if !memory.grow(heap_pages).is_ok() {
|
|
return Err("failed top increase the linear memory size".into());
|
|
}
|
|
memory
|
|
},
|
|
};
|
|
|
|
Ok(Self {
|
|
table: get_table(&instance),
|
|
memory,
|
|
instance,
|
|
_not_send_nor_sync: marker::PhantomData,
|
|
})
|
|
}
|
|
|
|
/// Resolves a substrate entrypoint by the given name.
|
|
///
|
|
/// An entrypoint must have a signature `(i32, i32) -> i64`, otherwise this function will return
|
|
/// an error.
|
|
pub fn resolve_entrypoint(&self, name: &str) -> Result<wasmtime::Func> {
|
|
// Resolve the requested method and verify that it has a proper signature.
|
|
let export = self
|
|
.instance
|
|
.get_export(name)
|
|
.ok_or_else(|| Error::from(format!("Exported method {} is not found", name)))?;
|
|
let entrypoint = export
|
|
.func()
|
|
.ok_or_else(|| Error::from(format!("Export {} is not a function", name)))?;
|
|
match (entrypoint.ty().params(), entrypoint.ty().results()) {
|
|
(&[wasmtime::ValType::I32, wasmtime::ValType::I32], &[wasmtime::ValType::I64]) => {}
|
|
_ => {
|
|
return Err(Error::from(format!(
|
|
"method {} have an unsupported signature",
|
|
name
|
|
)))
|
|
}
|
|
}
|
|
Ok(entrypoint.clone())
|
|
}
|
|
|
|
/// Returns an indirect function table of this instance.
|
|
pub fn table(&self) -> Option<&Table> {
|
|
self.table.as_ref()
|
|
}
|
|
|
|
/// Returns the byte size of the linear memory instance attached to this instance.
|
|
pub fn memory_size(&self) -> u32 {
|
|
self.memory.data_size() as u32
|
|
}
|
|
|
|
/// Reads `__heap_base: i32` global variable and returns it.
|
|
///
|
|
/// If it doesn't exist, not a global or of not i32 type returns an error.
|
|
pub fn extract_heap_base(&self) -> Result<u32> {
|
|
let heap_base_export = self
|
|
.instance
|
|
.get_export("__heap_base")
|
|
.ok_or_else(|| Error::from("__heap_base is not found"))?;
|
|
|
|
let heap_base_global = heap_base_export
|
|
.global()
|
|
.ok_or_else(|| Error::from("__heap_base is not a global"))?;
|
|
|
|
let heap_base = heap_base_global
|
|
.get()
|
|
.i32()
|
|
.ok_or_else(|| Error::from("__heap_base is not a i32"))?;
|
|
|
|
Ok(heap_base as u32)
|
|
}
|
|
|
|
/// Get the value from a global with the given `name`.
|
|
pub fn get_global_val(&self, name: &str) -> Result<Option<Value>> {
|
|
let global = match self.instance.get_export(name) {
|
|
Some(global) => global,
|
|
None => return Ok(None),
|
|
};
|
|
|
|
let global = global.global().ok_or_else(|| format!("`{}` is not a global", name))?;
|
|
|
|
match global.get() {
|
|
Val::I32(val) => Ok(Some(Value::I32(val))),
|
|
Val::I64(val) => Ok(Some(Value::I64(val))),
|
|
Val::F32(val) => Ok(Some(Value::F32(val))),
|
|
Val::F64(val) => Ok(Some(Value::F64(val))),
|
|
_ => Err("Unknown value type".into()),
|
|
}
|
|
}
|
|
}
|
|
|
|
/// Extract linear memory instance from the given instance.
|
|
fn get_linear_memory(instance: &Instance) -> Result<Memory> {
|
|
let memory_export = instance
|
|
.get_export("memory")
|
|
.ok_or_else(|| Error::from("memory is not exported under `memory` name"))?;
|
|
|
|
let memory = memory_export
|
|
.memory()
|
|
.ok_or_else(|| Error::from("the `memory` export should have memory type"))?
|
|
.clone();
|
|
|
|
Ok(memory)
|
|
}
|
|
|
|
/// Extract the table from the given instance if any.
|
|
fn get_table(instance: &Instance) -> Option<Table> {
|
|
instance
|
|
.get_export("__indirect_function_table")
|
|
.and_then(|export| export.table())
|
|
.cloned()
|
|
}
|
|
|
|
/// Functions realted to memory.
|
|
impl InstanceWrapper {
|
|
/// Read data from a slice of memory into a destination buffer.
|
|
///
|
|
/// Returns an error if the read would go out of the memory bounds.
|
|
pub fn read_memory_into(&self, address: Pointer<u8>, dest: &mut [u8]) -> Result<()> {
|
|
unsafe {
|
|
// This should be safe since we don't grow up memory while caching this reference and
|
|
// we give up the reference before returning from this function.
|
|
let memory = self.memory_as_slice();
|
|
|
|
let range = util::checked_range(address.into(), dest.len(), memory.len())
|
|
.ok_or_else(|| Error::Other("memory read is out of bounds".into()))?;
|
|
dest.copy_from_slice(&memory[range]);
|
|
Ok(())
|
|
}
|
|
}
|
|
|
|
/// Write data to a slice of memory.
|
|
///
|
|
/// Returns an error if the write would go out of the memory bounds.
|
|
pub fn write_memory_from(&self, address: Pointer<u8>, data: &[u8]) -> Result<()> {
|
|
unsafe {
|
|
// This should be safe since we don't grow up memory while caching this reference and
|
|
// we give up the reference before returning from this function.
|
|
let memory = self.memory_as_slice_mut();
|
|
|
|
let range = util::checked_range(address.into(), data.len(), memory.len())
|
|
.ok_or_else(|| Error::Other("memory write is out of bounds".into()))?;
|
|
&mut memory[range].copy_from_slice(data);
|
|
Ok(())
|
|
}
|
|
}
|
|
|
|
/// Allocate some memory of the given size. Returns pointer to the allocated memory region.
|
|
///
|
|
/// Returns `Err` in case memory cannot be allocated. Refer to the allocator documentation
|
|
/// to get more details.
|
|
pub fn allocate(
|
|
&self,
|
|
allocator: &mut sp_allocator::FreeingBumpHeapAllocator,
|
|
size: WordSize,
|
|
) -> Result<Pointer<u8>> {
|
|
unsafe {
|
|
// This should be safe since we don't grow up memory while caching this reference and
|
|
// we give up the reference before returning from this function.
|
|
let memory = self.memory_as_slice_mut();
|
|
|
|
allocator.allocate(memory, size).map_err(Into::into)
|
|
}
|
|
}
|
|
|
|
/// Deallocate the memory pointed by the given pointer.
|
|
///
|
|
/// Returns `Err` in case the given memory region cannot be deallocated.
|
|
pub fn deallocate(
|
|
&self,
|
|
allocator: &mut sp_allocator::FreeingBumpHeapAllocator,
|
|
ptr: Pointer<u8>,
|
|
) -> Result<()> {
|
|
unsafe {
|
|
// This should be safe since we don't grow up memory while caching this reference and
|
|
// we give up the reference before returning from this function.
|
|
let memory = self.memory_as_slice_mut();
|
|
|
|
allocator.deallocate(memory, ptr).map_err(Into::into)
|
|
}
|
|
}
|
|
|
|
/// Returns linear memory of the wasm instance as a slice.
|
|
///
|
|
/// # Safety
|
|
///
|
|
/// Wasmtime doesn't provide comprehensive documentation about the exact behavior of the data
|
|
/// pointer. If a dynamic style heap is used the base pointer of the heap can change. Since
|
|
/// growing, we cannot guarantee the lifetime of the returned slice reference.
|
|
unsafe fn memory_as_slice(&self) -> &[u8] {
|
|
let ptr = self.memory.data_ptr() as *const _;
|
|
let len = self.memory.data_size();
|
|
|
|
if len == 0 {
|
|
&[]
|
|
} else {
|
|
slice::from_raw_parts(ptr, len)
|
|
}
|
|
}
|
|
|
|
/// Returns linear memory of the wasm instance as a slice.
|
|
///
|
|
/// # Safety
|
|
///
|
|
/// See `[memory_as_slice]`. In addition to those requirements, since a mutable reference is
|
|
/// returned it must be ensured that only one mutable and no shared references to memory exists
|
|
/// at the same time.
|
|
unsafe fn memory_as_slice_mut(&self) -> &mut [u8] {
|
|
let ptr = self.memory.data_ptr();
|
|
let len = self.memory.data_size();
|
|
|
|
if len == 0 {
|
|
&mut []
|
|
} else {
|
|
slice::from_raw_parts_mut(ptr, len)
|
|
}
|
|
}
|
|
}
|