WO2016101726A1

WO2016101726A1 - Equivalent transformation method and device for state machine

Info

Publication number: WO2016101726A1
Application number: PCT/CN2015/094489
Authority: WO
Inventors: 王磊; 杨磊; 谢少林
Original assignee: 中国科学院自动化研究所
Priority date: 2014-12-26
Filing date: 2015-11-12
Publication date: 2016-06-30
Also published as: CN104572028A; CN104572028B

Abstract

Disclosed in the present invention are an equivalent transformation method and device for a state machine, the method comprising a determination step of transformation type, a sequence block state extraction step, a circulating block state extraction step and a nested loop block state extraction step. The equivalent transformation device of the state machine is capable of receiving an input of one or more state block conforming to an equivalent transformation rule, executing all steps in the equivalent transformation method of the state machine and outputting a device of the state block conforming to a spliceable rule. The method of the present invention is an important sub-method in a splicing method of the state machine, greatly improving splicing range and accuracy of the state machine; besides, the present invention can also be applied to type transformation and analysis of other similar program sections and code sections.

Description

Method and device for equivalent transformation of state machine

Technical field

The present invention relates to the field of digital integrated circuits, and more particularly to a method and apparatus for equivalent conversion of a state machine to reduce the circuit complexity of the dynamically configurable pipeline and the difficulty of developing the configuration program.

Background technique

The pipeline and the connection between the various pipeline stages and the pipeline stages on the state machine control line are a common form of digital integrated circuits. For example, the pipeline of instructions, the pipeline that processes packets in the network processor, the pipeline of baseband signal processing, and so on. Instruction pipeline technology refers to a processing technique in which multiple instructions overlap when a program is executed. It breaks down instructions into different stages, allowing the circuit to more fully utilize hardware resources according to specified operations.

Dynamic reconfigurable pipeline technology makes the hardware circuit structure more flexible and controllable. The essence is to describe the behavior of each state machine on the pipeline. The state machine corresponds to each functional unit in the circuit, and the hardware resources can be conveniently manipulated by programming and configuring the state machine. Then, when the circuit is more complicated, the design and configuration of the state machine becomes extremely complicated.

When the functions implemented by the state machine are complex and the form and type of the state machine are many, many complicated situations are encountered in the state machine splicing process, which makes it impossible to directly splicing. For example, the splicing of the cyclic state block and the sequential state block, and the splicing of the loop state block and the nested loop state block. At this time, a specific pricing transformation is required for the state machine, so that the transformed state machine can be spliced, and the functions implemented by the state machine are unchanged.

Summary of the invention

In view of this, the present invention proposes a method for equivalence transformation of a state machine to design an equivalent transformation rule for various state machines that conform to an equivalent transformation rule, thereby improving the splicing range and correctness of the state machine.

In order to achieve the above object, as an aspect of the present invention, the present invention provides a method for equivalent transformation of a state machine, comprising the steps of:

Step 1: initialize the state block of the state machine into a tree-shaped two-dimensional structure;

Step 2: Read a state extraction mode of the state machine and the state machine, select output or reverse for the state machine according to the state extraction mode; if the extraction mode is forward extraction, put the input state machine into the input of step 3, and jump Go to step 3; if the extraction mode is reverse extraction, put the status block into the input of step 2.1, call step 2.1, replace the status block returned in step 2.1 with the original status block in the state machine, and add the new state machine Put in the input of step 3, jump to step 3;

In step 2.1, the tail region of the input state machine is marked as a header region, and the original header region is identified as a tail region;

Wherein, if the current main area is a nested loop block, the status block in the loop block is nested, the sequence is reversed, and step 2.1 is called for each status block, and the original state in the nested loop block is replaced with the returned status block. Block; if the current main area is not a nested loop block, reverse all the states in the status block in the main area;

Output the adjusted status block and return to the previous step of calling the current step;

Step 3, reading the first status block of an input state machine, determining the type of the status block, and jumping to the step of extracting the status of the corresponding status block;

If the current status block is a sequential block, then jump to step 4;

If the current status block is a loop block, then jump to step 5;

If the current status block is a nested loop block, then jump to step 6;

Step 4: receiving a sequence status block and a length to be extracted as an input, extracting a specified number of states from the input sequence block header into the header area, and modifying the length to be extracted; outputting the extracted state machine to jump to Step 8;

Step 5: Receive a loop block and a length to be extracted as an input, determine a length to be extracted, a number of internal states of the loop block, and a number of state of the tail region, and extract a specified number of states;

Sub-step 5.0, calculating the length of the loop block tail region, and determining whether it is necessary to extract a loop block at present;

Sub-step 5.1, all the states inside the loop body are sequentially formed into a new sequential block, the order block is placed in the head of the tail region, the number of cycles of the loop block is incremented by 1, and the jump to sub-step 5.2;

