mirror of
https://github.com/RGBCube/serenity
synced 2025-05-22 10:55:07 +00:00
72b1998f0d
The partitioning code was very outdated, and required a full refactor. The new subsystem removes duplicated code and uses more AK containers. The most important change is that all implementations of the PartitionTable class conform to one interface, which made it possible to remove unnecessary code in the EBRPartitionTable class. Finding partitions is now done in the StorageManagement singleton, instead of doing so in init.cpp. Also, now we don't try to find partitions on demand - the kernel will try to detect if a StorageDevice is partitioned, and if so, will check what is the partition table, which could be MBR, GUID or EBR. Then, it will create DiskPartitionMetadata object for each partition that is available in the partition table. This object will be used by the partition enumeration code to create a DiskPartition with the correct minor number.
101 lines
3.9 KiB
C++
101 lines
3.9 KiB
C++
/*
|
|
* Copyright (c) 2020, Liav A. <liavalb@hotmail.co.il>
|
|
* All rights reserved.
|
|
*
|
|
* Redistribution and use in source and binary forms, with or without
|
|
* modification, are permitted provided that the following conditions are met:
|
|
*
|
|
* 1. Redistributions of source code must retain the above copyright notice, this
|
|
* list of conditions and the following disclaimer.
|
|
*
|
|
* 2. Redistributions in binary form must reproduce the above copyright notice,
|
|
* this list of conditions and the following disclaimer in the documentation
|
|
* and/or other materials provided with the distribution.
|
|
*
|
|
* THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS "AS IS"
|
|
* AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
|
|
* IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE ARE
|
|
* DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT HOLDER OR CONTRIBUTORS BE LIABLE
|
|
* FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
|
|
* DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR
|
|
* SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER
|
|
* CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY,
|
|
* OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE
|
|
* OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
|
|
*/
|
|
|
|
#include <AK/ByteBuffer.h>
|
|
#include <Kernel/Storage/Partition/EBRPartitionTable.h>
|
|
|
|
#ifndef EBR_DEBUG
|
|
# define EBR_DEBUG
|
|
#endif
|
|
|
|
namespace Kernel {
|
|
|
|
Result<NonnullOwnPtr<EBRPartitionTable>, PartitionTable::Error> EBRPartitionTable::try_to_initialize(const StorageDevice& device)
|
|
{
|
|
auto table = make<EBRPartitionTable>(device);
|
|
if (table->is_protective_mbr())
|
|
return { PartitionTable::Error::MBRProtective };
|
|
if (!table->is_valid())
|
|
return { PartitionTable::Error::Invalid };
|
|
return table;
|
|
}
|
|
|
|
void EBRPartitionTable::search_extended_partition(const StorageDevice& device, MBRPartitionTable& checked_ebr, u64 current_block_offset, size_t limit)
|
|
{
|
|
if (limit == 0)
|
|
return;
|
|
// EBRs should not carry more than 2 partitions (because they need to form a linked list)
|
|
ASSERT(checked_ebr.partitions_count() <= 2);
|
|
auto checked_logical_partition = checked_ebr.partition(0);
|
|
|
|
// If we are pointed to an invalid logical partition, something is seriously wrong.
|
|
ASSERT(checked_logical_partition.has_value());
|
|
m_partitions.append(checked_logical_partition.value().offset(current_block_offset));
|
|
if (!checked_ebr.contains_ebr())
|
|
return;
|
|
current_block_offset += checked_ebr.partition(1).value().start_block();
|
|
auto next_ebr = MBRPartitionTable::try_to_initialize(device, current_block_offset);
|
|
if (!next_ebr)
|
|
return;
|
|
search_extended_partition(device, *next_ebr, current_block_offset, (limit - 1));
|
|
}
|
|
|
|
EBRPartitionTable::EBRPartitionTable(const StorageDevice& device)
|
|
: MBRPartitionTable(device)
|
|
{
|
|
if (!is_header_valid())
|
|
return;
|
|
m_valid = true;
|
|
|
|
ASSERT(partitions_count() == 0);
|
|
|
|
auto& header = this->header();
|
|
for (size_t index = 0; index < 4; index++) {
|
|
auto& entry = header.entry[index];
|
|
// Start enumerating all logical partitions
|
|
if (entry.type == 0xf) {
|
|
auto checked_ebr = MBRPartitionTable::try_to_initialize(device, entry.offset);
|
|
if (!checked_ebr)
|
|
continue;
|
|
// It's quite unlikely to see that amount of partitions, so stop at 128 partitions.
|
|
search_extended_partition(device, *checked_ebr, entry.offset, 128);
|
|
continue;
|
|
}
|
|
|
|
if (entry.offset == 0x00) {
|
|
continue;
|
|
}
|
|
auto partition_type = ByteBuffer::create_zeroed(sizeof(u8));
|
|
partition_type.data()[0] = entry.type;
|
|
m_partitions.append(DiskPartitionMetadata({ entry.offset, (entry.offset + entry.length), partition_type }));
|
|
}
|
|
}
|
|
|
|
EBRPartitionTable::~EBRPartitionTable()
|
|
{
|
|
}
|
|
|
|
}
|