Method for dynamically linking definable program elements of an interactive data processing system
First Claim
1. A method in a computer implemented process for dynamically linking program elements of an interactive data processing system, that is capable of defining operations of the interactive data processing system by the program elements, comprising the steps of:
- a) generating and assigning, before run-time of a program that utilizes the program elements, a link header to each program element as a data block for storing chaining information,b) chaining, before the run-time of the program, a first execution code to the link header via the chaining information,c) if for any program element a respective first execution code is altered to a second execution code by operation of the interactive data processing system during the run-time of the program, regenerating the link header, replacing the respective first execution code with the generated second execution code, the regenerated link heater assigning the second execution code to the respective program element,d) when a program element is executed by operation of the data processing system during the run-time of the program, accessing a respective chained execution code via a respective assigned link header and executing the respective chained execution code.
1 Assignment
0 Petitions
Accused Products
Abstract
In contrast to previous methods, for example for LISP systems, a central function caller with its complex status inquiries is not required, since a data structure with a link header is provided, to which directly executable execution code is always chained. Depending on the type of function and depending on the respective status of a definition of the program element, it is possible to provide here as execution code an error interface for undefined functions, a simulator interface for functions to be simulated, an interpreter interface for functions to be interpreted or a compiled program section for already compiled functions. As a result of dispensing with the status inquiries, it is possible to achieve considerable acceleration of the program execution, in particular for LISP systems, in which a function call often occurs for usually only short function operations.
179 Citations
11 Claims
-
1. A method in a computer implemented process for dynamically linking program elements of an interactive data processing system, that is capable of defining operations of the interactive data processing system by the program elements, comprising the steps of:
-
a) generating and assigning, before run-time of a program that utilizes the program elements, a link header to each program element as a data block for storing chaining information, b) chaining, before the run-time of the program, a first execution code to the link header via the chaining information, c) if for any program element a respective first execution code is altered to a second execution code by operation of the interactive data processing system during the run-time of the program, regenerating the link header, replacing the respective first execution code with the generated second execution code, the regenerated link heater assigning the second execution code to the respective program element, d) when a program element is executed by operation of the data processing system during the run-time of the program, accessing a respective chained execution code via a respective assigned link header and executing the respective chained execution code. - View Dependent Claims (2, 3, 4, 5, 6, 7, 8, 9, 10, 11)
-
Specification