blob: 8301835c65e08e5e732181ea45f66bca12cbac03 (
plain)
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
|
/* === This file is part of Calamares - <https://github.com/calamares> ===
*
* Copyright 2014, Aurélien Gâteau <agateau@kde.org>
* Copyright 2015, Teo Mrnjavac <teo@kde.org>
* Copyright 2017, 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 "PartitionIterator.h"
// KPMcore
#include <kpmcore/core/device.h>
#include <kpmcore/core/partition.h>
#include <kpmcore/core/partitiontable.h>
PartitionIterator::PartitionIterator( PartitionTable* table )
: m_table( table )
{}
Partition*
PartitionIterator::operator*() const
{
return m_current;
}
void
PartitionIterator::operator++()
{
if ( !m_current )
return;
if ( m_current->hasChildren() )
{
// Go to the first child
m_current = static_cast< Partition* >( m_current->children().first() );
return;
}
PartitionNode* parent = m_current->parent();
Partition* successor = parent->successor( *m_current );
if ( successor )
{
// Go to the next sibling
m_current = successor;
return;
}
if ( parent->isRoot() )
{
// We reached the end
m_current = nullptr;
return;
}
// Try to go to the next sibling of our parent
PartitionNode* grandParent = parent->parent();
Q_ASSERT( grandParent );
// If parent is not root, then it's not a PartitionTable but a
// Partition, we can static_cast it.
m_current = grandParent->successor( *static_cast< Partition* >( parent ) );
}
bool
PartitionIterator::operator==( const PartitionIterator& other ) const
{
return m_table == other.m_table && m_current == other.m_current;
}
bool
PartitionIterator::operator!=( const PartitionIterator& other ) const
{
return ! ( *this == other );
}
PartitionIterator
PartitionIterator::begin( Device* device )
{
if ( !device )
return PartitionIterator( nullptr );
Q_ASSERT(device);
PartitionTable* table = device->partitionTable();
if ( !table )
return PartitionIterator( nullptr );
return PartitionIterator::begin( table );
}
PartitionIterator
PartitionIterator::begin( PartitionTable* table )
{
auto it = PartitionIterator( table );
QList< Partition* > children = table->children();
// Does not usually happen, but it did happen on a 10MB disk with an MBR
// partition table.
if ( children.isEmpty() )
return it;
it.m_current = children.first();
return it;
}
PartitionIterator
PartitionIterator::end( Device* device )
{
if ( !device )
return PartitionIterator( nullptr );
PartitionTable* table = device->partitionTable();
if ( !table )
return PartitionIterator( nullptr );
return PartitionIterator::end( table );
}
PartitionIterator
PartitionIterator::end( PartitionTable* table )
{
return PartitionIterator( table );
}
|
