git.sesse.net Git - vlc/blob - src/playlist/tree.c

   1 /*****************************************************************************
   2  * tree.c : Playlist tree walking functions
   3  *****************************************************************************
   4  * Copyright (C) 1999-2004 the VideoLAN team
   5  * $Id$
   6  *
   7  * Authors: Clément Stenac <zorglub@videolan.org>
   8  *
   9  * This program is free software; you can redistribute it and/or modify
  10  * it under the terms of the GNU General Public License as published by
  11  * the Free Software Foundation; either version 2 of the License, or
  12  * (at your option) any later version.
  13  *
  14  * This program is distributed in the hope that it will be useful,
  15  * but WITHOUT ANY WARRANTY; without even the implied warranty of
  16  * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the
  17  * GNU General Public License for more details.
  18  *
  19  * You should have received a copy of the GNU General Public License
  20  * along with this program; if not, write to the Free Software
  21  * Foundation, Inc., 51 Franklin Street, Fifth Floor, Boston MA 02110-1301, USA.
  22  *****************************************************************************/
  23 #include <vlc/vlc.h>
  24 #include <assert.h>
  25 #include <vlc/input.h>
  26 #include "vlc_playlist.h"
  27
  28 /************************************************************************
  29  * Local prototypes
  30  ************************************************************************/
  31 playlist_item_t *GetNextUncle( playlist_t *p_playlist, playlist_item_t *p_item,
  32                                playlist_item_t *p_root );
  33 playlist_item_t *GetPrevUncle( playlist_t *p_playlist, playlist_item_t *p_item,
  34                                playlist_item_t *p_root );
  35
  36 playlist_item_t *GetNextItem( playlist_t *p_playlist,
  37                               playlist_item_t *p_root,
  38                               playlist_item_t *p_item );
  39 playlist_item_t *GetPrevItem( playlist_t *p_playlist,
  40                               playlist_item_t *p_item,
  41                               playlist_item_t *p_root );
  42
  43 /**
  44  * Create a playlist node
  45  *
  46  * \param p_playlist the playlist
  47  * \paam psz_name the name of the node
  48  * \param p_parent the parent node to attach to or NULL if no attach
  49  * \return the new node
  50  */
  51 playlist_item_t * playlist_NodeCreate( playlist_t *p_playlist, char *psz_name,
  52                                        playlist_item_t *p_parent )
  53 {
  54     input_item_t *p_input;
  55     playlist_item_t *p_item;
  56
  57     if( !psz_name ) psz_name = _("Undefined");
  58     p_input = input_ItemNewWithType( VLC_OBJECT(p_playlist), NULL, psz_name,
  59                                      0, NULL, -1, ITEM_TYPE_NODE );
  60     p_input->i_id = ++p_playlist->i_last_input_id;
  61     p_item = playlist_ItemNewFromInput( VLC_OBJECT(p_playlist), p_input );
  62     p_item->i_children = 0;
  63
  64     if( p_item == NULL )
  65     {
  66         return NULL;
  67     }
  68     INSERT_ELEM( p_playlist->pp_all_items,
  69                  p_playlist->i_all_size,
  70                  p_playlist->i_all_size,
  71                  p_item );
  72
  73     if( p_parent != NULL )
  74     {
  75         playlist_NodeAppend( p_playlist, p_item, p_parent );
  76     }
  77
  78     playlist_SendAddNotify( p_playlist, p_item->i_id,
  79                             p_parent ? p_parent->i_id : -1 );
  80     return p_item;
  81 }
  82
  83 /**
  84  * Remove all the children of a node
  85  *
  86  * This function must be entered with the playlist lock
  87  *
  88  * \param p_playlist the playlist
  89  * \param p_root the node
  90  * \param b_delete_items do we have to delete the children items ?
  91  * \return VLC_SUCCESS or an error
  92  */
  93 int playlist_NodeEmpty( playlist_t *p_playlist, playlist_item_t *p_root,
  94                         vlc_bool_t b_delete_items )
  95 {
  96     int i;
  97     if( p_root->i_children == -1 )
  98     {
  99         return VLC_EGENERIC;
 100     }
 101
 102     /* Delete the children */
 103     for( i =  p_root->i_children-1 ; i >= 0 ;i-- )
 104     {
 105         if( p_root->pp_children[i]->i_children > -1 )
 106         {
 107             playlist_NodeDelete( p_playlist, p_root->pp_children[i],
 108                                  b_delete_items , VLC_FALSE );
 109         }
 110         else if( b_delete_items )
 111         {
 112             /* Delete the item here */
 113             playlist_DeleteFromItemId( p_playlist,
 114                                        p_root->pp_children[i]->i_id );
 115         }
 116     }
 117     return VLC_SUCCESS;
 118 }
 119
 120 /**
 121  * Remove all the children of a node and removes the node
 122  *
 123  * \param p_playlist the playlist
 124  * \param p_root the node
 125  * \param b_delete_items do we have to delete the children items ?
 126  * \return VLC_SUCCESS or an error
 127  */
 128 int playlist_NodeDelete( playlist_t *p_playlist, playlist_item_t *p_root,
 129                          vlc_bool_t b_delete_items, vlc_bool_t b_force )
 130 {
 131     int i;
 132
 133     if( p_root->i_children == -1 )
 134     {
 135         return VLC_EGENERIC;
 136     }
 137
 138     /* Delete the children */
 139     for( i =  p_root->i_children - 1 ; i >= 0; i-- )
 140     {
 141         if( p_root->pp_children[i]->i_children > -1 )
 142         {
 143             playlist_NodeDelete( p_playlist, p_root->pp_children[i],
 144                                  b_delete_items , b_force );
 145         }
 146         else if( b_delete_items )
 147         {
 148             playlist_DeleteFromItemId( p_playlist,
 149                                        p_root->pp_children[i]->i_id );
 150         }
 151     }
 152     /* Delete the node */
 153     if( p_root->i_flags & PLAYLIST_RO_FLAG && !b_force )
 154     {
 155     }
 156     else
 157     {
 158         var_SetInteger( p_playlist, "item-deleted", p_root->p_input->i_id );
 159         for( i = 0 ; i< p_playlist->i_all_size; i ++ )
 160         {
 161             if( p_playlist->pp_all_items[i]->p_input->i_id ==
 162                                p_root->p_input->i_id )
 163             {
 164                 REMOVE_ELEM( p_playlist->pp_all_items, p_playlist->i_all_size,
 165                              i );
 166                 break;
 167             }
 168         }
 169
 170         /* Remove the item from its parent */
 171         if( p_root->p_parent )
 172         {
 173             playlist_NodeRemoveItem( p_playlist, p_root, p_root->p_parent );
 174         }
 175
 176         playlist_ItemDelete( p_root );
 177     }
 178     return VLC_SUCCESS;
 179 }
 180
 181
 182 /**
 183  * Adds an item to the children of a node
 184  *
 185  * \param p_playlist the playlist
 186  * \param p_item the item to append
 187  * \param p_parent the parent node
 188  * \return VLC_SUCCESS or an error
 189  */
 190 int playlist_NodeAppend( playlist_t *p_playlist,
 191                          playlist_item_t *p_item,
 192                          playlist_item_t *p_parent )
 193 {
 194     return playlist_NodeInsert( p_playlist, p_item, p_parent, -1 );
 195 }
 196
 197 int playlist_NodeInsert( playlist_t *p_playlist,
 198                          playlist_item_t *p_item,
 199                          playlist_item_t *p_parent,
 200                          int i_position )
 201 {
 202    assert( p_parent && p_parent->i_children != -1 );
 203    if( i_position == -1 ) i_position = p_parent->i_children ;
 204
 205    INSERT_ELEM( p_parent->pp_children,
 206                 p_parent->i_children,
 207                 i_position,
 208                 p_item );
 209    p_item->p_parent = p_parent;
 210    return VLC_SUCCESS;
 211 }
 212
 213 /**
 214  * Deletes an item from the children of a node
 215  *
 216  * \param p_playlist the playlist
 217  * \param p_item the item to remove
 218  * \param p_parent the parent node
 219  * \return VLC_SUCCESS or an error
 220  */
 221 int playlist_NodeRemoveItem( playlist_t *p_playlist,
 222                         playlist_item_t *p_item,
 223                         playlist_item_t *p_parent )
 224 {
 225    int i;
 226    for( i= 0; i< p_parent->i_children ; i++ )
 227    {
 228        if( p_parent->pp_children[i] == p_item )
 229        {
 230            REMOVE_ELEM( p_parent->pp_children, p_parent->i_children, i );
 231        }
 232    }
 233
 234    return VLC_SUCCESS;
 235 }
 236
 237
 238 /**
 239  * Count the children of a node
 240  *
 241  * \param p_playlist the playlist
 242  * \param p_node the node
 243  * \return the number of children
 244  */
 245 int playlist_NodeChildrenCount( playlist_t *p_playlist, playlist_item_t*p_node)
 246 {
 247     int i;
 248     int i_nb = 0;
 249     if( p_node->i_children == -1 )
 250         return 0;
 251
 252     for( i=0 ; i< p_node->i_children;i++ )
 253     {
 254         if( p_node->pp_children[i]->i_children == -1 )
 255             i_nb++;
 256         else
 257             i_nb += playlist_NodeChildrenCount( p_playlist,
 258                                                 p_node->pp_children[i] );
 259     }
 260     return i_nb;
 261 }
 262
 263 /**
 264  * Search a child of a node by its name
 265  *
 266  * \param p_node the node
 267  * \param psz_search the name of the child to search
 268  * \return the child item or NULL if not found or error
 269  */
 270 playlist_item_t *playlist_ChildSearchName( playlist_item_t *p_node,
 271                                            const char *psz_search )
 272 {
 273     int i;
 274
 275     if( p_node->i_children < 0 )
 276     {
 277          return NULL;
 278     }
 279     for( i = 0 ; i< p_node->i_children; i++ )
 280     {
 281         if( !strcmp( p_node->pp_children[i]->p_input->psz_name, psz_search ) )
 282         {
 283             return p_node->pp_children[i];
 284         }
 285     }
 286     return NULL;
 287 }
 288
 289
 290 void playlist_NodesCreateForSD( playlist_t *p_playlist, char *psz_name,
 291                                 playlist_item_t **pp_node_cat,
 292                                 playlist_item_t **pp_node_one )
 293 {
 294     *pp_node_cat = playlist_NodeCreate( p_playlist, psz_name,
 295                                         p_playlist->p_root_category );
 296     (*pp_node_cat)->i_flags |= PLAYLIST_RO_FLAG;
 297     (*pp_node_cat)->i_flags |= PLAYLIST_SKIP_FLAG;
 298
 299     *pp_node_one = playlist_NodeCreate( p_playlist, psz_name,
 300                                         p_playlist->p_root_onelevel );
 301     (*pp_node_one)->i_flags |= PLAYLIST_RO_FLAG;
 302     (*pp_node_one)->i_flags |= PLAYLIST_SKIP_FLAG;
 303 }
 304
 305
 306 /**********************************************************************
 307  * Tree walking functions
 308  **********************************************************************/
 309
 310 playlist_item_t *playlist_GetLastLeaf(playlist_t *p_playlist,
 311                                       playlist_item_t *p_root )
 312 {
 313     int i;
 314     playlist_item_t *p_item;
 315     for ( i = p_root->i_children - 1; i >= 0; i-- )
 316     {
 317         if( p_root->pp_children[i]->i_children == -1 )
 318             return p_root->pp_children[i];
 319         else if( p_root->pp_children[i]->i_children > 0)
 320         {
 321              p_item = playlist_GetLastLeaf( p_playlist,
 322                                             p_root->pp_children[i] );
 323             if ( p_item != NULL )
 324                 return p_item;
 325         }
 326         else if( i == 0 )
 327             return NULL;
 328     }
 329     return NULL;
 330 }
 331
 332 /**
 333  * Finds the next item to play
 334  *
 335  * \param p_playlist the playlist
 336  * \param p_root the root node
 337  * \param p_item the previous item  (NULL if none )
 338  * \return the next item to play, or NULL if none found
 339  */
 340 playlist_item_t *playlist_GetNextLeaf( playlist_t *p_playlist,
 341                                        playlist_item_t *p_root,
 342                                        playlist_item_t *p_item )
 343 {
 344     playlist_item_t *p_next;
 345
 346     assert( p_root && p_root->i_children != -1 );
 347
 348 #ifdef PLAYLIST_DEBUG
 349     if( p_item != NULL )
 350         msg_Dbg( p_playlist, "finding next of %s within %s",
 351                         p_item->p_input->psz_name,  p_root->p_input->psz_name );
 352     else
 353         msg_Dbg( p_playlist, "finding something to play within %s",
 354                          p_root->p_input->psz_name );
 355 #endif
 356
 357
 358     /* Now, walk the tree until we find a suitable next item */
 359     p_next = p_item;
 360     do
 361     {
 362         p_next = GetNextItem( p_playlist, p_root, p_next );
 363     } while ( p_next && p_next != p_root && p_next->i_children != -1 );
 364
 365 #ifdef PLAYLIST_DEBUG
 366     if( p_next == NULL )
 367         msg_Dbg( p_playlist, "At end of node" );
 368 #endif
 369     return p_next;
 370 }
 371
 372 playlist_item_t *playlist_GetNextEnabledLeaf( playlist_t *p_playlist,
 373                                               playlist_item_t *p_root,
 374                                               playlist_item_t *p_item )
 375 {
 376     playlist_item_t *p_next;
 377
 378 #ifdef PLAYLIST_DEBUG
 379     if( p_item != NULL )
 380         msg_Dbg( p_playlist, "finding next of %s within %s",
 381                         p_item->p_input->psz_name,  p_root->p_input->psz_name );
 382     else
 383         msg_Dbg( p_playlist, "finding something to play within %s",
 384                          p_root->p_input->psz_name );
 385 #endif
 386
 387     assert( p_root && p_root->i_children != -1 );
 388
 389     /* Now, walk the tree until we find a suitable next item */
 390     p_next = p_item;
 391     do
 392     {
 393         p_next = GetNextItem( p_playlist, p_root, p_next );
 394     } while ( p_next && p_next != p_root &&
 395               !( p_next->i_children == -1 &&
 396               !(p_next->i_flags & PLAYLIST_DBL_FLAG) ) );
 397
 398 #ifdef PLAYLIST_DEBUG
 399     if( p_next == NULL )
 400         msg_Dbg( p_playlist, "At end of node" );
 401 #endif
 402     return p_next;
 403 }
 404
 405 /**
 406  * Finds the previous item to play
 407  *
 408  * \param p_playlist the playlist
 409  * \param p_root the root node
 410  * \param p_item the previous item  (NULL if none )
 411  * \return the next item to play, or NULL if none found
 412  */
 413 playlist_item_t *playlist_GetPrevLeaf( playlist_t *p_playlist,
 414                                        playlist_item_t *p_root,
 415                                        playlist_item_t *p_item )
 416 {
 417     playlist_item_t *p_prev;
 418
 419 #ifdef PLAYLIST_DEBUG
 420     if( p_item != NULL )
 421         msg_Dbg( p_playlist, "finding previous of %s within %s",
 422                         p_item->p_input->psz_name,  p_root->p_input->psz_name );
 423     else
 424         msg_Dbg( p_playlist, "finding previous to play within %s",
 425                          p_root->p_input->psz_name );
 426 #endif
 427     assert( p_root && p_root->i_children != -1 );
 428
 429     /* Now, walk the tree until we find a suitable previous item */
 430     p_prev = p_item;
 431     do
 432     {
 433         p_prev = GetPrevItem( p_playlist, p_root, p_prev );
 434     } while ( p_prev && p_prev != p_root && p_prev->i_children != -1 );
 435
 436 #ifdef PLAYLIST_DEBUG
 437     if( p_prev == NULL )
 438         msg_Dbg( p_playlist, "At beginning of node" );
 439 #endif
 440     return p_prev;
 441 }
 442
 443 /************************************************************************
 444  * Following functions are local
 445  ***********************************************************************/
 446
 447 /**
 448  * Get the next item in the tree
 449  * If p_item is NULL, return the first child of root
 450  **/
 451 playlist_item_t *GetNextItem( playlist_t *p_playlist,
 452                               playlist_item_t *p_root,
 453                               playlist_item_t *p_item )
 454 {
 455     playlist_item_t *p_parent;
 456     int i;
 457
 458     /* Node with children, get the first one */
 459     if( p_item && p_item->i_children > 0 )
 460         return p_item->pp_children[0];
 461
 462     if( p_item != NULL )
 463         p_parent = p_item->p_parent;
 464     else
 465         p_parent = p_root;
 466
 467     for( i= 0 ; i < p_parent->i_children ; i++ )
 468     {
 469         if( p_item == NULL || p_parent->pp_children[i] == p_item )
 470         {
 471             if( p_item == NULL )
 472                 i = -1;
 473
 474             if( i+1 >= p_parent->i_children )
 475             {
 476                 /* Was already the last sibling. Look for uncles */
 477                 PL_DEBUG( "Current item is the last of the node,"
 478                           "looking for uncle from %s",
 479                            p_parent->p_input->psz_name );
 480
 481                 if( p_parent == p_root )
 482                 {
 483                     PL_DEBUG( "already at root" );
 484                     return NULL;
 485                 }
 486                 return GetNextUncle( p_playlist, p_item, p_root );
 487             }
 488             else
 489             {
 490                 return  p_parent->pp_children[i+1];
 491             }
 492         }
 493     }
 494     msg_Err( p_playlist, "I should not be here" );
 495     return NULL;
 496 }
 497
 498 playlist_item_t *GetNextUncle( playlist_t *p_playlist, playlist_item_t *p_item,
 499                                playlist_item_t *p_root )
 500 {
 501     playlist_item_t *p_parent = p_item->p_parent;
 502     playlist_item_t *p_grandparent;
 503     vlc_bool_t b_found = VLC_FALSE;
 504
 505     if( p_parent != NULL )
 506     {
 507         p_grandparent = p_parent->p_parent;
 508         while( 1 )
 509         {
 510             int i;
 511             for( i = 0 ; i< p_grandparent->i_children ; i++ )
 512             {
 513                 if( p_parent == p_grandparent->pp_children[i] )
 514                 {
 515                     PL_DEBUG( "parent %s found as child %i of grandparent %s",
 516                               p_parent->p_input->psz_name, i,
 517                               p_grandparent->p_input->psz_name );
 518                     b_found = VLC_TRUE;
 519                     break;
 520                 }
 521             }
 522             if( b_found && i + 1 < p_grandparent->i_children )
 523             {
 524                     return p_grandparent->pp_children[i+1];
 525             }
 526             /* Not found at root */
 527             if( p_grandparent == p_root )
 528             {
 529                 return NULL;
 530             }
 531             else
 532             {
 533                 p_parent = p_grandparent;
 534                 p_grandparent = p_parent->p_parent;
 535             }
 536         }
 537     }
 538     /* We reached root */
 539     return NULL;
 540 }
 541
 542 playlist_item_t *GetPrevUncle( playlist_t *p_playlist, playlist_item_t *p_item,
 543                                playlist_item_t *p_root )
 544 {
 545     playlist_item_t *p_parent = p_item->p_parent;
 546     playlist_item_t *p_grandparent;
 547     vlc_bool_t b_found = VLC_FALSE;
 548
 549     if( p_parent != NULL )
 550     {
 551         p_grandparent = p_parent->p_parent;
 552         while( 1 )
 553         {
 554             int i;
 555             for( i = p_grandparent->i_children -1 ; i >= 0; i-- )
 556             {
 557                 if( p_parent == p_grandparent->pp_children[i] )
 558                 {
 559                     b_found = VLC_TRUE;
 560                     break;
 561                 }
 562             }
 563             if( b_found && i - 1 > 0 )
 564             {
 565                 return p_grandparent->pp_children[i-1];
 566             }
 567             /* Not found at root */
 568             if( p_grandparent == p_root )
 569             {
 570                 return NULL;
 571             }
 572             else
 573             {
 574                 p_parent = p_grandparent;
 575                 p_grandparent = p_parent->p_parent;
 576             }
 577         }
 578     }
 579     /* We reached root */
 580     return NULL;
 581 }
 582
 583
 584 /* Recursively search the tree for previous item */
 585 playlist_item_t *GetPrevItem( playlist_t *p_playlist,
 586                               playlist_item_t *p_root,
 587                               playlist_item_t *p_item )
 588 {
 589     playlist_item_t *p_parent;
 590     int i;
 591
 592     /* Node with children, get the last one */
 593     if( p_item && p_item->i_children > 0 )
 594         return p_item->pp_children[p_item->i_children - 1];
 595
 596     /* Last child of its parent ? */
 597     if( p_item != NULL )
 598         p_parent = p_item->p_parent;
 599     else
 600     {
 601         msg_Err( p_playlist, "Get the last one" );
 602         abort();
 603     };
 604
 605     for( i = p_parent->i_children -1 ; i >= 0 ;  i-- )
 606     {
 607         if( p_parent->pp_children[i] == p_item )
 608         {
 609             if( i-1 < 0 )
 610             {
 611                 /* Was already the first sibling. Look for uncles */
 612                 PL_DEBUG( "Current item is the first of the node,"
 613                           "looking for uncle from %s",
 614                           p_parent->p_input->psz_name );
 615                 return GetPrevUncle( p_playlist, p_item, p_root );
 616             }
 617             else
 618             {
 619                 return p_parent->pp_children[i-1];
 620             }
 621         }
 622     }
 623     msg_Err( p_playlist, "I should not be here" );
 624     return NULL;
 625 }
 626
 627 /* Dump the contents of a node */
 628 void playlist_NodeDump( playlist_t *p_playlist, playlist_item_t *p_item,
 629                         int i_level )
 630 {
 631     char str[512];
 632     int i;
 633
 634     if( i_level == 1 )
 635     {
 636         msg_Dbg( p_playlist, "%s (%i)",
 637                         p_item->p_input->psz_name, p_item->i_children );
 638     }
 639
 640     if( p_item->i_children == -1 )
 641     {
 642         return;
 643     }
 644
 645     for( i = 0; i< p_item->i_children; i++ )
 646     {
 647         memset( str, 32, 512 );
 648         sprintf( str + 2 * i_level , "%s (%i)",
 649                                 p_item->pp_children[i]->p_input->psz_name,
 650                                 p_item->pp_children[i]->i_children );
 651         msg_Dbg( p_playlist, "%s",str );
 652         if( p_item->pp_children[i]->i_children >= 0 )
 653         {
 654             playlist_NodeDump( p_playlist, p_item->pp_children[i],
 655                               i_level + 1 );
 656         }
 657     }
 658     return;
 659 }