CN108090168B - Universal F2FS file system parsing method, terminal device and storage medium - Google Patents
Universal F2FS file system parsing method, terminal device and storage medium Download PDFInfo
- Publication number
- CN108090168B CN108090168B CN201711338307.2A CN201711338307A CN108090168B CN 108090168 B CN108090168 B CN 108090168B CN 201711338307 A CN201711338307 A CN 201711338307A CN 108090168 B CN108090168 B CN 108090168B
- Authority
- CN
- China
- Prior art keywords
- file system
- super block
- file
- pointer
- f2fs
- Prior art date
- Legal status (The legal status is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the status listed.)
- Active
Links
Images
Classifications
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING OR COUNTING
- G06F—ELECTRIC DIGITAL DATA PROCESSING
- G06F16/00—Information retrieval; Database structures therefor; File system structures therefor
- G06F16/10—File systems; File servers
- G06F16/13—File access structures, e.g. distributed indices
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING OR COUNTING
- G06F—ELECTRIC DIGITAL DATA PROCESSING
- G06F16/00—Information retrieval; Database structures therefor; File system structures therefor
- G06F16/10—File systems; File servers
- G06F16/16—File or folder operations, e.g. details of user interfaces specifically adapted to file systems
- G06F16/164—File meta data generation
Landscapes
- Engineering & Computer Science (AREA)
- Theoretical Computer Science (AREA)
- Data Mining & Analysis (AREA)
- Databases & Information Systems (AREA)
- Physics & Mathematics (AREA)
- General Engineering & Computer Science (AREA)
- General Physics & Mathematics (AREA)
- Human Computer Interaction (AREA)
- Information Retrieval, Db Structures And Fs Structures Therefor (AREA)
Abstract
The invention relates to a method for analyzing a universal F2FS file system, a terminal device and a storage medium, wherein the method comprises the following steps: s100: simulating the mounting process and constructing metadata of the F2FS file system, wherein the method comprises the following steps: s110: checking the content of the super block; s120: initializing a super block; s130: selecting a valid checkpoint; s140: constructing a segment information table; s150: initializing a node address table; s200: the file directory entry is constructed from generic directory entry blocks, which include, but are not limited to, the following components: file type, inode number, parent inode number, file size, creation time, modification time, filename pointer, filename length, pointer to next node, and directory valid, the first node pointer to the directory. The invention solves the problem of poor portability and compatibility of the file system.
Description
Technical Field
The invention relates to the field of computer File systems, in particular to a method for analyzing a universal F2FS (Flash Friendly File System) File System, a terminal device and a storage medium.
Background
The current user data partition file system type of the android mobile device terminal is usually EXT (Extended file system) or F2FS, and is especially widely used on android smart phones, EXT is used as an earlier Linux file system, the application range is wider, a certain number of technical documents and related patents also exist, but F2FS has certain advantages in overall performance compared with EXT as a novel Linux file system, and is frequently adopted on some medium-high-end mobile phones, and related technical patents are not found at present.
The EXT file system supports that the size range of sectors is 512/1024/2048/4096 bytes, the size of blocks is 4KB, the analysis method is to directly traverse and analyze directory entries according to bitmap information, along with the development of a memory technology, the storage capacity is larger and larger, the sizes of the sectors and the blocks are correspondingly larger in order to improve the reading and writing efficiency, related metadata are changed accordingly, and when a file system research and development mechanism makes technical changes on a file system or pushes out a new file system version, the problems of poor compatibility, slow development iteration of related analysis technologies and the like occur.
Disclosure of Invention
In order to solve the above problems, the present invention aims to provide a general F2FS file system parsing method, terminal device, and storage medium, which solve the problem of poor portability and compatibility of a file system.
The specific scheme is as follows:
1. a method for analyzing a universal F2FS file system is characterized in that: the method comprises the following steps:
s100: simulating the process of mounting (mount) and constructing metadata of the F2FS file system, wherein the method comprises the following steps:
s110: checking the content of a Super Block (SB);
the verification is to verify the super block 0 firstly, switch to the super block 1 for verification when the super block 0 fails to verify, and end when the super block 1 fails to verify;
s120: initializing the super block: assigning values to the initial address parameters and other related parameters of the statistical data and the metadata in the superblock;
the initialization is to initialize the super block 0 when the super block 0 passes the check; when the super block 0 check fails but the super block 1 check passes, initializing the super block 1;
s130: selecting a valid Checkpoint (CP): selecting the check point with the higher version number in the two check points as a current valid check point;
s140: construct Segment Information Table (SIT): reading Segment information table bitmap information from an effective check point, checking the relation between a bitmap and an effective data block, and loading the obtained effective bitmap information into a Segment Summary Area (SSA);
s150: initializing Node Address Table (NAT): reading node address table bitmap information and pointer information from the effective check points to complete the mapping corresponding relation between the node blocks and the bitmap;
s200: constructing a file directory entry according to the universal directory entry block;
the generic directory entry block includes, but is not limited to, the following components: file type, inode number, parent inode number, file size, creation time, modification time, filename pointer, filename length, pointer to next node, and directory valid, the first node pointer to the directory.
Furthermore, the file type occupies 1byte, the inode number occupies 4 bytes, the father item inode number occupies 4 bytes, the creation time occupies 8 bytes, the modification time occupies 8 bytes, the file name pointer is a wide byte pointer, and the occupied address size is dynamically allocated.
A generic F2FS file system parsing terminal device, comprising a memory, a processor and a computer program stored in the memory and executable on the processor, the processor implementing the steps of the method of an embodiment of the invention when executing the computer program.
A computer-readable storage medium, in which a computer program is stored, which, when being executed by a processor, carries out the steps of the method as described above for an embodiment of the invention.
The invention adopts the technical scheme, provides an analysis scheme aiming at the File system according to the mount command of the Linux operating system, the characteristics, the data organization and the File structure of the F2FS File system, is successfully applied to the analysis of the image File system of the mobile equipment terminal using the File system, and expands the image File evidence obtaining range of the low-end android mobile phone which only supports EXT and adopts yaffs (Yet antenna Flash File system) File system in a smaller amount.
The mirror image file system analysis method based on the android mobile terminal device has good stability and compatibility to the mirror image file system analysis of the android mobile terminal device through the mirror image file system analysis scheme simulating the mounting process, and meanwhile, an important idea is provided for the field of mirror image file evidence obtaining.
Drawings
Fig. 1 is a schematic flow chart according to a first embodiment of the present invention.
Detailed Description
To further illustrate the various embodiments, the invention provides the accompanying drawings. The accompanying drawings, which are incorporated in and constitute a part of this disclosure, illustrate embodiments of the invention and, together with the description, serve to explain the principles of the embodiments. Those skilled in the art will appreciate still other possible embodiments and advantages of the present invention with reference to these figures. Elements in the figures are not drawn to scale and like reference numerals are generally used to indicate like elements.
The invention will now be further described with reference to the accompanying drawings and detailed description.
The first embodiment is as follows:
an embodiment of the present invention provides a method for parsing a general F2FS file system, as shown in fig. 1, which is a schematic flow chart of the method for parsing a general F2FS file system according to the embodiment of the present invention, and the method may include the following steps:
s100: the process of mount (mount) is simulated, and metadata of the F2FS file system is constructed.
The mount is to mount the partition under a folder of Linux so as to associate the partition with the directory, so that accessing the folder is equivalent to accessing the partition.
In the process, relevant actions such as initialization or assignment of environment variables of the operating system are removed, and only the part of the operating system in the process is reserved.
The metadata of F2FS is file system organization architecture information, including the following:
1) super block (Superblock, SB)
2) Check point (Checkpoint, CP)
3) Segment Information Table (SIT)
4) Node Address Table (Node Address Table, NAT)
5) Segment Summary Area (SSA)
The process of simulating the mounting comprises the following steps:
s110: the contents of the superblock in the F2FS file are checked.
The F2FS file is a new open source flash file system specifically designed for NAND-based storage devices.
Two backup superblocks in the F2FS file are respectively superblock 0 and superblock 1, each block occupies 4KB, 0x400 bytes are offset from disk image file 0 as superblock 0, the four bytes at the beginning of the block are file system magic number "1020F 5F 2", the superblock only contains read-only data, once the file system is created, the information of the superblock does not change, the superblock contains basic partition information and default F2FS parameter, and describes how large the file system is, how large the Segment (Segment) is, how large the storage area (Zone) is, and how much space is allocated to the "metadata" area of each part, and other small amount of detail information.
The checking process includes firstly checking magic numbers, which are one of important identifiers for distinguishing an F2FS file system, then checking the total number of Main areas (Main Area) and the size of sectors, wherein the size of the currently supported sectors is 512/1024/2048/4096 bytes, failure will be returned if the sector does not belong to the range, and finally checking root (root) inode numbers, metadata inode numbers and node (node) inode numbers, wherein the root (root) inode numbers, the metadata inode numbers and the node (node) inode numbers are all fixed, otherwise failure will be returned.
Further, the verification is to verify the superblock 0 first, and when the superblock 0 fails to verify, that is, the superblock 0 is damaged, the superblock 0 is switched to the superblock 1 to verify, and when the superblock 1 fails to verify, the verification is finished, which indicates that the disk is damaged or the extraction of the mirror image file is incorrect.
S120: and initializing the super block, namely assigning values to the initial address parameters of the statistical data and the metadata in the super block and other related parameters.
The related parameters include, but are not limited to, the total number of blocks, block size, total number of nodes, root node number, metadata start block address, Main Area (Main Area) start address, and the like.
In this embodiment, when the super block 0 passes the verification in step S110, the super block 0 is initialized; when superblock 0 does not check but superblock 1 does, superblock 1 is initialized.
S130: a valid Checkpoint (Checkpoint, CP) is selected.
The checkpoint is a type of metadata that allows copy-on-write to be implemented using a two-place (two-location) approach, the checkpoint occupies two adjacent segments, each segment stores a checkpoint but only one is valid, the checkpoint contains a version number, both checkpoints are read when the file system is mounted, the checkpoint with the higher version number of the two checkpoints is selected as the current valid checkpoint that points to the valid node address table and the segment information table.
The checkpoints are used to store writable information in the file system superblock, such as the amount of free space, the address of the next segment to be written with data, and other alterable information. Checkpoints contain file system information, bitmaps of valid node address table sets and segment information table sets, lists of deleted nodes (orange inodes), and Summary (Summary) entries of currently valid segments.
S140: construct Segment Information Table (Segment Information Table, SIT): reading Segment information table bitmap information from an effective check point, checking the relation between the bitmap and an effective data block, obtaining effective bitmap information, and loading the effective bitmap information into a current Segment Summary Area (SSA).
The section summary area comprises a plurality of section summary items, and the section summary items comprise all data stored in the main area and owner information of the node blocks.
The segment information table stores 74 bytes of information for each segment and is separate from the summary entries of the segments because it modifies more frequently. It is used mainly to keep track of which data blocks are still valid (number of valid blocks and data block validity bitmap), so that a segment can be recycled when there are no valid blocks in the segment, or a clean operation can be performed when there are few valid data blocks in the segment.
The section summary area comprises a plurality of summary items, and the summary items store data blocks and node block information of a Main (Main) area.
S150: initializing Node Address Table (Node Address Table, NAT): and reading the node address table bitmap information and the pointer information from the effective check points to complete the mapping corresponding relation between the node blocks and the bitmap.
The node address table is a block address table of all node data blocks stored in a Main (Main) area, all node blocks are mapped by the node address table, namely the position of each node is converted by the node address table, and F2FS adopts the node address table and the node blocks to make a mapping relation, so that recursive propagation during updating of the data blocks is omitted.
S200: the file directory entry is constructed from the common directory entry blocks.
In an original directory structure in the F2FS file system, each directory entry block is 4KB in size and includes 214 directory entry slots (slots), a file name, a reserved area, and Bitmap (Bitmap) information, where each directory entry block uses one Bitmap information to indicate whether the directory entry is valid, 214 directory entries are included in the 214 directory entry slots, and each directory entry occupies 11 bytes and includes the following 4 portions: filename hash value (hash), inode number (ino), filename length (name len), file type (type). The file name hash value occupies 4 bytes, the inode number occupies 4 bytes, the file name length occupies 2 bytes, and the file type occupies 1 byte.
Because the original directory entry attribute cannot meet certain specific requirements, such as the requirement of electronic evidence collection in the embodiment, the electronic data collection needs to record the time of the file and the related data of the size of the file, and the original directory entry attribute does not have the contents, a universal directory entry structure meeting the electronic evidence collection is constructed.
The universal directory entry block includes the following components:
1) file type (type) (1Byte)
2) Inode number (ino)
3) Father item inode number (pino)
4) File size (size)
5) Creation time (ctime)
6) Modified time (mtime)
7) File name pointer (file _ name)
8) File name Length (file _ len)
9) Pointing to the next node pointer (next)
10) The directory is valid, pointing to the first node pointer (child) of the directory
In this embodiment, the file type occupies 1Byte (Byte), the inode number occupies 4 bytes, the parent inode number occupies 4 bytes, the creation time occupies 8 bytes, the modification time occupies 8 bytes, the file name pointer is a wide Byte pointer, and the size of the occupied address is dynamically allocated.
The directory entry block has a relatively simple structure, has no platform-dependent dependence, is convenient to transplant, and is stored in a memory after the mirror image file is successfully mounted for quickly traversing and outputting the file.
In the first embodiment of the invention, the mirror disk file in the F2FS file format is mounted under one folder of Linus through a simulation mounting process, and the mirror disk file is linked with the folder directory, and because the metadata of the file system is described in detail in the mounting process, the file system with a newly released version and a lower version can be well compatible with less or no change.
Example two:
the invention further provides a general F2FS file system parsing terminal device, which includes a memory, a processor, and a computer program stored in the memory and executable on the processor, where the processor executes the computer program to implement the steps in the foregoing method embodiments of the first embodiment of the present invention.
Further, as an executable solution, the general F2FS file system parsing terminal device may be a computing device such as a desktop computer, a notebook, a palm computer, and a cloud server. The generic F2FS file system parsing terminal device may include, but is not limited to, a processor, a memory. Those skilled in the art will appreciate that the above-mentioned structure of the generic F2FS file system parsing terminal device is only an example of the generic F2FS file system parsing terminal device, and does not constitute a limitation of the generic F2FS file system parsing terminal device, and may include more or less components than the above-mentioned one, or combine some components, or different components, for example, the generic F2FS file system parsing terminal device may further include an input-output device, a network access device, a bus, etc., which is not limited in this embodiment of the present invention.
Further, as an executable solution, the Processor may be a central Processing Unit (cpu), other general purpose Processor, a Digital Signal Processor (DSP), an Application Specific Integrated Circuit (ASIC), an off-the-shelf programmable Gate Array (FPGA) or other programmable logic device, a discrete Gate or transistor logic device, a discrete hardware component, or the like. The general purpose processor may be a microprocessor or the processor may be any conventional processor or the like, the processor is a control center of the general F2FS file system parsing terminal device, and various interfaces and lines are used to connect various parts of the whole general F2FS file system parsing terminal device.
The memory may be used for storing the computer programs and/or modules, and the processor may implement various functions of the general F2FS file system parsing terminal device by executing or executing the computer programs and/or modules stored in the memory and calling the data stored in the memory. The memory can mainly comprise a program storage area and a data storage area, wherein the program storage area can store an operating system and an application program required by at least one function; the storage data area may store data created according to the use of the mobile phone, and the like. In addition, the memory may include high speed random access memory, and may also include non-volatile memory, such as a hard disk, a memory, a plug-in hard disk, a Smart Media Card (SMC), a Secure Digital (SD) Card, a flash memory Card (Fnash Card), at least one magnetic disk storage device, a flash memory device, or other volatile solid state storage device.
The invention also provides a computer-readable storage medium, in which a computer program is stored, which, when being executed by a processor, carries out the steps of the above-mentioned method of an embodiment of the invention.
The general F2FS file system parsing terminal device integrated module/unit, if implemented in the form of a software functional unit and sold or used as a stand-alone product, may be stored in a computer readable storage medium. Based on such understanding, all or part of the flow of the method according to the embodiments of the present invention may also be implemented by a computer program, which may be stored in a computer-readable storage medium, and when the computer program is executed by a processor, the steps of the method embodiments may be implemented. Wherein the computer program comprises computer program code, which may be in the form of source code, object code, an executable file or some intermediate form, etc. The computer-readable medium may include: any entity or device capable of carrying said computer program code, recording medium, usb disk, removable hard disk, magnetic disk, optical disk, computer Memory, Read-only Memory (ROM), Random Access Memory (RAM), electrical carrier wave signals, telecommunications signals, software distribution medium, etc. It should be noted that the computer readable medium may contain content that is subject to appropriate increase or decrease as required by legislation and patent practice in jurisdictions, for example, in some jurisdictions, computer readable media does not include electrical carrier signals and telecommunications signals as is required by legislation and patent practice.
While the invention has been particularly shown and described with reference to a preferred embodiment, it will be understood by those skilled in the art that various changes in form and detail may be made therein without departing from the spirit and scope of the invention as defined by the appended claims.
Claims (4)
1. A method for analyzing a universal F2FS file system is characterized in that: the method comprises the following steps:
s100: simulating the process of mounting (mount) and constructing metadata of the F2FS file system, wherein the method comprises the following steps:
s110: checking the content of the super block;
the verification is to verify the super block 0 firstly, switch to the super block 1 for verification when the super block 0 fails to verify, and end when the super block 1 fails to verify;
s120: initializing the super block: assigning values to the initial address parameters and other related parameters of the statistical data and the metadata in the superblock;
the initialization is to initialize the super block 0 when the super block 0 passes the check; when the super block 0 check fails but the super block 1 check passes, initializing the super block 1;
s130: selecting a valid check point: selecting the check point with the higher version number in the two check points as a current valid check point;
s140: constructing a segment information table: reading segment information table bitmap information from an effective check point, checking the relation between a bitmap and an effective data block, and loading the obtained effective bitmap information into a segment summarizing area;
s150: initializing a node address table: reading node address table bitmap information and pointer information from the effective check points to complete the mapping corresponding relation between the node blocks and the bitmap;
s200: constructing a file directory entry according to the universal directory entry block;
the generic directory entry block includes, but is not limited to, the following components: file type, inode number, parent inode number, file size, creation time, modification time, filename pointer, filename length, pointer to next node, and directory valid, the first node pointer to the directory.
2. The universal F2FS file system parsing method according to claim 1, wherein: the file type occupies 1byte, the inode number occupies 4 bytes, the father item inode number occupies 4 bytes, the creation time occupies 8 bytes, the modification time occupies 8 bytes, the file name pointer is a wide byte pointer, and the occupied address size is dynamically allocated.
3. A generic F2FS file system parsing terminal device comprising a memory, a processor and a computer program stored in said memory and executable on said processor, characterized in that said processor implements the steps of the method according to claims 1-2 when executing said computer program.
4. A computer-readable storage medium, in which a computer program is stored which, when being executed by a processor, carries out the steps of the method according to claims 1-2.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201711338307.2A CN108090168B (en) | 2017-12-14 | 2017-12-14 | Universal F2FS file system parsing method, terminal device and storage medium |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201711338307.2A CN108090168B (en) | 2017-12-14 | 2017-12-14 | Universal F2FS file system parsing method, terminal device and storage medium |
Publications (2)
| Publication Number | Publication Date |
|---|---|
| CN108090168A CN108090168A (en) | 2018-05-29 |
| CN108090168B true CN108090168B (en) | 2021-01-12 |
Family
ID=62175733
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN201711338307.2A Active CN108090168B (en) | 2017-12-14 | 2017-12-14 | Universal F2FS file system parsing method, terminal device and storage medium |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN108090168B (en) |
Families Citing this family (13)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN111339544B (en) * | 2019-04-24 | 2023-03-14 | 上海安路信息科技股份有限公司 | Offline downloading device and offline downloading method |
| CN110569218B (en) * | 2019-08-01 | 2021-11-23 | 厦门市美亚柏科信息股份有限公司 | Offline modification method and device for EXT file system and storage medium |
| CN110874285B (en) * | 2019-11-19 | 2022-06-21 | 厦门市美亚柏科信息股份有限公司 | Method for realizing reducible write operation of EXT file system |
| CN111144839B (en) * | 2019-12-17 | 2024-02-02 | 深圳市优必选科技股份有限公司 | Project construction method, continuous integration system and terminal equipment |
| CN111190869A (en) * | 2019-12-27 | 2020-05-22 | 深圳市恒扬数据股份有限公司 | File storage method and terminal |
| CN111078632B (en) * | 2019-12-27 | 2023-07-28 | 珠海金山数字网络科技有限公司 | File data management method and device |
| CN113362489A (en) * | 2020-03-06 | 2021-09-07 | 联合汽车电子有限公司 | Method for creating vehicle measurement file, electronic device, and storage medium |
| US11379153B2 (en) * | 2020-07-23 | 2022-07-05 | Micron Technology, Inc. | Storage traffic pattern detection in memory devices |
| CN112579545B (en) * | 2020-12-28 | 2024-03-29 | 惠州华阳通用电子有限公司 | Linux file system mounting method and storage medium |
| CN113960453B (en) * | 2021-11-02 | 2023-12-01 | 上海御渡半导体科技有限公司 | Test device and test method for rapidly generating STDF data |
| CN114168079B (en) * | 2021-12-09 | 2023-08-22 | 深圳软牛科技有限公司 | Method, device and related component for identifying tiff type data deleted from disk |
| CN115048046B (en) * | 2022-05-26 | 2022-11-25 | 北京华昱卓程软件有限公司 | Log file system and data management method |
| CN115292266B (en) * | 2022-05-30 | 2024-05-14 | 中国电子科技集团公司第五十二研究所 | High-reliability log storage method based on memory |
Citations (4)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN102609361A (en) * | 2012-01-16 | 2012-07-25 | 北京邮电大学 | Method and device for transferring storage data of virtual machine |
| CN103678044A (en) * | 2013-12-30 | 2014-03-26 | 厦门市美亚柏科信息股份有限公司 | Data recovery method and device of RAID5 in EXT3 file system |
| CN106873921A (en) * | 2017-03-24 | 2017-06-20 | 努比亚技术有限公司 | A kind of hanging method and device of multi partition external storage |
| CN107391774A (en) * | 2017-09-15 | 2017-11-24 | 厦门大学 | The rubbish recovering method of JFS based on data de-duplication |
Family Cites Families (5)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| US9767120B2 (en) * | 2008-01-16 | 2017-09-19 | Hitachi Data Systems Engineering UK Limited | Multi-way checkpoints in a data storage system |
| KR101356470B1 (en) * | 2011-05-26 | 2014-01-28 | 에스코어 주식회사 | Flash file system |
| CN102270229B (en) * | 2011-07-13 | 2013-02-13 | 中国人民解放军海军计算技术研究所 | Measurement method for basic input/output system (BIOS)-level system file |
| KR102033323B1 (en) * | 2014-03-05 | 2019-10-17 | 한국전자통신연구원 | Method for storing metadata of log-structured file system for flash memory |
| CN107134287A (en) * | 2016-02-26 | 2017-09-05 | 四川效率源信息安全技术股份有限公司 | File extraction method based on CDFS file system |
-
2017
- 2017-12-14 CN CN201711338307.2A patent/CN108090168B/en active Active
Patent Citations (4)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN102609361A (en) * | 2012-01-16 | 2012-07-25 | 北京邮电大学 | Method and device for transferring storage data of virtual machine |
| CN103678044A (en) * | 2013-12-30 | 2014-03-26 | 厦门市美亚柏科信息股份有限公司 | Data recovery method and device of RAID5 in EXT3 file system |
| CN106873921A (en) * | 2017-03-24 | 2017-06-20 | 努比亚技术有限公司 | A kind of hanging method and device of multi partition external storage |
| CN107391774A (en) * | 2017-09-15 | 2017-11-24 | 厦门大学 | The rubbish recovering method of JFS based on data de-duplication |
Non-Patent Citations (2)
| Title |
|---|
| An empirical study of F2FS on mobile devices;Yu Liang 等;《2017 IEEE 23rd International Conference on Embedded and Real-Time Computing Systems and Applications (RTCSA)》;20170818;第1-9页 * |
| 基于Linux系统的证据收集研究与实现;刘涛;《中国优秀硕士学位论文全文数据库 信息科技辑》;20120615(第06期);I139-86 * |
Also Published As
| Publication number | Publication date |
|---|---|
| CN108090168A (en) | 2018-05-29 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| CN108090168B (en) | Universal F2FS file system parsing method, terminal device and storage medium | |
| CN110018998B (en) | File management method and system, electronic equipment and storage medium | |
| US11176100B2 (en) | Systems and methods for fail-safe operations of storage devices | |
| CN110162525B (en) | B+ tree-based read-write conflict resolution method, device and storage medium | |
| US10521126B2 (en) | Systems and methods for writing back data to a storage device | |
| US10929346B2 (en) | Systems and methods for storing large files using file allocation table based file systems | |
| CN109542911B (en) | Metadata organization method, system, equipment and computer readable storage medium | |
| US20170302292A1 (en) | Computer-readable recording medium, encoding device, and encoding method | |
| US10838913B2 (en) | Systems and methods for storing large files using file allocation table based file systems | |
| US10776342B2 (en) | Systems and methods for recovering lost clusters from a mounted volume | |
| CN106709014B (en) | File system conversion method and device | |
| CN112800007B (en) | Directory entry expansion method and system suitable for FAT32 file system | |
| EP3436990B1 (en) | Systems and methods for enabling modifications of multiple data objects within a file system volume | |
| CN114443598A (en) | Data writing method and device, computer equipment and storage medium | |
| WO2015102670A1 (en) | Systems and methods for fail-safe operations of storage devices | |
| US10614044B2 (en) | Systems and methods for performing data object renaming operations | |
| CN112445764B (en) | File operation method, device, storage medium and electronic equipment | |
| CN112527745B (en) | Embedded file system multi-partition analysis method, terminal device and storage medium | |
| CN117742607A (en) | Method, system, equipment and storage medium for operating simulation file of temporary data | |
| CN104424238A (en) | Method and device for generating mass files | |
| CN116266174A (en) | File version management method and file system |
Legal Events
| Date | Code | Title | Description |
|---|---|---|---|
| PB01 | Publication | ||
| PB01 | Publication | ||
| SE01 | Entry into force of request for substantive examination | ||
| SE01 | Entry into force of request for substantive examination | ||
| GR01 | Patent grant | ||
| GR01 | Patent grant |