JPH0535603A - Collating method for rom constitution - Google Patents

Abstract

PURPOSE:To automatically judge whether the ROM constitution is normal or not before the control is executed. CONSTITUTION:In a multi-CPU system which is constituted so that a first CPU 11, a second CPU 12 and a third CPU 13 are connected through a first RAM 21 and a second RAM 22 and interlocked mutually, and also, a first ROM 31, a second ROM 32 and a third ROM 33 are set to each CPU 11, 12 and 13, serial discrimination numbers (1, 2, 3) which increase successively, and collation data (1-2-3) are stored in each ROM 31, 32 and 33, and a third ROM 33 in which the maximum identification number 3 is stored, respectively, and in the case comparison data in which the discrimination numbers are arranged in accordance with an actual array of the ROMs does not coincide with collation data, it is judged that the ROM constitution is abnormal. In a new fourth ROM 34 change with a second ROM 32, identification number 4 and collation data (1-4-3) are stored, and a collation is executed, based thereon.

Description

Detailed Description of the Invention

[0001]

BACKGROUND OF THE INVENTION 1. Field of the Invention The present invention relates to a ROM configuration collating method for collating a ROM configuration of a multi-CPU system having a plurality of CPUs.

[0002]

2. Description of the Related Art When a plurality of types of control are performed in parallel at the same time, a CPU is provided for each control, each control is performed by a dedicated CPU, and each CPU is connected to each other to interlock each control. The multi-CPU system which is carried out is put into practical use. In such a multi-CPU system, each control content is stored in advance in the ROM as a program, and the ROM is set in each CPU. When changing the control contents, the ROM set in the CPU that performs the changing control is replaced with another ROM in which a new program is stored.

[0003]

When the above ROM is changed, if a ROM other than the ROM set in the CPU whose control contents are to be changed is mistakenly replaced with a ROM storing a new program. However, there is a problem that it is difficult to find such an abnormality in the ROM configuration until the control is actually executed and the control is performed based on the program of the ROM that is erroneously set, and a problem occurs due to the erroneous replacement of the ROM. ..

In view of the above problems, the present invention provides a method for checking the ROM configuration of a multi-CPU system, which automatically determines whether or not the ROM configuration is normal before actually executing control. With the goal.

[0005]

To achieve the above object, the present invention provides a plurality of Cs interconnected in a predetermined order.
In a ROM configuration collation method for determining whether or not the configuration of a ROM in which a program is stored, which is set in each PU, is normal, a series of sequentially increasing identification numbers is stored in each ROM together with the program, In addition, collating a number sequence in which the identification number of each ROM is stored in the ROM for storing the maximum identification number so that the identification number of each ROM is located in the order according to the connection order of the CPUs to which each ROM should be set. It is stored as data, the identification number of each ROM actually set in each CPU is read, and these identification numbers are identified in order of the connection order of each CPU in which each ROM is set. Comparing comparison data consisting of a number sequence arranged so that numbers are positioned, comparing the comparison data with collation data, and if both match, RO
It is characterized by judging that the M configuration is normal.

[0006]

In each ROM, a series of identification numbers, which sequentially increase with the program, are stored, and each R is placed in an order according to the connection order of each CPU that is originally set.
A number sequence arranged so that the identification number of the OM is located is stored in advance in a predetermined ROM as collation data.

On the other hand, the identification numbers of the ROMs actually set are read and arranged so that the identification numbers of the ROMs are located in the order according to the connection order of the CPUs in which the ROMs are actually set. Create comparison data consisting of a sequence of numbers.

If some of these ROMs are set in a CPU other than the CPU to be set, the collation data and the comparison data do not match. Therefore, by comparing the two, the ROM configuration is abnormal. Is detected.

Further, by storing the comparison data in the ROM in which the maximum identification number is stored, when the ROM is replaced by a version upgrade or the like, the identification number of the latest ROM becomes the maximum identification number. New RO
By storing the M configuration in the latest ROM, the collation data is updated to correspond to the new configuration accompanying the ROM replacement.

[0010]

Embodiments of the present invention will be described below with reference to the drawings. In the figure, 11 is the first CPU and 12 is the second CPU.
PU and 13 are third CPUs, and the CPUs 11 and 12 are
・ 13 performs each control individually. By the way, these C
Among the PUs, the first CPU 11 and the second CPU 12 are connected via a common first RAM 21, the second CPU 12 and the third CPU 13 are connected via a common second RAM 22, and the control of each CPU 11, 12, 13 is mutually performed. It is configured to work together. Then, each CPU 11
・ The contents of control by 12 ・ 13 are for each CPU 11 ・ 12.
First ROM 31 and second R set in each of 13
It is stored as a program in the OM 32 and the third ROM 33. In order to store the programs in these ROMs 31, 32 and 33, a dedicated storage device must be used,
Therefore, each ROM 31, 32, 33 is stored in a program in another place in advance, and then is carried to the place where each CPU 11, 12, 13 is installed and set in the corresponding CPU.

