/***

  Olive - Non-Linear Video Editor
  Copyright (C) 2019 Olive Team

  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/>.

***/

#include "render.h"

#include "common/timecodefunctions.h"

OLIVE_NAMESPACE_ENTER

RenderTask::RenderTask(ViewerOutput* viewer, const VideoRenderingParams &vparams, const AudioRenderingParams &aparams) :
  viewer_(viewer),
  video_params_(vparams),
  audio_params_(aparams)
{
}

struct TimeHashFuturePair {
  rational time;
  RenderTicketPtr hash_future;
};

struct HashTimePair {
  rational time;
  QByteArray hash;
};

struct HashFrameFuturePair {
  QByteArray hash;
  RenderTicketPtr frame_future;
};

struct RangeSampleFuturePair {
  TimeRange range;
  RenderTicketPtr sample_future;
};

struct HashDownloadFuturePair {
  QByteArray hash;
  QFuture<void> download_future;
};

void RenderTask::Render(const TimeRangeList& video_range,
                        const TimeRangeList &audio_range,
                        const QMatrix4x4& mat,
                        bool use_disk_cache)
{
  // FIXME: This makes a full copy of the node graph every time it starts, there must be a better
  //        way.
  backend_.SetViewerNode(viewer_);
  backend_.SetVideoParams(video_params_);
  backend_.SetAudioParams(audio_params_);
  backend_.SetVideoDownloadMatrix(mat);

  std::list<RangeSampleFuturePair> audio_lookup_table;
  if (!audio_range.isEmpty()) {
    foreach (const TimeRange& r, audio_range) {
      QList<TimeRange> ranges = RenderBackend::SplitRangeIntoChunks(r);

      foreach (const TimeRange& split, ranges) {
        audio_lookup_table.push_back({split, backend_.RenderAudio(split)});
      }
    }
  }

  // Get hashes for each frame and group likes together
  QMap< QByteArray, std::list<rational> > times_to_render;
  std::list<HashFrameFuturePair> render_lookup_table;
  if (!video_range.isEmpty()) {

    {
      QList<rational> times = viewer_->video_frame_cache()->GetFrameListFromTimeRange(video_range);

      QFuture<QList<QByteArray> > hash_future = backend_.Hash(times);
      QList<QByteArray> hashes = hash_future.result();

      // Determine any duplicates
      int index = 0;
      foreach (const QByteArray& hash, hashes) {
        const rational& time = times.at(index);

        if (use_disk_cache
            && QFileInfo::exists(viewer_->video_frame_cache()->CachePathName(hash, video_params_.format()))) {
          // Already exists, no need to render it again
          FrameDownloaded(hash, {time});
        } else {
          times_to_render[hash].push_back(time);
        }

        index++;
      }
    }

    // Render all frames necessary
    {
      std::list<HashTimePair> sorted_times;
      std::list<HashTimePair>::iterator sorted_iterator;

      // Rendering is more efficient if we cache in order, so here we sort
      QMap< QByteArray, std::list<rational> >::const_iterator i;
      for (i=times_to_render.constBegin(); i!=times_to_render.constEnd(); i++) {
        const QByteArray& hash = i.key();
        const rational& time = i.value().front();

        bool inserted = false;

        for (sorted_iterator=sorted_times.begin(); sorted_iterator!=sorted_times.end(); sorted_iterator++) {
          if (sorted_iterator->time > time) {
            sorted_times.insert(sorted_iterator, {time, hash});
            inserted = true;
            break;
          }
        }

        if (!inserted) {
          sorted_times.push_back({time, hash});
        }
      }

      foreach (const HashTimePair& p, sorted_times) {
        render_lookup_table.push_back({p.hash, backend_.RenderFrame(p.time)});
      }
    }
  }

  // Start downloading frames that have finished

  int counter = 0;
  int nb_frames = render_lookup_table.size();

  std::list<HashDownloadFuturePair> download_futures;

  // Iterators
  std::list<HashFrameFuturePair>::iterator i;
  std::list<HashDownloadFuturePair>::iterator j;
  std::list<RangeSampleFuturePair>::iterator k;

  while (!IsCancelled()
         && (!render_lookup_table.empty()
             || !download_futures.empty()
             || !audio_lookup_table.empty())) {

    i = render_lookup_table.begin();

    while (!IsCancelled() && i != render_lookup_table.end()) {
      if (i->frame_future->IsFinished()) {
        FramePtr f = i->frame_future->Get().value<FramePtr>();

        // Start multithreaded download here
        download_futures.push_back({i->hash, DownloadFrame(f, i->hash)});

        i = render_lookup_table.erase(i);
      } else {
        i++;
      }
    }

    j = download_futures.begin();

    while (!IsCancelled() && j != download_futures.end()) {
      if (j->download_future.isFinished()) {
        // Place it in the cache
        FrameDownloaded(j->hash, times_to_render.value(j->hash));

        // Signal process
        counter++;
        emit ProgressChanged(static_cast<double>(counter) / static_cast<double>(nb_frames));

        j = download_futures.erase(j);
      } else {
        j++;
      }
    }

    k = audio_lookup_table.begin();

    while (!IsCancelled() && k != audio_lookup_table.end()) {
      if (k->sample_future->IsFinished()) {
        AudioDownloaded(k->range, k->sample_future->Get().value<SampleBufferPtr>());

        k = audio_lookup_table.erase(k);
      } else {
        k++;
      }
    }
  }

  backend_.Close();
}

void RenderTask::SetAnchorPoint(const rational &r)
{
  anchor_point_ = r;
}

OLIVE_NAMESPACE_EXIT