A second-hand mobile phone computer data erasing system and method

Abstract

The application discloses a second-hand mobile phone computer data erasing system and method, which acquires disk information of a second-hand computer, carries out read-write operation on disk sectors according to the disk information to determine the read-write performance of the disk information, if the read fails, there are bad blocks in the disk, if the read is normal, the function returns the preset read byte number after the operation is completed, if an exception occurs, it is determined that there are bad blocks in the disk, and the returned byte number after the read operation is completed is inconsistent with the preset byte number; before writing data into the disk, the original data is migrated and the original data is rewritten, the data written into the disk is read, and the consistency of the read data and the previously written data is compared, if the consistency is consistent, the write operation area in the disk does not have bad blocks, otherwise, it is judged that the area has bad blocks, and the stored data is cleaned or recovered according to the disk information and the read-write performance, so that the accuracy of disk data detection and the safety of data are improved.

Description

Technical Field

[0001] This invention belongs to the field of data processing technology, and in particular relates to a system and method for erasing data from used mobile phones and computers. Background Technology

[0002] In the information age, the crucial role of data is self-evident. As the primary data storage device on personal computers, the stable operation of the hard drive provides strong protection for data security. Many companies have emerged in the market offering data recovery services, catering to different user needs and varying degrees of recovery, broadly categorized as hardware-based recovery and software-based recovery. However, hardware recovery requires considerable technical expertise and specialized equipment, resulting in high costs and significant time and effort for users. If the data carrier, such as the hard drive, has not suffered extensive physical damage, software recovery is a better option. For individual users, software recovery is the most common method for data recovery from hard drives in used computers. While various detection tools and data recovery software exist, some are overly complex to operate, leading to a poor user experience and increasing the user's learning and selection costs. This can even increase the risk of important data theft. Therefore, it is necessary to thoroughly erase important data from used mobile phones and computers to ensure user data security. Summary of the Invention

[0003] In view of this, the present invention provides a data erasure system and method for second-hand mobile phones and computers that improves data security and the accuracy of data detection for second-hand computers, in order to solve the above-mentioned technical problems. Specifically, the following technical solutions are adopted to achieve this.

[0004] In a first aspect, the present invention provides a data erasure system for used mobile phones and computers, comprising: The disk information acquisition module is used to acquire disk information of the used computer, including capacity, partitioning, and file system. The disk detection module is used to perform read and write operations on disk sectors based on disk information to determine the read and write performance of disk information. If the read fails, bad blocks exist in some parts of the disk. If the read is normal, the function returns the number of bytes read after the operation is completed. If an exception occurs, it is determined that bad blocks exist on the disk, and the number of bytes returned after the read operation is completed is inconsistent with the number of bytes pre-set. Before writing data to the disk, the original data is migrated and written back. The data written to the disk is read, and the consistency between the read data and the pre-written data is compared. If they are consistent, there are no bad blocks in the write operation area of ​​the disk. Otherwise, it is determined that there are bad blocks in the area. The disk read operation is performed by the read function in the program issuing a read command, which is then read from the disk device through the disk controller and the driver. The data clearing module is used to clear or restore stored data based on disk information and read / write performance.

[0005] As a further improvement to the above technical solution, the disk detection module also includes the following during the read operation process: During read operations, the number of reads for each block is counted. When the number of reads for a disk module reaches a preset threshold, the read and refresh operation of the migration data is triggered. The blocks containing valid pages in the current die are traversed, and the block numbers are sorted in ascending order by the number of erases, then in descending order by the number of reads. Then, they are divided into eight categories and reverse matching is performed to obtain the optimal number of reads for each block. Match the tolerable number of reads for the available inbound blocks with the number of reads for the data pages in the outbound blocks, where the tolerable number of reads = the optimal number of reads - the current number of reads; Iterate through the valid pages in the outgoing block and perform page movement operations to distribute the data to the matching incoming block.

[0006] As a further improvement to the above technical solution, the block numbers are sorted in ascending order by the number of erases, then in descending order by the number of reads, and then divided into eight categories for reverse matching to obtain the optimal number of reads for each block, including: The sequence numbers of blocks containing valid pages are sorted in ascending order by the number of reads and in descending order by the error rate feature. Blocks with low error rates and high read counts are matched to obtain the optimal number of reads.

