pallas/pallas-miniprotocols/src/chainsync/codec.rs
2022-02-26 17:14:48 -03:00

196 lines
5.6 KiB
Rust

use crate::common::Point;
use crate::machines::{CodecError, DecodePayload, EncodePayload, PayloadDecoder, PayloadEncoder};
use super::{BlockContent, HeaderContent, Message, SkippedContent, Tip};
impl EncodePayload for Tip {
fn encode_payload(&self, e: &mut PayloadEncoder) -> Result<(), Box<dyn std::error::Error>> {
e.array(2)?;
self.0.encode_payload(e)?;
e.u64(self.1)?;
Ok(())
}
}
impl DecodePayload for Tip {
fn decode_payload(d: &mut PayloadDecoder) -> Result<Self, Box<dyn std::error::Error>> {
d.array()?;
let point = Point::decode_payload(d)?;
let block_num = d.u64()?;
Ok(Tip(point, block_num))
}
}
impl<C> EncodePayload for Message<C>
where
C: EncodePayload,
{
fn encode_payload(&self, e: &mut PayloadEncoder) -> Result<(), Box<dyn std::error::Error>> {
match self {
Message::RequestNext => {
e.array(1)?.u16(0)?;
Ok(())
}
Message::AwaitReply => {
e.array(1)?.u16(1)?;
Ok(())
}
Message::RollForward(content, tip) => {
e.array(3)?.u16(2)?;
content.encode_payload(e)?;
tip.encode_payload(e)?;
Ok(())
}
Message::RollBackward(point, tip) => {
e.array(3)?.u16(3)?;
point.encode_payload(e)?;
tip.encode_payload(e)?;
Ok(())
}
Message::FindIntersect(points) => {
e.array(2)?.u16(4)?;
e.array(points.len() as u64)?;
for point in points.iter() {
point.encode_payload(e)?;
}
Ok(())
}
Message::IntersectFound(point, tip) => {
e.array(3)?.u16(5)?;
point.encode_payload(e)?;
tip.encode_payload(e)?;
Ok(())
}
Message::IntersectNotFound(tip) => {
e.array(1)?.u16(6)?;
tip.encode_payload(e)?;
Ok(())
}
Message::Done => {
e.array(1)?.u16(7)?;
Ok(())
}
}
}
}
impl<C> DecodePayload for Message<C>
where
C: DecodePayload,
{
fn decode_payload(d: &mut PayloadDecoder) -> Result<Self, Box<dyn std::error::Error>> {
d.array()?;
let label = d.u16()?;
match label {
0 => Ok(Message::RequestNext),
1 => Ok(Message::AwaitReply),
2 => {
let content = C::decode_payload(d)?;
let tip = Tip::decode_payload(d)?;
Ok(Message::RollForward(content, tip))
}
3 => {
let point = Point::decode_payload(d)?;
let tip = Tip::decode_payload(d)?;
Ok(Message::RollBackward(point, tip))
}
4 => {
let points = Vec::<Point>::decode_payload(d)?;
Ok(Message::FindIntersect(points))
}
5 => {
let point = Point::decode_payload(d)?;
let tip = Tip::decode_payload(d)?;
Ok(Message::IntersectFound(point, tip))
}
6 => {
let tip = Tip::decode_payload(d)?;
Ok(Message::IntersectNotFound(tip))
}
7 => Ok(Message::Done),
x => Err(Box::new(CodecError::BadLabel(x))),
}
}
}
impl DecodePayload for HeaderContent {
fn decode_payload(d: &mut crate::PayloadDecoder) -> Result<Self, Box<dyn std::error::Error>> {
d.array()?;
let variant = d.u8()?; // era variant
match variant {
// byron
0 => {
d.array()?;
// can't find a reference anywhere about the structure of these values, but they
// seem to provide the Byron-specific variant of the header
let (a, b): (u8, u64) = d.decode()?;
d.tag()?;
let bytes = d.bytes()?;
Ok(HeaderContent {
variant,
byron_prefix: Some((a, b)),
cbor: Vec::from(bytes),
})
}
// shelley and beyond
_ => {
d.tag()?;
let bytes = d.bytes()?;
Ok(HeaderContent {
variant,
byron_prefix: None,
cbor: Vec::from(bytes),
})
}
}
}
}
impl EncodePayload for HeaderContent {
fn encode_payload(
&self,
_e: &mut crate::PayloadEncoder,
) -> Result<(), Box<dyn std::error::Error>> {
todo!()
}
}
impl DecodePayload for BlockContent {
fn decode_payload(d: &mut crate::PayloadDecoder) -> Result<Self, Box<dyn std::error::Error>> {
d.tag()?;
let bytes = d.bytes()?;
Ok(BlockContent(Vec::from(bytes)))
}
}
impl EncodePayload for BlockContent {
fn encode_payload(
&self,
_e: &mut crate::PayloadEncoder,
) -> Result<(), Box<dyn std::error::Error>> {
todo!()
}
}
impl DecodePayload for SkippedContent {
fn decode_payload(d: &mut crate::PayloadDecoder) -> Result<Self, Box<dyn std::error::Error>> {
d.skip()?;
Ok(SkippedContent)
}
}
impl EncodePayload for SkippedContent {
fn encode_payload(
&self,
_e: &mut crate::PayloadEncoder,
) -> Result<(), Box<dyn std::error::Error>> {
Ok(())
}
}