Processing method for an iconic programming system

• US 5,313,575 A
• Filed: 05/14/1993
• Issued: 05/17/1994
• Est. Priority Date: 06/13/1990
• Status: Expired due to Term

• Current Assignee: Agilent Technologies, Inc., Hewlett-Packard Company (HP Inc.), Hewlett-Packard Development Company, L.P. (HP Inc.)
• Original Assignee: Hewlett-Packard Company (HP Inc.)
• Inventors: Beethe, Douglas C.
• Primary Examiner(s): Harkcom, Gary V.
• Assistant Examiner(s): Breene, John E.
• Application Number:
  US08/063,102
• Time in Patent Office: 368 Days
• Field of Search: 395/153-161, 395/700, 395/140, 364/474.24, 364/488-491, 340/709-710, 340/723
• US Class Current: 715/763
• CPC Class Codes: G06F 8/34 Graphical or visual programming
• CPC Class Codes: G06F 9/4843 by program, e.g. task dispatcher, supervisor, operating system

Abstract

An iconic programming system wherein each icon within the system may have zero or more data input connections, zero or more data output connections, an optical sequence input connection, and an optional sequence output connection. Each of these connections may be used to graphically connect each icon to another icon to form a network of icons that operates as a computer program. Execution of the network is accomplished by processing each icon and performing any programming functions represented by the icon. After an icon is processed, data resulting from the processing is sent to all icons connected to data or sequence output connections, and those icons are scheduled for processing. Any start icons in the network are scheduled to process first. If an icon is scheduled for processing and it does not have data available to an input, the icon connected to that input is scheduled.

Claims

1. In an iconic programming system executing in a computer system, wherein each icon in said programming system may have zero or more data input connections and zero or more data output connections, and wherein said icons are graphically connected together by a user of the computer system graphically connecting data output connections to data input connections to form a network of icons, a computer implemented method for processing said icons of said network to perform data processing functions represented by said icons, said computer implemented method for processing comprising the steps of:

(a) programmatically examining all icons within said network and discontinuing processing if all data input connections of all said icons are not connected to a data output connection of another icon;

(b) programmatically examining all icons within said network and discontinuing processing if any data input connection of any of said icons is connected to a data output connection of more than one other icon;

(c) programmatically examining all icons within said network and programmatically scheduling all start icons in said network to be processed before processing any other icons;

(d) when processing an icon, programmatically scheduling, for processing, all icons connected to data output connections of said icon being processed;

(e) when processing an icon, if said icon contains data input connections that have not received data, discontinuing processing of said icon and programmatically scheduling, for processing, all icons connected to said data input connections that have not received data; and

(f) processing each icon of said network of icons after said icon is scheduled and said icon has received data on all data input connections of said icon.

2. The computer implemented method for processing of claim 1 wherein step (c) further comprises the step of:

(c1) if said network does not contain any start icons, scheduling all icons in said network for processing.

3. The computer implemented method for processing of claim 1 wherein step (c) further comprises the step of examining said network and discontinuing processing if said network contains one or more feedback loops, wherein a data output of a first icon connects directly or through at least one other icon to a data input of said first icon, and said network does not contain at least one start icon.

4. In an iconic programming system executing in a computer system, wherein each icon in said programming system may have zero or more data input connections, zero or more data output connections, an optional sequence input connection and an optional sequence output connection, and wherein said icons are graphically connected together by a user of the computer system graphically connecting data output connections and sequence output connections of icons to data input connections and to sequence input connections of other icons to form a network of icons, a computer implemented method for processing said icons of said network to perform data processing functions represented by said icons, said computer implemented method for processing comprising the steps of:

(a) programmatically placing all start icons in said network of icons into a pending queue to cause said start icons to be processed before processing any other icons;

(b) processing a next icon from said pending queue comprising the steps of

(b1) if said next icon has a sequence input connection and said sequence input connection has received a signal from a sequence output connection of another icon, and each data input connection of said next icon has had data transferred to said data input connection from a data output connection of another icon, processing said next icon comprising the steps of

(b1a) programmatically executing any data processing functions defined for said next icon,

(b1b) transferring output data, created by programmatically executing said data processing functions defined for said next icon, to all icons connected to data output connections of said next icon, and

(b1c) programmatically placing all icons connected to said data output connections of said next icon into said pending queue for subsequent processing, and

(b2) if said next icon has no sequence input connection and each data input connection of said next icon has had data transferred to said data input connection from a data output connection of another icon, processing said next icon comprising the steps of

(b2a) programmatically executing any data processing functions defined for said next icon,

(b2b) transferring output data, created by programmatically executing said data processing functions defined for said next icon, to all icons connected to data output connections of said next icon, and

(b2c) programmatically placing all icons connected to said data output connections of said next icon into said pending queue for subsequent processing, and

