Module Tezos_raw_protocol_011_PtHangz2.Raw_context

Errors

type Tezos_protocol_environment_011_PtHangz2.Error_monad.error +=
  1. | Too_many_internal_operations
type missing_key_kind =
  1. | Get
  2. | Set
  3. | Del
  4. | Copy
type storage_error =
  1. | Incompatible_protocol_version of string
  2. | Missing_key of string list * missing_key_kind
  3. | Existing_key of string list
  4. | Corrupted_data of string list

An internal storage error that should not happen

type Tezos_protocol_environment_011_PtHangz2.Error_monad.error +=
  1. | Failed_to_parse_parameter of bytes

Abstract Context

type t

Abstract view of the context. Includes a handle to the functional key-value database (Context.t) along with some in-memory values (gas, etc.).

type root = t

Retrieves the state of the database and gives its abstract view. It also returns wether this is the first block validated with this version of the protocol.

type previous_protocol =
  1. | Genesis of Parameters_repr.t
  2. | Granada_010

Returns the state of the database resulting of operations on its abstract view

val current_level : t -> Level_repr.t
val predecessor_timestamp : t -> Tezos_protocol_environment_011_PtHangz2.Time.t
val set_current_fitness : t -> Tezos_protocol_environment_011_PtHangz2.Int64.t -> t
val constants : t -> Constants_repr.parametric
val cycle_eras : t -> Level_repr.cycle_eras

Retrieve the cycle eras.

Increment the current block fee stash that will be credited to baker's frozen_fees account at finalize_application

Increment the current block reward stash that will be credited to baker's frozen_fees account at finalize_application

val get_fees : t -> Tez_repr.t
val get_rewards : t -> Tez_repr.t
val set_gas_limit : t -> 'a Gas_limit_repr.Arith.t -> t
val set_gas_unlimited : t -> t
val gas_level : t -> Gas_limit_repr.t
val gas_consumed : since:t -> until:t -> Gas_limit_repr.Arith.fp
val remaining_operation_gas : t -> Gas_limit_repr.Arith.fp
val update_remaining_operation_gas : t -> Gas_limit_repr.Arith.fp -> t
val block_gas_level : t -> Gas_limit_repr.Arith.fp
val storage_space_to_pay : t -> Tezos_protocol_environment_011_PtHangz2.Z.t option
val init_storage_space_to_pay : t -> t
val update_storage_space_to_pay : t -> Tezos_protocol_environment_011_PtHangz2.Z.t -> t
val update_allocated_contracts_count : t -> t
val clear_storage_space_to_pay : t -> t * Tezos_protocol_environment_011_PtHangz2.Z.t * int
val unset_origination_nonce : t -> t

Generic accessors

type key = string list
type value = bytes
type tree
module type T = Raw_context_intf.T with type root := root and type key := key and type value := value and type tree := tree
include T with type t := t
include Raw_context_intf.VIEW with type key := key with type value := value with type tree := tree with type t := t

Getters

mem t k is an Lwt promise that resolves to true iff k is bound to a value in t.

mem_tree t k is like mem but for trees.

get t k is an Lwt promise that resolves to Ok v if k is bound to the value v in t and Storage_ErrorMissing_key otherwise.

get_tree is like get but for trees.

find t k is an Lwt promise that resolves to Some v if k is bound to the value v in t and None otherwise.

find_tree t k is like find but for trees.

val list : t -> ?offset:int -> ?length:int -> key -> (string * tree) list Tezos_protocol_environment_011_PtHangz2.Lwt.t

list t key is the list of files and sub-nodes stored under k in t. The result order is not specified but is stable.

offset and length are used for pagination.

Setters

init t k v is an Lwt promise that resolves to Ok c if:

  • k is unbound in t;
  • k is bound to v in c;
  • and c is similar to t otherwise.

It is Storage_errorExisting_key if k is already bound in t.

init_tree is like init but for trees.

