96 lines
2.7 KiB
C++
96 lines
2.7 KiB
C++
|
/* === This file is part of Calamares - <https://github.com/calamares> ===
|
||
|
|
*
|
||
|
|
* Copyright 2014, Aurélien Gâteau <agateau@kde.org>
|
||
|
|
* Copyright 2015-2016, Teo Mrnjavac <teo@kde.org>
|
||
|
|
* Copyright 2018-2019 Adriaan de Groot <groot@kde.org>
|
||
|
|
*
|
||
|
|
* Calamares 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.
|
||
|
|
*
|
||
|
|
* Calamares 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 Calamares. If not, see <http://www.gnu.org/licenses/>.
|
||
|
|
*/
|
||
|
|
|
||
|
|
#include "PartitionQuery.h"
|
||
|
|
|
||
|
|
#include "PartitionIterator.h"
|
||
|
|
|
||
|
|
#include <kpmcore/core/device.h>
|
||
|
|
#include <kpmcore/core/partition.h>
|
||
|
|
|
||
|
|
namespace CalamaresUtils
|
||
|
|
{
|
||
|
|
namespace Partition
|
||
|
|
{
|
||
|
|
|
||
|
|
// Types from KPMCore
|
||
|
|
using ::Device;
|
||
|
|
using ::Partition;
|
||
|
|
|
||
|
|
bool
|
||
|
|
isPartitionFreeSpace( Partition* partition )
|
||
|
|
{
|
||
|
|
return partition->roles().has( PartitionRole::Unallocated );
|
||
|
|
}
|
||
|
|
|
||
|
|
|
||
|
|
bool
|
||
|
|
isPartitionNew( Partition* partition )
|
||
|
|
{
|
||
|
|
#if defined( WITH_KPMCORE4API )
|
||
|
|
constexpr auto NewState = Partition::State::New;
|
||
|
|
#else
|
||
|
|
constexpr auto NewState = Partition::StateNew;
|
||
|
|
#endif
|
||
|
|
return partition->state() == NewState;
|
||
|
|
}
|
||
|
|
|
||
|
|
|
||
|
|
Partition*
|
||
|
|
findPartitionByCurrentMountPoint( const QList< Device* >& devices, const QString& mountPoint )
|
||
|
|
{
|
||
|
|
for ( auto device : devices )
|
||
|
|
for ( auto it = PartitionIterator::begin( device ); it != PartitionIterator::end( device ); ++it )
|
||
|
|
if ( (*it)->mountPoint() == mountPoint )
|
||
|
|
return *it;
|
||
|
|
return nullptr;
|
||
|
|
}
|
||
|
|
|
||
|
|
|
||
|
|
Partition*
|
||
|
|
findPartitionByPath( const QList< Device* >& devices, const QString& path )
|
||
|
|
{
|
||
|
|
if ( path.simplified().isEmpty() )
|
||
|
|
return nullptr;
|
||
|
|
|
||
|
|
for ( auto device : devices )
|
||
|
|
for ( auto it = PartitionIterator::begin( device ); it != PartitionIterator::end( device ); ++it )
|
||
|
|
if ( ( *it )->partitionPath() == path.simplified() )
|
||
|
|
return *it;
|
||
|
|
return nullptr;
|
||
|
|
}
|
||
|
|
|
||
|
|
|
||
|
|
QList< Partition* >
|
||
|
|
findPartitions( const QList< Device* >& devices,
|
||
|
|
std::function< bool ( Partition* ) > criterionFunction )
|
||
|
|
{
|
||
|
|
QList< Partition* > results;
|
||
|
|
for ( auto device : devices )
|
||
|
|
for ( auto it = PartitionIterator::begin( device ); it != PartitionIterator::end( device ); ++it )
|
||
|
|
if ( criterionFunction( *it ) )
|
||
|
|
results.append( *it );
|
||
|
|
return results;
|
||
|
|
}
|
||
|
|
|
||
|
|
|
||
|
|
}
|
||
|
|
} // namespace
|