0

我正在查看复制稀疏文件（到另一个稀疏文件）的代码，它用于DeviceIoControl(... FSCTL_QUERY_ALLOCATED_RANGES ...)获取包含实际数据的范围列表。

是否保证结果包含以下范围：

  • 不相交？

  • 按FileOffset字段排序？

  • 不是空的吗？

  • 有FileOffset + Length > FileOffset（即没有环绕wrt uint64_t）？

编辑：

我已经实施了验证，以防操作系统不提供任何这些保证：

// version of std::remove_if that permits coalescing
template<class ForwardIt, class BinaryPredicate>
ForwardIt coalesce_neighbors(ForwardIt first, ForwardIt last, BinaryPredicate p)
{
    for(ForwardIt i = first; i != last; ++i)
        if (!p(*first, *i))
        {
            if (first != i)
                *first = std::move(*i);
            ++first;
        }
    return first;
}


// for given range set do: sort by offset, check for validity, discard empty ones, coalesce intersecting/adjacent ones
FILE_ALLOCATED_RANGE_BUFFER* sanitize_ranges_(FILE_ALLOCATED_RANGE_BUFFER* p, FILE_ALLOCATED_RANGE_BUFFER* p_end)
{
    auto ui = [](LARGE_INTEGER const& v){ return static_cast<ULONGLONG>(v.QuadPart); };

    std::sort(p, p_end, [=](auto& l, auto& r){ return ui(l.FileOffset) < ui(r.FileOffset); });  // sort ranges by offset

    return coalesce_neighbors(p, p_end, [=](auto& l, auto& r){
        if (std::numeric_limits<ULONGLONG>::max() - ui(r.FileOffset) < ui(r.Length))            // no wraparounds allowed
            throw std::logic_error("invalid range (wraparound)");

        if (ui(r.Length) == 0) return true;                                                     // discard empty ranges

        if (&l != &r && ui(l.FileOffset) + ui(l.Length) >= ui(r.FileOffset))                    // 'l.offset <= r.offset' is guranteed due to sorting
        {
            l.Length.QuadPart = ui(r.FileOffset) + ui(r.Length) - ui(l.FileOffset);             // coalesce intersecting/adjacent ranges
            return true;                                                                        // ... and discard neighbor we ate
        }

        return false;
    });
}
4

0 回答 0