[0007] As a further improvement to the above technical solution, the optimal number of reads is obtained through a mathematical model, assuming there are n blocks on the disk, and each block has m pages. , and Let be the number of reads, bit error rate, and number of errors for the j-th page in the i-th block, respectively. The expression for the read bit error rate caused by read interference is: ,in This is a constant related to the disk's factory characteristics to reflect the positive impact of the number of reads on the bit error rate. This represents the unique attribute of the i-th block, and measures the difference in the original bit error rate of each block, i.e., the number of erasures. The expression for the number of read errors caused by read interference on a page, which depends on the number of reads from other pages in the same block, is as follows: , where R and W represent the total number of reads and the number of bit errors for the entire system.

[0008] As a further improvement to the above technical solution, the disk testing module includes a read / write test unit, and the execution process of the read / write test unit includes: Select the size of the test block, which is the number of bytes read by the read function each time. Position the read pointer to the starting block of the disk, and the read function reads the contents of the block area into the buffer. The read pointer moves to the next block area and the operation is repeated until the last block is read.

[0009] As a further improvement to the above technical solution, the disk detection module also includes a data recovery unit, the execution process of which includes: Read the cluster run list under the 80H attribute in the MFT entry, obtain the starting cluster number and cluster number of each cluster run structure, and iterate through all MFT entries in each MFT region. Obtain the MFT entries of the user files, construct a node data structure, and read the file name, directory name, file record reference number, and parent directory file record reference number; Determine if the parent directory file record reference number is 0x05. If it is, the parent directory is the root directory, and insert the node into the root directory of the directory tree. Otherwise, proceed to the next step. Retrieve the MFT entry of the parent directory file based on its MFT reference number. Read the file name or directory name and use a search function to search for the existence of the parent directory file in the constructed directory tree. If it exists, insert it into the directory tree according to the rules. Otherwise, construct a new node based on the parent directory file. Repeat the above process until the parent directory's MFT reference number is 0x05. Check its existence and insert it into the directory tree according to the rules. If it exists, return to continue reading the next MFT entry.

[0010] As a further improvement to the above technical solution, the directory tree reconstruction algorithm process includes: When searching a directory tree, if the target of the search is a directory node, when searching under a directory node, the search is performed in the same layer order according to the preset search method. If a file node is found in the child node, then the subsequent node of this layer is a file node, and the search jumps directly to the next layer.

[0011] As a further improvement to the above technical solution, after the target tree structure is constructed, the target file is searched in the stored binary directory tree. After the target file node is found, the corresponding MFT record starting sector is entered, the data attribute content is read and saved to the corresponding path. If the target is a folder, the directory hierarchy is established in the new path in sequence, and all file data under the directory file node is restored and saved to the established corresponding directory.

[0012] As a further improvement to the above technical solution, based on the starting cluster number information in the directory entry, the subdirectory entry needs to be searched in the starting sector, the information of the subdirectory entry is extracted to form its child node chain, and the construction of all nodes is completed through recursion to form a file directory tree data structure.

[0013] Secondly, the present invention also provides a system and method for erasing data from used mobile phones and computers, comprising the following steps: Obtain disk information for a used computer, including capacity, partitioning, and file system. The disk sector read and write operations are performed based on the disk information to determine the read and write performance of the disk information. If the read fails, there are bad blocks in some parts of the disk. If the read is normal, the function returns the number of bytes read after the operation is completed. If an exception occurs, it is determined that there are bad blocks in the disk, and the number of bytes returned after the read operation is completed is inconsistent with the number of bytes pre-set. Before writing data to the disk, the original data is migrated and written back. The data written to the disk is read, and the consistency between the read data and the pre-written data is compared. If they are consistent, there are no bad blocks in the write operation area of ​​the disk. Otherwise, it is determined that there are bad blocks in the area. The disk read operation is that after the read function in the program issues a read command, it reads the disk device through the disk controller and the driver part. Perform data clearing or recovery operations based on disk information and read / write performance.

[0014] This invention provides a system and method for clearing data from used mobile phones and computers. By acquiring the disk information of the used computer, read and write operations are performed on disk sectors based on this information to determine the disk's read / write performance. If a read operation fails, bad blocks are found in some areas of the disk. If the read operation is successful, the function returns the preset number of bytes read. If an exception occurs, bad blocks are found on the disk, and the number of bytes returned after the read operation is inconsistent with the preset number. Before writing data to the disk, the original data is migrated and written back. The data written to the disk is read, and its consistency is compared with the pre-written data. If they are consistent, there are no bad blocks in the write operation area of ​​the disk; otherwise, bad blocks are found in that area. Based on the disk information and read / write performance, the stored data is cleared or restored, thereby improving the accuracy of disk data detection and data security. Attached Figure Description

