/*
 * Copyright (C) 2014 Pavel Kirienko <pavel.kirienko@gmail.com>
 */

#include <gtest/gtest.h>
#include "common.hpp"

TEST(CanTxQueue, Qos)
{
    uavcan::CanTxQueue::Entry e1(makeFrame(100, "", EXT), 1000, uavcan::CanTxQueue::VOLATILE);
    uavcan::CanTxQueue::Entry e2(makeFrame(100, "", EXT), 1000, uavcan::CanTxQueue::VOLATILE);

    EXPECT_FALSE(e1.qosHigherThan(e2));
    EXPECT_FALSE(e2.qosHigherThan(e1));
    EXPECT_FALSE(e1.qosLowerThan(e2));
    EXPECT_FALSE(e2.qosLowerThan(e1));

    e2.qos = uavcan::CanTxQueue::PERSISTENT;

    EXPECT_FALSE(e1.qosHigherThan(e2));
    EXPECT_TRUE(e2.qosHigherThan(e1));
    EXPECT_TRUE(e1.qosLowerThan(e2));
    EXPECT_FALSE(e2.qosLowerThan(e1));

    e1.qos = uavcan::CanTxQueue::PERSISTENT;
    e1.frame.id -= 1;

    EXPECT_TRUE(e1.qosHigherThan(e2));
    EXPECT_FALSE(e2.qosHigherThan(e1));
    EXPECT_FALSE(e1.qosLowerThan(e2));
    EXPECT_TRUE(e2.qosLowerThan(e1));
}

