CN103295645B - A kind of scanning detection method of dynamic storage and system - Google Patents
A kind of scanning detection method of dynamic storage and system Download PDFInfo
- Publication number
- CN103295645B CN103295645B CN201210042768.6A CN201210042768A CN103295645B CN 103295645 B CN103295645 B CN 103295645B CN 201210042768 A CN201210042768 A CN 201210042768A CN 103295645 B CN103295645 B CN 103295645B
- Authority
- CN
- China
- Prior art keywords
- data
- address
- write
- subspace
- scanning
- 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
- 238000001514 detection method Methods 0.000 title claims abstract description 35
- 238000012360 testing method Methods 0.000 claims abstract description 61
- 230000000052 comparative effect Effects 0.000 claims abstract description 23
- 238000000034 method Methods 0.000 claims abstract description 14
- 241001269238 Data Species 0.000 claims description 6
- 230000000875 corresponding effect Effects 0.000 description 15
- 230000002596 correlated effect Effects 0.000 description 1
- 238000010586 diagram Methods 0.000 description 1
- 238000010408 sweeping Methods 0.000 description 1
Abstract
The present invention, in storer detection technique field, provides a kind of scanning detection method and system of dynamic storage.Wherein method comprises: respectively under at least two kinds of different address scan patterns, data are write multiple scanning subspaces of dynamic storage; Under often kind of address scan pattern, after data being write multiple scanning subspace, read data respectively from multiple scanning subspace; The corresponding data of the data read with the multiple scanning subspace of write is compared, exports comparative result.The scanning detection method of dynamic storage provided by the invention adopts at least two kinds of different address scan patterns, as: word scan pattern, half-word scan pattern and byte scan pattern etc., respectively Scanning Detction is carried out to dynamic storage, can cover each access unit address of dynamic storage really, testing result is more accurate.
Description
Technical field
The invention belongs to storer detection technique field, particularly relate to a kind of scanning detection method and system of dynamic storage.
Background technology
Along with embedded product is more and more extensive in the application in the fields such as consumer electronics product, industry, security protection, dynamic storage (as: sdram, ddr, ddr2 etc.) is generally utilized to carry out code cache and operation at present, therefore need to carry out Scanning Detction to dynamic storage, to improve the reliabilty and availability of dynamic storage.Generally speaking, the surface sweeping of dynamic storage detects and comprises detection to dynamic storage data line, to the detection of dynamic storage storage unit and the detection to dynamic memory address line.
Wherein, the Scanning Detction mode detected dynamic memory address line that prior art provides adopts word pattern to detect, and the storage space of dynamic storage is divided into some scanning subspaces in units of word.After Scanning Detction starts, write a tentation data to every one scan subspace, after all data are all preserved in scanning subspace, by the data reading of every one scan subspace, and compare with tentation data, to check write data whether mistake.
This kind that prior art provides to the scanning detection method of the dynamic storage that dynamic memory address line detects owing to being detect with word pattern, adopt the scanning method of 4 byte-aligned, each access unit address of dynamic storage can not be covered really, the scanning of some storage unit is left in the basket, testing result out of true, cannot reflect the truth of dynamic memory address line and storage unit.
Above-mentioned information disclosed in this background technology this part is only for increasing the understanding to background technology of the present invention, and therefore it may comprise the prior art known to persons of ordinary skill in the art do not formed this state.
Summary of the invention
The object of the embodiment of the present invention is the scanning detection method providing a kind of dynamic storage, be intended to solve detecting with word pattern the scanning detection method of the dynamic storage that dynamic memory address line detects of providing of prior art, each access unit address of dynamic storage can not be covered really, make the problem that testing result degree of accuracy is low.
The embodiment of the present invention is achieved in that a kind of scanning detection method of dynamic storage, said method comprising the steps of:
Respectively under at least two kinds of different address scan patterns, data are write multiple scanning subspaces of dynamic storage;
Under often kind of address scan pattern, after by the described multiple scanning subspace of described data write, read data respectively from described multiple scanning subspace;
The corresponding data of the described data read with the described multiple scanning subspace of write is compared, exports comparative result.
Another object of the embodiment of the present invention is the scanning-detecting system providing a kind of dynamic storage, and described system comprises:
Data, for respectively under at least two kinds of different address scan patterns, are write multiple scanning subspaces of dynamic storage by the first data write unit;
Data-reading unit, under often kind of address scan pattern, after described first data write unit is by the described multiple scanning subspace of described data write, reads data from described multiple scanning subspace respectively;
Relatively output unit, the corresponding data that described data and described first data write unit for described data-reading unit being read write described multiple scanning subspace compares, output comparative result.
The scanning detection method of the dynamic storage that the embodiment of the present invention provides and system adopt at least two kinds of different address scan patterns, respectively Scanning Detction is carried out to dynamic storage, can cover each access unit address of dynamic storage really, testing result is more accurate.
Accompanying drawing explanation
Fig. 1 is the process flow diagram of the scanning detection method of the dynamic storage that the embodiment of the present invention provides;
Fig. 2 is the structural drawing of the scanning-detecting system of the dynamic storage that the embodiment of the present invention provides;
Fig. 3 is the structural drawing of the first data write unit in Fig. 2;
Fig. 4 is the structural drawing of the second data write unit in Fig. 2.
Embodiment
In order to make object of the present invention, technical scheme and advantage clearly understand, below in conjunction with drawings and Examples, the present invention is further elaborated.Should be appreciated that specific embodiment described herein only in order to explain the present invention, be not intended to limit the present invention.
For prior art Problems existing, the scanning detection method of the dynamic storage that the embodiment of the present invention provides adopts at least two kinds of different address scan patterns, detects respectively to dynamic storage.
Fig. 1 is the flow process of the scanning detection method of the dynamic storage that the embodiment of the present invention provides.
In step S101, respectively under at least two kinds of different address scan patterns, data are write multiple scanning subspaces of dynamic storage.
Wherein, address scan pattern can be word scan pattern, half-word scan pattern or byte scan pattern etc.Under word scan pattern, every one scan subspace of dynamic storage includes four storage unit, and for dynamic storage, the storage space storing 1 byte is a storage unit, that is to say, every one scan subspace of dynamic storage comprises 32 storage spaces; Under half-word scan pattern, every one scan subspace of dynamic storage includes two storage unit, namely comprises 16 storage spaces; Under byte scan pattern, every one scan subspace of dynamic storage includes a storage unit, namely comprises 8 storage spaces.
Wherein, the data writing multiple scanning subspace can be tentation data or random data, and the figure place of this tentation data or random data is different from the difference of scanning subspace size corresponding to different addresses scan pattern.In order to avoid the testing result that data rule makes the mistake, preferably, the data writing multiple scanning subspace are random data.
In step s 102, under often kind of address scan pattern, after data being write multiple scanning subspace, read data respectively from multiple scanning subspace.
In step s 103, the corresponding data of the data read with the multiple scanning subspace of write is compared, exports comparative result.
For example, data when the multiple scanning subspace of write are random data, and when dynamic storage being detected with word scan pattern, half-word scan pattern and byte scan pattern in turn respectively, under word scan pattern, step data being write multiple scanning subspaces of dynamic storage specifically can comprise the following steps: generate the first pointer variable current_pre that points to dynamic storage base address; Iterative algorithm is adopted to produce one 32 random data word_pattern; The 32 bit scan subspaces that the current address 32 the random data word_pattern produced being write the first pointer variable current_pre sensing generated starts; Calculate the first pointer variable current_pre, make the first pointer variable current_pre point to the first address of lower one scan subspace; Shifting algorithm is adopted to produce another 32 random data word_pattern '; The 32 bit scan subspaces that the current address another 32 the random data word_pattern ' produced being write the first pointer variable current_pre sensing starts, return calculating first pointer variable current_pre afterwards, the first pointer variable current_pre is made to point to the step of the first address of lower one scan subspace, circulation like this, until all random data is all preserved in scanning subspace.
Wherein, the step adopting shifting algorithm to produce another 32 random data word_pattern ' comprises the following steps again: current 32 random data are moved to left 5; Current 32 random data are moved to right 27; By move to left the data after 5 with move to right the data phase after 27 or; By mutually or after 32 random data be added with 32 random data word_pattern that employing iterative algorithm produces, obtain another 32 random data word_pattern ', namely can be expressed as:
word_pattern′＝((word_pattern′＜＜5|word_pattern′＞＞27))+word_pattern
Further, comprehensive scanning in order to ensure storage unit covers, in the embodiment of the present invention, under word scan pattern, after the step that the data read and the corresponding data of the multiple scanning subspace of write are compared, can also comprise the following steps: calculate the first pointer variable, make the first pointer variable point to the base address of dynamic storage; The 32 bit scan subspace write tentation datas that current address to the current sensing of the first pointer variable starts; Calculate the first pointer variable, make the first pointer variable point to the first address of lower one scan subspace; The 32 bit scan subspace write tentation datas that current address to the current sensing of the first pointer variable starts; Return calculating first pointer variable afterwards, make the first pointer variable point to the step of the first address of lower one scan subspace, so circulate, until all tentation data is all preserved in scanning subspace.Because each of each storage unit is 0 or 1, therefore, tentation data is wherein special data, as: 0x0000,0000,0x5555,5555,0xaaaa, aaaa etc., to guarantee that storage unit is covered comprehensively.
Afterwards, under word scan pattern, after exporting the step of comparative result, also comprise the step switching half-word scan pattern, under half-word scan pattern, step data being write multiple scanning subspaces of dynamic storage specifically can comprise the following steps: generate the second pointer variable that points to dynamic storage base address; Iterative algorithm is adopted to produce one 16 random data; By the 16 bit scan subspaces that the current address that the second pointer variable that 16 the random data writes produced generate is pointed to starts; Calculate the second pointer variable, make the second pointer variable point to the first address of lower one scan subspace; Shifting algorithm is adopted to produce another 16 random data; The 16 bit scan subspaces that the current address another 16 random data produced being write the second pointer variable sensing starts, return calculating second pointer variable afterwards, the second pointer variable is made to point to the step of the first address of lower one scan subspace, circulation like this, until all random data is all preserved in scanning subspace.
Afterwards, under half-word scan pattern, after exporting the step of comparative result, also comprise the step switching byte scan pattern, under byte scan pattern, step data being write multiple scanning subspaces of dynamic storage specifically can comprise the following steps: generate the 3rd pointer variable that points to dynamic storage base address; Iterative algorithm is adopted to produce one 8 random data; By the 8 bit scan subspaces that the current address that the 3rd pointer variable that 8 the random data writes produced generate is pointed to starts; Calculate the 3rd pointer variable, make the 3rd pointer variable point to the first address of lower one scan subspace; Shifting algorithm is adopted to produce another 8 random data; By the 8 bit scan subspaces that the current address that another 8 random data write the 3rd pointer variables produced are pointed to starts, return calculating the 3rd pointer variable afterwards, the 3rd pointer variable is made to point to the step of the first address of lower one scan subspace, circulation like this, until all random data is all preserved in scanning subspace.
Unlike the prior art, the scanning detection method of the dynamic storage that the embodiment of the present invention provides adopts at least two kinds of different address scan patterns, respectively Scanning Detction is carried out to dynamic storage, can cover each access unit address of dynamic storage really, testing result is more accurate; And further, adopt random data to carry out Scanning Detction to dynamic storage, avoid the impact of data rule on testing result, further increase the degree of accuracy of testing result.
The scanning detection method of the dynamic storage that the embodiment of the present invention provides, while realization detects dynamic memory address line sweep, can also realize the Scanning Detction to dynamic storage data line.Now, before step S101 or after step S103, can also comprise the following steps: at data line be respectively under the scan pattern of 0 and data line be under the scan pattern of 1, test data is write multiple scanning subspaces of dynamic storage; Be under the scan pattern of 0 at data line or data line is under the scan pattern of 1, the read test data respectively from multiple scanning subspaces; The corresponding test data of the data read to the multiple scanning subspace of write is compared, exports comparative result.
Particularly, be under the scan pattern of 0 at data line, step test data being write multiple scanning subspaces of dynamic storage comprises the following steps again: generate the 4th pointer variable that points to dynamic storage base address; By test data 0x0000, the 32 bit scan subspaces that the current address that the 4th pointer variable that 0001 write generates is pointed to starts; Calculate the 4th pointer variable, make the 4th pointer variable point to the first address of lower one scan subspace; Shifting algorithm is adopted to produce another test data that next according to data line is 1; By the 32 bit scan subspaces that the current address that another test data write the 4th pointer variable is pointed to starts, return calculating the 4th pointer variable afterwards, the 4th pointer variable is made to point to the step of the first address of lower one scan subspace, circulation like this, until all test data is all preserved in scanning subspace.
Wherein, adopting shifting algorithm to produce next is that the step of another test data of 1 can comprise the following steps again according to data line: current test data moved to left 1; Current test data is moved to right 31; By move to left the data after 1 with move to right the data phase after 31 or, can remove in current test data be 1 position, and be 1 by Data Position corresponding for next data lines.
Be under the scan pattern of 1 at data line, step test data being write multiple scanning subspaces of dynamic storage comprises the following steps again: generate the 5th pointer variable that points to dynamic storage base address; By the 32 bit scan subspaces that the current address that the 5th pointer variable that test data 0xFFFF, FFFE write generates is pointed to starts; Calculate the 5th pointer variable, make the 5th pointer variable point to the first address of lower one scan subspace; Shifting algorithm is adopted to produce another test data that next according to data line is 0; By the 32 bit scan subspaces that the current address that another test data write the 5th pointer variable is pointed to starts, return calculating the 5th pointer variable afterwards, the 5th pointer variable is made to point to the step of the first address of lower one scan subspace, circulation like this, until all test data is all preserved in scanning subspace.
Carry out in the process of address wire detection and data line detection at the scanning detection method of the dynamic storage adopting the embodiment of the present invention to provide to dynamic storage, detection mistake may be produced due to mathematical logic rule and address logic rule, in order to avoid the generation of this kind of situation, the embodiment of the present invention, before step S101 or after step S103, can also comprise the following steps: start timing; After startup timing, employing iterative algorithm produces the random address within the scope of a dynamic memory address; The random address of generation is write in scanning subspace corresponding to this random address as test data; If when timing time reaches default sweep time, then from scanning subspace, read the random address of write, otherwise return the step adopting iterative algorithm to produce the random address within the scope of a dynamic memory address; The corresponding test data of the random address read to the scanning subspace of write is compared, exports comparative result.
Fig. 2 shows the structure of the scanning-detecting system of the dynamic storage that the embodiment of the present invention provides, and for convenience of explanation, illustrate only the part relevant to the embodiment of the present invention.
The scanning-detecting system of the dynamic storage that the embodiment of the present invention provides comprises: the first data write unit 11, for respectively under at least two kinds of different address scan patterns, data is write multiple scanning subspaces of dynamic storage; Data-reading unit 12, under often kind of address scan pattern, after data are write multiple scanning subspace by the first data write unit 11, reads data respectively from multiple scanning subspace; Relatively output unit 13, the corresponding data that data and the first data write unit 11 for data-reading unit 12 being read write multiple scanning subspace compares, output comparative result.
Wherein, address scan pattern can be word scan pattern, half-word scan pattern or byte scan pattern etc.Under word scan pattern, every one scan subspace of dynamic storage includes four storage unit, and for dynamic storage, the storage space storing 1 byte is a storage unit, that is to say, every one scan subspace of dynamic storage comprises 32 storage spaces; Under half-word scan pattern, every one scan subspace of dynamic storage includes two storage unit, namely comprises 16 storage spaces; Under byte scan pattern, every one scan subspace of dynamic storage includes a storage unit, namely comprises 8 storage spaces.
Wherein, the data writing multiple scanning subspace can be tentation data or random data, and the figure place of this tentation data or random data is different from the difference of scanning subspace size corresponding to different addresses scan pattern.In order to avoid the testing result that data rule makes the mistake, preferably, the data writing multiple scanning subspace are random data.
For example, the data when the multiple scanning subspace of write are random data, and when detecting dynamic storage with word scan pattern, half-word scan pattern and byte scan pattern in turn respectively, Fig. 3 shows the structure of the first data write unit 11 in Fig. 2.
First data write unit 11 comprises: the first pointer variable generation module 111, under word scan pattern, generates the first pointer variable current_pre that points to dynamic storage base address; First random data generation module 112, produces one 32 random data word_pattern for adopting iterative algorithm; First writing module 113, the 32 bit scan subspaces that the current address that 32 random data word_pattern for being produced by the first random data generation module 112 write the first pointer variable current_pre sensing that the first pointer variable generation module 111 generates starts; First computing module 114, for calculating the first pointer variable current_pre, makes the first pointer variable current_pre point to the first address of lower one scan subspace; Second random data generation module 115, produces another 32 random data word_pattern ' for adopting shifting algorithm; The 32 bit scan subspaces that the current address that first writing module 113 another 32 random data word_pattern ' also for being produced by the second random data generation module 115 write the first pointer variable current_pre sensing that the first computing module 114 calculates starts, the first pointer variable current_pre is calculated afterwards by the first computing module 114, the first pointer variable current_pre is made to point to the first address of lower one scan subspace, circulation like this, until all random data is all preserved in scanning subspace.
Wherein, the second random data generation module 115 adopts shifting algorithm to produce the step of another 32 random data word_pattern ' as mentioned above, does not repeat them here.
Further, comprehensive scanning in order to ensure storage unit covers, the scanning-detecting system of the dynamic storage that the embodiment of the present invention provides can also comprise: the second computing module 117, after the corresponding data writing multiple scanning subspace for the data that data-reading unit 12 read at relatively output unit 13 and the first data write unit 11 compares, calculate the first pointer variable, make the first pointer variable point to the base address of dynamic storage; The 32 bit scan subspace write tentation datas of the first writing module 113 also for starting to the current address of the current sensing of the first pointer variable; Second computing module 117, also for calculating the first pointer variable, makes the first pointer variable point to the first address of lower one scan subspace; The 32 bit scan subspace write tentation datas of the first writing module 113 also for starting to the current address of the current sensing of the first pointer variable; Calculate the first pointer variable by the second computing module 117 afterwards, make the first pointer variable point to the step of the first address of lower one scan subspace, so circulate, until all tentation data is all preserved in scanning subspace.Because each of each storage unit is 0 or 1, therefore, tentation data is wherein special data, as: 0x0000,0000,0x5555,5555,0xaaaa, aaaa etc., to guarantee that storage unit is covered comprehensively.
In addition, the first data write unit 11 also comprises: handover module 116, for after relatively output unit 13 exports comparative result under word scan pattern, switches half-word scan pattern; First pointer variable generation module 111, also for after handover module 116 switches to half-word scan pattern, generates the second pointer variable that points to dynamic storage base address; First random data generation module 112 is also for adopting iterative algorithm to produce one 16 random data; The 16 bit scan subspaces that the current address that first writing module 113 also points to for the second pointer variable 16 that produce random data writes generated starts; First computing module 114, also for calculating the second pointer variable, makes the second pointer variable point to the first address of lower one scan subspace; Second random data generation module 115 is also for adopting shifting algorithm to produce another 16 random data; The 16 bit scan subspaces that the current address that first writing module 113 also points to for another 16 random data produced being write the second pointer variable starts, the second pointer variable is calculated afterwards by the first computing module 114, the second pointer variable is made to point to the first address of lower one scan subspace, circulation like this, until all random data is all preserved in scanning subspace.
In addition, handover module 116 is also for after relatively output unit 13 exports comparative result under half-word scan pattern, and switch byte scan pattern, the first pointer variable generation module 111 is also for generating the 3rd pointer variable of a sensing dynamic storage base address; First random data generation module 112 is also for adopting iterative algorithm to produce one 8 random data; The 8 bit scan subspaces that the current address that first writing module 113 also points to for the 3rd pointer variable 8 that produce random data writes generated starts; First computing module 114, also for calculating the 3rd pointer variable, makes the 3rd pointer variable point to the first address of lower one scan subspace; Second random data generation module 115 is also for adopting shifting algorithm to produce another 8 random data; The 8 bit scan subspaces of the first writing module 113 also for the current address of another 8 random data write the 3rd pointer variables sensing produced is started, the second pointer variable is calculated afterwards by the first computing module 114, the second pointer variable is made to point to the first address of lower one scan subspace, circulation like this, until all random data is all preserved in scanning subspace.
The scanning-detecting system of the dynamic storage that the embodiment of the present invention provides, while realization detects dynamic memory address line sweep, can also realize the Scanning Detction to dynamic storage data line.Now, the scanning-detecting system of the dynamic storage that the embodiment of the present invention provides can also comprise: the second data write unit 14, for at data line be respectively 0 scan pattern under and under data line is the scan pattern of 1, test data is write multiple scanning subspaces of dynamic storage; Data-reading unit 12 also at data line be 0 scan pattern under or under data line is the scan pattern of 1, read the test data that the second data write unit 14 writes respectively from multiple scanning subspace; Relatively the data of output unit 13 also for data-reading unit 12 being read compare to the corresponding test data that the second data write unit 14 writes multiple scanning subspace, export comparative result.
Fig. 4 shows the structure of the second data write unit 14 in Fig. 2.
Second data write unit 14 comprises: the second pointer variable generation module 141, at data line be 0 scan pattern under, generate one and point to the 4th pointer variable of dynamic storage base address; Second writing module 142, for by test data 0x0000, the 32 bit scan subspaces that the current address that the 4th pointer variable that 0001 write second pointer variable generation module 141 generates is pointed to starts; 3rd computing module 143, for calculating the 4th pointer variable, makes the 4th pointer variable point to the first address of lower one scan subspace; Test data generation module 144, produces for adopting shifting algorithm another test data that next according to data line is 1; The 32 bit scan subspaces that the current address that the 4th pointer variable that second writing module 142 also calculates for another test data write the 3rd computing module 143 Test data generation module 144 produced is pointed to starts, the 4th pointer variable is calculated afterwards by the 3rd computing module 143, the 4th pointer variable is made to point to the first address of lower one scan subspace, circulation like this, until all test data is all preserved in scanning subspace.
Wherein, it is that the process of another test data of 1 is described above according to data line that data generation module 144 adopts shifting algorithm to produce next, does not repeat them here.
In addition, the second pointer variable generation module 141 also at data line be 1 scan pattern under, generate one and point to the 5th pointer variable of dynamic storage base address; The 32 bit scan subspaces that the current address that the 5th pointer variable that second writing module 142 also generates for test data 0xFFFF, FFFE being write the second pointer variable generation module 141 is pointed to starts; 3rd computing module 143, also for calculating the 5th pointer variable, makes the 5th pointer variable point to the first address of lower one scan subspace; Test data generation module 144 is also for adopt shifting algorithm to produce another test data that next according to data line is 0; The 32 bit scan subspaces that the current address that the 5th pointer variable that second writing module 142 also calculates for another test data write the 3rd computing module 143 Test data generation module 144 produced is pointed to starts, the 5th pointer variable is calculated afterwards by the 3rd computing module 143, the 5th pointer variable is made to point to the first address of lower one scan subspace, circulation like this, until all test data is all preserved in scanning subspace.
In order to avoid the detection mistake produced due to mathematical logic rule and address logic rule, the scanning-detecting system of the dynamic storage that the embodiment of the present invention provides can also comprise: timing unit 17, for timing; Random address generation unit 16, for after timing unit 17 starts timing, employing iterative algorithm produces the random address within the scope of a dynamic memory address; 3rd data write unit 15, writes in scanning subspace corresponding to this random address for the random address produced by random address generation unit 16 as test data; Data-reading unit 12, also for when the timing time of timing unit 17 reaches default sweep time, reads the random address that the 3rd data write unit 15 writes from scanning subspace; Random address generation unit 16 is not also for when the timing time of timing unit 17 reaches default sweep time, and employing iterative algorithm produces the random address within the scope of a dynamic memory address; The random address of comparison output unit 13 also for data-reading unit 12 being read writes to the 3rd data write unit 15 the corresponding test data scanning subspace and compares, and exports comparative result.
The scanning detection method of the dynamic storage that the embodiment of the present invention provides and system adopt at least two kinds of different address scan patterns, respectively Scanning Detction is carried out to dynamic storage, can cover each access unit address of dynamic storage really, testing result is more accurate; And further, adopt random data to carry out Scanning Detction to dynamic storage, avoid the impact of data rule on testing result, further increase the degree of accuracy of testing result.Have again, the scanning detection method of the dynamic storage that the embodiment of the present invention provides and system are while realizing the Scanning Detction to dynamic memory address line, under data line is the scan pattern of 1 and/or data line is the scan pattern of 0, the Scanning Detction to dynamic storage data line can also be realized.In addition, the scanning detection method of the dynamic storage that the embodiment of the present invention provides and system can also by constantly generating random address within default sweep time, and random address is read and compares behind data write respective scanned subspace, to avoid the detection mistake produced due to mathematical logic rule and address logic rule, improve further and detect degree of accuracy.
One of ordinary skill in the art will appreciate that all or part of step realized in above-described embodiment method is that the hardware that can control to be correlated with by program completes, described program can be stored in a computer read/write memory medium, described storage medium, as ROM/RAM, disk, CD etc.
The foregoing is only preferred embodiment of the present invention, not in order to limit the present invention, all any amendments done within the spirit and principles in the present invention, equivalent replacement and improvement etc., all should be included within protection scope of the present invention.
Claims (8)
1. a scanning detection method for dynamic storage, is characterized in that, said method comprising the steps of:
Respectively under at least two kinds of different address scan patterns, data are write multiple scanning subspaces of dynamic storage;
Under often kind of address scan pattern, after by the described multiple scanning subspace of described data write, read data respectively from described multiple scanning subspace;
The corresponding data of the described data read with the described multiple scanning subspace of write is compared, exports comparative result;
Described at least two kinds of different address scan patterns are word scan pattern, half-word scan pattern and byte scan pattern; Under described word scan pattern, described step data being write multiple scanning subspaces of dynamic storage comprises the following steps:
Generate the first pointer variable that points to described dynamic storage base address;
Iterative algorithm is adopted to produce one 32 random data;
By the 32 bit scan subspaces that the current address that described first pointer variable that described 32 random data write produced generates is pointed to starts;
Calculate described first pointer variable, make described first pointer variable point to the first address of lower one scan subspace;
Shifting algorithm is adopted to produce another 32 random data;
By the 32 bit scan subspaces that the current address that described first pointer variable that another 32 random data writes described in generation calculate is pointed to starts, return the step of described first pointer variable of described calculating afterwards, circulation like this, until random data is all preserved in whole described scanning subspace.
2. the scanning detection method of dynamic storage as claimed in claim 1, it is characterized in that, the step that described employing shifting algorithm produces another 32 random data comprises the following steps again:
Current 32 random data are moved to left 5;
Current 32 random data are moved to right 27;
By move to left the data after 5 with move to right the data phase after 27 or;
By mutually or after 32 random data be added with described 32 random data adopting iterative algorithm to produce, another 32 random data described in obtaining.
3. the scanning detection method of dynamic storage as claimed in claim 1, it is characterized in that, under described word scan pattern, after the described step described data read and the corresponding data of the described multiple scanning subspace of write compared, described method is further comprising the steps of:
Calculate described first pointer variable, make described first pointer variable point to the base address of described dynamic storage;
The 32 bit scan subspace write tentation datas started to the current address obtaining the current sensing of the first pointer variable, described tentation data is 0x00000000,0x55555555 or 0xaaaaaaaa;
Calculate described first pointer variable, make described first pointer variable point to the first address of lower one scan subspace;
The 32 bit scan subspace write tentation datas that current address to the current sensing of described first pointer variable starts, return described first pointer variable of described calculating afterwards, described first pointer variable is made to point to the step of the first address of lower one scan subspace, circulation like this, until described tentation data is all preserved in whole described scanning subspace.
4. the scanning detection method of dynamic storage as claimed in claim 1, it is characterized in that, under described word scan pattern, after the step of described output comparative result, described method also comprises the step switching described half-word scan pattern; Under described half-word scan pattern, described step data being write multiple scanning subspaces of dynamic storage comprises the following steps: generate the second pointer variable that points to described dynamic storage base address; Iterative algorithm is adopted to produce one 16 random data; By the 16 bit scan subspaces that the current address that described second pointer variable that described 16 random data write produced generates is pointed to starts; Calculate described second pointer variable, make described second pointer variable point to the first address of lower one scan subspace; Shifting algorithm is adopted to produce another 16 random data; By the 16 bit scan subspaces that the current address that another 16 described second pointer variables of random data write described in generation are pointed to starts, return the step of described second pointer variable of described calculating afterwards, circulation like this, until random data is all preserved in whole described scanning subspace;
Under described half-word scan pattern, after the step of described output comparative result, described method also comprises the step switching described byte scan pattern, under described byte scan pattern, described step data being write multiple scanning subspaces of dynamic storage comprises the following steps: generate the 3rd pointer variable that points to dynamic storage base address; Iterative algorithm is adopted to produce one 8 random data; By the 8 bit scan subspaces that the current address that described 3rd pointer variable that described 8 random data write produced generates is pointed to starts; Calculate described 3rd pointer variable, make described 3rd pointer variable point to the first address of lower one scan subspace; Shifting algorithm is adopted to produce another 8 random data; By the 8 bit scan subspaces that the current address that another 8 described 3rd pointer variables of random data write described in generation are pointed to starts, return the step of described 3rd pointer variable of described calculating afterwards, circulation like this, until random data is all preserved in whole described scanning subspace.
5. the scanning detection method of dynamic storage as claimed in claim 1, it is characterized in that, described respectively under at least two kinds of different address scan patterns, before data being write the step of multiple scanning subspaces of dynamic storage or after the step of described output comparative result, described method is further comprising the steps of:
At data line be respectively under the scan pattern of 0 and data line be under the scan pattern of 1, test data is write described multiple scanning subspaces of described dynamic storage;
Be under the scan pattern of 0 at described data line or described data line is under the scan pattern of 1, from described multiple scanning subspaces read test data respectively;
The corresponding test data of the described test data read to the described multiple scanning subspace of write is compared, exports comparative result.
6. the scanning detection method of dynamic storage as claimed in claim 1, it is characterized in that, described respectively under at least two kinds of different address scan patterns, before data being write the step of multiple scanning subspaces of dynamic storage or after the step of described output comparative result, described method is further comprising the steps of:
Start timing;
After startup timing, adopt the random address within the scope of dynamic memory address described in iterative algorithm generation one;
The described random address produced is write in scanning subspace corresponding to described random address as test data;
If when timing time reaches default sweep time, then from described scanning subspace, read the described random address of write;
The corresponding test data that the described random address read and write scan subspace is compared, exports comparative result.
7. a scanning-detecting system for dynamic storage, is characterized in that, described system comprises:
Data, for respectively under at least two kinds of different address scan patterns, are write multiple scanning subspaces of dynamic storage by the first data write unit;
Data-reading unit, under often kind of address scan pattern, after described first data write unit is by the described multiple scanning subspace of described data write, reads data from described multiple scanning subspace respectively;
Relatively output unit, the corresponding data that described data and described first data write unit for described data-reading unit being read write described multiple scanning subspace compares, output comparative result;
Described system also comprises:
Second data write unit, at data line be respectively 0 scan pattern under and under data line is the scan pattern of 1, test data is write described multiple scanning subspaces of described dynamic storage;
Described data-reading unit also at described data line be 0 scan pattern under or under described data line is the scan pattern of 1, read the described test data of described second data write unit write respectively from described multiple scanning subspace;
The described described test data of output unit also for described data-reading unit being read that compare compares to the corresponding test data that described second data write unit writes described multiple scanning subspace, exports comparative result.
8. the scanning-detecting system of dynamic storage as claimed in claim 7, it is characterized in that, described system also comprises:
Timing unit, for timing;
Random address generation unit, for after described timing unit starts timing, employing iterative algorithm produces the random address within the scope of a dynamic memory address;
3rd data write unit, writes in scanning subspace corresponding to described random address for the described random address produced by described random address generation unit as test data;
Described data-reading unit, also for when the timing time of described timing unit reaches default sweep time, reads the described random address of described 3rd data write unit write from described scanning subspace;
The described described random address of output unit also for described data-reading unit being read that compare compares to the corresponding test data that described 3rd data write unit writes described scanning subspace, exports comparative result.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201210042768.6A CN103295645B (en) | 2012-02-23 | 2012-02-23 | A kind of scanning detection method of dynamic storage and system |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201210042768.6A CN103295645B (en) | 2012-02-23 | 2012-02-23 | A kind of scanning detection method of dynamic storage and system |
Publications (2)
| Publication Number | Publication Date |
|---|---|
| CN103295645A CN103295645A (en) | 2013-09-11 |
| CN103295645B true CN103295645B (en) | 2016-03-09 |
Family
ID=49096371
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN201210042768.6A Active CN103295645B (en) | 2012-02-23 | 2012-02-23 | A kind of scanning detection method of dynamic storage and system |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN103295645B (en) |
Cited By (1)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN107039085A (en) * | 2017-05-03 | 2017-08-11 | 郑州云海信息技术有限公司 | A kind of method and system for realizing the test of storage subsystem data integrity |
Families Citing this family (2)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN105607961B (en) * | 2015-12-17 | 2019-03-08 | 北京兆易创新科技股份有限公司 | A method of scanning error bit |
| CN112035379B (en) * | 2020-09-09 | 2022-06-14 | 浙江大华技术股份有限公司 | Method and device for using storage space, storage medium and electronic device |
Citations (4)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN1315732A (en) * | 2000-03-30 | 2001-10-03 | 华为技术有限公司 | Automatic test method and circuit for RAM |
| CN1725382A (en) * | 2004-07-20 | 2006-01-25 | 中兴通讯股份有限公司 | Detection method of flash storage |
| CN101310343A (en) * | 2005-11-14 | 2008-11-19 | 三菱电机株式会社 | Memory diagnosis device |
| CN101937721A (en) * | 2010-08-04 | 2011-01-05 | 武汉天喻信息产业股份有限公司 | Method for testing memory device |
-
2012
- 2012-02-23 CN CN201210042768.6A patent/CN103295645B/en active Active
Patent Citations (4)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN1315732A (en) * | 2000-03-30 | 2001-10-03 | 华为技术有限公司 | Automatic test method and circuit for RAM |
| CN1725382A (en) * | 2004-07-20 | 2006-01-25 | 中兴通讯股份有限公司 | Detection method of flash storage |
| CN101310343A (en) * | 2005-11-14 | 2008-11-19 | 三菱电机株式会社 | Memory diagnosis device |
| CN101937721A (en) * | 2010-08-04 | 2011-01-05 | 武汉天喻信息产业股份有限公司 | Method for testing memory device |
Cited By (1)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN107039085A (en) * | 2017-05-03 | 2017-08-11 | 郑州云海信息技术有限公司 | A kind of method and system for realizing the test of storage subsystem data integrity |
Also Published As
| Publication number | Publication date |
|---|---|
| CN103295645A (en) | 2013-09-11 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| CN111381999B (en) | Error correction in row hammer mitigation and target row refresh | |
| CN103019873A (en) | Replacing method and device for storage fault unit and data storage system | |
| KR20060051898A (en) | System and method of reading non-volatile computer memory | |
| CN103500586B (en) | Detect the method and apparatus of flash memory device capacity | |
| US9355703B2 (en) | Devices, systems and methods with improved refresh address generation | |
| US11113145B2 (en) | Memory device, semiconductor device, and semiconductor system | |
| CN108039190B (en) | Test method and device | |
| KR101240634B1 (en) | Apparatus for fail detecting in solid state drive tester | |
| US20220137859A1 (en) | Computing system and operating method thereof | |
| US9620227B1 (en) | Characterizing and operating a non-volatile memory device | |
| CN102306503A (en) | Method and system for detecting false capacity memory | |
| CN103077094A (en) | Storage control apparatus, storage apparatus, information processing system, and storage control method | |
| CN103295645B (en) | A kind of scanning detection method of dynamic storage and system | |
| CN106328208A (en) | Semiconductor device and operating method thereof | |
| CN103116536A (en) | Method for detecting capacity of storage device | |
| CN103942161A (en) | Redundancy elimination system and method for read-only cache and redundancy elimination method for cache | |
| CN101308701A (en) | Apparatus and method of managing mapping table of non-volatile memory | |
| CN102929740A (en) | Method and device for detecting bad block of storage equipment | |
| JP2015141517A (en) | Memory control device, information processing device, memory control method, and computer program | |
| CN104067247A (en) | Storage control device, storage device, information processing system, and processing methods in same | |
| KR101753353B1 (en) | Semiconductor testing apparatus | |
| CN101576838A (en) | Method and device for detecting memory | |
| CN102360568B (en) | Parallel asynchronous memory and data reading method thereof | |
| US11645202B2 (en) | Parsing method, parsing apparatus, electronic device, and computer storage medium | |
| US11264114B2 (en) | Test pattern generator and method for generating test pattern |
Legal Events
| Date | Code | Title | Description |
|---|---|---|---|
| C06 | Publication | ||
| PB01 | Publication | ||
| C10 | Entry into substantive examination | ||
| SE01 | Entry into force of request for substantive examination | ||
| C14 | Grant of patent or utility model | ||
| GR01 | Patent grant | ||
| PE01 | Entry into force of the registration of the contract for pledge of patent right |
Denomination of invention: Scanning detection method and system for dynamic memory Effective date of registration: 20171102 Granted publication date: 20160309 Pledgee: China Co truction Bank Corp Guangzhou economic and Technological Development Zone sub branch Pledgor: Anyka (Guangzhou) Microelectronics Technology Co., Ltd. Registration number: 2017990001008 |
|
| PE01 | Entry into force of the registration of the contract for pledge of patent right | ||
| PC01 | Cancellation of the registration of the contract for pledge of patent right | ||
| PC01 | Cancellation of the registration of the contract for pledge of patent right |
Date of cancellation: 20181227 Granted publication date: 20160309 Pledgee: China Co truction Bank Corp Guangzhou economic and Technological Development Zone sub branch Pledgor: Anyka (Guangzhou) Microelectronics Technology Co., Ltd. Registration number: 2017990001008 |
|
| PE01 | Entry into force of the registration of the contract for pledge of patent right |
Denomination of invention: Scanning detection method and system for dynamic memory Effective date of registration: 20190130 Granted publication date: 20160309 Pledgee: China Co truction Bank Corp Guangzhou economic and Technological Development Zone sub branch Pledgor: Anyka (Guangzhou) Microelectronics Technology Co., Ltd. Registration number: 2019440000051 |
|
| PE01 | Entry into force of the registration of the contract for pledge of patent right | ||
| PC01 | Cancellation of the registration of the contract for pledge of patent right |
Date of cancellation: 20200320 Granted publication date: 20160309 Pledgee: China Co truction Bank Corp Guangzhou economic and Technological Development Zone sub branch Pledgor: ANYKA (GUANGZHOU) MICROELECTRONICS TECHNOLOGY Co.,Ltd. Registration number: 2019440000051 |
|
| PC01 | Cancellation of the registration of the contract for pledge of patent right | ||
| CP01 | Change in the name or title of a patent holder |
Address after: 3 / F, C1 area, innovation building, 182 science Avenue, Science City, Guangzhou, Guangdong 510663 Patentee after: Guangzhou Ankai Microelectronics Co.,Ltd. Address before: 3 / F, C1 area, innovation building, 182 science Avenue, Science City, Guangzhou, Guangdong 510663 Patentee before: ANYKA (GUANGZHOU) MICROELECTRONICS TECHNOLOGY Co.,Ltd. |
|
| CP01 | Change in the name or title of a patent holder | ||
| CP02 | Change in the address of a patent holder |
Address after: 510555 No. 107 Bowen Road, Huangpu District, Guangzhou, Guangdong Patentee after: Guangzhou Ankai Microelectronics Co.,Ltd. Address before: 3 / F, C1 area, innovation building, 182 science Avenue, Science City, Guangzhou, Guangdong 510663 Patentee before: Guangzhou Ankai Microelectronics Co.,Ltd. |
|
| CP02 | Change in the address of a patent holder |