update t k v is an Lwt promise that resolves to Ok c if:

  • k is bound in t;
  • k is bound to v in c;
  • and c is similar to t otherwise.

It is Storage_errorMissing_key if k is not already bound in t.

update_tree is like update but for trees.

add t k v is an Lwt promise that resolves to c such that:

  • k is bound to v in c;
  • and c is similar to t otherwise.

If k was already bound in t to a value that is physically equal to v, the result of the function is a promise that resolves to t. Otherwise, the previous binding of k in t disappears.

add_tree is like add but for trees.

remove t k v is an Lwt promise that resolves to c such that:

  • k is unbound in c;
  • and c is similar to t otherwise.

remove_existing t k v is an Lwt promise that resolves to Ok c if:

  • k is bound in t to a value;
  • k is unbound in c;
  • and c is similar to t otherwise.

remove_existing_tree t k v is an Lwt promise that reolves to Ok c if:

  • k is bound in t to a tree;
  • k is unbound in c;
  • and c is similar to t otherwise.
val add_or_remove : t -> key -> value option -> t Tezos_protocol_environment_011_PtHangz2.Lwt.t

add_or_remove t k v is:

  • add t k x if v is Some x;
  • remove t k otherwise.
val add_or_remove_tree : t -> key -> tree option -> t Tezos_protocol_environment_011_PtHangz2.Lwt.t

add_or_remove_tree t k v is:

  • add_tree t k x if v is Some x;
  • remove t k otherwise.

Folds

val fold : ?depth:[ `Eq of int | `Le of int | `Lt of int | `Ge of int | `Gt of int ] -> t -> key -> init:'a -> f:(key -> tree -> 'a -> 'a Tezos_protocol_environment_011_PtHangz2.Lwt.t) -> 'a Tezos_protocol_environment_011_PtHangz2.Lwt.t

fold ?depth t root ~init ~f recursively folds over the trees and values of t. The f callbacks are called with a key relative to root. f is never called with an empty key for values; i.e., folding over a value is a no-op.

Elements are traversed in lexical order of keys.

The depth is 0-indexed. If depth is set (by default it is not), then f is only called when the conditions described by the parameter is true:

  • Eq d folds over nodes and contents of depth exactly d.
  • Lt d folds over nodes and contents of depth strictly less than d.
  • Le d folds over nodes and contents of depth less than or equal to d.
  • Gt d folds over nodes and contents of depth strictly more than d.
  • Ge d folds over nodes and contents of depth more than or equal to d.
module Tree : Raw_context_intf.TREE with type t := t and type key := key and type value := value and type tree := tree

Tree provides immutable, in-memory partial mirror of the context, with lazy reads and delayed writes. The trees are Merkle trees that carry the same hash as the part of the context they mirror.

val project : t -> root

Internally used in Storage_functors to escape from a view.

val absolute_key : t -> key -> key

Internally used in Storage_functors to retrieve a full key from partial key relative a view.

Raised if block gas quota is exhausted during gas consumption.

Raised if operation gas quota is exhausted during gas consumption.

Internally used in Storage_functors to consume gas from within a view. May raise Block_quota_exceeded or Operation_quota_exceeded.

Check if consume_gas will fail

val description : t Storage_description.t
val reset_internal_nonce : t -> t

Initialize the local nonce used for preventing a script to duplicate an internal operation to replay it.

Increments the internal operation nonce.

val record_internal_nonce : t -> int -> t

Mark an internal operation nonce as taken.

val internal_nonce_already_recorded : t -> int -> bool

Check is the internal operation nonce has been taken.

Returns a map where to each endorser's pkh is associated the list of its endorsing slots (in increasing order) for a given level.

val included_endorsements : t -> int

Keep track of the number of endorsements that are included in a block

Initializes the map of allowed endorsements, this function must only be called once.

Marks an endorsement in the map as used.

val fold_map_temporary_lazy_storage_ids : t -> (Lazy_storage_kind.Temp_ids.t -> Lazy_storage_kind.Temp_ids.t * 'res) -> t * 'res