[0015] To more clearly illustrate the technical solutions of the embodiments of the present invention, the accompanying drawings used in the embodiments will be briefly introduced below. It should be understood that the following drawings only show some embodiments of the present invention and should not be regarded as a limitation on the scope. For those skilled in the art, other related drawings can be obtained based on these drawings without creative effort.

[0016] Figure 1 This is a structural block diagram of the data erasure system for used mobile phones and computers according to the present invention; Figure 2 This is a flowchart of the read operation of the present invention; Figure 3 This is a flowchart illustrating the execution process of the data recovery unit of the present invention. Figure 4This is a flowchart of the data erasure method for second-hand mobile phones and computers according to the present invention. Detailed Implementation

[0017] Embodiments of the present invention are described in detail below. Examples of these embodiments are shown in the accompanying drawings, wherein the same or similar reference numerals denote the same or similar elements or elements having the same or similar functions throughout. The embodiments described below with reference to the accompanying drawings are exemplary and are only used to explain the present invention, and should not be construed as limiting the present invention.

[0018] See Figure 1 This invention provides a data erasure system for used mobile phones and computers, comprising: The disk information acquisition module is used to acquire disk information of the used computer, including capacity, partitioning, and file system. The disk detection module is used to perform read and write operations on disk sectors based on disk information to determine the read and write performance of disk information. If the read fails, bad blocks exist in some parts of the disk. If the read is normal, the function returns the number of bytes read after the operation is completed. If an exception occurs, it is determined that bad blocks exist on the disk, and the number of bytes returned after the read operation is completed is inconsistent with the number of bytes pre-set. Before writing data to the disk, the original data is migrated and written back. The data written to the disk is read, and the consistency between the read data and the pre-written data is compared. If they are consistent, there are no bad blocks in the write operation area of ​​the disk. Otherwise, it is determined that there are bad blocks in the area. The disk read operation is performed by the read function in the program issuing a read command, which is then read from the disk device through the disk controller and the driver. The data clearing module is used to clear or restore stored data based on disk information and read / write performance.

[0019] See Figure 2 Optionally, the disk detection module also includes the following during the read operation: S1: When performing a read operation, the number of reads for each block is counted. When the number of reads for the corresponding module of the disk reaches the preset threshold, the read and refresh operation of the migration data is triggered. The blocks containing valid pages in the current die are traversed, and the block numbers are sorted in ascending order by the number of erases, and then in descending order by the number of reads. Then, they are divided into eight categories and reverse matching is performed to obtain the optimal number of reads for each block. S2: Match the tolerable number of reads for the available inbound block with the number of reads for the data pages in the outbound block, where the tolerable number of reads = the optimal number of reads - the current number of reads; S3: Traverse the valid pages in the outgoing block and perform page movement operations to distribute the data to the matching incoming block.

[0020] In this embodiment, block numbers are sorted in ascending order by erase count, then in descending order by read count. These blocks are then divided into eight categories for reverse matching to obtain the optimal read count for each block. This includes: sorting the block numbers containing valid pages in ascending order by read count and in descending order by error rate characteristics; matching blocks with low error rates and high read counts to obtain the optimal read count. The optimal read count is obtained through a mathematical model, assuming there are n blocks on the disk, and each block has m pages. , and Let be the number of reads, bit error rate, and number of bit errors for the j-th page in the i-th block, respectively. The expression for the read error rate caused by read interference is: ,in This is a constant related to the disk's factory characteristics to reflect the positive impact of the number of reads on the bit error rate. The unique attribute of the i-th block represents the difference in the original bit error rate of each block, i.e., the number of erases; the expression for the number of read errors caused by read interference to a page depends on the number of reads of other pages in the same block is as follows: , where R and W represent the total number of reads and the number of bit errors for the entire system.

