package tezos-protocol-012-Psithaca

  1. Overview
  2. Docs
Legend:
Page
Library
Module
Module type
Parameter
Class
Class type
Source

Module Tezos_raw_protocol_012_Psithaca.Raw_contextSource

Errors

Sourcetype missing_key_kind =
  1. | Get
  2. | Set
  3. | Del
  4. | Copy
Sourcetype 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

Sourcetype Tezos_protocol_environment_012_Psithaca.Error_monad.error +=
  1. | Failed_to_parse_parameter of bytes

Abstract Context

Sourcetype 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.).

Sourcetype 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.

Sourcetype previous_protocol =
  1. | Genesis of Parameters_repr.t
  2. | Hangzhou_011

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

Sourceval current_level : t -> Level_repr.t
Sourceval round_durations : t -> Round_repr.Durations.t
Sourceval cycle_eras : t -> Level_repr.cycle_eras

Retrieve the cycle eras.

Sourceval credit_collected_fees_only_call_from_token : t -> Tez_repr.t -> t Tezos_protocol_environment_012_Psithaca.Error_monad.tzresult

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

Sourceval spend_collected_fees_only_call_from_token : t -> Tez_repr.t -> t Tezos_protocol_environment_012_Psithaca.Error_monad.tzresult

Decrement the current block fee stash that will be credited to the payload producer's account at finalize_application

Sourceval get_collected_fees : t -> Tez_repr.t

Returns the current block fee stash that will be credited to the payload producer's account at finalize_application

Sourceval set_gas_limit : t -> 'a Gas_limit_repr.Arith.t -> t
Sourceval set_gas_unlimited : t -> t
Sourceval gas_level : t -> Gas_limit_repr.t
Sourceval gas_consumed : since:t -> until:t -> Gas_limit_repr.Arith.fp
Sourceval remaining_operation_gas : t -> Gas_limit_repr.Arith.fp
Sourceval update_remaining_operation_gas : t -> Gas_limit_repr.Arith.fp -> t
Sourceval block_gas_level : t -> Gas_limit_repr.Arith.fp
Sourceval update_remaining_block_gas : t -> Gas_limit_repr.Arith.fp -> t
Sourceval unset_origination_nonce : t -> t

Generic accessors

Sourcetype key = string list
Sourcetype value = bytes
Sourcetype tree
Sourcemodule 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.

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.

Sourceval list : t -> ?offset:int -> ?length:int -> key -> (string * tree) list Tezos_protocol_environment_012_Psithaca.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.

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.

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.

add_or_remove t k v is:

  • add t k x if v is Some x;
  • remove t k otherwise.
Sourceval add_or_remove_tree : t -> key -> tree option -> t Tezos_protocol_environment_012_Psithaca.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

Sourceval fold : ?depth:[ `Eq of int | `Le of int | `Lt of int | `Ge of int | `Gt of int ] -> t -> key -> order:[ `Sorted | `Undefined ] -> init:'a -> f:(key -> tree -> 'a -> 'a Tezos_protocol_environment_012_Psithaca.Lwt.t) -> 'a Tezos_protocol_environment_012_Psithaca.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.
Sourcemodule 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.

Sourceval project : t -> root

Internally used in Storage_functors to escape from a view.

Sourceval 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.

Check if consume_gas will fail

Sourceval description : t Storage_description.t
Sourceval 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.

Sourceval record_internal_nonce : t -> int -> t

Mark an internal operation nonce as taken.

Sourceval internal_nonce_already_recorded : t -> int -> bool

Check is the internal operation nonce has been taken.

Sourceval fold_map_temporary_lazy_storage_ids : t -> (Lazy_storage_kind.Temp_ids.t -> Lazy_storage_kind.Temp_ids.t * 'res) -> t * 'res
Sourceval record_non_consensus_operation_hash : t -> Tezos_protocol_environment_012_Psithaca.Operation_hash.t -> t

set_sampler_for_cycle ctxt cycle sampler evaluates to Ok c with c verifying sampler_for_cycle c cycle = sampler if no sampler was set for the same cycle beforehand. In the other case, it returns Error `Sampler_already_set.

sampler_for_cycle ctxt cycle evaluates to Ok sampler if a sampler was set for cycle using set_sampler_for_cycle. Otherwise, it returns Error `Sampler_not_set.

Sourcemodule type CONSENSUS = sig ... end
Sourcemodule Consensus : CONSENSUS with type t := t and type slot := Slot_repr.t and type 'a slot_map := 'a Slot_repr.Map.t and type slot_set := Slot_repr.Set.t and type round := Round_repr.t
OCaml

Innovation. Community. Security.