Sub-step 5.2, if the length to be extracted is greater than or equal to the number of internal states of the loop block, the first sequential block in the tail region is placed at the end of the extraction region, and the number to be extracted is subtracted from the interior of the loop block. The number of states, jumps to step 8; if the length to be extracted is less than the number of states inside the loop block, the sequential blocks in the tail region are merged into one sequential block in order, and then the header to be extracted is extracted from the merged sequential block The length of each state, a new sequence block is placed in the tail of the extraction area, and the tail area is cleared. If the number of states in the extracted sequence block is not 0, the extracted sequence block is placed in the tail area. Go to substep 5.3;

Sub-step 5.3, the state of the head to be extracted in the loop block is taken out to the end of the state in the loop block, forming a cyclic scroll, and the length to be extracted is set to 0, and jumps to sub-step 8;

Step 6, receiving the nested loop block and the length to be extracted as an input, extracting a specified number of states from the input nested loop block header, and outputting a combination of the state blocks usable for the state machine splicing;

Sub-step 6.0, if the tail region is empty, skip to sub-step 6.1; if the tail region is not empty, skip to sub-step 6.2;

Sub-step 6.1, extract all the state blocks in the nested loop block, put them in the tail region in order, add the number of cycles of the nested loop block to 1, and jump to sub-step 6.2;

Sub-step 6.2, taking the tail region of the nested loop block to form a new state machine, taking the length to be extracted and the new state machine as input, recursively calling the method, and returning the header of the first state block of the state machine All state blocks in the area are taken out, placed in the tail of the extraction area, and jump to sub-step 6.3;

Sub-step 6.3, taking out all the state blocks in the nested loop block, forming a new state machine in order, and extracting the length and the new state machine as input, recursively calling the method, and returning the first state block of the state machine All state blocks in the header area are fetched after the last state block of the returned state machine, and all state blocks in the nested loop block are replaced with state blocks in the state machine, and the length to be fetched is set to 0, hopping Go to step 8;

Step 8, if the current to-be-extracted length is not 0, the current state machine and the length to be extracted are taken as the input of step 3, and the process proceeds to step 3, otherwise the process proceeds to step 9.

Step 9, the extraction area is placed at the end of the first status block header area; if the original extraction mode is reverse extraction, the first status block is placed in the input of step 2.1, and step 2.1 is invoked, and the status block returned in step 2.1 is returned. The method replaces the original status block in the state machine; otherwise the method ends.

Wherein, the step 1 includes:

For each state block of the input state machine, it is judged whether it is already a two-dimensional structure, that is, composed of a header region, a main region, and a tail region, and if so, the state machine is a state machine that has participated in the equivalent transformation, and jumps Go to step 2; if not, construct a two-dimensional structure of the head region, the main region, and the tail region for the state block, put the original state block into the body portion, and empty the header region and the tail region, if the state block is a nested loop The block constructs a two-dimensional structure for each state block within the state block;

Go to step 2.

The step of receiving a sequence status block and the length to be extracted as an input in step 4, extracting a specified number of states from the input sequence block header into the header area, and modifying the length to be extracted is:

If the length to be extracted is less than or equal to the number of states in the sequence block, the extraction is started from the beginning of the state block, and the specified number of states are sequentially extracted from the first state of the current state block, and the states are merged into a new sequential state block. , put this state block at the end of the extraction area; extract the remaining part as a new sequential status block, replacing the original status block. Set the length to be extracted to zero.

If the length to be extracted is greater than or equal to the number of states in the sequence block, all the sequence blocks are placed at the end of the extraction region, the state block in the state machine is deleted, and the number of states in the sequence block is subtracted from the length to be extracted.

As another aspect of the present invention, the present invention also provides an equivalent conversion device for a state machine, comprising:

First and second state machine registers 1, 9 for receiving and storing a header area, a main area, and a tail area in the transform process;

The state block type judging module 3 implements a transform type judging step in the state machine equivalent conversion method; the module reads the to-be-transformed state block output by the first state machine inversion module 2, and outputs the status block to the execution result according to the execution result. One of the sequential block extraction module 6, the cyclic block extraction module 7, or the nested cyclic block extraction module 8;

The first and second state machine reversal modules 2, 10 implement a state machine reversal step, wherein the first state machine reversal module 2 reads the initial input state machine and the length to be extracted for processing the reverse extraction The first state machine reverse sequence conversion; the second state machine inversion module 10 is coupled to the second state machine register 9 and the state block stack 4 for implementing a state of the state machine for reverse extraction at the output The machine reverses the sequence and outputs a splicable state machine after the step is executed;

The status block stack 4 is connected to the first and second state machine inversion modules 2, 10 and the extraction module 5, and provides a stack storage function of the status block for the main state machine equivalent conversion step, assisting in completing these several The transformation step performed in the module;

The extraction module 5 includes a sequential block extraction module 6, a cyclic block extraction module 7, and a nested cyclic block extraction module 8; wherein the sequential block extraction module 6 implements a sequential block state extraction step, and the cyclic block extraction module 7 implements a loop block extraction step, the nested loop block extraction module 8 implements a nested loop block extraction step; the extraction module 5 aggregates three different types of state block extraction modules into a whole to connect the state block stack 4. The storage and invocation of the status block is performed by the status block stack 4; the output of the extraction module 5 is stored in the second state machine register 9.

The first and second

state machine registers

1, 9 are designed as a storage mode of a tree-shaped two-dimensional structure.

The status block stack 4 is a stack register for storing a status block, and the status block is a basic storage unit internally, and a storage structure such as a stack and a queue for storing the status block is implemented.

Wherein, the equivalent conversion device is implemented by a C++ programming language and is applicable to an x86 or MIPS processor system.

Wherein, the equivalent conversion device is implemented by hardware in verilog as an independent portable pipeline configuration module.

Based on the above technical solutions, the method of the present invention can greatly improve the range and correctness of the state machine splicing as an important sub-method in the state machine splicing method. At the same time, it can also be applied to the formal transformation and analysis of other similar programs and code segments.

DRAWINGS

1 is a schematic structural view of a state machine equivalent conversion device of the present invention;

2 is a schematic diagram of an input status block according to Embodiment 1 of the present invention;

3 is a schematic diagram of a state block of step 1 of Embodiment 1 of the present invention;

4 is a schematic diagram of a state block in step 5.1 of Embodiment 1 of the present invention;

Figure 5 is a schematic diagram of a state block of step 5.2 of Embodiment 1 of the present invention;

6 is a schematic diagram of a state block of step 5.3 of Embodiment 1 of the present invention;

7 is a schematic diagram of an output state machine in step 9 of Embodiment 1 of the present invention;

Figure 8 is a schematic diagram of an input status block according to Embodiment 2 of the present invention;

9 is a schematic diagram of a first state block of Embodiment 2 of the present invention;

10 is a schematic diagram of a sub-step 6.1 status block according to Embodiment 2 of the present invention;

11 is a schematic diagram of a recursive fourth step state block according to Embodiment 2 of the present invention;

Figure 12 is a schematic diagram of a state block of sub-step 5.1 of Embodiment 2 of the present invention;

Figure 13 is a schematic diagram of a sub-step 5.2 status block of Embodiment 2 of the present invention;

14 is a schematic diagram of a sub-step 5.3 status block according to Embodiment 2 of the present invention;

15 is a schematic diagram of a recursive ninth step state block according to Embodiment 2 of the present invention;

16 is a schematic diagram of a sub-step 6.3 state block according to Embodiment 2 of the present invention;

17 is a schematic diagram of an output state machine in step 9 of Embodiment 2 of the present invention;

Figure 18 is a flow chart showing a state machine equivalent conversion method of the present invention.

detailed description

The present invention will be further described in detail below with reference to the specific embodiments of the invention,

The invention discloses a method and device for equivalent transformation of a state machine. The basic way of the state machine equivalent transformation of the present invention is to extract the length of the state to be extracted from the front of a state block (forward extraction) or the latter (reverse extraction) to form a combination of the new state block and the extracted state block. When the method is forward-fetched, the state extracted from the front is connected to the original state block after being connected to the header of the extracted state block; when the reverse extraction is performed, the state extracted from the back is connected to the extracted state block. The tail is still consistent with the original state block.

The state machine equivalent conversion method of the present invention comprises the following steps: a state machine preprocessing step, a state block inversion step, a transform type judging step, a sequential block state extracting step, a loop block state extracting step, a nested loop block state extracting step, Iterative decision step and output step. This will be described in detail below with reference to FIG.

Step 1, state machine preprocessing steps

This step initializes the state block of the state machine into a tree-shaped two-dimensional structure. This step is characterized by determining, for each state block of the input state machine, whether it is already a two-dimensional structure, that is, consisting of a header region, a main region, and a tail region, and if so, the state machine has participated in the method equivalent. Change the state machine, jump to step 2; if not, build a header area, main area for the status block The two-dimensional structure of the domain and the tail region places the original state block into the body portion, and the head region and the tail region are blanked. If the state block is a nested loop block, a two-dimensional structure is constructed for each state block in the state block.

After the preprocessing is complete, skip to step 2.

Step 2, state block reverse step

The function of this step is to arrange the first state block of the state machine in reverse order, and the output state block can be equivalently transformed according to the forward extraction mode, and then arranged in reverse order to achieve the purpose of reverse extraction. This step reads the state extraction mode (forward extraction or reverse extraction) of a state machine and state machine, and selects the output or reverses the state machine according to the state extraction mode.

If the extraction method is forward extraction, the input state machine is placed in the input of step 3, and the process proceeds to step 3.

If the extraction mode is reverse extraction, the status block is placed in the input of step 2.1, step 2.1 is invoked, the status block returned in step 2.1 is replaced with the original status block in the state machine, and the new state machine is placed in step 3. Enter and go to step 3.

Step 2.1, state machine reverse sequence steps

Mark the tail area of the input state machine as the head area and the original head area as the tail area.

The status block in the current header area is reversed, and step 2.1 is called for each status block, replacing the original status block in the header area with the returned status block.

If the current main area is a nested loop block, the status block in the loop block is nested, the sequence is reversed, and step 2.1 is called for each status block, and the original status block in the nested loop block is replaced with the returned status block; If the current main area is not a nested loop block, all the states in the status block in the main area are reversed.

The status block in the current tail region is reversed, and step 2.1 is called for each state block, replacing the original state block in the tail region with the returned status block.

The adjusted status block output is returned to the previous step that called the current step.

Step 3: Transformation type judgment step

This step reads the first status block of an input state machine, determines the type of the status block, and jumps to the corresponding state block state extraction step.

If the current status block is a sequential block, skip to step 4.

If the current status block is a cyclic block, skip to step 5.

If the current status block is a nested loop block, skip to step 6.

Step 4. Sequence block state extraction step

The step receives an order status block and a length to be extracted as an input, extracts a specified number of states from the input sequence block header into the header area, and modifies the length to be extracted. The characteristics of this step are:

Output the extracted state machine and go to step 8.

Step 5, loop block state extraction step

This step receives a loop block and the length to be extracted as an input, determines the length to be extracted and the number of internal states of the loop block and the number of state of the tail region, and extracts a specified number of states.

Sub-step 5.0, tail region length judgment sub-step

This substep calculates the length of the loop block tail region, (the tail region of the loop block should contain only the sequence block), and determines whether it is necessary to extract the loop block at present. The feature is: accumulating the number of states in all the sequential blocks in the tail region as the length of the tail region, and if the length of the tail region is greater than or equal to the length to be extracted, jumping to sub-step 5.2, otherwise jumping to sub-step 5.1

Sub-step 5.1, single-round loop extraction sub-step

All the states inside the loop body are sequentially formed into a new sequence block. The sequence block is placed in the head of the tail region, and the number of cycles of the loop block is incremented by one, and the jump to sub-step 5.2.

Sub-step 5.2, tail region extraction sub-step

If the length to be extracted is greater than or equal to the number of internal states of the loop block, the first sequential block in the tail region (the length must be the number of internal states of the loop block) is placed at the end of the extraction region, and the number of states to be extracted is subtracted from the number of states in the loop block. , go to step 8.

If the length to be extracted is less than the number of internal states of the cyclic block, the sequential blocks in the tail region are sequentially merged into one sequential block, and then the lengths of the headers to be extracted are extracted from the merged sequential blocks to form a new sequence. The block is placed in the tail of the extraction area, and the tail area is cleared. If the number of states in the sequence block is not 0, the extracted sequence block is placed in the tail region. Go to substep 5.3.

Sub-step 5.3, loop block rolling sub-step

The state of the head to be extracted in the loop block is taken out to the end of the state in the loop block to form a cyclic scroll, and the length to be extracted is set to zero. Go to substep 8.

Step 6. Nested loop block state extraction step

This step receives the nested loop block and the length to be extracted as input, extracts a specified number of states from the input nested loop block header, and outputs a combination of state blocks that can be used for state machine stitching.

Sub-step 6.0, tail region judgment sub-step

If the tail area is empty, skip to sub-step 6.1;

If the tail region is not empty, skip to substep 6.2.

Sub-step 6.1, single-round nested loop block extraction sub-step

Extract all the state blocks in the nested loop block, place them in the tail region in order, add 1 to the number of loops of the nested loop block, and jump to substep 6.2.

Sub-step 6.2, nested extraction sub-steps

Take the tail region of the nested loop block to form a new state machine, take the length to be extracted and the new state machine as input, recursively call this method, and return all states in the header region of the first state block of the state machine. The block is taken out and placed in the tail of the extraction area. Go to substep 6.3.

Sub-step 6.3, nested scrolling substeps

Take out all the state blocks in the nested loop block, form a new state machine in order, and extract the length and the new state machine as input, recursively call this method, and return the header of the first state block of the state machine All state blocks are fetched after the last state block of the returned state machine, and all state blocks within the nested loop block are replaced with state blocks within the state machine, and the length to be fetched is set to zero. Go to step 8.

Step 8. Iterative judgment step

If the current to-be-extracted length is not 0, the current state machine and the to-be-extracted length are taken as the input of step 3, and the process proceeds to step 3, otherwise, the process proceeds to step 9.

Step 9, the output step

Place the extracted area at the end of the first status block header area.

If the original extraction mode is reverse extraction, the first status block is placed in the input of step 2.1, step 2.1 is invoked, the status block returned in step 2.1 is replaced with the original status block in the state machine, and the method ends; otherwise the method ends.

State machine equivalent conversion device

The state machine equivalent conversion device of the present invention is as shown in FIG. The first and second state machine registers 1 and 9, the state block type judging module 3, the first and second state machine reversing modules 2 and 10, the state block stack 4, the extracting module 5, the sequential block extracting module 6, and the loop are included. The block extraction module 7 and the nested loop block extraction module 8.

