You can not select more than 25 topics
Topics must start with a letter or number, can include dashes ('-') and can be up to 35 characters long.
1145 lines
32 KiB
1145 lines
32 KiB
/*****************************************************************************
|
|
* playlist_model.cpp : Manage playlist model
|
|
****************************************************************************
|
|
* Copyright (C) 2006-2011 the VideoLAN team
|
|
* $Id$
|
|
*
|
|
* Authors: Clément Stenac <zorglub@videolan.org>
|
|
* Ilkka Ollakkka <ileoo (at) videolan dot org>
|
|
* Jakob Leben <jleben@videolan.org>
|
|
*
|
|
* 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 2 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, write to the Free Software
|
|
* Foundation, Inc., 51 Franklin Street, Fifth Floor, Boston MA 02110-1301, USA.
|
|
*****************************************************************************/
|
|
|
|
#ifdef HAVE_CONFIG_H
|
|
# include "config.h"
|
|
#endif
|
|
|
|
#include "qt4.hpp"
|
|
#include "components/playlist/playlist_model.hpp"
|
|
#include "input_manager.hpp" /* THEMIM */
|
|
|
|
#include <vlc_intf_strings.h> /* I_DIR */
|
|
|
|
#include "pixmaps/types/type_unknown.xpm"
|
|
#include "sorting.h"
|
|
|
|
#include <assert.h>
|
|
#include <QIcon>
|
|
#include <QFont>
|
|
#include <QTimer>
|
|
#include <QAction>
|
|
#include <QBuffer>
|
|
|
|
QIcon PLModel::icons[ITEM_TYPE_NUMBER];
|
|
|
|
/*************************************************************************
|
|
* Playlist model implementation
|
|
*************************************************************************/
|
|
|
|
PLModel::PLModel( playlist_t *_p_playlist, /* THEPL */
|
|
intf_thread_t *_p_intf, /* main Qt p_intf */
|
|
playlist_item_t * p_root,
|
|
QObject *parent ) /* Basic Qt parent */
|
|
: VLCModel( _p_intf, parent )
|
|
{
|
|
p_playlist = _p_playlist;
|
|
i_cached_id = -1;
|
|
i_cached_input_id = -1;
|
|
|
|
rootItem = NULL; /* PLItem rootItem, will be set in rebuild( ) */
|
|
latestSearch = QString();
|
|
|
|
/* Icons initialization */
|
|
#define ADD_ICON(type, x) icons[ITEM_TYPE_##type] = QIcon( x )
|
|
ADD_ICON( UNKNOWN , type_unknown_xpm );
|
|
ADD_ICON( FILE, ":/type/file" );
|
|
ADD_ICON( DIRECTORY, ":/type/directory" );
|
|
ADD_ICON( DISC, ":/type/disc" );
|
|
ADD_ICON( CDDA, ":/type/cdda" );
|
|
ADD_ICON( CARD, ":/type/capture-card" );
|
|
ADD_ICON( NET, ":/type/net" );
|
|
ADD_ICON( PLAYLIST, ":/type/playlist" );
|
|
ADD_ICON( NODE, ":/type/node" );
|
|
#undef ADD_ICON
|
|
|
|
rebuild( p_root );
|
|
DCONNECT( THEMIM->getIM(), metaChanged( input_item_t *),
|
|
this, processInputItemUpdate( input_item_t *) );
|
|
DCONNECT( THEMIM, inputChanged( input_thread_t * ),
|
|
this, processInputItemUpdate( input_thread_t* ) );
|
|
CONNECT( THEMIM, playlistItemAppended( int, int ),
|
|
this, processItemAppend( int, int ) );
|
|
CONNECT( THEMIM, playlistItemRemoved( int ),
|
|
this, processItemRemoval( int ) );
|
|
CONNECT( &insertBufferCommitTimer, timeout(), this, commitBufferedRowInserts() );
|
|
}
|
|
|
|
PLModel::~PLModel()
|
|
{
|
|
delete rootItem;
|
|
}
|
|
|
|
Qt::DropActions PLModel::supportedDropActions() const
|
|
{
|
|
return Qt::CopyAction | Qt::MoveAction;
|
|
}
|
|
|
|
Qt::ItemFlags PLModel::flags( const QModelIndex &index ) const
|
|
{
|
|
Qt::ItemFlags flags = QAbstractItemModel::flags( index );
|
|
|
|
const PLItem *item = index.isValid() ? getItem( index ) : rootItem;
|
|
|
|
if( canEdit() )
|
|
{
|
|
PL_LOCK;
|
|
playlist_item_t *plItem =
|
|
playlist_ItemGetById( p_playlist, item->i_id );
|
|
|
|
if ( plItem && ( plItem->i_children > -1 ) )
|
|
flags |= Qt::ItemIsDropEnabled;
|
|
|
|
PL_UNLOCK;
|
|
|
|
}
|
|
flags |= Qt::ItemIsDragEnabled;
|
|
|
|
return flags;
|
|
}
|
|
|
|
QStringList PLModel::mimeTypes() const
|
|
{
|
|
QStringList types;
|
|
types << "vlc/qt-input-items";
|
|
return types;
|
|
}
|
|
|
|
bool modelIndexLessThen( const QModelIndex &i1, const QModelIndex &i2 )
|
|
{
|
|
if( !i1.isValid() || !i2.isValid() ) return false;
|
|
PLItem *item1 = static_cast<PLItem*>( i1.internalPointer() );
|
|
PLItem *item2 = static_cast<PLItem*>( i2.internalPointer() );
|
|
if( item1->hasSameParent( item2 ) ) return i1.row() < i2.row();
|
|
else return *item1 < *item2;
|
|
}
|
|
|
|
QMimeData *PLModel::mimeData( const QModelIndexList &indexes ) const
|
|
{
|
|
PlMimeData *plMimeData = new PlMimeData();
|
|
QModelIndexList list;
|
|
|
|
foreach( const QModelIndex &index, indexes ) {
|
|
if( index.isValid() && index.column() == 0 )
|
|
list.append(index);
|
|
}
|
|
|
|
qSort(list.begin(), list.end(), modelIndexLessThen);
|
|
|
|
AbstractPLItem *item = NULL;
|
|
foreach( const QModelIndex &index, list ) {
|
|
if( item )
|
|
{
|
|
AbstractPLItem *testee = getItem( index );
|
|
while( testee->parent() )
|
|
{
|
|
if( testee->parent() == item ||
|
|
testee->parent() == item->parent() ) break;
|
|
testee = testee->parent();
|
|
}
|
|
if( testee->parent() == item ) continue;
|
|
item = getItem( index );
|
|
}
|
|
else
|
|
item = getItem( index );
|
|
|
|
plMimeData->appendItem( static_cast<PLItem*>(item)->inputItem() );
|
|
}
|
|
|
|
return plMimeData;
|
|
}
|
|
|
|
/* Drop operation */
|
|
bool PLModel::dropMimeData( const QMimeData *data, Qt::DropAction action,
|
|
int row, int, const QModelIndex &parent )
|
|
{
|
|
bool copy = action == Qt::CopyAction;
|
|
if( !copy && action != Qt::MoveAction )
|
|
return true;
|
|
|
|
const PlMimeData *plMimeData = qobject_cast<const PlMimeData*>( data );
|
|
if( plMimeData )
|
|
{
|
|
if( copy )
|
|
dropAppendCopy( plMimeData, getItem( parent ), row );
|
|
else
|
|
dropMove( plMimeData, getItem( parent ), row );
|
|
}
|
|
return true;
|
|
}
|
|
|
|
void PLModel::dropAppendCopy( const PlMimeData *plMimeData, PLItem *target, int pos )
|
|
{
|
|
PL_LOCK;
|
|
|
|
playlist_item_t *p_parent =
|
|
playlist_ItemGetByInput( p_playlist, target->inputItem() );
|
|
if( !p_parent ) return;
|
|
|
|
if( pos == -1 ) pos = PLAYLIST_END;
|
|
|
|
QList<input_item_t*> inputItems = plMimeData->inputItems();
|
|
|
|
foreach( input_item_t* p_input, inputItems )
|
|
{
|
|
playlist_item_t *p_item = playlist_ItemGetByInput( p_playlist, p_input );
|
|
if( !p_item ) continue;
|
|
pos = playlist_NodeAddCopy( p_playlist, p_item, p_parent, pos );
|
|
}
|
|
|
|
PL_UNLOCK;
|
|
}
|
|
|
|
void PLModel::dropMove( const PlMimeData * plMimeData, PLItem *target, int row )
|
|
{
|
|
QList<input_item_t*> inputItems = plMimeData->inputItems();
|
|
QList<PLItem*> model_items;
|
|
playlist_item_t **pp_items;
|
|
pp_items = (playlist_item_t **)
|
|
calloc( inputItems.count(), sizeof( playlist_item_t* ) );
|
|
if ( !pp_items ) return;
|
|
|
|
PL_LOCK;
|
|
|
|
playlist_item_t *p_parent =
|
|
playlist_ItemGetByInput( p_playlist, target->inputItem() );
|
|
|
|
if( !p_parent || row > p_parent->i_children )
|
|
{
|
|
PL_UNLOCK;
|
|
free( pp_items );
|
|
return;
|
|
}
|
|
|
|
int new_pos = row == -1 ? p_parent->i_children : row;
|
|
int model_pos = new_pos;
|
|
int i = 0;
|
|
|
|
foreach( input_item_t *p_input, inputItems )
|
|
{
|
|
playlist_item_t *p_item = playlist_ItemGetByInput( p_playlist, p_input );
|
|
if( !p_item ) continue;
|
|
|
|
PLItem *item = findByInput( rootItem, p_input->i_id );
|
|
if( !item ) continue;
|
|
|
|
/* Better not try to move a node into itself.
|
|
Abort the whole operation in that case,
|
|
because it is ambiguous. */
|
|
AbstractPLItem *climber = target;
|
|
while( climber )
|
|
{
|
|
if( climber == item )
|
|
{
|
|
PL_UNLOCK;
|
|
free( pp_items );
|
|
return;
|
|
}
|
|
climber = climber->parent();
|
|
}
|
|
|
|
if( item->parent() == target &&
|
|
target->children.indexOf( item ) < new_pos )
|
|
model_pos--;
|
|
|
|
model_items.append( item );
|
|
pp_items[i] = p_item;
|
|
i++;
|
|
}
|
|
|
|
if( model_items.isEmpty() )
|
|
{
|
|
PL_UNLOCK;
|
|
free( pp_items );
|
|
return;
|
|
}
|
|
|
|
playlist_TreeMoveMany( p_playlist, i, pp_items, p_parent, new_pos );
|
|
|
|
PL_UNLOCK;
|
|
|
|
foreach( PLItem *item, model_items )
|
|
takeItem( item );
|
|
|
|
insertChildren( target, model_items, model_pos );
|
|
free( pp_items );
|
|
}
|
|
|
|
/* remove item with its id */
|
|
void PLModel::removeItem( int i_id )
|
|
{
|
|
PLItem *item = findById( rootItem, i_id );
|
|
removeItem( item );
|
|
}
|
|
|
|
void PLModel::activateItem( const QModelIndex &index )
|
|
{
|
|
assert( index.isValid() );
|
|
const PLItem *item = getItem( index );
|
|
assert( item );
|
|
PL_LOCK;
|
|
playlist_item_t *p_item = playlist_ItemGetById( p_playlist, item->i_id );
|
|
activateItem( p_item );
|
|
PL_UNLOCK;
|
|
}
|
|
|
|
/* Convenient overloaded private version of activateItem
|
|
* Must be entered with PL lock */
|
|
void PLModel::activateItem( playlist_item_t *p_item )
|
|
{
|
|
if( !p_item ) return;
|
|
playlist_item_t *p_parent = p_item;
|
|
while( p_parent )
|
|
{
|
|
if( p_parent->i_id == rootItem->id() ) break;
|
|
p_parent = p_parent->p_parent;
|
|
}
|
|
if( p_parent )
|
|
playlist_Control( p_playlist, PLAYLIST_VIEWPLAY, pl_Locked,
|
|
p_parent, p_item );
|
|
}
|
|
|
|
/****************** Base model mandatory implementations *****************/
|
|
QVariant PLModel::data( const QModelIndex &index, const int role ) const
|
|
{
|
|
if( !index.isValid() ) return QVariant();
|
|
PLItem *item = getItem( index );
|
|
if( role == Qt::DisplayRole )
|
|
{
|
|
int metadata = columnToMeta( index.column() );
|
|
if( metadata == COLUMN_END ) return QVariant();
|
|
|
|
QString returninfo;
|
|
if( metadata == COLUMN_NUMBER )
|
|
returninfo = QString::number( index.row() + 1 );
|
|
else if( metadata == COLUMN_COVER )
|
|
{
|
|
QString artUrl;
|
|
artUrl = InputManager::decodeArtURL( item->inputItem() );
|
|
if( artUrl.isEmpty() )
|
|
{
|
|
for( int i = 0; i < item->childCount(); i++ )
|
|
{
|
|
artUrl = InputManager::decodeArtURL( item->child( i )->inputItem() );
|
|
if( !artUrl.isEmpty() )
|
|
break;
|
|
}
|
|
}
|
|
return QVariant( artUrl );
|
|
}
|
|
else
|
|
{
|
|
char *psz = psz_column_meta( item->inputItem(), metadata );
|
|
returninfo = qfu( psz );
|
|
free( psz );
|
|
}
|
|
return QVariant( returninfo );
|
|
}
|
|
else if( role == Qt::DecorationRole && index.column() == 0 )
|
|
{
|
|
/* Used to segfault here because i_type wasn't always initialized */
|
|
return QVariant( PLModel::icons[item->inputItem()->i_type] );
|
|
}
|
|
else if( role == Qt::FontRole )
|
|
{
|
|
return QVariant( QFont() );
|
|
}
|
|
else if( role == Qt::ToolTipRole )
|
|
{
|
|
int i_art_policy = var_GetInteger( p_playlist, "album-art" );
|
|
QString artUrl;
|
|
/* FIXME: Skip, as we don't want the pixmap and do not know the cached art file */
|
|
if ( i_art_policy == ALBUM_ART_ALL )
|
|
artUrl = getArtUrl( index );
|
|
if ( artUrl.isEmpty() ) artUrl = ":/noart";
|
|
QString duration = qtr( "unknown" );
|
|
QString name;
|
|
PL_LOCK;
|
|
input_item_t *p_item = item->inputItem();
|
|
if ( !p_item )
|
|
{
|
|
PL_UNLOCK;
|
|
return QVariant();
|
|
}
|
|
if ( p_item->i_duration > 0 )
|
|
{
|
|
char *psz = psz_column_meta( item->inputItem(), COLUMN_DURATION );
|
|
duration = qfu( psz );
|
|
free( psz );
|
|
}
|
|
name = qfu( p_item->psz_name );
|
|
PL_UNLOCK;
|
|
QPixmap image = getArtPixmap( index, QSize( 128, 128 ) );
|
|
QByteArray bytes;
|
|
QBuffer buffer( &bytes );
|
|
buffer.open( QIODevice::WriteOnly );
|
|
image.save(&buffer, "BMP"); /* uncompressed, see qpixmap#reading-and-writing-image-files */
|
|
return QVariant( QString("<img width=\"128\" height=\"128\" align=\"left\" src=\"data:image/bmp;base64,%1\"/><div><b>%2</b><br/>%3</div>")
|
|
.arg( bytes.toBase64().constData() )
|
|
.arg( name )
|
|
.arg( qtr("Duration") + ": " + duration )
|
|
);
|
|
}
|
|
else if( role == Qt::BackgroundRole && isCurrent( index ) )
|
|
{
|
|
return QVariant( QBrush( Qt::gray ) );
|
|
}
|
|
else if( role == IsCurrentRole )
|
|
{
|
|
return QVariant( isCurrent( index ) );
|
|
}
|
|
else if( role == IsLeafNodeRole )
|
|
{
|
|
QVariant isLeaf;
|
|
PL_LOCK;
|
|
playlist_item_t *plItem =
|
|
playlist_ItemGetById( p_playlist, item->i_id );
|
|
|
|
if( plItem )
|
|
isLeaf = plItem->i_children == -1;
|
|
|
|
PL_UNLOCK;
|
|
return isLeaf;
|
|
}
|
|
else if( role == IsCurrentsParentNodeRole )
|
|
{
|
|
return QVariant( isParent( index, currentIndex() ) );
|
|
}
|
|
return QVariant();
|
|
}
|
|
|
|
/* Seek from current index toward the top and see if index is one of parent nodes */
|
|
bool PLModel::isParent( const QModelIndex &index, const QModelIndex ¤t ) const
|
|
{
|
|
if( !index.isValid() )
|
|
return false;
|
|
|
|
if( index == current )
|
|
return true;
|
|
|
|
if( !current.isValid() || !current.parent().isValid() )
|
|
return false;
|
|
|
|
return isParent( index, current.parent() );
|
|
}
|
|
|
|
bool PLModel::isCurrent( const QModelIndex &index ) const
|
|
{
|
|
return getItem( index )->inputItem() == THEMIM->currentInputItem();
|
|
}
|
|
|
|
int PLModel::itemId( const QModelIndex &index ) const
|
|
{
|
|
return getItem( index )->id();
|
|
}
|
|
|
|
input_item_t * PLModel::getInputItem( const QModelIndex &index ) const
|
|
{
|
|
return getItem( index )->inputItem();
|
|
}
|
|
|
|
QString PLModel::getURI( const QModelIndex &index ) const
|
|
{
|
|
QString uri;
|
|
input_item_t *p_item = getItem( index )->inputItem();
|
|
/* no PL lock as item gets refcount +1 from PLItem, which only depends of events */
|
|
vlc_mutex_lock( &p_item->lock );
|
|
uri = qfu( p_item->psz_uri );
|
|
vlc_mutex_unlock( &p_item->lock );
|
|
return uri;
|
|
}
|
|
|
|
QString PLModel::getTitle( const QModelIndex &index ) const
|
|
{
|
|
QString title;
|
|
input_item_t *p_item = getItem( index )->inputItem();
|
|
char *fb_name = input_item_GetTitle( p_item );
|
|
if( EMPTY_STR( fb_name ) )
|
|
{
|
|
free( fb_name );
|
|
fb_name = input_item_GetName( p_item );
|
|
}
|
|
title = qfu(fb_name);
|
|
free(fb_name);
|
|
return title;
|
|
}
|
|
|
|
bool PLModel::isCurrentItem( const QModelIndex &index, playLocation where ) const
|
|
{
|
|
if ( where == IN_PLAYLIST )
|
|
{
|
|
return itemId( index ) == THEPL->p_playing->i_id;
|
|
}
|
|
else if ( where == IN_MEDIALIBRARY )
|
|
{
|
|
return THEPL->p_media_library &&
|
|
itemId( index ) == THEPL->p_media_library->i_id;
|
|
}
|
|
return false;
|
|
}
|
|
|
|
QVariant PLModel::headerData( int section, Qt::Orientation orientation,
|
|
int role ) const
|
|
{
|
|
if (orientation != Qt::Horizontal || role != Qt::DisplayRole)
|
|
return QVariant();
|
|
|
|
int meta_col = columnToMeta( section );
|
|
|
|
if( meta_col == COLUMN_END ) return QVariant();
|
|
|
|
return QVariant( qfu( psz_column_title( meta_col ) ) );
|
|
}
|
|
|
|
QModelIndex PLModel::index( const int row, const int column, const QModelIndex &parent )
|
|
const
|
|
{
|
|
PLItem *parentItem = parent.isValid() ? getItem( parent ) : rootItem;
|
|
|
|
PLItem *childItem = static_cast<PLItem*>(parentItem->child( row ));
|
|
if( childItem )
|
|
return createIndex( row, column, childItem );
|
|
else
|
|
return QModelIndex();
|
|
}
|
|
|
|
QModelIndex PLModel::index( const int i_id, const int c )
|
|
{
|
|
return index( findById( rootItem, i_id ), c );
|
|
}
|
|
|
|
QModelIndex PLModel::rootIndex() const
|
|
{
|
|
return index( findById( rootItem, rootItem->id() ), 0 );
|
|
}
|
|
|
|
bool PLModel::isTree() const
|
|
{
|
|
return ( ( rootItem && rootItem->id() != p_playlist->p_playing->i_id )
|
|
|| var_InheritBool( p_intf, "playlist-tree" ) );
|
|
}
|
|
|
|
/* Return the index of a given item */
|
|
QModelIndex PLModel::index( PLItem *item, int column ) const
|
|
{
|
|
if( !item ) return QModelIndex();
|
|
AbstractPLItem *parent = item->parent();
|
|
if( parent )
|
|
return createIndex( parent->lastIndexOf( item ),
|
|
column, item );
|
|
return QModelIndex();
|
|
}
|
|
|
|
QModelIndex PLModel::currentIndex() const
|
|
{
|
|
input_thread_t *p_input_thread = THEMIM->getInput();
|
|
if( !p_input_thread ) return QModelIndex();
|
|
PLItem *item = findByInput( rootItem, input_GetItem( p_input_thread )->i_id );
|
|
return index( item, 0 );
|
|
}
|
|
|
|
QModelIndex PLModel::parent( const QModelIndex &index ) const
|
|
{
|
|
if( !index.isValid() ) return QModelIndex();
|
|
|
|
PLItem *childItem = getItem( index );
|
|
if( !childItem )
|
|
{
|
|
msg_Err( p_playlist, "Item not found" );
|
|
return QModelIndex();
|
|
}
|
|
|
|
PLItem *parentItem = static_cast<PLItem*>(childItem->parent());
|
|
if( !parentItem || parentItem == rootItem ) return QModelIndex();
|
|
if( !parentItem->parent() )
|
|
{
|
|
msg_Err( p_playlist, "No parent found, trying row 0. Please report this" );
|
|
return createIndex( 0, 0, parentItem );
|
|
}
|
|
return createIndex(parentItem->row(), 0, parentItem);
|
|
}
|
|
|
|
int PLModel::rowCount( const QModelIndex &parent ) const
|
|
{
|
|
PLItem *parentItem = parent.isValid() ? getItem( parent ) : rootItem;
|
|
return parentItem->childCount();
|
|
}
|
|
|
|
/************************* Lookups *****************************/
|
|
PLItem *PLModel::findById( PLItem *root, int i_id ) const
|
|
{
|
|
return findInner( root, i_id, false );
|
|
}
|
|
|
|
PLItem *PLModel::findByInput( PLItem *root, int i_id ) const
|
|
{
|
|
PLItem *result = findInner( root, i_id, true );
|
|
return result;
|
|
}
|
|
|
|
PLItem * PLModel::findInner( PLItem *root, int i_id, bool b_input ) const
|
|
{
|
|
if( !root ) return NULL;
|
|
|
|
if( !b_input && root->id() == i_id )
|
|
return root;
|
|
|
|
else if( b_input && root->inputItem()->i_id == i_id )
|
|
return root;
|
|
|
|
QList<AbstractPLItem *>::iterator it = root->children.begin();
|
|
while ( it != root->children.end() )
|
|
{
|
|
PLItem *item = static_cast<PLItem *>(*it);
|
|
if( !b_input && item->id() == i_id )
|
|
return item;
|
|
|
|
else if( b_input && item->inputItem()->i_id == i_id )
|
|
return item;
|
|
|
|
if( item->childCount() )
|
|
{
|
|
PLItem *childFound = findInner( item, i_id, b_input );
|
|
if( childFound )
|
|
return childFound;
|
|
}
|
|
++it;
|
|
}
|
|
return NULL;
|
|
}
|
|
|
|
bool PLModel::canEdit() const
|
|
{
|
|
return (
|
|
rootItem != NULL &&
|
|
(
|
|
rootItem->inputItem() == p_playlist->p_playing->p_input ||
|
|
( p_playlist->p_media_library &&
|
|
rootItem->inputItem() == p_playlist->p_media_library->p_input )
|
|
)
|
|
);
|
|
}
|
|
|
|
/************************* Updates handling *****************************/
|
|
|
|
/**** Events processing ****/
|
|
void PLModel::processInputItemUpdate( input_thread_t *p_input )
|
|
{
|
|
if( !p_input ) return;
|
|
|
|
PLItem *item = findByInput( rootItem, input_GetItem( p_input )->i_id );
|
|
if( item ) emit currentIndexChanged( index( item, 0 ) );
|
|
processInputItemUpdate( input_GetItem( p_input ) );
|
|
}
|
|
|
|
void PLModel::processInputItemUpdate( input_item_t *p_item )
|
|
{
|
|
if( !p_item || p_item->i_id <= 0 ) return;
|
|
PLItem *item = findByInput( rootItem, p_item->i_id );
|
|
if( item )
|
|
updateTreeItem( item );
|
|
}
|
|
|
|
void PLModel::processItemRemoval( int i_id )
|
|
{
|
|
if( i_id <= 0 ) return;
|
|
removeItem( i_id );
|
|
}
|
|
|
|
void PLModel::commitBufferedRowInserts()
|
|
{
|
|
PLItem *toemit = NULL;
|
|
insertBufferCommitTimer.stop();
|
|
insertBufferMutex.lock();
|
|
if ( !insertBuffer.isEmpty() )
|
|
{
|
|
beginInsertRows( index( insertBufferRoot, 0 ), insertbuffer_firstrow, insertbuffer_lastrow );
|
|
foreach (PLItem *item, insertBuffer)
|
|
{
|
|
insertBufferRoot->insertChild( item, insertbuffer_firstrow++ );
|
|
if( item->inputItem() == THEMIM->currentInputItem() )
|
|
toemit = item;
|
|
}
|
|
endInsertRows();
|
|
insertBuffer.clear();
|
|
}
|
|
insertBufferMutex.unlock();
|
|
if ( toemit )
|
|
emit currentIndexChanged( index( toemit, 0 ) );
|
|
}
|
|
|
|
/*
|
|
Tries to agregate linear inserts of single row. Sends
|
|
more efficient updates notifications to views and then
|
|
avoids the flickering effect.
|
|
*/
|
|
void PLModel::bufferedRowInsert( PLItem *item, PLItem *parent, int pos )
|
|
{
|
|
insertBufferMutex.lock();
|
|
if ( ! insertBuffer.isEmpty() )
|
|
{
|
|
/* Check if we're doing linear insert */
|
|
if ( parent != insertBufferRoot || pos != insertbuffer_lastrow + 1 )
|
|
{
|
|
insertBufferMutex.unlock();
|
|
commitBufferedRowInserts();
|
|
bufferedRowInsert( item, parent, pos );
|
|
return;
|
|
}
|
|
}
|
|
|
|
if ( insertBuffer.isEmpty() )
|
|
{
|
|
insertBuffer << item;
|
|
insertBufferRoot = parent;
|
|
insertbuffer_firstrow = pos;
|
|
insertbuffer_lastrow = pos;
|
|
} else {
|
|
insertBuffer << item;
|
|
insertbuffer_lastrow++;
|
|
}
|
|
insertBufferMutex.unlock();
|
|
|
|
/* Schedule commit */
|
|
if ( ! insertBufferCommitTimer.isActive() )
|
|
{
|
|
insertBufferCommitTimer.setSingleShot( true );
|
|
insertBufferCommitTimer.start( 100 );
|
|
}
|
|
}
|
|
|
|
bool PLModel::isBufferedForInsert( PLItem *parent, int i_item )
|
|
{
|
|
bool b_return = false;
|
|
insertBufferMutex.lock();
|
|
if ( parent == insertBufferRoot )
|
|
{
|
|
foreach (PLItem *item, insertBuffer)
|
|
if ( item->i_id == i_item )
|
|
{
|
|
b_return = true;
|
|
break;
|
|
}
|
|
}
|
|
insertBufferMutex.unlock();
|
|
return b_return;
|
|
}
|
|
|
|
void PLModel::processItemAppend( int i_item, int i_parent )
|
|
{
|
|
playlist_item_t *p_item = NULL;
|
|
PLItem *newItem = NULL;
|
|
int pos;
|
|
|
|
/* Find the Parent */
|
|
PLItem *nodeParentItem = findById( rootItem, i_parent );
|
|
if( !nodeParentItem )
|
|
{ /* retry as it might have been in buffer */
|
|
commitBufferedRowInserts();
|
|
nodeParentItem = findById( rootItem, i_parent );
|
|
}
|
|
if( !nodeParentItem ) return;
|
|
|
|
/* Search for an already matching children */
|
|
if ( isBufferedForInsert( nodeParentItem, i_item ) ) return;
|
|
foreach( const AbstractPLItem *existing, nodeParentItem->children )
|
|
if( existing->id() == i_item ) return;
|
|
|
|
/* Find the child */
|
|
PL_LOCK;
|
|
p_item = playlist_ItemGetById( p_playlist, i_item );
|
|
if( !p_item || p_item->i_flags & PLAYLIST_DBL_FLAG )
|
|
{
|
|
PL_UNLOCK; return;
|
|
}
|
|
|
|
for( pos = p_item->p_parent->i_children - 1; pos >= 0; pos-- )
|
|
if( p_item->p_parent->pp_children[pos] == p_item ) break;
|
|
|
|
newItem = new PLItem( p_item, nodeParentItem );
|
|
PL_UNLOCK;
|
|
|
|
/* We insert the newItem (children) inside the parent */
|
|
bufferedRowInsert( newItem, nodeParentItem, pos );
|
|
|
|
if( latestSearch.isEmpty() ) return;
|
|
search( latestSearch, index( rootItem, 0), false /*FIXME*/ );
|
|
}
|
|
|
|
void PLModel::rebuild( playlist_item_t *p_root )
|
|
{
|
|
commitBufferedRowInserts();
|
|
/* Invalidate cache */
|
|
i_cached_id = i_cached_input_id = -1;
|
|
|
|
if( rootItem ) rootItem->clearChildren();
|
|
|
|
PL_LOCK;
|
|
if( p_root ) // Can be NULL
|
|
{
|
|
delete rootItem;
|
|
rootItem = new PLItem( p_root );
|
|
}
|
|
assert( rootItem );
|
|
/* Recreate from root */
|
|
updateChildren( rootItem );
|
|
PL_UNLOCK;
|
|
|
|
/* And signal the view */
|
|
reset();
|
|
if( p_root ) emit rootIndexChanged();
|
|
}
|
|
|
|
void PLModel::takeItem( PLItem *item )
|
|
{
|
|
commitBufferedRowInserts();
|
|
assert( item );
|
|
PLItem *parent = static_cast<PLItem*>(item->parent());
|
|
assert( parent );
|
|
int i_index = parent->indexOf( item );
|
|
|
|
beginRemoveRows( index( parent, 0 ), i_index, i_index );
|
|
parent->takeChildAt( i_index );
|
|
endRemoveRows();
|
|
}
|
|
|
|
void PLModel::insertChildren( PLItem *node, QList<PLItem*>& items, int i_pos )
|
|
{
|
|
commitBufferedRowInserts();
|
|
assert( node );
|
|
int count = items.count();
|
|
if( !count ) return;
|
|
beginInsertRows( index( node, 0 ), i_pos, i_pos + count - 1 );
|
|
for( int i = 0; i < count; i++ )
|
|
{
|
|
node->children.insert( i_pos + i, items[i] );
|
|
items[i]->parentItem = node;
|
|
}
|
|
endInsertRows();
|
|
}
|
|
|
|
void PLModel::removeItem( PLItem *item )
|
|
{
|
|
if( !item ) return;
|
|
commitBufferedRowInserts();
|
|
|
|
i_cached_id = -1;
|
|
i_cached_input_id = -1;
|
|
|
|
if( item->parent() ) {
|
|
int i = item->parent()->indexOf( item );
|
|
beginRemoveRows( index( static_cast<PLItem*>(item->parent()), 0), i, i );
|
|
item->parent()->children.removeAt(i);
|
|
delete item;
|
|
endRemoveRows();
|
|
}
|
|
else delete item;
|
|
|
|
if(item == rootItem)
|
|
{
|
|
rootItem = NULL;
|
|
rebuild( p_playlist->p_playing );
|
|
}
|
|
}
|
|
|
|
/* This function must be entered WITH the playlist lock */
|
|
void PLModel::updateChildren( PLItem *root )
|
|
{
|
|
playlist_item_t *p_node = playlist_ItemGetById( p_playlist, root->id() );
|
|
updateChildren( p_node, root );
|
|
}
|
|
|
|
/* This function must be entered WITH the playlist lock */
|
|
void PLModel::updateChildren( playlist_item_t *p_node, PLItem *root )
|
|
{
|
|
for( int i = 0; i < p_node->i_children ; i++ )
|
|
{
|
|
if( p_node->pp_children[i]->i_flags & PLAYLIST_DBL_FLAG ) continue;
|
|
PLItem *newItem = new PLItem( p_node->pp_children[i], root );
|
|
root->appendChild( newItem );
|
|
if( p_node->pp_children[i]->i_children != -1 )
|
|
updateChildren( p_node->pp_children[i], newItem );
|
|
}
|
|
}
|
|
|
|
/* Function doesn't need playlist-lock, as we don't touch playlist_item_t stuff here*/
|
|
void PLModel::updateTreeItem( PLItem *item )
|
|
{
|
|
if( !item ) return;
|
|
emit dataChanged( index( item, 0 ) , index( item, columnCount( QModelIndex() ) - 1 ) );
|
|
}
|
|
|
|
/************************* Actions ******************************/
|
|
|
|
/**
|
|
* Deletion, don't delete items childrens if item is going to be
|
|
* delete allready, so we remove childrens from selection-list.
|
|
*/
|
|
void PLModel::doDelete( QModelIndexList selected )
|
|
{
|
|
if( !canEdit() ) return;
|
|
|
|
while( !selected.isEmpty() )
|
|
{
|
|
QModelIndex index = selected[0];
|
|
selected.removeAt( 0 );
|
|
|
|
if( index.column() != 0 ) continue;
|
|
|
|
PLItem *item = getItem( index );
|
|
if( item->childCount() )
|
|
recurseDelete( item->children, &selected );
|
|
|
|
PL_LOCK;
|
|
playlist_DeleteFromInput( p_playlist, item->inputItem(), pl_Locked );
|
|
PL_UNLOCK;
|
|
|
|
removeItem( item );
|
|
}
|
|
}
|
|
|
|
void PLModel::recurseDelete( QList<AbstractPLItem*> children, QModelIndexList *fullList )
|
|
{
|
|
for( int i = children.count() - 1; i >= 0 ; i-- )
|
|
{
|
|
PLItem *item = static_cast<PLItem *>(children[i]);
|
|
if( item->childCount() )
|
|
recurseDelete( item->children, fullList );
|
|
fullList->removeAll( index( item, 0 ) );
|
|
}
|
|
}
|
|
|
|
/******* Volume III: Sorting and searching ********/
|
|
void PLModel::sort( const int column, Qt::SortOrder order )
|
|
{
|
|
sort( QModelIndex(), index( rootItem->id(), 0 ) , column, order );
|
|
}
|
|
|
|
void PLModel::sort( QModelIndex caller, QModelIndex rootIndex, const int column, Qt::SortOrder order )
|
|
{
|
|
msg_Dbg( p_intf, "Sorting by column %i, order %i", column, order );
|
|
|
|
int meta = columnToMeta( column );
|
|
if( meta == COLUMN_END ) return;
|
|
|
|
PLItem *item = ( rootIndex.isValid() ) ? getItem( rootIndex )
|
|
: rootItem;
|
|
if( !item ) return;
|
|
|
|
int i_root_id = item->id();
|
|
|
|
commitBufferedRowInserts();
|
|
|
|
QModelIndex qIndex = index( item, 0 );
|
|
int count = item->childCount();
|
|
if( count )
|
|
{
|
|
beginRemoveRows( qIndex, 0, count - 1 );
|
|
item->clearChildren();
|
|
endRemoveRows( );
|
|
}
|
|
|
|
PL_LOCK;
|
|
{
|
|
playlist_item_t *p_root = playlist_ItemGetById( p_playlist,
|
|
i_root_id );
|
|
if( p_root )
|
|
{
|
|
playlist_RecursiveNodeSort( p_playlist, p_root,
|
|
i_column_sorting( meta ),
|
|
order == Qt::AscendingOrder ?
|
|
ORDER_NORMAL : ORDER_REVERSE );
|
|
}
|
|
}
|
|
|
|
i_cached_id = i_cached_input_id = -1;
|
|
|
|
if( count )
|
|
{
|
|
beginInsertRows( qIndex, 0, count - 1 );
|
|
updateChildren( item );
|
|
endInsertRows( );
|
|
}
|
|
PL_UNLOCK;
|
|
/* if we have popup item, try to make sure that you keep that item visible */
|
|
if( caller.isValid() ) emit currentIndexChanged( caller );
|
|
|
|
else if( currentIndex().isValid() ) emit currentIndexChanged( currentIndex() );
|
|
}
|
|
|
|
void PLModel::search( const QString& search_text, const QModelIndex & idx, bool b_recursive )
|
|
{
|
|
latestSearch = search_text;
|
|
|
|
commitBufferedRowInserts();
|
|
|
|
/** \todo Fire the search with a small delay ? */
|
|
PL_LOCK;
|
|
{
|
|
playlist_item_t *p_root = playlist_ItemGetById( p_playlist,
|
|
itemId( idx ) );
|
|
assert( p_root );
|
|
playlist_LiveSearchUpdate( p_playlist, p_root, qtu( search_text ),
|
|
b_recursive );
|
|
if( idx.isValid() )
|
|
{
|
|
PLItem *searchRoot = getItem( idx );
|
|
|
|
beginRemoveRows( idx, 0, searchRoot->childCount() - 1 );
|
|
searchRoot->clearChildren();
|
|
endRemoveRows();
|
|
|
|
beginInsertRows( idx, 0, searchRoot->childCount() - 1 );
|
|
updateChildren( searchRoot ); // The PL_LOCK is needed here
|
|
endInsertRows();
|
|
|
|
PL_UNLOCK;
|
|
return;
|
|
}
|
|
}
|
|
PL_UNLOCK;
|
|
rebuild();
|
|
}
|
|
|
|
void PLModel::clearPlaylist()
|
|
{
|
|
if( rowCount() < 1 ) return;
|
|
|
|
QModelIndexList l;
|
|
for( int i = 0; i < rowCount(); i++)
|
|
{
|
|
QModelIndex indexrecord = index( i, 0, QModelIndex() );
|
|
l.append( indexrecord );
|
|
}
|
|
doDelete(l);
|
|
}
|
|
|
|
void PLModel::ensureArtRequested( const QModelIndex &index )
|
|
{
|
|
if ( index.isValid() && hasChildren( index ) )
|
|
{
|
|
int i_art_policy = var_GetInteger( p_playlist, "album-art" );
|
|
if ( i_art_policy != ALBUM_ART_ALL ) return;
|
|
int nbnodes = rowCount( index );
|
|
QModelIndex child;
|
|
for( int row = 0 ; row < nbnodes ; row++ )
|
|
{
|
|
child = index.child( row, 0 );
|
|
if ( child.isValid() && getArtUrl( child ).isEmpty() )
|
|
THEMIM->getIM()->requestArtUpdate( getItem( child )->inputItem() );
|
|
}
|
|
}
|
|
}
|
|
|
|
|
|
void PLModel::createNode( QModelIndex index, QString name )
|
|
{
|
|
if( name.isEmpty() || !index.isValid() ) return;
|
|
|
|
PL_LOCK;
|
|
index = index.parent();
|
|
if ( !index.isValid() ) index = rootIndex();
|
|
playlist_item_t *p_item = playlist_ItemGetById( p_playlist, itemId( index ) );
|
|
if( p_item )
|
|
playlist_NodeCreate( p_playlist, qtu( name ), p_item, PLAYLIST_END, 0, NULL );
|
|
PL_UNLOCK;
|
|
}
|
|
|
|
void PLModel::actionSlot( QAction *action )
|
|
{
|
|
QString name;
|
|
QStringList mrls;
|
|
QModelIndex index;
|
|
|
|
actionsContainerType a = action->data().value<actionsContainerType>();
|
|
switch ( a.action )
|
|
{
|
|
|
|
case actionsContainerType::ACTION_PLAY:
|
|
PL_LOCK;
|
|
{
|
|
if ( a.indexes.first().isValid() )
|
|
{
|
|
playlist_item_t *p_item = playlist_ItemGetById( p_playlist,
|
|
itemId( a.indexes.first() ) );
|
|
activateItem( p_item );
|
|
}
|
|
}
|
|
PL_UNLOCK;
|
|
break;
|
|
|
|
case actionsContainerType::ACTION_ADDTOPLAYLIST:
|
|
PL_LOCK;
|
|
foreach( QModelIndex currentIndex, a.indexes )
|
|
{
|
|
playlist_item_t *p_item = playlist_ItemGetById( THEPL, itemId( currentIndex ) );
|
|
if( !p_item ) continue;
|
|
|
|
playlist_NodeAddCopy( THEPL, p_item,
|
|
THEPL->p_playing,
|
|
PLAYLIST_END );
|
|
}
|
|
PL_UNLOCK;
|
|
break;
|
|
|
|
case actionsContainerType::ACTION_REMOVE:
|
|
doDelete( a.indexes );
|
|
break;
|
|
|
|
case actionsContainerType::ACTION_SORT:
|
|
index = a.indexes.first().parent();
|
|
if( !index.isValid() ) index = rootIndex();
|
|
sort( a.indexes.first(), index,
|
|
a.column > 0 ? a.column - 1 : -a.column - 1,
|
|
a.column > 0 ? Qt::AscendingOrder : Qt::DescendingOrder );
|
|
break;
|
|
|
|
}
|
|
}
|
|
|
|
/******************* Drag and Drop helper class ******************/
|
|
PlMimeData::~PlMimeData()
|
|
{
|
|
foreach( input_item_t *p_item, _inputItems )
|
|
vlc_gc_decref( p_item );
|
|
}
|
|
|
|
void PlMimeData::appendItem( input_item_t *p_item )
|
|
{
|
|
vlc_gc_incref( p_item );
|
|
_inputItems.append( p_item );
|
|
}
|
|
|
|
QList<input_item_t*> PlMimeData::inputItems() const
|
|
{
|
|
return _inputItems;
|
|
}
|
|
|
|
QStringList PlMimeData::formats () const
|
|
{
|
|
QStringList fmts;
|
|
fmts << "vlc/qt-input-items";
|
|
return fmts;
|
|
}
|
|
|