TEST(CanTxQueue, TxQueue)
{
    using uavcan::CanTxQueue;
    using uavcan::CanFrame;

    ASSERT_GE(32, sizeof(CanTxQueue::Entry)); // should be true for any platforms, though not required

    uavcan::PoolAllocator<32 * 4, 32> pool32;
    uavcan::PoolManager<2> poolmgr;
    poolmgr.addPool(&pool32);

    SystemClockMock clockmock;

    CanTxQueue queue(&poolmgr, &clockmock);
    EXPECT_TRUE(queue.isEmpty());

    // Descending priority
    const CanFrame f0 = makeFrame(0, "f0", EXT);
    const CanFrame f1 = makeFrame(10, "f1", EXT);
    const CanFrame f2 = makeFrame(20, "f2", EXT);
    const CanFrame f3 = makeFrame(100, "f3", EXT);
    const CanFrame f4 = makeFrame(10000, "f4", EXT);
    const CanFrame f5 = makeFrame(99999, "f5", EXT);
    const CanFrame f5a = makeFrame(99999, "f5a", EXT);
    const CanFrame f6 = makeFrame(999999, "f6", EXT);

    /*
     * Priority insertion
     */
    queue.push(f4, 100, CanTxQueue::PERSISTENT);
    EXPECT_FALSE(queue.isEmpty());
    EXPECT_EQ(1, pool32.getNumUsedBlocks());
    EXPECT_EQ(f4, queue.peek()->frame);
    EXPECT_TRUE(queue.topPriorityHigherOrEqual(f5));
    EXPECT_TRUE(queue.topPriorityHigherOrEqual(f4)); // Equal
    EXPECT_FALSE(queue.topPriorityHigherOrEqual(f3));

    queue.push(f3, 200, CanTxQueue::PERSISTENT);
    EXPECT_EQ(f3, queue.peek()->frame);

    queue.push(f0, 300, CanTxQueue::VOLATILE);
    EXPECT_EQ(f0, queue.peek()->frame);

    queue.push(f1, 400, CanTxQueue::VOLATILE);
    EXPECT_EQ(f0, queue.peek()->frame);              // Still f0, since it is highest
    EXPECT_TRUE(queue.topPriorityHigherOrEqual(f0)); // Equal
    EXPECT_TRUE(queue.topPriorityHigherOrEqual(f1));

    // Out of free memory now

    EXPECT_EQ(0, queue.getNumRejectedFrames());
    EXPECT_EQ(4, getQueueLength(queue));
    EXPECT_TRUE(isInQueue(queue, f0));
    EXPECT_TRUE(isInQueue(queue, f1));
    EXPECT_TRUE(isInQueue(queue, f3));
    EXPECT_TRUE(isInQueue(queue, f4));

    const CanTxQueue::Entry* p = queue.peek();
    while (p)
    {
        std::cout << p->toString() << std::endl;
        p = p->getNextListNode();
    }

    /*
     * QoS
     */
    EXPECT_FALSE(isInQueue(queue, f2));
    queue.push(f2, 100, CanTxQueue::VOLATILE);     // Non preempting, will be rejected
    EXPECT_FALSE(isInQueue(queue, f2));

    queue.push(f2, 500, CanTxQueue::PERSISTENT);   // Will override f1 (f3 and f4 are presistent)
    EXPECT_TRUE(isInQueue(queue, f2));
    EXPECT_FALSE(isInQueue(queue, f1));
    EXPECT_EQ(4, getQueueLength(queue));
    EXPECT_EQ(2, queue.getNumRejectedFrames());
    EXPECT_EQ(f0, queue.peek()->frame);            // Check the priority

    queue.push(f5, 600, CanTxQueue::PERSISTENT);   // Will override f0 (rest are presistent)
    EXPECT_TRUE(isInQueue(queue, f5));
    EXPECT_FALSE(isInQueue(queue, f0));
    EXPECT_EQ(f2, queue.peek()->frame);            // Check the priority

    // No volatile frames left now

    queue.push(f5a, 700, CanTxQueue::PERSISTENT);   // Will override f5 (same frame, same QoS)
    EXPECT_TRUE(isInQueue(queue, f5a));
    EXPECT_FALSE(isInQueue(queue, f5));

    queue.push(f6, 700, CanTxQueue::PERSISTENT);    // Will be rejected (lowest QoS)
    EXPECT_FALSE(isInQueue(queue, f6));

    EXPECT_FALSE(queue.topPriorityHigherOrEqual(f0));
    EXPECT_TRUE(queue.topPriorityHigherOrEqual(f2));   // Equal
    EXPECT_TRUE(queue.topPriorityHigherOrEqual(f5a));
    EXPECT_EQ(4, getQueueLength(queue));
    EXPECT_EQ(4, pool32.getNumUsedBlocks());
    EXPECT_EQ(5, queue.getNumRejectedFrames());
    EXPECT_TRUE(isInQueue(queue, f2));
    EXPECT_TRUE(isInQueue(queue, f3));
    EXPECT_TRUE(isInQueue(queue, f4));
    EXPECT_TRUE(isInQueue(queue, f5a));
    EXPECT_EQ(f2, queue.peek()->frame);            // Check the priority

    /*
     * Expiration
     */
    clockmock.monotonic = 101;
    queue.push(f0, 800, CanTxQueue::VOLATILE);     // Will replace f4 which is expired now
    EXPECT_TRUE(isInQueue(queue, f0));
    EXPECT_FALSE(isInQueue(queue, f4));
    EXPECT_EQ(6, queue.getNumRejectedFrames());

    clockmock.monotonic = 1001;
    queue.push(f5, 2000, CanTxQueue::VOLATILE);    // Entire queue is expired
    EXPECT_TRUE(isInQueue(queue, f5));
    EXPECT_EQ(1, getQueueLength(queue));           // Just one entry left - f5
    EXPECT_EQ(1, pool32.getNumUsedBlocks());       // Make sure there is no leaks
    EXPECT_EQ(10, queue.getNumRejectedFrames());

    queue.push(f0, 1000, CanTxQueue::PERSISTENT);  // This entry is already expired
    EXPECT_EQ(1, getQueueLength(queue));
    EXPECT_EQ(1, pool32.getNumUsedBlocks());
    EXPECT_EQ(11, queue.getNumRejectedFrames());

    /*
     * Removing
     */
    queue.push(f4, 5000, CanTxQueue::VOLATILE);
    EXPECT_EQ(2, getQueueLength(queue));
    EXPECT_TRUE(isInQueue(queue, f4));
    EXPECT_EQ(f4, queue.peek()->frame);

    queue.remove(queue.peek());
    EXPECT_FALSE(isInQueue(queue, f4));
    EXPECT_TRUE(isInQueue(queue, f5));
    queue.remove(queue.peek());
    EXPECT_FALSE(isInQueue(queue, f5));

    EXPECT_EQ(0, getQueueLength(queue));           // Final state checks
    EXPECT_EQ(0, pool32.getNumUsedBlocks());
    EXPECT_EQ(11, queue.getNumRejectedFrames());
    EXPECT_FALSE(queue.peek());
    EXPECT_FALSE(queue.topPriorityHigherOrEqual(f0));
}