The device inputs the state machine to be transformed and the extracted length, performs all state machine equivalent conversion methods, and outputs a splicable state machine.

The first and second state machine registers 1 and 9 are used to receive and store the state machine. These registers are designed as a tree-shaped two-dimensional storage mode for storing the header area, the main area, and the tail area in the state machine transformation process. Each zone can store one or more complete status blocks separately. The first and second state machine registers 1 and 9 are connected to the first and second state machine inversion modules 2 and 10, the sequence block extraction module 6, the cyclic block extraction module 7, and the nested loop block extraction module 8, for these The module performs the storage and invocation of each regional state machine in the step.

The status block stack 4 is a stack register for storing a status block, and the internal state block is a basic storage unit, and a storage structure such as a stack and a queue for storing the status block is realized. The status block stack 4 is connected to the first and second state machine inversion modules 2 and 10 and the extraction module 5, and provides a stack storage function of the status block for the main state machine equivalent conversion step, assisting in the execution of these modules. Transformation steps.

The first and second state machine reverse modules 2 and 10 implement the state machine reverse step in the method, wherein the first state machine reverse module 2 reads the initial input state machine and the length to be extracted for processing the reverse The first state machine is reversed when it is extracted. The second state machine inversion module 10 is connected to the second state machine register 9 and the state block stack 4, and is configured to implement a state machine reverse sequence transformation performed by the state machine that is inversely extracted at the output, and outputs a splicable state after the step is executed. machine.

The state block type judging module 3 implements the transform type judging step in the state machine equivalent conversion method. The module reads the status block to be transformed output by the first state machine reverse module 2, and according to the implementation The row result outputs the status block to one of the sequence block extraction module 6, the loop block extraction module 7, or the nested loop block extraction module 8.

The extraction module 5 includes a sequential block extraction module 6, a cyclic block extraction module 7, and a nested cyclic block extraction module 8. The sequential block extraction module 6 implements the sequential block state extraction step in the state machine equivalent conversion method of the present invention, and the cyclic block extraction module 7 implements the cyclic block extraction step in the method, and the nested loop block extraction module 8 implements A nested loop block extraction step in the method. The extraction module 5 aggregates three different types of state block extraction modules into a whole to connect the state block stack 4, and stores and calls the state blocks through the state block stack 4. The output of the extraction module 5 is stored in the second state machine register 9.

The splicable state machine output by the device generally includes three state blocks, which conform to the splicable rules, and can be used for subsequent state machine splicing methods or re-determining the state machine equivalence judgment method.

The above device is implemented by C++ programming language, and can be applied to x86, MIPS and other processor systems for realizing the configuration and downloading of dynamic reconfigurable pipelines. The device can also be implemented in hardware via verilog as a stand-alone, portable pipeline configuration module.

The invention is further illustrated below in conjunction with specific embodiments.

Example 1:

As shown in the loop state block of FIG. 2, a complete loop includes three states, the number of loops is N, and the state block of length 2 is forwardly extracted.

Step 1: Step 1, state machine preprocessing steps

The input is a cyclic state block, not a two-dimensional structure. Construct a header area, a main area, and a tail area for the status block, and place the original loop status block into the main area, and the header area and the tail area are blanked, as shown in FIG.

Step 2: Step 2, Status Block Reverse Step

The extraction method is forward extraction, and the input state machine is placed in the input of step 3, and the process proceeds to step 3.

The third step: step 3, transformation type judgment step

Read the first status block of the input state machine. The current status block is a cyclic block and go to step 5.

Step 4: Step 5: Loop block state extraction step

This step receives the input loop block and the length to be extracted is 2.

Substep 5.0 tail region length judgment substep

The current tail area is empty, the length is 0, which is smaller than the length to be extracted, and jump to sub-step 5.1.

Sub-step 5.1 single-round loop extraction sub-step

All the states inside the loop body are sequentially formed into a new sequence block, and the sequence block is placed in the head of the tail region, and the number of cycles of the loop block is increased by 1 (the total number of cycles of the loop body is reduced by 1), as shown in FIG. . Go to substep 5.2.

Sub-step 5.2, tail region extraction sub-step

The length to be extracted is 2, the number of internal states of the cyclic block is 3, and the length to be extracted is smaller than the number of internal states of the cyclic block. The two states of the header are extracted from the sequential block of the tail region, and a new sequential block is placed in the tail of the extraction region, and the tail region is cleared. The number of states in the extracted sequential block is 1, and the extracted sequential block is (Only one state A3) is placed in the tail region as shown in Figure 5. Go to substep 5.3.

Sub-step 5.3 cyclic block rolling substep

The two states of the head in the loop block are taken out to the end of the state in the loop block to form a cyclic scroll, and the length to be extracted is set to 0, as shown in FIG. Go to substep 8.

