modules/demux/adaptive/playlist/AbstractPlaylist.cpp

   1 /*
   2  * AbstractAbstractPlaylist.cpp
   3  *****************************************************************************
   4  * Copyright (C) 2010 - 2011 Klagenfurt University
   5  * Copyright (C) 2015 VideoLAN and VLC authors
   6  *
   7  * This program is free software; you can redistribute it and/or modify it
   8  * under the terms of the GNU Lesser General Public License as published
   9  * by the Free Software Foundation; either version 2.1 of the License, or
  10  * (at your option) any later version.
  11  *
  12  * This program is distributed in the hope that it will be useful,
  13  * but WITHOUT ANY WARRANTY; without even the implied warranty of
  14  * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
  15  * GNU Lesser General Public License for more details.
  16  *
  17  * You should have received a copy of the GNU Lesser General Public License
  18  * along with this program; if not, write to the Free Software Foundation,
  19  * Inc., 51 Franklin Street, Fifth Floor, Boston MA 02110-1301, USA.
  20  *****************************************************************************/
  21 #ifdef HAVE_CONFIG_H
  22 # include "config.h"
  23 #endif
  24
  25 #include "AbstractPlaylist.hpp"
  26 #include "../tools/Helper.h"
  27 #include "BasePeriod.h"
  28 #include "SegmentTimeline.h"
  29 #include <vlc_common.h>
  30 #include <vlc_stream.h>
  31
  32 #include <algorithm>
  33
  34 using namespace adaptive::playlist;
  35
  36 AbstractPlaylist::AbstractPlaylist (vlc_object_t *p_object_) :
  37     ICanonicalUrl(),
  38     p_object(p_object_)
  39 {
  40     playbackStart.Set(0);
  41     availabilityStartTime.Set( 0 );
  42     availabilityEndTime.Set( 0 );
  43     duration.Set( 0 );
  44     minUpdatePeriod.Set( VLC_TICK_FROM_SEC(2) );
  45     maxSegmentDuration.Set( 0 );
  46     minBufferTime = 0;
  47     timeShiftBufferDepth.Set( 0 );
  48     suggestedPresentationDelay.Set( 0 );
  49     b_needsUpdates = false;
  50 }
  51
  52 AbstractPlaylist::~AbstractPlaylist()
  53 {
  54     for(size_t i = 0; i < this->periods.size(); i++)
  55         delete(this->periods.at(i));
  56 }
  57
  58 const std::vector<BasePeriod *>& AbstractPlaylist::getPeriods()
  59 {
  60     return periods;
  61 }
  62
  63 void AbstractPlaylist::addBaseUrl(const std::string &url)
  64 {
  65     baseUrls.push_back(url);
  66 }
  67
  68 void AbstractPlaylist::setPlaylistUrl(const std::string &url)
  69 {
  70     playlistUrl = url;
  71 }
  72
  73 void AbstractPlaylist::addPeriod(BasePeriod *period)
  74 {
  75     periods.push_back(period);
  76 }
  77
  78 void AbstractPlaylist::setType(const std::string &type_)
  79 {
  80     type = type_;
  81 }
  82
  83 void AbstractPlaylist::setMinBuffering( vlc_tick_t min )
  84 {
  85     minBufferTime = min;
  86 }
  87
  88 vlc_tick_t AbstractPlaylist::getMinBuffering() const
  89 {
  90     return std::max(minBufferTime, VLC_TICK_FROM_SEC(6));
  91 }
  92
  93 vlc_tick_t AbstractPlaylist::getMaxBuffering() const
  94 {
  95     const vlc_tick_t minbuf = getMinBuffering();
  96     return std::max(minbuf, VLC_TICK_FROM_SEC(60));
  97 }
  98
  99 Url AbstractPlaylist::getUrlSegment() const
 100 {
 101     Url ret;
 102
 103     if (!baseUrls.empty())
 104         ret = Url(baseUrls.front());
 105
 106     if( !ret.hasScheme() && !playlistUrl.empty() )
 107         ret.prepend( Url(playlistUrl) );
 108
 109     return ret;
 110 }
 111
 112 vlc_object_t * AbstractPlaylist::getVLCObject() const
 113 {
 114     return p_object;
 115 }
 116
 117 BasePeriod* AbstractPlaylist::getFirstPeriod()
 118 {
 119     std::vector<BasePeriod *> periods = getPeriods();
 120
 121     if( !periods.empty() )
 122         return periods.front();
 123     else
 124         return NULL;
 125 }
 126
 127 BasePeriod* AbstractPlaylist::getNextPeriod(BasePeriod *period)
 128 {
 129     std::vector<BasePeriod *> periods = getPeriods();
 130
 131     for(size_t i = 0; i < periods.size(); i++)
 132     {
 133         if(periods.at(i) == period && (i + 1) < periods.size())
 134             return periods.at(i + 1);
 135     }
 136
 137     return NULL;
 138 }
 139
 140 bool AbstractPlaylist::needsUpdates() const
 141 {
 142     return b_needsUpdates;
 143 }
 144
 145 void AbstractPlaylist::mergeWith(AbstractPlaylist *updatedAbstractPlaylist, vlc_tick_t prunebarrier)
 146 {
 147     availabilityEndTime.Set(updatedAbstractPlaylist->availabilityEndTime.Get());
 148
 149     for(size_t i = 0; i < periods.size() && i < updatedAbstractPlaylist->periods.size(); i++)
 150         periods.at(i)->mergeWith(updatedAbstractPlaylist->periods.at(i), prunebarrier);
 151 }
 152
 153 void AbstractPlaylist::pruneByPlaybackTime(vlc_tick_t time)
 154 {
 155     for(size_t i = 0; i < periods.size(); i++)
 156         periods.at(i)->pruneByPlaybackTime(time);
 157 }
 158