US2007113236A1PendingUtilityA1

Program flow method and method for expanding a program component system

45
Assignee: QUAST NORBERT WPriority: Jan 2, 1998Filed: Aug 8, 2006Published: May 17, 2007
Est. expiryJan 2, 2018(expired)· nominal 20-yr term from priority
Inventors:Norbert Quast
G06F 8/30
45
PatentIndex Score
0
Cited by
0
References
0
Claims

Abstract

A program flow method in a program component system, comprising a running time system and several components each having one program portion, the method comprising the following steps during the execution of the program portion of a first component: data acquisition by means of the running time system, of data of a second component into the first component independent of program-defined interfaces in the second component; and data disposal by means of the running time system of data of the first component into the second component independent of program-defined interfaces in the second component.

Claims

exact text as granted — not AI-modified
1 . A program flow method in a program component system, comprising a running time system and several components each having one program portion, said method comprising the following steps during the execution of the program portion of a first component: 
 a) data acquisition by means of the running time system, of data of a second component into said first component independent of program-defined interfaces in said second component; and    b) data disposal by means of the running time system, of data of said first component into said second component independent of program-defined interfaces in said second component.    
   
   
       2 . The method according to  claim 1 , characterized in that the data transmitted during the data acquisition are transferred from a memory image portion of said second component into a transfer data region of said first component, and/or that the data transmitted during the data disposal are transferred from a transfer data region of said first component into a memory image portion of said second component.  
   
   
       3 . The method according to  claim 1 , characterized in that said data acquisition and/or data disposal is carried out without the cooperation of said second component.  
   
   
       4 . The method according to  claim 1 , characterized in that said second component is inactive during said data acquisition and/or data disposal.  
   
   
       5 . The method according to  claim 1 , characterized in that said transfer data region of said second component is located in a saving region during said data acquisition and said data disposal.  
   
   
       6 . The method according to  claim 1 , characterized in that local and/or non-persistent data of said second component are transmitted during said data acquisition and/or said data disposal.  
   
   
       7 . The method according to  claim 1 , characterized in that during the execution of the program portion of said first component a waiting list is made indicating which of the data of said first component require data disposal.  
   
   
       8 . The method according to  claim 1 , characterized in that a called component can directly access an access data region comprising the data fields defined and/or available in said calling component.  
   
   
       9 . The method according to  claim 1 , characterized in that the call of a component is triggered by call information comprised in a docking point of the calling component.  
   
   
       10 . A method of expanding a program component system comprising several components, by one further component, said method comprising the steps of: 
 a) searching for docking points for said further component in said program component system, which docking points correspond to an inheritance parameter determined by a definition of said further component; and 
 b) modifying the components of the program component system where at least one docking point was found, by entering call information about the further component at each docking point found.  
   
   
   
       11 . The method according to  claim 10 , characterized in that all interaction interfaces of the previous components are predefined as potential docking points.  
   
   
       12 . The method according to  claim 10 , characterized in that all interaction screen fields referenced by the previous components and/or all print mask output fields and/or all access operations on persistent data are predefined as potential docking points.  
   
   
       13 . The method according to  claim 10 , characterized in that by entering said call information into a docking point a call of the further component from the component into which said call information was entered, is prepared.  
   
   
       14 . The method according to  13   claim 10 , characterized by an additional step of: 
 c) generating at least one binary object from the definition of the further component.    
   
   
       15 . The method according to  claim 14 , characterized in that a maximum of one binary object is generated for each docking point that has been found.  
   
   
       16 . The method according to  claim 15 , characterized in that while generating each binary object, the memory allocation is considered in the one component of the program component system which includes the underlying docking point.

Cited by (0)

No later patents cite this yet.

References (0)

No backward citations on record.