Step 5: Step 8, iterative judgment step

The current length to be extracted is 0, and the process jumps to step 9.

Step 6: Step 9, output steps

The extraction area now contains a sequential status block with 2 states A1 and A2. The extracted area status block is placed at the end of the first status block header area; the second status block is a cyclic status block, the internal status is A3, A1, A2, and the number of loops is 9; the third status block is the tail status status The block contains a state A3. These three status blocks are output, as shown in Figure 7. The method ends.

Example 2:

As shown in Figure 8, the nested loop state block, a complete loop includes a sequence state block and a loop state block, the loop state block loop number is M, the nested loop block loop number is N, and the forward extraction length is A status block of 2.

Step 1: Step 1, state machine preprocessing steps

The input is a nested loop state block, not a two-dimensional structure. A header area, a main area, and a tail area are constructed for the status block, and the original nested loop status block is placed in the main area, and the header area and the tail area are set to be empty.

Since the state block is a nested loop block, a two-dimensional structure is constructed for each state block within the state block. First, a two-dimensional structure is constructed for the internal sequence block A1: a header area, a main area, and a tail area are constructed for the sequence block, and the order block is placed in the main area, and its header area and the tail area are set to be empty. Then construct a two-dimensional structure for the inner loop state block: construct a head region, a main region, and a tail region for the loop block, and put the loop block into the main region, and its head region and tail region are set to be empty.

The pre-processing is completed as shown in Figure 9. Go to step 2.

Step 2: Step 2, Status Block Reverse Step

The third step: step 3, transformation type judgment step

Read the first status block of the input state machine. The current status block is a nested loop block. Go to step 6.

Step 4: Step 6. Nested loop block state extraction step

This step receives the nested loop block input and the length to be extracted is 2.

Sub-step 6.0, tail region judgment sub-step

The tail region of the current nested loop block is empty, skip to substep 6.1;

Sub-step 6.1, single-round nested loop block extraction sub-step

All state blocks in the nested loop block are extracted, placed in the tail region in order, and the number of loops of the nested loop block is incremented by 1, as shown in FIG. Go to substep 6.2.

Sub-step 6.2, nested extraction sub-steps

The tail region of the nested loop block is taken out to form a new state machine, which replaces a sequence block A1 and a loop block A2A3. The method is recursively called with the length 2 to be extracted and the new state machine as input.

Recursive first step: Step 1, state machine preprocessing steps

The input is a sequential status block and a cyclic status block, both of which are two-dimensional structures. Go to step 2.

Recursive second step: step 2, state block reverse step

Recursive third step: step 3, transformation type judgment step

Read the first status block of the input state machine as a sequence block and jump to step 4.

Recursive fourth step: Step 4, sequential block state extraction step

This step receives the sequence status block A1, which has a length of 1 and a length to be extracted of 2. If the number of states to be extracted is greater than or equal to the number of states in the sequence block, all the sequence blocks A1 are placed at the end of the extraction region, the state block in the state machine is deleted, and the length to be extracted is subtracted from the state number 1 in the sequence block, and the current to-be-extracted length Is 1. The extracted state machine is output as shown in FIG. Go to step 8.

Recursive fifth step: step 8, iterative judgment step

The current to-be-extracted length is not 0, and the current state machine and the length 1 to be extracted are taken as the input of step 3, and the process proceeds to step 3.

Recursive sixth step: step 3, transformation type judgment step

Read the first status block of the input state machine as a loop block and skip to step 5.

Recursive seventh step: Step 5, loop block state extraction step

The loop block received in this step is A2A3, the number of loops is 5, and the length to be extracted is 1.

Sub-step 5.0, tail region length judgment sub-step

The current tail region is empty, the length is 0, which is smaller than the length 1 to be extracted, and jumps to sub-step 5.1.

Sub-step 5.1, single-round loop extraction sub-step

All the states inside the loop body are grouped into a new sequence block in order, and the sequence block is placed in the head of the tail region, and the number of cycles of the loop block is incremented by 1, as shown in FIG. Go to substep 5.2.

Sub-step 5.2, tail region extraction sub-step

The length to be extracted is 1, which is smaller than the number of internal states of the loop block. 2, the state of the head is extracted from the sequence block in the tail region, placed in the tail of the extraction region, the tail region is cleared, and the number of states in the sequence block after the extraction is obtained. If it is not 0, the extracted sequential block A3 is placed in the tail region as shown in FIG. Go to substep 5.3.

Sub-step 5.3, loop block rolling sub-step

The state of the head in the loop block is taken out to the end of the state inside the loop block, forming a cyclic scroll, and the length to be extracted is set to zero. The current loop block is A3A2, and the number of loops is M-1, as shown in FIG. Go to substep 8.

Recursive eighth step: step 8, iterative judgment step

The current length to be extracted is not 0, and the process jumps to step 9.

Recursive ninth step: step 9, output step

