Type generic graphical programming

• US 8,943,469 B2
• Filed: 10/02/2012
• Issued: 01/27/2015
• Est. Priority Date: 03/06/2007
• Status: Active Grant

• Current Assignee: National Instruments Corporation (Emerson Electric Company)
• Original Assignee: National Instruments Corporation (Emerson Electric Company)
• Inventors: Kumar, Satish V., Hudson, Duncan G. III, Kodosky, Jeffrey L., Rogers, Steven W., Petersen, Newton G.
• Primary Examiner(s): Deng, Anna
• Assistant Examiner(s): Wu, Junchun
• Application Number:
  US13/633,405
• Publication Number:
  US 20130031494A1
• Time in Patent Office: 847 Days
• Field of Search: 717/109
• US Class Current: 717/109
• CPC Class Codes: G06F 8/34 Graphical or visual programming

Abstract

A system and method for creating and using type generic graphical programs. The method may include storing a first graphical program on a memory medium. The first graphical program may have been created based on user input. The first graphical program may include a plurality of nodes and interconnections between the nodes, and the plurality of nodes and interconnections between the nodes may be type generic. User input may be received specifying one or more data types of at least one input and/or at least one output of the first graphical program. The data types may be associated with the first graphical program in response to said user input specifying the one or more data types.

Claims

1. A method comprising:

using a computer to implement;

creating a first graphical data flow program in response to user input, wherein the first graphical data flow program includes a plurality of interconnected nodes, wherein the interconnected nodes visually indicate functionality of the first graphical data flow program, and wherein the first graphical data flow program is a data type-generic graphical data flow program;

wherein each of the nodes comprises at least one of an input or an output, and wherein for at least a first subset of the nodes, input(s) and/or output(s) for the first subset are not restricted to a specific data type;

wherein the first graphical data flow program is executable to perform the functionality for a plurality of different data types; and

wherein the first graphical data flow program comprises one set of graphical code that performs the functionality for the plurality of different data types;

instantiating a plurality of instances of the first graphical data flow program in a second graphical data flow program, wherein each instance is a data type-specific graphical data flow program;

determining if two or more of the instances have same data types; and

in response to determining that two or more of the instances have the same data types, replacing one or more of the instances with a reference to a particular instance of the first graphical data flow program with the same data types.

2. The method of claim 1, wherein the plurality of nodes comprise at least one type generic input or output and at least one statically typed input or output.

3. The method of claim 1, wherein each of the one or more inputs and the one or more outputs of the plurality of nodes is type generic.

4. The method of claim 1,

wherein nodes in at least a subset of the plurality of instances are associated with respective different data types.

5. The method of claim 1, further comprising:

receiving user input assigning data types for one or more inputs and/or one or more outputs of one or more of the plurality of nodes in the first graphical data flow program; and

automatically assigning types for a plurality of inputs and/or outputs of other nodes in the first graphical data flow program, wherein said automatically assigning is performed in response to said receiving user input assigning data types.

6. The method of claim 1, wherein the first graphical data flow program includes a type generic graphical user interface (GUI).

7. The method of claim 1, further comprising:

instantiating the first graphical data flow program in the second graphical data flow program a plurality of times to produce a plurality of instances of the first graphical data flow program;

specifying data types for at least one element of each of the instances, wherein after said specifying, each of the instances is configured for the specified data types; and

generating a hardware description of the second graphical data flow program comprising the instances; and

configuring a programmable hardware element with the hardware description to produce a configured programmable hardware element, wherein the configured programmable hardware element is operable to perform functionality of the second graphical data flow program.

8. The method of claim 1, further comprising:

analyzing attributes of one or more inputs and/or outputs of the plurality of nodes in the first graphical data flow program;

modifying at least a subset of the first graphical data flow program to optimize performance of the at least a subset, wherein said modifying is performed based on said analyzing.

9. The method of claim 8, wherein the attributes comprise constant information which indicates that a node output is a constant, and wherein said modifying utilizes the constant information.

10. The method of claim 1, wherein said creating the first graphical data flow program comprises:

creating a type specific graphical data flow program; and

converting the type specific graphical data flow program to the first graphical data flow program.

11. The method of claim 1, further comprising:

specifying one or more data types for one or more inputs and/or one or more outputs of one or more of the plurality of nodes in the first graphical data flow program;

automatically determining an implementation of the first graphical data flow program based on the specified one or more data types.

12. The method of claim 11, wherein the first graphical data flow program comprises a plurality of graphical subprograms, wherein at least one of the plurality of graphical subprograms is a type generic graphical subprogram;

and

wherein said automatically determining an implementation of the first graphical data flow program comprises selecting one of the plurality of graphical subprograms.

13. The method of claim 11, wherein the first graphical data flow program comprises type checking logic, and wherein said automatically determining an implementation of the first graphical data flow program comprises using the type checking logic.

14. The method of claim 1, wherein the first graphical data flow program comprises one or more overloaded function nodes.

