git.sesse.net Git - vlc/blob - modules/demux/mkv/virtual_segment.cpp

   1 /*****************************************************************************
   2  * virtual_segment.cpp : virtual segment implementation in the MKV demuxer
   3  *****************************************************************************
   4  * Copyright © 2003-2011 VideoLAN and VLC authors
   5  * $Id$
   6  *
   7  * Authors: Laurent Aimar <fenrir@via.ecp.fr>
   8  *          Steve Lhomme <steve.lhomme@free.fr>
   9  *          Denis Charmet <typx@dinauz.org>
  10  *
  11  * This program is free software; you can redistribute it and/or modify it
  12  * under the terms of the GNU Lesser General Public License as published by
  13  * the Free Software Foundation; either version 2.1 of the License, or
  14  * (at your option) any later version.
  15  *
  16  * This program is distributed in the hope that it will be useful,
  17  * but WITHOUT ANY WARRANTY; without even the implied warranty of
  18  * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
  19  * GNU Lesser General Public License for more details.
  20  *
  21  * You should have received a copy of the GNU Lesser General Public License
  22  * along with this program; if not, write to the Free Software Foundation,
  23  * Inc., 51 Franklin Street, Fifth Floor, Boston MA 02110-1301, USA.
  24  *****************************************************************************/
  25 #include <vector>
  26
  27 #include "demux.hpp"
  28
  29 /* FIXME move this */
  30 matroska_segment_c * getSegmentbyUID( KaxSegmentUID * p_uid, std::vector<matroska_segment_c*> *segments )
  31 {
  32     for( size_t i = 0; i < (*segments).size(); i++ )
  33     {
  34         if( (*segments)[i]->p_segment_uid &&
  35             *p_uid == *((*segments)[i]->p_segment_uid) )
  36             return (*segments)[i];
  37     }
  38     return NULL;
  39 }
  40
  41 virtual_chapter_c * virtual_chapter_c::CreateVirtualChapter( chapter_item_c * p_chap,
  42                                                              matroska_segment_c * p_main_segment,
  43                                                              std::vector<matroska_segment_c*> * segments,
  44                                                              int64_t * usertime_offset, bool b_ordered)
  45 {
  46     matroska_segment_c * p_segment = p_main_segment;
  47
  48     if( !p_chap )
  49     {
  50         /* Dummy chapter use the whole segment */
  51         return new virtual_chapter_c( p_segment, NULL, 0, p_segment->i_duration*1000 );
  52     }
  53
  54     int64_t start = ( b_ordered )? *usertime_offset : p_chap->i_start_time;
  55     int64_t stop = ( b_ordered )? ( *usertime_offset + p_chap->i_end_time - p_chap->i_start_time ) : p_chap->i_end_time;
  56
  57     if( p_chap->p_segment_uid &&
  58        ( !( p_segment = getSegmentbyUID( (KaxSegmentUID*) p_chap->p_segment_uid,segments ) ) || !b_ordered ) )
  59     {
  60         msg_Warn( &p_main_segment->sys.demuxer,
  61                   "Couldn't find segment 0x%x or not ordered... - ignoring chapter %s",
  62                   *( (uint32_t *) p_chap->p_segment_uid->GetBuffer() ),p_chap->psz_name.c_str() );
  63         return NULL;
  64     }
  65
  66     /* Preload segment */
  67     if ( !p_segment->b_preloaded )
  68         p_segment->Preload();
  69
  70     virtual_chapter_c * p_vchap = new virtual_chapter_c( p_segment, p_chap, start, stop );
  71
  72     if( !p_vchap )
  73         return NULL;
  74
  75     int64_t tmp = *usertime_offset;
  76
  77     for( size_t i = 0; i < p_chap->sub_chapters.size(); i++ )
  78     {
  79         virtual_chapter_c * p_vsubchap = CreateVirtualChapter( p_chap->sub_chapters[i], p_segment, segments, &tmp, b_ordered );
  80
  81         if( p_vsubchap )
  82             p_vchap->sub_chapters.push_back( p_vsubchap );
  83     }
  84
  85     if( tmp == *usertime_offset )
  86         *usertime_offset += p_chap->i_end_time - p_chap->i_start_time;
  87     else
  88         *usertime_offset = tmp;
  89
  90     msg_Dbg( &p_main_segment->sys.demuxer,
  91              "Virtual chapter %s from %"PRId64" to %"PRId64" - " ,
  92              p_chap->psz_name.c_str(), p_vchap->i_virtual_start_time, p_vchap->i_virtual_stop_time );
  93
  94     return p_vchap;
  95 }
  96
  97 virtual_chapter_c::~virtual_chapter_c()
  98 {
  99     for( size_t i = 0 ; i < sub_chapters.size(); i++ )
 100         delete sub_chapters[i];
 101 }
 102
 103
 104 virtual_edition_c::virtual_edition_c( chapter_edition_c * p_edit, std::vector<matroska_segment_c*> *opened_segments)
 105 {
 106     bool b_fake_ordered = false;
 107     matroska_segment_c *p_main_segment = (*opened_segments)[0];
 108     p_edition = p_edit;
 109     b_ordered = false;
 110
 111     int64_t usertime_offset = 0;
 112
 113     /* ordered chapters */
 114     if( p_edition && p_edition->b_ordered )
 115     {
 116         b_ordered = true;
 117         for( size_t i = 0; i < p_edition->sub_chapters.size(); i++ )
 118         {
 119             virtual_chapter_c * p_vchap = virtual_chapter_c::CreateVirtualChapter( p_edition->sub_chapters[i],
 120                                                                                    p_main_segment, opened_segments,
 121                                                                                    &usertime_offset, b_ordered );
 122             if( p_vchap )
 123                 chapters.push_back( p_vchap );
 124         }
 125         if( chapters.size() )
 126             i_duration = chapters[ chapters.size() - 1 ]->i_virtual_stop_time;
 127         else
 128             i_duration = 0; /* Empty ordered editions will be ignored */
 129     }
 130     else /* Not ordered or no edition at all */
 131     {
 132         matroska_segment_c * p_cur = p_main_segment;
 133         virtual_chapter_c * p_vchap = NULL;
 134         int64_t tmp = 0;
 135
 136         /* check for prev linked segments */
 137         /* FIXME to avoid infinite recursion we limit to 10 prev should be better as parameter */
 138         for( int limit = 0; limit < 10 && p_cur->p_prev_segment_uid ; limit++ )
 139         {
 140             matroska_segment_c * p_prev = NULL;
 141             if( ( p_prev = getSegmentbyUID( p_cur->p_prev_segment_uid, opened_segments ) ) )
 142             {
 143                 tmp = 0;
 144                 msg_Dbg( &p_main_segment->sys.demuxer, "Prev segment 0x%x found\n",
 145                          *(int32_t*)p_cur->p_prev_segment_uid->GetBuffer() );
 146
 147                 /* Preload segment */
 148                 if ( !p_prev->b_preloaded )
 149                     p_prev->Preload();
 150
 151                 /* Create virtual_chapter from the first edition if any */
 152                 chapter_item_c * p_chap = ( p_prev->stored_editions.size() > 0 )? ((chapter_item_c *)p_prev->stored_editions[0]) : NULL;
 153
 154                 p_vchap = virtual_chapter_c::CreateVirtualChapter( p_chap, p_prev, opened_segments, &tmp, b_ordered );
 155
 156                 if( p_vchap )
 157                     chapters.insert( chapters.begin(), p_vchap );
 158
 159                 p_cur = p_prev;
 160                 b_fake_ordered = true;
 161             }
 162             else /* segment not found */
 163                 break;
 164         }
 165
 166         tmp = 0;
 167
 168         /* Append the main segment */
 169         p_vchap = virtual_chapter_c::CreateVirtualChapter( (chapter_item_c*) p_edit, p_main_segment,
 170                                                            opened_segments, &tmp, b_ordered );
 171         if( p_vchap )
 172             chapters.push_back( p_vchap );
 173
 174         /* Append next linked segments */
 175         for( int limit = 0; limit < 10 && p_cur->p_next_segment_uid; limit++ )
 176         {
 177             matroska_segment_c * p_next = NULL;
 178             if( ( p_next = getSegmentbyUID( p_cur->p_next_segment_uid, opened_segments ) ) )
 179             {
 180                 tmp = 0;
 181                 msg_Dbg( &p_main_segment->sys.demuxer, "Next segment 0x%x found\n",
 182                          *(int32_t*) p_cur->p_next_segment_uid->GetBuffer() );
 183
 184                 /* Preload segment */
 185                 if ( !p_next->b_preloaded )
 186                     p_next->Preload();
 187
 188                 /* Create virtual_chapter from the first edition if any */
 189                 chapter_item_c * p_chap = ( p_next->stored_editions.size() > 0 )?( (chapter_item_c *)p_next->stored_editions[0] ) : NULL;
 190
 191                  p_vchap = virtual_chapter_c::CreateVirtualChapter( p_chap, p_next, opened_segments, &tmp, b_ordered );
 192
 193                 if( p_vchap )
 194                     chapters.push_back( p_vchap );
 195
 196
 197                 p_cur = p_next;
 198                 b_fake_ordered = true;
 199             }
 200             else /* segment not found */
 201                 break;
 202         }
 203
 204         /* Retime chapters */
 205         retimeChapters();
 206         if(b_fake_ordered)
 207             b_ordered = true;
 208     }
 209
 210 #if MKV_DEBUG
 211     msg_Dbg( &p_main_segment->sys.demuxer, "-- RECAP-BEGIN --" );
 212     print();
 213     msg_Dbg( &p_main_segment->sys.demuxer, "-- RECAP-END --" );
 214 #endif
 215 }
 216
 217 virtual_edition_c::~virtual_edition_c()
 218 {
 219     for( size_t i = 0; i < chapters.size(); i++ )
 220         delete chapters[i];
 221 }
 222
 223 void virtual_edition_c::retimeSubChapters( virtual_chapter_c * p_vchap )
 224 {
 225     int64_t stop_time = p_vchap->i_virtual_stop_time;
 226     for( size_t i = p_vchap->sub_chapters.size(); i-- > 0; )
 227     {
 228         virtual_chapter_c * p_vsubchap = p_vchap->sub_chapters[i];
 229         p_vsubchap->i_virtual_start_time += p_vchap->i_virtual_start_time;
 230
 231         /*FIXME we artificially extend stop time if they were there before...*/
 232         /* Just for comfort*/
 233         p_vsubchap->i_virtual_stop_time = stop_time;
 234         stop_time = p_vsubchap->i_virtual_start_time;
 235
 236         retimeSubChapters( p_vsubchap );
 237     }
 238 }
 239
 240 void virtual_edition_c::retimeChapters()
 241 {
 242     /* This function is just meant to be used on unordered chapters */
 243     if( b_ordered )
 244         return;
 245
 246     i_duration = 0;
 247
 248     /* On non ordered editions we have one top chapter == one segment */
 249     for( size_t i = 0; i < chapters.size(); i++ )
 250     {
 251         virtual_chapter_c * p_vchap = chapters[i];
 252
 253         p_vchap->i_virtual_start_time = i_duration;
 254         i_duration += p_vchap->p_segment->i_duration * 1000;
 255         p_vchap->i_virtual_stop_time = i_duration;
 256
 257         retimeSubChapters( p_vchap );
 258     }
 259 }
 260
 261 virtual_segment_c::virtual_segment_c( std::vector<matroska_segment_c*> * p_opened_segments )
 262 {
 263     /* Main segment */
 264     size_t i;
 265     matroska_segment_c *p_segment = (*p_opened_segments)[0];
 266     i_current_edition = 0;
 267     i_sys_title = 0;
 268     p_current_chapter = NULL;
 269
 270     for( i = 0; i < p_segment->stored_editions.size(); i++ )
 271     {
 272         /* Create a virtual edition from opened */
 273         virtual_edition_c * p_vedition = new virtual_edition_c( p_segment->stored_editions[i], p_opened_segments );
 274
 275         /* Ordered empty edition can happen when all chapters are
 276          * on an other segment which couldn't be found... ignore it */
 277         if(p_vedition->b_ordered && p_vedition->i_duration == 0)
 278         {
 279             msg_Warn( &p_segment->sys.demuxer,
 280                       "Edition %s (%zu) links to other segments not found and is empty... ignoring it",
 281                        p_vedition->GetMainName().c_str(), i );
 282             delete p_vedition;
 283         }
 284         else
 285             editions.push_back( p_vedition );
 286     }
 287     /*if we don't have edition create a dummy one*/
 288     if( !p_segment->stored_editions.size() )
 289     {
 290         virtual_edition_c * p_vedition = new virtual_edition_c( NULL, p_opened_segments );
 291         editions.push_back( p_vedition );
 292     }
 293
 294     /* Get the default edition, if there is none, use the first one */
 295     for( i = 0; i < editions.size(); i++)
 296     {
 297         if( editions[i]->p_edition && editions[i]->p_edition->b_default )
 298         {
 299             i_current_edition = i;
 300             break;
 301         }
 302     }
 303     /* Set current chapter */
 304     p_current_chapter = editions[i_current_edition]->getChapterbyTimecode(0);
 305
 306 }
 307
 308 virtual_segment_c::~virtual_segment_c()
 309 {
 310     for( size_t i = 0; i < editions.size(); i++ )
 311         delete editions[i];
 312 }
 313
 314 virtual_chapter_c *virtual_segment_c::BrowseCodecPrivate( unsigned int codec_id,
 315                                     bool (*match)(const chapter_codec_cmds_c &data, const void *p_cookie, size_t i_cookie_size ),
 316                                     const void *p_cookie,
 317                                     size_t i_cookie_size )
 318 {
 319     virtual_edition_c * p_ved = CurrentEdition();
 320     if( p_ved )
 321         return p_ved->BrowseCodecPrivate( codec_id, match, p_cookie, i_cookie_size );
 322
 323     return NULL;
 324 }
 325
 326
 327 virtual_chapter_c * virtual_edition_c::BrowseCodecPrivate( unsigned int codec_id,
 328                                     bool (*match)(const chapter_codec_cmds_c &data, const void *p_cookie, size_t i_cookie_size ),
 329                                     const void *p_cookie,
 330                                     size_t i_cookie_size )
 331 {
 332     if( !p_edition )
 333         return NULL;
 334
 335     for( size_t i = 0; i < chapters.size(); i++ )
 336     {
 337         virtual_chapter_c * p_result = chapters[i]->BrowseCodecPrivate( codec_id, match, p_cookie, i_cookie_size );
 338         if( p_result )
 339             return p_result;
 340     }
 341     return NULL;
 342 }
 343
 344
 345
 346 virtual_chapter_c * virtual_chapter_c::BrowseCodecPrivate( unsigned int codec_id,
 347                                     bool (*match)(const chapter_codec_cmds_c &data, const void *p_cookie, size_t i_cookie_size ),
 348                                     const void *p_cookie,
 349                                     size_t i_cookie_size )
 350 {
 351     if( !p_chapter )
 352         return NULL;
 353
 354     if( p_chapter->BrowseCodecPrivate( codec_id, match, p_cookie, i_cookie_size ) )
 355         return this;
 356
 357     for( size_t i = 0; i < sub_chapters.size(); i++ )
 358     {
 359         virtual_chapter_c * p_result = sub_chapters[i]->BrowseCodecPrivate( codec_id, match, p_cookie, i_cookie_size );
 360         if( p_result )
 361             return p_result;
 362     }
 363     return NULL;
 364 }
 365
 366 virtual_chapter_c* virtual_chapter_c::getSubChapterbyTimecode( int64_t time )
 367 {
 368     for( size_t i = 0; i < sub_chapters.size(); i++ )
 369     {
 370         if( time >= sub_chapters[i]->i_virtual_start_time && time < sub_chapters[i]->i_virtual_stop_time )
 371             return sub_chapters[i]->getSubChapterbyTimecode( time );
 372     }
 373
 374     return this;
 375 }
 376
 377 virtual_chapter_c* virtual_edition_c::getChapterbyTimecode( int64_t time )
 378 {
 379     for( size_t i = 0; i < chapters.size(); i++ )
 380     {
 381         if( time >= chapters[i]->i_virtual_start_time &&
 382             ( chapters[i]->i_virtual_stop_time < 0 || time < chapters[i]->i_virtual_stop_time ) )
 383             /*with the current implementation only the last chapter can have a negative virtual_stop_time*/
 384             return chapters[i]->getSubChapterbyTimecode( time );
 385     }
 386
 387     return NULL;
 388 }
 389
 390 bool virtual_segment_c::UpdateCurrentToChapter( demux_t & demux )
 391 {
 392     demux_sys_t & sys = *demux.p_sys;
 393     virtual_chapter_c *p_cur_chapter;
 394     virtual_edition_c * p_cur_edition = editions[ i_current_edition ];
 395
 396     bool b_has_seeked = false;
 397
 398     p_cur_chapter = p_cur_edition->getChapterbyTimecode( sys.i_pts );
 399
 400     /* we have moved to a new chapter */
 401     if ( p_cur_chapter != NULL && p_current_chapter != p_cur_chapter )
 402         {
 403             msg_Dbg( &demux, "NEW CHAPTER %"PRId64, sys.i_pts );
 404             if ( p_cur_edition->b_ordered )
 405             {
 406                 /* FIXME EnterAndLeave has probably been broken for a long time */
 407                 // Leave/Enter up to the link point
 408                 b_has_seeked = p_cur_chapter->EnterAndLeave( p_current_chapter );
 409                 if ( !b_has_seeked )
 410                 {
 411                     // only physically seek if necessary
 412                     if ( p_current_chapter == NULL ||
 413                         ( p_current_chapter && p_current_chapter->p_segment != p_cur_chapter->p_segment ) ||
 414                         ( p_current_chapter->p_chapter->i_end_time != p_cur_chapter->p_chapter->i_start_time ))
 415                     {
 416                         Seek( demux, p_cur_chapter->i_virtual_start_time, 0, p_cur_chapter, -1 );
 417                         return true;
 418                     }
 419                 }
 420                 sys.i_start_pts = p_cur_chapter->i_virtual_start_time;;
 421             }
 422
 423             p_current_chapter = p_cur_chapter;
 424             if ( p_cur_chapter->i_seekpoint_num > 0 )
 425             {
 426                 demux.info.i_update |= INPUT_UPDATE_TITLE | INPUT_UPDATE_SEEKPOINT;
 427                 demux.info.i_title = sys.i_current_title = i_sys_title;
 428                 demux.info.i_seekpoint = p_cur_chapter->i_seekpoint_num - 1;
 429             }
 430
 431             return b_has_seeked;
 432         }
 433         else if ( p_cur_chapter == NULL )
 434         {
 435             /* out of the scope of the data described by chapters, leave the edition */
 436             if ( p_cur_edition->b_ordered && p_current_chapter != NULL )
 437             {
 438                 /* TODO */
 439                 if ( !p_cur_edition->p_edition->EnterAndLeave( p_current_chapter->p_chapter, false ) )
 440                     p_current_chapter = NULL;
 441                 else
 442                     return true;
 443             }
 444         }
 445     return false;
 446 }
 447
 448 bool virtual_chapter_c::EnterAndLeave( virtual_chapter_c *p_item, bool b_enter )
 449 {
 450     if( !p_chapter )
 451         return false;
 452
 453     return p_chapter->EnterAndLeave( p_item->p_chapter, b_enter );
 454 }
 455
 456 void virtual_segment_c::Seek( demux_t & demuxer, mtime_t i_date, mtime_t i_time_offset,
 457                               virtual_chapter_c *p_chapter, int64_t i_global_position )
 458 {
 459     demux_sys_t *p_sys = demuxer.p_sys;
 460
 461
 462     /* find the actual time for an ordered edition */
 463     if ( p_chapter == NULL )
 464         /* 1st, we need to know in which chapter we are */
 465         p_chapter = editions[ i_current_edition ]->getChapterbyTimecode( i_date );
 466
 467     if ( p_chapter != NULL )
 468     {
 469         i_time_offset = p_chapter->i_virtual_start_time - ( ( p_chapter->p_chapter )? p_chapter->p_chapter->i_start_time : 0 );
 470         p_sys->i_chapter_time = i_time_offset - p_chapter->p_segment->i_start_time;
 471         if ( p_chapter->p_chapter && p_chapter->i_seekpoint_num > 0 )
 472         {
 473             demuxer.info.i_update |= INPUT_UPDATE_TITLE | INPUT_UPDATE_SEEKPOINT;
 474             demuxer.info.i_title = p_sys->i_current_title = i_sys_title;
 475             demuxer.info.i_seekpoint = p_chapter->i_seekpoint_num - 1;
 476         }
 477
 478         if( p_current_chapter->p_segment != p_chapter->p_segment )
 479             ChangeSegment( p_current_chapter->p_segment, p_chapter->p_segment, i_date );
 480         p_current_chapter = p_chapter;
 481
 482         p_chapter->p_segment->Seek( i_date, i_time_offset, i_global_position );
 483     }
 484 }
 485
 486 virtual_chapter_c * virtual_chapter_c::FindChapter( int64_t i_find_uid )
 487 {
 488     if( p_chapter && ( p_chapter->i_uid == i_find_uid ) )
 489         return this;
 490
 491     for( size_t i = 0; i < sub_chapters.size(); i++ )
 492     {
 493         virtual_chapter_c * p_res = sub_chapters[i]->FindChapter( i_find_uid );
 494         if( p_res )
 495             return p_res;
 496     }
 497
 498     return NULL;
 499 }
 500
 501 virtual_chapter_c * virtual_segment_c::FindChapter( int64_t i_find_uid )
 502 {
 503     virtual_edition_c * p_edition = editions[i_current_edition];
 504
 505     for( size_t i = 0; p_edition->chapters.size(); i++ )
 506     {
 507         virtual_chapter_c * p_chapter = p_edition->chapters[i]->FindChapter( i_find_uid );
 508         if( p_chapter )
 509             return p_chapter;
 510     }
 511     return NULL;
 512 }
 513
 514 int virtual_chapter_c::PublishChapters( input_title_t & title, int & i_user_chapters, int i_level )
 515 {
 516     if ( p_chapter && ( !p_chapter->b_display_seekpoint || p_chapter->psz_name == "" ) )
 517     {
 518         p_chapter->psz_name = p_chapter->GetCodecName();
 519         if ( p_chapter->psz_name != "" )
 520             p_chapter->b_display_seekpoint = true;
 521     }
 522
 523     if ( ( p_chapter && p_chapter->b_display_seekpoint &&
 524          ( ( sub_chapters.size() > 0 && i_virtual_start_time != sub_chapters[0]->i_virtual_start_time) ||
 525            sub_chapters.size() == 0 ) ) || !p_chapter )
 526     {
 527         seekpoint_t *sk = vlc_seekpoint_New();
 528
 529         sk->i_time_offset = i_virtual_start_time;
 530         if( p_chapter )
 531             sk->psz_name = strdup( p_chapter->psz_name.c_str() );
 532         else
 533             sk->psz_name = strdup("dummy chapter");
 534
 535         /* A start time of '0' is ok. A missing ChapterTime element is ok, too, because '0' is its default value. */
 536         title.i_seekpoint++;
 537         title.seekpoint = (seekpoint_t**)xrealloc( title.seekpoint,
 538                                  title.i_seekpoint * sizeof( seekpoint_t* ) );
 539         title.seekpoint[title.i_seekpoint-1] = sk;
 540
 541         if ( (p_chapter && p_chapter->b_user_display ) ||  !p_chapter )
 542             i_user_chapters++;
 543     }
 544     i_seekpoint_num = i_user_chapters;
 545
 546     for( size_t i = 0; i < sub_chapters.size(); i++ )
 547         sub_chapters[i]->PublishChapters( title, i_user_chapters, i_level + 1 );
 548
 549     return i_user_chapters;
 550 }
 551
 552
 553 int virtual_edition_c::PublishChapters( input_title_t & title, int & i_user_chapters, int i_level )
 554 {
 555
 556     /* HACK for now don't expose edition as a seekpoint if its start time is the same than it's first chapter */
 557     if( chapters.size() > 0 &&
 558         chapters[0]->i_virtual_start_time && p_edition )
 559     {
 560         seekpoint_t *sk = vlc_seekpoint_New();
 561
 562         sk->i_time_offset = 0;
 563         sk->psz_name = strdup( p_edition->psz_name.c_str() );
 564
 565         title.i_seekpoint++;
 566         title.seekpoint = (seekpoint_t**)xrealloc( title.seekpoint,
 567                              title.i_seekpoint * sizeof( seekpoint_t* ) );
 568         title.seekpoint[title.i_seekpoint - 1] = sk;
 569         i_level++;
 570
 571         i_user_chapters++;
 572         i_seekpoint_num = i_user_chapters;
 573     }
 574
 575 //    if( chapters.size() > 1 )
 576         for( size_t i = 0; i < chapters.size(); i++ )
 577             chapters[i]->PublishChapters( title, i_user_chapters, i_level );
 578
 579     return i_user_chapters;
 580 }
 581
 582 std::string virtual_edition_c::GetMainName()
 583 {
 584     if( p_edition )
 585         return p_edition->GetMainName();
 586
 587     return std::string("");
 588 }
 589
 590 bool virtual_chapter_c::Enter( bool b_do_subs )
 591 {
 592     if( p_chapter )
 593         return p_chapter->Enter( b_do_subs );
 594     return false;
 595 }
 596
 597 bool virtual_chapter_c::Leave( bool b_do_subs )
 598 {
 599     if( p_chapter )
 600         return p_chapter->Leave( b_do_subs );
 601     return false;
 602 }
 603
 604 #if MKV_DEBUG
 605 void virtual_chapter_c::print()
 606 {
 607     msg_Dbg( &p_segment->sys.demuxer, "*** chapter %"PRId64" - %"PRId64" (%u)",
 608              i_virtual_start_time, i_virtual_stop_time, sub_chapters.size() );
 609     for( size_t i = 0; i < sub_chapters.size(); i++ )
 610         sub_chapters[i]->print();
 611 }
 612 #endif
 613
 614 void virtual_segment_c::ChangeSegment( matroska_segment_c * p_old, matroska_segment_c * p_new, mtime_t i_start_time )
 615 {
 616     size_t i, j;
 617     for( i = 0; i < p_new->tracks.size(); i++)
 618     {
 619         mkv_track_t *p_tk = p_new->tracks[i];
 620         es_format_t *p_nfmt = &p_tk->fmt;
 621
 622         /* Let's only do that for audio and video for now */
 623         if( p_nfmt->i_cat == AUDIO_ES || p_nfmt->i_cat == VIDEO_ES )
 624         {
 625
 626             /* check for a similar elementary stream */
 627             for( j = 0; j < p_old->tracks.size(); j++)
 628             {
 629                 es_format_t * p_ofmt = &p_old->tracks[j]->fmt;
 630
 631                 if( !p_old->tracks[j]->p_es )
 632                     continue;
 633
 634                 if( ( p_nfmt->i_cat == p_ofmt->i_cat ) &&
 635                     ( p_nfmt->i_codec == p_ofmt->i_codec ) &&
 636                     ( p_nfmt->i_priority == p_ofmt->i_priority ) &&
 637                     ( p_nfmt->i_bitrate == p_ofmt->i_bitrate ) &&
 638                     ( p_nfmt->i_extra == p_ofmt->i_extra ) &&
 639                     ( (!p_nfmt->p_extra && !p_ofmt->p_extra) ||
 640                       !memcmp( p_nfmt->p_extra, p_ofmt->p_extra, p_nfmt->i_extra ) ) &&
 641                     !strcasecmp( p_nfmt->psz_language, p_ofmt->psz_language ) &&
 642                     ( ( p_nfmt->i_cat == AUDIO_ES &&
 643                         !memcmp( &p_nfmt->audio, &p_ofmt->audio, sizeof(audio_format_t) ) ) ||
 644                       ( p_nfmt->i_cat == VIDEO_ES &&
 645                         !memcmp( &p_nfmt->video, &p_ofmt->video, sizeof(video_format_t) ) ) ) )
 646                 {
 647                     /* FIXME handle video palettes... */
 648                     msg_Warn( &p_old->sys.demuxer, "Reusing decoder of old track %u for track %u", j, i);
 649                     p_tk->p_es = p_old->tracks[j]->p_es;
 650                     p_old->tracks[j]->p_es = NULL;
 651                     break;
 652                 }
 653             }
 654         }
 655     }
 656     p_new->Select( i_start_time );
 657     p_old->UnSelect();
 658 }