The extracted area status block A1A2 is placed at the end of the first status block header area. The original extraction method is forward extraction, and the recursive method ends. The first status block is output as the sequence block A1A2, the second status block is the loop block A3A2, the number of loops is M-1, and the third status block is A3, as shown in FIG. Returns the recursive call location.

Step 4: Step 6. Nested loop block state extraction step

Sub-step 6.2 nested extraction sub-steps

The recursive call returns, the first status block returned is the sequence block A1A2, which is taken out to the end of the extraction area. Go to substep 6.3.

Sub-step 6.3 nested scroll substeps

All state blocks in the nested loop block are fetched, and a new state machine is formed in order, which includes a sequential block A1 and a loop block A2A3, and the number of loops is 5. This method is called recursively, and the input is the state machine, and the length to be extracted is 2. This recursive call process is exactly the same as the previous one. The first state block returned by the state machine is the sequence block A1A2, which is taken out after the last state block of the return state machine, and all state blocks within the nested loop block are replaced with state blocks within the state machine. All the status blocks in the current nested loop block are: loop block A3A2, loop number 4; sequence block A3; sequence block A1A2. Set the length to be extracted to 0, as shown in Figure 16. Go to step 8.

Step 5: Step 8, iterative judgment step

The current length to be extracted is 0, and the process jumps to step 9.

Step 6: Step 9, output steps

The extracted area status block A1A2 is placed at the end of the first status block header area. The extraction method is forward extraction, and the method ends. The final output state machine is shown in Figure 17.

The specific embodiments described above further explain the objects, technical solutions and advantageous effects of the present invention. It should be understood that the above description is only specific embodiments of the present invention. It is not intended to limit the invention, and any modifications, equivalents, improvements, etc., made within the spirit and scope of the invention are intended to be included within the scope of the invention.

Claims

A method for equivalent transformation of a state machine includes the following steps:

Step 1: initialize the state block of the state machine into a tree-shaped two-dimensional structure;

Step 2: Read a state extraction mode of the state machine and the state machine, select output or reverse for the state machine according to the state extraction mode; if the extraction mode is forward extraction, put the input state machine into the input of step 3, and jump Go to step 3; if the extraction mode is reverse extraction, put the status block into the input of step 2.1, call step 2.1, replace the status block returned in step 2.1 with the original status block in the state machine, and add the new state machine Put in the input of step 3, jump to step 3;

In step 2.1, the tail region of the input state machine is marked as a header region, and the original header region is identified as a tail region;

Wherein, if the current main area is a nested loop block, the status block in the loop block is nested, the sequence is reversed, and step 2.1 is called for each status block, and the original state in the nested loop block is replaced with the returned status block. Block; if the current main area is not a nested loop block, reverse all the states in the status block in the main area;

Output the adjusted status block and return to the previous step of calling the current step;

Step 3, reading the first status block of an input state machine, determining the type of the status block, and jumping to the step of extracting the status of the corresponding status block;

If the current status block is a sequential block, then jump to step 4;

If the current status block is a loop block, then jump to step 5;

If the current status block is a nested loop block, then jump to step 6;

Step 4: receiving a sequence status block and a length to be extracted as an input, extracting a specified number of states from the input sequence block header into the header area, and modifying the length to be extracted; outputting the extracted state machine to jump to Step 8;

Step 5: Receive a loop block and a length to be extracted as an input, determine a length to be extracted, a number of internal states of the loop block, and a number of state of the tail region, and extract a specified number of states;

Sub-step 5.0, calculating the length of the loop block tail region, and determining whether it is necessary to extract a loop block at present;

Sub-step 5.1, all the states inside the loop body are sequentially formed into a new sequential block, the order block is placed in the head of the tail region, the number of cycles of the loop block is incremented by 1, and the jump to sub-step 5.2;

Sub-step 5.2, if the length to be extracted is greater than or equal to the number of internal states of the loop block, the first sequential block in the tail region is placed at the end of the extraction region, and the number of states to be extracted is subtracted from the number of states in the loop block, and the process proceeds to step 8. If the length to be extracted is less than the number of internal states of the loop block, the sequential blocks in the tail region are merged into one sequential block in order, and then the lengths of the head to be extracted are extracted from the merged sequential blocks to form a new one. The sequence block is placed at the end of the extraction area, and the tail area is cleared. If the number of states in the extracted sequence block is not 0, the extracted sequence block is placed in the tail area. Go to substep 5.3;

Sub-step 5.3, the state of the head to be extracted in the loop block is taken out to the end of the state in the loop block, forming a cyclic scroll, and the length to be extracted is set to 0, and jumps to sub-step 8;

Step 6, receiving the nested loop block and the length to be extracted as an input, extracting a specified number of states from the input nested loop block header, and outputting a combination of the state blocks usable for the state machine splicing;

Sub-step 6.0, if the tail region is empty, skip to sub-step 6.1; if the tail region is not empty, skip to sub-step 6.2;

