US 2026/0178488 A1Published application

Data Access Using a Virtual Mapping Bypass in a Log Storage Filesystem

AssigneeDell Products L.P.

InventorsPhilippe Armangau, Max Laier

Life of this patent

Estimating the term…

Loading patent…

Abstract

A system can, based on storing data for a file in a chunk of a log filesystem, store a first virtual pointer and a second physical pointer in an inode leaf block that corresponds to the file. The system can, based on determining to read the data, fetch a chunk identifier that corresponds to the data, and that comprises an uber identifier of an uber and a first uber generation identifier. The system can, based on the first uber generation identifier matching a second uber generation identifier of a garbage collection reference counter of the uber that is accessed based on the uber identifier, use a result of the reading the data from the uber using the second physical pointer. The system can, based on the first uber generation identifier differing from the second uber generation identifier, use a result of reading the data using the first virtual pointer.

Claims20

Dependent claims

A system, comprising:

at least one processor;
and
at least one memory that stores executable instructions that, when executed by the at least one processor, facilitate performance of operations, comprising:
based on storing data for a file in a chunk of a log filesystem, storing a first virtual pointer and a second physical pointer in an inode leaf block that corresponds to the file, wherein the first virtual pointer points to a virtual chunk extent that comprises a third pointer that stores first information about a physical location of the data in the chunk, and wherein the second physical pointer stores second information about the physical location of the data in the chunk;
based on determining to read the data based on a request to read the data, fetching a physical chunk identifier that corresponds to the data, wherein the physical chunk identifier comprises an uber identifier of an uber and a first uber generation identifier of the uber;
based on the first uber generation identifier matching a second uber generation identifier of a garbage collection reference counter of the uber that is accessed based on the uber identifier, reading the data from the uber using the second physical pointer, to produce a result, wherein the second uber generation identifier indicates a number of iterations of garbage collection that have been applied to the uber;
based on the first uber generation identifier differing from the second uber generation identifier, reading the data using the first virtual pointer and the third pointer, to produce the result;
and
responding to the request to read the data with the result.

6 more elements

A method, comprising:

storing, by a system comprising at least one processor, a first virtual pointer and a second physical pointer in an inode leaf block that corresponds to data of a file, wherein the first virtual pointer points to a virtual chunk extent that comprises a third pointer that stores first information about a physical location of the data in a chunk;
as part of reading the data based on a request to read the data, determining, by the system, an uber identifier of an uber and a first uber generation identifier of the uber for the data from a chunk identifier;
based on the first uber generation identifier matching a second uber generation identifier of a garbage collection reference counter of the uber that is accessed based on the uber identifier, reading, by the system, the data from the uber using the second physical pointer, to produce a result, wherein the second uber generation identifier indicates a number of iterations of garbage collection that have been applied to the uber;
based on the first uber generation identifier differing from the second uber generation identifier, reading, by the system, the data using the first virtual pointer and the third pointer, to produce the result;
and
responding, by the system, to the request to read the data with the result.

3 more elements

A non-transitory computer-readable medium comprising instructions that, in response to execution, cause a system comprising at least one processor to perform operations, comprising:

based on determining to read data that corresponds to a file in response to a request to read the data, wherein an inode leaf block that corresponds to the file comprises a first virtual pointer and a second physical pointer, wherein the first virtual pointer points to a virtual chunk extent comprises a third pointer that stores first information about a physical location of data in in a chunk of a log filesystem, and wherein the second physical pointer stores second information about a physical location of the data in the chunk, determining an uber identifier of an uber and a first uber generation identifier of the uber for the data from a chunk identifier;
and
based on the first uber generation identifier differing from a second uber generation identifier of a garbage collection reference counter of the uber that is accessed based on the uber identifier, reading the data using the second physical pointer, wherein the second uber generation identifier indicates a number of iterations of garbage collection that have been applied to the uber;
and
responding to the request to read the data with the result.

2 more elements

Dependencies are inferred from the claim text.