Ernie - binary encoding format based on External Term Format (Erlang)

栏目: IT技术 · 发布时间: 6年前

内容简介:Simple binary data exchange format that is based onErnie is fun over the original BERT name, from the Sesame Street Bert & Ernie couple.No, this document will not define RPC syntax because of 2 reasons:

Ernie

Simple binary data exchange format that is based on External Term Format in Erlang. This is update on BERT which is a little bit outdated right now.

Name

Ernie is fun over the original BERT name, from the Sesame Street Bert & Ernie couple.

RPC

No, this document will not define RPC syntax because of 2 reasons:

  1. This is out of scope of this document. It is meant to define only data encoding format, not services one will use it for.
  2. Authors of this document believes that RPC are bad, and you should not use them. Instead use message passing between your services.

Schema/structured data

This is meant to encode free-form data, if you want to encode structured data with schema then we highly suggest you to take look into other formats like:

  • ASN.1 and any of it's encodings
  • ProtoBuffers
  • Apache Thrift
  • FlatBuffers
  • Cap'n'Proto

Specification

Introduction

  1. The key words "MUST", "MUST NOT", "REQUIRED", "SHALL", "SHALL NOT", "SHOULD", "SHOULD NOT", "RECOMMENDED", "MAY", and "OPTIONAL" in this document are to be interpreted as described in BCP 14 .

Types

  1. Integer

    Binary representation of integers.

    Implementation MUST support at least 8-bit unsigned and 32-bit signed integers with full precision.

  2. 64-bit Float

    IEEE 754 double precision floats.

    Implementation MUST support all non-NaN, non-infinite, non-subnormal values described in IEEE 754 binary64 spec. Implementations SHOULD NOT encode these values.

  3. Tuple

    Fixed length sequence of values.

  4. List

    Dynamic length sequence of values.

  5. Binary

    Representation of bytes with arbitrary length. If used to store human-readable strings it MUST be encoded as correct UTF-8 string.

  6. Map

    List of key-value pairs in arbitrary order. Keys MUST NOT appear twice in the same map.

Encoding

  1. Top level

    Binary encoded data MUST start with magic byte of decimal value of 131 followed by single byte Tag value followed by arbitrary length data:

    0        1       2
     +--------+-------+-------+-------
     | 131    | Tag   | Data ...
     +--------+-------+-------+-------
  2. Integer

    Integer can be encoded in 3 different forms:

    • Values in range 0..255 (aka byte)

      0       1        2
        +-------+--------+
        | 97    | Data   |
        +-------+--------+

      Where Data is unsigned byte representation of value.

    • Values in range -4 294 967 295..4 294 967 294 (signed 32-bit value)

      0       1       2      3      4      5
        +-------+-------+------+------+------+
        | 98    | Data                       |
        +-------+-------+------+------+------+

      Where Data is signed 32-bit representation of integer in U2 big-endian encoding.

    • "Short" arbitrary long signed integers (up to 2040-bit)

      0       1       2       3     ...     N+3
        +-------+-------+-------+------+------+
        | 110   | N     | Sign  | Data        |
        +-------+-------+-------+------+------+

      N is big-endian 16-bit unsigned integer. Data represents little-endian encoded N byte long integer. Sign is 0 for positive integer and 1 for negative one.

    • "Long" arbitrary long signed integers (from 2041 to 524 288-bit long)

      0       1       2       3       4     ...     N+4
        +-------+-------+-------+-------+------+------+
        | 111   | N             | Sign  | Data        |
        +-------+-------+-------+-------+------+------+

      N is big-endian 16-bit unsigned integer. Data represents little-endian encoded N byte long integer. Sign is 0 for positive integer and 1 for negative one.

  3. Float

    0       1       2        3       4       5       6       7       8       9
     +-------+-------+--------+-------+-------+-------+-------+-------+-------+
     | 70    | Data                                                           |
     +-------+-------+--------+-------+-------+-------+-------+-------+-------+

    Where Data is IEEE 754 double precision floating-point number encoded as big-endian.

  4. Tuple

    • Tuples up to 255 elements

      0       1       2       ...       N+2
        +-------+-------+--------+--------+
        | 104   | Arity | Data ...        |
        +-------+-------+--------+--------+
    • Tuples up to 4 294 967 295 elements

      0       1       2        3        4        5       ...       N+5
        +-------+-------+--------+--------+--------+--------+--------+
        | 105   | Arity                            | Data ...        |
        +-------+-------+--------+--------+--------+--------+--------+

    Where Arity is big-endian unsigned integer declaring amount of elements in Data .

  5. List

    • Byte list

      0       1       2       3      ...      N+3
        +-------+-------+-------+-------+-------+
        | 107   | N             | Data ...      |
        +-------+-------+-------+-------+-------+

      This is optimisation for lists that contains only values in range 0..255, inclusive.

    • General list

      0       1       2       3       4       5      ...      N+5     N+6
        +-------+-------+-------+-------+-------+-------+-------+-------+
        | 108   | Arity                         | Data ...      | 106   |
        +-------+-------+-------+-------+-------+-------+-------+-------+

      Where Arity is big-endian unsigned 32-bit integer declaring amount of elements in Data .

    • Empty list

      0       1
        +-------+
        | 106   |
        +-------+
  6. Binary

    0       1       2       3       4       5      ...      N+5
     +-------+-------+-------+-------+-------+-------+-------+
     | 109   | N                             | Data ...      |
     +-------+-------+-------+-------+-------+-------+-------+
  7. Map

    0       1       2       3       4       5      ...      N+5
     +-------+-------+-------+-------+-------+-------+-------+
     | 116   | Arity                         | Data ...      |
     +-------+-------+-------+-------+-------+-------+-------+

    The Arity field is an unsigned 32-bit integer in big-endian format that determines the number of key-value pairs in the map. Key and value pairs ( Ki => Vi ) are encoded in section Data in the following order: K1, V1, K2, V2,..., Kn, Vn .

Open questions

  1. Should we support atoms?
  2. Should we allow defining improper lists?

License

This document is released on Creative Commons Attribution-ShareAlike 4.0 International License .


以上就是本文的全部内容,希望对大家的学习有所帮助,也希望大家多多支持 码农网

查看所有标签

猜你喜欢:

本站部分资源来源于网络,本站转载出于传递更多信息之目的,版权归原作者或者来源机构所有,如转载稿涉及版权问题,请联系我们

Wireshark网络分析就这么简单

Wireshark网络分析就这么简单

林沛满 / 人民邮电出版社 / 2014-11-6 / 39.00

Wireshark可能是世界上最好的开源网络包分析器,能在多种平台上(比如Windows、Linux和Mac)抓取和分析网络包,在IT业界有着广泛的应用。 《Wireshark网络分析就这么简单》采用诙谐风趣的手法,由浅入深地用Wireshark分析了常见的网络协议,读者在学习Wireshark的同时,也会在不知不觉中理解这些协议。作者还通过身边发生的一些真实案例,分享了Wireshark的......一起来看看 《Wireshark网络分析就这么简单》 这本书的介绍吧!

JSON 在线解析
JSON 在线解析

在线 JSON 格式化工具

Markdown 在线编辑器
Markdown 在线编辑器

Markdown 在线编辑器

RGB CMYK 转换工具
RGB CMYK 转换工具

RGB CMYK 互转工具