(b3) if said icon has no sequence input connection and contains one or more data input connections that have not received data, programmatically placing all icons connected to said one or more data input connections that have not received data into said pending queue; and

(b4) if said icon has a sequence input connection that has not received a sequence signal from a sequence output connected from another icon, programmatically placing said another icon into said pending queue;

(c) repeating step (b) until sad pending queue is empty.

5. The process of claim 4 further comprising the following steps wherein the following step (b5) is performed after step (b4) and wherein the following steps (d) through (h) are performed after step (c):

(b5) if said icon was processed by step (b1) or step (b2), programmatically placing said icon at a top location on a done stack;

(d) removing at one icon from a top location of said done stack;

(e) programmatically sending a sequence signal to all icons connected to a sequence output connection of said top icon;

(f) programmatically placing all icons connected to said sequence output connection of said top icon into said pending queue;

(g) if said pending queue is not empty, continuing with step (b); and

(h) if said done stack is not empty, continuing with step (d).

6. The process of claim 4 wherein step (a) further comprises the step of:

(a1) if said network of icons does not contain any start icons, placing all icons in said network into said pending queue.

7. The process of claim 4 wherein step (a) further comprises the step of:

(a1) programmatically examining said network of icons and discontinuing processing if said network of icons contains one or more feedback loops, wherein a data output connection of a first icon is connected directly or through at least one other icon to a data input connection of said first icon, and said network of icons does not contain at least one start icon.

8. In an iconic programming system executing in a computer system, wherein each icon in said programming system may have zero or more data input connections, zero or more data output connections, an optional sequence input connection and an optional sequence output connection, and wherein said icons are graphically connected together by a user of the computer system graphically connecting data output connections and sequence output connections of icons to data input connections and to sequence input connections of other icons to form at least one network of icons, a computer implemented method for processing said icons of said network to perform data processing functions represented by said icons, said computer implemented method for processing comprising the steps of:

(a) programmatically separating said icons into a list of connected icon threads comprising the steps of

(a1) selecting a first icon for a thread,

(a2) selecting all icons connected to data output connections or sequence output connections of said first icon for said thread,

(a3) repeating step (a2) for all icons selected in step (a2), and

(a4) repeating steps (a1) through (a3) if unselected icons remain in said network of icons;

(b) programmatically creating a pending queue and a done stack for each of said threads;

(c) programmatically placing all start icons selected for each of said threads into said pending queue for said thread;

(d) selecting one of said threads for processing,

(e) if said pending queue of said selected thread is not empty, selecting a next icon form said pending queue and processing said next icon comprising the steps of

(e1) if said next icon has a sequence input connection and said sequence input connection has received a signal from a sequence output connection of another icon, and each data input connection of said next icon has had data transferred to said data input connection from a data output connection of another icon, processing said next icon comprising the steps of

(e1a) programmatically executing any data processing functions defined for said next icon,

(e1b) transferring output data, created by programmatically executing said data processing functions defined for said next icon, to all icons connected to data output connections of said next icon, and

(e1c) programmatically placing all icons connected to said data output connections of said next icon into said pending queue for subsequent processing, and

(e2) if said next icon has no sequence input connection and each data input connection of said next icon has had data transferred to said data input connection from a data output connection of another icon, processing said next icon comprising the steps of

(e2a) programmatically executing any data processing functions defined for said next icon,

(e2b) transferring output data, created by programmatically executing said data processing functions defined for said next icon, to all icons connected to data output connections of said next icon, and

(e2c) programmatically placing all icons connected to said data output connections of said next icon into said pending queue for subsequent processing;

(e3) if said icon contains one or more data input connections that have not had data transferred thereto, programmatically placing all icons connected to said data input connections that have not had data transferred thereto on said pending queue,

(e4) if said icon contains a sequence input connection that has not received a signal from a sequence output connection of another icon, programmatically placing said another icon connected to said sequence input connection into said pending queue, and

(e5) if said icon was processed by step (e1) or step (e2), placing said icon at a top location on said done stack of said selected thread;

(f) if said pending queue for said selected thread is empty and said done stack of said selected thread is not empty, processing said thread comprising the steps of

(f1) removing a top icon from a top location of said done stack,

(f2) programmatically sending a sequence signal to all icons connected to a sequence output connection of said top icon, and

(f3) programmatically placing all icons connected to said sequence output connection of said top icon on said pending queue of said selected thread; and

(g) repeating steps (d) through (f) until all pending queues and all done stacks created in step (b) are empty.

9. The process of claim 8 wherein step (c) further comprises the step of:

(c1) if a thread does not contain any start icons, placing all icons in said thread on said pending queue of said selected thread.

10. The process of claim 8 wherein step (c) further comprises the step of:

