JPS6145341A - Memory editing and transfer method - Google Patents

Abstract

PURPOSE:To transfer the input data every bit in a simple way by dividing the data every prescribed number of bits and dividing the data by the prescribed value to set a counter and shifting the AND output between the input data and a constant by an amount equivalent to the value set to the counter. CONSTITUTION:When an operation is started at a block 10, the initial values of a counter, a constant and the increment value are set at a block 11 as shown in a figure (a). Then the input data are extracted at a block 12 as shown in a figure (b), and an AND is secured at a block 13 with the constant. The input data is shifted at a block 14 by an amount equivalent to the increment value of the counter. In this case, however, no shift is given to the first input data. Then the result of the block 14 is OR-written to the output data at a block 15. The counter, an output address and an input address are replaced at blocks 16, 17 and 18 respectively. The processes are repeated between blocks 12 and 19 until the data fetching is through.

Description

DETAILED DESCRIPTION OF THE INVENTION [Field of Industrial Application] The present invention relates to a memory editing and transferring method, and more particularly, to a memory editing method when input data of a certain format is cut into bits and transferred.

The present invention is used when, for example, input data is stored left-justified in a 32-bit (4-byte) memory area and is to be cut and transferred in units of, for example, 19 bits.

[Conventional technology]

A case will be described in which input data in a certain format is divided into bits and transferred, and the input data is in the format shown in FIG. 3(a). @3 In figure 3, the input data is left-justified in 32 bits (4 bytes).In this case, the actual valid data is n bits (1≦n≦32).
Suppose that When this input data is transferred, the valid data is n-bits ■, ■, ■, . In this case, sending input data containing other than valid data would be uneconomical since an extra memory area would be required.

Therefore, these data are cut into 19-bit units and transferred, but this pattern (for example, 32 bits) is
If the bit unit (for example, 19 bits) was to be cut and transferred, the program had to be rewritten if the bit unit changed.

[Problem that the invention seeks to solve]

In view of the problems of the prior art, the present invention provides means for cutting input data of a certain format into bits and transmitting the data in an extremely simple manner.

[Means and effects for solving the problems] The present invention provides a memory editing and transfer method that solves the above problems, and the means is to solve the above problems.
In a memory editing method in which input data (N bytes) is cut into m bits and transferred, the quotient obtained by dividing the m bits by 8 is set in a counter, and the m bit constant is set for the Nx8 bit area. Then, (a) take out the input data NX8 bits, (b) AND the data of the NX8 bits and the constant, (c) shift by the setting value of the counter, and (d) the shifted data. is written in the output data of the memory, and the steps up to (E) above (U) and (C) are repeated until the input data is taken out.

〔Example〕

Embodiments of the present invention will be described in detail below with reference to the drawings.

Fig. 1 is a diagram explaining the procedure of the method according to the present invention. Fig. 1 shows the method used when cutting left-justified 32-bit (4) bit data into 19-bit units and transferring it. explain about.

First, initial settings are performed as shown in FIG. 1(a).

In other words, in Figure 1 0), output information address set 1
is carried out to clear the output information area 4, set the counter 2 to zero, set the increment value of the counter to the remainder obtained by multiplying 19 by 8, and create a constant 6 in the register 3. This sets @1” for 1 to 19 pits, and 20
The 13 bits starting from the 32nd bit are set to zero.

Next, as shown in FIG. 1(b)K, input data 7a is input, this is ANDed with the created constant, and the ANDed data (D,) 8 is written as output data 9.

The next time the input data is written into the output data area, the counter needs to be shifted by an increment of 3. This will be explained with reference to FIG. 1(C)K.

Input information address set and output information address set 1 are cleared, and for counter 2, as shown in FIG. 1(a)
Set the value x'oo' which is the value at K plus the counter increment value and check the counter. Increment value 3 to counter
As the numbers are added one by one, a carry C3 occurs at the third time as shown at 3 in FIG. 1(e), and at that time, 3 is added to the contents of the output information address set l. To check this carry, the counter is ANDed with X'03'.

The procedure for writing the second input data into the output data area will be explained with reference to FIG. 1(d). The input data 7b is ANDed with the constant 6, the result 8 is shifted to the right by the increment value 3b of the counter, and the shifted result 8b is written to the output data 9.

) in Figure 1 is the output data 9 that has completed the input data transfer.
Indicates the status of

Figure 2 shows the flowchart of the operation procedure in Figure 1)
Shown. When the process is started in block 10, initial values of a counter, a constant, and a counter increment value as shown in FIG. 1(a) Ic are first set in block llrζ.

Next, in block 12, input data is extracted as shown in FIG. 1(b)K, and in block 13, an AND operation is performed with a constant. In block 14, the counter is shifted by the increment value.
``No shift is performed on the first input data.

The shift is performed from the second input data, and this is clear from a comparison of FIGS. 1(g) and 1(d).

The result of block 14 is then or-written to the output data in blocks 1-5, and blocks 16, 17, 1
8, the counter, output address, and input address are updated, and the steps leading to bronches 12 to 19 are repeated until the data has been deposited.

〔Effect of the invention〕

As described in detail above, according to the present invention, input data of a certain format can be easily cut into arbitrary pit units and transferred without rewriting the program, so the effect is very great.

[Brief explanation of the drawing]

Figure 1 is a diagram explaining the procedure of the method of the present invention, Figure 2 is a diagram explaining the procedure of the method according to the present invention.
FIG. 3 is a flowchart for explaining the operation of the procedure shown in FIG. 1, and FIG. 3 is a diagram showing the mutual relationship between input data and output data of means for cutting input data into bits and transferring them. In the drawing, 1 is an output information address, 2 is a counter,
3 indicates a counter increment value, 4 indicates an output information area, 5 indicates an input information address, 6 indicates a constant, 7a7b indicates input information, and 9 indicates output data. Figure 3

Claims (1)

[Claims] In a memory editing method in which input data of N×8 bits (N bytes) stored left-justified is cut into m bits and transferred, the quotient obtained by dividing the m bits by 8 is set in a counter, and the quotient obtained by dividing the m bits by 8 is set in a counter, and Set the m-bit constant for the 8-bit area, then (a) take out the input data N x 8 bits, (b) AND the N x 8-bit data and the constant, and (c) Shifting the counter by the set value, (d) writing the shifted data to the output data of the memory, and (e) repeating the steps from (b) to (d) until the input data is extracted. A memory editing transfer method characterized by: