CN106055420A - Method, device and equipment for data verification - Google Patents

Method, device and equipment for data verification Download PDF

Info

Publication number
CN106055420A
CN106055420A CN201610340011.3A CN201610340011A CN106055420A CN 106055420 A CN106055420 A CN 106055420A CN 201610340011 A CN201610340011 A CN 201610340011A CN 106055420 A CN106055420 A CN 106055420A
Authority
CN
China
Prior art keywords
identifying code
data
memory area
updated
host computer
Prior art date
Legal status (The legal status is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the status listed.)
Granted
Application number
CN201610340011.3A
Other languages
Chinese (zh)
Other versions
CN106055420B (en
Inventor
盖新成
柴猛
Current Assignee (The listed assignees may be inaccurate. Google has not performed a legal analysis and makes no representation or warranty as to the accuracy of the list.)
Neusoft Medical Systems Co Ltd
Original Assignee
Neusoft Medical Systems Co Ltd
Priority date (The priority date is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the date listed.)
Filing date
Publication date
Application filed by Neusoft Medical Systems Co Ltd filed Critical Neusoft Medical Systems Co Ltd
Priority to CN201610340011.3A priority Critical patent/CN106055420B/en
Publication of CN106055420A publication Critical patent/CN106055420A/en
Application granted granted Critical
Publication of CN106055420B publication Critical patent/CN106055420B/en
Expired - Fee Related legal-status Critical Current
Anticipated expiration legal-status Critical

Links

Classifications

    • G—PHYSICS
    • G06—COMPUTING; CALCULATING OR COUNTING
    • G06F—ELECTRIC DIGITAL DATA PROCESSING
    • G06F11/00—Error detection; Error correction; Monitoring
    • G06F11/07—Responding to the occurrence of a fault, e.g. fault tolerance
    • G06F11/0703—Error or fault processing not based on redundancy, i.e. by taking additional measures to deal with the error or fault not making use of redundancy in operation, in hardware, or in data representation
    • G—PHYSICS
    • G06—COMPUTING; CALCULATING OR COUNTING
    • G06F—ELECTRIC DIGITAL DATA PROCESSING
    • G06F11/00—Error detection; Error correction; Monitoring
    • G06F11/07—Responding to the occurrence of a fault, e.g. fault tolerance
    • G06F11/08—Error detection or correction by redundancy in data representation, e.g. by using checking codes
    • G—PHYSICS
    • G06—COMPUTING; CALCULATING OR COUNTING
    • G06F—ELECTRIC DIGITAL DATA PROCESSING
    • G06F12/00—Accessing, addressing or allocating within memory systems or architectures
    • G06F12/02—Addressing or allocation; Relocation
    • G06F12/0223—User address space allocation, e.g. contiguous or non contiguous base addressing
    • G06F12/023—Free address space management
    • G06F12/0238—Memory management in non-volatile memory, e.g. resistive RAM or ferroelectric memory
    • G06F12/0246—Memory management in non-volatile memory, e.g. resistive RAM or ferroelectric memory in block erasable memory, e.g. flash memory
    • G—PHYSICS
    • G06—COMPUTING; CALCULATING OR COUNTING
    • G06F—ELECTRIC DIGITAL DATA PROCESSING
    • G06F13/00—Interconnection of, or transfer of information or other signals between, memories, input/output devices or central processing units
    • G06F13/10—Program control for peripheral devices
    • G06F13/102—Program control for peripheral devices where the programme performs an interfacing function, e.g. device driver

Landscapes

  • Engineering & Computer Science (AREA)
  • Theoretical Computer Science (AREA)
  • Physics & Mathematics (AREA)
  • General Engineering & Computer Science (AREA)
  • General Physics & Mathematics (AREA)
  • Quality & Reliability (AREA)
  • Storage Device Security (AREA)
  • Techniques For Improving Reliability Of Storages (AREA)

Abstract

The embodiment of the invention discloses a method, device and equipment for data verification and aims to reduce an erasure frequency of a lower computer storage device, prolong a service life of the storage device and shorten starting time of an upper computer. The method comprises the steps that a first verification code is acquired when a first lower computer is powered on, wherein the first verification code is a verification code corresponding to first data which is used to update a first storage area last time, and the first storage area belongs to the first lower computer; a second verification code can be obtained according to existing data stored in the first storage area; and if the second verification code is matched with the first verification code, the first lower computer can use the existing data stored in the first storage area for work, and the existing data in the first storage area can be verified.

Description

A kind of data verification method, device and equipment
Technical field
The present invention relates to computer realm, particularly relate to a kind of data verification method, device and equipment.
Background technology
At present, a lot of systems all include that host computer and slave computer, so-called host computer refer to send the meter of operational order Calculation machine, these computers typically have display screen, for video data, image etc., and interact with user；So-called the next Machine refers to the computer obtaining device data and being directly controlled equipment, such as PLC (Programmable Logic Controller, programmable logic controller (PLC)), single-chip microcomputer etc..After host computer is started shooting, can enter needing the slave computer controlled Row selects so that it is obtain electric work, it is also possible to allow all controlled slave computers all obtain electric automatically.The data of slave computer are typically deposited Storage is in the memory area of slave computer, and these data can be the parameter etc. of application program or application program, for the work of slave computer Make and run.In order to ensure the properly functioning of equipment, except requiring the data self ensureing to be stored in slave computer memory area Correctness, also to get rid of the error in data caused due to memory area fault.Such as, for armarium, slave computer The impact of X-ray, ionizing radiation etc. may be often subject to and cause the damage of its memory area, and then may result in storage In region, the data of storage occur to lose or produce mistake, thus result in the device fails controlled by this slave computer.
In order to avoid the appearance of the problems referred to above, prior art, when host computer is started shooting, is forced obtaining on electric slave computer Memory area is wiped, and correct data are sent to slave computer, and slave computer is after receiving correct data, by this number According in the memory area being stored in slave computer.But this mode needs slave computer to power on every time, its memory area will be gone up Position machine is wiped once, and for the erasing life-span that memory area is limited, prior art causes serious damage to memory area Consumption.It addition, for host computer, prior art needs host computer to be required for the logical of experience and slave computer after start every time A series of processes such as news, response, seriously extend the available machine time of host computer.
Summary of the invention
In order to solve technical problem present in prior art, the present invention provides a kind of data verification method, device and sets Standby, it is achieved that to reduce the number of times to the erasing of slave computer memory area, extend the life-span of described memory area, and shorten The purpose of position machine available machine time.
Embodiments providing a kind of data verification method, described method includes:
The first slave computer obtain electric after, obtain the first identifying code, described first identifying code is the last for first The identifying code that the first data that memory area is updated are corresponding, described first memory area belongs to described first slave computer；
The second identifying code is obtained according to the available data of storage in described first memory area；
If described second identifying code and described first identifying code coupling, the most described first slave computer utilizes described first storage In region, the available data of storage is operated, it is achieved to the verification of available data in described first memory area.
Preferably, described acquisition the first identifying code includes:
Sending the first identifying code to host computer and obtain request, described first identifying code obtains in request and carries described first The mark of the available data of storage in memory area, in order to described host computer obtains request and institute according to described first identifying code State mark and obtain described first identifying code；
Receive described first identifying code that described host computer sends.
Preferably, described acquisition the first identifying code includes:
Obtain and deposit when the available data in the first memory area of described first slave computer is updated by the last time Store up the first identifying code at described first slave computer.
Preferably, if described second identifying code and described first identifying code do not mate, the most described method also includes:
Utilize the first data that described first memory area is updated by the last time, in described first memory area The available data of storage is updated.
Preferably, described the first data utilizing the last time to be updated described first memory area are to described first Available data in memory area is updated including:
More newly requested to host computer transmission first, the described first more newly requested mark including described available data, with Toilet is stated host computer and is obtained the first data to described first memory area renewal of the corresponding the last time according to described mark；
Receive the first data that described first memory area updates by described the last time that described host computer sends, and right Described available data is updated.
Preferably, the first data that described first memory area is updated by described the last time are stored in the second storage In region, described second memory area is not belonging to described host computer；
Described the first data utilizing the last time to be updated described first memory area, to described first memory block Available data in territory is updated including:
Utilize described first data of storage, the available data to described first memory area in described second memory area It is updated.
Preferably, described method also includes:
The 3rd identifying code is obtained according to the first data in described second memory area；
If described 3rd identifying code mates with described first identifying code, then perform described utilization in described second memory area First data of storage, the step that the available data of described first memory area is updated.
Preferably, if described 3rd identifying code does not mates with described first identifying code, and described first identifying code is to pass through Sending the first identifying code to host computer and obtain what request obtained, the most described method also includes:
More newly requested to host computer transmission second, the described second more newly requested mark including described available data, with Toilet is stated host computer and is obtained the second data to described first memory area renewal of the corresponding the last time according to described mark；
Receive the second data that described first memory area updates by described the last time that described host computer sends, and right Described available data is updated.
Preferably, if described 3rd identifying code does not mates with described first identifying code, and described first identifying code is The identifying code of described first slave computer it is stored in, then when closely once the available data in described first memory area being updated Described method also includes:
If described 3rd identifying code mates with described second identifying code, then described first identifying code is replaced with the described 3rd Identifying code, and described 3rd identifying code is stored.
Preferably, it is in the last time, the available data in described first memory area to be carried out at described first identifying code On the premise of being stored in the identifying code of described first slave computer during renewal, if described second identifying code, described first identifying code with And described 3rd identifying code does not all respectively mate, the most described method also includes:
The message that the first memory area is abnormal is sent to described host computer；And/or,
To host computer sends the depth of the night newly requested, the newly requested mark including described available data depth of the night the in of described, with Toilet is stated host computer and is obtained the 3rd data to described first memory area renewal of the corresponding the last time according to described mark；
Receive the 3rd data that described first memory area updates by described the last time that described host computer sends, and right Described available data is updated.
Preferably, the first slave computer obtain electric after, described method also includes:
If the available data in described first memory area need not the preset data being updated in described host computer, then hold The step of row described first identifying code of described acquisition, described preset data and described the last time are for entering the first memory area The first data that row updates are different.
Preferably, if the data in described first memory area need to be updated to described preset data, the most described method is also Including:
Receive described preset data and the identifying code corresponding with described preset data that described host computer sends；
Utilize described preset data that the available data in described first memory area is updated, obtain the 4th data, And the identifying code of correspondence is obtained according to described 4th data；
If the identifying code coupling that identifying code corresponding to described preset data is corresponding with described 4th data, then store described pre- If the identifying code that data are corresponding or the identifying code corresponding with described 4th data.
The embodiment of the present invention additionally provides a kind of data calibration device, and described device includes:
First identifying code acquisition module, the second identifying code acquisition module and correction verification module；
Wherein, described first identifying code acquisition module, for the first slave computer obtain electric after, obtain the first identifying code, institute Stating the first identifying code is the last identifying code corresponding for the first data being updated the first memory area, described the One memory area belongs to described first slave computer；
Described second identifying code acquisition module, for obtaining the according to the available data of storage in described first memory area Two identifying codes；
Described correction verification module, if for described second identifying code and described first identifying code coupling, then utilizing described first In memory area, the available data of storage is operated, it is achieved to the verification of available data in described first memory area.
Preferably, described first identifying code acquisition module includes: the first identifying code request sending module and the first identifying code Receiver module；
Described first identifying code request sending module, obtains request for sending the first identifying code to host computer, and described the One identifying code obtains and carries the mark of the available data of storage in described first memory area in request, in order to described host computer Obtain request according to described first identifying code and described mark obtains described first identifying code；
Described first identifying code receiver module, for receiving described first identifying code that described host computer sends.
Preferably, described first identifying code acquisition module specifically for:
Obtain and deposit when the available data in the first memory area of described first slave computer is updated by the last time Store up the first identifying code at described first slave computer.
Preferably, described device also includes:
More new module, if not mating for described second identifying code and described first identifying code, then it is the last right to utilize The first data that described first memory area is updated, are carried out more the available data of storage in described first memory area Newly.
Preferably, described more new module includes: first updates request sending module and the first data reception module；
Described first updates request sending module, and for more newly requested to host computer transmission first, described first renewal please Seek the mark including described available data, in order to described host computer obtains corresponding the last time to described according to described mark The first data that first memory area updates；
Described first data reception module, deposits described first for receiving described the last time of described host computer transmission First data of storage area area update, and described available data is updated.
Preferably, the first data that described first memory area is updated by described the last time are stored in the second storage In region, described second memory area is not belonging to described host computer；
Described more new module, specifically for utilizing described first data of storage in described second memory area, to described The available data of the first memory area is updated.
Preferably, described device also includes: the 3rd identifying code acquisition module, for according in described second memory area First data obtain the 3rd identifying code；
Described more new module, if mating with described first identifying code specifically for described 3rd identifying code, then utilizes described In second memory area, described first data of storage, are updated the available data of described first memory area.
Preferably, if described 3rd identifying code does not mates with described first identifying code, and described first identifying code is to pass through Sending the first identifying code to host computer and obtain what request obtained, the most described device also includes:
Second updates request sending module and the second data reception module；
Described second updates request sending module, and for more newly requested to host computer transmission second, described second renewal please Seek the mark including described available data, in order to described host computer obtains corresponding the last time to described according to described mark The second data that first memory area updates；
Described second data reception module, deposits described first for receiving described the last time of described host computer transmission Second data of storage area area update, and described available data is updated.
Preferably, if described 3rd identifying code does not mates with described first identifying code, and described first identifying code is The identifying code of described first slave computer it is stored in, then when closely once the available data in described first memory area being updated Described device also includes:
Replacement module, if mating with described second identifying code, then by described first identifying code for described 3rd identifying code Replace with described 3rd identifying code, and described 3rd identifying code is stored.
Preferably, it is in the last time, the available data in described first memory area to be carried out at described first identifying code On the premise of being stored in the identifying code of described first slave computer during renewal, if described second identifying code, described first identifying code with And described 3rd identifying code does not all respectively mate, the most described device also includes:
Unexpected message sending module, for sending, to described host computer, the message that the first memory area is abnormal；
And/or, newly requested sending module and the 3rd data reception module depth of the night the in of；
Newly requested sending module depth of the night the in of described the, for newly requested to host computer sends the depth of the night, the described 3rd update please Seek the mark including described available data, in order to described host computer obtains corresponding the last time to described according to described mark The 3rd data that first memory area updates；
Described 3rd data reception module, deposits described first for receiving described the last time of described host computer transmission 3rd data of storage area area update, and described available data is updated.
The embodiment of the invention also discloses a kind of data check equipment, described equipment includes processor, described for storing The memory area of processor executable；
Wherein, described processor is configured to:
The first slave computer obtain electric after, obtain the first identifying code, described first identifying code is the last for first The identifying code that the first data that memory area is updated are corresponding, described first memory area belongs to described first slave computer；
The second identifying code is obtained according to the available data of storage in described first memory area；
If described second identifying code and described first identifying code coupling, the most described first slave computer utilizes described first storage In region, the available data of storage is operated, it is achieved to the verification of available data in described first memory area.
In the present invention, the first slave computer obtain electric after, obtain the first identifying code, described first identifying code is the last For the identifying code that the first data being updated the first memory area are corresponding, and store according in described first memory area Available data obtain the second identifying code, if the two coupling, then illustrate in described first memory area that the available data of storage is Correct, described first slave computer can directly use this available data to be operated, and described first memory area is without quilt Erasing and renewal.Powering on relative to prior art slave computer, its memory area will be forced erasing and update, the present invention every time Effectively reduce and belong to the number of times that described first memory area of described first slave computer is wiped free of, extend described first storage The life-span in region.Further, since prior art is after wiping memory area, slave computer to re-download from host computer Data, and in the present invention, owing to the available data of described first memory area is without being updated, thus decrease from host computer The number of times of down loading updating data, the most just decreases the communication between host computer, shortens the available machine time of host computer, same to time About system resource.
Accompanying drawing explanation
In order to be illustrated more clearly that the embodiment of the present application or technical scheme of the prior art, below will be to embodiment or existing In having technology to describe, the required accompanying drawing used is briefly described, it should be apparent that, the accompanying drawing in describing below is only this Some embodiments described in application, for those of ordinary skill in the art, on the premise of not paying creative work, Other accompanying drawing can also be obtained according to these accompanying drawings.
The flow chart of a kind of data verification method that Fig. 1 provides for the embodiment of the present invention one；
The flow chart of a kind of data verification method that Fig. 2 provides for the embodiment of the present invention two；
The flow chart of a kind of data verification method that Fig. 3 provides for the embodiment of the present invention three；
The flow chart of a kind of data verification method that Fig. 4 provides for the embodiment of the present invention four；
The structured flowchart of a kind of data calibration device that Fig. 5 provides for the embodiment of the present invention five；
The hardware structure figure of a kind of data calibration device that Fig. 6 provides for the embodiment of the present invention five.
Detailed description of the invention
In order to make those skilled in the art be more fully understood that the present invention program, below in conjunction with in the embodiment of the present invention Accompanying drawing, is clearly and completely described the technical scheme in the embodiment of the present invention, it is clear that described embodiment is only this Invent a part of embodiment rather than whole embodiments.Based on the embodiment in the present invention, those of ordinary skill in the art exist Do not make the every other embodiment obtained under creative work premise, broadly fall into the scope of protection of the invention.
Embodiment one:
Seeing Fig. 1, this figure is the flow chart of a kind of data verification method that the embodiment of the present invention one provides.
The data verification method that the present embodiment provides comprises the steps:
Step S101: the first slave computer obtain electric after, obtain the first identifying code, described first identifying code is the last using In the identifying code that the first data being updated the first memory area are corresponding, described first memory area belongs to described first time Position machine.
As background section is recorded, so-called slave computer is for host computer, and described slave computer refers to directly Obtain status of equipment, the computer directly equipment being controlled, including PLC, single-chip microcomputer etc..So-called PLC, refers to able to programme patrolling Volume controller, is a kind of programmable memory, can store program inside it, can according to instruction execution logic computing, enter Row sequential control, regularly, counting etc., generally by power supply, CPU (CPU) and/or micro-control unit (MCU), storage Device, input/output interface, communication module etc. form.So-called single-chip microcomputer is a kind of IC chip, is to use ultra-large collection Become circuit engineering central processor CPU and/or micro-control unit (MCU), the flash memory (Flash with data-handling capacity Memory), random access memory ram, read only memory ROM, multiple I/O mouth and the interruption function such as system, timer/counter (may also include the circuit such as display driver circuit, pulse-width modulation circuit, analog multiplexer, A/D converter) is integrated into one On block silicon chip, thus constitute a little and perfect microcomputer system.Can be total by CAN between host computer and slave computer Line carries out communication.
In the present embodiment, described first slave computer includes the first memory area, and described first memory area is used for storing The available data run for described first slave computer, described first memory area may belong in MCU one and erasable deposits Part or all of reservoir, it is also possible to include multiple erasable memorizer.Described erasable memorizer can be flash memory (including nonvolatile flash memory NAND Flash, NOR Flash etc.), EPROM (erasable programmable read-only Memory, Erasable Programmable Read Only Memory EPROM) etc..The purpose of the present embodiment is, by verifying described available data, to protect Demonstrate,prove the correctness of described available data, thus ensure the properly functioning of described first slave computer.
In order to realize this target, the present embodiment described first slave computer obtain electric after, according to obtaining the first identifying code, described First identifying code be the last for described first memory area is updated time checking corresponding to the first data of using Code.Further, the second identifying code is obtained according to the available data of storage in described first memory area.
The existing multiple algorithm that data itself are verified of prior art, such as redundancy check, exclusive or check, the most superfluous Remaining verification etc..The check code that wherein said redundancy check obtains is referred to as Cyclic Redundancy Code (Cyclic Redundancy Code, letter Claim CRC)；The check code that described exclusive or check obtains is referred to as information block check character, and (block check character is called for short BCC)；The check code that described LRC obtains be referred to as vertical redundancy code (Longitudinal Redundancy Code, It is called for short LRC).Which kind of algorithm is the present invention use show storage in described first data and described first memory area to concrete Data are had to carry out verifying and respectively obtain the identifying code of correspondence and be not specifically limited, but, obtain first according to described first data The checking algorithm of identifying code, and obtain the checking algorithm of the second identifying code according to described available data and should match.
Step S102: obtain the second identifying code according to the available data of storage in described first memory area.
Although in the present embodiment, first carry out step S101, rear step S102 that performs, but in actual applications, permissible This two step is reversed, i.e. the first slave computer obtain electric after, first obtain the second identifying code according to described available data, then exist Obtain the first identifying code, or, the two step can also be carried out simultaneously.Above replacement scheme is also in protection scope of the present invention Within.
Step S103: judge whether described second identifying code and described first identifying code mate, the most then perform step S104。
So-called " coupling " includes two kinds of situations, and the first is both sides' equivalent of coupling, and the second is the both sides of coupling With, but corresponding.In the present embodiment, it is judged that whether described second identifying code and described first identifying code mate, and can be to sentence Disconnected described second identifying code is the most identical with described first identifying code, it is also possible to be to judge described second identifying code and described first Identifying code is the most corresponding, the most identical or corresponding, will see selection and the setting of concrete checking algorithm.About correspondence, can To include multiple corresponded manner, common corresponded manner is contrary, such as, if the first identifying code is 10101, then if described Two identifying codes are 01010, i.e. it is believed that the two is coupling.
Step S104: described first slave computer utilizes the available data of storage in described first memory area to be operated, Realize the verification of available data in described first memory area.
In the present embodiment, according to described second identifying code, in described first memory area, the available data of storage obtains Identifying code, described first identifying code is that the last the first data for being updated described first memory area are corresponding Identifying code, if the two coupling, then illustrate in described first memory area that the available data of storage is correct, can described the One slave computer can directly use this available data to be operated, and described first memory area is without being wiped free of and updating.Phase For in prior art, slave computer powers on every time, and its memory area will be forced erasing and update, and this embodiment reduces genus In the number of times that described first memory area of described first slave computer is wiped free of, effectively extend the longevity of described first memory area Life.Further, since prior art is after wiping memory area, slave computer to re-download data from host computer, and In the present embodiment, owing to the available data of described first memory area is without being updated, thus decreases and download from host computer The number of times of more new data, the most just decreases the communication between host computer, shortens the available machine time of host computer, saves simultaneously System resource.
Embodiment two
Seeing Fig. 2, this figure is the flow chart of a kind of data verification method that the embodiment of the present invention two provides.
The data verification method that the present embodiment provides comprises the steps:
Step S201: the first slave computer obtain electric after, to host computer send first identifying code obtain request, described first tests Card code obtains the mark of the available data carrying in described first memory area storage in request, in order to described host computer according to Described first identifying code obtains request and described mark obtains described first identifying code.
It is with described embodiment one difference, this embodiment describes one of them of described first identifying code Source, i.e. derives from described host computer.Concrete, described first slave computer obtain electric after, send the first checking to described host computer Code obtains request, and described first identifying code obtains and carries the mark of the available data of storage in described first memory area in request Know, described mark can be the version number of described available data, No. ID etc., for described available data is distinguished with other data Come.Described host computer, after receiving described first identifying code acquisition request, can obtain and described mark according to described mark Know the first corresponding identifying code.In order to obtain first identifying code corresponding with described mark, in actual applications, described host computer The corresponding relation of mark and identifying code can be stored, after getting the mark corresponding with described available data, can basis Described corresponding relation obtains described first identifying code.Or, it is also possible to first find corresponding with described mark according to described mark Data, the i.e. the last data for described first memory area is updated, then utilize these data to be calculated institute State the first identifying code.
Another source of described first identifying code can be the first storage in the last time to described first slave computer Available data in region is stored in the identifying code of described first slave computer when being updated, about this situation, will exist in detail Described in embodiment four, here is omitted.
Step S202: receive described first identifying code that described host computer sends.
Step S203: obtain the second identifying code according to the available data of storage in described first memory area.
Step S204: judge whether described second identifying code and described first identifying code mate, the most then perform step S205；If it is not, then perform step S206.
Step S205: described first slave computer utilizes the available data of storage in described first memory area to be operated, Realize the verification of available data in described first memory area.
Step S206: utilize the first data that described first memory area is updated by the last time, to described first In memory area, the available data of storage is updated.
In the present embodiment, if described second identifying code does not mates with described first identifying code, then described existing number is described According to there may be mistake, in this case, utilization the last time is used for be updated described first memory area first Described available data is updated by data.
Described the last time is for being divided into the source of the first data that described first memory area is updated Two kinds of situations, the first, described first Data Source, in host computer, is i.e. confirming described second identifying code and described first checking In the case of code is unmatched, from described host computer, download described the last time for described first memory area is updated The first data, so that described available data is updated.This mode ensure that the reliability of described first data.Concrete detailed See below step S2061 and step S2062.
Step S2061: send first more newly requested to host computer, described first more newly requested includes described available data Mark, in order to described host computer obtain that described first memory area updates by corresponding the last time according to described mark the One data.
Step S2062: receive that described first memory area updates by described the last time that described host computer sends the One data, and described available data is updated, flow process terminates.
The second situation, described first Data Source is stored in the when described first memory area is updated by the last time Two memory areas, described second memory area may belong to described first slave computer, may belong to another one slave computer, and i.e. Two slave computers, it is also possible to exist independent of slave computer, but be not belonging to described host computer.Such as, described second memory area is permissible It is the NOR Flash of described first slave computer, it is also possible to be the NOR Flash of described second slave computer, or, it is also possible to both it is It is not belonging to the first slave computer and is also not belonging to the NOR Flash of the second slave computer.
During it is to say, described first memory area is updated by the last time, first data are downloaded to from host computer Described second memory area becomes the first data, by described first data, described first memory area is carried out more again Newly, or, it is also possible to first download to described first memory area is updated from described host computer by data, back up the most again A to described second memory area.Regardless of situation, as described in step S2063, when described second identifying code is with described During the first identifying code difference, utilize described first data of storage in described second memory area, to described first memory area In available data be updated.
Step S2063: utilize described first data of storage in described second memory area, to described first memory area Available data be updated.
In the present embodiment, when slave computer powers on, from described host computer, download described first identifying code, and according to institute State in slave computer the available data of storage in the first memory area and obtain the second identifying code, if described second identifying code and described the One identifying code coupling, then it is assumed that described available data is correct, and described slave computer can utilize described available data to carry out work Make；If described second identifying code does not mates with described first identifying code, the most described available data there may be mistake, in this feelings Under condition, last before host computer re-downloads described first memory area can be updated the first used number It is updated according to described available data, it is also possible to utilize and be stored in when for the last time described first memory area being updated The first data in second memory area, are updated described available data, and the former ensure that the correctness of the first data, after Person's slave computer, without interacting with described host computer, decreases the host computer available machine time, has saved system resource simultaneously.
Embodiment three
The present embodiment is with the difference of described embodiment two, at described second identifying code and described first identifying code not In the case of joining, and described first Data Source is in described second memory area, owing in actual applications, described second stores Region can also cause the first data being stored therein to make a mistake because of hardware fault, in order to overcome this problem, this reality Executed example before utilizing described first data that described available data is updated, described first data are verified.
Seeing Fig. 3, this figure is the flow chart of a kind of data verification method that the embodiment of the present invention three provides.
The data verification method that the present embodiment provides comprises the steps:
Step S301: the first slave computer obtain electric after, to host computer send first identifying code obtain request, described first tests Card code obtains the mark of the available data carrying in described first memory area storage in request, in order to described host computer according to Described first identifying code obtains request and described mark obtains described first identifying code.
Step S302: receive described first identifying code that described host computer sends.
Step S303: obtain the second identifying code according to the available data of storage in described first memory area
Step S304: judge whether described second identifying code and described first identifying code mate, the most then perform step S305；If it is not, then perform step S306.
Step S305: described first slave computer utilizes the available data of storage in described first memory area to be operated, Realize the verification of available data in described first memory area.
Described step S301 is identical to step S205 with step S201 in described embodiment two to described step S305, because of This repeats no more.
Step S306: obtain the 3rd identifying code according to the first data in the second memory area, and judge that the described 3rd tests Whether card code mates with described first identifying code, the most then perform step S307；If it is not, then perform step S308.
Step S307: utilize the first data of storage in described second memory area, described first memory area is showed Having data to be updated, flow process terminates.
Step S308: send second more newly requested to host computer, described second more newly requested includes described available data Mark, in order to described host computer obtain that described first memory area updates by corresponding the last time according to described mark the Two data.
Step S309: receive described host computer send described the last time to described first memory area update second Data, and described available data is updated, flow process terminates.
In the present embodiment, owing to described first identifying code downloads from described host computer, the most described One identifying code is absolutely correct, if described 3rd identifying code obtained according to the first data in described second memory area and institute State the first identifying code coupling, then illustrate that described first data are correct, it is possible to use described first data are come described existing Data are had to be updated.If but described 3rd identifying code does not mates with described first identifying code, then described first number is described According to being wrong, thus described available data can not be updated by the first data of storage in described second memory area, Zhi Nengcong Re-downloading in described host computer, the process re-downloaded is as shown in step S308 and step S309.Except possessing above-mentioned enforcement The technique effect of example, the data verification method that the present embodiment provides also assures that to utilize and is stored in the of described second memory area The reliability that available data is updated by one data.
Embodiment four
Seeing Fig. 4, this figure is the flow chart of a kind of data verification method that the embodiment of the present invention four provides.
The data verification method that the present embodiment provides comprises the steps:
Step S401: the first slave computer obtain electric after, obtain in the last time the first of described first slave computer the storage Available data in region is stored in the first identifying code of described first slave computer when being updated.
In the present embodiment, the source of described first identifying code is the last existing in described first memory area The identifying code of described first slave computer it is stored in, in actual applications, in the last time to described first when data are updated When memory area is updated, can by be used for update data and first identifying code corresponding with these data downloaded into In described first slave computer.
Step S402: obtain the second identifying code according to the available data of storage in described first memory area.
Step S403: judge whether described second identifying code and described first identifying code mate, the most then perform step S404；If it is not, then perform step S405.
Step S404: described first slave computer utilizes the available data of storage in described first memory area to be operated, Realize the verification of available data in described first memory area.
Step S405: obtain the 3rd identifying code according to the first data in the second memory area, and judge that the described 3rd tests Whether card code mates with described first identifying code, the most then perform step S406；If it is not, then perform step S407.
Step S406: utilize the first data of storage in described second memory area, described first memory area is showed Data are had to be updated.
Step S407: judge whether described 3rd identifying code mates with described second identifying code, the most then perform step S408；If it is not, then perform step S409.
Step S408: described first identifying code is replaced with described 3rd identifying code, and described 3rd identifying code is carried out Storage.
Step S409: send the message that the first memory area is abnormal to described host computer；And/or, send the to host computer The depth of the night newly requested, the newly requested mark including described available data depth of the night the in of described, in order to described host computer is according to described mark Know the 3rd data obtaining corresponding the last time to described first memory area renewal；Receive the described of described host computer transmission The last the 3rd data that described first memory area is updated, and described available data is updated.
Identical with described embodiment three, in the present embodiment, when obtaining according to the first data in the second memory area When the 3rd identifying code arrived mates with described first identifying code, illustrate that the first data in described second memory area are correct , it is possible to use described available data is updated by described first data.Unlike described embodiment three, due to institute State the first identifying code and be derived from being stored in before the identifying code of described first slave computer, it is also possible to because described first is the next Machine fault and there is mistake, therefore, when described 3rd identifying code is different from described first identifying code, it cannot be said that bright described first Data must be to there is mistake, and described first identifying code is likely to there is mistake.It is the first number on earth to distinguish There is mistake according to there is mistake still the first identifying code, or both there is mistake, the present embodiment is by described 3rd checking Code and described second identifying code are compared, if the two coupling, then illustrate that described first identifying code is wrong, now can be by mistake The first identifying code by mistake replaces with the 3rd correct identifying code, and stores described 3rd identifying code, additionally also without Described available data is updated.
But, if described 3rd identifying code does not mates with described second identifying code, and described second identifying code is with described First identifying code does not mates, then now cannot judge described first identifying code, described first data and described existing Having data is which occurs in that mistake on earth, and the way at this moment can taked is to re-download data (i.e. from described host computer 3rd data) update described first memory area, meanwhile, or directly send the first memory area generation to described host computer Abnormal message, is further processed by professional.
The present embodiment is when slave computer powers on, it is not necessary to download described first identifying code from host computer, and, utilize described It is stored in the first data in described second memory area, and the 3rd check code just can complete the school to described available data Test, further reduce the time of host computer start, saved system resource, and ensure that available data is updated correct Property.
It should be noted that above-described embodiment is all that the available data in described first memory area need not be updated to Occurring in the case of the preset data of host computer, described preset data can be than the described higher number of available data version According to, or the data that other need to be to be replaced, but the most described the last time is for being updated the first memory area First data.If described available data needs to be updated to described preset data, the most described first slave computer needs from described upper Machine is downloaded described preset data.In actual applications, need from described host computer, download described presetting when described slave computer During data, renewal flag bit can be set, such as, be 1 when described preset data downloaded by needs by described mark position, if not Need to download described preset data, be then 0 by described mark position.In order to ensure that described available data is successfully updated as described pre- If data, can by identifying code corresponding for described preset data, with described available data is updated after the 4th data pair that obtain The identifying code answered is compared, if the two coupling, then explanation renewal is successful；If not mating, then explanation updates unsuccessful, needs Re-download renewal or carry out abnormality processing.Specifically can be achieved by the steps of:
Receive described preset data and the identifying code corresponding with described preset data that described host computer sends；
Utilize described preset data that the available data in described first memory area is updated, obtain the 4th data, And the identifying code of correspondence is obtained according to described 4th data；
If the identifying code coupling that identifying code corresponding to described preset data is corresponding with described 4th data, then store described pre- If the identifying code that data are corresponding or the identifying code corresponding with described 4th data.
A kind of data verification method provided based on above example, the embodiment of the present invention additionally provides a kind of data check Device, describes its operation principle below in conjunction with the accompanying drawings in detail.
Embodiment five
Seeing Fig. 5, this figure is the structured flowchart of a kind of data calibration device that the embodiment of the present invention five provides.
The data calibration device that the present embodiment provides includes:
First identifying code acquisition module the 101, second identifying code acquisition module 102 and correction verification module 103；
Wherein, described first identifying code acquisition module 101, for the first slave computer obtain electric after, obtain the first identifying code, Described first identifying code is the last identifying code corresponding for the first data being updated the first memory area, described First memory area belongs to described first slave computer；
Described second identifying code acquisition module 102, for obtaining according to the available data of storage in described first memory area To the second identifying code；
Described correction verification module 103, if for described second identifying code and described first identifying code coupling, then utilizing described the In one memory area, the available data of storage is operated, it is achieved to the verification of available data in described first memory area.
In the present embodiment, according to described second identifying code, in described first memory area, the available data of storage obtains Identifying code, described first identifying code is that the last the first data for being updated described first memory area are corresponding Identifying code, if the two coupling, then illustrate in described first memory area that the available data of storage is correct, can described the One slave computer can directly use this available data to be operated, and described first memory area is without being wiped free of and updating.Phase For in prior art, slave computer powers on every time, and its memory area will be forced erasing and update, and this embodiment reduces genus In the number of times that described first memory area of described first slave computer is wiped free of, effectively extend the longevity of described first memory area Life.Further, since prior art is after wiping memory area, slave computer to re-download data from host computer, and In the present embodiment, owing to the available data of described first memory area is without being updated, thus decreases and download from host computer The number of times of more new data, the most just decreases the communication between host computer, shortens the available machine time of host computer, saves simultaneously System resource.
In actual applications, if described first identifying code derives from host computer, then, described first identifying code acquisition module May include that the first identifying code request sending module and the first identifying code receiver module；
Described first identifying code request sending module, obtains request for sending the first identifying code to host computer, and described the One identifying code obtains and carries the mark of the available data of storage in described first memory area in request, in order to described host computer Obtain request according to described first identifying code and described mark obtains described first identifying code；
Described first identifying code receiver module, for receiving described first identifying code that described host computer sends.
If described first identifying code derives from described first slave computer, then described first identifying code acquisition module, specifically For:
Obtain and deposit when the available data in the first memory area of described first slave computer is updated by the last time Store up the first identifying code at described first slave computer.
Either which kind of source, in actual applications, described device can also include:
More new module, if not mating for described second identifying code and described first identifying code, then it is the last right to utilize The first data that described first memory area is updated, are carried out more the available data of storage in described first memory area Newly.
If described first Data Source is in described host computer, then described more new module may include that
First updates request sending module and the first data reception module；
Described first updates request sending module, and for more newly requested to host computer transmission first, described first renewal please Seek the mark including described available data, in order to described host computer obtains corresponding the last time to described according to described mark The first data that first memory area updates；
Described first data reception module, deposits described first for receiving described the last time of described host computer transmission First data of storage area area update, and described available data is updated.
If described first Data Source is in the second memory area, and described second memory area is not belonging to described host computer, More new module described in so, specifically for utilizing described first data of storage in described second memory area, to described first The available data of memory area is updated.
At described first Data Source in the case of the second memory area, more accurate in order to verify, described device is also May include that the 3rd identifying code acquisition module, for obtaining the 3rd checking according to the first data in described second memory area Code；
Described more new module, if mating with described first identifying code specifically for described 3rd identifying code, then utilizes described In second memory area, described first data of storage, are updated the available data of described first memory area.
And if described 3rd identifying code does not mates with described first identifying code, and described first identifying code is by upper Machine sends the first identifying code and obtains what request obtained, and the most described device can also include:
Second updates request sending module and the second data reception module；
Described second updates request sending module, and for more newly requested to host computer transmission second, described second renewal please Seek the mark including described available data, in order to described host computer obtains corresponding the last time to described according to described mark The second data that first memory area updates；
Described second data reception module, deposits described first for receiving described the last time of described host computer transmission Second data of storage area area update, and described available data is updated.
If described 3rd identifying code does not mates with described first identifying code, and described first identifying code is right in the last time Available data in described first memory area is stored in the identifying code of described first slave computer, the most described device when being updated Can also include:
Replacement module, if mating with described second identifying code, then by described first identifying code for described 3rd identifying code Replace with described 3rd identifying code, and described 3rd identifying code is stored.
When described first identifying code is to be updated the available data in described first memory area in the last time On the premise of being stored in the identifying code of described first slave computer, if described second identifying code, described first identifying code and described 3rd identifying code does not all respectively mate, and the most described device also includes:
Unexpected message sending module, for sending, to described host computer, the message that the first memory area is abnormal；
And/or, newly requested sending module and the 3rd data reception module depth of the night the in of；
Newly requested sending module depth of the night the in of described the, for newly requested to host computer sends the depth of the night, the described 3rd update please Seek the mark including described available data, in order to described host computer obtains corresponding the last time to described according to described mark The 3rd data that first memory area updates；
Described 3rd data reception module, deposits described first for receiving described the last time of described host computer transmission 3rd data of storage area area update, and described available data is updated.
The data calibration device that described embodiment five provides can be applied has processor (particularly slave computer) any Electronic equipment on, described electronic equipment can be existing, research and develop or any electronic equipment of in the future research and development, including But be not limited to: existing, research and develop or in the future the desk computer of research and development, laptop computer, mobile terminal (include intelligence Energy mobile phone, non intelligent mobile phone, various panel computer) etc..Device embodiment can be realized by software, it is also possible to by hardware or The mode of person's software and hardware combining realizes.As a example by implemented in software, as the device on a logical meaning, it is to be thrown by its place Computer program instructions corresponding in memory area is read by the equipment of shadow system or the processor with the electronic equipment of processor Get and internal memory runs formation.For hardware view, as shown in Figure 6, for data calibration device place of the present invention with A kind of hardware structure diagram of the electronic equipment of processor, except the processor shown in Fig. 6, internal memory, network interface and memory block Outside territory, in embodiment, the electronic equipment with processor at device place is generally according to the actual functional capability of this equipment, it is also possible to Including other hardware, such as display, this is repeated no more.
Wherein, can store the logical order that data verification method is corresponding in memory area, this memory area such as may be used To be nonvolatile storage (non-volatile memory), processor can call the preservation performed in memory area Logical order, to perform above-mentioned image rebuilding method.
The function of the logical order that data verification method is corresponding, if the form using software function module realizes and as solely When vertical production marketing or use, can be stored in a computer read/write memory medium.Based on such understanding, this Part or the part of this technical scheme that prior art is contributed by bright technical scheme the most in other words can be with soft The form of part product embodies, and this computer software product is stored in a storage medium, including some instructions in order to make Obtain a computer equipment (can be personal computer, server, or the network equipment etc.) and perform each embodiment of the present invention All or part of step of described method.And aforesaid storage medium includes: USB flash disk, portable hard drive, read-only memory area (ROM, Read-Only Memory), random access memory region (RAM, Random Access Memory), magnetic disc or CD etc. each Plant the medium that can store program code.
A kind of data verification method provided based on above example and device, the embodiment of the present invention additionally provides a kind of number According to calibration equipment, describe its operation principle below in conjunction with the accompanying drawings in detail.
Embodiment six
The data check equipment that the present embodiment provides includes:
Processor, for storing the memory area of described processor executable；
Wherein, described processor is configured to:
The first slave computer obtain electric after, obtain the first identifying code, described first identifying code is the last for first The identifying code that the first data that memory area is updated are corresponding, described first memory area belongs to described first slave computer；
The second identifying code is obtained according to the available data of storage in described first memory area；
If described second identifying code and described first identifying code coupling, the most described first slave computer utilizes described first storage In region, the available data of storage is operated, it is achieved to the verification of available data in described first memory area.
When introducing elements of various embodiments of the present invention, article " ", " one ", " this " and " described " are intended to Indicate one or more element.Word " includes ", " comprising " and " having " is all inclusive and means except listing Outside element, it is also possible to have other element.
It should be noted that one of ordinary skill in the art will appreciate that the whole or portion realizing in said method embodiment Split flow, can be by computer program and completes to instruct relevant hardware, and described program can be stored in a computer In read/write memory medium, this program is upon execution, it may include such as the flow process of above-mentioned each method embodiment.Wherein, described storage Medium can be magnetic disc, CD, read-only store-memory body (Read-Only Memory, ROM) or random store-memory body (Random Access Memory, RAM) etc..
Each embodiment in this specification all uses the mode gone forward one by one to describe, identical similar portion between each embodiment Dividing and see mutually, what each embodiment stressed is the difference with other embodiments.Especially for device and For equipment, owing to it is substantially similar to embodiment of the method, so describing fairly simple, relevant part sees embodiment of the method Part illustrate.Device embodiment described above is only schematically, wherein said illustrates as separating component Unit and module can be or may not be physically separate.Furthermore it is also possible to select it according to the actual needs In some or all of module realize the purpose of the present embodiment scheme.Those of ordinary skill in the art are not paying creativeness In the case of work, i.e. it is appreciated that and implements.
The above is only the detailed description of the invention of the present invention, it is noted that for the ordinary skill people of the art For Yuan, under the premise without departing from the principles of the invention, it is also possible to make some improvements and modifications, these improvements and modifications also should It is considered as protection scope of the present invention.

Claims (19)

1. a data verification method, it is characterised in that described method includes:
The first slave computer obtain electric after, obtain the first identifying code, described first identifying code is the last for the first storage The identifying code that the first data that region is updated are corresponding, described first memory area belongs to described first slave computer；
The second identifying code is obtained according to the available data of storage in described first memory area；
If described second identifying code and described first identifying code coupling, the most described first slave computer utilizes described first memory area The available data of middle storage is operated, it is achieved to the verification of available data in described first memory area.
Method the most according to claim 1, it is characterised in that if described second identifying code and described first identifying code are not Joining, the most described method also includes:
Utilize the first data that described first memory area is updated by the last time, store in described first memory area Available data be updated.
Method the most according to claim 2, it is characterised in that described first memory area is entered by described utilization the last time Available data in described first memory area is updated including by the first data that row updates:
More newly requested to host computer transmission first, the described first more newly requested mark including described available data, in order to institute State host computer and obtain the first data to described first memory area renewal of the corresponding the last time according to described mark；
Receive the first data that described first memory area updates by described the last time that described host computer sends, and to described Available data is updated.
Method the most according to claim 2, it is characterised in that described first memory area is carried out more by described the last time The first new data are stored in the second memory area, and described second memory area is not belonging to described host computer；
Described the first data utilizing the last time to be updated described first memory area, in described first memory area Available data be updated including:
Utilize described first data of storage in described second memory area, the available data of described first memory area is carried out Update.
Method the most according to claim 4, it is characterised in that described method also includes:
The 3rd identifying code is obtained according to the first data in described second memory area；
If described 3rd identifying code mates with described first identifying code, then perform described utilization in described second memory area and store The first data, the step that the available data of described first memory area is updated.
Method the most according to claim 5, it is characterised in that if described 3rd identifying code and described first identifying code are not Joining, and described first identifying code obtains by sending the first identifying code acquisition request to host computer, the most described method is also wrapped Include:
More newly requested to host computer transmission second, the described second more newly requested mark including described available data, in order to institute State host computer and obtain the second data to described first memory area renewal of the corresponding the last time according to described mark；
Receive the second data that described first memory area updates by described the last time that described host computer sends, and to described Available data is updated.
Method the most according to claim 5, it is characterised in that if described 3rd identifying code and described first identifying code are not Join, and described first identifying code is to be stored in when the available data in described first memory area is updated by the last time The identifying code of described first slave computer, the most described method also includes:
If described 3rd identifying code mates with described second identifying code, then described first identifying code is replaced with described 3rd checking Code, and described 3rd identifying code is stored.
Method the most according to claim 7, it is characterised in that be to described in the last time at described first identifying code Available data in one memory area is stored in the identifying code of described first slave computer when being updated on the premise of, if described Two identifying codes, described first identifying code and described 3rd identifying code all respectively do not mate, and the most described method also includes:
The message that the first memory area is abnormal is sent to described host computer；And/or,
To host computer sends the depth of the night newly requested, the newly requested mark including described available data depth of the night the in of described, in order to institute State host computer and obtain the 3rd data to described first memory area renewal of the corresponding the last time according to described mark；
Receive the 3rd data that described first memory area updates by described the last time that described host computer sends, and to described Available data is updated.
Method the most according to claim 1, it is characterised in that the first slave computer obtain electric after, described method also includes:
If the available data in described first memory area need not the preset data being updated in described host computer, then perform institute Stating the step obtaining described first identifying code, described preset data and described the last time are for carrying out more the first memory area The first new data are different.
Method the most according to claim 9, it is characterised in that if the data in described first memory area need to update For described preset data, the most described method also includes:
Receive described preset data and the identifying code corresponding with described preset data that described host computer sends；
Utilize described preset data that the available data in described first memory area is updated, obtain the 4th data, and root The identifying code of correspondence is obtained according to described 4th data；
If the identifying code coupling that identifying code corresponding to described preset data is corresponding with described 4th data, then store described present count According to corresponding identifying code or the identifying code corresponding with described 4th data.
11. 1 kinds of data calibration devices, it is characterised in that described device includes:
First identifying code acquisition module, the second identifying code acquisition module and correction verification module；
Wherein, described first identifying code acquisition module, for the first slave computer obtain electric after, obtain the first identifying code, described the One identifying code is the last identifying code corresponding for the first data being updated the first memory area, and described first deposits Storage area territory belongs to described first slave computer；
Described second identifying code acquisition module, tests for obtaining second according to the available data of storage in described first memory area Card code；
Described correction verification module, if for described second identifying code and described first identifying code coupling, then utilizing described first storage In region, the available data of storage is operated, it is achieved to the verification of available data in described first memory area.
12. devices according to claim 11, it is characterised in that described device also includes:
More new module, if not mating for described second identifying code and described first identifying code, then utilizes the last to described The first data that first memory area is updated, are updated the available data of storage in described first memory area.
13. devices according to claim 12, it is characterised in that described more new module includes: the first more newly requested transmission Module and the first data reception module；
Described first updates request sending module, for sending first more newly requested to host computer, described first more newly requested in Mark including described available data, in order to described host computer obtains corresponding the last time to described first according to described mark The first data that memory area updates；
Described first data reception module, for receiving described the last time of described host computer transmission to described first memory block First data of area update, and described available data is updated.
14. devices according to claim 12, it is characterised in that described first memory area is carried out by described the last time The first data updated are stored in the second memory area, and described second memory area is not belonging to described host computer；
Described more new module, specifically for utilizing described first data of storage in described second memory area, to described first The available data of memory area is updated.
15. devices according to claim 14, it is characterised in that described device also includes: the 3rd identifying code acquisition module, For obtaining the 3rd identifying code according to the first data in described second memory area；
Described more new module, if mating with described first identifying code specifically for described 3rd identifying code, then utilizes described second In memory area, described first data of storage, are updated the available data of described first memory area.
16. devices according to claim 15, it is characterised in that if described 3rd identifying code is with described first identifying code not Mating, and described first identifying code obtains by sending the first identifying code acquisition request to host computer, the most described device is also Including:
Second updates request sending module and the second data reception module；
Described second updates request sending module, for sending second more newly requested to host computer, described second more newly requested in Mark including described available data, in order to described host computer obtains corresponding the last time to described first according to described mark The second data that memory area updates；
Described second data reception module, for receiving described the last time of described host computer transmission to described first memory block Second data of area update, and described available data is updated.
17. devices according to claim 15, it is characterised in that if described 3rd identifying code is with described first identifying code not Mate, and described first identifying code is to store when the available data in described first memory area is updated by the last time At the identifying code of described first slave computer, the most described device also includes:
Replacement module, if mating with described second identifying code for described 3rd identifying code, then replaces described first identifying code For described 3rd identifying code, and described 3rd identifying code is stored.
18. devices according to claim 17, it is characterised in that be to described in the last time at described first identifying code Available data in first memory area is stored in the identifying code of described first slave computer when being updated on the premise of, if described Second identifying code, described first identifying code and described 3rd identifying code all respectively do not mate, and the most described device also includes:
Unexpected message sending module, for sending, to described host computer, the message that the first memory area is abnormal；
And/or, newly requested sending module and the 3rd data reception module depth of the night the in of；
Newly requested sending module depth of the night the in of described the, for newly requested to host computer sends the depth of the night, newly requested the depth of the night in of described the in Mark including described available data, in order to described host computer obtains corresponding the last time to described first according to described mark The 3rd data that memory area updates；
Described 3rd data reception module, for receiving described the last time of described host computer transmission to described first memory block 3rd data of area update, and described available data is updated.
19. 1 kinds of data check equipment, it is characterised in that described equipment includes processor, can hold for storing described processor The memory area of row instruction；
Wherein, described processor is configured to:
The first slave computer obtain electric after, obtain the first identifying code, described first identifying code is the last for the first storage The identifying code that the first data that region is updated are corresponding, described first memory area belongs to described first slave computer；
The second identifying code is obtained according to the available data of storage in described first memory area；
If described second identifying code and described first identifying code coupling, the most described first slave computer utilizes described first memory area The available data of middle storage is operated, it is achieved to the verification of available data in described first memory area.
CN201610340011.3A 2016-05-18 2016-05-18 A kind of data verification method, device and equipment Expired - Fee Related CN106055420B (en)

Priority Applications (1)

Application Number Priority Date Filing Date Title
CN201610340011.3A CN106055420B (en) 2016-05-18 2016-05-18 A kind of data verification method, device and equipment

Applications Claiming Priority (1)

Application Number Priority Date Filing Date Title
CN201610340011.3A CN106055420B (en) 2016-05-18 2016-05-18 A kind of data verification method, device and equipment

Publications (2)

Publication Number Publication Date
CN106055420A true CN106055420A (en) 2016-10-26
CN106055420B CN106055420B (en) 2019-07-16

Family

ID=57177702

Family Applications (1)

Application Number Title Priority Date Filing Date
CN201610340011.3A Expired - Fee Related CN106055420B (en) 2016-05-18 2016-05-18 A kind of data verification method, device and equipment

Country Status (1)

Country Link
CN (1) CN106055420B (en)

Cited By (5)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN107065820A (en) * 2016-12-31 2017-08-18 深圳市优必选科技有限公司 A kind of steering wheel information anti-loss method and device
CN109084428A (en) * 2018-08-16 2018-12-25 广东美的制冷设备有限公司 Air conditioner operating parameter update method, device and readable storage medium storing program for executing
CN109340999A (en) * 2018-09-25 2019-02-15 Tcl空调器(中山)有限公司 Verification method, air-conditioning, verification remote controler and the system of air-conditioning master control borad
CN113469677A (en) * 2021-06-11 2021-10-01 深圳市雪球科技有限公司 Secure read-write method and device for DESFire card data
TWI768200B (en) * 2018-07-02 2022-06-21 南韓商三星電子股份有限公司 Storage apparatus and multi-chip system

Citations (5)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN103327026A (en) * 2013-06-28 2013-09-25 腾讯科技（深圳）有限公司 Data updating method and updating system
CN103761112A (en) * 2011-12-30 2014-04-30 深圳市大富科技股份有限公司 Vehicle-mounted multimedia device and control method thereof
CN104898637A (en) * 2015-03-27 2015-09-09 北京经纬恒润科技有限公司 Vehicle controller self-refreshing method and system
CN104978253A (en) * 2015-06-24 2015-10-14 合肥格易集成电路有限公司 Target file checking method and apparatus
CN105095009A (en) * 2015-06-24 2015-11-25 合肥格易集成电路有限公司 Memory erasing method and apparatus

Patent Citations (5)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN103761112A (en) * 2011-12-30 2014-04-30 深圳市大富科技股份有限公司 Vehicle-mounted multimedia device and control method thereof
CN103327026A (en) * 2013-06-28 2013-09-25 腾讯科技（深圳）有限公司 Data updating method and updating system
CN104898637A (en) * 2015-03-27 2015-09-09 北京经纬恒润科技有限公司 Vehicle controller self-refreshing method and system
CN104978253A (en) * 2015-06-24 2015-10-14 合肥格易集成电路有限公司 Target file checking method and apparatus
CN105095009A (en) * 2015-06-24 2015-11-25 合肥格易集成电路有限公司 Memory erasing method and apparatus

Cited By (6)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN107065820A (en) * 2016-12-31 2017-08-18 深圳市优必选科技有限公司 A kind of steering wheel information anti-loss method and device
TWI768200B (en) * 2018-07-02 2022-06-21 南韓商三星電子股份有限公司 Storage apparatus and multi-chip system
CN109084428A (en) * 2018-08-16 2018-12-25 广东美的制冷设备有限公司 Air conditioner operating parameter update method, device and readable storage medium storing program for executing
CN109340999A (en) * 2018-09-25 2019-02-15 Tcl空调器(中山)有限公司 Verification method, air-conditioning, verification remote controler and the system of air-conditioning master control borad
CN113469677A (en) * 2021-06-11 2021-10-01 深圳市雪球科技有限公司 Secure read-write method and device for DESFire card data
CN113469677B (en) * 2021-06-11 2024-04-19 深圳市雪球科技有限公司 DESFire card data safety read-write method and device

Also Published As

Publication number Publication date
CN106055420B (en) 2019-07-16

Similar Documents

Publication Publication Date Title
CN106055420A (en) Method, device and equipment for data verification
CN108052355B (en) Satellite-borne load unit software on-orbit weight composing method
CN102498472B (en) Wear leveling of solid state disks based on usage information of data and parity received from a raid controller
CN108011935B (en) Program upgrading method of NB-IOT (network node B-IOT) equipment, server and NB-IOT equipment
CN102033770B (en) Touch screen firmware upgrading method and device for mobile terminal
CN105144074B (en) It is stored using the block of hybrid memory device
CN109783123A (en) Vehicle-mounted T-BOX terminal and firmware upgrade method
CN103631721A (en) Method and system for isolating bad blocks in internal storage
CN104424044A (en) Server system
CN110908682B (en) Firmware upgrading method and system for vehicle controller, vehicle and storage medium
CN109002310A (en) firmware upgrade method
CN102915249A (en) Method and device for remotely realizing firmware updating
CN106293824A (en) A kind of from the method and device processing chip upgrade
CN102662697A (en) Software upgrading method and device
US20220027071A1 (en) Method and system for enhancing programmability of a field-programmable gate array
CN105320531A (en) Online FPGA software upgrading method based on MicroBlaze soft core
CN102004657B (en) A kind of electronic equipment and upgrade method thereof
CN109783390A (en) PSU firmware promotion and demotion stability test method, apparatus, terminal and storage medium
CN102866900B (en) Upgrade the method and system of the configurator of control system
CN110020528A (en) A kind of BMC starting method, apparatus and electronic equipment and storage medium
CN104461589A (en) Single-chip microcomputer updating method and system
CN103488516A (en) System repair method and electronic equipment
CN110515544A (en) The method and terminal device of data storage
CN107153510A (en) Memory Controller and the method for managing memory
CN105278992A (en) Firmware updating method and apparatus

Legal Events

Date Code Title Description
C06 Publication
PB01 Publication
C10 Entry into substantive examination
SE01 Entry into force of request for substantive examination
CB02 Change of applicant information
CB02 Change of applicant information

Address after: 110179 No. 177-1 Innovation Road, Hunnan District, Shenyang City, Liaoning Province

Applicant after: Shenyang Neusoft Medical Systems Co.,Ltd.

Address before: Hunnan New Century Road 110179 Shenyang city of Liaoning Province, No. 16

Applicant before: SHENYANG NEUSOFT MEDICAL SYSTEMS Co.,Ltd.

GR01 Patent grant
GR01 Patent grant
CF01 Termination of patent right due to non-payment of annual fee
CF01 Termination of patent right due to non-payment of annual fee

Granted publication date: 20190716