(c1) programmatically examining each of said threads and discontinuing processing if any thread contains one or more feedback loops, wherein a data output connection of a first icon connects directly or through at least one other icon to a data input connection of said first icon, and said thread does not contain at least one start icon.

11. In an iconic programming system executing in a computer system, wherein each icon in said programming system may have zero or more data input connections, zero or more data output connections, an optional sequence input connection and an optional sequence output connection, and wherein said icons are graphically connected together by a user of the computer system graphically connecting data output connections and sequence output connections of icons to data input connections and to sequence input connections of other icons to form at east one network of icons, a computer implemented method for processing said icons of said network to perform data processing functions represented by said icons, said computer implemented method for processing comprising the steps of:

(a) programmatically separating said icons into a list of connected icon threads comprising the steps of

(a1) selecting a first icon for a thread,

(a2) selecting all icons connected to data input connections or sequence input connections of said first icon for said thread,

(a3) repeating step (a2) for al icons selected in step (a2), and

(a4) repeating steps (a1) through (a3) if unselected icons remain in said network of icons;

(b) programmaticallyy creating a pending queue and a done stack for each of said threads;

(c) programmatically placing all start icons selected for each of said threads into said pending queue for said thread;

(d) selecting one of said threads for processing,

(e) if said pending queue of said selected thread is not empty, selecting a next icon from said pending queue and processing said icon comprising the steps of

(e1) if said icon is an iteration icon, placing all icons connected, directly or through at least one other icon, to data output connections of said icon into a virtual thread, blocking any further processing of said selected thread, placing said virtual thread onto said list of threads, selecting said virtual thread for processing, then continuing with step (e),

(e2) if said icon is a subprogram icon, placing all icons below said subprogram icon into a subthread blocking any further processing of said selected thread, pacing said subthread onto said list of threads, selecting said subthread for processing, then continuing with step (e),

(e3) if said next icon has a sequence input connection and said sequence input connection has received a signal from a sequence output connection of another icon, and each data input connection of said next icon has had data transferred to said data input connection from a data output connection of another icon, processing said next icon comprising the steps of

(e3a) programmatically executing any data processing functions defined for said next icon,

(e3b) transferring output data, created by programmatically executing said data processing functions defined for said next icon, to all icons connected to data output connections of said next icon, and

(e3c) programmatically placing all icons connected to said data output connections of said next icon into said pending queue for subsequent processing, and

(e4) if said next icon has no sequence input connection and each data input connection of said next icon has had data transferred to said data input connection from a data output connection of another icon, processing said next icon comprising the steps of

(e4a) programmatically executing any data processing functions defined for said next icon,

(e4b) transferring output data, created by programmatically executing said data processing functions defined for said next icon, to all icons connected to data output connections of said next icon, and

(e4c) programmatically placing al icons connected to said data output connections of said next icon into said pending queue for subsequent processing;

(e5) if said icon contains one or more data input connections that have not had data transferred thereto, programmatically placing all icons connected to said data input connections that have not had data transferred thereto on said pending queue of said selected thread,

(e6) if said icon contains a sequence input connection that has not received a signal, programmatically placing an icon connected to said sequence input connection into said pending queue of said selected thread, and

(e7) if said icon was processed by step (e3) or step (e4), placing said icon at a top location on said done stack of said selected thread;

(f) if said pending queue of said selected thread is empty and said done stack of said selected thread is not empty, processing said thread comprising the steps of

(f1) removing a top icon from a top location of said done stack of said selected thread,

(f2) programmatically sending a sequence signal to all icons connected to a sequence output connection of said top icon, and

(f3) programmatically placing all icons connected to said sequence output connection of said icon on said pending queue of said selected thread; and

(g) if said pending queue of said selected thread is empty and said done stack of said selected thread is empty, processing said thread comprising the steps of

(g1) if said selected thread is a virtual thread, removing said selected thread forms said list of threads and unblocking said thread containing said iteration icon from which said virtual thread was created hereby said thread containing said iteration icon is allowed to continue processing, and

(g2) if said thread is a subthread, unblockings said thread containing said subprogram icon that called said subthread and placing said subprogram icon on said done stack, whereby said thread containing said subthread icon is allowed to continue processing; and

(h) repeating steps (d) through (g) until all said pending queues and all said done stacks of all said threads are empty.

12. The process of claim 11 wherein step (c) further comprises the step of:

(c1) if a thread does not contain any start icons, placing all icons in said thread on said pending queue of said selected thread.

13. The process of claim 11 wherein step (c) further comprises the step of:

(c1) programmatically examining each of said threads and discontinuing processing if any thread contains one or more feedback loops, wherein a data output of a first icon connects directly or through at least one other icon to a data input of said first icon, but does not contain at least one start icon.