diff options
Diffstat (limited to 'index.html')
| -rw-r--r-- | index.html | 393 |
1 files changed, 212 insertions, 181 deletions
@@ -1,9 +1,9 @@ -<!DOCTYPE html PUBLIC "-//W3C//DTD XHTML 1.0 Transitional//EN" "http://www.w3.org/TR/xhtml1/DTD/xhtml1-transitional.dtd"> +<!DOCTYPE html PUBLIC "-//W3C//DTD XHTML 1.0 Transitional//EN" "https://www.w3.org/TR/xhtml1/DTD/xhtml1-transitional.dtd"> <html xmlns="http://www.w3.org/1999/xhtml"> <head> <meta http-equiv="Content-Type" content="text/xhtml;charset=UTF-8"/> <meta http-equiv="X-UA-Compatible" content="IE=9"/> -<meta name="generator" content="Doxygen 1.8.13"/> +<meta name="generator" content="Doxygen 1.8.17"/> <meta name="viewport" content="width=device-width, initial-scale=1"/> <title>LLFIO: Main Page</title> <link href="tabs.css" rel="stylesheet" type="text/css"/> @@ -13,9 +13,6 @@ <script type="text/javascript" src="resize.js"></script> <script type="text/javascript" src="navtreedata.js"></script> <script type="text/javascript" src="navtree.js"></script> -<script type="text/javascript"> - $(document).ready(initResizable); -</script> <link href="search/search.css" rel="stylesheet" type="text/css"/> <script type="text/javascript" src="search/searchdata.js"></script> <script type="text/javascript" src="search/search.js"></script> @@ -29,7 +26,7 @@ <tr style="height: 56px;"> <td id="projectalign" style="padding-left: 0.5em;"> <div id="projectname">LLFIO -  <span id="projectnumber">v2.00 late alpha</span> +  <span id="projectnumber">v2.00 late beta</span> </div> </td> </tr> @@ -37,18 +34,21 @@ </table> </div> <!-- end header part --> -<!-- Generated by Doxygen 1.8.13 --> +<!-- Generated by Doxygen 1.8.17 --> <script type="text/javascript"> +/* @license magnet:?xt=urn:btih:cf05388f2679ee054f2beb29a391d25f4e673ac3&dn=gpl-2.0.txt GPL-v2 */ var searchBox = new SearchBox("searchBox", "search",false,'Search'); +/* @license-end */ </script> <script type="text/javascript" src="menudata.js"></script> <script type="text/javascript" src="menu.js"></script> <script type="text/javascript"> +/* @license magnet:?xt=urn:btih:cf05388f2679ee054f2beb29a391d25f4e673ac3&dn=gpl-2.0.txt GPL-v2 */ $(function() { initMenu('',true,false,'search.php','Search'); $(document).ready(function() { init_search(); }); }); -</script> +/* @license-end */</script> <div id="main-nav"></div> </div><!-- top --> <div id="side-nav" class="ui-resizable side-nav-resizable"> @@ -62,7 +62,9 @@ $(function() { </div> </div> <script type="text/javascript"> -$(document).ready(function(){initNavTree('index.html','');}); +/* @license magnet:?xt=urn:btih:cf05388f2679ee054f2beb29a391d25f4e673ac3&dn=gpl-2.0.txt GPL-v2 */ +$(document).ready(function(){initNavTree('index.html',''); initResizable(); }); +/* @license-end */ </script> <div id="doc-content"> <!-- window showing the filter options --> @@ -79,32 +81,38 @@ $(document).ready(function(){initNavTree('index.html','');}); </iframe> </div> -<div class="header"> +<div class="PageDoc"><div class="header"> <div class="headertitle"> <div class="title">LLFIO Documentation</div> </div> </div><!--header--> <div class="contents"> <div class="textblock"><center><table border="0" cellpadding="4"> <tr> -<td align="center"><a href="https://github.com/ned14/llfio">LLFIO</a><br /> -<a href="https://github.com/ned14/llfio">on GitHub</a> </td><td align="center"><a href="http://my.cdash.org/index.php?project=Boost.AFIO">CTest summary</a><br /> -<a href="http://my.cdash.org/index.php?project=Boost.AFIO">dashboard</a> </td><td align="center"><a href="https://travis-ci.org/ned14/llfio">Linux and MacOS CI:</a><div class="image"> -<img src="https://travis-ci.org/ned14/llfio.svg?branch=master"/> -</div> - </td><td align="center"><a href="https://ci.appveyor.com/project/ned14/llfio/branch/master">Windows CI:</a><div class="image"> -<img src="https://ci.appveyor.com/api/projects/status/dfctqfap3kpx89om/branch/master?svg=true"/> -</div> - </td><td align="center"><a href="https://dedi5.nedprod.com/static/files/llfio-v2.0-source-latest.tar.xz">Latest stable</a><br /> -<a href="https://dedi5.nedprod.com/static/files/llfio-v2.0-source-latest.tar.xz">sources</a> </td><td align="center"><a href="https://dedi5.nedprod.com/static/files/llfio-v2.0-binaries-linux64-latest.tgz">Latest stable</a><br /> -<a href="https://dedi5.nedprod.com/static/files/llfio-v2.0-binaries-linux64-latest.tgz">Ubuntu 18.04 x64 prebuilt</a> </td><td align="center"></td><td align="center"><a href="https://dedi5.nedprod.com/static/files/llfio-v2.0-binaries-win64-latest.zip">Latest stable</a><br /> -<a href="https://dedi5.nedprod.com/static/files/llfio-v2.0-binaries-win64-latest.zip">VS2017 x64 prebuilt</a> </td></tr> +<td align="center"><a href="https://github.com/ned14/llfio">LLFIO</a><br /> +<a href="https://github.com/ned14/llfio">on GitHub</a> </td><td align="center"><a href="https://my.cdash.org/index.php?project=Boost.AFIO">CTest summary</a><br /> +<a href="https://my.cdash.org/index.php?project=Boost.AFIO">dashboard</a> </td><td align="center"><a href="https://github.com/ned14/llfio/actions?query=workflow%3A%22Unit+tests+Linux%22">Linux CI:</a><object type="image/svg+xml" data="https://github.com/ned14/llfio/workflows/Unit%20tests%20Linux/badge.svg?branch=master" style="pointer-events: none;"></object> </td><td align="center"><a href="https://github.com/ned14/llfio/actions?query=workflow%3A%22Unit+tests+Mac+OS%22">Mac OS CI:</a><object type="image/svg+xml" data="https://github.com/ned14/llfio/workflows/Unit%20tests%20Mac%20OS/badge.svg?branch=master" style="pointer-events: none;"></object> </td><td align="center"><a href="https://github.com/ned14/llfio/actions?query=workflow%3A%22Unit+tests+Windows%22">Windows CI:</a><object type="image/svg+xml" data="https://github.com/ned14/llfio/workflows/Unit%20tests%20Windows/badge.svg?branch=master" style="pointer-events: none;"></object> </td><td align="center"><a href="https://github.com/ned14/llfio/releases">Prebuilt binaries</a> </td></tr> </table> -</center><p>Herein lies my proposed zero whole machine memory copy async file i/o and filesystem library for Boost and the C++ standard, intended for storage devices with ~1 microsecond 4Kb transfer latencies and those supporting Storage Class Memory (SCM)/Direct Access Storage (DAX). Its i/o overhead, including syscall overhead, has been benchmarked to 100 nanoseconds on Linux which corresponds to a theoretical maximum of 10M IOPS @ QD1, approx 40Gb/sec per thread. It has particularly strong support for writing portable filesystem algorithms which work well with directly mapped non-volatile storage such as Intel Optane.</p> +</center><p>Herein lies my proposed zero whole machine memory copy async file i/o and filesystem library for the C++ standard, intended for storage devices with ~1 microsecond 4Kb transfer latencies and those supporting Storage Class Memory (SCM)/Direct Access Storage (DAX). Its i/o overhead, including syscall overhead, has been benchmarked to 100 nanoseconds on Linux which corresponds to a theoretical maximum of 10M IOPS @ QD1, approx 40Gb/sec per thread. It has particularly strong support for writing portable filesystem algorithms which work well with directly mapped non-volatile storage such as Intel Optane.</p> <p>It is a complete rewrite after a Boost peer review in August 2015. Its github source code repository lives at <a href="https://github.com/ned14/llfio">https://github.com/ned14/llfio</a>.</p> <ul> -<li>Portable to any conforming C++ 14 compiler with a working Filesystem TS in its STL.</li> -<li>Will make use of any Concepts TS if you have them.</li> -<li>Provides view adapters into the Ranges TS, so ready for STL2.</li> +<li>LLFIO is the reference implementation for these C++ standardisations:<ul> +<li><code>llfio::path_view</code> is expected to enter the C++ 23 standard.</li> +<li><code>llfio::file_handle</code> and <code>llfio::mapped_file_handle</code> are on track for entering the C++ 23 standard.</li> +</ul> +</li> +<li>Portable to any conforming C++ 14 compiler with a working Filesystem TS in its STL.<ul> +<li>Note that VS2019 16.3 and libc++ 11 dropped support for Filesystem in C++ 14, so for those LLFIO's cmake forces on C++ 17.</li> +</ul> +</li> +<li>Fully clean with C++ 20.<ul> +<li>Will make use of any Coroutines, Concepts, Span, Byte etc if you have them, otherwise swaps in C++ 14 compatible alternatives.</li> +<li>NOTE that Ubuntu 18.04's libstdc++ 9 does not currently provide symbols for <code><codecvt></code> if you are building in C++ 20, so linking LLFIO programs on libstdc++ on that Linux if in C++ 20 will fail. Either use a different STL, manually rebuild libstdc++, or use C++ 17.</li> +</ul> +</li> +<li>Aims to support Microsoft Windows, Linux, Android, iOS, Mac OS and FreeBSD.<ul> +<li>Best effort to support older kernels up to their EOL (as of July 2020: >= Windows 8.1, >= Linux 2.6.32 (RHEL EOL), >= Mac OS 10.13, >= FreeBSD 11).</li> +</ul> +</li> <li>Original error code is always preserved, even down to the original NT kernel error code if a NT kernel API was used.<ul> <li>Optional configuration based on <a href="https://wg21.link/P1028">P1028</a> <em>SG14 status_code and standard error object for P0709 Zero-overhead deterministic exceptions</em>.</li> </ul> @@ -112,30 +120,44 @@ $(document).ready(function(){initNavTree('index.html','');}); <li>Race free filesystem design used throughout (i.e. no TOCTOU).</li> <li>Zero malloc, zero exception throw and zero whole system memory copy design used throughout, even down to paths (which can hit 64Kb!).</li> <li>Comprehensive support for virtual and mapped memory of both SCM/DAX and page cached storage, including large, huge and super pages.</li> -<li>Works very well with the C++ standard library, and is being proposed for standardisation into C++. See <a href="https://wg21.link/P1031">P1031 <em>Low level file i/o</em></a>.</li> -<li><code>async_file_handle</code> supports <code>co_await</code> (Coroutines TS).</li> </ul> -<dl class="section note"><dt>Note</dt><dd>Note that this code is of late alpha quality. It's quite reliable on Windows and Linux, but be careful when using it!</dd></dl> +<dl class="section note"><dt>Note</dt><dd>Most of this code is of early mature quality. It has been shipping in production with multiple vendors for some years now, indeed amongst many big data solutions it powers the low level custom database component of the US Security and Exchange Commission's MIDAS solution which ingresses Terabytes of trade data per day. It is quite reliable on Windows and Linux (less well tested on Mac OS), so be careful when using it!</dd></dl> <p>Examples of use: </p><table width="100%" border="0" cellpadding="4"> <tr> -<td width="50%" valign="top"><div class="fragment"><div class="line"> <span class="keyword">namespace </span><a class="code" href="namespacellfio__v2__xxx.html">llfio</a> = <a class="code" href="group__config.html#gac9f7f0153adb9034d26c4554728f817a">LLFIO_V2_NAMESPACE</a>;</div><div class="line"></div><div class="line"> <span class="comment">// Make me a 1 trillion element sparsely allocated integer array!</span></div><div class="line"> <a class="code" href="classllfio__v2__xxx_1_1mapped__file__handle.html">llfio::mapped_file_handle</a> mfh = <a class="code" href="namespacellfio__v2__xxx.html#a58d5390cad390de24a80748c8cd7dc5b">llfio::mapped_temp_inode</a>().value();</div><div class="line"></div><div class="line"> <span class="comment">// On an extents based filing system, doesn't actually allocate any physical</span></div><div class="line"> <span class="comment">// storage but does map approximately 4Tb of all bits zero data into memory</span></div><div class="line"> (void) mfh.<a class="code" href="classllfio__v2__xxx_1_1mapped__file__handle.html#a01a5da3834fd354c5c3d38284b84ef75">truncate</a>(1000000000000ULL * <span class="keyword">sizeof</span>(<span class="keywordtype">int</span>));</div><div class="line"></div><div class="line"> <span class="comment">// Create a typed view of the one trillion integers</span></div><div class="line"> llfio::attached<int> one_trillion_int_array(mfh);</div><div class="line"></div><div class="line"> <span class="comment">// Write and read as you see fit, if you exceed physical RAM it'll be paged out</span></div><div class="line"> one_trillion_int_array[0] = 5;</div><div class="line"> one_trillion_int_array[999999999999ULL] = 6;</div></div><!-- fragment --> </td><td width="50%" valign="top"><div class="fragment"><div class="line"> <span class="keyword">namespace </span><a class="code" href="namespacellfio__v2__xxx.html">llfio</a> = <a class="code" href="group__config.html#gac9f7f0153adb9034d26c4554728f817a">LLFIO_V2_NAMESPACE</a>;</div><div class="line"></div><div class="line"> <span class="comment">// Create an asynchronous file handle</span></div><div class="line"> <a class="code" href="classllfio__v2__xxx_1_1io__service.html">llfio::io_service</a> service;</div><div class="line"> <a class="code" href="classllfio__v2__xxx_1_1async__file__handle.html">llfio::async_file_handle</a> fh =</div><div class="line"> <a class="code" href="namespacellfio__v2__xxx.html#ab8bf2fda0abbb11fdeb77d25f8288149">llfio::async_file</a>(service, {}, <span class="stringliteral">"testfile.txt"</span>,</div><div class="line"> <a class="code" href="namespacellfio__v2__xxx.html#a5a8908704c9988bbecc69c2359e6fd4a">llfio::async_file_handle::mode::write</a>,</div><div class="line"> llfio::async_file_handle::creation::if_needed).value();</div><div class="line"></div><div class="line"> <span class="comment">// Resize it to 1024 bytes</span></div><div class="line"> <a class="code" href="namespacellfio__v2__xxx.html#a16ee1bea5a5791ecde266420e00fba81">truncate</a>(fh, 1024).value();</div><div class="line"></div><div class="line"> <span class="comment">// Begin to asynchronously write "hello world" into the file at offset 0,</span></div><div class="line"> <span class="comment">// suspending execution of this coroutine until completion and then resuming</span></div><div class="line"> <span class="comment">// execution. Requires the Coroutines TS.</span></div><div class="line"> <span class="keyword">alignas</span>(4096) <span class="keywordtype">char</span> buffer[] = <span class="stringliteral">"hello world"</span>;</div><div class="line"> co_await <a class="code" href="namespacellfio__v2__xxx.html#a1bf4f597e8b391870215cbe005c252e6">co_write</a>(fh, 0, { { <span class="keyword">reinterpret_cast<</span>llfio::byte *<span class="keyword">></span>(buffer), <span class="keyword">sizeof</span>(buffer) } }).value();</div></div><!-- fragment --> </td></tr> +<td width="50%" valign="top"><div class="fragment"><div class="line"> <span class="keyword">namespace </span><a class="code" href="namespacellfio__v2__xxx.html">llfio</a> = <a class="code" href="group__config.html#gac9f7f0153adb9034d26c4554728f817a">LLFIO_V2_NAMESPACE</a>;</div> +<div class="line"> </div> +<div class="line"> <span class="comment">// Make me a 1 trillion element sparsely allocated integer array!</span></div> +<div class="line"> <a class="code" href="classllfio__v2__xxx_1_1mapped__file__handle.html">llfio::mapped_file_handle</a> mfh = <a class="code" href="namespacellfio__v2__xxx.html#a58d5390cad390de24a80748c8cd7dc5b">llfio::mapped_temp_inode</a>().value();</div> +<div class="line"> </div> +<div class="line"> <span class="comment">// On an extents based filing system, doesn't actually allocate any physical</span></div> +<div class="line"> <span class="comment">// storage but does map approximately 4Tb of all bits zero data into memory</span></div> +<div class="line"> (void) mfh.<a class="code" href="classllfio__v2__xxx_1_1mapped__file__handle.html#a01a5da3834fd354c5c3d38284b84ef75">truncate</a>(1000000000000ULL * <span class="keyword">sizeof</span>(<span class="keywordtype">int</span>));</div> +<div class="line"> </div> +<div class="line"> <span class="comment">// Create a typed view of the one trillion integers</span></div> +<div class="line"> llfio::attached<int> one_trillion_int_array(mfh);</div> +<div class="line"> </div> +<div class="line"> <span class="comment">// Write and read as you see fit, if you exceed physical RAM it'll be paged out</span></div> +<div class="line"> one_trillion_int_array[0] = 5;</div> +<div class="line"> one_trillion_int_array[999999999999ULL] = 6;</div> +</div><!-- fragment --> </td><td width="50%" valign="top"><div class="fragment"></div><!-- fragment --> </td></tr> </table> <p>See <a href="https://github.com/ned14/llfio/blob/master/programs/fs-probe/fs_probe_results.yaml">https://github.com/ned14/llfio/blob/master/programs/fs-probe/fs_probe_results.yaml</a> for a database of latencies for various previously tested OS, filing systems and storage devices.</p> <p>Todo list for already implemented parts: <a href="https://ned14.github.io/llfio/todo.html">https://ned14.github.io/llfio/todo.html</a></p> <p> </p> <center><span style="font-size: large; text-decoration: underline;"><a class="el" href="md__build.html">Build instructions can found here</a></span></center> <p> </p> -<h2>v2 architecture and design implemented:</h2> -<table class="doxtable"> -<tr> -<th>NEW in v2 </th><th>Boost peer review feedback </th><th></th></tr> -<tr> -<td>✔ </td><td>✔ </td><td>Universal native handle/fd abstraction instead of <code>void *</code>. </td></tr> -<tr> -<td>✔ </td><td>✔ </td><td>Perfectly/Ideally low memory (de)allocation per op (usually none). </td></tr> -<tr> -<td>✔ </td><td>✔ </td><td>noexcept API throughout returning error_code for failure instead of throwing exceptions. </td></tr> -<tr> -<td>✔ </td><td>✔ </td><td>LLFIO v1 handle type split into hierarchy of types:<ol> +<h2><a class="anchor" id="autotoc_md18"></a> +v2 architecture and design implemented:</h2> +<table class="markdownTable"> +<tr class="markdownTableHead"> +<th class="markdownTableHeadNone">NEW in v2 </th><th class="markdownTableHeadNone">Boost peer review feedback </th><th class="markdownTableHeadNone"></th></tr> +<tr class="markdownTableRowOdd"> +<td class="markdownTableBodyNone">✔ </td><td class="markdownTableBodyNone">✔ </td><td class="markdownTableBodyNone">Universal native handle/fd abstraction instead of <code>void *</code>. </td></tr> +<tr class="markdownTableRowEven"> +<td class="markdownTableBodyNone">✔ </td><td class="markdownTableBodyNone">✔ </td><td class="markdownTableBodyNone">Perfectly/Ideally low memory (de)allocation per op (usually none). </td></tr> +<tr class="markdownTableRowOdd"> +<td class="markdownTableBodyNone">✔ </td><td class="markdownTableBodyNone">✔ </td><td class="markdownTableBodyNone">noexcept API throughout returning error_code for failure instead of throwing exceptions. </td></tr> +<tr class="markdownTableRowEven"> +<td class="markdownTableBodyNone">✔ </td><td class="markdownTableBodyNone">✔ </td><td class="markdownTableBodyNone">LLFIO v1 handle type split into hierarchy of types:<ol> <li> handle - provides open, close, get path, clone, set/unset append only, change caching, characteristics</li> <li> @@ -149,150 +171,153 @@ io_handle - adds synchronous scatter-gather i/o, byte range locking</li> <li> file_handle - adds open/create file, get and set maximum extent</li> <li> -async_file_handle - adds asynchronous scatter-gather i/o</li> -<li> mapped_file_handle - adds low latency memory mapped scatter-gather i/o</li> </ol> </td></tr> -<tr> -<td>✔ </td><td>✔ </td><td>Cancelable i/o (made possible thanks to dropping XP support). </td></tr> -<tr> -<td>✔ </td><td>✔ </td><td>All shared_ptr usage removed as all use of multiple threads removed. </td></tr> -<tr> -<td>✔ </td><td>✔ </td><td>Use of std::vector to transport scatter-gather sequences replaced with C++ 20 <code>span<></code> borrowed views. </td></tr> -<tr> -<td>✔ </td><td>✔ </td><td>Completion callbacks are now some arbitrary type <code>U&&</code> instead of a future continuation. Type erasure for its storage is bound into the one single memory allocation for everything needed to execute the op, and so therefore overhead is optimal. </td></tr> -<tr> -<td>✔ </td><td>✔ </td><td>Filing system algorithms made generic and broken out into public <code>llfio::algorithms</code> template library (the LLFIO FTL). </td></tr> -<tr> -<td>✔ </td><td>✔ </td><td>Abstraction of native handle management via bitfield specified "characteristics". </td></tr> -<tr> -<td>✔ </td><td></td><td>Storage profiles, a YAML database of behaviours of hardware, OS and filing system combinations. </td></tr> -<tr> -<td>✔ </td><td></td><td>Absolute and interval deadline timed i/o throughout (made possible thanks to dropping XP support). </td></tr> -<tr> -<td>✔ </td><td></td><td>Dependency on ASIO/Networking TS removed completely. </td></tr> -<tr> -<td>✔ </td><td></td><td>Four choices of algorithm implementing a shared filing system mutex. </td></tr> -<tr> -<td>✔ </td><td></td><td>Uses CMake, CTest, CDash and CPack with automatic usage of C++ Modules or precompiled headers where available. </td></tr> -<tr> -<td>✔ </td><td></td><td>Far more comprehensive memory map and virtual memory facilities. </td></tr> -<tr> -<td>✔ </td><td></td><td>Much more granular, micro level unit testing of individual functions. </td></tr> -<tr> -<td>✔ </td><td></td><td>Much more granular, micro level internal logging of every code path taken. </td></tr> -<tr> -<td>✔ </td><td></td><td>Path views used throughout, thus avoiding string copying and allocation in <code>std::filesystem::path</code>. </td></tr> -<tr> -<td>✔ </td><td></td><td>Paths are equally interpreted as UTF-8 on all platforms. </td></tr> -<tr> -<td>✔ </td><td></td><td>We never store nor retain a path, as they are inherently racy and are best avoided. </td></tr> -<tr> -<td>✔ </td><td>✔ </td><td>Parent handle caching is hard coded in, it is now an optional user applied templated adapter class. </td></tr> +<tr class="markdownTableRowOdd"> +<td class="markdownTableBodyNone">✔ </td><td class="markdownTableBodyNone">✔ </td><td class="markdownTableBodyNone">Cancelable i/o (made possible thanks to dropping XP support). </td></tr> +<tr class="markdownTableRowEven"> +<td class="markdownTableBodyNone">✔ </td><td class="markdownTableBodyNone">✔ </td><td class="markdownTableBodyNone">All shared_ptr usage removed as all use of multiple threads removed. </td></tr> +<tr class="markdownTableRowOdd"> +<td class="markdownTableBodyNone">✔ </td><td class="markdownTableBodyNone">✔ </td><td class="markdownTableBodyNone">Use of std::vector to transport scatter-gather sequences replaced with C++ 20 <code>span<></code> borrowed views. </td></tr> +<tr class="markdownTableRowEven"> +<td class="markdownTableBodyNone">✔ </td><td class="markdownTableBodyNone">✔ </td><td class="markdownTableBodyNone">Completion callbacks are now some arbitrary type <code>U&&</code> instead of a future continuation. Type erasure for its storage is bound into the one single memory allocation for everything needed to execute the op, and so therefore overhead is optimal. </td></tr> +<tr class="markdownTableRowOdd"> +<td class="markdownTableBodyNone">✔ </td><td class="markdownTableBodyNone">✔ </td><td class="markdownTableBodyNone">Filing system algorithms made generic and broken out into public <code>llfio::algorithms</code> template library (the LLFIO FTL). </td></tr> +<tr class="markdownTableRowEven"> +<td class="markdownTableBodyNone">✔ </td><td class="markdownTableBodyNone">✔ </td><td class="markdownTableBodyNone">Abstraction of native handle management via bitfield specified "characteristics". </td></tr> +<tr class="markdownTableRowOdd"> +<td class="markdownTableBodyNone">✔ </td><td class="markdownTableBodyNone"></td><td class="markdownTableBodyNone">Storage profiles, a YAML database of behaviours of hardware, OS and filing system combinations. </td></tr> +<tr class="markdownTableRowEven"> +<td class="markdownTableBodyNone">✔ </td><td class="markdownTableBodyNone"></td><td class="markdownTableBodyNone">Absolute and interval deadline timed i/o throughout (made possible thanks to dropping XP support). </td></tr> +<tr class="markdownTableRowOdd"> +<td class="markdownTableBodyNone">✔ </td><td class="markdownTableBodyNone"></td><td class="markdownTableBodyNone">Dependency on ASIO/Networking TS removed completely. </td></tr> +<tr class="markdownTableRowEven"> +<td class="markdownTableBodyNone">✔ </td><td class="markdownTableBodyNone"></td><td class="markdownTableBodyNone">Four choices of algorithm implementing a shared filing system mutex. </td></tr> +<tr class="markdownTableRowOdd"> +<td class="markdownTableBodyNone">✔ </td><td class="markdownTableBodyNone"></td><td class="markdownTableBodyNone">Uses CMake, CTest, CDash and CPack with automatic usage of C++ Modules or precompiled headers where available. </td></tr> +<tr class="markdownTableRowEven"> +<td class="markdownTableBodyNone">✔ </td><td class="markdownTableBodyNone"></td><td class="markdownTableBodyNone">Far more comprehensive memory map and virtual memory facilities. </td></tr> +<tr class="markdownTableRowOdd"> +<td class="markdownTableBodyNone">✔ </td><td class="markdownTableBodyNone"></td><td class="markdownTableBodyNone">Much more granular, micro level unit testing of individual functions. </td></tr> +<tr class="markdownTableRowEven"> +<td class="markdownTableBodyNone">✔ </td><td class="markdownTableBodyNone"></td><td class="markdownTableBodyNone">Much more granular, micro level internal logging of every code path taken. </td></tr> +<tr class="markdownTableRowOdd"> +<td class="markdownTableBodyNone">✔ </td><td class="markdownTableBodyNone"></td><td class="markdownTableBodyNone">Path views used throughout, thus avoiding string copying and allocation in <code>std::filesystem::path</code>. </td></tr> +<tr class="markdownTableRowEven"> +<td class="markdownTableBodyNone">✔ </td><td class="markdownTableBodyNone"></td><td class="markdownTableBodyNone">Paths are equally interpreted as UTF-8 on all platforms. </td></tr> +<tr class="markdownTableRowOdd"> +<td class="markdownTableBodyNone">✔ </td><td class="markdownTableBodyNone"></td><td class="markdownTableBodyNone">We never store nor retain a path, as they are inherently racy and are best avoided. </td></tr> +<tr class="markdownTableRowEven"> +<td class="markdownTableBodyNone">✔ </td><td class="markdownTableBodyNone">✔ </td><td class="markdownTableBodyNone">Parent handle caching is hard coded in, it is now an optional user applied templated adapter class. </td></tr> </table> <p>Todo:</p> -<table class="doxtable"> -<tr> -<th>NEW in v2 </th><th>Boost peer review feedback </th><th></th></tr> -<tr> -<td>✔ </td><td></td><td>clang AST assisted SWIG bindings for other languages. </td></tr> -<tr> -<td>✔ </td><td></td><td>Statistical tracking of operation latencies so realtime IOPS can be measured. </td></tr> +<table class="markdownTable"> +<tr class="markdownTableHead"> +<th class="markdownTableHeadNone">NEW in v2 </th><th class="markdownTableHeadNone">Boost peer review feedback </th><th class="markdownTableHeadNone"></th></tr> +<tr class="markdownTableRowOdd"> +<td class="markdownTableBodyNone">✔ </td><td class="markdownTableBodyNone"></td><td class="markdownTableBodyNone">clang AST assisted SWIG bindings for other languages. </td></tr> +<tr class="markdownTableRowEven"> +<td class="markdownTableBodyNone">✔ </td><td class="markdownTableBodyNone"></td><td class="markdownTableBodyNone">Statistical tracking of operation latencies so realtime IOPS can be measured. </td></tr> </table> -<h2>Planned features implemented:</h2> -<table class="doxtable"> -<tr> -<th>NEW in v2 </th><th>Windows </th><th>POSIX </th><th></th></tr> -<tr> -<td>✔ </td><td>✔ </td><td>✔ </td><td>Native handle cloning. </td></tr> -<tr> -<td>✔ (up from four) </td><td>✔ </td><td>✔ </td><td>Maximum possible (seven) forms of kernel caching. </td></tr> -<tr> -<td></td><td>✔ </td><td>✔ </td><td>Absolute path open. </td></tr> -<tr> -<td></td><td>✔ </td><td>✔ </td><td>Relative "anchored" path open enabling race free file system. </td></tr> -<tr> -<td>✔ </td><td>✔ </td><td></td><td>Win32 path support (260 path limit). </td></tr> -<tr> -<td></td><td>✔ </td><td></td><td>NT kernel path support (32,768 path limit). </td></tr> -<tr> -<td>✔ </td><td>✔ </td><td>✔ </td><td>Synchronous universal scatter-gather i/o. </td></tr> -<tr> -<td>✔ (POSIX AIO support) </td><td>✔ </td><td>✔ </td><td>Asynchronous universal scatter-gather i/o. </td></tr> -<tr> -<td>✔ </td><td>✔ </td><td>✔ </td><td>i/o deadlines and cancellation. </td></tr> -<tr> -<td></td><td>✔ </td><td>✔ </td><td>Retrieving and setting the current maximum extent (size) of an open file. </td></tr> -<tr> -<td></td><td>✔ </td><td>✔ </td><td>Retrieving the current path of an open file irrespective of where it has been renamed to by third parties. </td></tr> -<tr> -<td></td><td>✔ </td><td>✔ </td><td>statfs_t ported over from LLFIO v1. </td></tr> -<tr> -<td></td><td>✔ </td><td>✔ </td><td>utils namespace ported over from LLFIO v1. </td></tr> -<tr> -<td>✔ </td><td>✔ </td><td>✔ </td><td><code>shared_fs_mutex</code> shared/exclusive entities locking based on lock files </td></tr> -<tr> -<td>✔ </td><td>✔ </td><td>✔ </td><td>Byte range shared/exclusive locking. </td></tr> -<tr> -<td>✔ </td><td>✔ </td><td>✔ </td><td><code>shared_fs_mutex</code> shared/exclusive entities locking based on byte ranges </td></tr> -<tr> -<td>✔ </td><td>✔ </td><td>✔ </td><td><code>shared_fs_mutex</code> shared/exclusive entities locking based on atomic append </td></tr> -<tr> -<td></td><td>✔ </td><td>✔ </td><td>Memory mapped files and virtual memory management (<code>section_handle</code>, <code>map_handle</code> and <code>mapped_file_handle</code>) </td></tr> -<tr> -<td>✔ </td><td>✔ </td><td>✔ </td><td><code>shared_fs_mutex</code> shared/exclusive entities locking based on memory maps </td></tr> -<tr> -<td>✔ </td><td>✔ </td><td>✔ </td><td>Universal portable UTF-8 path views. </td></tr> -<tr> -<td></td><td>✔ </td><td>✔ </td><td>"Hole punching" and hole enumeration ported over from LLFIO v1. </td></tr> -<tr> -<td></td><td>✔ </td><td>✔ </td><td>Directory handles and very fast directory enumeration ported over from LLFIO v1. </td></tr> -<tr> -<td>✔ </td><td>✔ </td><td>✔ </td><td><code>shared_fs_mutex</code> shared/exclusive entities locking based on safe byte ranges </td></tr> -<tr> -<td></td><td>✔ </td><td>✔ </td><td>Set random or sequential i/o (prefetch). </td></tr> -<tr> -<td>✔ </td><td>✔ </td><td>✔ </td><td>i/o on <code>async_file_handle</code> is coroutines awaitable. </td></tr> -<tr> -<td>✔ </td><td>✔ </td><td>✔ </td><td><code>llfio::algorithm::trivial_vector<T></code> with constant time reallocation if <code>T</code> is trivially copyable. </td></tr> -<tr> -<td></td><td>✔ </td><td>✔ </td><td><code>symlink_handle</code>. </td></tr> -<tr> -<td>✔ </td><td>✔ </td><td>✔ </td><td>Large, huge and massive page size support for memory allocation and (POSIX only) file maps. </td></tr> +<h2><a class="anchor" id="autotoc_md19"></a> +Planned features implemented:</h2> +<table class="markdownTable"> +<tr class="markdownTableHead"> +<th class="markdownTableHeadNone">NEW in v2 </th><th class="markdownTableHeadNone">Windows </th><th class="markdownTableHeadNone">POSIX </th><th class="markdownTableHeadNone"></th></tr> +<tr class="markdownTableRowOdd"> +<td class="markdownTableBodyNone">✔ </td><td class="markdownTableBodyNone">✔ </td><td class="markdownTableBodyNone">✔ </td><td class="markdownTableBodyNone">Native handle cloning. </td></tr> +<tr class="markdownTableRowEven"> +<td class="markdownTableBodyNone">✔ (up from four) </td><td class="markdownTableBodyNone">✔ </td><td class="markdownTableBodyNone">✔ </td><td class="markdownTableBodyNone">Maximum possible (seven) forms of kernel caching. </td></tr> +<tr class="markdownTableRowOdd"> +<td class="markdownTableBodyNone"></td><td class="markdownTableBodyNone">✔ </td><td class="markdownTableBodyNone">✔ </td><td class="markdownTableBodyNone">Absolute path open. </td></tr> +<tr class="markdownTableRowEven"> +<td class="markdownTableBodyNone"></td><td class="markdownTableBodyNone">✔ </td><td class="markdownTableBodyNone">✔ </td><td class="markdownTableBodyNone">Relative "anchored" path open enabling race free file system. </td></tr> +<tr class="markdownTableRowOdd"> +<td class="markdownTableBodyNone">✔ </td><td class="markdownTableBodyNone">✔ </td><td class="markdownTableBodyNone"></td><td class="markdownTableBodyNone">Win32 path support (260 path limit). </td></tr> +<tr class="markdownTableRowEven"> +<td class="markdownTableBodyNone"></td><td class="markdownTableBodyNone">✔ </td><td class="markdownTableBodyNone"></td><td class="markdownTableBodyNone">NT kernel path support (32,768 path limit). </td></tr> +<tr class="markdownTableRowOdd"> +<td class="markdownTableBodyNone">✔ </td><td class="markdownTableBodyNone">✔ </td><td class="markdownTableBodyNone">✔ </td><td class="markdownTableBodyNone">Synchronous universal scatter-gather i/o. </td></tr> +<tr class="markdownTableRowEven"> +<td class="markdownTableBodyNone">✔ (POSIX AIO support) </td><td class="markdownTableBodyNone">✔ </td><td class="markdownTableBodyNone">✔ </td><td class="markdownTableBodyNone">Asynchronous universal scatter-gather i/o. </td></tr> +<tr class="markdownTableRowOdd"> +<td class="markdownTableBodyNone">✔ </td><td class="markdownTableBodyNone">✔ </td><td class="markdownTableBodyNone">✔ </td><td class="markdownTableBodyNone">i/o deadlines and cancellation. </td></tr> +<tr class="markdownTableRowEven"> +<td class="markdownTableBodyNone"></td><td class="markdownTableBodyNone">✔ </td><td class="markdownTableBodyNone">✔ </td><td class="markdownTableBodyNone">Retrieving and setting the current maximum extent (size) of an open file. </td></tr> +<tr class="markdownTableRowOdd"> +<td class="markdownTableBodyNone"></td><td class="markdownTableBodyNone">✔ </td><td class="markdownTableBodyNone">✔ </td><td class="markdownTableBodyNone">Retrieving the current path of an open file irrespective of where it has been renamed to by third parties. </td></tr> +<tr class="markdownTableRowEven"> +<td class="markdownTableBodyNone"></td><td class="markdownTableBodyNone">✔ </td><td class="markdownTableBodyNone">✔ </td><td class="markdownTableBodyNone">statfs_t ported over from LLFIO v1. </td></tr> +<tr class="markdownTableRowOdd"> +<td class="markdownTableBodyNone"></td><td class="markdownTableBodyNone">✔ </td><td class="markdownTableBodyNone">✔ </td><td class="markdownTableBodyNone">utils namespace ported over from LLFIO v1. </td></tr> +<tr class="markdownTableRowEven"> +<td class="markdownTableBodyNone">✔ </td><td class="markdownTableBodyNone">✔ </td><td class="markdownTableBodyNone">✔ </td><td class="markdownTableBodyNone"><code>shared_fs_mutex</code> shared/exclusive entities locking based on lock files </td></tr> +<tr class="markdownTableRowOdd"> +<td class="markdownTableBodyNone">✔ </td><td class="markdownTableBodyNone">✔ </td><td class="markdownTableBodyNone">✔ </td><td class="markdownTableBodyNone">Byte range shared/exclusive locking. </td></tr> +<tr class="markdownTableRowEven"> +<td class="markdownTableBodyNone">✔ </td><td class="markdownTableBodyNone">✔ </td><td class="markdownTableBodyNone">✔ </td><td class="markdownTableBodyNone"><code>shared_fs_mutex</code> shared/exclusive entities locking based on byte ranges </td></tr> +<tr class="markdownTableRowOdd"> +<td class="markdownTableBodyNone">✔ </td><td class="markdownTableBodyNone">✔ </td><td class="markdownTableBodyNone">✔ </td><td class="markdownTableBodyNone"><code>shared_fs_mutex</code> shared/exclusive entities locking based on atomic append </td></tr> +<tr class="markdownTableRowEven"> +<td class="markdownTableBodyNone"></td><td class="markdownTableBodyNone">✔ </td><td class="markdownTableBodyNone">✔ </td><td class="markdownTableBodyNone">Memory mapped files and virtual memory management (<code>section_handle</code>, <code>map_handle</code> and <code>mapped_file_handle</code>) </td></tr> +<tr class="markdownTableRowOdd"> +<td class="markdownTableBodyNone">✔ </td><td class="markdownTableBodyNone">✔ </td><td class="markdownTableBodyNone">✔ </td><td class="markdownTableBodyNone"><code>shared_fs_mutex</code> shared/exclusive entities locking based on memory maps </td></tr> +<tr class="markdownTableRowEven"> +<td class="markdownTableBodyNone">✔ </td><td class="markdownTableBodyNone">✔ </td><td class="markdownTableBodyNone">✔ </td><td class="markdownTableBodyNone">Universal portable UTF-8 path views. </td></tr> +<tr class="markdownTableRowOdd"> +<td class="markdownTableBodyNone"></td><td class="markdownTableBodyNone">✔ </td><td class="markdownTableBodyNone">✔ </td><td class="markdownTableBodyNone">"Hole punching" and hole enumeration ported over from LLFIO v1. </td></tr> +<tr class="markdownTableRowEven"> +<td class="markdownTableBodyNone"></td><td class="markdownTableBodyNone">✔ </td><td class="markdownTableBodyNone">✔ </td><td class="markdownTableBodyNone">Directory handles and very fast directory enumeration ported over from LLFIO v1. </td></tr> +<tr class="markdownTableRowOdd"> +<td class="markdownTableBodyNone">✔ </td><td class="markdownTableBodyNone">✔ </td><td class="markdownTableBodyNone">✔ </td><td class="markdownTableBodyNone"><code>shared_fs_mutex</code> shared/exclusive entities locking based on safe byte ranges </td></tr> +<tr class="markdownTableRowEven"> +<td class="markdownTableBodyNone"></td><td class="markdownTableBodyNone">✔ </td><td class="markdownTableBodyNone">✔ </td><td class="markdownTableBodyNone">Set random or sequential i/o (prefetch). </td></tr> +<tr class="markdownTableRowOdd"> +<td class="markdownTableBodyNone">✔ </td><td class="markdownTableBodyNone">✔ </td><td class="markdownTableBodyNone">✔ </td><td class="markdownTableBodyNone"><code>llfio::algorithm::trivial_vector<T></code> with constant time reallocation if <code>T</code> is trivially copyable. </td></tr> +<tr class="markdownTableRowEven"> +<td class="markdownTableBodyNone"></td><td class="markdownTableBodyNone">✔ </td><td class="markdownTableBodyNone">✔ </td><td class="markdownTableBodyNone"><code>symlink_handle</code>. </td></tr> +<tr class="markdownTableRowOdd"> +<td class="markdownTableBodyNone">✔ </td><td class="markdownTableBodyNone">✔ </td><td class="markdownTableBodyNone">✔ </td><td class="markdownTableBodyNone">Large, huge and massive page size support for memory allocation and (POSIX only) file maps. </td></tr> +<tr class="markdownTableRowEven"> +<td class="markdownTableBodyNone">✔ </td><td class="markdownTableBodyNone">✔ </td><td class="markdownTableBodyNone">✔ </td><td class="markdownTableBodyNone">A mechanism for writing a <code>stat_t</code> onto an inode. </td></tr> +<tr class="markdownTableRowOdd"> +<td class="markdownTableBodyNone">✔ </td><td class="markdownTableBodyNone">✔ </td><td class="markdownTableBodyNone">✔ </td><td class="markdownTableBodyNone">Graph based directory hierarchy traveral algorithm. </td></tr> +<tr class="markdownTableRowEven"> +<td class="markdownTableBodyNone">✔ </td><td class="markdownTableBodyNone">✔ </td><td class="markdownTableBodyNone">✔ </td><td class="markdownTableBodyNone">Graph based directory hierarchy summary algorithm. </td></tr> +<tr class="markdownTableRowOdd"> +<td class="markdownTableBodyNone">✔ </td><td class="markdownTableBodyNone">✔ </td><td class="markdownTableBodyNone">✔ </td><td class="markdownTableBodyNone">Graph based reliable directory hierarchy deletion algorithm. </td></tr> +<tr class="markdownTableRowEven"> +<td class="markdownTableBodyNone">✔ </td><td class="markdownTableBodyNone">✔ </td><td class="markdownTableBodyNone">✔ </td><td class="markdownTableBodyNone">Intelligent file contents cloning between file handles. </td></tr> </table> <p>Todo thereafter in order of priority:</p> -<table class="doxtable"> -<tr> -<th>NEW in v2 </th><th>Windows </th><th>POSIX </th><th></th></tr> -<tr> -<td>✔ </td><td></td><td></td><td>A mechanism for writing a <code>stat_t</code> onto an inode. </td></tr> -<tr> -<td>✔ </td><td></td><td></td><td>Page allocator based on an index of linked list of free pages. See notes. </td></tr> -<tr> -<td>✔ </td><td></td><td></td><td>Optionally concurrent B+ tree index based on page allocator for key-value store. </td></tr> -<tr> -<td>✔ </td><td></td><td></td><td>Attributes extending <code>span<buffers_type></code> with DMA colouring. </td></tr> -<tr> -<td>✔ </td><td></td><td></td><td>Coroutine generator for iterating a file's contents in DMA friendly way. </td></tr> -<tr> -<td>✔ </td><td></td><td></td><td>Ranges & Concurrency based reliable directory hierarchy deletion algorithm. </td></tr> -<tr> -<td>✔ </td><td></td><td></td><td>Ranges & Concurrency based reliable directory hierarchy copy algorithm. </td></tr> -<tr> -<td>✔ </td><td></td><td></td><td>Ranges & Concurrency based reliable directory hierarchy update (two and three way) algorithm. </td></tr> -<tr> -<td>✔ </td><td></td><td></td><td>Linux KAIO support for native non-blocking <code>O_DIRECT</code> i/o </td></tr> -<tr> -<td>✔ </td><td></td><td></td><td><code>std::pmr::memory_resource</code> adapting a file backing if on C++ 17. </td></tr> -<tr> -<td>✔ </td><td></td><td></td><td>Extended attributes support. </td></tr> -<tr> -<td>✔ </td><td></td><td></td><td>Algorithm to replace all duplicate content with hard links. </td></tr> -<tr> -<td>✔ </td><td></td><td></td><td>Algorithm to figure out all paths for a hard linked inode. </td></tr> -<tr> -<td>✔ </td><td></td><td></td><td>Algorithm to compare two or three directory enumerations and give differences. Probably blocked on the Ranges TS. </td></tr> +<table class="markdownTable"> +<tr class="markdownTableHead"> +<th class="markdownTableHeadNone">NEW in v2 </th><th class="markdownTableHeadNone">Windows </th><th class="markdownTableHeadNone">POSIX </th><th class="markdownTableHeadNone"></th></tr> +<tr class="markdownTableRowOdd"> +<td class="markdownTableBodyNone">✔ </td><td class="markdownTableBodyNone"></td><td class="markdownTableBodyNone"></td><td class="markdownTableBodyNone">Page allocator based on an index of linked list of free pages. See notes. </td></tr> +<tr class="markdownTableRowEven"> +<td class="markdownTableBodyNone">✔ </td><td class="markdownTableBodyNone"></td><td class="markdownTableBodyNone"></td><td class="markdownTableBodyNone">Optionally concurrent B+ tree index based on page allocator for key-value store. </td></tr> +<tr class="markdownTableRowOdd"> +<td class="markdownTableBodyNone">✔ </td><td class="markdownTableBodyNone"></td><td class="markdownTableBodyNone"></td><td class="markdownTableBodyNone">Attributes extending <code>span<buffers_type></code> with DMA colouring. </td></tr> +<tr class="markdownTableRowEven"> +<td class="markdownTableBodyNone">✔ </td><td class="markdownTableBodyNone"></td><td class="markdownTableBodyNone"></td><td class="markdownTableBodyNone">Coroutine generator for iterating a file's contents in DMA friendly way. </td></tr> +<tr class="markdownTableRowOdd"> +<td class="markdownTableBodyNone">✔ </td><td class="markdownTableBodyNone"></td><td class="markdownTableBodyNone"></td><td class="markdownTableBodyNone">Ranges & Concurrency based reliable directory hierarchy copy algorithm. </td></tr> +<tr class="markdownTableRowEven"> +<td class="markdownTableBodyNone">✔ </td><td class="markdownTableBodyNone"></td><td class="markdownTableBodyNone"></td><td class="markdownTableBodyNone">Ranges & Concurrency based reliable directory hierarchy update (two and three way) algorithm. </td></tr> +<tr class="markdownTableRowOdd"> +<td class="markdownTableBodyNone">✔ </td><td class="markdownTableBodyNone"></td><td class="markdownTableBodyNone"></td><td class="markdownTableBodyNone">Linux io_uring support for native non-blocking <code>O_DIRECT</code> i/o </td></tr> +<tr class="markdownTableRowEven"> +<td class="markdownTableBodyNone">✔ </td><td class="markdownTableBodyNone"></td><td class="markdownTableBodyNone"></td><td class="markdownTableBodyNone"><code>std::pmr::memory_resource</code> adapting a file backing if on C++ 17. </td></tr> +<tr class="markdownTableRowOdd"> +<td class="markdownTableBodyNone">✔ </td><td class="markdownTableBodyNone"></td><td class="markdownTableBodyNone"></td><td class="markdownTableBodyNone">Extended attributes support. </td></tr> +<tr class="markdownTableRowEven"> +<td class="markdownTableBodyNone">✔ </td><td class="markdownTableBodyNone"></td><td class="markdownTableBodyNone"></td><td class="markdownTableBodyNone">Algorithm to replace all duplicate content with hard links. </td></tr> +<tr class="markdownTableRowOdd"> +<td class="markdownTableBodyNone">✔ </td><td class="markdownTableBodyNone"></td><td class="markdownTableBodyNone"></td><td class="markdownTableBodyNone">Algorithm to figure out all paths for a hard linked inode. </td></tr> +<tr class="markdownTableRowEven"> +<td class="markdownTableBodyNone">✔ </td><td class="markdownTableBodyNone"></td><td class="markdownTableBodyNone"></td><td class="markdownTableBodyNone">Algorithm to compare two or three directory enumerations and give differences. </td></tr> </table> <p>Features possibly to be added after a Boost peer review:</p><ul> <li>Directory change monitoring.</li> @@ -300,7 +325,7 @@ mapped_file_handle - adds low latency memory mapped scatter-gather i/o</li> </ul> <table width="100%" border="0" cellpadding="4"> <tr> -<th colspan="3">Why you might need LLFIO<hr/> +<th colspan="3">Why you might need LLFIO<hr /> </th></tr> <tr> <td valign="top" width="33%">Manufacturer claimed 4Kb transfer latencies for the physical hardware:<ul> @@ -332,14 +357,20 @@ mapped_file_handle - adds low latency memory mapped scatter-gather i/o</li> <li>2017 NVMe flash drive (x4 PCIe 3.0): <b>2Gb/sec</b></li> <li>10Gbit LAN: <b>1.2Gb/sec</b> </li> </ul> -</div></div><!-- contents --> +</div></div><!-- PageDoc --> +</div><!-- contents --> </div><!-- doc-content --> +<div class="ttc" id="aclassllfio__v2__xxx_1_1mapped__file__handle_html_a01a5da3834fd354c5c3d38284b84ef75"><div class="ttname"><a href="classllfio__v2__xxx_1_1mapped__file__handle.html#a01a5da3834fd354c5c3d38284b84ef75">llfio_v2_xxx::mapped_file_handle::truncate</a></div><div class="ttdeci">virtual result< extent_type > truncate(extent_type newsize) noexcept override</div><div class="ttdoc">Resize the current maximum permitted extent of the mapped file to the given extent,...</div></div> +<div class="ttc" id="anamespacellfio__v2__xxx_html_a58d5390cad390de24a80748c8cd7dc5b"><div class="ttname"><a href="namespacellfio__v2__xxx.html#a58d5390cad390de24a80748c8cd7dc5b">llfio_v2_xxx::mapped_temp_inode</a></div><div class="ttdeci">result< mapped_file_handle > mapped_temp_inode(mapped_file_handle::size_type reservation=0, const path_handle &dir=path_discovery::storage_backed_temporary_files_directory(), mapped_file_handle::mode _mode=mapped_file_handle::mode::write, mapped_file_handle::flag flags=mapped_file_handle::flag::none) noexcept</div><div class="ttdef"><b>Definition:</b> mapped_file_handle.hpp:790</div></div> +<div class="ttc" id="agroup__config_html_gac9f7f0153adb9034d26c4554728f817a"><div class="ttname"><a href="group__config.html#gac9f7f0153adb9034d26c4554728f817a">LLFIO_V2_NAMESPACE</a></div><div class="ttdeci">#define LLFIO_V2_NAMESPACE</div><div class="ttdoc">The namespace of this LLFIO v2 which will be some unknown inline namespace starting with v2_ inside t...</div><div class="ttdef"><b>Definition:</b> config.hpp:178</div></div> +<div class="ttc" id="anamespacellfio__v2__xxx_html"><div class="ttname"><a href="namespacellfio__v2__xxx.html">llfio_v2_xxx</a></div><div class="ttdoc">The LLFIO namespace.</div><div class="ttdef"><b>Definition:</b> config.hpp:159</div></div> +<div class="ttc" id="aclassllfio__v2__xxx_1_1mapped__file__handle_html"><div class="ttname"><a href="classllfio__v2__xxx_1_1mapped__file__handle.html">llfio_v2_xxx::mapped_file_handle</a></div><div class="ttdoc">A memory mapped regular file or device.</div><div class="ttdef"><b>Definition:</b> mapped_file_handle.hpp:155</div></div> <!-- start footer part --> <div id="nav-path" class="navpath"><!-- id is needed for treeview function! --> <ul> <li class="footer">Generated by <a href="http://www.doxygen.org/index.html"> - <img class="footer" src="doxygen.png" alt="doxygen"/></a> 1.8.13 </li> + <img class="footer" src="doxygen.png" alt="doxygen"/></a> 1.8.17 </li> </ul> </div> </body> |