Hard disk scanning detection method

[0019]In order to make the purpose, content, and advantages of the present invention clearer, the specific embodiments of the present invention will be described in further detail below with reference to the accompanying drawings and embodiments.

[0020]The basic idea of ​​the block scanning detection method is the same as that of other hard disk erasing and writing technologies. By issuing a data read command to the hard disk, find the bad sectors of the hard disk that cannot read data, and use the ECC mechanism to perform Status mark, and then Remap the data on the sector, and restore the data to a good sector.

[0021]Such asimage 3As shown, the strategy of the block scanning method is: First, the hard disk is divided into N sections of the same size (Section), the addresses between the regions are continuous, and the size of the region depends on factors such as hard disk capacity, hard disk speed, and hard disk brand. Then divide the data in each area into M data blocks of uniform size, and the addresses between the data blocks are also continuous. After the data is divided into blocks, the block scanning method scans the hard disk in a jumping manner. The block scanning method is the same as the full disk scanning method and the random scanning method. It still reads the data to find bad sectors of the hard disk data. However, the block scanning method jumps an area each time it scans, and it is also in each area every time. Scan only one data block BlockNM, until the last area is scanned, a small scan cycle is over, and then start scanning from the next data block in the first area until the last data block in the last area is scanned. , A total scan cycle ends.

[0022]The scanning detection process in this embodiment is as follows:

[0023]1. Determine the scan cycle T of the hard disk based on the hard disk scanning cost, the value of the data stored in the hard disk, and the failure rate of the hard disk;

[0024]2. Assuming that the current time point is Tc and the time point of the last scan is Ts, if Tc-Ts

[0025]3. Reset the hard disk scan parameters: waiting time time, data block size block_size, start address address, area size section_size, area number section_num;

[0026]4. Reset area position section_pos=0 and offset of start address offset=0;

[0027]5. If there is a user request on the hard disk, wait for a preset time constant Tw;

[0028]6. Send a hard disk read request, the requested area address is address+(section_pos*section_size)+(block_size*offset), and the size is block_size;

[0029]7. After the read request is completed, check the potential error address (fault_address) reported in the information;

[0030]8. If there is an error in the fault_address sector, start the repair command REASSIGN BLOCK to repair this sector;

[0031]9. section_pos=section_pos+1;

[0032]10. If section_pos

[0033]11. Offset=offset+1, reset area position section_pos=0;

[0034]12. If offset

[0035]13. Once the scanning process is over, go to step 2 and wait for the next scan to start.

[0036]According to the above process, the entire process of scanning and detecting hard disk blocks is completed.

[0037]The above are only the preferred embodiments of the present invention. It should be pointed out that for those of ordinary skill in the art, without departing from the technical principles of the present invention, several improvements and modifications can be made. These improvements and modifications It should also be regarded as the protection scope of the present invention.