/*
    Copyright (C) 2014 CSP Innovazione nelle ICT s.c.a r.l. (http://www.csp.it/)
    Copyright (C) 2016 Matthias P. Braendli (http://www.opendigitalradio.org)
    Copyright (C) 2015 Data Path

    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 3 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, see <http://www.gnu.org/licenses/>.

    Authors:
         Sergio Sagliocco <sergio.sagliocco@csp.it>
         Matthias P. Braendli <matthias@mpb.li>
                   / |  |-  ')|)  |-|_ _ (|,_   .|  _  ,_ \
         Data Path \(|(||_(|/_| (||_||(a)_||||(|||.(_()|||/

*/

#include "figs.hpp"
#include <cstdio>
#include <cstring>
#include <map>
#include <unordered_set>

static std::unordered_set<int> services_seen;

bool fig0_25_is_complete(int services_id)
{
    bool complete = services_seen.count(services_id);

    if (complete) {
        services_seen.clear();
    }
    else {
        services_seen.insert(services_id);
    }

    return complete;
}


// FIG 0/25 fig0.oe() Announcement support
// ETSI EN 300 401 8.1.10.5.1
bool fig0_25(fig0_common_t& fig0, int indent)
{
    uint32_t key;
    uint16_t SId, Asu_flags, EId;
    uint8_t i = 1, j, Rfu, Number_EIds;
    char tmpbuf[256];
    char desc[256];
    uint8_t* f = fig0.f;
    bool complete = false;

    while (i < (fig0.figlen - 4)) {
        // iterate over other ensembles announcement support
        // SId, Asu flags, Rfu, Number of EIds
        SId = ((uint16_t)f[i] << 8) | (uint16_t)f[i+1];
        complete |= fig0_25_is_complete(SId);
        Asu_flags = ((uint16_t)f[i+2] << 8) | (uint16_t)f[i+3];
        Rfu = (f[i+4] >> 4);
        Number_EIds = (f[i+4] & 0x0F);
        sprintf(desc, "SId=0x%X, Asu flags=0x%X", SId, Asu_flags);
        if (Rfu != 0) {
            sprintf(tmpbuf, ", Rfu=%d invalid value", Rfu);
            strcat(desc, tmpbuf);
        }
        sprintf(tmpbuf, ", Number of EIds=%d", Number_EIds);
        strcat(desc, tmpbuf);
        key = ((uint32_t)fig0.oe() << 17) | ((uint32_t)fig0.pd() << 16) | (uint32_t)SId;
        sprintf(tmpbuf, ", database key=0x%05x", key);
        strcat(desc, tmpbuf);
        // CEI Change Event Indication
        if (Number_EIds == 0) {
            sprintf(tmpbuf, ", CEI");
            strcat(desc, tmpbuf);
        }
        printbuf(desc, indent+1, NULL, 0);
        i += 5;

        for(j = 0; (j < Number_EIds) && (i < (fig0.figlen - 1)); j++) {
            // iterate over EIds
            EId = ((uint16_t)f[i] << 8) | (uint16_t)f[i+1];
            sprintf(desc, "EId=0x%X", EId);
            printbuf(desc, indent+2, NULL, 0);
            i += 2;
        }
        if (j < Number_EIds) {
            sprintf(desc, "missing EId, fig length too short !");
            printbuf(desc, indent+1, NULL, 0);
            fprintf(stderr, "WARNING: FIG 0/%d length %d too short !\n", fig0.ext(), fig0.figlen);
        }

        // decode fig0.oe() announcement support types
        for(j = 0; j < 16; j++) {
            if (Asu_flags & (1 << j)) {
                sprintf(desc, "fig0.oe() Announcement support=%s", get_announcement_type(j));
                printbuf(desc, indent+2, NULL, 0);
            }
        }
    }

    return complete;
}