By the way, when a program is stored in each of the ROMs 31, 32, and 33, a series of sequentially increasing identification numbers is stored together with the program, and further, the ROM in which the maximum identification number is stored, in the case of this embodiment, The collation data is stored in the third ROM 33 in which the maximum identification number of 3 is stored. The collation data means each ROM 31, 32,
33 shows a regular array state of 33. In FIG.
If 31, 32, 33 are set to the normal state,
Since the respective identification numbers are 1, 2 and 3 from the left, the 3rd R
The collation data 1-2-3 is stored in advance in the OM 33. In FIG. 1, each ROM 31, 32, 3
The identification number is shown in the upper part of 3 and the matching data is shown in the lower part.

Next, the collation flow shown in FIG. 2 is executed before the control by the CPUs 11, 12, and 13 is started.
By the way, in the case of the present embodiment, since the collation flow is programmed to be executed by the CPU 11, when the collation flow is executed, first, in step S1, the identification number 3 of the ROM 33 is temporarily transferred to the RAM 22. And CPU
12 creates a sequence 2-3 consisting of 3 transferred to the RAM 22 and 2 which is the identification number of the ROM 32 and RA
Transfer to M21. Next, the CPU 11 reads out the sequence 2-3, adds 1 which is the identification number of the ROM 31 to the sequence 1-2-3, and sets this as the comparison data N1 and RA
Store in M21. In the next step S2, each ROM 3
Of the identification numbers stored in 1, 32, and 33, the verification data N2 = 1-2-3 stored in the ROM having the largest identification number, that is, the third ROM 33, is transferred to the RAM 21. Then, in step S3, the above N1 and N2 are compared, and if they match, the process proceeds to step S4 and the ROM
Judge that the configuration is normal. On the other hand, when setting each ROM, for example, the second ROM 32 and the third ROM 3 are erroneously
When 3 and 3 are mistakenly set, the comparison data becomes N1 = 1-3-2, and the comparison data N2 = 1-
Therefore, in this case, the process proceeds to step S5, and it is determined that the ROM configuration is abnormal.

Next, the second ROM 32 is replaced with a new fourth ROM as an example of partially changing the control contents by version upgrade or the like from the state where each ROM is normally set.
The case of exchanging with 34 will be described. The fourth ROM3
The identification number 4 and the collation data 1-4-3 are stored in No. 4 together with the new program. Therefore, when the exchange is properly performed, the comparison data becomes N1 = 1-4-3, and the identification number of the fourth ROM 34 becomes maximum, so that the verification data is stored in the fourth ROM 34 as N2 = 1-4. −
3 and both match, but erroneously, for example, the third RO
When the M33 and the fourth ROM 34 are exchanged, the comparison data becomes N1 = 1-2-4 and the verification data N2 = 1-4-3.
It is judged that the ROM configuration is abnormal because it does not match
Errors in OM exchange can be found.

[0014]

As is apparent from the above description, according to the present invention, the R set in each CPU of the multi-CPU system.
Whether or not the configuration of the OM is normal can be automatically judged before executing the control.

[Brief description of drawings]

FIG. 1 is a diagram showing an example of a multi-CPU system to which the present invention is applied.

FIG. 2 is a flow chart showing the contents of collation processing.

[Explanation of symbols]

 11 1st CPU 12 2nd CPU 13 3rd CPU 31 1st ROM 32 2nd ROM 33 3rd ROM 34 4th ROM

 ─────────────────────────────────────────────────── ─── Continuation of the front page (72) Minoru Kobayashi 1-10-1 Shin-Sayama, Sayama-shi, Saitama Prefecture, Honda Engineering Co., Ltd. (72) Hidenori Koga 1-10-1 Shin-Sayama, Sayama City, Saitama Prefecture Within Da Engineering Co., Ltd.

Claims (1)

Claim: What is claimed is: 1. A ROM configuration for determining whether or not the configuration of a ROM, in which a program is stored in advance, which is set in each of a plurality of CPUs connected to each other in a predetermined order, is normal. In the verification method of, each ROM together with the above program
In the ROM for storing a series of sequentially increasing identification numbers and for storing the maximum identification number, the identification numbers of the ROMs are arranged in the order of the connection order of the CPUs in which the ROMs should be set. A sequence of numbers arranged so that the identification numbers are located is stored as collation data, the identification numbers of the ROMs actually set in the respective CPUs are read, and these identification numbers are stored in the respective CPUs in which the respective ROMs are set. Comparing comparison data composed of a number sequence arranged so that the identification numbers of the ROMs are located in the order according to the concatenation order, comparing the comparison data with the collation data, and when both match, the ROM configuration is normal. R characterized by determining that
OM configuration matching method.