[0021] It's important to note that disk access is performed on a sector-by-sector basis, with each sector typically containing 512 bytes. During disk operation, the platters rotate at high speed around the spindle, while the read / write head essentially floats in a short air layer above the platters. Writing to a disk sector overwrites or corrupts the existing data. Therefore, protecting the original data is crucial. Before writing, the original data needs to be migrated to another location, and then written back afterward. For handling exceptional situations, such as sudden program termination or exit, the program needs to be able to detect and handle these exceptions, ensuring data is promptly written back to its original location. After the write operation is complete, the data written to the disk needs to be read promptly, and then compared with the data prepared for writing. If they match, it indicates the absence of bad blocks in that area; otherwise, bad blocks are identified, and further processing is required. Detecting bad blocks incurs a time cost; adding caching protects against data corruption and increases read / write frequency. Before erasing data from a used mobile phone or computer, it is necessary to test its internal storage media, perform data recovery, or extract important data such as the operating system to ensure data security.

[0022] Optionally, the disk testing module includes a read / write test unit, and the execution process of the read / write test unit includes: Select the size of the test block, which is the number of bytes read by the read function each time. Position the read pointer to the starting block of the disk, and the read function reads the contents of the block area into the buffer. The read pointer moves to the next block area and the operation is repeated until the last block is read.

[0023] In this embodiment, read / write performance is a crucial performance indicator for the disk. Computer disks need to continuously handle frequent user operations in daily life, and disk read / write performance directly impacts user experience. Disk read / write performance is primarily characterized by sequential read / write and random read / write. Read / write performance testing mainly measures the average sequential read / write rate of the disk. A test curve is used to visually reflect disk performance. Read tests count the number of bytes completed in a read operation per unit of time. Write tests are similar to read tests, but unlike read tests, direct write operations will destroy data on the disk. During testing, a new file is created, data is written to the new file, and then the file is deleted. This avoids destroying existing data. Since large files may be non-contiguous in disk storage, the target file size has a certain impact on the test results. Creating a set of files of different sizes and testing with a group of such files can better reflect the problem.

[0024] See Figure 3 Optionally, the disk detection module also includes a data recovery unit, the execution process of which includes: S10: Read the cluster run list under the 80H attribute in the MFT entry, obtain the starting cluster number and cluster number of each cluster run structure, and iterate through all MFT entries in each MFT region. S11: Obtain the MFT table entry of the user file, construct a node data structure, and read the file name, directory name, file record reference number and parent directory file record reference number; S12: Determine if the parent directory file record reference number is 0x05. If it is, the parent directory is the root directory, and insert the node into the root directory of the directory tree. If not, proceed to the next step. S13: Obtain the MFT entry of the parent directory file based on its MFT reference number. Read the file name or directory name and use a search function to search for the existence of the parent directory file in the constructed directory tree. If it exists, insert it into the directory tree according to the rules. Otherwise, construct a new node based on the parent directory file. Repeat the above process until the parent directory MFT reference number is 0x05. Check its existence and insert it into the directory tree according to the rules. If it exists, return to continue reading the next MFT entry.

[0025] In this embodiment, the directory tree reconstruction algorithm process includes: when searching the directory tree, if the target is a directory node, when searching under a directory node, the same-level sequential search is performed according to a preset search method. If a file node is found in a child node, then the subsequent node at this level is a file node, and the process jumps directly to the next level. After the target tree structure is constructed, the target file is searched in the stored binary directory tree. After finding the target file node, the corresponding MFT record starting sector is entered, and the content of the data attributes is read and saved to the corresponding path. If the target is a folder, the directory hierarchy is established sequentially under the new path, and all file data under the directory file node is restored and saved to the established corresponding directory. Based on the starting cluster number information in the directory entry, the subdirectory entries need to be searched in the starting sector. The information of the subdirectory entries is extracted to form its child node chain. The construction of all nodes is completed through recursion to form the file directory tree data structure.

[0026] It should be noted that the information in the MFT file record is stored in the form of file attributes. Each attribute corresponds to an attribute number, such as the file name attribute being 30H and the data attribute being 80H. The attribute values ​​can be directly stored in the MFT table. Since each MFT table entry has a fixed size of 1KB, sometimes a large amount of attribute data can cause space shortage in the MFT table entry. In this case, the system can allocate additional disk clusters to store this data, and the MFT table entry retains the index information of these data storage locations.

