CN101000543A - Method for automatic converting extension active picture into hardware component picture - Google Patents
Method for automatic converting extension active picture into hardware component picture Download PDFInfo
- Publication number
- CN101000543A CN101000543A CN 200610004905 CN200610004905A CN101000543A CN 101000543 A CN101000543 A CN 101000543A CN 200610004905 CN200610004905 CN 200610004905 CN 200610004905 A CN200610004905 A CN 200610004905A CN 101000543 A CN101000543 A CN 101000543A
- Authority
- CN
- China
- Prior art keywords
- hardware
- hardware element
- picture
- subactivity
- activity
- Prior art date
- Legal status (The legal status is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the status listed.)
- Granted
Links
Images
Landscapes
- Devices For Executing Special Programs (AREA)
Abstract
A method for automatically converting an extended activity diagram into hardware component graph includes using hardware element map to present connection relation between hardware element and hardware element and then generating program code of corresponding hardware description language according to said hardware component graph.
Description
Technical field
The invention relates to a kind of method of automatic converting extension active picture into hardware component picture, refer to that especially a kind of expanding activity figure of the execution flow process with representation program converts the step of hardware element figure to, be used for representing the annexation between hardware element and hardware element.
Background technology
Traditional hardware description language (for example: VHDL, Verilog) and can't directly be used for describing the programmed logic of program language in higher and carry out flow process, therefore, must convert program language in higher to UML (Unified ModelingLanguage earlier, UML) defined activity diagram (Activity Diagram in, be called for short AD), because AD is a kind of description figure of flow process, can be in order to the programmed logic and the execution flow process of expression program language in higher, but AD follows between the actual hardware element without any connection, therefore, also can't directly convert AD to hardware description language, simultaneously, therefore, known method can't be directly changed into program language in higher corresponding hardware description language, so give improved necessity.
Summary of the invention
The object of the present invention is to provide the method for a kind of automatic converting extension active picture into hardware component picture (HCG), so that expanding activity figure (EAD) can be converted to hardware element figure (HCG), the demand that is beneficial to follow-up emulation and is converted to hardware description language (VHDL) earlier.
Another object of the present invention is in the method that a kind of automatic converting extension active picture into hardware component picture (HCG) is provided, so that can utilize hardware element figure to represent annexation between hardware element and hardware element.
The invention provides a kind of method of automatic converting extension active picture into hardware component picture, this expanding activity figure includes a plurality of subactivity figure, it is characterized in that, this method comprises:
(A) read a subactivity figure among this expanding activity figure, and when the subactivity figure of this expanding activity figure all has been read, execution in step (E);
(B) when the affiliated kenel of judging this subactivity figure that reads be bifurcated, binding or when merging one of them, be directly changed into corresponding hardware element figure, and execution in step (A);
(C) when judging that this subactivity figure that reads be little computing kenel, this little operator activity diagram carries out grammatical analysis conversion, and converts little operator activity diagram to corresponding hardware element figure, again execution in step (A);
(D) when judging that this subactivity figure that reads be when selecting kenel, after the mark on the output terminal on these hardware elements figure is analyzed, carry out grammatical analysis conversion again, and after this chooser activity diagram converts hardware element figure to, again execution in step (A); And
(E) connect input end and the output terminal of these hardware elements figure, export complete hardware element figure.
Wherein this expanding activity figure comprises: beginning, end, intermediate point, little computing, bifurcated, binding, selection, merging be totally eight kinds of nodes.
Wherein this hardware element figure comprises: begin to finish and three kinds of kenels of element.
Wherein this expanding activity figure is by being defined in the UML program language, and it represents a kind of process control chart.
Wherein this hardware element figure is with the annexation between expression hardware element and the hardware element.
In the method for automatic converting extension active picture into hardware component picture of the present invention, expanding activity figure (Extended activity diagram) revises defined activity diagram (activity diagram) in the part UML program language, and expanding activity figure represents a kind of process control chart.
Description of drawings
For further specifying concrete technology contents of the present invention, below in conjunction with embodiment and accompanying drawing describes in detail as after, wherein:
Fig. 1 is the EAD figure specification figure of a preferred embodiment of the present invention.
Fig. 2 A is the start node figure of a preferred embodiment of the present invention.
Fig. 2 B is the end node figure of a preferred embodiment of the present invention.
Fig. 2 C is the element node diagram of a preferred embodiment of the present invention.
Fig. 2 D is the control path node of a preferred embodiment of the present invention.
Fig. 2 E is the data path node of a preferred embodiment of the present invention.
Fig. 3 A is little computing of a preferred embodiment of the present invention and the corresponding diagram of hardware element figure.
Fig. 3 B is little computing of a preferred embodiment of the present invention and the corresponding diagram of hardware element figure.
Fig. 3 C is little computing of a preferred embodiment of the present invention and the corresponding diagram of hardware element figure.
Fig. 3 D is selection of a preferred embodiment of the present invention and the corresponding diagram of hardware element figure.
Fig. 4 is that the EAD of a preferred embodiment of the present invention converts the process flow diagram with hardware element to.
Fig. 5 is the pairing EAD figure of the JAVA program of a preferred embodiment of the present invention.
Fig. 6 is the pairing HCG figure of the EAD of a preferred embodiment of the present invention.
Embodiment
Because traditional method can't directly be directly changed into program language in higher (High LevelLanguage) hardware description language (for example: VHDL, Verilog), therefore, when the user will be with program language in higher (for example: Java, C, C++ ...) convert hardware description language to before, must convert program language in higher to an intermediate form earlier, be called activity diagram (Activity Diagram is called for short AD) at this.AD is a kind of description figure of flow process, programmed logic and execution flow process with the expression program language in higher, but AD follows between the actual hardware element without any connection, therefore, must again AD be converted to (Hardware Component Graph with the more related hardware element figure of hardware element, be called for short HCG), could produce corresponding hardware description language according to hardware element figure and describe program language in higher.
In the present embodiment, utilize to revise part UML (Unified ModelingLanguage, UML) in the employed activity diagram of defined activity diagram be called expanding activity figure (Extended activity diagram, EAD).Wherein, a complete EAD is made up of a plurality of subactivity figure (sub-graph), EAD also is a kind of control chart that converts corresponding flow process in order to the source code with higher level lanquage to, it is made up of a plurality of nodes (node), is made up to constitute subactivity figure (sub-graph) by different nodes.In the present embodiment, see also the figure specification figure of subactivity figure shown in Figure 1, EAD is divided into into eight kinds of nodes:
1. begin (start) node: the beginning of a sub-activity diagram of expression;
2. finish (end) node: the end of a sub-activity diagram of expression;
3. intermediate point (curve point) node: represent the connection of two directive connecting lines (edge), do not have actual influence, be generally used for making things convenient for the temporary purposes of transfer process for execution;
4. little computing (micro-operation) node: represent the processing of a narration (expression statement) or representation (expression);
5. bifurcated (fork) node: represent parallel execution;
6. link (join) node: expression has only when all little computings all arrive, and sending of output signal just arranged;
7. select (select) node: after being illustrated in decoding, can select to send a suitable output signal; And
8. merge (merge) node: expression is merged back output with input signal.
Aforementioned each node is considered as an object, after each subactivity figure is linked to each other, can produce and convert the program source code to corresponding expanding activity figure, presents the programmed logic of source code and carries out flow process with visual way.
Above-mentioned content by among the present invention the figure specification of all subactivity figure of use introduce.
In an embodiment of the present invention, a complete EAD will convert corresponding hardware element figure (HCG) to, represents relation between program language in higher and the hardware with HCG.See also the figure specification figure of the hardware element figure shown in Fig. 2 A～Fig. 2 C, HCG is divided into into three kinds of kenels:
1. start node (start node): see also shown in Fig. 2 A, start node has write down class name, method name, parameter, local variable, global variable, the return type of JAVA program; Its parameter is defined as follows:
I, M are the information of method (method), comprise the title of method and modify son (modifier)
Ii, R are the information of passback value, comprise its kenel, position size and passback value title
Iii, P are the information of parameter (parameter), comprise its kenel, position size and parameter name
Iv, L are the information of area variable (local variable), comprise kenel, position size and area variable title
2. end node (end node): see also shown in Fig. 2 B, end node represents that this method finishes, and indicates the variable that tendency to develop is returned; Wherein, the content of end node End node is the name variable of desire passback, if do not return any variable, then keyword is VOID.
3. element node (component node): see also shown in Fig. 2 C, the element node indicates register, fork, adder ... Deng hardware element, and there is directional ray to be connected with one between node and node and indicates a certain input port that is connected to destination object from a certain output port of origin object.
In in this enforcement, element node (Component node) can be subdivided into two main portions again:
(1) control path module (Control path modules) sees also shown in Fig. 2 D, and it comprises:
■ string type element (Q-element)
■ block form element (Fork-element)
■ synchronous element (Join-element)
■ condition branch element (Decoder-element)
■ merges element (Merge element)
(2) data path module (Data path modules) sees also shown in Fig. 2 E, and it comprises:
■ arithmetic and logical unit (ALU): AND-element, OR-element, XOR-element, ADD-element, SUB-element, MUL-element, DIV-element,
■ buffer: register-element
■ multi-function device and separate multi-function device:
RMUXDEMUX-element、
WMUXDEMUX-element
■ constant (Constants): constant-element wherein, the content representation method of element node (Component node) is divided into following two:
(1) buffer, these representations that need label to distinguish of constant are:
The element title _ _ name variable (Component name_variable name)
(2) representation that do not need label to distinguish such as MICROOP, CMP, MERGE is:
Element title (Component name)
And online representation is between the node:
The input end of the output terminal → impact point of starting point (source node outputport → target node input port)
In the present embodiment, convert the EAD subgraph to corresponding hardware element figure, see also shown in Fig. 3 A, the left side is the subgraph of EAD, the right is corresponding hardware element figure, wherein, the subgraph of EAD is little computing (micro-operation) node (seeing also shown in Figure 1), and little compute node is in order to represent the processing of a narration (expression statement) or representation (expression).
Example 1: when narrating (expression statement) when being a=b, its pairing hardware element figure is a Q-element, at first, receive the signal of a req2p, then read the data of b, then the data storage with b arrives a, after finishing a=b, pass back to Q again, and send passback ack2q, finish relative hardware element figure.
Example 2: see also shown in Fig. 3 B, the left side is the subgraph of EAD, the right is corresponding hardware element figure, the subgraph of EAD is little computing (micro-operation) node, when the narration (expressionstatement) of EAD is a=b+c, its pairing hardware element figure is a Q-element, at first, receive the signal of a req2p, then read the data of b and c, see through the ADD-element addition again, and be stored into a, finish a=b+c after, pass back to Q again, and send passback ack2q, finish relative hardware element figure.
Example 3: see also shown in Fig. 3 C, when the narration (expressionstatement) of EAD is sum+=i, at first, resolve sum+=i, that is sum=sum+i, therefore must be in conjunction with 2 Q-element, be divided into twice action, at last, send passback ack2q, finish relative hardware element figure.
Example 4: see also shown in Fig. 3 D, when the instructing of EAD for the judgement formula, when judging a＞b or two kinds of situations of a＜=b, utilize a CMP to compare the size of a and b, at last and produce two paths, when a＞b (TRUE), then send a return path signal gt4p, if a＜=b (FALSE) then sends a return path signal cf4p by another path, pass back to D again, finish relative hardware element figure.
Utilize the figure specification figure of above-mentioned hardware element figure, EAD can be converted to and the more related hardware element figure of hardware element, Fig. 4 shows that EAD converts the process flow diagram with hardware element to, at first, read the subactivity figure (step S401) among this expanding activity figure, then, judge the affiliated kenel (step S402) of the subactivity figure that this reads, when the kenel of this subactivity figure that reads is bifurcated (fork), link (join), or merge (merge) a period of time wherein, be directly changed into corresponding hardware element figure (step S403), afterwards, again read the subactivity figure among this expanding activity figure again, when all subactivity figure all have been read and have converted to till the corresponding hardware element figure.
When in (step S402), judging that this subactivity figure that reads is little computing (micro-operation) kenel, to carry out grammatical analysis conversion (step S404) to little operator activity diagram, again the chooser activity diagram is converted to (step S406) behind the corresponding hardware element figure, again read the subactivity figure in this activity diagram, when all subactivity figure all have been read and have converted to till the corresponding hardware element figure.
When judging that in (step S402) this subactivity figure that reads is when selecting (select) kenel, earlier the mark (label) on the output terminal on these hardware elements figure is analyzed back (step S405), afterwards, the chooser activity diagram is carried out grammatical analysis conversion (step S404), again the chooser activity diagram is converted to (step S406) behind the corresponding hardware element figure, after all subactivity figure all have been read and have converted corresponding hardware element figure (step S407) to, produce input end and output terminal (step S408) that connecting line connects these hardware elements figure, at last, promptly exportable complete hardware element figure (step S409).
In the present invention, be to convert one section complete JAVA program language to corresponding hardware element figure, in the present embodiment, be example with a JAVA program that adds up,
Above-mentioned JAVA program is convertible into corresponding EAD figure, sees also shown in Figure 5ly, then, the EAD figure is converted to hardware element figure HCG, as shown in Figure 6 again.
By above explanation as can be known, the method of automatic converting extension active picture into hardware component picture of the present invention can be with multiple this different program language in higher (for example: Java, C, C++ ...) source code convert corresponding expanding activity figure (EAD) automatically to, see through expanding activity figure (EAD) again and convert (Hardware Component Graph to the more related hardware element figure of hardware element, HCG), could produce corresponding hardware description language according to hardware element figure and describe program language in higher.
Via above-mentioned transfer process, the JAVA program can be converted to hardware element figure, as shown in Figure 6, wherein, uppermost node is start node (Start Node), start node is noted down class information and the method information in the JAVA program respectively; Among Fig. 6 the node of below be end node (end node), end node represents that this method has finished and requires return value; Remaining node then indicates hardware elements such as register, micro-operation, fork and adder respectively among Fig. 6, and indicate with a directive connecting line between node and the node, be connected to an input port of destination object from an output port of origin object.
The foregoing description only is to give an example for convenience of description, and the interest field that the present invention advocated should be as the criterion so that claim is described certainly, but not only limits to the foregoing description.
Claims (5)
1, a kind of method of automatic converting extension active picture into hardware component picture, this expanding activity figure includes a plurality of subactivity figure, it is characterized in that, and this method comprises:
(A) read a subactivity figure among this expanding activity figure, and when the subactivity figure of this expanding activity figure all has been read, execution in step (E);
(B) when the affiliated kenel of judging this subactivity figure that reads be bifurcated, binding or when merging one of them, be directly changed into corresponding hardware element figure, and execution in step (A);
(C) when judging that this subactivity figure that reads be little computing kenel, this little operator activity diagram carries out grammatical analysis conversion, and converts little operator activity diagram to corresponding hardware element figure, again execution in step (A);
(D) when judging that this subactivity figure that reads be when selecting kenel, after the mark on the output terminal on these hardware elements figure is analyzed, carry out grammatical analysis conversion again, and after this chooser activity diagram converts hardware element figure to, again execution in step (A); And
(E) connect input end and the output terminal of these hardware elements figure, export complete hardware element figure.
As the method for claim 1 a described automatic converting extension active picture into hardware component picture, it is characterized in that 2, wherein this expanding activity figure comprises: beginning, end, intermediate point, little computing, bifurcated, binding, selection, merging be totally eight kinds of nodes.
As the method for claim 1 a described automatic converting extension active picture into hardware component picture, it is characterized in that 3, wherein this hardware element figure comprises: begin to finish and three kinds of kenels of element.
As the method for claim 1 a described automatic converting extension active picture into hardware component picture, it is characterized in that 4, wherein this expanding activity figure is by being defined in the UML program language, it represents a kind of process control chart.
As the method for claim 1 a described automatic converting extension active picture into hardware component picture, it is characterized in that 5, wherein this hardware element figure is with the annexation between expression hardware element and the hardware element.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CNB2006100049051A CN100424639C (en) | 2006-01-11 | 2006-01-11 | Method for automatic converting extension active picture into hardware component picture |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CNB2006100049051A CN100424639C (en) | 2006-01-11 | 2006-01-11 | Method for automatic converting extension active picture into hardware component picture |
Publications (2)
| Publication Number | Publication Date |
|---|---|
| CN101000543A true CN101000543A (en) | 2007-07-18 |
| CN100424639C CN100424639C (en) | 2008-10-08 |
Family
ID=38692532
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CNB2006100049051A Expired - Fee Related CN100424639C (en) | 2006-01-11 | 2006-01-11 | Method for automatic converting extension active picture into hardware component picture |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN100424639C (en) |
Cited By (1)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN113822007A (en) * | 2021-11-22 | 2021-12-21 | 北京芯愿景软件技术股份有限公司 | Circuit generation method, circuit generation device, circuit generation equipment and circuit generation medium |
Family Cites Families (3)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| DE10161065A1 (en) * | 2001-12-12 | 2003-07-03 | Siemens Ag | System and method for testing and / or debugging runtime systems to solve MES tasks |
| US20050144529A1 (en) * | 2003-10-01 | 2005-06-30 | Helmut Gotz | Method for defined derivation of software tests from use cases |
| US7685576B2 (en) * | 2004-01-26 | 2010-03-23 | Siemens Corporation | System and method for model based system testing of interactive applications |
-
2006
- 2006-01-11 CN CNB2006100049051A patent/CN100424639C/en not_active Expired - Fee Related
Cited By (1)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN113822007A (en) * | 2021-11-22 | 2021-12-21 | 北京芯愿景软件技术股份有限公司 | Circuit generation method, circuit generation device, circuit generation equipment and circuit generation medium |
Also Published As
| Publication number | Publication date |
|---|---|
| CN100424639C (en) | 2008-10-08 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| CN101957745B (en) | Method for converting ladder diagram language into structure text language | |
| US20120131541A1 (en) | Specification method for producing data processing systems | |
| US20040210831A1 (en) | Signal navigation and label propagation in block diagrams | |
| CN104679488A (en) | Flow path customized development platform and method | |
| CN101777004A (en) | Method and system for realizing BPEL sub-process multiplexing based on template in service-oriented environment | |
| CN104267654A (en) | Method and system for converting ladder diagram program into instruction list program and compiling instruction list program | |
| CN107992686B (en) | Wire harness path generation system for full-automatic wiring machine | |
| CN101673198A (en) | Method for verifying consistency of dynamic behavior in UML model and time-sequence contract | |
| CN101770437A (en) | Structure and method for realizing concurrent reading and concurrent writing of IP of synchronous dual-port memory | |
| CN103984665A (en) | Serial port communication device and method based on LabVIEW | |
| CN101609427B (en) | Programmable network service automation test system and programmable network service automation method | |
| CN101469990A (en) | Dual-CPU embedded navigation computer | |
| CN100424639C (en) | Method for automatic converting extension active picture into hardware component picture | |
| US6546542B2 (en) | Parameterized designing method of data driven information processor employing self-timed pipeline control | |
| CN109241594A (en) | T-type topological structure wire length inspection method, device, equipment and readable storage medium storing program for executing | |
| CN100470468C (en) | Method for automatic converting higher-order program language into hardware descriptive language | |
| CN101751115B (en) | Method for solving data transmission matching of DSP and low-speed output device | |
| CN111158669A (en) | Graphical programming visual system and industrial control method | |
| CN104834629A (en) | Bus type central processing unit | |
| JPWO2009133590A1 (en) | Circuit diagram editing apparatus and circuit diagram editing program | |
| JP5099119B2 (en) | Device connection test circuit generation method, generation device, and generation program | |
| US20170090882A1 (en) | Program development support system and program development support software | |
| JP2007183902A (en) | Automatic conversion method of extended activity diagram (ead) into hardware component graph (hcg) | |
| CN101004676A (en) | Method for automatic converting program language in higher level to activity diagram | |
| CN100442224C (en) | Method for converting hardware component graph into hardware descriptive language |
Legal Events
| Date | Code | Title | Description |
|---|---|---|---|
| C06 | Publication | ||
| PB01 | Publication | ||
| C10 | Entry into substantive examination | ||
| SE01 | Entry into force of request for substantive examination | ||
| C14 | Grant of patent or utility model | ||
| GR01 | Patent grant | ||
| C41 | Transfer of patent application or patent right or utility model | ||
| TR01 | Transfer of patent right |
Effective date of registration: 20090424 Address after: Taiwan, Taipei, China Co-patentee after: Datong University Patentee after: Tatung Company Address before: Taipei City, Taiwan, China Patentee before: Datong Co., Ltd. |
|
| CF01 | Termination of patent right due to non-payment of annual fee |
Granted publication date: 20081008 Termination date: 20130111 |
|
| CF01 | Termination of patent right due to non-payment of annual fee |