International Business Machines Corporation

Michael Thomas Wheatley

Alan Roeder Elderon

William Augustus Carter

Timothy David Magee

Grant Sutherland

Henry Y Saade

Mark David Nicholas

Timothy Edward Weinmann

Jeffrey Ramesh Urs

William Nicholas John Tindall

William Nicholas Tindall

John Alan Gerth

James A Brown

Daniel Edward House

Robert M Smith

Eric Lynn Porter

Robert Milton Smith

Stephen Sherman Miller

William D Wallace

Timothy William Osborn

Method of, system for, and computer program product for providing a central repository for information regarding run time library usage and a run time subsytem for using the run time libraries in accordance with the information contained in the central repository. The run time subsystem loads run time libraries when initialized and when requested to do by requests from application programs in accordance with the information contained in the central repository. The run time subsystem's use of the central repository provides improved application program performance, improved system utilization, and improved migration.

Method of, system for, and computer program product for providing a run time subsystem for run time libraries

A method, apparatus, and article for solving the year 2000 problem involves limited modifications in the data definition portions of the source code and compiler support for processing the modified source code. Fields in the source code that contain a year or date values are identified and, for each such field, the user selects an appropriate technique (for example, expansion, compression or windowing). The user modifies the data definition for each identified field, by adding new attributes to request the selected technique. The user then compiles the program and resolves any ambiguous references to the variables whose definitions were modified. This procedure is applied, module by module, and each processed module is merged into production, after testing, by using a compiler option to disable the use of the new attributes. A compiler option provides for the generation of debugger hooks for each statement that has been affected by modified declarations, which may be used with a suitably equipped debugger or other run-time analysis tool.

Compiler-assisted or interpreter-assisted windowing solution to the year 2000 problem for computer programs

Compiler-assisted or interpreter-assisted solution to the year 2000 problem with debugging option for computer programs

Compiler-assisted or interpreter-assisted compression solution to the year 2000 problem for computer programs

Compiler-assisted or interpreter-assisted solution to the year 2000 problem with flagging option for computer programs

Compiler-assisted or interpreter-assisted expansion solution to the year

Compiler-assisted solution to the year 2000 problem for computer programs

A method, apparatus, and article for solving the year 2000 problem involves limited modifications in the data definition portions of the source code and compiler or interpreter support for processing the modified source code. Fields in the source code that contain a year or date values are identified and, for each such field, the user selects an appropriate technique (for example, expansion, compression or windowing). The user modifies the data definition for each identified field, by adding new attributes to request the selected technique. The user then compiles or interprets the program and resolves any ambiguous references to the variables whose definitions were modified. This procedure is applied, module by module, and each processed module is merged into production, after testing, by using a compiler option to disable the use of the new attributes. A compiler or interpreter option provides for the generation of debugger hooks for each statement that has been affected by modified declarations, which may be used with a suitably equipped debugger or other run-time analysis tool.

Compiler-assisted or interpreter-assisted solution to the year 2000

Compiler-assisted or interpreter-assisted windowing solution to the year

Processing an event signifying a condition in a computer system is described. The computer system maintains an invocation stack which includes a plurality of stack frames. Such event processing operates by selecting a stack frame from the invocation stack, and then determining whether a user specified event processing procedure capable of processing the event has been registered with the selected stack frame. If a user specified event processing procedure has been so registered, then the event is processed using the user specified event processing procedure as specified by a set of rules and options defined for the disposition and/or processing of the specific event. Optionally, it is then determined whether a language specific event processing procedure capable of processing the event has been registered with the selected stack frame. If a language specific event processing procedure has been so registered, then the event is processed using the language specific event processing procedure as specified by a set of rules and options defined for the disposition and/or processing of the specific event. If an user specified event processing procedure capable of processing the event or a language specific event processing procedure capable of processing the event has not been registered with any stack frame of the invocation stack or have chosen not to terminate the event processing, then the event is processed using an applicable default event processing procedure.

System and method for managing control flow of computer programs

A multipurpose linkage protocol for procedural calls between compiled program objects permitting a calling program to call a single named entry point in another program at one of several different offsets each corresponding to a different linkage convention. This multipurpose linkage technique permits introduction of new program linkage conventions while retaining linkage compatibility With previously compiled program objects, without compromising either compatibility or the efficiency of the new convention. Every program object supporting this multipurpose linkage protocol may be entered at one of a set of defined offsets from any named entry point. Entry by the calling routine at a particular offset indicates a specific type of call, such as a normal entry by a call to a mainline routine. Thus, a supporting program object can be entered by earlier-compiled objects at the usual +0 Byte offset to handle the call accordingly or it can be entered at a different +16 Byte offset to handle the call according to a newer, more efficient linking procedure. The multipurpose linkage protocol of this invention is suitable for standardization across many high-level languages.

Multipurpose program object linkage protocol for upward compatibility

An APL environment includes the usual workspaces plus so-called packaged workspaces. The disclosed packaged workspaces are load modules created from saved workspaces. An active APL workspace can access a loaded copy of the packaged workspaces using external names of named objects in a packaged workspace rather than internal names of its own named objects. Program execution associated with the packaged workspaces is controlled through a copy of the packaged workspace name table stored in the active workspace accessing the read only packaged workspace. Access to packaged workspaces not only can be concatenated from other packaged workspaces, but also can be shared among a plurality of active workspaces.

Sharing of workspaces in interactive processing using workspace name

APL, an interpretive processor, cooperates with external routines by calling those external routines to process data passed to them and receives results from the external routines. The called external routines, during their respective execution of the call, can request internal services of the calling APL interpretive processor. Such requests include execution of internal APL functions or operators, calling other external routines, recursive execution of external routines, and setting or obtaining values of internal APL data items.

Message interface and method for recursive calling between interpretive

A method for executing external processes and for accessing external data from within an interactive language workspace. The workspace task referencing the external processes or data is synchronized and locked until the process is completed or the data referenced. The method steps provide establishing a message interface and utilize coercion of arguments in a dynamic environment. This permits, for instance, the invocation of a FORTRAN language process or from within an APL workspace and a return of information from said external processor without terminating the APL workspace.

Communication method between an interactive language processor workspace

Growing community of inventors

San Jose, CA, United States of America

Michael Thomas Wheatley