[0027] See Figure 4 The present invention also provides a system and method for erasing data from used mobile phones and computers, comprising the following steps: S20: Obtain disk information for a used computer, including capacity, partitioning, and file system. S21: Perform read and write operations on disk sectors based on disk information to determine the read and write performance of disk information. If the read fails, there are bad blocks in some parts of the disk. If the read is normal, the function returns the number of bytes read after the operation is completed. If an exception occurs, it is determined that there are bad blocks in the disk, and the number of bytes returned after the read operation is completed is inconsistent with the number of bytes pre-set. Before writing data to the disk, migrate the original data and write the original data back. Read the data written to the disk and compare the consistency between the read data and the pre-written data. If they are consistent, there are no bad blocks in the write operation area of ​​the disk. Otherwise, it is determined that there are bad blocks in the area. The disk read operation is that after the read function in the program issues a read command, it reads the disk device through the disk controller and the driver part. S22: Perform clearing or recovery operations on the stored data based on disk information and read / write performance.

[0028] In this embodiment, the detection result needs to display the bad sector situation of sector units and compile a bad sector table. To visually demonstrate the effect, the size of the bad blocks needs to be defined. From the perspective of detection efficiency, it is necessary to consider detecting in units of disk blocks much larger than the sector capacity. The bad block size is an integer multiple of the sector size and can be changed according to actual conditions. If the total disk capacity varies greatly, testing two different disks will result in different user experiences. Since the bad block coverage of the disk being detected in practice is usually not high, if the selected detection unit capacity is too small, the number of erroneous operations on the disk during detection will increase, which will affect detection efficiency. The selection of the detection unit capacity, i.e., the bad block size, is also very important. For example, values ​​such as 1M or 100K can be used. Bad blocks only exist during the detection process and are detected according to unit size. This can be seen as dividing the disk into a finite number of detection units, thereby improving the accuracy of disk data detection and data security.

[0029] In all examples shown and described herein, any specific values ​​should be interpreted as merely exemplary and not as limitations; therefore, other examples of exemplary embodiments may have different values.

[0030] It should be noted that similar labels and letters in the following figures indicate similar items. Therefore, once an item is defined in one figure, it does not need to be further defined and explained in subsequent figures.

[0031] The embodiments described above are merely examples of several implementations of the present invention, and while the descriptions are specific and detailed, they should not be construed as limiting the scope of the present invention. It should be noted that those skilled in the art can make various modifications and improvements without departing from the concept of the present invention, and these modifications and improvements all fall within the scope of protection of the present invention.

Claims

1. A data erasure system for used mobile phones and computers, characterized in that, include: The disk information acquisition module is used to acquire disk information of the used computer, including capacity, partitioning, and file system. The disk detection module is used to perform read and write operations on disk sectors based on disk information to determine the read and write performance of disk information. If the read fails, bad blocks exist in some parts of the disk. If the read is normal, the function returns the number of bytes read after the operation is completed. If an exception occurs, it is determined that bad blocks exist on the disk, and the number of bytes returned after the read operation is completed is inconsistent with the number of bytes pre-set. Before writing data to the disk, the original data is migrated and written back. The data written to the disk is read, and the consistency between the read data and the pre-written data is compared. If they are consistent, there are no bad blocks in the write operation area of ​​the disk. Otherwise, it is determined that there are bad blocks in the area. The disk read operation is performed by the read function in the program issuing a read command, which is then read from the disk device through the disk controller and the driver. The data clearing module is used to clear or restore stored data based on disk information and read / write performance. The disk detection module also includes the following during the read operation: During read operations, the number of reads for each block is counted. When the number of reads for a disk module reaches a preset threshold, the read and refresh operation of the migration data is triggered. The blocks containing valid pages in the current die are traversed, and the block numbers are sorted in ascending order by the number of erases, then in descending order by the number of reads. Then, they are divided into eight categories and reverse matching is performed to obtain the optimal number of reads for each block. Match the tolerable number of reads for the available inbound blocks with the number of reads for the data pages in the outbound blocks, where the tolerable number of reads = the optimal number of reads - the current number of reads; Iterate through the valid pages in the outgoing block and perform page movement operations to distribute the data to the matching incoming block; The optimal number of reads is determined using a mathematical model, assuming there are n blocks on the disk, and each block has m pages. , and Let be the number of reads, bit error rate, and number of errors for the j-th page in the i-th block, respectively. The expression for the read bit error rate caused by read interference is: ,in This is a constant related to the disk's factory characteristics to reflect the positive impact of the number of reads on the bit error rate. This represents the unique attribute of the i-th block, and measures the difference in the original bit error rate of each block, i.e., the number of erasures. The expression for the number of read errors caused by read interference on a page, which depends on the number of reads from other pages in the same block, is as follows: , where W represents the total number of bit errors in the entire system.