15. A non-transitory computer readable memory medium which stores:

a first graphical data flow program, wherein the first graphical data flow program includes a plurality of interconnected nodes, wherein the interconnected nodes visually indicate functionality of the first graphical data flow program, and wherein the first graphical data flow program is a data type generic graphical data flow program;

wherein each of the nodes comprises at least one of an input or an output, and wherein for at least a first subset of the nodes, input(s) and/or output(s) for the first subset are not restricted to a specific data type; and

wherein the first graphical data flow program is executable to perform the functionality for a plurality of different data types; and

program instructions executable to;

instantiate a plurality of instances of the first graphical data flow program in a second graphical data flow program, wherein each instance is a data type-specific graphical data flow program;

determine if two or more of the instances have same data types; and

if two or more of the instances have the same data types, replace one or more of the instances with a reference to a particular instance of the first graphical data flow program with the same data types.

16. The non-transitory computer readable memory medium of claim 15, wherein the plurality of nodes comprise at least one type generic input or output and at least one statically typed input or output.

17. The non-transitory computer readable memory medium of claim 15, wherein each of the one or more inputs and the one or more outputs of the plurality of nodes is type generic.

18. The non-transitory computer readable memory medium of claim 15, wherein nodes in at least a subset of the plurality of instances are associated with respective different data types.

19. The non-transitory computer readable memory medium of claim 15, wherein the program instructions are further executable to:

receive user input assigning data types for one or more inputs and/or one or more outputs of one or more of the plurality of nodes in the first graphical data flow program; and

automatically assign types for a plurality of inputs and/or outputs of other nodes in the first graphical data flow program in response to said receiving user input assigning data types.

20. The non-transitory computer readable memory medium of claim 15, wherein the first graphical data flow program includes a type generic graphical user interface (GUI).

21. The non-transitory computer readable memory medium of claim 15, wherein the program instructions are further executable to:

instantiate the first graphical data flow program in the second graphical data flow program a plurality of times to produce a plurality of instances of the first graphical data flow program;

specify data types for at least one element of each of the instances, wherein after said specifying, each of the instances is configured for the specified data types; and

generate a hardware description of the second graphical data flow program comprising the instances; and

configure a programmable hardware element with the hardware description to produce a configured programmable hardware element, wherein the configured programmable hardware element is operable to perform functionality of the second graphical data flow program.

22. The non-transitory computer readable memory medium of claim 15, wherein the program instructions are further executable to:

analyze attributes of one or more inputs and/or outputs of the plurality of nodes in the first graphical data flow program; and

modify at least a subset of the first graphical data flow program to optimize performance of the at least a subset, wherein said modifying is performed based on said analyzing.

23. The non-transitory computer readable memory medium of claim 22, wherein the attributes comprise constant information which indicates that a node output is a constant, and wherein said modifying utilizes the constant information.

24. The non-transitory computer readable memory medium of claim 15, wherein the first graphical data flow program is created in response to user input, including:

creating a type specific graphical data flow program; and

converting the type specific graphical data flow program to the first graphical data flow program.

25. The non-transitory computer readable memory medium of claim 15, wherein the program instructions are further executable to:

specify one or more data types for one or more inputs and/or one or more outputs of one or more of the plurality of nodes in the first graphical data flow program;

automatically determine an implementation of the first graphical data flow program based on the specified one or more data types.

26. The non-transitory computer readable memory medium of claim 25,

wherein the first graphical data flow program comprises a plurality of graphical subprograms, wherein at least one of the plurality of graphical subprograms is a type generic graphical subprogram;

and

wherein said automatically determining an implementation of the first graphical data flow program comprises selecting one of the plurality of graphical subprograms.

27. The non-transitory computer readable memory medium of claim 25, wherein the first graphical data flow program comprises type checking logic, and wherein said automatically determining an implementation of the first graphical data flow program comprises using the type checking logic.

28. The non-transitory computer readable memory medium of claim 15, wherein the first graphical data flow program comprises one or more overloaded function nodes.

29. A system, comprising:

a processor;

a memory medium coupled to the processor which stores a first graphical data flow program, wherein the first graphical data flow program includes a plurality of interconnected nodes, wherein the interconnected nodes visually indicate functionality of the first graphical data flow program, and wherein the first graphical data flow program is a data type generic graphical data flow program;

wherein each of the nodes comprises at least one of an input or an output, and wherein for at least a first subset of the nodes, input(s) and/or output(s) for the first subset are not restricted to a specific data type; and

wherein the first graphical data flow program is executable to perform the functionality for a plurality of different data types; and

wherein the memory medium further stores program instructions executable by the processor to;

instantiate a plurality of instances of the first graphical data flow program in a second graphical data flow program, wherein each instance is a data type-specific graphical data flow program;

determine if two or more of the instances have same data types; and

if two or more of the instances have the same data types, replace one or more of the instances with a reference to a particular instance of the first graphical data flow program with the same data types.