diff options
| author | Matthias P. Braendli <matthias.braendli@mpb.li> | 2019-08-21 10:11:35 +0200 | 
|---|---|---|
| committer | Matthias P. Braendli <matthias.braendli@mpb.li> | 2019-08-21 10:11:35 +0200 | 
| commit | 86ea8cd8b8b5af7917db28ae30cfb2d2886868fe (patch) | |
| tree | 7222d8e077dd2155eecac68b8c78330bcfe5dc80 /lib/edi/common.hpp | |
| parent | 86fbf91f7323a2c5626a357b8414b15e20c19c9e (diff) | |
| parent | 5ee85c4ac41337e383eb1a735bc05f1e5d46a98f (diff) | |
| download | dabmux-86ea8cd8b8b5af7917db28ae30cfb2d2886868fe.tar.gz dabmux-86ea8cd8b8b5af7917db28ae30cfb2d2886868fe.tar.bz2 dabmux-86ea8cd8b8b5af7917db28ae30cfb2d2886868fe.zip | |
Merge branch 'ediInput' into next
Diffstat (limited to 'lib/edi/common.hpp')
| -rw-r--r-- | lib/edi/common.hpp | 92 | 
1 files changed, 92 insertions, 0 deletions
| diff --git a/lib/edi/common.hpp b/lib/edi/common.hpp new file mode 100644 index 0000000..887bc3d --- /dev/null +++ b/lib/edi/common.hpp @@ -0,0 +1,92 @@ +/* +   Copyright (C) 2019 +   Matthias P. Braendli, matthias.braendli@mpb.li + +   http://opendigitalradio.org + +    This program 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 2 of the License, or +    (at your option) any later version. + +    This program 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 this program; if not, write to the Free Software Foundation, Inc., +    51 Franklin Street, Fifth Floor, Boston, MA 02110-1301 USA. + */ +#pragma once + +#include "PFT.hpp" +#include <functional> +#include <map> +#include <chrono> +#include <string> +#include <vector> +#include <cstddef> +#include <ctime> + +namespace EdiDecoder { + +struct frame_timestamp_t { +    uint32_t seconds = 0; +    uint32_t utco = 0; +    uint32_t tsta = 0; // According to EN 300 797 Annex B + +    bool valid() const; +    std::string to_string() const; +    time_t to_unix_epoch() const; +    std::chrono::system_clock::time_point to_system_clock() const; +}; + +struct decode_state_t { +    decode_state_t(bool _complete, size_t _num_bytes_consumed) : +        complete(_complete), num_bytes_consumed(_num_bytes_consumed) {} +    bool complete; +    size_t num_bytes_consumed; +}; + +/* The TagDispatcher takes care of decoding EDI, with or without PFT, and + * will call functions when TAGs are encountered. + * + * PF packets are handed over to the PFT decoder, which will in turn return + * AF packets. AF packets are directly dispatched to the TAG functions. + */ +class TagDispatcher { +    public: +        TagDispatcher(std::function<void()>&& af_packet_completed, bool verbose); + +        /* Push bytes into the decoder. The buf can contain more +         * than a single packet. This is useful when reading from streams +         * (files, TCP) +         */ +        void push_bytes(const std::vector<uint8_t> &buf); + +        /* Push a complete packet into the decoder. Useful for UDP and other +         * datagram-oriented protocols. +         */ +        void push_packet(const std::vector<uint8_t> &buf); + +        /* Set the maximum delay in number of AF Packets before we +         * abandon decoding a given pseq. +         */ +        void setMaxDelay(int num_af_packets); + +        using tag_handler = std::function<bool(std::vector<uint8_t>, uint16_t)>; +        void register_tag(const std::string& tag, tag_handler&& h); + +    private: +        decode_state_t decode_afpacket(const std::vector<uint8_t> &input_data); +        bool decode_tagpacket(const std::vector<uint8_t> &payload); + +        PFT::PFT m_pft; +        uint16_t m_last_seq = 0; +        std::vector<uint8_t> m_input_data; +        std::map<std::string, tag_handler> m_handlers; +        std::function<void()> m_af_packet_completed; +}; + +} | 
