CN107797940A - A kind of restoration methods for hard disc data area of Toshiba can not be accessed - Google Patents

A kind of restoration methods for hard disc data area of Toshiba can not be accessed Download PDF

Info

Publication number
CN107797940A
CN107797940A CN201711162816.4A CN201711162816A CN107797940A CN 107797940 A CN107797940 A CN 107797940A CN 201711162816 A CN201711162816 A CN 201711162816A CN 107797940 A CN107797940 A CN 107797940A
Authority
CN
China
Prior art keywords
address
logical segment
byte
segment bit
read
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.)
Granted
Application number
CN201711162816.4A
Other languages
Chinese (zh)
Other versions
CN107797940B (en
Inventor
梁效宁
董超
杨先珉
Current Assignee (The listed assignees may be inaccurate. Google has not performed a legal analysis and makes no representation or warranty as to the accuracy of the list.)
Sichuan Art Beats Nature Information Security Intelligent Equipment Co Ltd
Original Assignee
Sichuan Art Beats Nature Information Security Intelligent Equipment Co Ltd
Priority date (The priority date 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 date listed.)
Filing date
Publication date
Application filed by Sichuan Art Beats Nature Information Security Intelligent Equipment Co Ltd filed Critical Sichuan Art Beats Nature Information Security Intelligent Equipment Co Ltd
Priority to CN201711162816.4A priority Critical patent/CN107797940B/en
Publication of CN107797940A publication Critical patent/CN107797940A/en
Application granted granted Critical
Publication of CN107797940B publication Critical patent/CN107797940B/en
Active legal-status Critical Current
Anticipated expiration legal-status Critical

Links

Classifications

    • GPHYSICS
    • G06COMPUTING; CALCULATING OR COUNTING
    • G06FELECTRIC DIGITAL DATA PROCESSING
    • G06F12/00Accessing, addressing or allocating within memory systems or architectures
    • G06F12/02Addressing or allocation; Relocation
    • G06F12/08Addressing or allocation; Relocation in hierarchically structured memory systems, e.g. virtual memory systems
    • G06F12/0802Addressing of a memory level in which the access to the desired data or data block requires associative addressing means, e.g. caches
    • G06F12/0866Addressing of a memory level in which the access to the desired data or data block requires associative addressing means, e.g. caches for peripheral storage systems, e.g. disk cache
    • GPHYSICS
    • G06COMPUTING; CALCULATING OR COUNTING
    • G06FELECTRIC DIGITAL DATA PROCESSING
    • G06F3/00Input arrangements for transferring data to be processed into a form capable of being handled by the computer; Output arrangements for transferring data from processing unit to output unit, e.g. interface arrangements
    • G06F3/06Digital input from, or digital output to, record carriers, e.g. RAID, emulated record carriers or networked record carriers
    • G06F3/0601Interfaces specially adapted for storage systems
    • G06F3/0602Interfaces specially adapted for storage systems specifically adapted to achieve a particular effect
    • G06F3/0614Improving the reliability of storage systems
    • G06F3/0619Improving the reliability of storage systems in relation to data integrity, e.g. data losses, bit errors
    • GPHYSICS
    • G06COMPUTING; CALCULATING OR COUNTING
    • G06FELECTRIC DIGITAL DATA PROCESSING
    • G06F3/00Input arrangements for transferring data to be processed into a form capable of being handled by the computer; Output arrangements for transferring data from processing unit to output unit, e.g. interface arrangements
    • G06F3/06Digital input from, or digital output to, record carriers, e.g. RAID, emulated record carriers or networked record carriers
    • G06F3/0601Interfaces specially adapted for storage systems
    • G06F3/0628Interfaces specially adapted for storage systems making use of a particular technique
    • G06F3/0638Organizing or formatting or addressing of data
    • GPHYSICS
    • G06COMPUTING; CALCULATING OR COUNTING
    • G06FELECTRIC DIGITAL DATA PROCESSING
    • G06F3/00Input arrangements for transferring data to be processed into a form capable of being handled by the computer; Output arrangements for transferring data from processing unit to output unit, e.g. interface arrangements
    • G06F3/06Digital input from, or digital output to, record carriers, e.g. RAID, emulated record carriers or networked record carriers
    • G06F3/0601Interfaces specially adapted for storage systems
    • G06F3/0668Interfaces specially adapted for storage systems adopting a particular infrastructure
    • G06F3/0671In-line storage system
    • G06F3/0673Single storage device
    • G06F3/0674Disk device
    • G06F3/0676Magnetic disk device

Landscapes

  • Engineering & Computer Science (AREA)
  • Theoretical Computer Science (AREA)
  • Physics & Mathematics (AREA)
  • General Engineering & Computer Science (AREA)
  • General Physics & Mathematics (AREA)
  • Human Computer Interaction (AREA)
  • Computer Security & Cryptography (AREA)
  • Signal Processing For Digital Recording And Reproducing (AREA)

Abstract

The invention discloses a kind of restoration methods for that can not access hard disc data area of Toshiba, it is characterised in that comprises the following steps:S1:Read the firmware area of hard disk and search DD module ids;S2:Using the first byte address of mark as initial address, 0x1FFFE bytes are redirected backward, and read and jump to the byte content of current address and latter byte content;S3:Judge whether above-mentioned two byte content is zero, if it is, jumping to step S1, otherwise perform step S4;S4:Using the latter byte address of mark as original position, it is the byte content that XX is multiplied by 8 to read byte length;S5:Using the latter byte address of mark as original position, 0x10000 bytes are redirected backward, and read the byte content that byte length is multiplied by 8 for XX;S6:It is determined that data needed for sector LBA physical address and reading need to be read.The present invention is by the physical address corresponding to the LBA of addressing logic sector and reads the data of the physical address, to reach the purpose for reading and recovering data, solves the problems, such as that prior art is present.

Description

A kind of restoration methods for hard disc data area of Toshiba can not be accessed
Technical field
The invention belongs to data recovery field, is related to a kind of restoration methods of hard disk, more particularly to a kind of for that can not visit Ask the restoration methods in hard disc data area of Toshiba.
Background technology
In the technical field of data recovery, defective storage medium is frequently encountered, causes that data can not be read, and Important data are all often priceless treasures for a user.
After bad track occurs in hard disk firmware area of Toshiba, easily cause DD module damages, cause the module afterbody check value and Data check value after module generation bad track changes, and causes module check value to mismatch, causes hard disk not to be identified, Or hard disk can be identified but data field can not be accessed.
In the prior art, the method that is typically integrally read using firmware area module is recovered, but if firmware There is bad track in the magnetic track where area's DD modules, module entirety reading manner will abandon the data of verification error, thus can not read Modulus block is effective, complete data.
The content of the invention
The present invention is in view of the shortcomings of the prior art and above mentioned problem, proposition are a kind of for that can not access hard disc data area of Toshiba Restoration methods, by the physical address corresponding to the LBA of addressing logic sector and read the data of the physical address, come reach read The purpose of data is taken and recovered, efficiently solves the problem of prior art is present, the described method comprises the following steps:
S1:Read the firmware area of the hard disk and search DD module id 0x02000000XX00FFFF, wherein, the XX For the hexadecimal number being arbitrarily not zero;
S2:Using the first byte address of the mark 0x02000000XX00FFFF as initial address, 0x1FFFE is redirected backward Byte, and read and jump to the byte content of current address and latter byte content;
S3:Judge whether two read byte contents are zero, if it is, jumping to step S1, otherwise perform step S4;
S4:Using the latter byte address of the mark 0x02000000XX00FFFF as initial address, byte length is read 8 byte content is multiplied by for the XX, wherein, the XX is the hexadecimal number being arbitrarily not zero;The content read is to patrol Section address table is collected, the logical segment bit address table is made up of multiple logical segment bit address, wherein, each logic section The length of location is eight bytes;
S5:Using the latter byte address of the mark 0x02000000XX00FFFF as initial address, redirect backward 0x10000 bytes, to jump to current address as initial address, it is the byte content that the XX is multiplied by 8 to read byte length, its In, the XX is the hexadecimal number being arbitrarily not zero;The byte content read is offset address table, the offset address table It is made up of multiple offset address, wherein, the length of each offset address is eight bytes;
S6:It is determined that data needed for sector LBA physical address and reading need to be read, wherein, the value of the LBA is entered for 16 Number processed.
Preferably, the logical segment bit address and the offset address since the highest byte of eight bytes to minimum Byte is read.
Preferably, in the logical segment bit address table, each logical segment bit address has unique group number position; In the offset address table, each offset address has unique group number position;Pass through group number position described in identical Put, the logical segment bit address each corresponds with the offset address.
Preferably, step S6 comprises the following steps:
S601:Judge whether the value of the sector LBA is equal to any logic section in the logical segment bit address table Address, if it is, the value of the sector LBA is equal to the physical address of the sector LBA, perform step S605;Otherwise, perform Step S602;
S602:The first logical segment bit address of the value less than the sector LBA is searched in the logical segment bit address table And the second logical segment bit address of the value more than the sector LBA, determine the first logical segment bit address in the logical segment Group number position N in bit address table, wherein, the first logical segment bit address is adjacent with the second logical segment bit address Logical segment bit address, N are the natural number more than zero;
S603:According to the group number position N of the first logical segment bit address in the logical segment bit address table, Find the offset address included in identical group number position N in offset address table, the as described sector LBA skew Location;
S604:Value of the physical address of the sector LBA equal to the sector LBA adds the sum of the offset address;
S605:According to the physical address of the sector LBA, the data of the sector LBA are read.
Preferably, the logical segment bit address table includes whole logical segment bit address of the hard disk.
Each corresponded preferably, the offset address table includes each logical segment bit address in the hard disk The offset address.
The beneficial effects of the invention are as follows:By the physical address corresponding to the LBA of addressing logic sector and read this physically The data of location, to reach the purpose for reading and recovering data, solve the problems, such as that prior art is present.
Brief description of the drawings
Fig. 1 is the main flow chart of the present invention;
Fig. 2 is the mark of DD modules and the data structure diagram of logical address section table in the embodiment of the present invention;
Fig. 3 is to be addressed in the embodiment of the present invention and read the data structure diagram of two bytes;
Fig. 4 is the data structure diagram of offset address table in the embodiment of the present invention;
Fig. 5 be the present invention in determine sector LBA physical address and reading needed for data flow chart.
Embodiment
The present invention is further elaborated with reference to the accompanying drawings and examples.
As shown in figure 1, a kind of restoration methods for that can not access hard disc data area of Toshiba, comprise the following steps:
S1:Read the firmware area of hard disk and search DD module id 0x02000000XX00FFFF, wherein, the XX is to appoint The hexadecimal number that meaning is not zero:
Fig. 2 shows the data structure diagram of DD module ids and logical address section table in the present embodiment.As shown in Fig. 2 XX value is 0x13, and DD module ids are 0x020000001300FFFF, as shown in the content of black rectangle frame in Fig. 2;
S2:Using mark 0x020000001300FFFF first byte address as initial address, 0x1FFFE words are redirected backward Section, and read and jump to the byte content of current address and latter byte content, as shown in heavy black part in Fig. 3, this implementation In example, two byte content is 0x21E6;
S3:Judge whether two read byte contents are zero, if it is, jumping to step S1, search DD modules again Mark, otherwise perform step S4;
S4:As shown in Fig. 2 using the latter byte address for identifying 0x020000001300FFFF as initial address, word is read Section length is the byte content that 0x13 is multiplied by 8, i.e. byte length 0x98, as shown in Fig. 2 initial address is 0x00000008, End address is 0x0000009F;The content read is logical segment bit address table, and logical segment bit address table is by multiple logical segments Bit address forms, wherein, the length of each logical segment bit address is eight bytes, and eight bytes as shown in heavy black in Fig. 2 are each Logical segment bit address is read since the highest byte of eight bytes to lowest byte, therefore, the two logical segment bit address point It is not 0x000000003AC74858 and 0x0000000037C9BBD0;
S5:Using the latter byte address for identifying 0x020000001300FFFF as initial address, 0x10000 words are redirected backward Section, as shown in figure 4, to jump to current address 0x00010008 as initial address, it is the word that 0x13 is multiplied by 8 to read byte length Save content, i.e. byte length 0x98, as shown in figure 4, initial address is 0x00010008, end address 0x0001009F; The byte content read is offset address table, and offset address table is made up of multiple offset address, wherein, each offset address Length is eight bytes, eight bytes as shown in heavy black in Fig. 4, each offset address since the highest byte of eight bytes to Lowest byte read, therefore, the two offset address be respectively 0x00000000000CA320 and 0x00000000000CD590;
S6:It is determined that data needed for sector LBA physical address and reading need to be read, wherein, LBA value is hexadecimal Number;In the present embodiment, by taking the LBA=976773167 of sector as an example, 976773167 to be converted to hexadecimal be 0x3A38602F, should Step S6 includes following steps as shown in Figure 5:
S601:Whether equal to any logic section in logical segment bit address table to judge sector LBA value 0x3A38602F Location, if it is, sector LBA value 0x3A38602F is equal to sector LBA physical address 0x3A38602F, perform step S605;Otherwise, step S602 is performed;
S602:The first logical segment bit address less than 0x3A38602F is searched in logical segment bit address table and is more than 0x3A38602F the second logical segment bit address, determine group number position of the first logical segment bit address in logical segment bit address table N, wherein, the first logical segment bit address is adjacent logical segment bit address with the second logical segment bit address, and N is the nature more than zero Number;As shown in Fig. 2 0x3A38602F is more than the first logical segment bit address 0x0000000037C9BBD0 and is less than the second logical segment Bit address 0x000000003AC74858, the first logical segment bit address 0x0000000037C9BBD0 and the second logical segment bit address 0x000000003AC74858 is adjacent logical segment bit address, in the present embodiment, the first logical segment bit address 0x0000000037C9BBD0 group number position is 17, i.e. the 17th eight bytes since initial address is 0x00000008 Logical segment bit address;
S603:According to group number positions of the first logical segment bit address 0x0000000037C9BBD0 in logical segment bit address table 17 are put, the offset address included in identical group number position 17, as sector 0x3A38602F are found in offset address table Offset address;As shown in figure 4, the offset address of the 17th eight bytes since initial address is 0x00010008 0x00000000000CA320, as sector 0x3A38602F offset address;
S604:Value of the sector LBA physical address equal to sector LBA adds the sum of offset address, i.e. 0x3A38602F+ 0x00000000000CA320=0x000000003A45034F;
S605:According to sector LBA physical address, the number of the data in the physical address, as sector LBA is read According to.
It should be appreciated that the invention is not restricted to above-mentioned citing, for those of ordinary skills, can basis Described above is improved or converted, and all these modifications and variations should all belong to the protection model of appended claims of the present invention Enclose.

Claims (6)

1. a kind of restoration methods for hard disc data area of Toshiba can not be accessed, it is characterised in that comprise the following steps:
S1:Read the firmware area of the hard disk and search DD module id 0x02000000XX00FFFF, wherein, the XX is to appoint The hexadecimal number that meaning is not zero;
S2:Using the first byte address of the mark 0x02000000XX00FFFF as initial address, 0x1FFFE words are redirected backward Section, and read and jump to the byte content of current address and latter byte content;
S3:Judge whether two read byte contents are zero, if it is, jumping to step S1, otherwise perform step S4;
S4:Using the latter byte address of the mark 0x02000000XX00FFFF as initial address, it is institute to read byte length The byte content that XX is multiplied by 8 is stated, wherein, the XX is the hexadecimal number being arbitrarily not zero;The content read is logical segment Bit address table, the logical segment bit address table are made up of multiple logical segment bit address, wherein, each logical segment bit address Length is eight bytes;
S5:Using the latter byte address of the mark 0x02000000XX00FFFF as initial address, 0x10000 words are redirected backward Section, to jump to current address as initial address, it is the byte content that the XX is multiplied by 8 to read byte length, wherein, the XX For the hexadecimal number being arbitrarily not zero;The byte content read is offset address table, and the offset address table is by multiple inclined Address composition is moved, wherein, the length of each offset address is eight bytes;
S6:It is determined that data needed for sector LBA physical address and reading need to be read, wherein, the value of the LBA is hexadecimal Number.
A kind of 2. restoration methods for hard disc data area of Toshiba can not be accessed according to claim 1, it is characterised in that The logical segment bit address and the offset address are read since the highest byte of eight bytes to lowest byte.
A kind of 3. restoration methods for hard disc data area of Toshiba can not be accessed according to claim 2, it is characterised in that In the logical segment bit address table, each logical segment bit address has unique group number position;In the offset address table, Each offset address has unique group number position;By group number position described in identical, the logic section Location each corresponds with the offset address.
A kind of 4. restoration methods for hard disc data area of Toshiba can not be accessed according to claim 3, it is characterised in that The step S6 comprises the following steps:
S601:Judge whether the value of the sector LBA is equal to any logical segment bit address in the logical segment bit address table, If it is, the value of the sector LBA is equal to the physical address of the sector LBA, step S605 is performed;Otherwise, step is performed S602;
S602:The first logical segment bit address of the value less than the sector LBA and big is searched in the logical segment bit address table In the second logical segment bit address of the value of the sector LBA, determine the first logical segment bit address in the logic section Group number position N in the table of location, wherein, the first logical segment bit address and the second logical segment bit address are adjacent logic Section address, N are the natural number more than zero;
S603:According to the group number position N of the first logical segment bit address in the logical segment bit address table, offseting The offset address included in identical group number position N, the as described sector LBA offset address are found in address table;
S604:Value of the physical address of the sector LBA equal to the sector LBA adds the sum of the offset address;
S605:According to the physical address of the sector LBA, the data of the sector LBA are read.
A kind of 5. restoration methods for hard disc data area of Toshiba can not be accessed according to claim 4, it is characterised in that The logical segment bit address table includes whole logical segment bit address of the hard disk.
A kind of 6. restoration methods for hard disc data area of Toshiba can not be accessed according to claim 5, it is characterised in that The offset address table include the hard disk in each logical segment bit address each correspondingly the offset address.
CN201711162816.4A 2017-11-21 2017-11-21 Recovery method for Toshiba hard disk data area incapable of being accessed Active CN107797940B (en)

Priority Applications (1)

Application Number Priority Date Filing Date Title
CN201711162816.4A CN107797940B (en) 2017-11-21 2017-11-21 Recovery method for Toshiba hard disk data area incapable of being accessed

Applications Claiming Priority (1)

Application Number Priority Date Filing Date Title
CN201711162816.4A CN107797940B (en) 2017-11-21 2017-11-21 Recovery method for Toshiba hard disk data area incapable of being accessed

Publications (2)

Publication Number Publication Date
CN107797940A true CN107797940A (en) 2018-03-13
CN107797940B CN107797940B (en) 2021-02-23

Family

ID=61536161

Family Applications (1)

Application Number Title Priority Date Filing Date
CN201711162816.4A Active CN107797940B (en) 2017-11-21 2017-11-21 Recovery method for Toshiba hard disk data area incapable of being accessed

Country Status (1)

Country Link
CN (1) CN107797940B (en)

Cited By (2)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN109492001A (en) * 2018-10-15 2019-03-19 四川巧夺天工信息安全智能设备有限公司 A method of crumb data in ACCESS database is extracted in classification
CN113971964A (en) * 2020-07-24 2022-01-25 深圳市江波龙电子股份有限公司 Data recovery method, storage device and terminal device

Citations (5)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN101075457A (en) * 2006-05-16 2007-11-21 明基电通股份有限公司 Method for burning data in recording areas with fixed volumes of disc additionally
CN101727295A (en) * 2008-10-31 2010-06-09 西安奇维测控科技有限公司 Method for writing in and reading out data based on virtual block flash memory address mapping
CN105701093A (en) * 2014-11-24 2016-06-22 中兴通讯股份有限公司 Automaton -based pattern matching method and device
CN105702273A (en) * 2016-02-29 2016-06-22 四川效率源信息安全技术股份有限公司 Method for repairing front-good and back-bad fault of Hitachi hard disk
US9626288B2 (en) * 2013-08-14 2017-04-18 Skyera, Llc Address translation for a non-volatile memory storage device

Patent Citations (5)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN101075457A (en) * 2006-05-16 2007-11-21 明基电通股份有限公司 Method for burning data in recording areas with fixed volumes of disc additionally
CN101727295A (en) * 2008-10-31 2010-06-09 西安奇维测控科技有限公司 Method for writing in and reading out data based on virtual block flash memory address mapping
US9626288B2 (en) * 2013-08-14 2017-04-18 Skyera, Llc Address translation for a non-volatile memory storage device
CN105701093A (en) * 2014-11-24 2016-06-22 中兴通讯股份有限公司 Automaton -based pattern matching method and device
CN105702273A (en) * 2016-02-29 2016-06-22 四川效率源信息安全技术股份有限公司 Method for repairing front-good and back-bad fault of Hitachi hard disk

Non-Patent Citations (1)

* Cited by examiner, † Cited by third party
Title
冯云鹏等: "数据恢复技术中分区表恢复的研究与实现", 《计算机与信息技术》 *

Cited By (4)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN109492001A (en) * 2018-10-15 2019-03-19 四川巧夺天工信息安全智能设备有限公司 A method of crumb data in ACCESS database is extracted in classification
CN109492001B (en) * 2018-10-15 2021-10-01 四川巧夺天工信息安全智能设备有限公司 Method for extracting fragment data in ACCESS database in classified manner
CN113971964A (en) * 2020-07-24 2022-01-25 深圳市江波龙电子股份有限公司 Data recovery method, storage device and terminal device
CN113971964B (en) * 2020-07-24 2023-08-04 深圳市江波龙电子股份有限公司 Data recovery method, storage device and terminal device

Also Published As

Publication number Publication date
CN107797940B (en) 2021-02-23

Similar Documents

Publication Publication Date Title
US8495454B2 (en) Methods, apparatuses, systems, and architectures for quickly and reliably encoding and/or decoding system data
TWI516927B (en) Data writing method, memory controller and memory storage apparatus
TW201913686A (en) Error check correction decoding method and device
JP2007012058A (en) File system for storing transaction records in flash-like media
CN100461636C (en) Method and apparatus for decoding multiword information
JP2007012060A (en) File system having inverted hierarchical structure
JP2004281037A (en) Method and system for correcting data stored in storage medium and computer readable storage medium
CN101281788A (en) Flash memory system as well as control method thereof
CN107797940A (en) A kind of restoration methods for hard disc data area of Toshiba can not be accessed
US8477446B2 (en) Writing data to a tape
US20100205508A1 (en) Redundant Data in Storage Medium
CN106648948A (en) Restorative method aiming at damages of western digital hard disk number 11 module
US20100281000A1 (en) Method and apparatus for partial data set recovery
WO2015172698A1 (en) Data processing method and device
JP2007299393A (en) Method for reading and writing data to a plurality of layers of rotating storage medium, program and data storage device
US8924814B2 (en) Write management using partial parity codes
CN107329850A (en) It is a kind of to meet memory and date storage method that magnanimity reads and writes number of operations
CN104156276B (en) It is a kind of to prevent two pieces of RAID methods of disk failures
CN101414299A (en) Method and apparatus for repairing composite document
JP4336859B2 (en) Redundant drive group and writing method and data restoring method using the same
CN107315806A (en) A kind of embedded storage method and device based on file system
CN1918647A (en) Reproduction apparatus and method for reproducing a unique medium identifier
JP5808264B2 (en) Code generation apparatus, code generation method, and program
TW201740389A (en) Method for selecting bad columns within data storage media
CN112286720A (en) Method for extracting deleted data after TRIM command is started by solid state disk controlled by SM2246EN

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