Sub-step 6.1, extract all the state blocks in the nested loop block, put them in the tail region in order, add the number of cycles of the nested loop block to 1, and jump to sub-step 6.2;

Sub-step 6.2, taking the tail region of the nested loop block to form a new state machine, taking the length to be extracted and the new state machine as input, recursively calling the method, and returning the header of the first state block of the state machine All state blocks in the area are taken out, placed in the tail of the extraction area, and jump to sub-step 6.3;

Sub-step 6.3, taking out all the state blocks in the nested loop block, forming a new state machine in order, and extracting the length and the new state machine as input, recursively calling the method, and returning the first state block of the state machine All state blocks in the header area are fetched after the last state block of the returned state machine, and all state blocks in the nested loop block are replaced with state blocks in the state machine, and the length to be fetched is set to 0, hopping Go to step 8;

Step 8, if the current to-be-extracted length is not 0, the current state machine and the length to be extracted are taken as the input of step 3, and the process proceeds to step 3, otherwise the process proceeds to step 9.

Step 9, the extraction area is placed at the end of the first status block header area; if the original extraction mode is reverse extraction, the first status block is placed in the input of step 2.1, and step 2.1 is invoked, and the status block returned in step 2.1 is returned. The method replaces the original status block in the state machine; otherwise the method ends.
The method of equivalence transformation of a state machine according to claim 1, wherein said step 1 comprises:

For each state block of the input state machine, it is judged whether it is already a two-dimensional structure, that is, composed of a header region, a main region, and a tail region, and if so, the state machine is a state machine that has participated in the equivalent transformation, and jumps Go to step 2; if not, construct a two-dimensional structure of the head region, the main region, and the tail region for the state block, put the original state block into the body portion, and empty the header region and the tail region, if the state block is a nested loop The block constructs a two-dimensional structure for each state block within the state block;

Go to step 2.
A method for equivalence transformation of a state machine according to claim 1, wherein in step 4, said receiving a sequence state block and a length to be extracted as an input, extracting a specified number of states from the input sequence block header into the header region And the features of the step of modifying the length to be extracted are:

If the length to be extracted is less than or equal to the number of states in the sequence block, the extraction is started from the beginning of the state block, and the specified number of states are sequentially extracted from the first state of the current state block, and the states are merged into a new sequential state block. , put this state block at the end of the extraction area; extract the remaining part as a new sequential status block, replacing the original status block. Set the length to be extracted to zero.

If the length to be extracted is greater than or equal to the number of states in the sequence block, all the sequence blocks are placed at the end of the extraction region, the state block in the state machine is deleted, and the number of states in the sequence block is subtracted from the length to be extracted.
An equivalent conversion device for a state machine, comprising:

First and second state machine registers (1, 9) for receiving and storing a header area, a main area, and a tail area in the transform process;

The state block type judging module (3) implements a transform type judging step in the state machine equivalence transform method; the module reads the to-be-transformed state block output by the first state machine inversion module (2), and according to the execution result The status block is output to one of the sequential block extraction module (6), the cyclic block extraction module (7) or the nested cyclic block extraction module (8);

The first and second state machine reversal modules (2, 10) implement a state machine reversal step, wherein the first state machine reversal module (2) reads the initial input state machine and the length to be extracted for Processing a first state machine reverse-order transformation during reverse extraction; the second state machine inversion module (10) is coupled to the second state machine register (9) and the state block stack (4) for implementing an output The state machine performed by the backward extraction state machine reverses the sequence, and outputs a splicable state machine after the step is executed;

a status block stack (4) coupled to the first and second state machine inversion modules (2, 10) and the extraction module (5) to provide a stack storage function for the status block for the primary state machine equivalent transformation step , assisting in the transformation steps performed in these modules;

The extraction module (5) comprises a sequential block extraction module (6), a cyclic block extraction module (7), and a nested cyclic block extraction module (8); wherein the sequential block extraction module (6) implements sequential block state extraction Step, the loop block extraction module (7) implements a loop block extraction step, the nested loop block extraction module (8) implements a nested loop block extraction step; the extraction module (5) will have three different types The state block extraction module is assembled as a whole to connect the state block stack (4), and the state block is stored and called through the state block stack (4); the output result of the extraction module (5) is stored to The second state machine register (9).
The equivalent conversion apparatus of the state machine according to claim 4, wherein said first and second state machine registers (1, 9) are designed as a storage mode of a tree-shaped two-dimensional structure.
The equivalent conversion apparatus of the state machine according to claim 4, wherein said status block stack (4) is a stack register for storing a status block, and a status block is used as a basic storage unit, and a stack and a queue for storing the status block are implemented. And other storage structures.
The equivalent conversion apparatus of a state machine according to claim 4, wherein said equivalent conversion means is implemented by a C++ programming language and is suitable for an x86 or MIPS processor system.
The equivalent conversion apparatus of a state machine according to claim 4, wherein said equivalent conversion means is implemented by hardware in verilog as an independent portable pipeline configuration module.