CN103295645A - Scanning detection method and system for dynamic memory - Google Patents
Scanning detection method and system for dynamic memory Download PDFInfo
- Publication number
- CN103295645A CN103295645A CN2012100427686A CN201210042768A CN103295645A CN 103295645 A CN103295645 A CN 103295645A CN 2012100427686 A CN2012100427686 A CN 2012100427686A CN 201210042768 A CN201210042768 A CN 201210042768A CN 103295645 A CN103295645 A CN 103295645A
- Authority
- CN
- China
- Prior art keywords
- data
- subspace
- address
- write
- random
- 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
Links
- 238000001514 detection method Methods 0.000 title claims abstract description 47
- 238000000034 method Methods 0.000 claims abstract description 14
- 238000012360 testing method Methods 0.000 claims description 60
- 230000000052 comparative effect Effects 0.000 claims description 22
- 238000007792 addition Methods 0.000 claims 1
- 238000010586 diagram Methods 0.000 description 1
- 238000012986 modification Methods 0.000 description 1
- 230000004048 modification Effects 0.000 description 1
- 238000010408 sweeping Methods 0.000 description 1
Images
Landscapes
- Techniques For Improving Reliability Of Storages (AREA)
Abstract
The invention belongs to the technical field of memory detection and provides a scanning detection method and system for a dynamic memory. The method comprises the following steps of: respectively writing data into multiple scanning subspaces of the dynamic memory in at least two different address scanning modes; respectively reading the data from the multiple scanning subspaces in each address scanning mode after the data is written into the multiple scanning subspaces; and comparing the read data and the corresponding data which are written into the multiple scanning subspaces, and outputting a comparison result. According to the scanning detection method for the dynamic memory, at least two different address scanning modes are adopted, such as a word scanning mode, a half-word scanning mode and a byte scanning mode to respectively scan and detect the dynamic memory, the address of each memory unit of the dynamic memory can be really covered, and the detection result is accurate.
Description
Technical field
The invention belongs to storer detection technique field, relate in particular to a kind of scanning detection method and system of dynamic storage.
Background technology
Along with embedded product in the application in fields such as consumer electronics product, industry, security protection more and more widely, generally utilize dynamic storage (as: sdram, ddr, ddr2 etc.) to carry out code cache and operation at present, therefore need scan detection to dynamic storage, to improve the reliabilty and availability of dynamic storage.Generally speaking, the surface sweeping of dynamic storage detect the detection comprise the dynamic storage data line, to the detection of dynamic storage storage unit and to the detection of dynamic memory address line.
Wherein, the scanning detection mode that the dynamic memory address line is detected that prior art provides is to adopt word pattern to detect, and is that unit is divided into some scanning subspaces with the word with the storage space of dynamic storage.After scanning detects beginning, write a tentation data to each scanning subspace, after data are all preserved in whole scannings subspace, data of each scanning subspace are read, and with tentation data relatively, write whether mistake of data with check.
The scanning detection method of the dynamic storage that this kind that prior art provides detects the dynamic memory address line is owing to be to detect with word pattern, adopt the scanning method of 4 byte-aligned, can not cover the address of each storage unit of dynamic storage really, make the scanning of some storage unit be left in the basket, the testing result out of true can't reflect the truth of dynamic memory address line and storage unit.
Disclosed above-mentioned information is only for increasing the understanding to background technology of the present invention in this background technology this part, so it may comprise those of ordinary skills' known systems that does not constitute this state.
Summary of the invention
The purpose of the embodiment of the invention is to provide a kind of scanning detection method of dynamic storage, the scanning detection method that is intended to solve the dynamic storage that prior art provides detects the dynamic memory address line detects with word pattern, can not cover the address of each storage unit of dynamic storage really, make the problem that the testing result degree of accuracy is low.
The embodiment of the invention is achieved in that a kind of scanning detection method of dynamic storage, said method comprising the steps of:
Under at least two kinds of different address scan patterns, data are write a plurality of scannings subspace of dynamic storage respectively;
Under every kind of address scan pattern, after described data being write described a plurality of scannings subspace, read data respectively from described a plurality of scannings subspace;
The described data that read and the corresponding data that writes described a plurality of scannings subspace are compared the output comparative result.
Another purpose of the embodiment of the invention is to provide a kind of scanning-detecting system of dynamic storage, and described system comprises:
First data write unit is used for respectively data being write a plurality of scannings subspace of dynamic storage under at least two kinds of different address scan patterns;
Data-reading unit is used for after described first data write unit writes described data described a plurality of scannings subspace, reading data respectively from described a plurality of scannings subspace under every kind of address scan pattern;
Relatively output unit is used for the described data that described data-reading unit is read and the corresponding data that described first data write unit writes described a plurality of scannings subspace and compares, and exports comparative result.
The scanning detection method of the dynamic storage that the embodiment of the invention provides is to adopt at least two kinds of different address scan patterns with system, respectively dynamic storage is scanned detection, can cover the address of each storage unit of dynamic storage really, testing result is more accurate.
Description of drawings
Fig. 1 is the process flow diagram of the scanning detection method of the dynamic storage that provides of the embodiment of the invention;
Fig. 2 is the structural drawing of the scanning-detecting system of the dynamic storage that provides of the embodiment of the invention;
Fig. 3 is the structural drawing of first data write unit among Fig. 2;
Fig. 4 is the structural drawing of second data write unit among Fig. 2.
Embodiment
In order to make purpose of the present invention, technical scheme and advantage clearer, 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 explaining the present invention, and be not used in restriction the present invention.
At the problem that prior art exists, the scanning detection method of the dynamic storage that the embodiment of the invention provides is to adopt at least two kinds of different address scan patterns, respectively dynamic storage is detected.
Fig. 1 is the flow process of the scanning detection method of the dynamic storage that provides of the embodiment of the invention.
In step S101, under at least two kinds of different address scan patterns, data are write a plurality of scannings subspace of dynamic storage respectively.
Wherein, the address scan pattern can be word scan pattern, half-word scan pattern or byte scan pattern etc.Under the word scan pattern, each scanning subspace of dynamic storage includes four storage unit, and for dynamic storage, storing 1 bytes of memory space is a storage unit, that is to say that each scanning subspace of dynamic storage comprises 32 storage spaces; Under the half-word scan pattern, each scanning subspace of dynamic storage includes two storage unit, namely comprises 16 storage spaces; Under the byte scan pattern, each scanning subspace of dynamic storage includes a storage unit, namely comprises 8 storage spaces.
Wherein, the data that write a plurality of scannings subspace can be tentation data or random data, and the figure place of this tentation data or random data is according to the difference of the scanning subspace size of different addresses scan pattern correspondence and difference.For fear of the testing result that the data rule makes the mistake, preferably, the data that write a plurality of scannings subspace are random data.
In step S102, under every kind of address scan pattern, after data being write a plurality of scannings subspace, read data respectively from a plurality of scannings subspace.
In step S103, the data that read and the corresponding data that writes a plurality of scannings subspace are compared the output comparative result.
For instance, when the data that write a plurality of scannings subspace are random data, and when with word scan pattern, half-word scan pattern and byte scan pattern dynamic storage being detected in turn respectively, under the word scan pattern, the step that data is write a plurality of scannings subspace of dynamic storage specifically can may further comprise the steps: the first pointer variable current_pre that generates a sensing dynamic storage base address; Adopt iterative algorithm to produce one 32 random data word_pattern; 32 random data word_pattern that produce are write the 32 bit scan subspaces that current address that the first pointer variable current_pre of generation points to begins; Calculate the first pointer variable current_pre, make the pointer variable current_pre that wins point to the first address of one scan subspace down; Adopt shifting algorithm to produce another 32 random data word_pattern '; Another 32 random data word_pattern ' that produce are write the 32 bit scan subspaces that current address that the first pointer variable current_pre points to begins, return afterwards and calculate the first pointer variable current_pre, make the pointer variable current_pre that wins point to the step of the first address of one scan subspace down, so circulation is all preserved random data until whole scannings subspace.
Wherein, the step that adopts shifting algorithm to produce another 32 random data word_pattern ' may further comprise the steps again: current 32 random data are moved to left 5; Current 32 random data are moved to right 27; With move to left after 5 data with move to right after 27 data mutually or; With mutually or after 32 random data and 32 random data word_pattern addition of adopting iterative algorithm to produce, 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 invention, under the word scan pattern, after the step that the data that read and the corresponding data that writes a plurality of scannings subspace are compared, can also may further comprise the steps: calculate first pointer variable, make the pointer variable of winning point to the base address of dynamic storage; The 32 bit scan subspaces that begin to the current address of the current sensing of first pointer variable write tentation data; Calculate first pointer variable, make the pointer variable of winning point to the first address of one scan subspace down; The 32 bit scan subspaces that begin to the current address of the current sensing of first pointer variable write tentation data; Return afterwards and calculate first pointer variable, make the pointer variable of winning point to the step of the first address of one scan subspace down, so circulation is all preserved tentation data until whole scannings subspace.Because each of each storage unit is 0 or 1, therefore, tentation data wherein is special data, as: 0x0000,0000,0x5555,5555,0xaaaa, aaaa etc. are to guarantee that storage unit is covered comprehensively.
Afterwards, under the word scan pattern, after the step of output comparative result, also comprise the step of switching the half-word scan pattern, under the half-word scan pattern, the step that data is write a plurality of scannings subspace of dynamic storage specifically can may further comprise the steps: second pointer variable that generates a sensing dynamic storage base address; Adopt iterative algorithm to produce one 16 random data; 16 random data that produce are write the 16 bit scan subspaces that current address that second pointer variable of generation points to begins; Calculate second pointer variable, make second pointer variable point to the first address of one scan subspace down; Adopt shifting algorithm to produce another 16 random data; Another 16 random data that produce are write the 16 bit scan subspaces that current address that second pointer variable points to begins, return afterwards and calculate second pointer variable, make second pointer variable point to the step of the first address of one scan subspace down, so circulation is all preserved random data until whole scannings subspace.
Afterwards, under the half-word scan pattern, after the step of output comparative result, also comprise the step of switching the byte scan pattern, under the byte scan pattern, the step that data is write a plurality of scannings subspace of dynamic storage specifically can may further comprise the steps: the 3rd pointer variable that generates a sensing dynamic storage base address; Adopt iterative algorithm to produce one 8 random data; 8 random data that produce are write the 8 bit scan subspaces that current address that the 3rd pointer variable of generation points to begins; Calculate the 3rd pointer variable, make the 3rd pointer variable point to the first address of one scan subspace down; Adopt shifting algorithm to produce another 8 random data; Another 8 random data that produce are write the 8 bit scan subspaces that current address that the 3rd pointer variable points to begins, return afterwards and calculate the 3rd pointer variable, make the 3rd pointer variable point to the step of the first address of one scan subspace down, so circulation is all preserved random data until whole scannings subspace.
Unlike the prior art, the scanning detection method of the dynamic storage that the embodiment of the invention provides is to adopt at least two kinds of different address scan patterns, respectively dynamic storage is scanned detection, can cover the address of each storage unit of dynamic storage really, testing result is more accurate; And further, adopt random data that dynamic storage is scanned detection, avoided the influence of data rule to testing result, further improved the degree of accuracy of testing result.
The scanning detection method of the dynamic storage that the embodiment of the invention provides can also be realized the scanning of dynamic storage data line is detected when realizing the detection of dynamic memory address line sweep.At this moment, before step S101 or after the step S103, can also may further comprise the steps: be under 0 the scan pattern and data line is under 1 the scan pattern at data line respectively, test data write a plurality of scannings subspace of dynamic storage; Be under 0 the scan pattern at data line or data line is under 1 the scan pattern, the read test data respectively from a plurality of scannings subspace; The data that read and the corresponding test data that writes a plurality of scannings subspace are compared the output comparative result.
Particularly, be that the step that test data is write a plurality of scannings subspace of dynamic storage may further comprise the steps again under 0 the scan pattern at data line: generate the 4th pointer variable of pointing to the dynamic storage base address; With test data 0x0000, the 32 bit scan subspaces that the current address that 0001 the 4th pointer variable that writes generation is pointed to begins; Calculate the 4th pointer variable, make the 4th pointer variable point to the first address of one scan subspace down; Adopting shifting algorithm to produce next is another test data of 1 according to data line; Another test data is write the 32 bit scan subspaces that current address that the 4th pointer variable points to begins, return afterwards and calculate the 4th pointer variable, make the 4th pointer variable point to the step of the first address of one scan subspace down, so circulation is all preserved test data until whole scannings subspace.
Wherein, adopting shifting algorithm to produce next is that the step of another test data of 1 can may further comprise the steps again according to data line: current test data is moved to left 1; Current test data is moved to right 31; With move to left after 1 data with move to right after 31 data mutually or, can remove in the current test data is 1 position, and is 1 with the Data Position of next data lines correspondence.
Be that the step that test data is write a plurality of scannings subspace of dynamic storage may further comprise the steps again under 1 the scan pattern at data line: generate a five fingers pin variable that points to the dynamic storage base address; With test data 0xFFFF, FFFE writes the 32 bit scan subspaces that current address that the five fingers pin variable of generation points to begins; Calculate the five fingers pin variable, make the five fingers pin variable point to the first address of one scan subspace down; Adopting shifting algorithm to produce next is another test data of 0 according to data line; Another test data is write the 32 bit scan subspaces that current address that the five fingers pin variable points to begins, return afterwards and calculate the five fingers pin variable, make the five fingers pin variable point to the step of the first address of one scan subspace down, so circulation is all preserved test data until whole scannings subspace.
Scanning detection method at the dynamic storage that adopts the embodiment of the invention to provide carries out dynamic storage in the process of address wire detection and data line detection, may produce the detection mistake owing to data logical laws and address logic rule, generation for fear of this kind situation, the embodiment of the invention can also may further comprise the steps before step S101 or after the step S103: start timing; After starting timing, adopt iterative algorithm to produce the interior random address of a dynamic memory address scope; Write the random address that produces in the scanning subspace of this random address correspondence as test data; If timing time reaches when presetting sweep time, then from the scanning subspace, read the random address that writes, otherwise return the step that adopts iterative algorithm to produce the random address in the dynamic memory address scope; The corresponding test data of the random address that reads and the scanning subspace that writes is compared the output comparative result.
Fig. 2 shows the structure of the scanning-detecting system of the dynamic storage that the embodiment of the invention provides, and for convenience of explanation, only shows the part relevant with the embodiment of the invention.
The scanning-detecting system of the dynamic storage that the embodiment of the invention provides comprises: first data write unit 11 is used for respectively data being write a plurality of scannings subspace of dynamic storage under at least two kinds of different address scan patterns; Data-reading unit 12 is used for after first data write unit 11 writes data a plurality of scannings subspace, reading data respectively from a plurality of scannings subspace under every kind of address scan pattern; Relatively output unit 13 is used for the data that data-reading unit 12 is read and the corresponding data that first data write unit 11 writes a plurality of scannings subspace and compares, and exports comparative result.
Wherein, the address scan pattern can be word scan pattern, half-word scan pattern or byte scan pattern etc.Under the word scan pattern, each scanning subspace of dynamic storage includes four storage unit, and for dynamic storage, storing 1 bytes of memory space is a storage unit, that is to say that each scanning subspace of dynamic storage comprises 32 storage spaces; Under the half-word scan pattern, each scanning subspace of dynamic storage includes two storage unit, namely comprises 16 storage spaces; Under the byte scan pattern, each scanning subspace of dynamic storage includes a storage unit, namely comprises 8 storage spaces.
Wherein, the data that write a plurality of scannings subspace can be tentation data or random data, and the figure place of this tentation data or random data is according to the difference of the scanning subspace size of different addresses scan pattern correspondence and difference.For fear of the testing result that the data rule makes the mistake, preferably, the data that write a plurality of scannings subspace are random data.
For instance, when the data that write a plurality of scannings subspace are random data, and when with word scan pattern, half-word scan pattern and byte scan pattern dynamic storage being detected in turn respectively, Fig. 3 shows the structure of first data write unit 11 among Fig. 2.
First data write unit 11 comprises: the first pointer variable generation module 111, be used under the word scan pattern, and generate the first pointer variable current_pre of a sensing dynamic storage base address; The first random data generation module 112 is used for adopting iterative algorithm to produce one 32 random data word_pattern; First writing module 113 is used for 32 random data word_pattern that the first random data generation module 112 produces are write the 32 bit scan subspaces that current address that the first pointer variable current_pre that the first pointer variable generation module 111 generates points to begins; First computing module 114 is used for calculating the first pointer variable current_pre, makes the pointer variable current_pre that wins point to the first address of one scan subspace down; The second random data generation module 115 is used for adopting shifting algorithm to produce another 32 random data word_pattern '; First writing module 113 also is used for another 32 random data word_pattern ' that the second random data generation module 115 produces are write the 32 bit scan subspaces that current address that the first pointer variable current_pre that first computing module 114 calculates points to begins, calculate the first pointer variable current_pre by first computing module 114 afterwards, make the pointer variable current_pre that wins point to the first address of one scan subspace down, so circulation is all preserved random data until whole scannings subspace.
Wherein, the second random data generation module 115 adopts step that shifting algorithms produce 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 invention provides can also comprise: second computing module 117, be used for after the corresponding data that data that output unit 13 relatively reads data-reading unit 12 and first data write unit 11 write a plurality of scannings subspace compares, calculate first pointer variable, make the pointer variable of winning point to the base address of dynamic storage; First writing module 113 also is used for writing tentation data to the 32 bit scan subspaces that the current address of the current sensing of first pointer variable begins; Second computing module 117 also is used for calculating first pointer variable, makes the pointer variable of winning point to the first address of one scan subspace down; First writing module 113 also is used for writing tentation data to the 32 bit scan subspaces that the current address of the current sensing of first pointer variable begins; Calculate first pointer variable by second computing module 117 afterwards, make the pointer variable of winning point to the step of the first address of one scan subspace down, so circulation is all preserved tentation data until whole scannings subspace.Because each of each storage unit is 0 or 1, therefore, tentation data wherein is special data, as: 0x0000,0000,0x5555,5555,0xaaaa, aaaa etc. are to guarantee that storage unit is covered comprehensively.
In addition, first data write unit 11 also comprises: handover module 116 is used for switching the half-word scan pattern after relatively output unit 13 is exported comparative result under the word scan pattern; The first pointer variable generation module 111 also is used for after handover module 116 switches to the half-word scan pattern, generates second pointer variable of a sensing dynamic storage base address; The first random data generation module 112 also is used for adopting iterative algorithm to produce one 16 random data; 16 random data that first writing module 113 also is used for producing write the 16 bit scan subspaces that the current address of second pointer variable sensing of generation begins; First computing module 114 also is used for calculating second pointer variable, makes second pointer variable point to the first address of one scan subspace down; The second random data generation module 115 also is used for adopting shifting algorithm to produce another 16 random data; Another 16 random data that first writing module 113 also is used for producing write the 16 bit scan subspaces that the current address of second pointer variable sensing begins, calculate second pointer variable by first computing module 114 afterwards, make second pointer variable point to the first address of one scan subspace down, so circulation is all preserved random data until whole scannings subspace.
In addition, handover module 116 also is used for switching the byte scan pattern after relatively output unit 13 is exported comparative result under the half-word scan pattern, and the first pointer variable generation module 111 also is used for the 3rd pointer variable that the dynamic storage base address is pointed in generation one; The first random data generation module 112 also is used for adopting iterative algorithm to produce one 8 random data; 8 random data that first writing module 113 also is used for producing write the 8 bit scan subspaces that the current address of the 3rd pointer variable sensing of generation begins; First computing module 114 also is used for calculating the 3rd pointer variable, makes the 3rd pointer variable point to the first address of one scan subspace down; The second random data generation module 115 also is used for adopting shifting algorithm to produce another 8 random data; Another 8 random data that first writing module 113 also is used for producing write the 8 bit scan subspaces that the current address of the 3rd pointer variable sensing begins, calculate second pointer variable by first computing module 114 afterwards, make second pointer variable point to the first address of one scan subspace down, so circulation is all preserved random data until whole scannings subspace.
The scanning-detecting system of the dynamic storage that the embodiment of the invention provides can also be realized the scanning of dynamic storage data line is detected when realizing the detection of dynamic memory address line sweep.At this moment, the scanning-detecting system of the dynamic storage that the embodiment of the invention provides can also comprise: second data write unit 14, being used for respectively at data line is under 0 the scan pattern and data line is under 1 the scan pattern, test data is write a plurality of scannings subspace of dynamic storage; It is under 0 the scan pattern or data line is under 1 the scan pattern that data-reading unit 12 also is used at data line, reads the test data that second data write unit 14 writes respectively from a plurality of scannings subspace; Relatively output unit 13 also is used for the data that data-reading unit 12 is read and the corresponding test data that second data write unit 14 writes a plurality of scannings subspace and compares, and exports comparative result.
Fig. 4 shows the structure of second data write unit 14 among Fig. 2.
Second data write unit 14 comprises: the second pointer variable generation module 141, be used under data line is 0 scan pattern, and generate the 4th pointer variable of pointing to the dynamic storage base address; Second writing module 142 is used for test data 0x0000, the 32 bit scan subspaces that the current address that 0001 the 4th pointer variable that writes 141 generations of the second pointer variable generation module is pointed to begins; The 3rd computing module 143 is used for calculating the 4th pointer variable, makes the 4th pointer variable point to the first address of one scan subspace down; Test data generation module 144, be used for adopting shifting algorithm to produce next is another test data of 1 according to data line; Second writing module 142 also is used for another test data that test data generation module 144 produces is write the 32 bit scan subspaces that current address that the 4th pointer variable that the 3rd computing module 143 calculates points to begins, calculate the 4th pointer variable by the 3rd computing module 143 afterwards, make the 4th pointer variable point to the first address of one scan subspace down, so circulation is all preserved test data until whole scannings subspace.
Wherein, data generation module 144 adopt shifting algorithms produce next according to data line be another test data of 1 process as mentioned above, do not repeat them here.
In addition, the second pointer variable generation module 141 also is used under data line is 1 scan pattern, generates a five fingers pin variable that points to the dynamic storage base address; Second writing module 142 also is used for test data 0xFFFF, and FFFE writes the 32 bit scan subspaces that current address that the five fingers pin variable that the second pointer variable generation module 141 generates points to begins; The 3rd computing module 143 also is used for calculating the five fingers pin variable, makes the five fingers pin variable point to the first address of one scan subspace down; It is another test data of 0 according to data line that test data generation module 144 also be used for to adopt shifting algorithm to produce next; Second writing module 142 also is used for another test data that test data generation module 144 produces is write the 32 bit scan subspaces that current address that the five fingers pin variable that the 3rd computing module 143 calculates points to begins, calculate the five fingers pin variable by the 3rd computing module 143 afterwards, make the five fingers pin variable point to the first address of one scan subspace down, so circulation is all preserved test data until whole scannings subspace.
For fear of the detection mistake that produces owing to data logical laws and address logic rule, the scanning-detecting system of the dynamic storage that the embodiment of the invention provides can also comprise: timing unit 17 is used for timing; Random address generation unit 16 is used for after timing unit 17 starts timing, adopts iterative algorithm to produce the interior random address of a dynamic memory address scope; The 3rd data write unit 15 is used for the random address that random address generation unit 16 produces is write as test data the scanning subspace of this random address correspondence; When data-reading unit 12 also is used for timing time at timing unit 17 and reaches default sweep time, from the scanning subspace, read the random address that the 3rd data write unit 15 writes; When random address generation unit 16 also is used for timing time at timing unit 17 and does not reach default sweep time, adopt iterative algorithm to produce random address in the dynamic memory address scope; Relatively output unit 13 also is used for the random address that data-reading unit 12 is read and the corresponding test data that the 3rd data write unit 15 writes the scanning subspace and compares, and exports comparative result.
The scanning detection method of the dynamic storage that the embodiment of the invention provides is to adopt at least two kinds of different address scan patterns with system, respectively dynamic storage is scanned detection, can cover the address of each storage unit of dynamic storage really, testing result is more accurate; And further, adopt random data that dynamic storage is scanned detection, avoided the influence of data rule to testing result, further improved the degree of accuracy of testing result.Have again, the scanning detection method of the dynamic storage that the embodiment of the invention provides and system are in the scanning detection that realizes the dynamic memory address line, can also be that 1 scan pattern and/or data line are under 0 the scan pattern at data line, realize the scanning of dynamic storage data line is detected.In addition, the scanning detection method of the dynamic storage that the embodiment of the invention provides and system can also be by constantly generating random address in default sweep time, and read comparison after random address write the respective scanned subspace as data, with the detection mistake of avoiding producing owing to data logical laws and address logic rule, further improve and detect degree of accuracy.
One of ordinary skill in the art will appreciate that all or part of step that realizes in above-described embodiment method is can control relevant hardware by program to finish, described program can be in being stored in a computer read/write memory medium, described storage medium is as ROM/RAM, disk, CD etc.
The above only is preferred embodiment of the present invention, not in order to limiting the present invention, all any modifications of doing within the spirit and principles in the present invention, is equal to and replaces and improvement etc., all should be included within protection scope of the present invention.
Claims (10)
1. the scanning detection method of a dynamic storage is characterized in that, said method comprising the steps of:
Under at least two kinds of different address scan patterns, data are write a plurality of scannings subspace of dynamic storage respectively;
Under every kind of address scan pattern, after described data being write described a plurality of scannings subspace, read data respectively from described a plurality of scannings subspace;
The described data that read and the corresponding data that writes described a plurality of scannings subspace are compared the output comparative result.
2. the scanning detection method of dynamic storage as claimed in claim 1 is characterized in that, 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, the described step that data are write a plurality of scannings subspace of dynamic storage may further comprise the steps:
Generate first pointer variable of the described dynamic storage of sensing base address;
Adopt iterative algorithm to produce one 32 random data;
Described 32 random data that produce are write the 32 bit scan subspaces that current address that described first pointer variable of generation points to begins;
Calculate described first pointer variable, make described first pointer variable point to the first address of one scan subspace down;
Adopt shifting algorithm to produce another 32 random data;
Described another 32 random data that produce are write the 32 bit scan subspaces that current address that described first pointer variable that calculates points to begins, return the step of described first pointer variable of described calculating afterwards, so circulation is all preserved random data until whole described scannings subspace.
3. the scanning detection method of dynamic storage as claimed in claim 2 is characterized in that, the step that described employing shifting algorithm produces another 32 random data may further comprise the steps again:
Current 32 random data are moved to left 5;
Current 32 random data are moved to right 27;
With move to left after 5 data with move to right after 27 data mutually or;
With mutually or after 32 random data and described 32 random data additions of adopting iterative algorithm to produce, obtain described another 32 random data.
4. the scanning detection method of dynamic storage as claimed in claim 2, it is characterized in that, under described word scan pattern, after the step that the described described data that will read and the corresponding data that writes described a plurality of scannings subspace compare, 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 subspaces that begin to the current address that obtains the current sensing of first pointer variable write tentation data, and described tentation data is 0x00000000,0x55555555 or 0xaaaaaaaa;
Calculate described first pointer variable, make described first pointer variable point to the first address of one scan subspace down;
The 32 bit scan subspaces that begin to the current address of the current sensing of described first pointer variable write tentation data, return described first pointer variable of described calculating afterwards, make described first pointer variable point to the step of the first address of one scan subspace down, so circulation is all preserved described tentation data until whole described scannings subspace.
5. the scanning detection method of dynamic storage as claimed in claim 2 is characterized in that, under described word scan pattern, after the step of described output comparative result, described method also comprises the step of switching described half-word scan pattern; Under described half-word scan pattern, the described step that data are write a plurality of scannings subspace of dynamic storage may further comprise the steps: generate second pointer variable of pointing to described dynamic storage base address; Adopt iterative algorithm to produce one 16 random data; Described 16 random data that produce are write the 16 bit scan subspaces that current address that described second pointer variable of generation points to begins; Calculate described second pointer variable, make described second pointer variable point to the first address of one scan subspace down; Adopt shifting algorithm to produce another 16 random data; Described another 16 random data that produce are write the 16 bit scan subspaces that current address that described second pointer variable points to begins, return the step of described second pointer variable of described calculating afterwards, so circulation is all preserved random data until whole described scannings subspace;
Under described half-word scan pattern, after the step of described output comparative result, described method also comprises the step of switching described byte scan pattern, under described byte scan pattern, the described step that data are write a plurality of scannings subspace of dynamic storage may further comprise the steps: generate the 3rd pointer variable of pointing to the dynamic storage base address; Adopt iterative algorithm to produce one 8 random data; Described 8 random data that produce are write the 8 bit scan subspaces that current address that described the 3rd pointer variable of generation points to begins; Calculate described the 3rd pointer variable, make described the 3rd pointer variable point to the first address of one scan subspace down; Adopt shifting algorithm to produce another 8 random data; Described another 8 random data that produce are write the 8 bit scan subspaces that current address that described the 3rd pointer variable points to begins, return the step of described the 3rd pointer variable of described calculating afterwards, so circulation is all preserved random data until whole described scannings subspace.
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, data are write before the step of a plurality of scannings subspace of dynamic storage or after the step of described output comparative result, described method is further comprising the steps of:
Be under 0 the scan pattern and data line is under 1 the scan pattern at data line respectively, test data write described a plurality of scannings subspace of described dynamic storage;
Be under 0 the scan pattern at described data line or described data line is under 1 the scan pattern, the read test data respectively from described a plurality of scannings subspace;
The described test data that reads and the corresponding test data that writes described a plurality of scannings subspace are compared the output comparative result.
7. 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, data are write before the step of a plurality of scannings subspace of dynamic storage or after the step of described output comparative result, described method is further comprising the steps of:
Start timing;
After starting timing, adopt iterative algorithm to produce the interior random address of a described dynamic memory address scope;
Write the described random address that produces in the scanning subspace of described random address correspondence as test data;
If timing time reaches when presetting sweep time, then from described scanning subspace, read the described random address that writes;
The described random address that reads and the corresponding test data that writes the scanning subspace are compared the output comparative result.
8. the scanning-detecting system of a dynamic storage is characterized in that, described system comprises:
First data write unit is used for respectively data being write a plurality of scannings subspace of dynamic storage under at least two kinds of different address scan patterns;
Data-reading unit is used for after described first data write unit writes described data described a plurality of scannings subspace, reading data respectively from described a plurality of scannings subspace under every kind of address scan pattern;
Relatively output unit is used for the described data that described data-reading unit is read and the corresponding data that described first data write unit writes described a plurality of scannings subspace and compares, and exports comparative result.
9. the scanning-detecting system of dynamic storage as claimed in claim 8 is characterized in that, described system also comprises:
Second data write unit, being used for respectively at data line is under 0 the scan pattern and data line is under 1 the scan pattern, test data is write described a plurality of scannings subspace of described dynamic storage;
It is under 0 the scan pattern or described data line is under 1 the scan pattern that described data-reading unit also is used at described data line, reads the described test data that described second data write unit writes respectively from described a plurality of scannings subspace;
Described relatively output unit also is used for the described test data that described data-reading unit is read and the corresponding test data that described second data write unit writes described a plurality of scannings subspace and compares, and exports comparative result.
10. the scanning-detecting system of dynamic storage as claimed in claim 8 is characterized in that, described system also comprises:
Timing unit is used for timing;
The random address generation unit is used for after described timing unit starts timing, adopts iterative algorithm to produce the interior random address of a dynamic memory address scope;
The 3rd data write unit is used for the described random address that described random address generation unit produces is write as test data the scanning subspace of described random address correspondence;
When described data-reading unit also is used for timing time at described timing unit and reaches default sweep time, from described scanning subspace, read the described random address that described the 3rd data write unit writes;
Described relatively output unit also is used for the described random address that described data-reading unit is read and the corresponding test data that described the 3rd data write unit writes described scanning subspace and compares, and 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 true CN103295645A (en) | 2013-09-11 |
| CN103295645B 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 (2)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN105607961A (en) * | 2015-12-17 | 2016-05-25 | 北京兆易创新科技股份有限公司 | Method for scanning error bits |
| CN112035379A (en) * | 2020-09-09 | 2020-12-04 | 浙江大华技术股份有限公司 | Method and device for using storage space, storage medium and electronic device |
Families Citing this family (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 |
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 (4)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN105607961A (en) * | 2015-12-17 | 2016-05-25 | 北京兆易创新科技股份有限公司 | Method for scanning error bits |
| CN105607961B (en) * | 2015-12-17 | 2019-03-08 | 北京兆易创新科技股份有限公司 | A method of scanning error bit |
| CN112035379A (en) * | 2020-09-09 | 2020-12-04 | 浙江大华技术股份有限公司 | Method and device for using storage space, storage medium and electronic device |
| CN112035379B (en) * | 2020-09-09 | 2022-06-14 | 浙江大华技术股份有限公司 | Method and device for using storage space, storage medium and electronic device |
Also Published As
| Publication number | Publication date |
|---|---|
| CN103295645B (en) | 2016-03-09 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| CN111381999B (en) | Error correction in row hammer mitigation and target row refresh | |
| US10929474B2 (en) | Proactive corrective actions in memory based on a probabilistic data structure | |
| US9223648B2 (en) | Memory storage device, memory controller thereof, and method for processing data thereof | |
| US9671961B2 (en) | Memory controller, storage apparatus, information processing system, and control method for the same | |
| US9355703B2 (en) | Devices, systems and methods with improved refresh address generation | |
| CN110858128B (en) | Data storage device and method for sharing memory in controller | |
| US11113145B2 (en) | Memory device, semiconductor device, and semiconductor system | |
| CN106802870B (en) | high-efficiency Nor-Flash controller of embedded system chip and control method | |
| US20090019234A1 (en) | Cache memory device and data processing method of the device | |
| KR101240634B1 (en) | Apparatus for fail detecting in solid state drive tester | |
| CN103077094A (en) | Storage control apparatus, storage apparatus, information processing system, and storage control method | |
| US9620227B1 (en) | Characterizing and operating a non-volatile memory device | |
| US11625196B2 (en) | Semiconductor memory device and operating method thereof | |
| US20220137859A1 (en) | Computing system and operating method thereof | |
| KR20210003946A (en) | Logical-physical data structure | |
| CN103295645B (en) | A kind of scanning detection method of dynamic storage and system | |
| 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 | |
| US11264114B2 (en) | Test pattern generator and method for generating test pattern | |
| US11275523B2 (en) | Per cursor logical unit number sequencing | |
| US8953393B2 (en) | Semiconductor device and operating method thereof | |
| US20170017410A1 (en) | Memory controller | |
| CN117393032B (en) | Storage device and data processing method thereof | |
| CN110851372B (en) | Storage device and cache area addressing method |
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 | ||
| 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 |
|
| 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 |
|
| PC01 | Cancellation of the registration of the contract for pledge of patent right | ||
| PE01 | Entry into force of the registration of the contract for pledge of patent right | ||
| 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 |
|
| 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: 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 |
|
| CP01 | Change in the name or title of a patent holder | ||
| 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. |
|
| CP02 | Change in the address 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. |