2. The data erasure system for second-hand mobile phones and computers according to claim 1, characterized in that, The block numbers are sorted in ascending order of erase count, then in descending order of read count. These are then divided into eight categories for reverse matching to obtain the optimal read count for each block, including: The sequence numbers of blocks containing valid pages are sorted in ascending order by the number of reads and in descending order by the error rate feature. Blocks with low error rates and high read counts are matched to obtain the optimal number of reads.

3. The data erasure system for second-hand mobile phones and computers according to claim 1, characterized in that, The disk testing module includes a read / write test unit, and the execution process of the read / write test unit includes: Select the size of the test block, which is the number of bytes read by the read function each time. Position the read pointer to the starting block of the disk, and the read function reads the contents of the block area into the buffer. The read pointer moves to the next block area and the operation is repeated until the last block is read.

4. The data erasure system for second-hand mobile phones and computers according to claim 1, characterized in that, The disk detection module also includes a data recovery unit, the execution process of which includes: Read the cluster run list under the 80H attribute in the MFT entry, obtain the starting cluster number and cluster number of each cluster run structure, and iterate through all MFT entries in each MFT region. Obtain the MFT entries of the user files, construct a node data structure, and read the file name, directory name, file record reference number, and parent directory file record reference number; Determine if the parent directory file record reference number is 0x05. If it is, the parent directory is the root directory, and insert the node into the root directory of the directory tree. Otherwise, proceed to the next step. Retrieve the MFT entry of the parent directory file based on its MFT reference number. Read the file name or directory name and use a search function to search for the existence of the parent directory file in the constructed directory tree. If it exists, insert it into the directory tree according to the rules. Otherwise, construct a new node based on the parent directory file. Repeat the above process until the parent directory's MFT reference number is 0x05. Check its existence and insert it into the directory tree according to the rules. If it exists, return to continue reading the next MFT entry.

5. The data erasure system for second-hand mobile phones and computers according to claim 4, characterized in that, The directory tree reconstruction algorithm process includes: When searching a directory tree, if the target of the search is a directory node, when searching under a directory node, the search is performed in the same layer order according to the preset search method. If a file node is found in the child node, then the subsequent node of this layer is a file node, and the search jumps directly to the next layer.

6. The data erasure system for second-hand mobile phones and computers according to claim 5, characterized in that, After constructing the target tree structure, the target file is searched in the stored binary directory tree. Once the target file node is found, the corresponding MFT record starting sector is entered, and the data attribute content is read and saved to the corresponding path. If the target is a folder, the directory hierarchy is established in the new path, and all file data under the directory file node is restored and saved to the corresponding directory that has been established.

7. The data erasure system for second-hand mobile phones and computers according to claim 6, characterized in that, Based on the starting cluster number information in the directory entry, we need to find the subdirectory entry in the starting sector, extract the information of the subdirectory entry to form its child node chain, and complete the construction of all nodes through recursion to form the file directory tree data structure.

8. A method for erasing data on used mobile phones and computers based on a used mobile phone and computer data erasure system according to any one of claims 1-7, characterized in that, Includes the following steps: Obtain disk information for a used computer, including capacity, partitioning, and file system. The disk sector read and write operations are performed based on the disk information to determine the read and write performance of the disk information. If the read fails, there are bad blocks in some parts of the disk. If the read is normal, the function returns the number of bytes read after the operation is completed. If an exception occurs, it is determined that there are bad blocks in the disk, and the number of bytes returned after the read operation is completed is inconsistent with the number of bytes pre-set. Before writing data to the disk, the original data is migrated and written back. The data written to the disk is read, and the consistency between the read data and the pre-written data is compared. If they are consistent, there are no bad blocks in the write operation area of ​​the disk. Otherwise, it is determined that there are bad blocks in the area. The disk read operation is that after the read function in the program issues a read command, it reads the disk device through the disk controller and the driver part. Perform data clearing or recovery operations based on disk information and read / write performance.

Images