CA2025131A1 - Portable and dynamic distributed applications architecture - Google Patents

Portable and dynamic distributed applications architecture

Info

Publication number
CA2025131A1
CA2025131A1 CA002025131A CA2025131A CA2025131A1 CA 2025131 A1 CA2025131 A1 CA 2025131A1 CA 002025131 A CA002025131 A CA 002025131A CA 2025131 A CA2025131 A CA 2025131A CA 2025131 A1 CA2025131 A1 CA 2025131A1
Authority
CA
Canada
Prior art keywords
transaction
procedure
panel
application
entries
Prior art date
Legal status (The legal status is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the status listed.)
Abandoned
Application number
CA002025131A
Other languages
French (fr)
Inventor
John W. White
Current Assignee (The listed assignees may be inaccurate. Google has not performed a legal analysis and makes no representation or warranty as to the accuracy of the list.)
Sterling Software Inc
Original Assignee
John W. White
Texas Instruments Incorporated
Sterling Software, Inc.
Priority date (The priority date is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the date listed.)
Filing date
Publication date
Application filed by John W. White, Texas Instruments Incorporated, Sterling Software, Inc. filed Critical John W. White
Publication of CA2025131A1 publication Critical patent/CA2025131A1/en
Abandoned legal-status Critical Current

Links

Classifications

    • GPHYSICS
    • G06COMPUTING; CALCULATING OR COUNTING
    • G06FELECTRIC DIGITAL DATA PROCESSING
    • G06F8/00Arrangements for software engineering
    • G06F8/70Software maintenance or management
    • G06F8/71Version control; Configuration management
    • GPHYSICS
    • G06COMPUTING; CALCULATING OR COUNTING
    • G06FELECTRIC DIGITAL DATA PROCESSING
    • G06F8/00Arrangements for software engineering
    • G06F8/30Creation or generation of source code
    • G06F8/38Creation or generation of source code for implementing user interfaces
    • GPHYSICS
    • G06COMPUTING; CALCULATING OR COUNTING
    • G06FELECTRIC DIGITAL DATA PROCESSING
    • G06F9/00Arrangements for program control, e.g. control units
    • G06F9/06Arrangements for program control, e.g. control units using stored programs, i.e. using an internal store of processing equipment to receive or retain programs
    • G06F9/46Multiprogramming arrangements
    • GPHYSICS
    • G06COMPUTING; CALCULATING OR COUNTING
    • G06FELECTRIC DIGITAL DATA PROCESSING
    • G06F9/00Arrangements for program control, e.g. control units
    • G06F9/06Arrangements for program control, e.g. control units using stored programs, i.e. using an internal store of processing equipment to receive or retain programs
    • G06F9/46Multiprogramming arrangements
    • G06F9/466Transaction processing
    • GPHYSICS
    • G06COMPUTING; CALCULATING OR COUNTING
    • G06FELECTRIC DIGITAL DATA PROCESSING
    • G06F9/00Arrangements for program control, e.g. control units
    • G06F9/06Arrangements for program control, e.g. control units using stored programs, i.e. using an internal store of processing equipment to receive or retain programs
    • G06F9/46Multiprogramming arrangements
    • G06F9/54Interprogram communication
    • YGENERAL TAGGING OF NEW TECHNOLOGICAL DEVELOPMENTS; GENERAL TAGGING OF CROSS-SECTIONAL TECHNOLOGIES SPANNING OVER SEVERAL SECTIONS OF THE IPC; TECHNICAL SUBJECTS COVERED BY FORMER USPC CROSS-REFERENCE ART COLLECTIONS [XRACs] AND DIGESTS
    • Y10TECHNICAL SUBJECTS COVERED BY FORMER USPC
    • Y10STECHNICAL SUBJECTS COVERED BY FORMER USPC CROSS-REFERENCE ART COLLECTIONS [XRACs] AND DIGESTS
    • Y10S707/00Data processing: database and file management or data structures
    • Y10S707/953Organization of data
    • Y10S707/955Object-oriented
    • YGENERAL TAGGING OF NEW TECHNOLOGICAL DEVELOPMENTS; GENERAL TAGGING OF CROSS-SECTIONAL TECHNOLOGIES SPANNING OVER SEVERAL SECTIONS OF THE IPC; TECHNICAL SUBJECTS COVERED BY FORMER USPC CROSS-REFERENCE ART COLLECTIONS [XRACs] AND DIGESTS
    • Y10TECHNICAL SUBJECTS COVERED BY FORMER USPC
    • Y10STECHNICAL SUBJECTS COVERED BY FORMER USPC CROSS-REFERENCE ART COLLECTIONS [XRACs] AND DIGESTS
    • Y10S707/00Data processing: database and file management or data structures
    • Y10S707/953Organization of data
    • Y10S707/961Associative
    • YGENERAL TAGGING OF NEW TECHNOLOGICAL DEVELOPMENTS; GENERAL TAGGING OF CROSS-SECTIONAL TECHNOLOGIES SPANNING OVER SEVERAL SECTIONS OF THE IPC; TECHNICAL SUBJECTS COVERED BY FORMER USPC CROSS-REFERENCE ART COLLECTIONS [XRACs] AND DIGESTS
    • Y10TECHNICAL SUBJECTS COVERED BY FORMER USPC
    • Y10STECHNICAL SUBJECTS COVERED BY FORMER USPC CROSS-REFERENCE ART COLLECTIONS [XRACs] AND DIGESTS
    • Y10S707/00Data processing: database and file management or data structures
    • Y10S707/964Database arrangement
    • Y10S707/966Distributed
    • YGENERAL TAGGING OF NEW TECHNOLOGICAL DEVELOPMENTS; GENERAL TAGGING OF CROSS-SECTIONAL TECHNOLOGIES SPANNING OVER SEVERAL SECTIONS OF THE IPC; TECHNICAL SUBJECTS COVERED BY FORMER USPC CROSS-REFERENCE ART COLLECTIONS [XRACs] AND DIGESTS
    • Y10TECHNICAL SUBJECTS COVERED BY FORMER USPC
    • Y10STECHNICAL SUBJECTS COVERED BY FORMER USPC CROSS-REFERENCE ART COLLECTIONS [XRACs] AND DIGESTS
    • Y10S707/00Data processing: database and file management or data structures
    • Y10S707/99931Database or file accessing
    • YGENERAL TAGGING OF NEW TECHNOLOGICAL DEVELOPMENTS; GENERAL TAGGING OF CROSS-SECTIONAL TECHNOLOGIES SPANNING OVER SEVERAL SECTIONS OF THE IPC; TECHNICAL SUBJECTS COVERED BY FORMER USPC CROSS-REFERENCE ART COLLECTIONS [XRACs] AND DIGESTS
    • Y10TECHNICAL SUBJECTS COVERED BY FORMER USPC
    • Y10STECHNICAL SUBJECTS COVERED BY FORMER USPC CROSS-REFERENCE ART COLLECTIONS [XRACs] AND DIGESTS
    • Y10S707/00Data processing: database and file management or data structures
    • Y10S707/99931Database or file accessing
    • Y10S707/99933Query processing, i.e. searching
    • YGENERAL TAGGING OF NEW TECHNOLOGICAL DEVELOPMENTS; GENERAL TAGGING OF CROSS-SECTIONAL TECHNOLOGIES SPANNING OVER SEVERAL SECTIONS OF THE IPC; TECHNICAL SUBJECTS COVERED BY FORMER USPC CROSS-REFERENCE ART COLLECTIONS [XRACs] AND DIGESTS
    • Y10TECHNICAL SUBJECTS COVERED BY FORMER USPC
    • Y10STECHNICAL SUBJECTS COVERED BY FORMER USPC CROSS-REFERENCE ART COLLECTIONS [XRACs] AND DIGESTS
    • Y10S707/00Data processing: database and file management or data structures
    • Y10S707/99941Database schema or data structure
    • Y10S707/99942Manipulating data structure, e.g. compression, compaction, compilation
    • YGENERAL TAGGING OF NEW TECHNOLOGICAL DEVELOPMENTS; GENERAL TAGGING OF CROSS-SECTIONAL TECHNOLOGIES SPANNING OVER SEVERAL SECTIONS OF THE IPC; TECHNICAL SUBJECTS COVERED BY FORMER USPC CROSS-REFERENCE ART COLLECTIONS [XRACs] AND DIGESTS
    • Y10TECHNICAL SUBJECTS COVERED BY FORMER USPC
    • Y10STECHNICAL SUBJECTS COVERED BY FORMER USPC CROSS-REFERENCE ART COLLECTIONS [XRACs] AND DIGESTS
    • Y10S707/00Data processing: database and file management or data structures
    • Y10S707/99941Database schema or data structure
    • Y10S707/99943Generating database or data structure, e.g. via user interface
    • YGENERAL TAGGING OF NEW TECHNOLOGICAL DEVELOPMENTS; GENERAL TAGGING OF CROSS-SECTIONAL TECHNOLOGIES SPANNING OVER SEVERAL SECTIONS OF THE IPC; TECHNICAL SUBJECTS COVERED BY FORMER USPC CROSS-REFERENCE ART COLLECTIONS [XRACs] AND DIGESTS
    • Y10TECHNICAL SUBJECTS COVERED BY FORMER USPC
    • Y10STECHNICAL SUBJECTS COVERED BY FORMER USPC CROSS-REFERENCE ART COLLECTIONS [XRACs] AND DIGESTS
    • Y10S707/00Data processing: database and file management or data structures
    • Y10S707/99941Database schema or data structure
    • Y10S707/99944Object-oriented database structure
    • YGENERAL TAGGING OF NEW TECHNOLOGICAL DEVELOPMENTS; GENERAL TAGGING OF CROSS-SECTIONAL TECHNOLOGIES SPANNING OVER SEVERAL SECTIONS OF THE IPC; TECHNICAL SUBJECTS COVERED BY FORMER USPC CROSS-REFERENCE ART COLLECTIONS [XRACs] AND DIGESTS
    • Y10TECHNICAL SUBJECTS COVERED BY FORMER USPC
    • Y10STECHNICAL SUBJECTS COVERED BY FORMER USPC CROSS-REFERENCE ART COLLECTIONS [XRACs] AND DIGESTS
    • Y10S707/00Data processing: database and file management or data structures
    • Y10S707/99941Database schema or data structure
    • Y10S707/99944Object-oriented database structure
    • Y10S707/99945Object-oriented database structure processing

Abstract

ABSTRACT OF THE DISCLOSURE

A system and method is disclosed for enabling a plurality of computers and associated computer resources, some or all of which may be of heterogeneous configuration, to cooperatively process a variety of applications such that the execution is transparent to the user regardless of where the application is actually executing. This distributed applications architecture performs an information distri-bution service between multiple transaction processing systems by working with a transaction processor via communi-cation channels to other hosts within the network and a dialog manager (26) which uses a transaction processor interface (78) to communicate with the transaction processor. Additionally, the architecture employs a map service (36,40) to provide an editor to allow application programmers to create the maps (40) for the application panels, a compiler to generate the maps into linkable form, and a linkable interpreter which translates the linkable form into the screen presentation format for that platform.
Furthermore, to distribute an application, the source code for the procedures (32), views (38) and panels are moved as a block to the new system. This is possible because once the application source code is complete, all of the applica-tion logic, user interface control tables, view definitions, and other application-specific tables for one transaction definition are packaged by the present invention in a single load module on the system where the application will reside.
The load module is then compiled using the target system's compiler, link editor, and bind process. Thus, all environment-dependent variations of import/export, including network protocol, operating systems, processor types, etc., are automatically integrated with the application at load module bind time. Therefore, no source code changes are necessary.

Description

PORTABLE~ AND DYN~I:I:C DII:TRIBUTED APPLICATION ARC~ EC~ RE

BAC~:ROl~ND OF TI~E_IN~NTION
Field o~ the Invention This invention relates generally to computer software architectures, and more particularly to a system and method enabling a plurality of computers and associated computer resources, some or all of which may be heterogeneous in confi~uration, to cooperatively process a variety of applications such that the user sees the same image of the application no matter where the application is actually executing.

Desoxiptio~ o~ th~ R~late~ Art In today's processing environmen~, business applications may be de~igned and implemented to operate in either a tran~action mode or an inte~activ~ mod~. Tran~a~ion modo i~ normally used when implementing applications within an environment in which many usara are competing ~or limited resources. Interactive mode is most effectively used when resources can be dedicated to a user~ In either mode, sharing of processor, data base, and/or terminal resources is normally limite~ to a homogeneous set of processors, opera~ing sy~tem~, and/or transaction proce~sing monitors.

Application~ impl~mented u~ing the tran~action model t generally are structured as shown in Figur~ l. Each application load module includes logic for initialization, data import, data processing, data e~port, and termination.

Application logic is most frequently written in "C" or COBOL program languages. User interface (e.g., scxeen format) control tables are defined and packaged separately from the application's load module, although there is strong , : ~ :; . ~. :

. ........ :
,.:

, coupling between ~he user interface definition and the application's data processing logic. Working storage oontains data elements which are in a form directly usable by the application program.

Looking now at Figure 1, initialization logic 12 provides for opening data set~, connecting to any data bases needed for ~he particular instance of the application, and initializing working storage 10 to default values. Complex applications are implemented as dialogs consisting of several transaction execu~ions per unit of work. This implamentation mode is referred to as "conversational transactions" and requires that the ~tate of the conversa~ion be saved and re tored for each transaction execution. Conversa~ional transactions maintain the conversation ~tate in working storage 10. At initialization, working storage 10 is refreshed from a copy which was ~aved at the time the transaction last terminated (for a gi~en terminal).

Data import logic transforms an input data stream 22 ~rom a hardware-dependent representation into the data elements comprising working storage 10. The data stream 22 could originate from a (terminal) device or from another tran~aotion. In the case of devices, the application program logic 12 for data stream 22 decomposition is coupled with, and reflects, devic2 characteristics. In the case of data received from transactions, the application program logic 12 i8 coupled with the data represen~ation syntax and semantics of the sender.

Data processing logic 14 performs the computation and data manipulation ~or the application. Information is read from and written to system data base(s~ 18, data files, and/or other informa~ion sys~ems. ~pplica~ion-dependent integrity checks are performed. Queries are made of the ',:,. : . ' - . . ~ ': ' :~
,, ~ , . . . ..

.. I
:~ , ~7~
information systems and the responses placed in workiny storage.

Data export logic 16 transforms working storage 10 data elements into a hardware dependent representation. The destination for the ou~put data ~tream 24 can either be a device or a transaction. In the case of devices, the application program logic for data stream 24 formatting is coupled with, and reflect~, device characteristics. In the case of ~ata ~ransmi~ted to transactions, th data representation syn~ax and semantics o~ the data stream 24 must match the recaiver's appliaation logic.

Termination logic 16 include~ clo~ing data sats and committing any logical data base transactions which occurred during thi~ execution instance o~ the application. If this is a conversational transaction, the current application state (working storag~) is ~aved.

Th~ interacti~e model provides applications with dedicated re ources, including memory, data bases, files, and terminal. Implementation o~ conve:r~ational dialogs is easier than with t~e transaction model since the application state does not have to be explicitly sav~ed/restored on every interaction with a terminal. Communications with other processors is achieved through "remote procedure calls"
(RPC). RPCs are sometimes also used within the transaction model, or between lnteractive processe6 and transactions.
In any o~ these cases, an RPC require3 that the calling procedure ~with all of its resources~, the communications resource, and the called procedure (with all of its resources) be dedicated during ths time of thP call.
Furthermore, the calling procedure's resources (such as the terminal) can not, in general, be used by the called procedure. RPCs have the same characteristics as inter-transaction data transfers, namely that the data : .. ;

.. . ': . :
'~

~ ~ 2 r~

representation syntax and semantics of the data stream must be 6ynchronized between ~he client and server sides of an RPC.

There ~re however, many dif~iculties encountered with today's technology. For example, application source code is not portabl~. Muc~ of the application logic i8 dependent upon a particular transaction proae6sing monitor, operating sy~tem, data base management system, processor type, terminal device~, and/or other vari~ions in th~ softwars environment. A vexy high degree of homogeneity between so~tware environments is required to minimize the cost o~
porting applications from one en~ironment to another, Multiple sets of source co~e are raquired to support the variat~on~ in so~twara environment, with the attendant maintenance and function synchroni7ation problems.

As a ra~ult o~ the above, programmers mu~t ba trained to generate source code for each specific ~oftware environment.
Not only i8 this a wa~te o~ training resource~, but thi~
amounts to high costs in progra~mer time in generating source coda to enable an application to meet the p2aularities of each particular environment.

As indicated above, user interface control tables ~e.g., screen format6) are packaged ~eparately from applica~ion program logic. Thi6 results in synchronization problem~ at execut1on tim~. In mo6t case~, a ~yn~hroni~ed update to both user interface control tables and application program logio can not be per~ormed in real time. In order to avoid data integrity problem~, application updates require that the application is take~ offline and all pending input for the tran~action is flushed prior to installation.
Application logic is, nevert~eles , tightly coupled with specific device characteristics, reguiring application changes to support new user interface technology.

,- , . . .
; . . ,; ~ ~ .: , -: . -.,~ , .. .
.. . , :..... . : :
: -'' ' . ~
., 2~2~3~

Conversational transactions require explicit application program logic to save/restore working 3torage. The conversation state is maintained with respeck to a (terminal) device, not a user. If 2 user changes terminals, he can not resume the conversation which he started at the original device. A~y software modifications to a conversational ~ransac~ion which resultR in a redefinition or restructuring of the element~ in working storage can not be impleme~ted in real-time. In order to avoid data integrity problem , application update~ require that the applicatlon is taken offline and all saved worXing storage reinitialized prior to installation.

Inter-tran~action communications, including resource (e.g., transaction, terminal) sharing across distributed ystem~, is re~tricted to one instance of a single image transaction processing system, and al~o requires synchronized installation of communicating application transaction~. A synchronized update, across multiple 6y8tem~, can not be performed in real time. In order to avold data integrity proble~, applica~ion updates re~uire that all involved tran actions be taken offline and all pending communications be flushed prior to installation.

Curr~ntly available techni~uQs ~or cooperative proces~ing requir2 dedicated communications resources, dedicated processes, implementation 6pecific/complex program interf~ee~, and o~ten asymmetric logic between user and server. For these reasons, it is dif~icult to quickly implement cooperative processing for small applications.
Furthermore, some of the performance/cost objectives associated with a transaction model are compromised by excessive xesource onsumption as~ociated with direct inter application communication.

. .. .

-~, . ' '', :

F~ , ., ~
2 ~2~
Implementation of business applications in interactive mode is not generally appropriate for high volume applications due to the lack of flexibility in the administration/con~rol of computer resources, in addition to the inability to modify ac~ive, distributed applications in real time.

~RY OE' ~ INVENq!ION

In view of the above problems associated with the related art, it i8 an object o~ the present invention to pxovide a system and method of computer software architecture for enabling a plurality of computers, and associated computer resources, some or all of which may be heterogenous in configuration, to cooperatively process applications, inaluding applications built from a single application source base.

Another object of the present inve~tion i9 to provide improvement in application programm~r productivity by limiting program logic to the processing logic; speGifically isolating it from data import and data e~port logic.
Because thi~ logic i8 built into the co~mon execution code u6ed by all applications, there is a s:Lgnificant reduction în need for specialized application log:ic for menus, help, and cooperativs proce~Eing functions as well aR message handling functions. As a re6ult, a program~er need only be trained for the single unified sy6tem execution and development enviro~ments. Furthermore, the program~er may quickly generate applications which can be distributed acro~s multiple h~terogeneous computer 5y6tem8 without requirlng souras cod~ ch nges and enable modifications to an application to be implement~d with one load module, one documentation set, and one data base bind.

Yet another object of the present invention is to ,, , r '" ' 2 ~ 2 ~
provide improvemen~ in u~er produc~ivi~y by furnishing uniform help and menu ~unctions between applications, a~ording users with menu, help and glossary access to functions from every application panel, and requiring users to ramember fewer transaction codes.

A ~urther ob~ect of ~he present in~ention is to provide lower system maintenance costs and improved system parformance by enabling multiple functions to be accompli~hed in one reentrant package, enabling reduction of system de~inition resources required by each application, providing re~ource sharing acro~s multiple heterogeneous computer systems, enabling control of resource utilization, requiring management of fewer transactions and external screens, enabling users to access applications on any heterogeneous system without being aware where the application is being run (a.g., the system running the application is transparent to the user), providing common applicatlon exacution environment ~or a variaty of platforms including mainframes, minicomputers, and workstations, a6 well as providing application scala~ility to meet a user's processing requirements.

Yet a further object of the present invention provides improved application quality control and maintenance by providing common application execution and development environment for a variety of platforms, providing real-time application upgrades, reducing development costs by enabling development of application on low cost platform for installation on different higher cost platforms, acces~ing and maintaining application components in a synchronized fashio, enabling applications to be tested as a large integrated application set before deployment, and simplifying deployment of applications by reducing the number of load modules and system definitions required to install those load modules.

~ . .:. ;
, ~ ' ;- . ' :
... .
: ~, .

. , :
. ,' ~' ' ~ ,~

The6e object~ are accomplished in a preferred embodiment of the present invention ~nown as Distributed Applications Architecture (hereinafter referred to as "DAA"). The DAA
can be ins~alled on a variety of platforms including mainframe computers, minicomputers, and individual workstations. once DA~ is installed, along with its required suppor~ subsystems, services and utilities, then DAA generated applications may be accessed from any of these platforms. The support subsystems may be customized from products readily available in the market place.

DAA works with a transaction proces60r via communication channels to the other hosts withtn the network. It also employ~ a map service. The map servlce should provid~ an editor to allow appl$cation programmers to create the maps for the application panels, a compiler to generate maps into a linkable form, and a linkable interpretor which translates the linkable form into the 6cr~en pre~entation format for that platform.

Additionally/ as seen in Figure 2, i~ the pre~erred e~bodiment of the presen~ invention, the DA~ employs a DBMS
18 tData Bas~ ~anagement System) which uses a standard form SAA SQL 20 to support application code DB~S functions and to save u~er/application profile information. It should be noted ~hat more than one DBMS could be used; for example, ons to support applioation functions and one to eave profile information. Furthermore while a DBMS not using the standard form S~A SQL could be used, it æhould be realized that the embedded applioation DBMS code should be source compatible on the various platforms.

Looking in more detail at Figure 2, each application transaction consists of the Information EnginPering Task (IET) 26, application program logic 32 and working storage 10 .

.. :, . : . ;

' ' " ~

'"'''.' , .
;: ' '' ' ~

The hardware-specific input data stream 22 consists of the information input to the application. Information included is: data, hardware type of the input devic~, and characteristics of the output expected.

The IET 26 processes the input data stream 22 to prepare it for the application program logic ~2. The setup decomposes the data stream 22 by converting the characters input to the application to its native data type for application program use. The application program 32 tell6 the IET 26 which data sets will need to be acces~ed. The IET 26 receives routing information from the terminal device characteristics and routing information table 30 via communication route 28, and 'opens' those data ~ets.

The main storage logic 10 performs the computation and data manipulation for the application. Application program logic 32 pulls information from, and stores information on, data base~( 6) 18 in the syste~ using a preselected subset of Structured Query Language (SQL) commands 20 although other language~ could be employed. When the computation and manipulation are completed, the IET 26 begins its cleanup.

The IET cleanup consists o~ two steE~s. First, composing the data generated from the application 32 into a format s~t by the progra~mer. The information is sent out as the output data ~tream ~4. Second, 'closing' data sets which had been opened ~or use by the application~

All of the application logic, user interface control table~, view de~initions, and other application-specific tables for one transaction definition are packaged in a single load module.

. . . ;. :. ,: .: :, :: , ,:: ',, ,,,:, ... , . , : ~

The DAA Application load module, shown in Figure 3, includes all th~ components neces~ary for a user to invoke a DAA application through DAA from a terminal on any other DAA
system. The components in thi module control routing of information, accessing data bases on different sy~tems if neressary, cleanin~ up da~a sat~ when the application is finished, and pres~nting the information when complete. The load module also i~clude~ references to HELP, INFOrmation, and GLOS~ary in~ormation stored on the sy~tem.

The DAA Tran~action Definition Table (TDT) 34 defines all th~ elements of a DAA load module and i8 provided by th~

The IET interface 26 is a loglc element also provided by the DAA. The IET intQr~aaQ merges the information stored in th~ views 38 with the panel~ ~0 designed by the programmer to form the application data 6tructure.

The Terminal Mapping Sy~tem (TMS) 34 is another logic element of the DAA. The rMS 34 is provided by the DAA and take~ the data stream input to the DAA and converts it into I~M 3270 ~ormat data streams.

Views 3~ ar~ ~e~igned by the progr'ammer to defln~ the types of variables used by ths application. The view 38 tells ~he I~T in~er~ace what ~orma~ the proc~dure 32 needs the data in. The IET interface 26 converts the input data stream to match that form~t. A~ter data is proces6ad by the procedures 32 also, IET 26 converts the information stored in th~ views 38 to the format for the output data stream, or to the format specified for other procedures 32. The views 38 allow data to pass locally between procedures 32 on the system the user is logged onto and remotely to procedures on other DAA systems.

', ' . ~

2 ~

Panel~, or screenq 40 for th~ application are built from programming definitions using a screen painter and a special compiler. Panels 40 developed in thiC way are transferrable across all systems at the source code level.

Menus 42 are special screens used to guide the application user through the prooedure~ for an application, are defined by the programmer, and are expandable in source form.

Once the application source code i~ complete, all programmer deeigned blocks shown in figure 3 are built into one load module by the DAA so~tware on the system where the application will reside. To move (or distribute) an application, the source code ~or the procedures 32, views 38, and panels 40 are moved as a block to the new system.
Th~ load ~odule is compiled ucing the target system's compiler, link editor, and bind process. No source code changes are neceasary.

No matter how complex the application, all appliaation components of a load module are automatically in synchronization and conse~uently can be installed in real-timQ~ Application-independent DAA logic and control table~ are implemen~ed as dynamically loadable libraries.
DAA upgrades are automatically re~lected in application load modules, ~nsuring synchronization of DAA functions across all application load modules. ~dditionally, this makes the application easier to distribute, and require~ the application u~er to remember ~ewer transaction codes.

Application procedures contain no code related to either data import or data export~ Application procedures are restricted to perform computation and data manipulation using data elements defined in working storage and .:. .
:: : i. . .: . ~ :, :: :::.. , : :.
:: : : . ,.. ,, ,:

f~
~ ~ 2 ~ L ~ ~_ optionally an interface to some in~ormation system. An information sys~em suppor~ed by D~A is relational data base access via a well defined subset of Struotured Query Language (SQL) command~. Other information sy~tems csuld be employed by the application.

Data import/expor~ functions are completely isolated from any application procedure. All environm~nt-dependent variations of import/export, including network protocol, d vice char2cteristics, tr2nsaction proces~ing monitor, operating system , processor types, etc., are automatically integrated with the application at load module bind time.
Import/export functions are driven from implementor-defined views and user interface control tables~ User interface control table~ describe the characteristics of the user interface, and how elements of working storage map to/from the user interface. ~Import" and '~export" views describe elements of working storage which are to be communicated between transaction~. "Profile" view~ are used to de~cribe element~ of working storage which are to b~ saved/restored at initiation/termination time ~or each transaction execution.

At exQcution timQ~ a view de~inition i~ usQd to encode or deoode an information packet to/from working storage.
Each element of working storage, which is æelected by the view definition, i~ encoded into an identifier/value pair in the in~ormation packet. The identifier uniquely identifies, across all application versions of worXing storage, a particular elemen~, independent o~ the element's location or length in worXing storage. At any time during the life cycla o~ an application, a programmer may change the location and/or length of elements in working storage, rebuild a new version of the the application load module, and productionize the new load module. When a view is decoded from the information packet back to woxking storage, .

.

..
.: ............ ..
, . ' ' , '.

, - .

the element value is stored in the location/length defined by the application at the time of execution ~i.e., not at the tim~ of information packet creation).

These charactaristics o~ view management significantly reduce the pos~ibility for data integrity problem~
introduced by modifying appliaation load modules in real time. The curre~t state (profile3 can be succe6s~ully reRtored to an application which modified its worXing storage layout. Application load ~odules which communlcat~
with each other can b~ modified a~ynchronou~ly, in real time, acro~ heterogeneous environmenta, including chang~s to the import/export view and working torage layout.

To better under~tand the present in~en ion and the relationship of its component parts in the dev~lopment environment, ref~r now to Figure 5. Although th~ compon~nts sean ther~ will be dlscussed in great detail later, a working understanding of their relationship with the hardware involv~d is necessary.

A user may input data or invo:ke an application at terminal 5~. Terminal 58 direc~s such input to communications proce~sor 62 via co~munication6 line ~o.
Communicakion~ proc~s~or 62 rout~a the input to central processing unit 6S (CPU) via hookup line 64. At this point the CPU 66 addre~se~ computer memory 70 via bu~ 68. Within computer memory re~ides ~h~ ganeral transac~ion d~inition tool 72 (GTD), connect~d to transaction definition table 36 (TDT3. The TDT overhead 36 points to specific locations in memory 70 for maps (panel~) 40, views 38, ~nd procedure logic 32. Application procedure logic 'n turn communicates through disk interface or data base management system 74, residing on operating sy~tem 76, to sour~e object data sets on disk 18 via SAA SQL commands 20.

, ~ . . ,., , . . - ~
. . - . ~ . ,........ :

~ 3 In the execution ~nvironmen~ of the pr~erred embodiment of the present invention, turning now to Figure 6, a user invokes an application at terminal s8. Terminal 58 directs the request along communication line 60 to communication processor 62. Processor 62 in turn forwards the invocation to CPU66 via hookup line 640 At this point the CPU 66 addresses computer memory 70 via bus 68. Within computer memory resides the ~ransac~ion definition table 36 (TDT), the information engineering task 2~ (IET), and transaction processing 6ubsystem interface 78. TDT 36 points to specific locations in memory 70 for maps (panels) 40, vlew~
38, and procedure logic 32. IET 26 employ~ tran~aot~ on proces~ing ~ubsyatem intarfac~ 78, to intorfac~ with out~ide 3y8t~m~. In proc~sing the application, it work~ with DBMS
interface 74, which reside~ on opsrating system 76, to ac~ss a data ba~ on ~isk 1~ via SQL ~ommands 20. hik~wide IET 26 maintain~ itB ROLLFILE 80 via S~L co~mands 82 to ~OLLFI~E databa3Q management syst~m 8 4 .

Transaction and t~rminal r~ouraa3 are directly accessible from only one (single-image) transaction proce~sing system. DAA implements an information distxibution ~ervice between multiple transaction processing systems. The distribution service providcs for the distribut~on of information packets, with guaranteed delivery, as well as the di~positioning of these information pac~et~. Dispositioning typically utilizes transaction processing sy6tem facilities in order to forward the information packet to an application transaction or (terminal) device. Information packets destined for devices may be modified in order to conform with the device characteristics which are present at time of dispositioning, thus accomodating dynamic changes to device confi~lrations.
Isolatinn of data import/export functions from application proc~dural logic enables applications to transparQntly : . :: - :

, ~2;~ SJ~ ~

utilizQ thi6 DA~ distribution service ~acility in order to share resources (e.g., transactions, terminals) across distributed systems in heterogeneous software environments.

More specifically, the In~ormation Engineeri~g TasX
(IET) is an exec~table DAA procedure that receives control whenever an application program i3 executed and provides a number of devices to the application program which i~olate ik from the hardware and so~tware environment in which the application runs. It communicates panels, views, and information between the user, user profile, application procadure and remote DAA application procedures. Thus the services it performs include panel input/output proces6ing, managing user documentation requirements, providing menu navigation, and handling cooperative processing interfaces ~or the application, a~ woll as required DBMS setup, application synchronization and cleanup.

The IET uses a Transaction Definition Table ~TDT, de~crlbed below), and compiled vie.w ob~ect~ generated aut~matically by Generate Transaction Definition (GTD, described below) fro~ the Transaction ~e~inition File (TDF, described bQlow) to corr~late information to be communicated to the u~er, u~er pro~ile, application procedures and DAA
remote procQdures. Thl~ information i~ stored ln the tran~action vlew data area and i8 the ma;or inter~ace between the applica~ion and ~he IET. The tran~action view i~ initialized ~rom the input screen and profile view when performing panel input/ou~put processing ~nd initialization o~ the transa~tion view from the input/oukput/inter~ace view8 and pro~ile views when performing cooperativs processing.

The i~olation khat the IET provides enables the applicakion procedure to contain primarily application specific logic. The languages (primary and DBMS) used in . ~

r ~~
2~2~3 application procedures are written in languages which are implemented con~i~tently acros6 all D~A platforms so as to en~ure application poxtability.

Prior to having DAA, and specifically, the transaction driver program, IET, a programmer did not require a table of pointer~ to hi~ maps and procedures. Each transaction would have unique program logic con~aining the necessary decisions to explicitly call the proper procedures to process appropriate input from a user and to use various screen maps for output as required. This meant the programmer was required to provide code to handle all the possible dialog flow~, and screen input/output.

In DAA, the IET module provides the dialog flow management and handles all the screen input/output including help documenkation and glos6ary reque~t. The programmer under DAA is only required to handle input and output variables from/to screen map6 and remote procadure~.

~ ince IET iB a fixed program module that i~ co~mon to all DAA kran~ctions, it i8 not po~siblla for embQdded logic to call th~ appropriate u~er procedure and to use its uniqua screen maps. Thi~ problem require~ that all information u~ed to drive the application screens and procedure~ be contained in a separate linkable tablls. Thi~ table mu~t have 6ufficient information to allow IET to choose the approprlate screen maps, call appropriate procedures bePore and a~ter screen input/output, save and reOEtore appropriate program variables (view6), restart a transaction at the last Xno~n state and provide appropriate linkage to remote DAA
transaction procedures. Thi~ table is known as the Transaction Definition Table (TDT) and is created by the DAA
development tool, GTD, based on transaction de~inition information provided by the developer, or application programmer, and stored in the Transaction Definition File . - . . - . ~

, ,,: ;. :

;

~ 3 (TDF).

The TDT is a table of names, pointers, and control in~ormation required by the IET module a~ run time to properly communicate panels~ view~ and information between the uger, link-edited procedure and remot~ DAA procedures.
The TDT is ~imply the anchor of information that allows IET
to control execution flow. The TDT i8 congtructed 60 that the developer's procedure code is unaw~re of the ~D~'s existence and ~rees the developer ~rom writing his own code to correlate inpu~/output application panel~, help panels, glos~ary panels, a~ well as saving and restoring pertinent program variable~ (view~) across multiple execution~ o~ a transaction for any given user.

The TDT consists of a variety of information such as application identification, version number, last tran~action build date, he:Lp documentation file name, number of documentation lanugages 6upported, a pointer to first documentation language table entry, and a SQL support procedure entry point addresse~ for such functions as Connect, Co~mit, and Release. Map and procedure tables as well as ~enu and documentation language table entries also comprise part o~ the TDT.

E~ch o~ the map tables for application, menus, help, information and glos~ary panels contains such information as panel name, TMS screen map poin~er, intpu /output procedure pointars, numb~r o~ as~ociat~d menu entri~, and pointer to first assoaiatQd menu entry. Each o~ ~he proc~durQ table~
contains such data as procedure nam~, procedure entry-point address, intput~output/profile view table pointer~, and SQL
DB u e flag. Each of the menu table entries contains such in~ormation as menu select code, panel entry pointer, panel procedure entry-point address, and displayable menu description string. Each of the docu~entation language ~, .
.
, . :: ~

, .; , : ,:

:: .
: ' ~ ', :
:, ::
.. : ,, . :

2 ~ .L 3 ~
table entries contains such specific~ as documentation lan~uage name and documentation file name.

The Tran~action Definition File (TDF) i~ a ~le of record6 u~ed by GTD as the ~blueprint" for constructing a DAA transaction. This TDF i8 an integral part of GTD
because i~ contains all the information necessary to compile and link all t~e correct components of a given DAA
transaction. The programmer simply use~ GTD's menus and screens to add and delete thP appropriate component~ and GTD
files this information into the ~DF.

Therefore, the content of thQ TDF i8 created and maintained by the developer using the GTD tool. The TDF is used by ~T~ to ~s6isk the programmer in the edit o~ his procedure code, panel maps, and menu~. Once these component~ have been edited, the T~F 1~ used by GTD to compile and crea~e variouC object modules that are link-edited along with the IET to produce a transaction load module.
~ . .
The TDF consist~ of a variety of types of records such as header, panel, menu, and procedure. The haader typically contains a list of source, object, load and map libraries along with pertinent name~, such as application and tran~action view names. Each panel $s a record containing panel name and input/output proces~ing procedure names.
Each menu screen is a record containing menu name, menu panel name, input/output proces6ing procedure names and displayable description string. Each procedure definition i8 a record contalning procedure name, input/output/profile view file~ names, and language type.

The Generate Transaction Definition (GTD) never requires a programmer to build files containing instructions on compiling and linking the correct parts, because th~ GTD

.

' ' ;' ` ' ~' : : ,, ' ~ ~ ' . ' , : `
,. ,; ' ' 2 0 2 ~

builds and maintains the TDF. Furthermore, the GTD provides for developmen~ of application~ that execute under control of the IET.

Moxe specifi ally, GTD i~ a menu driven usar interface that is intended ~o be uniform across all D~A plat~orms providing the application developer with 6tructured application develop~en~ ~uch as definition, creation/edit, con~txu~tion, application transger ~eaturee and various utilities nece66ary for development ln an environment with multiple heterogeneous development and execution hosts.
Application programmerg defina application components and their interrelationships by using de~inition ~craen~ within GTD. They include procedure code~ panel maps, menus, program data view~ and documentation. This information is ~tored in the TDF and later u~ed by GTD when acceesing any of the componentæ ~or m~dification or for D~A application construction~ The develop2r uses GTD to edit the application souroe components and to construct the executable application load mcdule.

During construction, GTD uses the TDF and the application deflned pro~ram data vi~!ws to create ob~ect module~ which are used by IET in order to perfor~ its services for the application program. WhenevQr a GTD
application is constructed, GTD en~ures that all objects created ar~ up to date with the source files so that the appli ation will always be synchronized.

eTD provide~ for development of applicatisns that execute under control of the IE~ through the user interface, and perorms background functions at each ~tage of the application development. The~e stages can be defined as definition, composition, construction and deployment.
During definition GTD requires the user ~o define all o~ the components of the application, their physical storage : , , ~ . :
: , : :
`` :

' ' ,'; , '' ': ' ,: :, ,,: , : .,:

~:' : :
: . . -.

location, their interrelationships, and any additional attributes or information. The definition information is stored in the TDF. ~uring the composition phase GTD
provides the application developer with menu access to each of the components listed in the TDF and provides generators and editors for each of these components.

During cons~ruction, GTD retrieves the information in the TDF and generates the TD~ and view module which are used by the ~ET module at run time. GTD then compiles each of the components listed in the TD~ using the appropriate compiler for each type of component in a predefined order by type. These types include the TDT and view modules GTD
generates, menus and panel maps and procedure code. GTD
provide~ the application developer with construction alternative~. Components may be con~tructed conditionally or unconditionally based on date and time information which is updated each time a source component is modified during the composition phase or when an output object is created or replaced during construction. When performing conditional construction GTD checks the date and time on each source component and each output object. When the ~ource component ha~ a later date than the output object, GTD reconstructs the output object. Conditional and unconditional construction method approaches ensure the synchronization and consistency of the load module when construction is performed on all components in the TDF. To complete con truction ~TD binds all of the load module components together into a load module using a linkage editor and in~t~lls the load module in the location referr~d to by the TDF.

During the deploymant phase GTD providRs the capability to transfex all, or selected, application components from one machine to another. The application developer identifies the target machine, the physical location on the ;- : :, .

~ 3 target machine where the TDF file could be located, and the componen~s to ~rans~er. This transfer process accesses the components listed in the TDF and transfers them to an appropriate location on the target machine extrapolated from the target machine TDF file location. The transfer is accomplished using an available file transfer communications program between the source and target machine6. ~ part o~
the transfer process all textual data is translated to the targ t machine forma~ and the physical locationa and name~
in the TDF are changed to conform to the target machine conventions.

These and other ~eatures and advantages of the invention will be apparent to ~hose skilled in the art ~rom the following detailed deQcription of a preferred e~bodiment, t~ken together with the accompanying drawings, in which:

DE~CRIP~ION OF ~HB DRA~INGB
FIG. 1 is a block diagram depicting current program application development without the pxe~ent invention;
FIG. 2 i~ a block diagram depict.Lng program application development according to an embodimenk o~ th~ present invention;
FIG. 3 i a block diagram of a sample load module according to the pr~sent invention;
FIG. 4 is a graphical repre~entation of internal configuration of a transaction definition table (TDT~, according to the present invention;
FIG. 5 is a block diagram demonstrating the development environ~ent according to the present invention;
FIG. 6 is a block diagram depicting the axecution environment according to the present invention î
FIG. 7 is a graphical repre~entation o~ application portability due to the implementation of the depicting cooperative processing;
FIG. 8 is a block di.agram of a heterogensous environment ..' : :

:, :
: :

showing distributed resource intercommunications supported by the present invention;
FIG. 9 is a block diagram o~ tran~action concepts according to ~he pre~erred embodiment of the present invention;
FIG. 10 is a block dlagram depicting DAA procedure execution and pro~ile view according to the present invention;
FIG. 11 i~ a block diagram depicting an user int~rface sc~nario according ~o the present inventicn;
FIG. 12 is a block diagram showing possible navigation route~ from session to session, for a typical dialog according to the presenk invention;
FIGo 13 ie a block diagram showing po~sible navigation routes from transaction to transaction, ~or a typical dialog according to the pre~ent invention;
FIG. 14 is a block diagram showing possible navigation routes from panel to panel, for a typical dialog according to the present invention;
Fl&. 15 iB a block diagram depicting an example of DAA
dialog ~low, according to the pre~erred embodiment of the present invention, combining consi~tent user interface definition~ with programmable dialog flow commands;
FIG. 16 is a block diagram depictiny remote procedure execution/data flow, according to the pre~ent invention;
FIG. 17 is a block diagram showing the inter-relationships between various component6 used to implement distributed re~ourcs control accord~ng to the preferr~d e~bodiment of the present invention;
FIG. 18 is a block diagram demonstrating the logical flow of control and data assocated with the LINK/RE~URN
imple~entation between transaations according to the pr~ferred embodiment of the present invention;
FIG. 19 is a block diagram depicting the logical flow of control and data associated with data interchange between terminals and transactions according to the preferred , : ": , , . . : .

.. .

: . . , embodimen~ o~ the present invenkion;
FIGs. 20a-f are a flowchart detailing the functions performed by the ~T~ at the highest m nu level, according to the preferred embodiment of the present invention;
FIG. 21 is a flowchart depicting the procedure display procedure according to the preferred embodiment of the present invention:
FIGs. 22a-b are a flowchart depicting the FE procedure which checks for an user-inputted end indicator for GTD
panel functions according ~o the preferred embodiment of the present invention;
FIG6. 23a-c are a flowchart depicting the edit transaction parameters (ET) procedure according to ~he preferred embodiment of the pre~ent invention;
FIGs. 24a-r are a flowchart depicting the GTD get TDF
(GTDT) procedure according to the preferred embodiment of the pre~ent inv~ntion;
FIGs. 25a-b are a flowchart depicting the GTD read TDF
record (TDTGET) procedure according to the preferred embodiment of the present invention7 FIG6. 26a-e are a flowchart depicting the generate transaction view (GTVW) procedura according to the preferred e~bodiment of tha present invention;
FIG. 27 is a flowchart depicting the edit tran~action parametQrs (ETP) procedure according to the preferred embcdiment of the present inve~tion;
FIG6. 28a-f are a flowchart depicting the edit panal li8t (EP~ procedure according to the preferred embodiment of the pre~ent invention;
FIG. 29 is a flowchart depictiny the edit panel (EPE) procedure according to the pr~erred e~bodiment of the present invention;
FIGs, 30a-f are a flowchart depicting the edit procedure list (EC) procedure according to the preferred embodiment of the present invention;
FIG. 31 i~ a flowchart depicting the add procedure user ;.` .

: ; :: ' ' `. :
`: ~'` ~ :' : . :
.; :, ,`. : :
.: ~; ,' : `
,; :

2 ~ 2 .~
interface (ECA) procedure according to the pre~erred embodiment of khe present invention;
FIGs. 32a-b are a flowchart depictiny the change procedure entry (ECC) procedure according to the preferred embodiment o~ the present invention:
FIG. 33 is a flowchart depicting the edit filename (DO-EDIT) procedure according to the preferred embodiment of the present invention:
FIGs. 34a-b are a flowchart depicting the edit procedure (~CE) procedure according to the preferre~ embodiment of the present invention;
FIGs. 35a-c are a ~lowchart depicting the generate COBOL
program (GCOBPROG) procedure according to the pre~erred embodiment of the pre~ent invention;
FIGs. 36a-c are a flowchart depicting the generate C
program (GCPROG~ procedure according to the preferred embodiment of the present invention;
FIGs. 37a-d arQ a flowchart depicting the edit menu list (EM) procedure according to the preferred em~odiment of the present invention;
FIG. 38 iB a flowchart depict:ing the prepare menu d~splay (EMS) procedura according to the preferred embodiment of the present invention;
FIG. 39 i~ a flowchart depict:ing the edit menu list (2MX) procedure according to the preferred embodiment of the present inventlon;
FIGsO 4Oa-f are a flowchart depicting the edit language list (EL) procedure according to the preferred e~bodiment of the preRent invention:
FIG. 41 [omitted];
FIGs. 42a-d are a flowchart depicting the put TDF (PTDT) procedur~ according to the prerQrred e~bodiment o~ the pre~ent invention;
FIGs. 43a-b are a ~lowchart depicting the write TDF
record (TDTPUT) procedure according to the preferred embodiment of the present invention;

.
,~.

.:

2~2~

FIGs. 44a-b are a flowchart depicting the generate transaction/vlew, COBOL/C program (GC) procedure according t~ the preferred embodiment of the present invention;
FIG. 45 is a flowchart depicting the generate COBOL
procedure user interface (GCOBP) procedure according to the preferred embodiment of the present invention;
FIG. 46 is a flowchart depicting the generate C
procadure user interface (GCP) procedure according to the preferred embodiment of the present invention;
FIGs. 47a-f are a flowchart depicting the generate maps user interface (GM) procedure according to the preferred embodiment o~ the presen~ invention;
FIGs. 48a-d are a flowchart depicting the generate menu panel (~PM~ procedure according ~o the preferred embodiment of the present invention;
FIG. 49 is a flowchart depicting the generate skeleton panel user interface (GSP) procedure according to the preferred embodiment of the present ~nvention;
FIGs. 50a-j are a flowchart depicting the compile transaction definition/Yiews~panels/procedures (CTREQ) procedure according to the preferred embodiment of the present invention;
FIGs. 51arr are a flowchart depicting the compile transaction definition (CT) procedure according to the preferrad embodiment of the pre~ent invant~on;
FIG~. 52~-b ar~ a ~lowchart depicting the add view namo to tabl~ (TVA) procedure according to tha preferred e~od~ment of thQ present invontion;
FIG. 53 i~ a flowchart depicting the write bu~er to file (WTS) prooedure according to the pre~erred ~bodiment of the present invention;
FIGs. 54a-mm are a flowchart depicting the compile view (CV) proaedure according to the preferred embodiment of the present invention;
FIG. 55 is a flowchart depicting the compile panels (CP) procedure according to the preferred embodiment of the - . I

present invention;
FIGs. 56a-c are a flowchart depicting the lower level compil~ panels (CP0) procedure according to the preferred embodiment of the present invention;
FIG~. 57a-d are a flowchart depicting the compile (CC) procedure according to the preferred embodiment of the present invention;
FIGs. 58a-j are a flowchart depicting the compile C
program (CC0) procedure according to the preferred embodiment of the present invention;
FIGs. 59a-c are a flowchart depicting the compile COBOL
program (CCOB0) procedure according to the preferred embodiment of the present invention:
FIGs. 60a-~ are a flowchart depicting the bind transaction (BT) procedure according to the preferred embodiment of the present invention;
FIG. 61 is a ~lowchart depicting the file transfer panel~/procedures/views/documentation (FT) procedure according to the preferred embodiment of the present invention; and FIGs. 62a-bb arq a flowchart depicting the information engineering task aspect of the preferred embodiment o the present in~ention.

,: : . , , :; ' ::

~2~

DETAI~D D~BCRIP~ION O~ ~ PRB~BRR~D EMBODT~EN~

In the evolving world of di3tributed computing systems, it is necessary ~hat the application~ be supported with a strategy consistent with the environment in whioh the applications operate. These distributed networks are composed of systems tcomputers) connected with communication~ facilities o~ various types, including wide area network~, local area networks, and bua architectures.
The~e 8y8tem8 suppor~ local data bases and distributed data bases that allow synchronized maintenance of information between multiple computer systems.

In most genaral ca~e, the present invention proYides the capability to develop interrelated applications and put these application~ into service on multiple heterogeneous proces~or~ conn~cked with heterogeneous co~unications ~acilities utiliz~ng heterogeneous data hases. Currently the ~OBOL and C languages are being ~upported. It should be understood however, that other lanyuages could be used in applications lnvolving the pre~ent invention. Furthermore, while particularly DBMS i~ the prima~ data base manayement sy~tem employed in implementing the pres~nt invention, other data ba3e management system~ ~uch a~ DL/l could also be used. Lastly, it i~ contemplated thalt the present invention should not bQ limited to the TSO, Unix and OS/2 environment platforms curxently supporting the present in~ention.

Tha distinguishing ~eaturQs of a pre~erred embodiment of the pr~nt in~ention includ~ applicatlon portability, con6i8tent user inter~ace, dynamic application changes, and cooperatlve processing between heterogeneous computer architectures. Application portablility mean~ that an appli~ation written in one of the supported programming languages (e.g., COBOL or "C"), along with all relat~d copy . . .

'; , .~; ,,. 'i, ' .'.''; . ' ' . ' ""' ' .` ' ' ~.'. .'i i ~ .
. ' ' ' ',,' ' ! .

'~ ., .
' ~' ' ' ~',, ~2~

tor i~clude) ~iles, user interface panel definitions, documentat~on, transaction definition tables, views, etc., can be moved and installed, without source-level modification, on any supported target platform.

"Dynamic application change" enables most application changes (including procedural, data base, or panel definition changes) to he made in real~time, without disruption of service or loss of data integrity. End users perceive ins~allation of application changes as subsecond variance~ in response time, occuring only while the change is being lnstalled. Individual transactions of a distributed cooperatiYe processing application are updated asynchronously, without distupting continuity or integrity o~ data communications. Consistent user interface means that a user, from any ~erminal in the network, has tr~nsparent access to all transactions in the network (6ubject to security constraints~, that all transactions have a consistent form o~ dialoy navigation, and that the panel layout, u6er interaction with panel elements, e~c., i8 con,istent acros6 all tr~nsaction, for any particular user's terminal.

The cooperative proces~ing feature of DAA provides for data exchange between transactions re.siding on heterogeneous platforms,, transparen~ ~o the application.

To meet the need ~or continuou~ uperation~ and as w~ll as implied dynamic change for applications, the preferred embodiment of the present invention ~odifies an application (including data base and panel presentation) dynamically with, in most cases, only subsecond interruption to service while th~ change is being implemented. This maintenance capability is segmented so that most changes for an application can be modified in one system ~computer) without re~uiring the change to be synchronized throughout the :: , ::, ::
.
., .. ,.. , ~

V~L
distributed processing network. Certainly some applications, due to distributed calls betwean sy~tems, will require synchronization of main~anance on multiple sy~tems for certain type~ of applicat~on changes. However, the preferred embodimen~ of the pres~nt inventi~n allow~ dynamic asynchr~nous change throughout a network.

The Distributed Application Architecture (DAA) environment according to a preferr~d embodiment of the prQsent invention is comprised of a set of inter-connected ~ystem~, a8 shown in Figure 7, di6cussed below each of which i~ uniquely named and addressable by other systems within the network. Systems participate in the DAA environment by allowing applica~ions to use their resources (e.g., terminals, transactions). Each system is a homogeneou6 application processing environment which supports or simulates either a single-processor transaction processing systsm or a multi-processor single-image transaction processing system (e.g., IMS).

To illu~trate th.is aspect cooperative processing between heterogenous ~ystems, return to Figure 7. Two interconnected 5ystem8 are depicted a~ an exampla only as more systems can frequently be involvad in any transaction.
Input invoking a transaction is received at logical terminal 130 and forwarded to the DAA environment 132. Logical terminal 130 could be an IBM 3270 device, an intelligent workstation window~ a lo~al terminal or a non-DAA process.
The D~A environment 132 i~ a homsgeneous application prsces~in~ environmen~ (e.g., a transaction processing system)~ DAA environment 132 invokes the required tran~action. ~n application ~ay reguire a transaction 134 that only require~ information from local database 136. Or, a transaction 138 may require information ~rom both local database 136 and distributed database 140. At the same time, terminal 150 may address DAA environment 148 to invoke ~, ~` ' ~` ' ' ' ` `

transaction 144 which require~ information from local database 142 and distributad database 140. It is pos~ible with the present invention that transaction 144 (or 134, 138, 146) could use local database 142, call another transaction (say 134, 138 or 146) to re~ue~t information from local database 13~, and return the information to the DAA ~nvironment 14~ to be properly formatted and return to terminal 150.

Looking now at Flgure 8, a more clear example of this cooperative processing across heterogenous platforms is shown. As6ume a data input stream 92 is received from a UNIX computer 8~. This data stream 92 invokes application 94 to pxocess procedure 96. Procedure 96 obtains information ~rom D~MS 100 via SQL re~uests 98. As proc dure 96 is proce~sing, informa~ion is needed from DBMS which in turn needs information from DBMS 124 to co~plete it5 proa~sing. With the pre~ent invention, this information may now be obtained, while remaining traneparent to the user on the UNIX~6.

To accomplish this, proc~dure 96 iB returnad to application 94 in the form of an output viaw (not shown) reque3ting a LINK to, for exampl~ M Main~rame 88.
Application 94 suspends procedure 96 and 6tores relevant data from procedur~ 96 ln a profile view ~not shown3 which is in turn stor~d in ROLLFILE 102. Th~n application 94 makes a LINK request via communication line 104 to the main~rame 88. The mainfra~e 88 grants the re~uest and directs the data skream coming across line 104 to application 106. Application 106 determines this data stream is looking for information from D~S 112~
App~ication 106 forwards the data stream to procedure 108 in the form o~ an input view ~not shown). Procedure 108 executes on the data stream, requesting information fro~
DBMS 112 via SQL request 110~ While exeouting, procedure . . ~

~` ~

108 dete.rmines it need~ some information from DBMS 124 to complete it~ exeaution. Procedure 108 is returned to application 106 in the ~orm of an output view (not shown), while relevant da a is s~ored in a profile view ~not ~hown) in ~OLLFILE 114~ Application 106 then r~uest~ a LINK with OS/2 work~ta~ion 90 which is granted. Application 118 accepts the incoming data stream and ~orwards it to procedure 120 in the form of an input view (not shown).
Procedura 120 executes, obtaining information from DBMS 124 vla SQL requ~st 122. After completing execution, procedure 120 return~ to application 118 in the form of an output view (not ~hown). Application 118 makes a copy of this transaction and place~ it in a profile view stored in ROLLFILE 126. Application 118 then makes a RETURN request to mainframe 88. Upon the return of data stream via communication line 116, application obtains the profile view stored in ROLLFILE 114 and restarts procedure 108.
Procedure 108 ~omplete~ its execution, requesting additional information need~d from DBMS 112, i~ any, and returns to application 106. Application 106 makes a record of the completed transaction and stores it in a profile view (not shown) stored in ROLLFILE 114. Appli.cation 106 then make~ a RETURN request to UNIX 86. As the data ~tream is returned via communication line 104, application 94 obtains the stored profil~ view on this transaction ~rom ROLlFILE 102 and re6tarts procedur0 96. Procedure 96 completes it~
execu~ion, raqu~sting addi~ional i.nformation needed from DBMS 100, i~ any, and r~turns to application 94.
Application 94 makes a record of th~ completed transaction in the form of a profile viaw (not shown) and stores it in ROLLFILE 102. Application 94 then for~ats the outgoing data stream 92 for the appropriatQ terminal and sends it to the user.

DAA provides the services required to share transaction and terminal resources across heterogeneous systems.

2 ~ 2 '~
system as contemplated by the present invention is an appllcation processing enViroNment within a network, such as an IMS, C~CS, UNIX, OS2, or VMS processing environment, among others. ~ach system within the DAA environment ha~ a name to uniquely identify that system, and the run ti~e directory at each system maintains sufficient information to support the routlng of resource requests to the appropriate proae6sing 6y6tem within the ~AA network. The ~eature of DAA
which supports routing of resource requests is known as "Distributed ~esource Control".

These systems support distributed applications by allowing segments of these applications to proca6~ on any of the network-connected systems. These appllications are serviced by a collection of named transactions (~ystem~unique name) that may be re~erenced by the systems within the ne~work and the users o~ the network~ The6e tran~action~ may acc~ss data bases that are known to various portions of the network and may be addre~sed to data ba~e~
on the local sys~em or ~o data bases that are distributed on a set of remote system6 in the distributed data base environment.

The users of the diatributed application architecture disclo~ed as tha present illvention ar~a named (network unique name) workstation operators, or proc~3~es or ~achines that pre~ent themRelves as "u~ers" to the network. A user within the preferred embodi~ent of the presen~ application typically accesses an application provided in the DAA
network through a workstation terminal. The user may invoke various functions of the network by entering data into the terminal by voice, barcode, keyboard, mouse, data stream from a process, or other input device. Output is presented to users of the network via a terminal display; it is presented as a data stream to a process "user" within the TI~13766 32 :

i, , 2 ~ r~J ~3~v~

network.

A user signs on to one of the systems within th~ DAA
network using an User ID (network unique name) and an identifying password. This user identification i5 employed within the DAA network to identify activity for security and accounting purposes, as well as for profile management to maintain the status of processing activity ~or the user.

A given user may have multiple application~ active on multiple system~ at any one point in time. This may be viewed as the electronic work de~k for a user at a given system. The user may suspsnd processing oE a givan application, either by signing of~ the network or by ~witching to an alternative application within his portfolio. ~t the suspension of execution of each transaction th~ control program will retain, within the profile data base (hereinafter referred to as the RO~FILE) for that user on that system, the collect$on of data items (Profile View, described further below) that represent the status of tha~ suspended application.

Similarly, more than one user may have multiple applications active on multiple systems at any one point in time. The results o~ each panel of an application is stored a~ it i6 completed in a profile vi~w, which profile view i~
uniquely identi~ied by appl~cation name and u~er identification ~n a system. Although multiple users may be at dif~eren~ stages within a particular application, because of the present invention, each user is able ~o restart his particular application at the stage last completed by that particualr user, regardless of the system the user is logged onto and regardless of what system the application resides.

The architecture of the preferred embodiment of the preRent invention provides for a 'Display Active' ,: .- ; :
: - ,,: .: ' ' ' :::

, .

transaction that allows the user to display the applications that are active for that particular user on the designated system. Utilizing the 5 Display ~ctive' application display, the user may scroll thru the systems within the network by striking the appropriate function key. From this 'Display Active' applicakion panel, the user may also restart a suspended application, delete an application from the profile data base or may route the 'Display Active' transaction to a designated new system.

Aceording to the preferred embodiment of the pre~ent invention, applications can run in any of sevaral ~y~tems and the u~er may d~sir~ to interface with applicatlon~
lnvolving multiple panels. ~herefore, it is imperative that certain attribute~ be diæplayed on the u~er interface panel to identify critical parameters associated with the particular uaer interaction, such a~: th~ user respon~ble for initiat~ng the transaction, the system on which the r-ur~nt application is running, the application (tran~action) that i~ curr~ntly active for this di~play, the panel within that application that i8 curently being displayed, date and t.Lme of this interaction, error and information me~sages r~lated to the interaction and standard prompting information that reflects action~ the user may take ~rom thi~ particular panel. These standard panel attribute are deta~led below for example purposes only.

FUNCTION INTERNAL NAME ROW COL LENGTH

Transaction Name IEFl-TRAN 1 1 8 Panel Name IEFl-PANEL 1 10 8 Panel Title NA/Optional 1 19 30 System Name IEFl-SYSTEM 1 58 8 Date/Time IEFl-CURD~ 1 62 18 User ID IEFl-USER 2 72 8 Message ID IEFl-MSGID 23 1 6 ~:

;, ~ f `~
2 0 2 ~
Massage Text IEFl~MSGTX 23 8 25 Function Key Prompts NA 24 1 <79 The format of the Function Key Prompts is 'Fnn-prompt' where "nn" is a one or two digit number identifying the function key number, and "prompt" is variable length indicator of the association d function.

When UBing DL/l or other data bases, it is desirable, or o~ten e~en necessary, to have a collection of functions and sub-function~ packaged a~ TRANA and while another 5et 0~
function~ are packaged a6 TRAN3 to minimize the number of data ba~es as~ociated with a given transaction. Therefore, according to the pre~erred embodiment of the pre~ent i~vention multiple functions are packaged in each transaction module. Packaging multiple ~unctions within a ~ingle transaction code (here~nafter referred to as a "trancodQ") improves user fri~ndli~esa. Furthermore, it also minimizes the number o~ objects that must be managed when in~talllng an application in a new system or when re-deploying a new release o~ an application. The size of any resulting tran action module i~ a design consideration and must balance technical and performance consideration~
wit~ usex friendliness and ea~e of maintenance.

A ter~inal as contemplated by the present invention is a presentat~on facility, such as a video terminal screen, and an input mechanism7 normally a keyboard. However, as noted previously, this input could be a program, voire/ barcode, mouse, or other input as well as a keyboard. Similarly, the display could be a program a~ well a~ the more conventional tarminal display. Each logical terminal has a name that is unique within the DAA network.

The terminal is the primary interactive input/output facility for DAA applications a cording to the preferred - . . . . .
,:
:: .. : - : . :, : :
.. ,~ .;, . , , :. : : ~ ., .
., : - ~ :

- ': : : ~: . : ~ : :

: ~

embodiment of the presenk invention. once the input has been prepared to the user's satisfaction, he may press ENT2 (or an equival~nt) to invoke th2 transaction. This transaction input s~ream will be passed to th~ appropriate sy~tem in the network. once arriving at the appropriate system, it will be processed according to the transaction code. Once the transaction ha~ been invoked, the application or the In~ormation Engineering Task (IET~
runtime controller, will be re~ponsible for interpreting the input ~tream and in turn invoking the appropriate procedure.

output genera~ed by DAA transactlon~ will be pres2nted t~ thQ logical tQrminal, ~ormatted according to th~
interface and device chararteristics associated with the terminal (e.g., any nece~ary control sequences associated with di~play d~vices will be included in the the data stream). The primary human lnterface to the DAA environment iR through terminal~ that present panel~ o~ information from the applications via transactions executing in the various 8y5tem~. Often, the terminal i8 a ~4 x 80 video screen with keyboard. However, a "terminal'l could also be a program (e.g., an interactive program such a~ a spread sheet package). Each logical terminal i~ uniquely defined within each sy6tem.

An applica~ion as contemplated by the pres~nt invention is a collection of transactions that perform a set of functions on behalf of the application. Each application has a four character name that is unique within each deployed runtime sy~tem.

A transaction with DAA according to the present invention is a collection o~ resources (panels, reports, procedures, databa es, ~tc.) to be utilized in behalf of an application to perform variouæ functionR for that application. Each transaction is uniquely identified within 2~ 3~

each runtime system into which is is ~0ployed. Additionally, each transaction comprises a set of load modules or programs that perfo~m the specified func~ions in the appropriate environmen~ for tha~ transaction. Each transaction has a primary program (load module) which may, in turn, invoke sub-modulee on behalf of that transaction.

As shown in Figure 9, each DAA application transaction is composed of application procedures, panels, views, working storage, DAA run-time functions, a Transaction De~inition Table (TDT), and other ta~les. As can be seen accordlng to the pre~erred embodiment of the present invention, portion 152, containing the DAA runtima proceduree and ~able~, ls application independent. Portion 154, containing the TDT, procedures (input, refresh), panel (menu, application) and views (import, export, pro~ile), remains application dependent. Procedures have direct acceas to working storage, but are completely isolatad ~rom panels and view6 (and consequently isolat~d from ths mechanics of inter-transaction communication, device aommunication, profile management, etc.).

Each transaction may perform multiple functions in behal~ of the application. These functions are represented by application procedures. A procedure as contemplated by the present invention is a collection of code that performs a particular ~et of functions on behalf of a transaction.
Each pxocedure ha6 a name that is unique within the associated transac:~ion . An appl ication procedure may be invoked a~ a result o~ a panel being presented to the transaction that contain~ this procedure. A procedure may also be invoked by a distributed application transferring a re~uest for ssrvice through a nP.twork request (LINK) to the designated system/transaction thereby invoking the de~ignated transaction procedure~ Upon completion vf execution of a procedure, the procedure may stipulate that a .. ; ::
- ~ ' :,. , :

'' ' "'' ' `" ' ' ::: , : . -: :
,,', ' " ~ ~ :

- ~ r~ 2 ~ ~ 3 panel i~ ~o be prepared and presented back to the application user or i~ may designate that control is to be passed to another system/transaction/procedure with a remote request or it may designate tha~ control is to return to the calling ~ystem/transaction/proc~dure that invoked this procedure.

A panel within DAA according to the present invention is a defined format for information interchange with a logical terminal (e.g., an IBM 3279 display terminal). Each panel is uniqu~ly identi~ied within t~e associated transackion.
A~aociated with eaah p~nel is an INPUT procedure and REFR~SH
procedure. The input procedure i5 invoked when the corresponding pan~l is received from a terminal. The optional refresh procedure is ex~cuted upon the re~tart of an application or from a HELP suspension in order to refresh data to be presented on the panel prior to output display of the panel.

An input procedure i8 an application program that i6 invoked when a panel is rec2ived by a system from a terminal/process. When an input pa:nel i8 received rom a logical terminal, the input procedure associated with the panel is invoked.

A refresh procedure is an application program that is invoked prior to di~playing a panel t~at i~ reques~ed from a menu or is invoked upon restart of an application that has been suspended for HELP documentation pxesentation. The refresh procedure is typically used to retriev~ data from data ba~es prior to display on the panel. The refresh procedure may also ~e invoked when a panel i8 to be presenked a~ an initial user request from a menu. A re~resh procedure may be associated with a menu sel~.ction and/or a panel. If a refrssh procedure is associated with a menu selection, this procedure will be in~oXed prior to the .. .,: ;;, , ~- .- , .

: .,. ~ ,:
' ,i . :~
.. . .

~ 3 g 3 ~

display of the panelO If, however, a menu selection does not explicitly have a refre6h procedure, then ths refresh procedure on the panel specification will be invoked. If neither the menu selection nor the panel specification specify a refresh proce~ure, then the panel will be presented from the data in working storage, as populat~d from khe profile view.

Working storage, sometimes also referred to as a transaction view, contains all data items that will be re~erenced by all panels, vi~w~, and procedures for this transactlon. Working ~torage i~ pas~ed to aach procedur~
within tha transaction ~or use in sxecuting the logi~ o~
that procedure. Working storage consi~ts of a fixad section, which is used to communicate between DAA run-time functions ancl application procedure~, and a variable section, whi~h ~ 8 entirely applicatlon-defined.

Within DAA, according to the preferred embodiment of ths pr~sent inventlon, application pro~edures communi~at~ with each other, and with outside ra~ources, via "view6". Vi~w~
are used to help isolate application procedures ~rom ths mechanics of inter-system communications, device presentation managem~nt, help facilitias, menus, and other DAA common sQrvices. This icolation of the application logic ~rom "services" ens~res that:
- an application can be servicad, without progra~ming change~, through continually e~olving comm~nication~, storage, presentation, packaging, processing, etc., technologies.

- an application can be implemented on a variety of platforms and architectures, based on cost/performance measurements (not on migration costs~

- an application can be implemented on a variety of : , . .. .
. . ~.. . :

:, '' :. '. :~
' ~;;. , : ~ .

2 ~

user environments, including variances in national language, human interface hardware, and user preference.

an application can be altered in real time, including data interchange (view) re~definitions, without disruption or loss of data.

A view within DAA as contemplated by the present invention i8 a designated collection of data items that are utilized by ~he applica~ion. A viPw is a named collection o~ ~uch daka items and includes the identification and l~ngth o~ th~e data ltQm~ a~ th~y relate to the particular tran~action, The primary typss of viewa are pro~ile, import, and e~port. A profile view identi~ies all data items which are to be saved in the u er' 8 profile between executions of hi~ tran~action. An import view de~ine~ all data ite~s to be presented to a called procedure by a calling procedure. An axport view d~fine~ all dat~ items to be presented upon completion of the execution of a called procedure to the calling procedure.

Tha profile ViQW i8 a ~ub~et: o~ working storage sometimes known as (transaction view) that is to be saved in the users profile for this applicati.on~ At the completion of the ~xecution of a procedure, the profile view ~or that procedu~e is extracted from working storage and written to the profile data basQO Ac ~his transaction is reinvoked by subsequent data entry or application rest~rt, this profile view is read from the profile data base and used to repopulate working storage. ~he profile view is intended to ba a subset o~ working storage which defines the data requirements of the current user dialog state while minimizing the overhead associated with maintaining user profiles.

The import, or input, view is a collection of data items Tl-13766 40 .. ~ :~ :
.. : . .:
: . .. . .
. .
. .. - :
. . ': ~ , . , :
,; :.. .

:. ,.:

2~ ~3 that are presented to a procedure when a procedure i8 LINKed-to from a calling system/transaction/procedure. When a procedure completes and indicates an Exit State of LINK, the DAA control program (IET) will extract from working storage the data items identified by the import view for the called procedure and package that with the control information necessary to specify the calling and called system/~ransaction/procedure. This message is routed to the designated system and transaction for execution. The import view, when received at the called system/transaction/
procedur~ us~d to populat~ worXing ~torage for the called transaction.

The exportl or output, view is a collection of data items repre~enting the re~ults of the execution of a called procedure. The export view is a subset of ite~s contained in working storage at the completion of a procedure exeaution when the exit stat~ is set to RETURN. Thi~ export view i8 packaged with interface control information into a message to be routed back to the calling system/transaction.
When thi~ message arrives at the deslgnated sy~t~m~
kransaction/procedure, the profile view for that system/transaction/procedure is retrieved from the profile data ba~ and used to populate working storage. The export vi~w is then extracted from the me~fiage ~ust r~ceived and used to populate (a~d overlay profile data in~ working storage. The specified procedure i~ then restarted.

A transaction view is a collection of data items to be used by the collection of procedures, panels, and view~ that ~ake up a transaction. The e data items may be thought of as COBOL Data D~finitions or as C structures, although other lanugages may be used, that specify each of these data items. The transaction view is passed a~ a worXing storage area to each procedure within the transaction for use in executing thP logic of that procedure.

,, , : ~:
::: :; . : , , ' : , ~:~' ;; ''. . :~.
. ., ;,. : ~ ~

~ !~ 2 & ~

When the TDT i first referenced, th GTD system will generate the "system required" portion of the transaction view and place this in the associated SRCLIB (described later)O The transaction view name is usually oP the form "tdtTVW~I. The application designer is then reguired to add any application-unique data items to this transaction view.
Once spPcified, the transaction view is used as a data re~erence ~ource for procedures, panels, and other views.

APPLICATION ~O~TABII,ITSr. Application portabillty ls achl~ved by supporting, on all DAA sy6tem platforms, and for evolving 8y8tQm anvironments: id~ntical application source programs; identical application definitions; and identical application developmant environments.

Source program portabllity, or identical application source programs, for all supported platforms, i8 achieved by adherance to a selected set o~ industry-adopted standards, combined with a platform~independent program interface.

Example6 of industry-adopted standards which are used to assure source program portability include: "C'~ program compliance with draft proposed ANSI "C" (X3Jll), including the defined function libraryJ ''COBOL'I program compliance with ~NSI X3.23-1985 (Intermediat~e Level); and "SQL"
co~pliance with ANSI X3.135-1986. Adherance to thase standards are checked on all platforms having ANSI compliant compilers or pre-compilers. Deviation from the standard, including non-portablQ u8e of system-specl~ic functions, is checked whenever feasible.

Examples of areas in which industry-wide standards do not exist include: interface to a tran6action proces ing system; interface to a presentation system; co~munications between cooperative processes; routing messages to .
.
.. , ~ - -. ;

,.
, . . ..
.. : : . :
:. :

:
. : . .
' ~
. .

2 ~ ; 3 :~

terminals, transactions, systems: user interface; pro~ile management; help and user documentatioTI. These functions are provided by DAA, but are completely isolated from application logic.

Further~ore, there ls one interface between DAA and application procedures. The application procedure is called, passing it the address of working storag~.
Interaction between DAA run-time services and the application is via a fixed portion of working storage. The appllcation u6e~ working storage to request services such as display a speci~ic panel or link to a procedure. XowevQr, the application does not speci~y data reguir~ments, logical control sequence, or any other mechanics of the servica.
Parameter~ of DAA sPrvice~ axe isolated fro~ the application logic, making the application source program independent of sy~tem-speci~ic implementations.

The runtime envlronment for DAA applicatione providss ~or the major functions ~o be suppoxt~d by a run time driver (IET) and associated run t~me ~ubroutines. An application (input) procedure is invoked as a result of input from a panel or input ~rom a remote procedure call(i.e., LINK). In ~ithQr case, the structura and content of working storage, as well a~ th~ calling sequence itsel~, is identical. It i8 transparent to the application whether input was received ~rom a panel or another procedure (except that an optional RETVRN may be made to a calling procedure). These two form~
of input are ~urther describad in the following paragraphs.

When panel input is received from a terminal to a procedure, the usex's profile view is extracted from the ROLLFILE and placed in woxking storage. Working storagP is presented to the procedure and the procedure is executed, which typically performs application-dependent data ba~e query/updates, manipulative logic on data items in working : ,, .. , .. : ;, ~. .. .

: -. ;

2 ~ 3 :~

storage and/or data bases, and preparation o~ output data elements in working storage (which may be saved in the user's profile or displayed to the output terminal when control is returned to IET). If, for example, the designer of the application rereives input, reads data from the data ba~e, places that da~a in working storage, and returns control to IET, the same panel will be displayed with the newly populated working storage data.

If the logic of the input procedure is such that it determines fro~ ~erminal input or user action request (e.g., a ~unction key) that an alternatlve panel ia to b~
displayed, it may do so by insert~ng the new panel name in the IEFl-PANEL field and returning control to the IET. IET
will prepare a panel for the inpuk terminal consistent with the panel specification. If the IEFl-PANEL field is left blank, the master menu will be displayed.

The design~r has the option of intarrogating the user action regue~t ~a.g., ~unction key), located ln working ~torage eleme~t IEFl-FUNKEY, to det~r~ina actlon to be taken by this procedure in respons~ to a u~er action rec~est fro~
the terminal. Note, however, that certain action requests are resorved ~or use in dialog action~ de~in~d in ~ho consistent user interface (and implemented by IET).

An external procedure is a proceclure which is physically located in a different transaction and po~sibly different system. The external procedure itself i8 not included in the oalling transaction load module but a reference to this ext~rnal procedure is made to correlate the import and export views for this procedure.

An applicatlon procedure can use the LINK and RETU~N
exit states to invoke external proceduresD Distributed Resource Control (DRC) is used to route the request to the ;, .: .
,: .

~2~

designated system/transaction. The procedure name, as speci~ied, must be a well defined procedure name within the called system/transaction. If it is not well defined, then the menu for the called transaction will be displayed to the user.

The lnvoked system/transaction/procedura operates in the same DA~ environment as ths parent transaction/procedure and has the same op~ions (i.e., if a panel is to be displayed upon completion of ~he execution of this called procedure, the procedure may do so by entering a panel name in tha IEFl-PANEL field and returning control with the IEFl-XSTAT~
field blank to di~play this panel to the reque~ting ueer).

A called external procedure may return control to the calling procedure by setting the variable IEFl-XSTATE to RETURN. In this ca6e, the IET control program will extract data items from woxking storage a~ BpeC~ ~ied by the export view for this called external procedure, package that with the interface control block that initiated this call request and suhmit thi6 output mes~age to the calling sy6tem/transaction/procedure. Upon return to the calling system/transaction, the IET control program at that system will extrack the profile view ~or thel calling procedure from th~ profile data base and use it to populate worXing storage of the calling ~ransaction, followed by a population (and cons~quent overlay) of working stQrage based on the export view rQceiv~d from ~h~ called external procedure~ Th~
calling procedure will be reinvoked ~or further proces~ing.

D~A profile mana~ement is a service which is automatically provided to all application procedures executing in ~he DAA environment. Profile management saves and restoras an identified subsat of working storage, completely independent of application procedure logic.
Profile management enable6 D~A transactions to have the ~, ~: ~ ... :, . . ..
. . .
', , r ', ~ :

2~2~ 3:~

characteristics of conversa~ional transactions (except profiles are by user instead of terminal)l without requiring applica~ion logic. Consequently, DAA procedures have some of the ease-of programming features inherent with interactive-mode applications, while retaining the resource administration advantages inherent with transaction processing.

One side ef feat of DAA's profile management is that working ~torage i6 set accordlng to the definition of the usar proflle (and not neca~arily tha laRt execution o~ th~
prooQdure). Thie ncourage~ applicatlon procedurP~ to b~
cod~d for ~erial re-usability and/or reentrancy.

Application definition portability, both with respect to supported platforms and evolving 8y8tem environmentg, iS
achiaved by u~ing table~ (as oppo~ed to generating code) within the application load module.

Tables to descrlbe the application re~ulrements and definitions are independent of the Ispecific implementation environment. For example, panel table~ do nok have any device-related informakion nor do i~mport/export ~iews have any protocol-specific information. Environmental dependencie6, such as terminal devices or inter-system communications protocol, are isolated from the application definition. Conseguently, DAA support for changes to the environment, either through explicit application transfer t~
another environment, or through natural evolution of the current environment, is achieved without impacting tha application.

DAA provides a platform-independent interface to a structured development process, plus an automated mechanism for ~ransferring an entire application development environment between platformsA

:- :. . . ..

- , : : :, ., .. ~, . :
:

:
, 2 0 2 ~

~ Generate Transactlon Definition" (GTD) is an interactive tool used for semi-automating the transaction development process. G~D provides the developer with a mechanism ~or specification of all transaction elements.
The user creates and edits the Transaction Definition Table (TDT~, which identifies the elements to be included in the transaction and the relationship between tha elements. GTD
also provides the mechanism for specifying parameters of DAA
services, such as dialog interaction control, panel layout, profile mapp1n~, lmport/export mapping, etc.

GTD provid~ a "common user intar~ace" to th~ developer, independent of the platform being used for development. The tool has the same panels, and same options, on all sy5tem8.

All a~pects of application deY~lopment ara identical on all platform , including txansaction definition, menu definition, panel layouts, view definitions, working storag~
definition, help and infor~ation documentation, etc~
Variations in file namlng conventions, compiler optlons, link options, SQL pre-compile option~, and othcr 6y8te~
~ature~ are hidden from the developer. ~ariations in physical characteristic~ of supported terminals/dev~ces are tran~parent to th~ developer. Variations in the tran~action processing system, and associated interfaces, ara hidden ~rom the developer. Installation procedures are identical on all ~ystems.

In addition, there is a function within GTD which provide~ for the automated transport o~ the entire development configuration, for a given application, from one system platform to another. These capabilities promote rapid deployment of applications across heterogeneous plat~orms.

: .: ~. :
..;

. .

. . ~ ~ ,. -~ ~ 2 ~

GTD is a structured development environment and enforce~
structured construction of transactions. Since all compon~nts are known and controlled by GTD, it is feasible to automate the transfer of applications from traditional (albeit partially automated) development methodology to ~ull-cycle CAS~ tools such as Texas Instruments' IEF.

DY~MIC APPL~C~ION~. The primary attributes of DAA
transaction~, according to the present invention, which contribute to the capability for dynamic application modirication ar~ pacXaging all application~speci~ic compo~ent~ o~ a transaction into singla load module; and insulating transactions ~rom the impact of view definition changes.

Additionally, DAA service~ associated with application transactions can be modified dynamically and synchronou~ly (with respect to all application transactions~ since: most DAA services are implemented as indepen~ent proce~ses/
communicating (in system-dependent implementations) with DAA
run- time functions in the transaction; and the DAA run-time ~unctions are dynamically loaded, lndependent of the transaction's load module.

These capabilities enable continuous operations at all systems. It av~ids the problfems of synchronized installation, enabling maintenance on ~ach system to be performed a6ynchronously. It also enables continual upgrades to DA~ service capability (e.g., abili~y to support new terminals~ devices; new user dialogs; new help/documentation presentation features; etc.), transpare~t to application transaction6.

one or more application procedures are packaged together with a transaction definition table, views, panels, and other resources to cEeate a uniquely identi~ied load module~

... , . ~ . .: . : : . .

:: : ., ..

.
. .

.~2~
This load module, in combination with other attributes such as scheduliny priority, is identi~ied to the Transaction Processiny Monitor via a "transaction identi~ier". This transaction identifier is the basis for scheduling work within DAA. The load module which is associated with the transaction identi~ier includes:

- Application procedures.

~ Set o~ resour~es ko be used in conjunction with application procedure~, such as data sets or data basea.

- Tran~action Definition Table. This table includes, among other things:

- A table of all referenoed procedures, both int~rnal and external.

- For each referenced procedur~a, the import, export, and pro~ile views as~ociated with that procedure.

- A table o~ all referenced panels.

- For ~ach referenced panel, the re~resh and input procedures associated with that panel.

- Working storage.

In summary, the load module contains all application-specific logic and data. Since the load module is treated as an indi~isible unit by the transaction processing system, modifications of program logic, data base query, panels, and/or any o~her components o~ the transaction will always be installed synchronously, thereby ensuring load module integrity. Most non-DAA systems, both transaction processing systems and interactive systems, . .
, . ~ :, . . . .

, ~

:,: . .: , .

202~

require or allow user interface control tables be physically separate from load modules (which inevitably leads to synchronization problems).

Specifically not included in the load module are the DAA
run-time functions ~IET, etc.,) which provide and/or interface to thP various services provided by DAA.

IET, along with all lower level service functions associat~d with IET, is implemented outside the load module, IET i isolated from applicati~n load moduleR in order to reduce application load module size, synchroniz~ sy~tem-wid~
installation, enforce IET upgradas into all appliaation~, and perform IET upgrades without rebind or other modi~lcation to the application.

IET, along with all other DAA run-time ~unctions, are implemenk~d a~ a dynamic link module, callabla ~rom the (DAA
provided) "~ain" program which gain~ control ~rom the transaction proce~or.

~ any DAA services are implementad a~ indep~ndent pxocesses which utilize system-dependent techniques to communicat~ with the run-time functions linked to application transaations. These services include doc~lmentation retrieval Cystem~ profile management, and distributed resource control. The DAA services are implemented as servars; funotions within application transaction~ are clients.

DYNA~IC VI~W ~N~G~E~. Application procedures communicate with each other, and with outside resource~, via "views". Views are used ~o help isola~e application procedures from the mechanics of inter-system communications, device presentation management, help facilities, menus, and other DAA common service~.

.. , . : , . :
..
: . :.
: ~
. . ~ , .

2 ~

Foll~wing each execution of a procedure, a subset of working storage is saved on disk. This subset is a specific "profile" view ~or the procedure. The profile view is used to re-populate working ~torage when panel input is complete (working storage is re-populated from both the panel input data and the profile).

The relationship~ between DAA application procedures, working ~torage, and profile views is shown in Yigur~ 10.
The portion of Figure 10 de~ignated 156 repr~sents that portion of the execution under IET control. The portion de~ignat~d 15~ r~pre~ents ths portion cf th~ ex~cution that remains under control of the application.

When a tran~acticn has bean restarted after being ~u~pended, a ~y8tQm according to the present invention uses tha user ldQntification provided at logon, and the application identification of the desired application procedures, to locate the profile ViQW which has matching identification. If no profile view i8 found, to match the given identi~ication, tha system will generate a new profile vie4w that bear~ the gi~en identi~lcation. once a pro~
view bearing the given identificakion has either been located or generated, th~ dialog ~anager then per~orms its proce#~ing sequence until the transaction is suspended again or completed.

The dialog manager (IET) processing sequence for pro~ile views, panel views, and working storage is summarized as follows:
- Read profile 160 and map to working storage 162.
- Read panel input 164 and map to working storage 162.
- Execute procedure 166.
- Map working ~torage to pro~ile 166.
- Map working storage 162 to panel 164.

. . .
. ~,;;. . ~ .

" ,~ , :: , . .
, 2 ~ 2 ~ ~ ~J ~, - Display panel (not shown).

Working storage is used directly by the application procedure6~ External view~ are used ~or coordinating [aæynchronous, queued) data interchange between procedures.

Views which are interchanged between procedures via LINK, RETURN, or XFER or "profile" view~ which are stored on the user/session profile stack are l'External views". These views have ~he property of exi ting asynchronously to the lifa cycl~ of ~ransactions. (~.g., the transaction could be modified while a view is in transit b~tw2en transaction executlons, po~ibly with a di~f~r~nt dzfinition ~or working storage).

Whe~ data i8 interchanged between two transactions, or even bstween one execution instance of a tran~action and another execution instance of the same transaction (e.g., "profile" views), a mapping occurs between an external view and working ~torage. The followlng tran~formation con6iderations apply to this mapping:

- The internal representation of data within working storage may not correspond to the internal representation of the same data item in the external view. Either the format or length may be different.

Data item~ may be added to or removed from working storage or an ex~ernal view.

- The naming convention u~ed by items in working ~torage may not correspond to the naming co~Yention used by the external view.

- The data content of the external view will change over time. Not all transactions u~ing the external view are .~

: ~ .: : , - . ~ , "
.. .:: ~ :.: . ,, , , ~ . -,., , ., ., : ~, " ' . ~ ,'.. ,1,'" ,~',' 2~2CJ~

updated (nor necessarily havs to be updated~ to reflect changes in external view content. In any case, installation of external views or working storage modifications should be possible, in real ~ime, with no disruption of application transac~ions or data distributions in progres~.

- The quantity of data within a view may vary. A
repeating structure may occur a variable number of times.

External Views are implemented according to the IS0 pre~antation protocol standard, which defines both a "sourc~" language sp~ci~icatlon ~or data structures a~ well a~ the run-time data encoding ~lgorithm~.

To achieve the goal of data interchang~ in an environment which permits realrti~e transaction modification, working storage is defined independently from the external views (import, export, profilQ~. A view consists of a set o~ data elements, wh$ch can be "primitive"
items or "sets" of dat~ elements. The recl~r~ive definition allow~ arbitrarily complex structures.

Each data element of a view is ~ssigned an identifier ~which i~ always as60ciated with tha same element, even if the element changas relative position within the structure or has a change of length). Each data element of working storage is assigned an identifier (which is always associated with the same element, ev~n if the element changes relative pos.ition within the structure or has a change of length). A projection table is constructed for each view which de~ine~ the mapping between identifiers in a view and identifiers in working storage.

Using IS0-defined ASN.l encoding, including embedded identifiers for each data element, views can be interchanged across heterogeneous platforms. Furthermore, view encoding ,. :: ~., , :

, ' , , ''' ' ':

c~

is independent of any structural change in working storage since embedded i~entifiers are used for mapping (i.e., mapping is not dependent upon sequence of items in either working storage or view).

Consequently, data intagrity o~ view exchange is maintained even with changes in relative order and/or removal or addition of items within the view.

CON~I~TENT U~R I~TERFACE. A user interface scenario which illustrates user interaction with a distributed DAA
application i~ shown in Fig 11. In this example, a user 168 entered a panel on terminal 58 which was a~sociated with System 2/Transaction 2/Procedure 2. Since the user's terminal was physically located on System 1, Distributed Resource Control (DRC) was used to route the message (i.e., panel input) to System 2/Transaction 2/Procedure 2.
Application logic within Procedure 2 requested a LINK to Sy~tem 3/Tran~action 3/Procedure 3. DRC was used to route the LINK meseage to Sy~te~ 3/Transa~tion 3/Proaedure 3.
Application logic within Procedure 3 reque6ted a panel to be displayed to the user. DRC wa~ used to route th~ message (i.e., panel output) to the terminal 58 on System 1, for viewing by user 168.

Within this scenario, involving multiple ~ystems and transactions, user interface consistency is es~ential. Tha primary purpo e of a consi~tent uRer interface within DAA ls to have all computers, ~ystem~, application~ look the same to the user. Panel layout, panel element interaction, and overall dialog flow are key a6pe~-ts of usar interface consistency. DAA enables and partially automates the speci~ication of consistent, system- and device-independent panel layouts (via GTD). ~ialog ~low is partially defined by the developer (menue, panel validity checks, documentation) and partially defined by DAA conventions for '' ' '' : , 1',`.' . , ",, " ~ , ", "~" ~, ,. , ~

' :,., :':

2~ ~
dialog flow between applications.

Run-time user dialog navigakion is implemented by IET~
independent of application logic. Providing a consistent user interface relies heavily upon profile management, which maintains the transaction state and selected application data for each user/session, The user and computer exchange requests, creating a user-driven dialog which moves along one o~ the hierarchi~al paths provided by the application. Within the dialog, data and control is passed ~rom one procedure to another. A
procedure may be located on any systam within the DAA
environment. The location of a procedure is transparent to both the application logic and the end user.

IET controls most of the user dialog, isolating the application pxocedure from the ma;or aspect~ of user intexaction. This enables IET to implement not only a conslstent user interface across all terminals and plat~orms, but also to evolve the u~er inter~aae towards developing industxy tandards (independent of application logic~. The following paragraphs describe an implementation of a con~istent user inter~ace (controlled by IET and de~ined by GTD).

Although the IET will be descri~ed in greater detail later, it u~es a mapping service to interpret any panel input by mapping the input into variables which will ~e used to build panels. It interfaces with a transaction processing subGystem to obtain a next panel ~rom a user and to present the output in a panel form with which the user may int~xact~ By using a table o~ in~ruction~ containing pointers to maps, views, and appliction procedures, the IET
is instructed, ~ia a translator for the table o~
instruictions, as to which next p~nel to present based on the ". , ~ ~, .
-, : . ; ~

, .: , .: ~

results of the processing of the previous panel.

The IET manages dialog flow between various users, which can be a variety o~ logical texminals by initializing the fields within a transaction view for that transaction.
After receiving a ~ormatted input data mes~age, the IE~
reads the message header to dPtermine where the message is routed ~or proper processing. If the systemO~ran6action.procedure name found in the header does not match that of ~he local system, the IET forwards th~ me3saga packet on to th~ appropriate ~ystem. If there i~ a match, how~ver, ~he IET yield~ control o~ the dialog flow to a map int~rpretsr that thR IET called. A~ter tho processing has complete~ to ~he extent poseible, æither dua to applica~ion command~, or proc~dur~ susp~n~ion, or completion of ~h~ procedur~, tho IET builds an output message containing either an lnput viaw (for cooperative proGessing on another sy6tam.trans~ction.procod~r~) or an output view l~or returning a cooperatively proce~ed procedure or returning a panel containing the proc~s~d results to a user)O Either way, the IET then forwards the messag~ to the desired logical terminal.

Panels are the primary unit of in~ormation interchange b~tw~en transactions and tarminals. A description of the usPr dialog which follows is with respect to sequences o~
panels. Within a panel~ there is information structured according to definitions made in GTD. In particular, ~here are fields which display or receive formatted data. The fields have various attributes, such as color, revexse video, atc. The panel is imported to DAA whenever an ~actlon~! is requested (e.g., an action can be associated with a function key or an action bar pulldown menu item).
Whe~ the panel is imported to DAA, DAA receives data which has been entered in entry fields, the action r~quested, and the currently selected (e.g., cursored~ data item.

, ~ ., ,, .: ~ . :
. - . :: :

` ~ ' , 2~2~3 ~

User interaction with panels, prior to the action request, are performed locally at the terminal (e.g., cursor movement, key entry to fields, etc~). This interaction is device-dependen~, but is consistent across all DAA
applications (~or each particular terminal).

Panel to panel navigation is terminal independent. DAA
transactions present panels to the terminal via a panel driver (referred to as TMS). TMS interprets panels prepared by GTD and ~upport~ color, extended attrihutes, reverse vid~o, under~core, and other characterl~tics. Certain terminals tha~ could receive the~ pan~l pr~entations may not b~ capable of supporting the full functionality of the panels as prepared by the designer. To support multiple level~ of terminal capability but 6till provide maximum ~unctionality for the most capabl~ terminal deviGe~, T~S
u~es terminal characteristics information provided by Distributed Resource Control (D.RC). Therefore, the application de~igner can design terminal presentations thak utilize the maximu~ ~u~ctionality of any terminal that would utilize his application but, at the same time, be as~ured that his panels could be (dynamically) adapt~d ko termtnal devic~ that have lesser functionality.

At the same time the user and transaction are exchanging request~ involving the processing of information, the dialog, under control of the user, is moving along one of the paths provided by the application. The user "navigates"
through the application using specific action~ that are part of the dialog. These dialog actions don~t necessarily request the transaction to process in~ormation: they may only cause movement through the dialog path.

Dialog navigation within DAA is controlled at several levels: sessions, transactions, and panels.

:. . , :,. ............... ~ .
.
. . :' ' . `. ", ~- ;
: .
- : .
, .

?J~ ~i The highest level in the hierarchy o~ us~r interaction with DAA is the DAA "Display Applications" (DA) transaction.
The DA transacti~n identifie~ active application on a system within the network for the de~ignated user and may manage more than one session for each user. When a user signs onto the network, the User-ID becomes known to the network. By employing the di play active (DA) tran~action, a user is able to view the list of applications in progress for the specific User-ID. Through D~, ~he user may resume execution of an application or delete tha pro~ view for an appliction from tha ROLLFILE~

Since D~ is a network-wide facility, the user may, through ~unction keys or by deæignating an alternat~ system, transfer control of the DA transaction to an alternate sy6tem. Such transfer o~ control allows the user to view a list of applications activ~ for that user on other systems in the network.

In order to managa and con~rol the number of active applications, the system may restrict the number of active applications and the amount of ROLLFILE space allocated for each user. These parameters may be set by default when a new user 5ign3 on to the system and can be modified via the USR.C option of the IEC tran~action (described later)'.

Each user session has its individual prof ile stack containing ~h~ current sta~e information ~or the corre~ponding hierarchy of transactions and panels. The DA
transaction allows tha user direct access to all of hi6 active ~essions (includlng transactions on remote systems, if the ses6ion's transaction thread lead~ to remote systems).

The possible routes of navigation and destinations from ~ .,, . :' ' :

,'' '.'',:"' ',` ;
': ~ '`' .:
. :;: , ~: . . , ~5~
~e~ion to session, ~or a typical dialog, are shown in Figure 12. As can be seen, a user may reque t DAl (IETAAS) 170, which displays ~AA application, to start any session 172, may resume any suspended session 172, and may ~uit or suspend any session (current or suspended~.

U~ers can per~orm the following actions with respect to sessions:

- SUSPEND the current session. The suspend action saYes the current state o~ the seseion and displays the DA panel. It i~ pos~ibla for the user to re6ume execution of the session at a later time (as an option from the DA panel), with the same dat~
(profile~ as the tims of suspension.

- RESUME a suspended session ~option on the DA panelj.

- QUIT the current session~ Terminates the cu~rent ~esaion, di~cards all profile information a~ ociated with the session, and retur.ns users lmm~diately to the DA transaction. The DA transaction is logically the ~arthest point to which users can return within DAA (i.e., the starting poi:nt for DAA users). In e~fect, quit is a fast-path exit to the highest level, logically bypassing the intermediate exit points. Any intermediate LINXad transactions are exited.

- QUIT a suspended ses ion (option on the DA panel).

- CREATE a new session.

The IET manages dialog flow for data input ~rom a logical terminal for a suspended trnasaction that has been re6tarted by initializing the variable~ in the related '~' ' ; ~ - , , .

. .

, . . .

2 ~
transaction view. After receiving the data input from the stored profile view, it chec~s to see if the input from the user is formatted. The IE~ reads the profile view and generates a new profile view based on selected portions of the ~ormatted data input. ~fter converting the input ~rom the input view and and profile view, the IET interfaces with a resident data base management system to obtain the necessary views, maps, and procedures required to process the input. The system creates an output view, populating iwth with selected portions of the processed data and re6ults. The IET makes a profile view of the current state juet completed and replaces the previou~ view stored in the ROLLFILE with the new profile Yi~W, The IET then transmit~
the output view, in the form of a message bearing a header with routing in~ormatlon to the appropriate logical terminal.

Transaction Navigation within a session iB ba~ed on a thread of LINKed transactions. Each transacticn has an exacution sta~e which i8 r~tained on the pro~ data ba~e.
The ~irst transactlon within a thread is determined by the user when he start~ th~ session. The creation o~ a new LINK
ln the thread of transactlons is under program control. Th~
~ame txan~action can occur more than once within a ~e~ion~
Th~ return from a li~k can be performed by ~he progra~ or can be short-circuited by the user (the Exit or Cancel actions).

The pos~ibl~ route of navigation and destinations fro~
tran6aotion to ~ransac~ion, for a typical dialog, are shown in Figure 13. The variou~ routes depicted in Figure 13 emphasize navigation about ~he thread o~ LINKed transactions. As seen, DA display DAA applications 170 begins by linking to DAA application transaction 174 via transaction 174's main menu~ From this menu, other panels can be invoked and this transaction (174) can be either -.

.. :, , . ,:

2 ~ .J r, ~
cancel~d or exited. The other panel~ can be LINKed to tha LINKed panel of D~A application transaction 176 or they can be exited to return to the ~ain menu. The LINKed panel in tran~action 176 may cancel transaction 176, at the user'~
reguest, or it may connec~ to the main menu of transaction 176. This main menu may in turn invoke other panels within transaction 176, can canel transaction 176 to get back to the other panels o~ tran~action 174, and can exit transaction 176 to return ~o the main menu of transaction 1740 This pattern repeats for evary tran action added onto the ~INK thread.

Within a transactlon, there 19 a set o~ panel~. The navigation through a ~equence of panel~ is a function of the u~er interaction with transaction procedures. The possible routQ~ of navigation and destinations from panel to panel, for a typical dialog, are shown in Flgure 14. The first panel executed within a transaction i6 either ths main menu or the panel ~esulting ~rom a LINKed procedur~ ex~cution.
Within Figure 14, a closer look at thQ ~etail within an example current transaction 174 i8 depictedO Main menu 178 i8 interconnected with panels 180, 182. From main menu 178, panels 180, 182 may be ente:red. The navigation possibilities vary at panels 180, 182. From panel 180, for example, a transaction may proceed to enter panel 182, enter panel 184, or cancel and return to main menu 178. Panel 182 may entex panel 184 or cancel and return to main menu 178.
Panel 184 may enter panel 186 or cancel and return to panel 180. Panel 186, when completed, may only cancel and return to panel 180.

The actions users can perform with respect to panels are:

- Go back one step (the Cancel action). This results in a refresh of the panel which is next higher in the - . : . . , :. . . ~

:, .

,; '' ~ :, ' ' ~ :
:. :

2 ~
hlerarchy (e.g., the panel shown immediately prior to the current panel). A Cancel issued from the main menu terminat~s the transaction.

- The "Exit" action returns the user to the main menu for the current transaction. If the user is already in the main menu, and this transaction i~ LINKbd, then a return is made to the main menu of the previous application tran~ction. If the user i5 ~lready in the main menu, and this transaction is not LINKed, then exit to DA. Repeated exit requests allow ueere to e~ep back thxough the application tran~ction by tran0~ction, utlimately returnlng th~
dialog to the highest level in the hierarchy (the DA
tr~nsaction).

- Refre6h action. When users request re~r~h, any data entered on the panel i~ ignored, and the refresh procedure i5 executed to generate the current status o~ data to be displayed on the panel. Example o~
application which might re~uire "re~rOEsh" i8 a directory list.

- "Help" action. When u~er~ re~uQst help, a help panel i8 di~played to a~sist users to complet~ the dialog.
The help action triggers a help dialog, which is controlled entirely by IET and is further described in a subsequent section.

- Proceed one ~tep (the Enter action).

When users are finished interacting with a panel, it is submitted to ~he application with a specific ac~ion reques~.
The action reque t can be either the enter action or other action which i6 not otherwise de~ined as a dialog control function managed by IET. Examples of how action requests . . ~ . :

: : ., . :: . . , .: , . 1 . . ..
.. . .

`{~

are generated include the use of function keys for non-progra~mable terminals or mouse selection of action items in action bar pull downs on an intelligent work station.

The action request results in the execution of the panel's input procedure. By convention, the input procedure has logic which results in a difPerent panel being displayed, or the same panel with significant data content changes. The application controls the h~erarchical level of the panel from the "input" procedure. The input procedure can daclare thc relative hierarchical level o~ the next panel display~d, such a~ 1, 0, -1, or -2.

"1" mean~ incremant current level by one. The pro~ile view associated with the input procedure is pushed on the se~sion'~ pro~ile ~tack, effectively saving the ~tatC of the panel a~ entexed by th~ u~er. The profile ViQW a~sociated with the output procedure will be placed on the profile stack a~ter tha view ~ust sa~ed. Thi~ option i8 alway~ used for thQ tran~action menu hierarchy.

0 indicate3 the current level is not to be ~odified.
Next panel is displayed at the same level o~ ths hierarchy.
This i~ the default for application panels.

-1 decements the current level ~y one. A pro~ile view i8 popped off the session~s profile stackr recovering a pan~l and view a~ entered by the user. If there are no view~ on the stack for this transaction, then a RETURN is executed (with a comple~ion code of "cancel"). ~his is the enforoed action taken on a "Cancel".

-2 remoYes all saved views which are on the profile stack for this transaction and forces execution of the main menu.

.:
:' : ~' , :' , .
': ' ' ~ ~ ' : . .

.

2~23 ~

"Help" for an application can be invoked at any time.
once invoked, ~he current state of the "Primary Panel"
dialog is saved and a user dialog is initiated which is entirely under control of IET. When the user dialog is complete, control is returned to the state at which the "Primary Panel" dialog was interrupted.

Each data entry or selection field on any panel can have an associated "help" panel. Additionally, the panel itself has a "help" panel. Invoking "help" from the pri~ary panel resulta in ~ield-level help, if available, otherwise panel-leval help (otherwise, help on the help ~ystem). Once within h~lp, there i~ a de~ined set of help actions (e.g., function key6) which provide additional information about application keys, index to help documentation, (glo6sary) help on "selection"-type fields within the help panel, etc.

Information displayed with$n help panel~ are obtained ~rom a documenta~ion system. The docu~entation ~ystem organizes indexes documents by report.generation.chapter.section.page. The following conventions are used to assign document sections to help functions:

- REPORT.GENERATION. For a s~iven combination of nat~onal language and transaction, there i6 a single "report.generation" which includes all application help information. Help functions may al~o invoke the general DAA
help information, which is located on report=DAAHE~P;
generation=(language code).

- SECTION. For panel help information, the section nam~d "SOO" is reserved for extended help information (general information ahout the panel~. All other sections are the name of a data entry "field" or a choice field mne~onic appearing on the panel.

`.,, .:

..: . :, :,. , :- .

.
. .. ::: :~ , - CHAPTER. The chap~er named "GLOSS~RY" is reserved for the following help functions:

- KEYS~ This is a section which describes each ke~ used by the application and its function. The listing does not have to indicate whi~h keys are valid in the current state of the application.

- CONTENT~. This ie a section which i6 also a table of contents of help information, organized by topic.

~ ~ELP. (Only on DA~HELP). Contains "~elp on Help"
information.

The chapter named "MESSAGE" is reserv2d for help on error messages (i.e.~ d~tailed ds6cription o~ each me~sag~
generat~d by the applicatlon proaedures). The sections within the chap~er correspond to the mes6age identifler CodQ .

All other chapters are the same a~ panel names and contain information specific to panels. The help panels themselves are documented on DA~HE~P.

~ elp is available at all times. Availability o~ help informatiQn ~or every application panel i8 validated, by GTD, when the transaction is built.

Within the help dialog, every help panel (with the exception o~ Extended Help panels) provide function key access to Extended Help. The title of help panels contain the word "Help'l and identi~y the panal or field to which it applies.

The invocation of help is transpar~nt to the application :
,' ., ,, ' :~

: ' ~ i '; ' ;
, .

2 ~ 5 procedure and doe~ not interfere with the current dialog.
Data that user had entered before r~.questing help is saved in the user's profile.

The types of help panels are:

HELP. The Help action provides contextual help about a specific field, a panel, or about the help facility. Field help is provided if the cursor is on an entry ~ield or a menu choice filedO ~anel help is provided ~known as "extend~d help") if ~he cur60r is not on an entry field nor a menu choice ~ield. Pan~l help is al80 provid~d if field halp i~ not de~ined ~or the fiQld. Help faoility halp ie provided which HELP ls r~que6ted from a help panel. The help ~acllity help i~ also provided i~ the panel help i8 not de~ined.

EXTENDED HELP. Whan u6er~ rsquest EXTENDED HELP, a h~lp panel app2ars contalning information about the current panal rathQr than a particular Qlement on the pan~l. The EXTENDED
HELP action opti~n appear~ only in help panals.

HELP CONTENTS. When u~ers reque~t help content~, a tabla of content~ appear6, organized by topic, of all th2 help information in ths application. The HELP CONTENTS
action option appears only in help panels.

HELP INDEX. When users request help index, an index of the help in~ormation appears. The help index action option appear~ only in help panels. The HELP INDEX is in the fo~m of a menu of options which pro~ide the u~er access to th~
sections o~ help.

KEYS HELP. When users request keys help, a list appears containing the names and functions o~ all keys us~d by the application. The keys help action option appears only in TI~13766 66 :~ "
,;,. ~ ,., ~ ,. . .
, . . .
:,. . i,,, ,,: , .;, : . ::-.'-' ' : - , ' ~ : : , :: , :
~, , : ; , : : . '-:.. ~:

help panels.

ENDING HELP. Users end help by requesting Exit or by repeatedly re~uesting Cancel to back out o~ any help panel.

While users are navigating through ses610ne, transactions, and panels, information is retai~ed in the profile data baseO The application determines how much information iB actually retained (i.e., the profile view) on the pro~ila data base. The appllcation also determines, within a tran~action, the hierarchical ralationship between panels within a dialog, and cons~qu~ntly the ~lexibility of the u3~r to navigat~ between panel6 within a tran~action.

once a panel is cancelled, a transaction exited, or a sa~sion quit, the information i8 not availabla.
Alternativaly, the "suspend'l exit can be u~ed to save the current in~ormation/state of a s~ssion, which enables reactivation of the session, without data 1085, at any later tim~.

A consisten~ user interface i:mplementation on DA~ is enabled ~rom deflnitions mada by the application designer using GTD. GTD provides the designer with optione to define pan~l~ and implicitly define dialogs. At execution time the dialog management ~unction (IET, TMS, etc.), which is isolated ~rom the application code, implements user-driven navigation action~, ensuring a con i~tent user interface across all DA~ applications.

COOPE~a~I~E PROC~8~ING. Explicit cooperative processing betw~en DAA appllca~ion proce~ures is i~plemented via "LINK"/IlRETURN'l. The mechanics of supporting LINK/RETURN, as well as support of generalized terminal/transaction data interchange, is provided by Distributed Resource Control services within DAA.

. .

: .

Any DAA procedure can execute any other DAA procedure.
The mechanism for executing a DAA procedure is the same whether it is packaged in thP same transaction or a differant transaction, located on the same or dif~erent sy6tem, looated on the same or architecturally different type of proces~or, or located on the same t~pe of tran6action processing monitor or a different (DAA
supported) transaction processing monitor.

~ he sy~tem requira~ that the devaloper has d~insd a unique 8yBtem. transac~1 on .procedurQ name for both the called and th~ c~lling procedure~. ~his en~bl~ thQ ~ystem to accurately deliver any messages between various machines.
~ft~r saving a current state o~ a calling procedure as a profile view, and storing it in a profile data base, the IET
extracts data items from the calling tran act~on view and place~ them in an input view to be shipped to the called procedure. The IET packages thesQ data ite~s, together with the unique called procedure'~ name and the uni~ue calling procedure's name and sends the packet to the called procedure. At the call~d procedure, the IET loads t~e called procedure's profile view and the input view received from the calling procedure. The called procedure executes the reque~ted procedure. The ~ET then extracts the data items from the called transaction view and places them in an output view to be returned to the calling procedure. The IET packages these dat~ items, together with the unique called procedure's name and the unique calling procedure's name and returns the packet to tha calli~g procedure. Th~
IET at the calling procedure extracts the pro~ile view stored in the profile data base and lo~ds it, together with the returned output view into the callinq procedure' 8 transaction view. At this point tha procedure is restarted for further processing.

.

:, ... . .
. .

20.23~3~
The specification for remote procedure execution is made as followsO

- Application procedure includes logic to set "exit state".

Dialog flow specification. As a function of 1'exit state", define a ~low to a procedure. The flow can be a LINK, XFER, or SPAWN.

Thi~ ~tructured approach to ~p~cification o~ procedura execution ls intended to isolate the application logic as much as pos~ible ~rom ~he mechanlcs o~ dialog flow.

There are situations in which it is necessary to selectively execute a specific procedure on one of ~any systems. The logic reguired to make ths dstermination o~
which system should be used to execute a procsdure ~s application-dependent, The applicat:ion has two syste~
variables which it can use to set the syste~tran~aation ~or a procedure: NSYSTEM (next syste.m) and NTRAN (next transaction).

Dialog flow i9 controlled by commands which may originate ~rom the application procedure (as exit ~tates) or ~rom the user. User commands are entered via action requests (e.g., function keys, action bar-pull down choice selections, or commands entered in the command area). Most user comman~s are processed directly by I~T, as defined in the sectiQn on "consistent user interface".

The following commands may originate from the application procedure:

LINX. This co~mand saves the current state o~ the procedure .just completed on the pxofile stack and executes an application procedure which may be in the same or a different transaction, located on the same or dif~erent system. The next procedure to be executed is spacified in the working storage data item ''NPROC'I; the next transaction is in "NTRAN"; and the next system is in "NSYSTE~". The value of the sy6tem and transaction data items are interpreted according to the rules for DRC (Distri~uted Resource Control). The next procedure is passed information via an I~PORT view. The LINX
process is described more completely later.

RET~RN. Thi~ command restore~, from the usQr/session profile, the previous state of the DAA
session thread, returning control to an appllcation procedure which pr~viously requested a "LINK". The procedure to which control is being returned i6 passed information via an export view.

XFE~. This command transfers control to another application procedure. The specification of procedure is the 6ame as for LINK. Unlike LINK, which results in "stacking" the profile view (and information/input views), the XFER command results in discarding the entire stack prior to executing the procedure.
Conse~uently, the new procedure is at the top of the stack. XFER i~ similar in effeot to an "Exit_application" followed by a LINK, with the additional feature that a view is ~o~municated to the new procedure. A RETURN from the new procedure result6 in returning control to the Session Manager.

~ bl~k). This i~ the de~ault exit state. It results in the display of the panel associated with the procedure.

:: .~

. ., . . :

.: .... ~, . ~, ~; ,;
3 3.

Figure 15 shows a model of DAA dialog flow. The model combines "consistent user interface" definitions with programmable dialog ~low commands, and is self-explanatory.

At execution time, an application procedure sets an exit state which is interpreted by I~T as a dialog flow request.
The dialog flow may Rpecify a LINK to a specific PROCEDURE
(optionally qualified by transaction and system). The "to"
procedure o~ the flow has as60ciated with it an external Import and Export view.

Tho ralationship~ betwean DAA application procedur~s, working ~torag~, import vi~w~, and axport viewa ~rQ ~hown in Figure 16. Procedure ~ 184 will be a part of the transaction requesting procedure Z 196 to be exeauted u~ing data from procedure Y 184. The portions of Figue 16 designated 178, 182 are under application control~ albeit possibly separate appllcations. Th8 middla portion, 180, iB
under IE~ (part of pr2ferred Qmbodiment o~ thQ pressnt invention, DAA) control.

Initially ~ransaction Y's working storage 186 is mapped to procedure Z'~ import view 188. The import view 188 i~
then sent to the IET in the "to" load module (not speci~ically shown) containing procedure Z 196. IET, in thi~ module, maps the import view 188 into the transaction Z
working storage 194. At this point, procedure Z 196 is executed. Procedure Z 196 may call upon other procedures and/or interactions with other entities ~such as the originating terminal) be~ore requesting a RETURN. IET, in the load modul~, maps transaction Z's work~ng storage 194 into procedur~ Z's export view 190. N2xt, the export view 190 i8 sent to IET in the "from" load module (also not specifically shown). IET, in this load module, then maps the e~port view 190 into transaction Y's working storage 186. Lastly, procedure Y 184 is executed.

: `
'',~ ~ '` ~ ' `, ' ' ' 1 Communications between transactions consist of messages having the following in~ormation: transaction identif~er, interface control block, and a view.

The usiual transaction identifiers are:

command - This data item indicates, generically, what type of message is being received. It may hav~ one of the following value~:

=IETCONT. Indicates that thls is a DAA transactlon communicatlons control function. This functlon can not be entered manually, i~ can only be creat~d ais a result of an application procedure (or IET) reque6ting a LINK, XFER, RETURN, or SP~WN.

=RESET Indicates that the "consi6tent user inter~ace" RESET func~ion is to be perfor~ed ~or the indicated transaction. This command may be entered manually. Any data following the command is ignored.

=QUIT Indicates that the "consistentl' user interface" QUIT function is to be per~ormed for the indicated transaction. This command may be entered manually. Any data following the command is ignored.

Any other value for the command data item causes a message interpretation to be attempted as if the message had originated from a terminal.

The interface control blocX is a (fixed structure, the same ~or all DAA transac~ions. Within the interface control block, the parameter IETICC is for dialog control and miay as~lDme one of the following values:

,, - ~, . . .

#~LINK&# LINK command.

#~RETN~# RETURN command.

#~XF R~# XFER command.

The View contained in inter-transactional communication is an import view if the command is LINK, XFER, or SPAWN, or is an export view if the command is RETURNo DI~RIB~ED RE80URCE CON~R0~. DRC gen~ralizes the conoept o~ re~ource3 and u~es an architecture (SNADS) which defin~ UBe 0~ de~aults and redirecting to avoid th~
necessity of universal distribu~ion. In general, the DRC
local data base~ are for local use only and do not require any data exchange with other systems. The ~'learning"
function o~ the DRC View Distribution Service (view server~
makes adiustments, as necessary, to referencea of external resource~ in order to optimiza use of the communications sy~tem.

A DAA resource i6 an addressi~ble antity which can orginate or receivs in~ormation dist:ributions. Examples of rssources include terminals and tran~action6.

Entities may be defined for the purpose of normalizing resourc~ definitionsO An example o~ this t~pe of entity is DEVICE, which is used to normalize the TE~MI~AL resource.
The entity DEVICE i~ defined as a re60urc~, even though it is not used as a distribution originator or receiver.

DAA addresse~ re~ources with a combination of ~ystem identifier and resource identifier. The Ret of all sys~em~
and resources within systems is termed the DAA environment.
Each unique instance of a DA~ environment has an identifier (DAA id).

- :,., ' : , `

.
: . : : ,: , . : ,. :
;. . ; , : - : , .: ~ . : , DAA resources are distributed across a heterogenous mixture of systems, network services, terminal/device types, applications, Operating Systems, transaction management systems, and CPUs. The following section dascribes how DAA
manages its resources within its environment.

A system is used to identify the location of resource~.
A sy~te~ has the following characteristics: a homogeneous application proces ing environment, and an uniquely identified node within an SNA network.

In particular, a ~ystem has a single, uniquely identified, transaction processing monitor (e.g., IMS, Tuxedo). The system may consist of multiple CPUs and/or operating systems (if the transaction processing monitor supports it). ~here may be more than one system on a CPU.
The system must be uniquely identi~iable on the SNA network for a specific ~AA environment.

Re~ources exist within the conkext o~ a system. Withln a system, resources must be uniquel~y identified (even if they are different types/ such as transactions and ter~inals). The resource type is an attrihute of local resources (i.e., not part o~ the unigu~ identi~ier/address of the resource).

Resources (e.g., terminals and transactions) within DAA
are addressed by the combination of syGtem and resource-within-~ystem. I~ the system portion of the resource address is specified, a distribution to the resource uses "directed" routing. If the system portion is not specified, then the system is defaulted according to rul~s for "undirected" routings.

Resource identifiers may be reused on other systems ~or di~ferent r~source instances, including different resource types. For this reason, it is recommended that directed routing (i.e., inclusion of system_id) be used, where possible, for information distributions.

~ transaction is the controlled u~e of a collection of resources to perform a business application function. The integrity of resources (e.g., data bases) are maintained per logical transaction. In DAA, a logical transaction must be contained within a single execution of a physical DAA
transaction on a single system.

Transactions can remotely execute other transaction/procedures. Data exchange with tha remotely executed transaction is defined via input/output view~. A
tran~action procedure ~pecifies ramot0 procadure executlon via a ~INK command, passing an INPUT view. When the remote procedure i~ complete, it perrorms a ~ETURN command, passing an OUTPUT view bacX to the originating transaction.

Transactions ~u~t have a uniqu~ re~ource identlfi~r within a system. The same transaction re~ource id can be used for different purposes on a different system.
Therefore, it is recommended that references to transactions on remote sy6tems include the remote system identifier.

Transactions are resources which are tightly controlled and totally integrated into the DAA environment. Utilities (GTD) exist for automating the constxuction of transaction~.
A runtime en~ironment envelops the application transaction providing DAA services transparent to the application code.

A terminal is a collection o~ resources which are used to inter~acQ to a user. A terminal normally consists of a VDU output device, and some combination of keyboard/program/voice/bar code/mouse inputO Other terminal ' ' ,'", , ~
' .'., . ' ' ' :
'i'' ,' ".'.. ' . , ' ', :

, '.''.','' ~' ' '' ~.' , . ' ' .
:. ., , ~ ', ' . '. ' configurations are possible.

Communications with a terminal is via 3270 data stream protocol, which supports a wide variety of output and input devices. Each device supported has a set of functional characteristics which represent a sub~et of the total 3270 data stream protocol. In order to assure meaningful output to a given device, the 3270 data stream generator (TMS) must know the generic device type of the terminal.

~ ik~ tran~actions, a terminal must have a uniqua re~ourca identifi~r within a system. A te~minal re~ource identifier can be r~ u~ed on a different system. It i8 r~com~ended that remote terminals be identified u~ing both system id and terminal id.

In order to normalize the de~inition of TERMINAL
resourc~, an entity type DEVICE ha~ been established which contain3 the d~vice attributes relat~d to a given terminal.
Tha D~VICE - TERMINAL relationship can be pictured as:

Communication network~ are not a (vi~ible) component o~
DAA. The mechanics of network operation i~ totally transparent to D~A applioations. A multi-system DAA
application may a~sociate system identifiers with remote transactions, but does not need to comprehend the path betwe~n a local system and remote systemO All tenninal interface ~unctions are handled by TMS/~ET (transparen~ to DAA application procedures), which comprehends terminal device types and system location.

The data exchange between SYSTEMs within a DAA
environment is implemented utilizing System Network Architecture Distribution Services (SNADS).

The co~munications system capabilities implemented ",,:,, " `~ :,, ";

.

within SNADS and other DRC components include:

- (Dynamic) path determination and optimization.

- Store and forward queues at intermediate node~.

- (Automated) maintenance and distribution of topology data bases.

- Data exchange based on SYSTEM identi~i~r only (i.e., no knowledge rs~uired o~ intermediate nodes).

- Self learning for routing to "newl' ~ystems and resources.

- Notification to requestor if re~uast not completed.

The DRC co~munications 6y6tem doe~ not require any informatlon from the application other than system id (which is optional) and resource element id.

The local data base maintenance re~uiramen~s are minimized through Use of de~aults and automated "learning".
Extensiva administrativa function~ are available to track data distributions and disposition unserviced distribution requestsl DAA will dynamically update resource routing tables to correct or re.olve "Des~ination Service Units" for any given resoUrce. This ~unction is built into the DRC Vi~w Distribution Service.

The pre~erred embodiment of the inter-relationships between various components usad to implement DRC according to the present invention are shown in Figure 17. The portion of Figure 17 designated 184 is located in traneaction ... .. .

.. ..:: .:., , :, ~ . ::
,. : . : ~::. :: :. ~ . ; ::
~ ' ' ~:: : ,,.

. : .
,,: ~ :

~ ~ 2 '~

proce6sing address space and that portion designated 186 resides in IEC address space. As can be seen the DRC View Distribution Services (or view server fox short) interfaces between the defined SNADS protocol boundary and a DAA
tran~action represented by IET.

Data exchange between transactions is driv~n by LINK and RETURN co~mands is~ued by DAA application transactions. The logioal flow of control and data associated with the LINK/~ETURN implementation is shown in Figure 18. The following paragraph~ outline the role~ o~ distribution hetwe~n application tran~action orlglnator 190 o~
or~ginatlng sy~em 187 and appllcation trans~ction receivQr 202 of receiving system 188.

An application procedure within a transaction 190 initiates a data exchange with a remote transaction 202 by iBSUing a LINK command and specifying an INPUT view (not shown) which iR to be communicated to a remote SYSTE~/TR~NSACTION 88. IET ~in the tran6action address space) saves the INPUT view (and, transparent to application, an INTERFACE view) on t:he transaction PROFIT~
data base. The view on this PROFILE clata ba~e is referenced as a view relative to top of ~t:ack for a particular combination of USER and APPLIC~TION. IET initiatQs the distribution of the views by passing the LINK command to the View Server l9~ (along with ~he User and Application identifiers).

The VIEW server 194 accepts the LINK command, along with its parameters, and processes the request asynchronously to IET (which exits). The VIEW server 194 uses the PROFIL~ DB
192 as tha "gueue" of data which is to be sent ~ia SNADS.
SNADS operates as an intermediate system routing. In the profile VIEW (not shown) is an identification of destination system 188. Based on the strategy defined within SNADS 196, ::, :;
, ~ : . ' :.: - , ~ , : : :
: : ,. : , . , 2~2~

the distribution (view) is sent to the destination system 188, If the remote transaction execution completes success~ully, a returned OUTPUT VIEW will (eventually) be received. The VIEW server 194 receives tha VIEW, puts the VIEW to the PROFILE DB 192, and queues the TRANSACTION to run under the local transaction processing monitor.

The VIEW size is restricted only by the VIEW siz~
allowed on the PROFILE DB 192 ~2 gigabyte). The APPLICATION
is not required to blocX~de-block data exchanges having large byte counts. Furthermore, there i~ only one TRANSACTION execution per logical data èxchange.

The view server 200 ~on the destination system) receives the INPUT VIEW (also not shown) , pUt5 it immediately on the PROFILE DB 198 , and queues the TR~NSACrION to run under th2 local transaction processing monitor. The TP Distributor serYe~ as the interface between DRCVDS 200 (view distribution s~rvice) and tha Transaction Proc~ing Monitor. In the case of IMS, this prsgra~ i3 ~ continuou~ly running B~P. In the case o~ a UNIX TP, the TP Distributor is a function embedded in DRCVDS. If TRANSACTION does not exist, then a return OUTPUT view i5 constructed with suitable complation code~ and s~nt back to the application transaction originator 190.

Non-existent remote resources, and other types of di~tribution arrors, are reported ~rom either the remote VIEW server 200 or SNADS 196 . The local view server 194 will receive these distribution exceptions and propogate them to the distribution originator 1~0 (i.e., a D~A
transaction). The re6ults of completed remote transaction 202 may bP returned, when view server 200 accepts a RETURN
command, along with its parameters, and the whol~ previous process rev r~es. The OUTPUT VIEW travels back to SNADS 196 routed ~or system 187. View server 194 receives the VIEW, - : ,.,, .~ .
,;,, : : ~.,, . , :. ~.~ : ., , ,: .:. , ~ :

2~2~3:~

put~ it into khe PROFILE D~ 192, and queues the TRANSACTION
to run locally.

All local terminals on a system are identified as resources. Each terminal has a specific set of device characteristics. These device characteristics are required by TMS in order to properly construct 3270 data streams destined for the terminal. Unless the terminal is local, the device characteristics are not available through tha local resource directory. Support of remote terminals is further complicated by the inability o~ a tran~action processlng monitor to route data to terminal~ outside o~ its environment.

The logical flow of control and data associated with data interchange between terminals and tranaactions ar~
shown in Figure l9. ~ terminal first converse6 with a DAA
transaction 208 on the local system. If this transaction performs a LINK, the terminal device attribute~ ar~ pas~ed to tAe remote ~ystem along with the user-6peci~ied INPUT
view~ When the remote transaction re~ue~ts distribution of a 3270 data ~tream to the terminal, DAA ma~ter menu remot~
switch reaognizes that it is a non-loc:al terminal and is6ues a LINK to the DAA pseudo-transaction "TERNINAL" 210 (which i~ im~lemented within tho TP Di~tributor program).

The TP Distri~utor 210 receives the 3270 data stream (a lt6 INPUT vi~w~ and forward~ it through the local tran~action proce~sing monitor 212 to the terminal 216.
Data entry from the terminal 216 is routed through the TP
Collector 218 (which may require a /SET ~RAN on IMS). The TP Collector 218 passes the 3270 data stream through (via RETURN) to the remote transaction. It is transparent to the D~A application whether the terminal 216 is local or remote.

If the remote transaction issues further LINKs, the : ~ : : : ::
: . : ~ : :
:.. ~::: :. : : :

~ ~ 2 ~?~ ~ 3 ~

terminal attrihutes are forwarded to the next (nested) DAA
transaction. Multiple RETURN will ultimately RETURN to the terminal's owning system.

Part of the interfaoe view associated with the LINK
contains the TERMINAL id, the terminal's SYSTEM id, and the terminal's generic device type. This information i8 U ed in any LINKed transaction, and will be propogated to othsr LINKed transactions. In DAA, only local tran~actions can be executed without a LINK. Local transaction~ obtain terminal charact~ristic~ directly from the lccal resourc~ directory (SNADS data ba6e).

TRANSACT$0Ns send data to terminals via the VIEW server.
A transaction generates arbitrary length 3270 data stream using TMS (and ~D~). The~e data streams ar~ queued to the PROFILE data bas~. A request from th~ tran~action to th~
VIEW server initiate3 the transfer of queued 3270 data streams to a TERMINAL. If the termin~l i8 local, the data stream ~s inserked directly to the local traneaction processing monitor. In all other cases, thQ queued 3270 data stream is transmit~ed to a view server at a remote system. The mechanism is identical to the processing of INPUr/OUTPUT views, but the INTERFACE view is constructed automatically by the VIEW ~exver and contains a pseudo-transaction identifier of "TER~IN~L". The pseudo transaction "T~RMIN~L" is implemented as a function built into the view server (it inserts the 3270 data stream to the local ~ransaction proces~ing monitor).

In the case of unsolicited output to remote terminals, 3270 data streams must bs created for a terminal with unknown device attributes. In this case, TMS generates a 3270 data stream for the most capable device. When the data stream is processed by the "TERMINAL" transaction, it is passed through a filter which strips or converts control -: ,.,: - : -: .. : :. , .
. ~ : : . .. :: . -. . -, : ~ :
: . :,, ,, : .:
:~' :: . ' ,~
'' :
. . ~

~ B~
2 ~ 3 ~

sequences known to be illegal for the device.

D~C~DS -- VIEW DI~TRIB~TION ~ERVICE~; . DRCVDS is the Dlstributed Res~urce Control View Distribution Services, also referred to as ~he View server. The VIEW server combines the functions of profile management, distribution services, and resource management (including TP
moni.tor-controlled transactions and terminals) into a single interface for DAA transactions (via IET~. View distribution is implemented by combining the distribution services of SNADS with t~.e view storage and retrieval functions of the pro~ile management data base.

The view server does not have it~ own data base; it useB
the SNADS data base ~or resource control information and the profile managemen~ da~a base (user and roll ~iles) ~or view ~torage and rQtrieval.

The view ~erver acts as the interface betwaen application transactions and the operation functions of SNADS. The viaw server augments SNADS by dyna~ically foeding back "learned" information about users (i.e., reæources~. This feedback is intended to improve network resource utili~ation, performance, and response ti~ee. This feedback ~eature will be most e~fe~tive when ~u~ficiently detailed routing tables are constructed at each DSUN.

Th~ view server dispatches distribu~ion information to local resources. ~he resource types currently recognized by the dispatching function include device, terminal, and transaction. The list of supported resources is easily extended, with the only software impact being the logic required to service a specific local-delivery queue. Each resource is generally associated with support of a DAA
concept or capability. As new concepts are added to DAA, the VIEW server will be extended with explicit support for : ... .:: . : , ;~

J.;~l the associated new resource groups.

Each resource is identified as being local or non-local.
Each local resource has a local-delivery queue. The name of the local-delivery queue corresponds to the resource type (and consequently to ~he dispatching logic used to service the local-delivery queue). The name of local delivery queue must be explicitly recognized by the vlew distribution service as a supported resource type.

Each local re~ourc~ has a security coda. This code may be us~d by the resource specific dispatcher to disable di~tribution~ of s~cure data to un~ecured re~3ourc~s.

Resources may have additional resource type-dependent attributes. These attributes ars normally only used for local resource,s. When raquired by remote transartions, these attributes are normally passed with the interfacs view acco~panying a LINK function (this is the technique for distributing terminal/device attributes to a remote transaction).

Transactions are dispatched by inserting the appropriate portion of the distribution information units to the local transaction processing monitor (.e.g., IMS, TUXEDO). The concept of "local~' varies according to ~he transaction processing monitor. For IMS with MSC links, '~local" can be any global I~S tran~action (note that there is a limit on data length if transac~ion is not local to IMS system).

Terminals are dispatchad by inserting the appropriate portion of the distribution information units to the local transaction processing monitor (e.g., IMS, TUXEDO). The concepk of "local" varies according to the transaction processing monitor. For IMS with MSC links, "local" can be any global IMS lterm. A physical terminal may be identified :: . . . : : , ,. ~. . , : :. .: :~ ': ', `'~' ~:': . " ' : , :: . .

:, :: . :;
.: : .-2 ~

as multiple logical terminals, each (possibly) with different device types and associated with di~ferent host systems. Each logical terminal can appear to the user as a window at his phyæical terminal.

Device is a resource type which does not support dispatching. Devices are present as resources Por the sole purpose of normalizing TEgMINAL attributes. Any attempt to dispatch to a device will result in a distribution error.

DEVICE resourcQ in~ormation characterizes a devlca type, including its generic device type name, devi~e attributes ~upport~d, and size o~ display. The DEVICE table i8 assummed to be identical across the network (and infrequently changed). ~he table is implemented as a resource table with local entries only. The information in the DEVICE table may be used ts dispatch TERMINA~
dis.ribution, in particular if a 3270 data stream filter is required because the originator did not know the local terminal's device attributes.

` . , '," `.'',;~ `' :'~ '`,,, ,''' ~':"

, .
` ' : ' ~,~ .'' . , . , , :

2 ~
TRANSACTION DEFINI~ION FILE
Before considering the GTD in detail, one aspect of its input and storage, the use of a Transaction Definition File ~TDF), should be considered further. Prior to the DAA of the present invention and its transaction generator program, GTD, a programmer was required to provide his own job decks to compile all the appropriate procedures and screen maps.
On a 370 mainframe this could consist of several JC~ decks or TSO clists. On UNIX a programmer would have a make file containing instructions on compiling and linking all the correct parts.

With GTD, a programmer never needs to build such files because GTD builds and maintains the TDF. This TDF is an integral part of GTD which contains all of the information necessary to compile and link all the correct components of a given DAA transaction. The programmer simply uses GTD's menus and screens to add and delete the appropriate components; GTD files this information into the TDF.

The TDF is a file of records used by GTD as the "blueprint" for constructing a DAA transaction. The content of the TDF is created and maintained by the application developer using the GTD tool. The TDF is used by GTD to assist the programmer in the edit of his procedure code, panel maps, and menus. Once these components have been edited, the TDF is used by GTD to compile and create various object modules that are link~edited, along with the IETr to produce a transaction load module.

The TDF consists of the following types of records:
header, first header extension, second header extension, panel, procedure, menu and language. Each TDF will have only one header, first header extension and second header ': , ':' : : :
:

1 ^ æ~
2~2~
extension, in that respective order. Each TDF will also contain at least one panel, procedure and menu record and they will be in no particular order~ The presence of language records in a TDF is optional.

Each record is of variable length. Trailing fields in a record which do not have a value will not be stored. On platforms suppor~ing variable length record constructs, the LLZZ field is not explicitly stored as data. On other platforms, the LLZZ field is stored as data to support variable length record constructs.

Below is a field level summary with each record name given, followed by the length of that record and a brief description of the record.

HEADER~
LLZZ, 4, Length of record.
GTDHRTYP, 1, Record type. Value should be 'H' GTDHMEM, 8, TDT name.
GTDHMTYP, 1, TDT type. Value should be 'D'.
GTDHDR, 8, Documentation report name.
GTDHDG, 8, Documentation generTtion name.
GTDAPPL, 4, Application name.
GTDRELN, ~, Release number for application.
GTDLLIB, 46, Load library pathO
GTDLMEM, 8, Load library member name.
GTDOLIB, 46, Object library path.
GTDOMEM, 8, Object library member name.
GTDSLIB, 46, Source library pathO
GTDCMEM, 8, Transaction view name.

. . , . :, ,, , ~ , .. :.:, ,~, . . ..
. .~ :
,: :,, ,. :-i , , . ~,.,; ~

. ' ,, : ~, ,, r ~: ':: ., ' ; : ' ~ ~- 2 ~

GTDDLIB, 46, Data base library path.
GTDDMEM, 8, Data base library member name.
GTDNLIB, 46, Con~rol library path.
GTDNMEM, 8, Control library member name.
GT~LEOPT, 50, Linkage-editor options.
~TDGOF, 1, Generation option flag. Values are 'Y' and 'N'~ When value is 'Y', put "OPTION:" field on menu, help, info, glos, and panel.
GTDGLF, 1, Generation look-ahead flag. Values are 'Y' and 'N'. When value is 'Y', put "LOOKAHEAD:"
field on panel.

FIRST HEADER EXTEN8IO~:
LLZZ, 4, Length of record.
GTDHEX1, 2, Record type. Value should be 'HX'.
GTDHEXlN, 2, Extention type. Value should be a binary 1.
GTDCDSNl, 46, Extra copy/header library path.
GTDCDSN2, 46, Extra copy/header library path.
GTDCDSN3, 46, Extra copy/header library path.
GTDCDSN4, 46, Extra copy/header library path.
GTDXLIB, 46, Debugger symbols.

SECOND HEADER EXTENSION:
LLZZ, 4, Length of record.
GTDHEX2, 2, Record type. Value should be 'HX'.
GTDHEX2N, 2, Extension type. Value should be a binary 2.
GTDLDSNl, 46, Extra load library path.
GTDLDSN2, 46, Extra load library path.
GTDLDSN3, 46, Extra load library path.
GTDLDSN4, 46, Extra load library path.
GTDLDSN5, 46, Extra load library path.
GTDLDSN6, ~6, Extra load library path.

''- :.. '': ~;,~,.:; . ' ' :.,' , ':

2 ~ 2 ~ ~ 3 ~1 PANEL: (one instance per panel entry) LLZZ, 4, Length of record.
STDETYP, 1, Record type. Value should be 'P'.
STDENAME, 8, Panel name.
STDESEL, 8, Unused.
STDEIPNM, 8, Input procedure name.
STDEOPNM, 8, Output procedure name.
STDEPVNM, 8, Unused.
STDEDESC, 32, Panel description.

PROCEDURE: (one instance per procedure entry) LLZZ, 4, Length of record.
STDETYP, 1, Record type. Value should be 'C'.
STDENAME, 8, Procedure name.
STDESEL, 8, Unused.
STDEIPNM, 8, Input view name.
STDEOPNM, 8, Output view name.
STDEPVNM, 8, Profile view name.
STDEDESC, 32, Procedure description.
STDERSVl, 4, Reserved space.
STDECCBM, l, Unused n STDECDB2, 1, Data base flag. Values are 'Y' and 'N~.
When value is 'Y', procedure has data base processsing.
STDECXPD, 1, Debugger flag. Values are 'Y' and 'N'.
When value is 'Y', procedure will have debugger processing.
STDECTYP, 8, Procedure type. Values are 'COB2', 'C', 'ALC', 'ENTRY', and 'EXTERN'. When value is 'COB2' the procedure is a COBOL procedure.
When value is 'C', the procedure is a C
procedure. When value is 'ALC', the procedure is an assembler procedure. When value is 'ENTRY' the procedure is an entry point. When value is 'EXTERN' the procedure is an ext~rnal entry point.

, :, " ~ , ' . :,~ , ;

: :
.::

STDELOPT, 60, Language options.

MENU: (one instance per menu entry) LLZZ, 4, Length of record.
STDETYP, 1, Record type. yalue should be 'E'.
STDENAME, 8, Menu name.
STDESEL, 8, Selection value for menu item.
STDEIPNM, 8, Panel name to invoke.
STDEOPNM, 8, Procedure name to invoke.
STDEPVNM, 8, Unused.
STDEDESC, 32, Menu item description. Value is used during display.

LANGUAGE: (one instance per language entry) LLZZ, 4, Length of record.
STDETYP, 1, Record type. Value should be 'L'.
STDENAME, 8, Language name.
STDESEL, 8, Unused.
STDEIPNM, 8, Report name for documentation.
STDEOPNM, 8, Generation name for documentation.

,~ . , , . , .. , : - . .

- : : , : ' -. ': : .: ' ' . . .
: ., . ~ . : :: :- ~
,: , ... ., ,.' , ~, :

~2~
GENERAT~ T~AC~ION DEFINI~ION (~TD).
Accordlng to the preferred embodiment of the present invention, the Generate Transaction Definition (GTD) system i8 a semi-automated facility for defining and managing applications operating in a DAA environment. The system runs under TSO, UNIX and OS/2. ~TD allows the designer to specify those elemen~s of a transaction to be included in the transaction load module, so the transaction can be constructed and placed into operation within the D~A
environment.

A GTD-generated transaction includes drive routines (part o~ the IET module) that manage the coordination of panels, procedures, and views in the run-time environment.
This set o~ routines interfaces with the Information Engineering Controller (IEC) facilities installed in the run-time environment to support execution. GTD sup~orts the editing of the Transaction De~inition Table (TDT~. The TDT
contains the specific relationships and the identification o~ the ob;ects to be managed by the transaction.

The designer specifies the libraries or directories where the generated objects are to be maintained, identifies the specific documentation repository(ies) associated with this transaction during its execution and specifies the panel~, procedures, and view~ to be included within thi6 transaction. Menu entries a88ist the user in the selection o~ the functions included in this transaction.

The GTD system is also adapted to generate system-provided panels; generate prototype panels and procedures; compile TDT's, panels, procedures and view :
bind the transaction load module; deploy homogeneous transaction load modules; and deploy heterogeneous transaction source.

,. ' ~.,`~ ;
.
.
~. , . : ~, ,:

. 3 :~
In the preferred embodiment, the GTD system interfaces with other utilities such as CODESTAR and RINQ. CODESTAR, for example, supports data base BIND, panel editing and compilation, as well as source program editing and compilation. RINQ inserts the generated LOAD module along with its data base references into the target system. It should be realized that other comparable utilities may be employed instead of those mentioned, and that these particular utilities are merely a matter of design choice.

To develop an application using the GTD system, the designer must allocate a set of libraries or directories to support the maintenance of the objects comprising the application. In a preferred embodiment of the present invention, the following six libraries/directories support GTD-developed applications:

MAPLIB maintains TDTs and panels to be used by the application.

SRCLIB maintains source code, copy code, views, and macros to be used by the application.

OBJLIB maintains intermediate object modules which result from assemblies and compiles of application objects. These objects can include TDTs, views, and procedures.

LOADLIB maintains load modules for panels, procedures and ~he created program module containing th~
executable code for each transaction.

DBRMLIB maintains DB2 Data Base Request Module (DBRM~
generated as a result of data base access calls in associated procedures (DB2 only).

:.: ,. ~ , :-.:
' ::~ : : ;':: '.: ' , ; ` :;

. .

CNTLLIB maintains control information associated with DB2 applications (DB2 only~.

It should be noted that while six libraries arP disclosed, in the preferred embodiment, more or less may be employed.
Additionally the names given these libraries are a matter of design choice and the present invention should in no way be limited to these names and libraries.

Typically an application would be maintained in a set of libraries with data set name directory prefixes representing the application project. The last node would be the library or directory names specified above. When a new TDT is being created, the designer must specify the MAPLIB containing this TDT and must supply a 1-4 character name for the TDT.

Upon initial use of a TDT name, the GTD system will assume all of these other libraries/directories have names with the prefixes as specified for MAPLIB and will generate a TDT profile based on these assumptions. The application designer is then able to make adjustments to the library names in the TDT profile. These specifications will be maintained within the TDT. As the designer requires further maintenance action for this transaction, the library/directory names will be referenced and used for the requested functions.

More specifically, the MAPLIB library/directory maintains information defining the TDTs which describe the transactions being developed, and maintains the panels (in source format) to be used by the transactions. Each TDT
within MAPLIB is assigned a 1-4 character name. In the preferred embodiment, certain objects within the GTD
library/directory set are named by extending the TDT name by .

, ~ , 2 ~ 2 ~
up to four characters to define unique 8 character object names.

The panels maintained within MAPLIB can be developed from "scratch" using any map editor, such as the CODESTAR Map Editor, or may be generated by the GTD facility. The GTD
facility can generate the panels as system-provided panels (e.g., MENUs, HELP GLOSSARY and INFO panels), or as custom panels in skeleton form. Furthermore, panels may also be developed by copying a panel similar to a desired panel, and editing the panel using a editor such as the CODESTAR
Editor.

The OBJLIBN library/directory is used by GTD as an intermediate storage for object code versions of various elements of the particular transaction being defined. These i~termediate objects include the TDT, the view member, and COBOL (or other language of choice) procedures as they are compiled. This library/directory is normally transparent to the user.

The LOADLIB maintains the load module format objects as developed by the GTD system. In particular, it is the final repository for the load module representing the completed transaction. The load module is placed in this library/directory by the GTD `Bind Transaction' process.
Format objects are placed in LOADLIB by a panel and procedure compiler (such as the CODESTA~ Panel and Procedure Compiler~, by the GTD panel and procedure compiler, and also by the GTD `Bind Transaction' process.

The SRCLIB retains the source information for a GTD
transaction and maintains the transaction, profile, input, and output views as source members. This source information can be COBOL, C, or Assembler source, COBOL copy code, Assembler macros, C header files, or source versions of the .
,: i:; ., ,-i. :-- . . ..
! ' r "~
2023~3:~
various views associated with the transaction.

The DBRMLIB is a standard DB2 DBRM library. It is an operating system-partitioned data set used as an intermediate receiving library for the DBRMs created by the DB2 pre-compiler. ~his library is required to support DB2 applications built with the GTD facility. A similar library would be needed to support other data base management architectures if a DB2 pre-compiler is not used.

The CNTLLIB is a standard operating system library used to maintain control information, particularly in support of the DB2 bind process. The CNTLLIB defines the control structures of the DBRMs used for the DB2 bind process.

Table 1 lists the GTD Library Specifications for the S/370. It depicts the relative organization~ record formal, block size, logical record length, moderate size and moderate number of directory blocks of the various libraries discussed above.

,: . ,, ~ABLE lo Gq~D LIBRZ~RY ~;PECIFICATION5 FOR S/370 +________+________+____.____+________~________+________+_____ LIBRARY
_______+_____ +______+_______+_______+________ MAPLIB SRCLIB OBJLIB LOADLIB DBRMLIB CNTLLIB
_______~______+______+_______+_______+________ organization PO PO PO PO PO PO

_____________________________________________ Record Format VB FB FB U FB FB
_________.____Y______________________________ Block Size 6004 3120 400 19069 3120 400 _____________________________________________ Logical Record 400 80 ~0 256 80 80 Length ---------------------------------------------Moderate Size 15 120 30 60 15 5 (3380) tracks) ---------------------------------------------Moderate No.
of Directory 30 30 15 30 10 S
Blocks Infor~ation Eng~noering Controller ~IEC) Support. The IEC is an address space that interfaces with GTD-generated applications to provide environmental control support for those applications. The IEC supports several critical functions for GTD applications, including: system name support (function 9~, DAA environment definition (function 5), profile management (function 7), documentation management (function 1). The function numbers for the preferred embodiment provided and referred to are strictly design choice and should in no way limit the scope of the : .~ ~ ; .: :. : : :

2 ~
present invention.

IEC system name support function enables transactions to determine the name of the system on which the application is running. The system name is then used by the GTD
application for presenting output panels and determining whether a panel input to an application, adapted to run on multiple systems, is executing on the specified system.

If the transactions are not operating on the proper system, the GTD runtime controller (IET) uses the system name on the panel and the DAA environmemt definition, also known as the Distributed Resource Controller (DRC), to determine the system type and routing specifications to route this transaction to the desired system. System name and type information (strictly design choice as to name of function, usually language dependent) is presented to the application via the following data items:

COBOL C
System Name IEFl-SYSTEM wsystem Syste~ Type IEFl SYSl'YPE wsystype The IEC's DAA Environment Definition function specifies the environment in which GTD applications operate. It allows the user to define the charac:teristics of the devices included in the DAA network, to define the terminals allowed to interface with the systems within the DAA network, and to specify the systems included within the network.

A GTD application uses a function 5 request to extract data, such as the ~ollowing, Erom the IEC tables: device characteristics of the terminal from which an input response is received and device characteristics to which an output response is to be deliveredO At run time, these dynamically modi~iable terminal characteristics are used to interpret an :, , , : .

.. , , . ........................... . , - :

. . .

incoming message from a terminal, determine the output device characteristics, and prepare an appropriate output stream.

The environment specification is extracted as the input message is received. The characteristics of the terminal at input time are determined from the IEC Table via a function 5 request. This same terminal characteristic set is used for preparation of the output message. This minimizes the overhead for each transaction. However, it does offer the possibility for terminal characteristics to change during the transaction execution. If the terminal characteristics change it could cause temporary anomalies, but not integrity problems.

The IEC profile management function supports the Profile Management Facility. Each transaction maintains a profile view in the IEC ROLLFILE as a scratch pad. The profile information is structured in the IEC address space (hereinafter referred to as the "ROLLFILE" ) . The primary key is the user identification, while the secondary key is the application identification (also known as a transaction code).

The profile information is maintained in a push-down stack within the IEC space as multiple views are created for a given user/application. Information stored in the ROLLFILE includes: data extracted from tha transaction view when a transaction procedure is completed; any input message received by the HELP facility when a user activates the HELP
documentation; the interim HELP profile views as the application suspends execution between the viewing of pages in the HELP documentation; interface views for any applications invoked through distributed calls betwe~n systems.

, ~

When a transaction procedure completes execution, the profile view is extracted from the transaction view, and written to the profile address space in the IEC ROLLFILE.
When a transaction input is received for a given user and a specified application, the profile view is extracted from the ROLLFILE and is written to the transaction view. The profile view provides a transient scratch pad to save critical parameters between transaction executions for a given user/application on the specific system.

Each user may have multiple application profiles maintained within the ROLLFILE simultaneously. This collection of applications can be thought of as an electronic work desk for aach given user. Each user may also have an electronic work disk active on multiple systems within the network simultaneously.

Profile management is also extended when an application invokes the HELP facilities. When this happens, the profile view and the input message received by the HELP facility when the user presses the F1 key are captured and saved in the ROLLFILE. The profile view and input message are restored when the user exits HELP. Furthermore, if the application suspends execution during the viewing of the pages within the HELP documentation, the interim HELP
profile is also maintained in the profile address space.

Profile space within the ROLLFILE is also used as a storage mechanism for maintaining the interface views for applications invoked through distributed calls between systems. These interface views are stored in the ROLLFILE
to return control to the appropriate system.transaction.procedure when a called application completes processing and prepares to return to the calling system.transaction.procedure. Each interface view stored as a Profile view within the ROLLFILE maintains an 1 ~ . . . .
: ; ~ , ; . -.,: . .
.

,: , : ;

~ 2 ~ ~ 3 ~

identification of the calling system.transaction.procedure and the called system.transaction.procedure. This interface view is stored both in the calling system ROLLFILE and the called system ROLLFILE. This thereby supports the return of control from a called procedure when a RETURN exit state is set, and supports the forward tracing of control is the user restarts a transaction suspended by the system, indicated as `EXTENDED DISTRIBUTED PROCESSING IN PROGRESS'.

Gq!D TRAN~CTION PARAM~TERf~ WITN IllS . Appl ications built using the GTD facility that run under IMS are provided input parameters for accessing the transaction view (containing such data as panel information), the Input/output Program Control Block (IOPCB), alternate IOPCB, and the Program Status Blocks (PSBs) for accessing DL/1 data bases. The IOPCB contains information necessary for prop~r transaction processing, such as terminal and user identification. Furthermore, the IOPCB must accompany every call back to the transaction processor.

To provide the transaction view as the first parameter, the other parameters in the normal IMS parameter list are offset by one position. The particular order of the addresses in the parameter list passed to the application are: the address of the transaction view, the address of the IOPCB, and lastly the address of the alternate IOPCB.

Other parameters in the list are the PSBs specified by the INS application accordiny tu the SYSGEN. These are also offset by one position. Furthermore, GTD applications can only support 64 PSBs including the transaction view.

GTD P~nsl. A panel within the GTD application supports a presentation of information to the user, typically on a display screen such as the IBM 3270 video screen. The screen presents output data from an application a~d accepts .,, , :
:: :: . , : . . ; , : ~, ~: -, : :

2 ~ 3 ~
input data to that application. Each panel has a unique 8 character name within the TDT and the MAPLIB
directoryjlibrary. Each of these panels has an input and output procedure associated with it.

The input procedure, a mandatory procedure, is invoked when an input panel is received by a system from a input terminal or process. When an input panel is received, the panel name is placed in the TDT and the associated input procedure is given control by the IET runtime driver. This panel/input procedure relationship is specified using GTD.
The input procedure is also defined using GTD. The source code for the procedure may be edited by selecting E (=Edit), or any other specified designator, for the desired procedure.

The output procedure, on the other hand, is an optional procedure which may be invoked prior to displaying a panel requested from a menu, or may be invoked upon the restart of an application suspended for HELP documentation presentation, in order to refresh data to be presented on the panel prior to actual output display of the particular panel. This panel/output procedure relationship is specified using GTD. As with the input procedure described above, the output pxocedure must also be defined using GTD and the source code for the procedure may also be edited by indicating the E(=Edit) selection for the desired procedure.

The output procedure is typically used to retrieve data from data bases prior to actual display of the panel. For exampla, an inventory transaction may have a part number saved in the profile view, however, prior to display of a panel of information relative to this part number, data base calls may be required to complete the output panel.

- .: . .
.. ,, . . ~. ~ . :, . ~
'~ ' .

r~
2~2~ ~ ~J~
The output procedure may execute during the restart process after any HELP sequence has completed (F1=EXITHELP).
The output procedure may also be invoked when a panel is presented as an initial user request from a menu. An output procedure can be specified on the menu entry specification, or may be associated with the panel on the panel specification. If an output procedure is specified on a menu entry, this procedure will be invoked prior to the display of the panel. I~ the output procedure on the menu entry is left blank, the output procedure on the panel specification will be invoked. If both are left blank, the panel will be presented from the data in the transaction view as populated from the profile view.

G~D M~ CONTRO~ ~Y~EM. The Menu Control system for GTD
applications is analogous to ISPF menu functions. The system supports four levels of hierarchical menus, with each level supporting 1 to 16 entries. Each entry on a menu is characterized by an 8 character selection code and a 32 character description to indicate the function offered by this selection code. Generally, when a transaction is initiated, the Naster Menu is present:ed to the user for an initial selection. At any time during the execution of a transaction, the user can press the F12 key, or enter an equal siyn `=' in the select field on any menu panel to return to the Master menu. It should be noted that the F12 & "=" keys are selected only as a matter of design choice and are not to be considered limitations of the invention.

The user can make a direct reguest to a function within the menu hierarchy by entering "tran=select.sPlect.
select.select" up to the four level specification capability of the GTD system. Shorter selections of 1, ~ or 3 select codes are also acceptable.

.,. . , ~ ,. . .
:- - ,, :

:' . . .: '. - '~ ~ ~
:: .:
: . : .
....

r~
2~23~1 When menu panels are created, entries are specified to indicate the select code, the descriptive line for the menu entry, the panel that can be presented, and the procedure that can be executed prior to presenting the panel itself.

~ E~P ~PPORT FOR GTD APPLICATION8. When an application is developed using GTD, the TDT can specify a TIOLR
report.generation containing the transaction documentation.
The information in the TIOLR report.generation is structured so a chapter name can reference a panel name to provide multiple sections and pages of documentation associated with each transaction panel.

The documentation is presented to the usedr of the application at run time by pressing the Fl key. The key causes the control program to collect the information on the user screen and store it in the RO1LFILE as a HELP view.
The control program preserves the profile view for the transaction and presents the ~ELP documentation for that transaction to the user through a HELP panel. The panel name for this HELP documentation is tdHELP.

The user can return to the execution of the application after completing review of HELP documentation by pressing Fl. The control program then proceeds to restore the profile view in the transaction view, execute the output procedure associated with the panel (if thee is one), redisplay the panel suspended for the HELP presentation, and repopulate the screen with data items on screen data items on screen at the point the HELP request was made.

While in the HELP presentation, a user can request a definition of a word in text by placing the cursor on the word of interest and pressing the F2 key. F2 invokes the Glossary function. If the word has been defined by the application designer in the GLOSSARY, the definition will be presented on the screen. After viewing the definition, the : :

' ' ' I

user can press the F3 key to return to the HELP
documentation, and in turn press F1 to exit from HELP and return to the suspended application panel.

GLO~ARY ~3UPPORT FOR ~TD APPLICATION~;. The Glossary function allows the application designer to define a set of words in the designated TIOLR report.generation so the user can interactively select the definition of a word they do not understand. Glossary words ~re specified in the TIOLR
chapter "report.generation.~LOSSARY". Words within the Glossary can be one to eight characters long. Each word is specified as a section within the Glossary chapter. Each word description may be up to several pages long.

Once a word has been selected from the Glossary, -function keys allow the user to scroll through the possible multiple pages of documentation for that word. To find other words in the Glossary the user can either use function keys to scroll to next or prior words within Glossary, or enter a particular word in the entry field. If a word is specified by either method, and is not found in the Glossary, the next word in alphabetical order will be shown.

Word definitions can be selected from the Glossary from the HELP panel, INFO panel, or GLO'; panel by placing the cursor on the word of interest and pressing F2. Once the user has completed a review of the Glossary, he can press F3 to return to the prior panel.

I~FORM~TIO~ 8~PPORT ~OR GTD APPLICATIONS. The GTD
runtime system (IET~ supports the presentation of tutorial documentation from the documentation report.generation for a GT~ transaction. The user can select tutorial documentation from the Master Menu by specifying a menu select code and d~scription, the tdt INFO panel, and the IETOINFO procedure.
This procedure and panel activates the information display ,..... . . .
::' , -. ;' .' : . : `' , , . . . .
, .. ,. ,,.,., , :

:' : , :
, :: .. . -: - , :
;

function from the report.generation.chapter where the chapter is specified by the first eight characters of the description field on the menu entry.

Having selected an INFO presentation, the user can scroll forward or backward within this information by pressing F5 and F6, respectively, for forward and backward page scrolling or be entering the desired section and page names on the tdtINFO panel. The user can exit the INFO
function by pressing F3 or F12 to return to the Master Menu.

GTD OPTION FI~LD. The GTD system supports an Option field on the panels. The option field allows the user to specify functions keys. This is especially useful when the user is using a terminal that does not have function keys.
The option field can be placed on the panels by specifying the variable name, IEFl_OPTION(woption), as a three character input/output field. The option field can be automatically ~pecified as the panels are created.

The user can enter an F (uper or lower case) followed by one or two decimal digits (1 to 24) in the option field.
This is equalent to pressing the corresponding function key.
If the user enters an option field and also presses a function key, the function key will take precedence. If an entry is not in the preceeding form, the entry is ignored by the IE~ and passed to the procedure.

GTD ~ooRa~EAD FIE~D. This field is an optional field that can be placed on a panel to allow the user to designate a next function to be performed. This 64 byte field is processed according to the application designer's specification. In the preferred embodiment of the present invention, the field is associated with function key F12.
If a lookahead field is on the screen, or the first character of the lookahead field is not blank, or F12 is r ~ -~ A
2 ~ 3 pressed~ the menu action normally associated with F12 is ignored. The specification of F12 is passed to the application through the IEFl_FUNKEY (wfunkey) variable. The application recognizes the user wishes to execute the specific LOOKAHEAD function as indicated by the IEFl-LOOKAHEAD(wlookahead) field.

EDI~IN~ A GTD TR~N~AC~ION DEFINITON. The anchor element of ~ GTD application is the TDT. The TDT is a member of a M~PLIB library/directory that contains the specification for a transaction. Each TDT entry is a named member, one to four characters long~ The name may be extended up to four characters to create unique object names in support of the application.

A COBOL procedure within a GTD application is a standard structured COBOL member. The application designer can use any of the basic COBOL functions, and reference other programs and procedures, using standard language facilities of the environment where thP transaction is intended to run. The COBOL procedure is intended to be a COBOL II structured COBOL member with minimal references to other facilities so the application can be portable to any of several environments.

When a procedure is entered with panel input, the transaction view will be populated with the profile view.
The panel data will ~e superimposed on the profile viewO
When a procedure is entered with a LINK request, the transaction view is cleared (to zero) and the input view populates the transaction YieW.

To invoke an external procedure, use the LINK and RETURN facilities of the DAA. To execute a LINK to other procedures in the DAA, the user may specify a new system, transaction, and procedure in the respective fields . . . .:

~, . ..
.

: : ' ' . ~ ~ , "

:

(IEFl-NSYSTEM, IEF1-NTRAN, IEFl-NPROC respectively) and enter the word LINK in the IEFl-XSTATE field.

If the logic of the application indicates a called procedure has completed execution and is to return to the calling procedure, the designer may enter RETURN in the IEF1-XSTA~E field to return control to the calling transaction.procedure. -EDIT GTD AP~LICATION VIEW8. Profile, input, and output views are maintained in the SRCLIB for each transaction within an application. These views are maintained as standard source members. The only information included on each line within this source member is the name of the data item to be included in that view. These views are correlated at compile time with the transaction view associated with the TDT. The further information necessary to develop the object form of the view is derived from the transaction view.

The views, as managed by the IET runtime monitor have characteristics validated at runtime to verify the data associated with the view is consistent with the curent version of that view as managed by the executing trarisaction. These crosschecks are made using inherent parameters, including number of data items and total length of the data items in a view. Each profile, input, or output view has a version modifier to allow the designer to change the input, output, or profile views for a given transaction.procedure. The version identifier is specified by /VER=line in the source mPmber for the corresponding view. `line' represents a four character alpha~numeric vexsion identi~ication. As the designer specified a change to a view, he should also change the version number so the runtime validation of this version ID can detect inconsistencies in views as they are processed at runtime.

. ` ' ~ , .

2 Q 2 æ~ i ~
This version is necessary because changes for a transaction in one system may not occur precisely synchronous with changes in o~her systems within the network.

This source-identified version number is transcribed into the object and load modules vexsions by the view compile process of the GTD application builder. When a view image is created at runtime, this version ID is further transcribed into the runtime view image. As that view image is received by a called program, or extracted by the runtime controller at application restart, the version of the view image is validated against the version for the view definition. This improves the probability the information will be passed consistently between procedures in this DAA.

CO~PILIN~ G~D VIE~B. GTD view are compiled using GTD
to generate the object version of the views. This process builds a multi-view object module that maintains a representation of each input, output, and profile view referenced within a transaction. This compilation process extracts the transaction view from the SRCLIB (normally `SRCLIB(tdtTVW') and parses this member to interpret data type, location, and length of each of the data elements within the transaction view. The view compiler then extracts each of the input, output, and profile views from the ~RCLIB and generates an object section for each view.
The object section includes a header identifying the view name, leng~h, and version number. For each data element the object section generates an entry identifying that data element relative to the transaction view. Each section is given the name of the view. The object module created is given the name tdtVIEW. This object module, as created, is included with the transaction load module during the transaction bind step.

,;,, ~ ',, , ; ' `, . :~

; , : . ,,,' ' : :

.
.~i:

~9 2 ~ 2 ~
This yields a view model for each input, output, and pro~ile view for a given transaction. This includes the views fox the procedures included within this transaction, and the inpt and output view specifications for each of the procedures (EXTERN procedures) called by this transaction.
The called procedure input and output views are defined in the TDT with GTD with a TYPE=EXTERN for the procedure.

CO~PILING GTD PAN~L8. Views are compiled using GTD The view compilation process is a mass view compile process.
All views associated with this TDT are compiled and placed in the object member tdtVIEW.

The designer can request the mass panel compile. A
conditional compile compiles panels changed in MAPLIB or if the transaction view has changed in SRCLIB since the last panel compile. The GTD system uses the modified date in MAPLIB and SRCLIB and the compiled date in the LOADLIB to make this determination. An unconditional compile compiles all panels in the transaction. The system references the TDT member in the MAPLIB to identify all of the panels ~including menu panels) to be used by this transaction, and to initiate individual map compiles generating the load modules (LOADLIB) describing these panels for the run time interface. This is a lengthy step in the process. The designer will get a REl~RN code for each panel in the TDT as they are compiled.

RE~ERATING A GTD T~ANBACTIONo To reduce the cost of the development cycle while retaining full integrity of the regeneration process, an intelligent regeneration process is used. This process maintains, with appropriate libraries, a last change date for each of the significant objects defined by the TDT~ To fully support this process, the GTD editor notes when a pa~el is generated or a view is edited. The CODESTAR editor identifies when a change is made to a panel.
The CODESTAR compiler identifies when a panel is compiled.

;, . . .. .

The linkage editor identifies when a procedure is linked.
The source editor identifies when a source change is made to a procedure.

The conditional regeneration begins by inspecting objects within the TDT to determine if a source change has been made requiring a regeneration or recompilation of any of these objects. The transaction view is the anchor object within this collection of items. If the transaction view has been edited, all panels, procedures, and views must be recompiled. If the transaction view has not been changed, only those objects modified since the last generation need to b~ recompiled. The regeneration process inspects the last edit date for a source module and the last link-edit date for the load module. If the last link-edit date is after the last source edit date, the compile is not required for that module. Similarly, if there has been no editing of a panel ox the transaction view since the last compile and link-edit of the panel, a recompile of the panel is not necessary.

NOTE: Since the object module time stamp maintains minute resolution, it is necessary for full integrity to recompile objects with link edit tims equal to source edit time. This may, on occasion, cause panels and procedures to be recompiled when n~ change has been made. If source edit and compile are both completed in the same minute, the next conditional regeneration will perform another compile.

~ EC~TING A GTD T~N~ACTION. Once a ~TD transaction has been developed and installed into the runtime environment, the user can invoke that transaction by logging on to the system that supports this transaction. The user can enter `R system name' or RTGxxx followed by the transaction code and press ENTER to run IMS transactions.
If the user wishes to select a particular sub function from :, :: :, : . :
' ~

: ' " ' ~ :::, 2 ~
the menu hierarchy within the transaction, he can immediately transfer to a sub-function within the transaction by entering `=select.select.select' specification. Once the transaction receives control, it will present the appropriate panel to the user. The transaction may ha~e executed some procedure, or, depending on the application design, may only present an initial panel for further selection by the user. The user can enter data into the indicated panel and press ENTER to execute the indicated input procedure for this panel.

The user can press F1 for HELP documentation associated with the given panel. This documentation will be extracted for the TIOLR report.generation.chapter specified by the application designer. If the designer has not prepared the TIOLR report.generation information, the user can get a `Documentation Open Error' error condition. If the particular chapter (panel name) has not been specified for the HELP documentation for a particular panel the user will get a `Documentation Not Found' error condition. It is the desig~er's responsibility to develop and maintain the supporting documentation.

Once HELP has been invoked, the user can select glo~sary functions (press F2, or can press Fl to return to the interrupted panel.

Pressing F12 at any time returns the user to the transaction Master Menu. If the application designer has ~p~cified further actions with function key specification, the user can press the appropriate function key to request the indicated action. It is the application designer's responsibility to correlate function key descriptions on the function key line, normally line 24, with the panel input procedure "lo~ic" to support these indicated function key actions.

. . -: : . . : : :

:

When a GTD transaction terminates execution, the profile view is saved by the profile data base for the user/application on that system. The transaction can be resumed by ent~ring the transaction code from a clear screen (or a directed routing of the form `R system tran') This restores the profile view, executes the panel output procedure tif any~ and presents the current panel.
Alternately the us~r can enter `tran=' to retain profile view and present transaction master menu; `tran=RESET or tran /RESET' to clear profile view and present transaction master menu; or `tran=QUIT or tran /QUIT' to delete application from user's profile space on this system and display the 'Display Active' panel.

EXIT ~TA~. DAA procedure have a completion condition specified by the Exit State variable. This exit state is set by the application, or by the system, by placing a code in an eight character variable called IEFl-XSTATE/wxstate.
The application uses the Exit State variable to indicate an action to be taken upon completion of the transaction. If this variable is not modified by the transaction the Exit State will be blank. A blank exit state causes the designated panel (IEF1-PANEL/wpanel~ to be formatted and presented to the user at the input terminal (IEFl-TERM/wterm).

The application may specify the alternate exit states listed in table 2.

~, : . : . -: . .
: .

~2~ 3 ~

TABLE 2. GTD Exit State Exit State Action blank Display Panel=IEFl-PANEL/wpanel LINK Transfers control to IEFl-NSYSTEM/wnsystem, IEFl-NTRAN/wntran, IEFl~NP~OC/nproc RETURN Returns control to calling system transaction procedure RESET Clears profile view and displays master menu QUIT Deletes application from profile data base and presents `Display Active' panel.
.

~ INR EXI~ 8TATE. A LINK Exit State specifies the application procedure is requesting ~ transfer of control to the system.transaction.procedure as designate by IEF1-NSYSTEM (wnsystem), IEFl-NTRAN(wntran), and IEF1-NPROC(wnproc). The transaction name specified in IEF1-NTRAN(wntran) must be a network defined transaction code. If the IEFl-NSYSTEM(wnsystem) name is blank, it is assumed the request is to a transaction in the current system or routed as specified by the local directory (DRC).
If the IEF1-NPROCtwnproc) name is blank, a null input view will be prepared and the master ~enu for the indicated transaction will be presented to the user of the application.

When control is to be passed to a procedure using a LINK Exit State, the input view for that called transaction.procedure is prepared by the system. The system : .

`

.~ ;'', ",. ~ ,;,"",.;,, ;;- ; "~::., ~,",~ :",:

2~3 ~ 3~
extracts the designated data items from the transaction view, packages these in a LINK message with an interface view indicating the calling and called system.transaction.procedure.

R~T~RN E~IT ~TA~E. A RETURN Exit State causes control to be returned to the calling application. If a RETURN exit state is specified and the current procedure has not been LINKed to another system.transaction.procedure, an error message is specified in the IEF1-MESG~wmsg) field.

When a RETURN is executed from a transaction.procedure, the output view for the called transaction.procedujre is packaged in a RETURN message with the interface view that invoked the request. The RETURN message is routed to the calling system.transaction.procedure.

When the calling transaction.procedure is reinvoked at the calling system, the profile view for the calling transaction.procedure is restored in the transaction view.
The output view from the called procedure is stored in the transaction view and the calling procedure restarted.

RE8~ EXIT ~AT~. A RESET Exit State the profile view for this application/user on this system is cleared and the master menu for this transaction is presented. This condition can be initiated directly by the terminal user be entering `tran=RESET' or `tran /RESET'.

Q~IT B~ 8TA~B~ A QUIT Exit State removes the application from the ROLLFILE for this user on this system and the `Display Active' application panel is presented.
This condition can be initiated directly by the terminal user by entering `tran=QUIT' or `tran /QUIT'.

: , ,~ ,::

~3 F~NCTION REY SUPPORT IN GTD APPLICATIONS. The application designer can specify function key action for GTD
generated applications by including logic within the input procedure ~o interrogate the function key filed. The function key ~iled is made available as a GTD system provide parameter IEF1-FUNKEY(wfunkey). This is a COMP-3 COBOL
variable (short C variable) with a value in the range of 0 through 24, that represents the function key pressed. The IET monitor that controls the execution of the GTD run time module will interpret function keys 1, 11, and 12 and take the prede~ined system actions of `Fl' HELP documentation presentation; `F11' Display Active applications presentation for the current user on the current system (transfers control from the current transaction to a system provide transaction (TRAN=DA) to display the list of the active applications for this user on this system); and `F12' Master Menu presentation.

The application designer must include the appropriate logic within the application to specify alternative function key actions. A function key value of zero implies the ENTER
key was pressed to invoke this transaction. If non-zero, the user can invoke the logic the application designer set up for the function key pressed.

Example - Invoking alternate panel will place alternate panel in IEF1-PANEL(wpanel) field; GOBACK statement issued to return control to alternate panel: or alternate panel presented to user.

Example - Invoked alternate transaction - Alternate system.transaction.procedure placed in IEFl-NSYSTEM ~wnsystem), IEFl-NTRAN(wntran), IEFl-NPROC (wnproc) fields - LINK placed in IEF1-XSTATE(wxstate) fields -:, :
'"'' ' " " '' "''"'' .
: '., : .
' '. ~ ' ' ' " `' 2 ~3 - GOBACK statement issued to transfer control to alternate transaction - Input parameters prepared as specified by input view for called procedure.

The user can request the next or prior object from the one portrayed on the panel be extracted from the data base and its attributes presented for view. This is a typical function for F5 (next) and F6 (prior) keys within a referenced table or data base. It is the designer's responsibility to identify the next or prior object in the data base; read the appropriate attributes from the data base and issue the GOBACK statement to have the information presented on the panel.

G~D APPLICATION PROCEDURE STRUCTURE. The GTD system primarily supports COBOL and C applications. The GTD system will support ~ssembly Language Code (A~C) implementation, but these implementations require manual correlation of information not required in COBOL ancl C environments. For example, in the ALC environment, a DSECT must be maintained that is byte level compatible with the COBOL or C
transaction view generated for view and panel references.

The ALC programmer must adhere to certain conventions for procedure definitions. While this has not proven to be a significant problem, it is more complex than the COBOL
environment.

The COBOL and C environment for GTD provided applications provide for the major functions to be supported by the IET runtime driver and the associated runtime subroutines. Therefore, the application development process is significantly simplified for procedures in this COBOL/C
environment. When a procedure receives contrcl from the IET
runtime driver it can be invoked in two ways:

,. . . . ... ~ . . : ; .: :
:.. ;. -: ~ .:: :: ; :
... .:

: : .:: ''. ` ' ` ' : :: . :
" , :: :~, :

~ t 1. Input from a panel.
2. Input from a calling procedure.

INP~ FRON A PANE~. In general, when input is received from a terminal to a procedure, the profile view is extracted from the ROLLFILE and placed in the transaction view. That transaction view is presented to the procedure.
The procedure executes ~he logic indicative of that particular input procedure:

- reading records from data bases - preforming logic on the data items that extracted this input and the data items from the data bases - preparing output data elements that can be saved in the profile view upon completion of the procedure execution or displayed to the output terminal.

The same panel input will be displayed with the updated data if the application designer sets up the following procedure:

- receive input - read data from the data base - place data base data in the transaction view - return control (GOBACK or return) If the input procedure logic determines from the terminal input or function key an alternate panel is to be displayad, it can insert the new panel name in the IEF1-PANEL(wpanel) field and execute the GOBACK (return) statement. This returns control to the IET controller and prepares a panel for the input terminal consistent with the panel specification. If the IEFl~PANEL(wpanel field is left blank, the MASTER MENUwill be displayed.

::, :.. . :,, . . . :
~ , ~ ; ; , -.: :, . -. ::. : ~ - , .:~

,. : , -:

..: ,. .
:: . ~, . ~: .

The function key field, IEFl~FUNCKEY (wfunk~y), can be interrogated to determine if a function key has been pressed. The application designer determines the action to be taken according to the key pressed. The function keys listed below are reserved for GTD developed applications.
Any other keys can be set up by the application desiyner.

Fll DISPLAY ACTIVE

INP~ FROM A CALL~G PROCEDURE. A procedure can call other procedures, sub-programs, and sub-routines, as desired to execute particular functions for that procedure.
External procedure calls, both external to this transaction and this system, can be invoked with the LINK and RETURN
~xit States for a procedure.

The transaction name in the IEF1-NTRAN(wtran) field must be a defined transaction within the network. The transaction name can be routed based on the transaction routing specifications for the calling system to another system within the network. The procedure name must be a well defined procedure name within the called transaction.
If it is not defined, the MENU for the called transaction will be displayed to the user.

Having invoked the called system.transaction.procedure, that procedure can operate in the same environment, with the same options, as the parent transaction.procedure. For example, to display a panel upon completion of this called procedure execution, the application designer can enter a panel name in the IEF1-PANEL(wpanel) field and return control with the IEF1-XSTATE(wxstate) field blank. This displays the panel to the requesting user.

,: ,: ~ -.: : . , :

A called procedure can return control to the calling procedure by issuing the GOBACK (return) statement with the variable IEF1-XSTATEtwxstate) set to RETURNo Upon issuing the RETURN, the IET control program will:

extract data items from the called transaction view as specified in the output view for this called procedure - package the data items with the interface view that initiated the call request - submit the output messages to the calling system.transaction.procedure.

Upon return to the calling system.transaction, the IET
control program will:
- extract the profile view for the procedure from the profile data base - load the profile view into the transaction view for the calling transaction - load the output view as received from the called procedure on top of the transaction view.

The calling procedure will be reinvoked (at the top) for further processing as indicated by the application designer.

G~D External Prooedure. An external procedure (EXTERN) is a transaction procedure called by a transaction through the LINK exit stateO In this case, the procedure is not included in the calling transaction load module. A
reference to this external procedure is made to correlate the input and output views for this procedure. An external procedure does not have a profile view. The profile view is maintained as null throughout the definition of the TDT.

When the TDT is prepared, the external xeference will be noted by specifying the procedure type as EXTERN. The TDT
will not create a reference for this external procedure.

TI-13766 11~

-. : ,. : ::: : ., . :. :

., .. ~:, ';, ,: ., . . :, : ~': !
: ' ~, , .. . .
' ' ' ' ~ . ' , ' ' ' . :

' ' ' ~ . ' ' :

2~23 i3 ~
The external procedure will not be included in the load module. The input and output views for this procedure, since they are required when a LINK is executed to the external procedure (or a RETURN i5 performed), are included within the tdtVIEW module created at view compile time.

G?D ~nform t ad _Input. To allow initial entry to the system to give more specific directioning to the application, the application designer can develop applications that process input to the transaction processing system from an unformatted input screen. While the data is usually presented from an unformatted input screen. While the data is usually presented from a formatted data screen, being able to support clear screen inputs can save interactions with the application.

In some cases, the unformatted input is processed by the IET command processor. These inputs are characterized by a clear screen inpuk with a transaction code followed by a space (or multiple spaces) and an equal sign followed by a series of selection options separated by periods. For example: 'IEC=TRM.B'. This approach is satisfactory for gaining access to a system at a particular functionality level~

It is also desirable for application unique functionality to be presented to GTD developed applications.
For example an H~N transaction where the user wishes to input the transaction code HRN and an employee name as a single action to get a response presenting information regarding that particular employee.

These types of unformatted input applications can be supported by the GTD system by allowing the application designer to specify an UNFORMAT (GTD option 1.2 panel, defining the UNFORMAT panel to the GTD application, and in ' ' . ' ` ` ` `' `
', ` ' `.,. ' ,, ' '.

'`" ' ~ . ' ' '' '.
`
'`.. I

. .

` . . ' . ~ ~ ` .
' ~ '`'..~ , "

'~` c~r~ s~.

turn associating with the UNFOR~T panel a procedure to process the unformatted input.

The structure of the UNFORMAT panel is vexy basic. It requires:

- field 1 (normally row l column 1), transaction code, typically 8 characters, IEFl-TRAN(wtran) - field 2 (normally row 1, column lO), panel name field - panel name specified as UNFORMAT, typically eight characters, IEFl-PANEL(wpanel) - third field (normally column 18, application designer specified length), character input field - unfoxmatted, information following transaction code from unformatted screen placed in field with first non-blank character in left most position.

The application is responsihle for interpreting the input data stream according to any user rules desirable~ In turn, the application typically presents a formatted output panel characterizing the desired user action. Th:is parsing and panel presentation is completed by the input procedure associated with the UNFORMAT panel by GTD.

Sinc~ the structure of the UNFORMAT panel is uniform from one application to another, the application designer can create a new UNFO~MAT panel for his library by copying an existing UNFORMAT panel. For generality, the application designer may desire to have the data input through the IEFl-OUTPUT(woutput) field since this is a user-available field in the GTD transaction view, 32 bytes in length, and ' ' ~ .. ,; : ' . - : ~

should be sufficient for most application requirements of this type.

The UNFORMAT panel must be named UNFORMAT. Therefore, the panel is unique within the library/directory set for a given application. It is preferred the application designer use a variable name for the input data field in the system supplied section of the transaction view, since it will be invariant across applications managed within the same family of GTD libraries/directories.

GTD Applic~tion Panel PreYentation. Transactions developed by the GTD system present panels to the terminal through a panel driver. This presentation server lnterprets TMS panels prepared by CODESTAR or by the GTD system which may support color, extended attributes, reverse video underscore, and other characteristics. Certain terminals receiving these panel prasentations may not be capable of supporting multiple levels of terminal capability, but the panel presentation server still provides maximum functionality for the most capable terminal devices. The Transaction Mapping Service (TMS~ module interrogates the IEC terminal and device tables IEC function 5) to determine the terminal capability where a panel is to be presented.
The application designer can design terminal presentations using the maximum functionality of any terminal that would use this application. At the same time, these panel presentations can be adapted to terminal devices with lesser functionality.

Applications within the network can have the capability specified for each terminal name recorded in the IEC
~erminal Table with a reference to the appropriate device characteristic. The IEC terminal controller can dynamically modify ('IEC=TRM.C') the characteristics of any terminal within the network at any or all of the systems within the 3~
network. This adapts maximum functionality of an application to the functionality of the target terminal.

GTD Do~umentation RePort_ ~efinition - Lanquage of PrQference. GTD applications documentation is stored on TIOLR for the transaction user to access in one of the followiny ways:

- Press Fl for HELP
- Press F2 for GLOSSARY
- Select INFO from menu The documentation can be made available in multiple languages. The language of the documentation displayed depends on what the user has selected as his first and second language of preference (LP). The selections are made using the ITSS "Language of Preference" transaction, TSSLP.

The selection criteria of the report.generation (based upon language) is:

1. The report.generation declared for the primary LP if a report was defined for that LP.

2. The report.generation declared for the secondary LP
if a report was defined for that LP.

3. The report.generation declared for ENGLISH if a report was defined for ENGLISH.
4. The report.generation defined as the default.

These reports must ~e defined on the system executing the transaction.

.. ...

' ' . , ~'~' : , .

2 ~
~EL~ Dooum0ntation. The organization of the HELP
report.- generation is as follows: -rpt.gen.panel.SOG.page Where: rpt = report name defined by LP
gen = generation name defined by LP
panel = panel name for which HELP is provided SOO = constant section name page = arbitrary page name(s) GLO~RY DOC~BNTATION. The organization of the GLOSS~RY report.generation is as follows:

rpt.gen.GLOSSARY.word.page Where: rpt = report name defined by LP
gen = generation name defined by LP
GLOSSARY = constant chapter name word = word being defined page = arbitrary page name(s) INFO DO~N~NTATION. Selection of GTD System Documentation presents a submenu with the following options:

1. General Description 2. Technical Description Selection of sne of these options presents the text stored in the T report listed below. The glossary information for INFO is stored in the same report as for HELP.

General Description rpt.gen.GENERAL.sec.page Technical D~scription rpt.gen.TECHNCL.sec.page . . . .,: , . . . .

. :'.:':- .' :' ,; .' " . '' ':. ' .: . . : :-~ 3 ~ 3 ~
here: rpt = report name defined by LP
gen = generation name defined by LP
chp = first 8 characters of menu description sec = arbitrary section name(s) page = arbitrary page name(s) ":: : , . . .: ": ~: - ~. :
:

2~13 ~

GTD MENU HIERARCHY

The major functions of the GTD user interface are characterized in the top 2 levels of menu options. The GTD
user is an application programmer or developer. The user interface menus and the functions they support are generic and can be implemented on any suitable platform to provide a consistent application development environment on each platfo~n. Figure 20 is a flowchart detailing the functions performed at the highest mPnu level according to the preferred embodiment of the present invention. The menu options provided to the user at the top level include the following functions.

1. EDIT TRANSACTION DEFINITION
2. GENERATE TRANSACTION VIEW/SOURCE PROGRAM
3. GENERATE PANELS
4. COMPILE TRANSACTION DEF/VIEWS/PANELS/PROCEDURES
5. FILE TRANSFER PANEhS/PROCEDURES/VIEWS/DOCUNENTATION
6. EXIT

Menu item 1, EDIT TRANSACTION DEFINITION, provides functions which allow the appli~ation developer to characterize the application by providing functions to define and modify the application parameters and component parts. Figure 23 is a flowchart of this Edit Transaction (hereinafter referred to as "ET proce~ure") describing these functions further.

Menu item 2, GENERATE TRANSACTION VIEW/SOURCE PROGRAM, (hereinafter referred to as "GC procedure") provides functions which allow the application developer to generate the source files ~or the transaction view (the application ,~ '.,, ": " ~ ; ., , :

~2~3~

data area) and programs. Th~ ~ransaction view and source programs are constructed so as to be compatible with the IET. Thus the required IET application interfaces are built into the data areas in the transaction view and into the program linkage for ~he application procedure. Figure 44 depicts a flowchar~ of the prPferxed embodiment of the GC
procedure, detailiny these functions further.

Menu item 3, GENERATE PANELS, (hereinafter referred to as "GM procedure") provides numerous functions to allow the application developer to generate the system-provided panels, customized for his application and base panels for procedure dialog flow with the u~er. The GTD generates panels to be compatible with ~he IET. These generated panels have the fields required by the IET to perform its panel and menu dialog flow management. In addition, GTD
generate menus which also support the IET user interface funct.ions by providing consistent and well-defined common user interface functions. For the convenience of the developer these functions can also be performed by edit requests on the transaction view, procedure, and panels as provided ~y user interfaces included under menu item 1.
However the developer may not need or wish to customize all the system-provided menus, information, glossary, and help screens thereby making menu item 3 functions useful. Figure 47 depicts a flowchart of the preferred embodiment of GM
procadure detailing these functions further.

Menu item 4, COMPILE TRANSACTION DEF/VI~WS/PANELS/
PROCEDURES, (hereinafter referred to as "CTREQ procedure") provides the developer with the construction tools neccessary to build a DAA application. Of utmost importance are the capabilities to generate the TDT and view tables required to characterize the application to the IET. Menu item 4 guarantees that applications built with GTD are constructed with consistent compile and link editor options - : ~ . :, . :: : : ~ .
~ :.

::

Eor the DAA platform and ensure internal consistency within the application ~hrough the use of conditional and unconditional compila~ion op~ions and the capabilities to compile and link all compon~nts in one process TION, into one load module. Figure 50 depicts a flowchart of the preferred embodimen~ of ~he CTREQ procedure detailing these functions further~

Menu item 5, FILE TRANSFE~ PANELS/PROCEDURES/VIEWS/
DOCUMENTATION (hereinafter referred to as l'FT procedure") provides a utility to transfer all or part of the application source from one DAA machine to another. Menu item 6~ EXIT, provides the user a clean exit from the GTD
program. Figure 61 depicts a flowchart of the preferred embodiment of the FT procedure, detailing these functions further~

Before considering each of these menus in detail, the GTD transaction view will be discussed. The GTD transaction view is a work area uni~ue to GTD and should not be confused with the application transaction view, which is manipulated as a data file by GTD. This work area is used extensively throughout GTD as a place to. save the TDF header (all types) record fields, keep user inputs, and organize data for panel display. Length information for the name, pathname, userid, system identi~ier, object module external symbolic names data are limited by the maximum length supported by ~he mos~ restrictive platform in the D~
system. Specific information concerning the transaction view, or work area, variables used by the preferred embodiment of GTD can be found in Appendix A.

Looking now at Figure 20, depicting the top or first level GTD Main Menu User Interface Procedure, GTD intializes a work area, W (Block 5200), and sets the IEFl TRAN variable in the work area to "GTD" (Block 5210). The date and time . ~ ;
: : ~
., :~ " ~ ; : ~
: . .: . .
,: , ::
., ~.
:. ~ ` .~

~23 ~ ~

are obtained and formatted for display and saved in the work area variables ZDATE and ZTIME (Block 5220). GTD gets the USERID from the system (Block 5250), and sets the IEF1-USER
varia~le in the work area (Block 5260) to that USERID. The ZUSER variable in the work area (Block 5370) i5 set to the value in the IEFl-USER variable.

A GTD user parameter file is opened for READ ONLY
~Block 5400). The GTD user parameter file contains the information n~cessary for the system to present to the user some previously initialized fields from prior GTD sessions.
This is done as a convenience for the user. The work area fields saved in ~he parameter file include: gtdmlib, gtdmmem, srcsid, srclid, srctdt, srcuid, tgtsid, tgtlid, tgtuid, tgtsw. In Figure 20, the program tries to open the îile (Block 5440). If unsuccessful (Block 5450), there is no user information stored, and the program jumps to Block 5710. II the open is successful, the GTD user parameter file is read into a buffer (Block 5460) and the file is closed (Block 5470).

The work area variables are intialized with the parameter file variables, and the program proceeds to Block 5710, where it loads system-dependent environment information that applies to all users on the platform as well as information that is configurable by the user. The environment information that applies to all users on the platform includes: C compiler option, C compiler name, DAA
system object/load library pathnames, DBMS software object/load library pathnames, DBMS copy source pathnames, DBMS pre-compiler pathname. This information is obtained ~rom environment variables defined for all users. Other system-dependen~ environment information that is hard coàed into the program includes the specific names OI all utilities, the specific options required by those utilities, the names of system, DAA and DBMS libraries. The .
: . ., . ~ :
. - . , .~
:
-: ~. , : .

.:: , ' ' :. '. ' ~ :
:

system-dependent utilities include: C compiler, DB~S
pre-compiler, DBMS to DBMS language translator, COBOL
compiler, Linkage editor, editor, show file, copy, move, kill tasX utility, panel compiler, panel screen formatter (interpretor), panel editor, COBOL data map generator (compiler), COBOL to C translator.

It should be remembered that while the preferred embodiment depicts COBOL and C, the scope of the invention should not be limited in any way to these two languages.
~dditionally, an alternative to using the environment variables is to have a system environment information file which would have the a~ove information, and possibly other information that is currently hard coded in the program stored in the file. This file can be loaded by GTD from a predefined location each time it is invoked, in much the same way as i~ loads environment variables in the preferred embodiment of the present invention.

Other environment information, which is configurable by the user, is also stored in environment variables. The configurable environmental information includes: DBMS source translator usage flag (indicating that an additional DBMS
code translation step is required) and DAA test system library/object pathnames (the exist~nce of which implies that the test pathnames should be used instead of the DAA
produ~tion sys~em library pathnames). Alternatively, this information could also be loaded from a GTD user configuration file when GTD is invoked.

After obtaining the system dependent configuration information, ~he procedure opens an output file unique to the user's userid tBlock 6120). The standard screen output and error output are then redirected to this file to be included in the screen information presented to the user (Block 6160). The output from the called utilities is then .-~ : : : : : , , ,, :, , : ~ , ................ ...
.. ..

2 ~ 2 ~ ~ 3 i automatically written to the output file, and not to the display device, leaving ~TD in control of the display device input/output. The output file remains open throughout the execution except when it is periodically rewound to purge exis~ing data in the file. The output file can be displayed by GTD when errors from the utilities need to be examined by the applica~ion developer. An alternative implementation is to provide an output ~ile for the utilities called from GTD
and instruct the utiliti~s, when called, to send their output to the indicated file. At Block 6180, the GTD
initializes the user's terminal device to allow panel input and output.

Block 6260 displays a GTD panel. When the display procedure is complete, GTP calls the FE procedure (Figure 22, beginning at Block 48130) to see whether the user has indicated he is finished using this procedure (Block 6300).
If a user end i~ indicated, the program jumps to Block 6560.
I~ not, the pro~ram checks to see whether the user requested the edit transaction definition menu option, GTDSEL=l (Block 6350). The GTDSEL variable represents user input, typically a ~enu selection, from the panel. When GTDSEL equals 1, the edit transaction definition proceclure (ET, Figure 23, starting at Block 102390) is called. When the ET procedure is complete, the program returns to Block 6260, to see if the user requires any other menu options from this panel.

If GTDSEL does not equal 1 at Block 6390, the procedure checXs to see if GTDSEL equals 2, meaning the user requested the generate procedure or transaction view menu option.
When GTDSEL equals 2, the generate procedurP or transaction view procedure (GC, Figure 44, beginning at Block 6900) is called. When the GC procedure is complete, the program returns to Block 6260, to see if the user requires any other procedures from this panel.

- ~ . : ,... : . .
..

, ' ~ ' .

. . .. . .

If GTDSEL does not e~ual 2 at Block 6430, tha program checks to see if GTDSEL equals 3, meaning the user requested the generate panel menu option. When GTDSEL equals 3, the yenerate panel procedure (GM Figure 47, beginning at Block 3030) is called. When ~he GM procedure is complete, the program returns to Block 6260, to see if the user requires any other procedures from this panel.

If GTDSEL does not equal 3 at Block 6470, the program checks to see if GTDSEL equals 4, indicating the user requested the compile/bind application menu option. When GTDSEL equals 4, the compile/bind application procedure (CTREQ Figure 50, starting at Block 16440) is called. When the GM procedure is complete, the program returns to Block 6260, to see if the user requires any other options fro~
this panel.

If GTDSEL does not equal 4 at Block 6510, the program checks to see if GTDSEL equals 5, indicating the user requested the transfer procedure/panels/views/documentation menu option. ~hen GTDSEL equals 5, the file transfer procedure (FT Figure 61, starting at Block 115640) is called. When the FT procedure is complete, or if GTDSEL does not equal 5, the program returns to }31Ock 6260 to see if the user requires any other procedures from this panel.

When the user requests an end, the procedure creates a parameter file over the existing parameter file (block 6560), to save transaction view variables from this GTD
session so they are available to the user during the next GTD session. Th~ program checks to see if the parameter file was succe~sfully created (Block 6570). If it was not, the program jumps to Block 6820 and ends the program. If the create was successful, the buffer is initialized with the parameter values from the work area ~Block 6590), the buffer is written to the parameter file (Block 6790~, and the .. . .. . . .

2 ~ 2 ~
parameter file is closed (Block 6800). Block 6820 exits the program.

GTD DI~PLaY PANEL PROCEDURE. Looking now at Figuxe 21, detailing the preferred embodiment of the GTD display panel procedure for displaying a panel to the user and then waiting for input from the user. It uses a panel interpretor to perform ~he panel device input to and output from the GTD transaction view fields which correspond to the display panel fields. It also maintain~ the current date and time for panel display, maintains the GTD value in the transaction ~ield and clears the message field once the panel has been displayedO

The procedure obtains the new date/time and formats the panel date/time fields (Block 47370). The transaction code is set to "GTD" (Block ~7420) and the panel interpretor is called to generate the screen output (Block 47430). GTDMSG
is cleared to blanks (Block 47440) and the panel map interpretor is called to obtain user panel input (block 47480). The procedure then checks to see if the transaction code is ~till "GT~" (Block 4749G. If it is not, the procedure returns to Block 47420; if it is, the program exits the display panel procedure.

Gq!D FIJNCTI:C)N ~ ECl~ER FE PROCED~ Looking now at Figures 22a-b, the flowchart depicting the preferred embodiment of the GTD procedure to check for an end indicator. This FE procedure indicates that the user wants to exit from a particular panel function. on receipt of an end indication, the usual program function is to complete processing and terminate the current function. From the main menu, an end indication means that the user wishes to texminate the program. The user indicates an end indication in a number of ways. One way to terminate the program is to type an exit command in the GTDSEL user input field on the : ., .. ~, : .. ~ .

~2~3~

panel. This field is included on all GTD panels to support user exit commands (as well as other function defined commands~. Another way i5 for the user to input an end or exit function key. In the current implementation of the present invention, this is function key 3, but any function key could he used. A function key input number is defined to correspond to the ief_funkey field in the work area or GTD transaction view.

Starting with Figure 22a, the FE procedure begins with Decision Block 48150 checking if the end function key was pressed. If the function key was not pressed, the procedure jumps to Decision Block 48200. If the function key was pressed, the procedure sets the function key field equal to zero, (Block ~8160), and s~ts the select field to blank ~Block 48170). At Block 48180, an end is indicated with a flag return code=l and the program exits the procedure.

Decision Block 48200 checks if there is an /x', or other preselected character, in the select field GTDSEL='x' or 'X'. ~f there is an 'x' or 'X', then the function key field is set to zero and (Block 48210). The select field is set to blank ~Block 48220). At Block 48230, an end is indicated with a flag return code=l and the program exits the procedura.

At decision Block 48300, the program checks if there is an 'end' in the select field GTDSEL='end' or 'END'. If not, then go to block 48400. If so, the program sets the function key fieId to zero (Block 48310~ and sets the select field to blank (Block 48320). At Block 48330, an end is indicated with a flag return code=l and the program exits the procedure.

Block 48400 determines no end has been indicated and sets a flag equal to zero with a flag return code=0. The :,, ;, . , ,, .~

. ~

` ~2~ 3~

program ends procedure FE at ( Bl ock 4 8 410 ) .

2 ~ 3 ~

Moving now to Figure 23, at Block 102390, the ET
procedure provides the interfaces necessary to define, edit and perform maintenance on application components, their characterization and their rela~ionships. This information is stored in the TDF file. A copy of the TDF headers is saved in the GTD workarea (or GTD transaction view) in memory for program use, to be later stored in the TDF file.
The format of the data portion o* the headers is the same as the format of the TDF headers. The TDF component entries are also saved in a memory data structure for program use, to be later stored in the TDf file. The data structure used to store the TDF component entries is an array named the STDE or STDE table. The format of each S~DE element is the same as the largest TDF component.

one of the major functions of the ET procedure is to define the appliration and maintain the application characteristic information in the TDF file in a consistent and structured manner. The application characteristic information includes application user dialog/sassion interface, and the application cooperative processing interface. GTD provides the application developer a structured method to quantify and edit this information in terms which can be saved in the TDF and used to construct the application load module. Included in the load module is a subset of the TDF and other information quantified in tables which are used by the IET during application execution. Info~mation which is used to quantify the application dialog/session interface include panels, th~
input and output procadures which support those panels, and the application pro~ile view. Information which is used to quantify the application cooperative processing interface includes external and internal procedures as well as the input and output data views for those procedures. When the application is first being defined and no TDF exists, a set , . .. ~ .. . . .

., .

.
: ,, : . ~

2 ~ ~ C~ ~ ~J l of default definitions are specified which define default names, locations of programs, panels and other items, as well as defaul~ definitions of system provide procedures, panels and menus. These default definitions are extrapolated using a defined set of conventions from the name of the TDF
file and path names provided by the user. These default definitions comprise a minimal essential subset of application parameters stored in the TDF header. In addition certain default component definitions are also set up. These component definitions are for panels, procedures, and menu entries provided to support the IET menu, help/ information, and glossary management functions. These components are stored as panel, procedure, and menu records in the TDF file whenever a function within the ET procedure is performed.

The information in the TDF file allows GTD to locate each component of the application. According to the preferred embodiment of the present invention, the conventions used are as follows. The TDF and all panel and menu source ~maps) are stored in a map library or directory.
The path name of this library or directory is provided by the user and is kept in the GTDMLIB field of the GTD work area. It is not stored in the TDF. The TDF name is also pro~ided by the user and stored in t~e GTDMMEM field of the GTD work area and in the GTDHMEM field of the TDF. The user-provided map library path name and TDF name are combined using machine-dependent file naming conventions and DAA conventions to yield the TDF file name. In the same way the GTD determines the file names of the transaction view source, the procedure source, panel and menu source, the view source, the TDT source, the TDT objects, the view objects, the panel and map objects, the procedure objects, and the load module. In the UNIX implementation of the preferred embodiment o~ the invention, the files are located using the listed path name, file name and extension conventions. Specific information regarding these files is :: .. ~: . . . . :. , ; ;',' '` : ~
. ':~ ~ .:

~ 20~3~ 3~

located in ~ppendix B.

Other DAA application files exist or are used temporarily by GTD but their usage is generally hidden from the application developer. In some cases, specifically with objects, the GTD file location conventions are different because of restric~ions in compiler file output capabilities. In UNIX objects are created in the source tGTDSLIB) directory; on a mainframe, objects are created in the object (GTDOLIB) library. These slight differences in GTD implementation do not affect the portability of the application or affect the GTD development environment as seen by the application developer.

Another function of the second level ET procedure is the provision of an interface for selecting and identifying component (panels, procedures, views, and maps~ source for editing or modification. Each of the second level procedures of the ET procedure will now be considered.
Discussion of any other procedures called during execution of a sepcific second level procedura will follow discussion of the particular second level procedure.

EDIT T~hN PARAM~T~RS. This third level procedure provides a display panel which includes information from the TDF header, the TDF first extension header, and the TDF
second extension header. The user can change the information on this display panel as appropriate and have it saved into the TDFo Figures 23a-c depict the flowchart of the preferred embodiment of the ETP procedure, detailing these functions further.

This procedure provides a way for the application designer to define the basic parameters of the transaction.
The designer must specify the name of the TDT and the MAPLIB
that contains it. If this is the first reference to the TDT

'; ~

within the MAPLIB, the system will assume the libraries/directories are to be SRCLIB, OBJLIB, LOADLIB, DBRMLIB, CNT1LIB, and MAPLIB; the transaction view is to be formed by extending the TDT name with the suffix TVW
(tdtTVW~; and the documentation indicates the TDT name is the report name while EOO is the gen~ration name (tdt.EOO).

Any of these default specifications can be changed by the application designer. Once library/directory names have been specified, they should remain unchanged throughout the life of the transaction definition. The documentation report.generation can be changed at any time. This allows a convenient way to release new application documentation.

The GTD edit transaction definition (hereinafter referred to as "ET procedure") begins at Block 102420 by performing the procedure to display a panel (Figure 21, Block 47300), electing to display the GTDET panel. This panel contains a list of ~he third level procedure selections. Block 102440 performs the FE procedure (Figure 22, Block 48130) to check for user input end indications.
If an end is indicatad, the program jumps to Block 102850 and exits the ET procedure. If an end is not indicated at Block 102480, the procedure performs the load/create TDF
procedure known as GTDT procedure (Figure 24, Block 44960) and checks to see if the load/create was successful (Block 102485). If the load/create was successful, the procedure jumps to Block 102550. If not, the procedure sets the number of entries in the STDE table to ~1 to indicate no STDE table (Block 102490) and clears the user select field (Block 102500).

Decision Block 102550 checks to see if there is an edit transaction parameters request, GT~SEL = 1. If there is, the edit transaction parameters procedure (Figure 27, Block 102930) is performed and the procedure jumps to Block - '` ~ ' i :' ' ' : : ~

:,, , : .

~ ~ s~

102810. If there is not an edit transaction parameter reques~ the procedure checks to see if there is an edit panel list request, GTDSEL a 2 (Block 102~90). If there is, the edit panel list procedure (Figure 28, Block 103190) is performed and the procedure then returns to Block 102B10.

If there is not an edit panel list request, the proc~dure checks to see if there is an edit procedure list request, GT~SEL = 3 (Block 102630). If there is, the edit procedure list procedure (Figure 30, Block 106610) is performed and the procedure continues at Block 102810. If there is no edit procedure list request, the procedure checks to see if there is an edit menu hierarchy request, GTDSEL = 4 (Bloc~ 102670). If there is, the edit menu hierarchy procedure (Figure 37, Block 110280) is performed and the procedure jumps to Block 102~10.

If there is no edit menu hierarchy request, the procedure checks to see if there is an edit language list request, GTDSEL = 5 (Block 102710). If there is, the edit language list procedure (Figure 40, Block 113070) is performed and the procedure continues at Block 102810. If there is no edit language list request, the procedure checks to see if there is an edit transaction view request, GTDSEL
= 6 ~Block 102750). If there is, the fully ~uali~ied name of the transaction view file is built and the edit procedure (Figure 33, Block 43860) is called to bid an editor. once the edit is complete, or if there was no edit transaction view request, the procedure proceeds to Block 102810.

At this point, the procedure writes out the TDF file and then (Block 102815) checks to see if the write is successful. If it is not, the procedure sets the error message field, GTDMSG to equal "TDT WRITE FAILED" and moves to Block 102420. If the write is successful, the procedure returns to Block 102420, to await another display of the .
.
~; . : ;. ' .

.
:

GTDET panel.

GTD GE~ TDF: GTD~ P~OCEDURE. According to Figures 24a-r which depict the pre~erred embodiment of this procedure, the GTDT procedure loads a TDF file into memory.
The header records are stored in appropriate areas in the transaction view and the panel, procedure, language, and menu entry component records are stored in the STDE table.
If no TDF file exists, then the memory areas are initialized with default TDF file values. The format of the TDF file records, and conse~uently the format of the transaction view header record work areas, as well as the STDE table entries are documen~ed in ~he TDF documentation.

The GTD GET ~ransaction definition file (TDF) procedure begin~ by clearing the STDE table entries to blank (Block 45000) and building a TDF file pathnama (Block 45030) using the MAPLIB pathname (gtdmlib), the TDT name (gtdmmem), and thè suffix ".tdt". The procedure constructs default component names for the system panels and default application profile view and ~tores them in the variables listed: main menu, variable gtdhmenu; information menu, variable gtdhimnu information panel, variable gtdhinfo:
help panel, variable gtdhhelp; glossary panel, variable gtdhglos; and profile view, variable gtdhpvw (Block 45250).
It should be recalled that these namec have been selected as a matter of choice and should not in any way limit the scope of the present invention. The default component names are constructed by using the TDT name as stored in gtdmmem and appending a suffix which differentiates the various components (e.g.,MENU for the main menu, IMNU for the information menu, etc.

At Block 45~10, the TDF file is opened for read only and the STDE entry table count, nent, is initialized to zero .: ' :. , , '' '~ ' ~ ;' : , .

L~ r ~
3 ~i (Block 45420). Block 45430 checks to see if the open was successful. If it was not successful, the procedure proceeds to Block ~5440 to build the initialization data for the TDF file in the STDE table and in the header record fields of the GTD transaction view. If the open was successful, the TDF file is loaded into the header record fields of the transaction view and the TDF component records are loaded into the STDE table. At Block 45432, the procedure performs the get record from TDF file (TDTGET) procedure (Figure 25, Block 16140). The record obtained at this point is the T~F header record. Block 45434 ch~-cks to see if TDTGET was successful. If it was, the procedure jumps to Block 46430 to validate the header record read. If TDTGET was not successful, the procedure moves to Block 45440. Blocks 45440 through 46410 build the initialization data for the TDF in the STDE table and in the header record fields of the GTD transaction view and then constructs the application transaction view. ~-^

In Block 454~0 the procedure sets the work area fields in the GTD transaction view containing the TDF header fields to blanks. The TDF header fields are then initialized to the default values (Block 45450) listad below: gtdhrtyp = 'H';
gtdhmtyp = 'D'; gtdhmem = gtdmmem, gtdllib = gtdmlib with last token (MAPLIB portion) removed, ''LOADLIB'I; gtdlm~m =
gtdmmem "PROG"; gtdslib = gtdmlib with last token (MAPLIB
portion) removed, "SRCLIB"; gtdolib = gtdmlib with last token (MAPLIB portion) removed, "OBJLIB"; gtddlib = gtdmlib with last token (MAPLIB portion) removed, "DBRMLIB"; gtdnlib = gtdmlib with last token (MAPLIB portion) removed, 'iCNTLLIB"; gtdhdr = gtdmmem, gtdhdg = "E00"; gtdcmem =
gtdmmem, "TVW"; gtdappl = gtdmmem; and gtdreln = "0000".

The work area fields in the GTD transaction view containing the TDF first extension header fields is set to blanks (Block 45730) and then initialized to default values "' ' ' '' ~ ~ . ' ; ; . ' ' - ' ' . , ~ ' .. ~

, (Block 4~740) listed below: gtdhexl = "HX" and gtdhexln = 1 in BIG_ENDIAN format. Byte order in which integer data is stored is dif~erent on dif~erent machines. The BIG_ENDIAN
format refers to the storage of bytes from the high to lowe~t order in a left to right direction. This order is used as a convention for integer data stored in data sets to be transferred between machines such as the integer data in the source TDF and MAPs. Other conventions could be used such as LITTLE_ENDIAN.

The work area fields in the GTD transaction view containing the TDF second ex~ension header fields is set to blanks (Block 45800) and then initialized to default values (Block 45810) listed below: gtdhex2 = "HX" and gtdhex2n = 2 in BIG_ENDIAN format. A TDF component entry is constructed in the GTD transaction view workarea for the glossary panel with the following values: gtdename = gtdhglos, gtdeipnm =
"IETIGLOS", and gtdeopnm = "IETOGLOS" (Block 45870). The panel entry is put into the STDE table tBlock 45910) using the process described below.

An attempt is made to add the new panel entry to the STDE table for later storage in the TDF. The attempt will fail if the panel name provided is blank, if the STDE table is ~ull, or if the panel name providecl already exists in the table. If the no error is detected, the panel entry is inserted in the STDE table in ascending panel sequence.
Speci~ically, the new panel is inserted before the first panel name which has a larger alphabetic comparison value or at the end of the table. The STDE entry count, nent, is incremented (~lock 45910).

A TDF component entry is constructed in the GTD
transaction view workarea for the help panel with the following values: gtdename = gtdhhelp, gtdeipnm "IETIHELP", and gtdeopnm = "IETOHELP" (Block 45920). The , : ,: ',; , '' . ;. ' ";
:.:. :,: .,, ,, -:~
-: ~~., , :- .: .: : :
: : ~ ::~ ~ -:

panel entry is put into the STDE table (Block 45950) using the process described in Block 45gl0~

Next, a TDF component entry is constructed in the GTD
transaction view workarea for the information panel with the following value~: gtdename = gtdhinfo, gtdeipnm "IETIINFO", and gtdeopnm = "IETOINFO" (Block 45960). The panel entry is put into the STDE table ~Block 45990) using the process described in Block 45910.

Then, a TDF component entry is constructed in the GTD
transaction view workarea for the glossary input procedure with the following values: gtdename = IETIGLOS, gtdepvnm =
"IETGPVW", and gtdectyp = "ENTRY" (Block 46000). The procedure entry is put into the STDE table (Block 45990) using the process described below.

An attempt is made to add the new procedura entry to the STDE table for later storage in the T~F. The attempt will fail if the procedure name provid~d is blank, if the STDE table is full, or if the procedure name provided already exists in the table. If no error is detected, the procedure entry is insertad in the STDE table in ascending procedure sequence as described above with regard to panel sequence. The STDE entry count, nent, is incremented (Block 45990)-A TDF component entry is constructed in the GTDtransaction view workarea for the glossary output procedure with the following values: gtdename = IETIGLOS (Block 46050). The procedure entry is put into the STDE table (Block 460603 using the process described in Block 45990.

Next, a TDF component entry is constructed in the GTD
transaction view workarea for the information input procedure with the following values: gtdename = IETIINFO, , ;: , - ~ .
,, ' ,: ' :
:
:

and gtdepvnm = "IETIPVW", (Block 46070). The procedure entry is put into the STDE table (Block 46090) using the process dPscxibed in Block 45990.

Then a TDF component entry is constructed in the GTD
transaction view workarea for the information output procedure with the following values: gtdename = IETOINFO
(Block 46100). The procedure entry is put into the STDE
table (Block 46110) using the process described in Block Subsequently, a TDF component entry is constructed in the GTD transaction view workarea for the help input procedure with the following values: gtdename = IETIHELP, and gtdepvnm = "IETHPVW", (Block 46120). The procedure entry is put into the STDE table (Block 46140) using the process described in Block 45990.

Then a TDF component entry is constructed in the GTD
transaction view workarea for the help output procedure with the following values: gtdename = IETOHELP (Block 46150).
The procedure entry is put into the STDE table ~Block ~6160) using the process described in Block 45990.

Next a TDF component entry is constructed in the GTD
transaction view work area for the main menu input procedure with the following values: gtdename = IETIMENU, and gtdepvnm = gtdhpvw (Block 46170). The procedure entry is put into the STDE table (Block 46190) using the process described in Block 45990.

At Block 46200, a TDF component entry is constructed in the GTD transaction view work area for the main menu output procedure with the following values: gtdename = IETOMENU.
The procedure entry is put into the STDE table (Block 46210) using the process described in Block 45990.

, - , . :.: . ~- . .. : :~: ,, .. , .,, : :
:: . .~ . .. : . .. .

' ' . . - .. :. ;:. ; .: :: ::,:, . :. . :, , .: ., ;, :' : '. ,:: .:: :: :: - ... :
~:: ~ , :
' : :, " . ..... . . :
, ~

Then a TDF component en~ry is constructed in the GTD
transaction view work area for the display input procedure with the following values: gtdename = IETDISPL (Block ~6220). The procedure entry is put into the STDE table (Block 46630) using the process described in Block 45990.

Finally, a TDF component entry is constructed in the GTD transaction view workarea for the main menu system documentation menu entry with the following values: qtdename = gtdhmenu, gtdedesc a " SYSTEM DOCUMENTATION~, gtdesel =
"0", gtdipnm = gtdhimnu, gtdeopnm = "GTD" (Block ~62~0).
The menu entry is put into the STDE table procedure (Block 46290) using the process described below.

An attempt is made to add the new menu entry to the STDE table for later storage in the TDF. The attempt will fail if the menu name provided is blank, if the STDE table is f~ the name provided already exists in the table (for any other type of component, STDETYP not = E, named in an STDE~AME field) or if the menu ent:ry select field STDESEL
already exists for the menu name~ If the no error is detected the menu entry is inserted in the STDE table in ascending menu sequence as discussed previously for procedure sequence. ThP STD~ entry count, nent, is incremented (Block 46290).

A TDF component entry is constructed in the GTD
transaction view workarea for the information menu general description menu entry with the following values: gtdename =
gtdhimnu, gtdedesc = 'IGENERAL DESCRIPTION", gtdesel = "1", gteipnm - gtdhinfor gtdeopnm = "IETINFO" (Block 46300). The menu entry is put into the STDE table procedure (block 46350) using the process described in Block 46290.

Next, a TDF component entry is constructed in the GTD

- , . .
-: : .' ' .' , '~ - ,1 ' "~, '. '' :.
: - .: . ~ .

': $~ i ' .: ' :

.: ~ , , , ,:

2~5~ ~
transaction view worlcarea for the information menu technical description menu entry with the following values: gtdedesc =
"SYSTEM DOCUM~NTATION", and gtdesel = l'2" (block 46360).
The menu entry is put into the STDE table procedure (Block 46380) using using the process described in Block 46290.

At Block 46390, the procedure then generates the transaction view using procedure gtvw (Figure 26, Block 8200), sets the message field, gtdmsg, to blanks (Block 46400), and exits the procedure with no errors (Block 46410).

In Block 46430 the header record is moved from the buffer area into the TDF header area in the GTD transaction view. Block 46440 checks to see if the TDF record ~gtdhrtyp=h) and TDT types (gtdhmtyp=D) are acceptable. If tha records are accep~able, the procedure jumps to Bloc:k 46490. If not, the procedure sets the error message field, gtdmsg, equal to "INVALID TDT FORMAT" (Block 46450), closes the TDF file (Block 46460) and exits the procedure with an error (Block 46470).

At Block 45490, the procedure gets the first header extension record from the TDF file using the TDTGET
procedure (Figure 25, Block 16140). The first header extension rec:ord is moved from the buf~er area into the corresponding TDF header workarea in the GTD transaction view (block 46500).

The procedure then gets the second header extension record from the TDF file (Block 46510), again using the TDTGET procedure. The second header extension record is moved from the buffer area into the TDF header workarea in the GTD transaction view (Block 46~20), and index "e" is pointed to the beginning of the STDE table (Block 46530), the memory copy of the TDF entry records.

., , -: :

''1 ` '~.
, : , .:

::: :: - ' . :.,' .
::,: :
,. :
.

Blocks 46540 through 46650 initialize the STDE table from the component records in the TDF. Whenever information is needed by GTD which is recorded in the TDF component records, GTD retrieves the information from the STDE table.
Any modification of the application component definitions is performed on the entries in the STDE table. The STDE table entries are later s~ored by GTD after the modification has completed. Since all TDF information is maintained in memory during execution, the TDF can be written in its entirety, thereby simplifying TDF file input and output.

Specifically, the procedure gets a record from the TVF
file (Block 46540) using the TDTGET procedure (Figure 25, Block 16140), and then checks to see if the TDTGET was successful (Block 46542). If it was successful, the procedure moves the entry record into the STDE table at location e in the STDE table (block 46620); increments e to point to the next entry in the STDE table (block 46630);
increments the STDE en~ry count, nent (block 46640); and returns to Block 46540. If it was not successful, the procedure jumps to Block 46660. If the TDTGET procedure was successful, the procedure checks to see if the buffer is blank (Block 46543).

If the buffer is not blank, the procedure checks to see if the STDE ta~le i5 full (Block 46560). If it is not full, the procedure jumps to Block 46620. I~ the STDE table it is ull, the procedure sets the error message field, gtdmsg, equal to "STDE TABLE FULLI'(Block 46570), closes the TDF file (Block 46580), and exits the procedure with an error (Block 46590).

If the buffer is blank, the procedure continues to Block 46620 where the procedure closes the TDF file, generates the transaction view (Block 46670) using procedure GTVW (Figure 26, Block 8200), sets the message field, gtdmsg, to blanks (Block 4~690), and exits procedure GTDT.

RBA~ TDF RECORD: ~DTG~ PROCED~R~. According to Figures 25a-b, which depec~ a flowchart of the preferred embodiment of the present invention, the GTD TDF input procedure begins by setting the buffer to blanks (Block 16180) and reading the 4 byte header from the transaction definition file (TDF). Decision Block 16190 checks to see if the read was successful. If it was not successful, the error message, GTDMSG, is set equal to "MAPLIB READ ERROR"
(Block 16200) and the procedure is exited with an error (Block 16210). If th~ read was successful, the record length is set to equal the length in the first two bytes of the header in BIG_ENDIA~ format (Block 16260~. The buffer length is set to equal the record length minus the 4 byte header (Block 16280). The TDF is read to fill the buffer to the length indicated in buffer length (Block 16320) and the procedure checks to see if the read was successful (Block 16325). If it was not successful, the error message out, GTDMSG, is set equal to "MAPLIB READ ERROR" (BlocX 16330) and the procedure is exited with an e!rror (Block 163~0). If the read was successful the program exits procedure TDTGET
(Block 16360).

GENBRAl'E: TRAN8AC!I~IO~I VII~W s GTVW PE~OCE:DIJRE: .
Considering now Figures 26a-e, which depict a flowchart of the preferred embodiment o~ the present invention, the GTD
transaction view procedure blanks the buffer area (Block 8260) and puts the SRCLIB path name from gtdslib into the transaction view file name, variable GTDCMEM, (Block 8280) using GTDSLIB. Then the procedure checks to see if GTDCMEM=blank (Block 8300). If GTCMEM is blank, the program sets the error message field, GTDMSG, to "INVALID TRAN VIEW
NAME" (Block 8310), and exits the procedure with an error :, : : ,. :: ' ~: : . : !

.~

3 ~

(Block 8320). If GTDCMEM is not blank, a completed transaction C080L view name i5 built using the current machine standard conventions (~lock 8340). GTD is written on each platform to comprehend the conventions required by the operating system. Once the transaction view name is built, the program checks to see if the transaction view file already exists (Block 8390). If the transaction view does exist, the error message field, GTDMSG is set to IITRAN
VIEW(cpy) EXISTS" (Block 8400) and the program exits the procedure with an error.

If the transaction view file does not exist, the procedure attempts to create a transaction view fil~ (Rlock 8440). If the create is no~ successful, the program sets the error message field, GTDMSG, to "TRAN VIEW~cpy) create FAILED" ~Block 8450) and exits the procedure with an error (Block 8460). If the create was successful, an index is initialized to point to the first line of the skeleton program (Block 8~90). This line is checked to see if it is the last line of the skeleton program (Block 8500). If it is, the procedure jumps to Block 8620. If it is not, this line is copied into the output buffer (Block 8530), and terminated (Block 8660).

The output buffer .is then written to the transaction view file (Block 8560), and the procedure checks to see if the write was successful (Block 8565). If the write was successful, the procedure increments the index to point to the next line of the skeleton transaction view record, and moves back to Block 8500. If the write was not successful, the error message field GTDMSG is set to" TVW.cpy WRITE
ERROR" (Block 85703.

At Block 8620, the procedure closes the transaction view file and builds a completed transaction C view file name using the current machine standard conventions (Block Tl 13766 149 .. .

- ~2~3~

8640). Once the transaction view name is built, the program checks to see if the transaction view file already exists (Block 8710). If the transaction view exists, the error message field, GTDMSG is set to "TRAN VIEW(h) EXISTS" (Block 8720) and the program exits the procedure with an error (Block 8730).

If the transaction view file does not exist, the procedure attempts to create a transaction view file (Block 8760). If the create is not successful, the program sets the error message field, GTDMSG, to "TRAN VIEW(h) create FAILED" (Block 8770) and exits the procedure with an error (Block 8780). If the create was successful, an index is initialized to point to the first line of the skeleton program ~Block 8810). This line is checked to see if it is the last line of the skeleton program (Block 8~20). If it is, the procedure jumps to Block 8940, closes the transaction view file, and exits procedure GTVW (Block 8950~. If it is not, this line is copied into the output buffer (Block 8850), and terminated (Block 8870).

The output buffer is written to the transaction view file (Block 8880), and the procedure checks to see if the write was successful (Block 8865). If the write was successful, the procedure increments the index to point to the next line o~ the skeleton transaction view record, and returns to Block 8820. If the write was not successful, the error message field GTDMSG is set to "TVW.h WRITE ERRO~"
(Block 8890), the transaction view file is closed (Block 8940~, and the program exits the procedure (Block 8950).

EDIT TRAN~aCTIO~ PA~aNETER8. ETP PROC~D~RÆ. Considering Figure 27 which shows a flowchart of the preferred embodiemnt of the procedure, the GTD edit transaction parameters procedure accepts user input in the the GTD
transaction view fields on the panel that corresponding with ::' , '. . "~, , ,, ", ~, " , i ;, "" ~

~ ~ . , . . :;, ~t~
the TDF header, the TDF first header extension, and the TDF
second header extension. The user information defined on the screen is eventually stored in the TDF file. When the TDF
is first defined, GTD defines a sufficient number of default values to define a working TDF. These values can be customized by the user for special situations. Validation is perPormed and incorrect input is corrected.

Procedure ETP begins by performing the procedure to display a panel (Figure 21, Block 47300) electing to display the GTDETD panel (Block 102980). This panel contains the TDF header fields described above. The procedure translates the user input fields GTDLMEM, GTDHDR, and GTDHD~ into uppercase (Block 102990) and checks to see if the release -number, GTDRELN, field is valid (Block 103020). If GTDRELN
is invalid, the procedure replaces any illegal characters with default character 1l " (blank), and proceeds to Block 103070. If GTDRELN is valid, the procedure continues to Block 103070, where the FE procedure (Figure 22, Block ~8130) is performed to check ~or user input end indications.
If an end is not indicated (Block 103080), the procedure returns to Block 102980. If an end is indicated the program exits procedure ETP.

.:
, ,,. : .,.,. , - :

~3 EDIT P~NEL LI~T. This procedure is a third level procedure which provides a display panel which includes information from the TDF panel record type. This information characterizes a panel entry definition and is displayed on the panel in a list. Since more panel entries may be defined than may be displayed at one time, facilities are provided to allow navigation through the panel list.
Functions are also provided for adding new panel definitions, modifying current panel definitions, deleting current panel definitions, displaying current definitions, and editing the panel map.

This procedures presents the application designer with a list of the panels within the TDT. Each panel entry can include an input procedure and an output procedure. The designer can add, change, delete, or edit entries within this list. Sy~tem-provided entries (e.g., ~EMU, HELP, GLOS, and INFO support) cannot be changed.

To delete an entry from the panel list, a 'D~ is entered in the select field.

To add an entry to the panel list, an 'A' is entered in the select field. The user completes the 'ADD PANEL' screen by providing a panel name, an input procedure, and an output procedure (optional). When the tADD PANEL' panel is completed, this entry will be inserted into the TDT and the updated panel list presented.

To change an entry to the panel list, a 'C' is entered in the select field. The user makes changes as necessary to the 'CHANGE PANEL' panel. When the 'CHANGE PANEL' panel i5 completed, these changes will be inserted into the TDT and the updated panel list presented.

,. .: -,~

To edit an entry in the panel list, an 'E' is entered in the select field for the desired panel. This presents the panel for Edit with the CODESTAR editor. If the panel does not exist when an Edit is requested, a default panel will be generated and presented for edit.

Figures 28a-f depict the flowchart of the preferred embodiment o~ the EP procedure, detailing these functions further.

The GTD edit panel list (EP) procedure begins by scanning the select field for the locate command input by the user. The locate name is saved in the dname field of the transaction view. This locate name is used as the initial panel entry to ~e displayed in the edit list. If there is no locate command, dname is set to blank (Block 103240). The following display area variables are blanked (Block 103~60):
select, variable gtdsela; name, variable dnamea; input proc, variable dipnm; and output proc, variable dopnm. The return code, ~C, and number of panels, NP, are initialized (block 103330) and the panel table, $P, is blanked (Block 103360).
The STDE table is scanned, adding the menu and panel entry names to the TP, counting the number of entries added to the table, and saving this number in the TP. The TP contains a unique list of panel and menu names sorted in ascending order. The index ~or the number of panels in the panel table, i, and the index for th~ screen edit list, j, are initialized ~o zero (Block 103570).

Blocks 103580 through 103725 constitute a process by which the initial panel list item to be displayed on the screen is located in the panel list table. Then the initial panel name and as many subsequent panels names as will fit on the display panel are placed in panel list display fields with the corresponding panel characterization information from the STDE table for each panel entry displayed. The , , : ~ , ~ , ,, . , :. . .
.''. ~ ~
.. . .

~ ~ 2 ~ ~ c~3 .~

process is finished when all panel names up to the end of the list or all panels names which will fit on the screen and their characterization data, have been placed in the display fields.

Decision Block 103580 checks to see if i is greater than or equal to the number of panels in the panel table.
If i is greater than the number of panels in NP, the procedure jumps to Block 103750~ If not, the procedure checks to ses if j is greater than or equal to the number of procedure entries (16) which will fit on a screen (Block 103590)~ If j is greater than or equal to 16, the procedure jumps to Block 103750~ If not, the procedure checks to see if the current panel in the panel table is greater than or e~ual to the next panel, dname, requested by the user (Block 10359S)o If the current panel name is not greater or equal to the next panel name, the procedure jumps to Block 103720.
If the current panel name is greater or equal to the next panel name, the jth item in the edit list is initialized to the following values: panel name, variable dnamea = TP at index i; input procedure, variablle IETIMENU; and output procedure, variable IETIOMENU (Block 103610).

The procedure scans the STDE ta]ble entries for a panel entry with the current panel name, STDETYP-P and TP(i)=STDENAME (Block 103640). Decision Block 103650 checks to see if the search was successful. If it was, the procedure initialize~ the jth item in the edit list to the following ~alues: input procedure, dipnm(j) = S~DEIPNM;
output procedure, dopnm(J) = STDEOPNM (Block 103660) and increments j ~Block 103700). If the search was not successful, the procedure just increments j (Block 103700).
Block 103720 increments index i and then returns to Block 103580.

Blocks 103775 through 104035 constitute a process by :. . ~ . .. .. - .

~;3,~

which each user request for each panel list item is examined. If an add, delete, change, or edit request is identified, then the appropriate task is performed. The process is complete after the requests have been identified and performed for each panel in the list.

J is initialized to zero (Block 103770) and the procedure checks to see if j is greater than or equal to the number of procedure entries (16) which will fit on a screen (B1QCk 103775). If j is greater or equal to 16, the procedure jumps to Block 104040. If not, the procedure checks to see if there is an add panel request~ GTDSELA =
'a' or 'A' (Block 103810).

If there is an add request, a panel is displayed requesting the panel characterization information as described in the panel record type of the TDF. The input values are validated. This typically involves translating the panel name, input and output procedures, and option flag to upper case and ensuring that the option flag value is either ~Iyl~ or "N" (yes or no~. The option flag value determines if the panel should be generated with or without an option field. After the input values are validated, an attempt is made to add the new panel entry to the STDE table for later ~torage in the TDF using the process de~cribed in Figure ~4 Block 45910~ Once the panel is added, the procedure jumps to Block 104030. If there is no add request, the procedure checks to see if a change panel request GTDSELA = 'c' or 'C' (Block 1o3a6o).

If there is a change request, the change request panel name is verified. A change request can not be performed if the panel is a system-defined panel, or if the panel is not defined in the STDE table. By not permitting changes in definition to system~defined panels, G~D ensures that the IET will operate on these panels as intended. If the panel ~, .

, ' .' ' , : ,: . : ~ -is not a system panel and is listed in the STDE table, then the values in the STDE panel entry are copied into the work area fields which correspond to a STDE entryl and a panel is displayed requesting changes for the panel characterization information. The input values are validated in similar fashion to the as add panel request of (Block 103810), and moved back into the STDE en~ry to complete the change. The only change the user is not permitted to perform with this implementation is a change to the panel name, although this change could easily be performed by deleting the old STDE entry and adding the new STDE entryO Once the panel is changed, the procedure continues to Block 104030.
I~ there is no change reques~, ~he procedure checks to see if there is an delete panel request, gtdsela = 'd' or 'D~
(Block 103910).

If there is a delete request, the delete request panel name is verified. A delete request can not be performed if the panel is a system-defined panel, or iî the panel is no~
dafined in the STDE table. By not permitting deletions for system-defined panels, GTD ensures that the IET will operate as intended. If the panel is not a system panel, and is listed in the STDE table, then the panel is simply deleted by overwriting the deleted entry with the later entries in the STDE table. Tha STDE entry count, nent, is decremented.
once the panel is deleted, the procedure proceeds to Block 104030.

If thare is no delete request, the procedure checks to see if there is an edit panel request, gtdsela = 'e' or 'E' (Block 103960). If there is an edit request, the edit panel (Figure 29, Block 105410) procedure is performed, and the procedure proc:eeds to Block 104030. If there is no edit request, the procedure increments j (Block 104030) and returns to Block 103775.
Block 104040 performs the FE procedure (Figure 22, :: :-.::, .,: : .",,, ~, . ~,. . . :.,: . :.:

.: . :.:
:'. . :. :: ~.
. : .

~2~3~

Block 48130) to check for user input nd indications. If an end is not indicated (Block 104045), ~he procedure returns to Block 103240. If an end is indicated, the program exits procPdure EP.

~ DIT P~NEL~ ~PE PROCEDU~B. Looking now at Figure 29, which shows a flowshart of the preferred embodiment of this procedure, th~ GTD edit panel procedure begins by searching for the edit panel name in the STDE table (Block 105460). If the search is not successful, the program returns from the procedure without an error. If the search is successful, the procedure saves the panel name in variable GTDPMEM
(Block 105550), builds a panel map file name (Block 105560~, and checks to see if the file exists (Block 105750~. If the file doas not exist, ~he procedure generates a skeleton panel and goes to Block 105790.

Panels, or map source records, are generated in the format required by the map services employed. Specifically, the definition of each map record is built in a buffer using hard-coded specifications for each type of panel being generated (menu, glossary, information, help, or skeleton panels), and then written out to a map file. Speci~ications written into the map source include field names, field types, field row and column information, field lengths, field attributes and literal data. All these specifications are hard coded for each type of panel and are written out to the file in the most convenient manner. The details of the logic to generate the maps in ~he format required by the map services employed are map service dependent and will not be discussed herein.

Skeleton panels are created with the following fields defined in the IETTVW and required by the IET:

',. , `~ . ;
., , :.. : - , ,, , .. :

, ~. . . ~. , ~ :
.,: ,, . : . ; . : .:
.. .. : ,. . . ~ . , . . . :

2~2~ 3 ~

IEF1-TR~N, IEFl-PANEL, IEF1-SYSTEM, IEFl-CURROW, IEF1-CURCOL, IEF1-FUNKEY, IEFl-CURDT, IEF1-MSGID, IEF1-MSGTX, IEF1-MSGTX, IEF1-MSGAE, IEFl-USER, IEFl-OPTION
(optionally generated when gtdgof = Y), IEFl-LOOKAHEAD
(optionally generated when gtdglf = Y) If the file does exist, the procedure continues to Block I057g0. The procedure builds the panel edit parameters and file names (Block 105790), and invokes the map editor (Block 106210). Block 106230 checks to see if the map edit is success~ul. If the map edit is successful, th~ program exits procedure EPE. If the map edit is not successful, the procedure sets the error message field, gtdmsg, equal to "`~ANEL EDIT FAILED" (Block 106240), and exits the procedure with an error.

EDIT PROCEDURE ~Iæ~. This procedure is another third level procedure which provides a display panel which includes information from the TDF procedure record type.
This information characterizes a procedure entry definition and is displayed on the panel in a list. Since more procedure entries may be defined than may be displayed at one time, facilities are provide to allow navigation through the procedure list. Functions are al~o provided for adding new procedure definitions, modifying current procedure definitions, deleting current procedure definitions, displaying current definitions, and editing the procedure map. System-provided entries cannot be changed.

To add an entry to the procedure list, an 'A' is entered in the select field for a procedure. The user completes the 'ADD PROC~DURE' panel by providing a procedure name, a procedure description, a name of profile view associated with procedure, a name of input view associated with procedure, and a name of output view associated with ; : ,.: :
. .: . . - : : :: -:: : ,:
- . : , .' ' '': . :: ~

2 ~ 2 ~ ?, ~
procedure (if any).

The procedures can be identified as one of several types:

COB2 COBOL procedure. Will be processed by the COBOL II compiler using GTD options 4.5, 4.6, 4.8, and 4.9.

C C procedure. Will ~e processed by C compiler using GTD options 4.5, 4.6, 4.8 and 4.9.
.
ALC Assembly language procedure.

EXTE~N External procedure. ~rocedure is candidate to be LINKed-to by a procedure within this transaction.

ENTRY Procedure contained within ano~:her procedure in the transaction.

As other languages are employed, additional types of procedures may be identified.

A procedure can be designated as a relational data base, (DB) procedure and be processed by the appropriate pre-processor during the compile options. When the 'ADD
PROCEDURE' panel is completed, the entry will be added, and the updated procedure Iist presented.

To delete an entry ~rom the procedure list, a 'D' is entered in the select field.

To change an entry to the procedure list, a 'C' is entered in the select field. The user makes changes as necessary to the 'CHANGE PROCEDURE' panel. When the 'CHhNGE

:. , . , .. , . .~ ..: ::. ,. ~,, ,., ....,, ...:., .. - ~ .. 1 , " . . . .

2 ~
PROCEDURE' panel is completed, the changes will be inserted into ~he TDT and the updated panel list presented.

To edit an entry in the procedure list, enter 'E' in the select field for the desired procedure. If a C~B2 or C
procedure does not exist when it i5 requested for edit, a default procedure will be prepared and presented.

Figures 30a-~ depict the flowchart of the preferred embodiment of the EC procedure detailing these functions further.

The GTD edit procedure list procedure begins by scanning the select field for ~he locate command input by the user. The locate name is saved in the dname field of the transaction view. This locate name is used as the initial procedure entry to be displayed in the edit list. If there is no locate command, dname is set to blank (Block 106680).
The ~ollowing display area variables are blanked (Block 106690): select, variable gtdsela; name, variable dnamea;
input view, variable dipnm; output view, variable dopnm;
profile view, variable dpvnm; procedure type, variable gtdcty: rdbms flag, variable gtddb2 and debug flag, variable gtdxpd. The index for the screen edit list, j, is initialized to zero, and the pointer, e, is initialized to point to the beginning of the STDE table.

Blocks 106815 through 106935 constitute a process by which the initial procedure list item to be displayed on the screen is located in the STDE ta~le. Then the initial procedure name, and as many subsequent procedures names as will fit on the display procedure, are placed in procedure list display fields with the corresponding procedure characterization information from the STDE table for each procedure entry displayed. The process is finished when all procedure names up to the end of the list, or all procedures '' -.:

s~

names which will fit on the screen, and their characterization data have been placed in the display fields.

Decision Block 106815 checks to see if e points beyond the end of the STDE tabla. If so, the procedure jumps to Block 106940. If not, the procedure checks to see if j is yreater than or equal to the number of procedure entries (16) which will fit on a screen (Block 106830). If j is greater than or equal to 16, the procedure jumps to Block 106940. I~ no~, the procedure checks to see if the current procedure, ST~ETYPE=C, in the STDE table has a procedure name, STDENAME, greater than or equal to the next procedure name, dname, requested by the user (Block 106835). If the curren~ procedure name is not grea~er or equal to the next procedure name, the procedure continues to Block 106930. If the current procedure name is greater or equal to the next procedure name, the jth item in the edit list is initialized to the following values: name, variable dnamea = STDENAME;
input view, variable dipnm = STDEIPNM; output view, variable dopnm = STDEOPNM; profile view, variable dpvnm = STDEPVNM;
procedure type, variable gtdcty = STDECTYP; rdbms flag, variable gtddb2 = STDECDB2; and debug flag, variable gtdxpd = STDECXPD (Block 106840). J is incremented (Block 106910), e is incremented to point to th next STDE entry, and the procedure returns to Block 106815.

Block 106940 per~orms the procedure to display a panel (Figure 21, Block 47300) electing to display the GTDEC
panel.

Blocks 106955 through 107140 constitute a process through which each user request for each procedure list item is examined. If an add, delete, change, or edit request is identified, then the appropriate task is performed. The process is complete after the requests have been identified :. ,. , : ,,; ,.":: :, ; . . :

.::: : : ~ . : , . ., . - ., . . ~ : . . , , :;
.,. ::; ,,: .. . .

: , : i . , ~

and perfo~med for each procedure in the list.

J is initialized to zero (Block 106950) and the procedure checks to see if j is greater than or equal to the number of procedure entries (16) which will fit on a screen (Block 106955). If ~ is greater or equal to 16, the procedure jumps to Block 107210. If not, the procedure checks to see if there is an add procedure request, gtdsela = ~a' or 'A' (Block 106~90). If there is an add request, the add procedure (Figure 31, Block 107330) is per~ormed on the displayed procedure identified by index j (Block 107020) and the program proceeds to Block 107200. If there is no add request, the procedure checks to see if a change procedure request gtdsela = 'c' or 'C' (Block 107040). If there is a change request, the change procedure (Figure 32, Block 108470) is performed on the displayed procedure identified by index j (Block 107070) and the procedure proceeds to Block 107200. If there is no change request, the procedure checks to see if there is an delete procedure request, gtdsela = 'd' or 'D' (81Ock 107090).

If there is a delete request, the delete request procedure name is verified. A delete request can not be performed if the procedure is a system-defined procedure, or if the procedure is not defined in the STDE table. If the procedur~
is not a system procedure, and is listed in the STDE table then the procedure is deleted by overwriting the deleted entry with the later entries in the S~DE table. The STDE
entry count, nent, is decremented. Once the procedure entry is deleted, (Block 107120~ the program proceeds to Block 107200. If there is no delete reque~t, the procedure checks to see i~ there is an edit procedure request, gtdsela = 'e' or 'E' (~lock 107140). If there is an edit request, the edit procedure (Figure 34, Block 109440) is performed on the displayed procedure identified by index j and the procedure jumps to Block 107200. If there is no edit request, the -:- ~ :, ~:: -, -, : , .. , .: , ::

.. :. ::.:. . : ,:
.. :, ,, , ::
,: . :: : :. : : ; , : :

2 ~ 2 ~ 1 3 ~
procedure increments j (~lock 107290), and returns to Block 106g~5 . -Block 107210 performs the FE procedure (Figure 22, Block 48130) to check for user input end indications~ If an end is not indicated (Block 107215), the procedure returns to Block 106680. If an end is indicated, the program exits procedure EC.

~ DD P~OCEDURE U~R IN~ERFAC~- ECA PROCED~R~.
Considering now Figure 31, which depicts the preferred embodiment of this procedure according to the present invention, the GTD add procedure user interface procedure begins by blanking the work area field corresponding to the STDE entry fields (Block 107330~. The procedure performs the procedure to display a panel ~Figure 21, Block 47300) electing to display the GTDAC panel (Block 107440) requesting the user to define the procedure characterization information as described in the procedure record type of the TDF.

The procedure entry fields are validated (Block 107450). The validation includes translating the procedure name, input, output and profile views, and procedure type, data base procedure flag, and debu~ flag into upper case.
The profile view name, data base procedure flag, and debug flag are blanked out when a procedure is defined to have a type of EXTERN. The data base flag and debug flag are blanked out when a procedure is defined to have a type of ENTRY. All fields, data base procedure flag and debug ~lag, which have a required value of either "Y" or "N", are redefined to have a value of "N" if the value defined by the user is not "Y". Th~ procedure language type is defined to be C if the language defined by by the user is not COB2, ALC, or C.

,. . ~ , : , :

Block 107460 performs the FE procedure tFigure ~2, Block 48130) to check for ussr input end indications. If an end is not indica~ed (Block 107~70), the procedure returns to Block 107440. If an end is indicated, the procedure is added to the STDE table (Block 107510) for later storage in the TDF.

An attempt is made to add the procedure entry to the STDE. The attempt will fail if the procedure name provided is blank, if the STDE table is full or if the procedure name provided already exists in the table. If no error is det~cted, the procedure ~ntry is inserted in the STDE table in ascending procedure sequence as described earlier. The STDE entry count, nent, is incremented. Once the procedure is added, the program exits procedure ECA (Block 107520).

An attempt is made to add the procedure entry to the STDE. using the process described in Figure 24, Block 46040.
Once the procedure is added, the program exits procedure ECA
(Block 107520).

CXANGE PROCEDURE EN~RY: ECC PROCED~RE: Looking now at Figur~s 32a-b, which show the prefe:rred embodiment of the procedure, a flowchart of the ECC proc~dure provides thP
capability to change ~he procedure characteri ation information as stored in the TDF and to edit the user input, output and profile view files.

The GTD change procedure entry procedure begins with Decision Block 108490 checking if the input procedure name is a system procedureO System procedures include IETIHELP, IETOHELP, IETIINFO, IETOINFO, IETIGLOS, and IETOGLOS. If it is a system procedure name, then the GTD returns from procedure ECC with no error. If not, procedure ECC searches :: . :. , , , :

2 ~ J~
the STDE table for the input procedure name (Block 108670).
Decision Block 108730 checks to see if the input procedure was found. If not, the GTD returns from procedure ECC with no error. If the procedure is found, the STDE entry is copied into the corresponding work area fields (Block 108760).

Block 108780 displays the change procedure entry definition screen panel (GTDCC) procedure display (Figure 21, Block 47300) containing the TDF procedure characterization information for modification. Block 108790 validates the procedure entry fields using the process described in Figure 31, Block 107450. Blocks 108800 through 108820 handle the user request for editing of the procedure view files. ~ view file contains a list of all the transaction view variable names which the user determines are reguired for input, output, or profile view processing by the IET. Decision Block 108800 checks if the edit input view was requestPd. If so, construct the fully qualifiad input view name is constructed and the input view edited using procedurP do-edit (Figure 3.~, Block 43860). The procedure then continues to Decision Block 108810 to check if an edit output view was requestled. I~ so, the fully qualified output view name is const:ructed and the output view edited using procedure do-edit (Figure 32, Block 43860). ~he procedure advances to Decision ~lock 108820 to check i~ the edit pro~ile view was requested. If so, the fully qualified profile view name is constructed and the profile view edited using procedure do-edit.

At Block 108830, the FE procedure (Figure 22, Block 48130) is executed to check for user end indications.
Decision Block 108840 then checks if end is indicated. If not, the procedure returns to Block 108780. If end is indicated, then the program continues to Block 108870 where the STDE work area fields are copied back into the STDE

: . : .: : , , . :
: .. :. .., .;, , :
..

2~2~ ~ 31 entry, and the program exits procedure ECC (Block 108890~.

GTD EDIT FILENAM~: DO-~DIT PROC~D~RE: Continuing now to Figure 33, which shows a flowchart of the preferred embodiment of this procedure accoxding to the present invention, this do-edit procedure takes a fully qualified file name as input for editing.

The GTD edit filename procedure begins by building editor parameters (Block 44120) and then invoking the editor for the procedure (Block 44240). The edit parameters vary according to the editor being used. Generally all that would be required is the name of the editor (either unqualified or fully qualified), and the fully qualified name of the file to invoke the editor. This depends on the operating system platform and the editor being used. The name of the editor being used is stored as part of the environment information loaded at the beginning of the program and may vary. Decision Block 44310 checks if the edit was successful. If it was, the procedure do-edit is ended (~lock 44880). If the edit was not successful, the error message field is set to GTDMSG=PROCEDURE EDIT FAILED
(Block 44320). The procedure then returns with the error message (Block 44330).

G~D EDI~o ECE PROC~D~R~. Looking now at Figures 34a-b, which depict a flowchart of the preferred embodiment of this procedure, the GTD edit procedure begins by searching for the requested edit procedure name in the STDE table. Block 109530 checks to see if the search was successful. If it was not, the program exits the procedure without error. If the search was successful, the procedure checks to see if the procedure language is COBOL. If it is not a COBOL
program, the procedure proceeds to Block 109750. If it is a - ~ - ,, ~ , ;
, , -i: ,~, :
.-:
., ' : ; :~ .

COBOL program, the procedure builds a COBOL procedure file name (Block 109580), and verifies the procedure file exists (Block 10~670). If the file exists (Block 109675), the procedure jumps to Block 109750. If not, the procedure saves the procedure name in gtdpmem (Block 109680~, and generates (Block 109690) a skeleton program using the GCOBPROG procedure (Figure 35, Block 7~00). The program then j~mps to Block 109900, to do the edit.

Block 109750 checks to see if the procedure is in C
language. If it is not, the procedure continues at Block 109930. If it is in C, the procedure builds a procedure file name (Block 109760), and verifies the procedure file exists (Block 109850). If the file exists (Block 109855), the procedure proceeds to Block 109860. If not, the procedure savPs the procedure name in gtdpmem (Block 109860), and at Block 109870 generates a skeleton program using the GCPROG procedure (Figure 36, Block 114950).

Block 109900 performs the do-exit editor procedure (Figure 33, Block 43860) on the procedure file, and the program exits the procedure (Block 109930).

GENBRATE COBO~ PROGRAM: GCOBPROG PROCED~B.
Considering next Figures 35a-c, which depict the preferred embodiment o~ this procedure, the GTD generate COBOL program procedure begins by putting the COBOL procedure path name from gtdslib into the COBOL procedure file name (Block 7460). Then the procedure checks to see if the COBOL
procedure name is undefined, gtdpmem is blank (Block 7490).
If gtdpmem is blank, the program exits the procedure with an error. I~ gtdpmem is not blank, a fully qualified COBOL
procedure name file is built using the machine standard conventions (Block 7520). Once the COBOL procedure name is built, the program checks to see if the procedure ~lready : .. ... , ~ :
;. ~

::: :: ,: .: :

, : - :: , , :: . .

f _ , ~ ,_~

~xists (Block 7580). If the procedure does exist, the error message field, GTDMSG is set to "COBOL PROGRAM EXISTS"
(Block 7590), and the program exits the procedure with an error. II the procedure does not exist, an attempt is made to create the COBOL procedure filP (block 7630). If the create is not successful, the program exits the procedure with an error. If the create was successful, an index is initialized. to point to the first line of the skeleton program.

Decision Block 7670 checks for the end of the skeleton program initialization data (block 7670). If it is at the end of the initialization data, the procedure closes the COBOL procedure file tBlock 7910~ and exits procedure GC3BPROB (block 7920)~ If it is not at the end, this line is copied into the output buffer (Block 7700).

At this point the buffer contents are examined to locate the skeleton COBOL procedure lines which need customizin~ for the application. In the preferred embodiment of the present invention, the progrilm id, the transaction view copy file, and the first section name are customize~.

The line moved into the output buffer is checked to see if it is line 003000 of the skeleton program (Block 7710).
If it is line 003000, the program id, assumed to be definecl on this line, is set to the procedure name and the procedure move~: on to Block 7840. If it is not line 0003000, the procedure checks to see if the line moved into the output buffer is line 001200 of the skeleton program (Block 7740).
If ~o, the copy statement is set to the transaction view name and the procedure proceeds to ~lock 7840. If it is not line 001200, the procedure checks to see if the line moved into the output buffer is line 001800 of the skeleton program (Block 7770). If it is, the section header is set to contain the procedure name and the procedure continues to : .
,~
., , , , ~ ~
.': , : .'. : -,.: :: : , : ~

:: , : .,, , . .
. :

. 3 ~

Block 7840. If it is not line 001800, execution continues with Bloc~ 7840 where the procedure termin~tes the line in the output buffer by placing a new line character at the end of the line. This line termination is a UNIX convention~
Other terminal conventions may be used, such as filling a line with line spaces (a main frame~.

The output bu~er is then written to the COBOL
procedure file (Block 7850), and the procedure checks to ~ee if the write was ~uccessful (Block 7855). I~ so, the procedure increments the index to point to the next lina of the skeleton program and returns to Block 7670. If the write was not successful, the error message field GTDMSG is set to "COBOL PROGRAM WRITE ERROR" (Block 7860), the COBOL
procedure file is closed (Block 7910). The program than exits the procedure (Block 7920).

GTD G~ERATE C PROG~AM: GCPROG ~?ROCEDURE: Looking now at Figures 36a-c, which show the preferred embodiment of this procedure according to the present invention, the GTD
generate C program procedure beyins by putting the C
procedure pathname, gtdslib, into the C procedure file name (Block 115010). Decision Block 115040 checks to see if the C procedure name is undefined, gtdpm~m is blank. If blank, the procedure is exited with error. If not blank, the procedure name is validated by converting to uppercase. If valid, a fully qualified C procedure file~name is built with procedure name gtdpmem and current machine standard naming convPntions (Block 115180). Decision block 115130 checks if the C procedure file exists. If not, the procedure continues to Block 115180. If the C procedure file exist~, the procedure sets the error message field GTDMSG equal to "C PROGRAM EXISTS" (Block 1~5140) and exits the procedure file (Block 115150).

. ",',''; ' ' . ; ~, . ' ,' ' ,., ', I , ', ~ ' ' ' "'' '` '' ','' ~ ;' ~ ' '.

Block 115180 creates the C procedure file. Decision Block 115190 checks whether the create was successful. If not, the program exits the procedure with error. If the create was successful, the index is initialized to point to the first skeleton program line initialization data (Block 11521~).
Decision Block 115220 checks for the end of the skeleton program initialization data. If the end of the initialization data is found, the procedure jumps to Block 115~90. If the end of the initialization data is not found, then the procedure copies the line of skeleton program into the output buffer (Block 115250). Decision Block 115270 checks if the line of skeleton C program in the buffer contains the transaction view include statement. If so, the transaction view name is customized to refer to the applicatisn C transaction view file name. If not, Decision Block 115340 checks whether the line of skeleton C program contains the procedure name Por the skeleton C program. If so, then the procedure name is customi~ed to refer to the application C procedure nameO If it does not contain the procedure name, then execution continues with Block 115410 by terminating the line in the buffer. The program writes the buffer to the C procedure file ~Block 115430) and checks if the write was successful (Block 115435). If write is successful, the program increments the index to point to the next C skeleton procedure line (Block 115470) and then return to BlocX 115220. If the write is not successful, the procedure sets the error message field GTDMSG="C PROGRAM
WRITE ERRO~" (block 1154~0). The program then closes the C
procedure file (Block 115490) and ends procedure GCPROG
(Block 115500).

EDI~ ~EN~ LI~T. This procedure is another third level procedure which provides a display panel which includes information from the TDF menu record type. This information characterizes a menu entry definition and is displayed on ....
. :: .:: : .. .- -:: .: ; .,. . ,~
~, .. -:, . : ; .:
.: . .,: :: ~ : . :. :

,, :.

r~

the panel in a list. Since more menu entries may be defined than may be displayed at one time, facilities are provided to allow some navigation through the menu list. Functions are also provided for adding new menu definitions, modifying current menu definitions, deleting current menu definitions, and displaying current definitions.

GTD option 1.~ presents the application designer with the 'EDIT MENU' panelO The designer can ~dit entries within the four level hierarchy of menus supported by the GTD
system. Upon initial request, the Master Menu for the transaction will require appropriate select codes, descriptions, a panel to be presented when a selection is made, and a procedure to be invoked when an entry is selected ~optional).

To add an entry to the menu, an 'A' is entered in any select field. This presents an 'ADD MENU ENTRY' panel, allowing addition of a select code, a description, a panel to be presented when selection is made, or a procedure to be invoked when entry is selected (optional). When the /ADD
MENU ENT~Y' panel is completed, the entry is added, and the EDIT MENU panel will be presented.

To delete an entry from the menu, a 'D' is entered in the select field.

To change an entry to the menu, a 'C' is entered in the select field. The user makes changes as necessary to the 'CHANGE MENU ENTRY' panel which allows changes to the description, panel name, or output procedure name. When the 'CHAN&E MENU ENT~Y' panel is completed, the changes will be incorporated, and the EDIT MENU panel presented.

The GTD system supports four levels of menus. To select a lower level menu to be edited, enter a selection .
:, ., ~. : ;
, : . .. : ~ .~ : ~
.: , .~ .' :: , : : :. .:

.. . . : ~, . . i .
:.. :: : : , : .
: : .. ,: , :
: :,., ,.: , , :

sequence in the form S(select.select.select) in the command line of the 'EDIT MENU' panel. This specifies the menu within the hierarchy the designer wants to edit. This is a cumulative process. The designer must define the Master Menu first and indicate an entry on the Master Menu is intended to reference a sub-menu by specifying an entry selection code, description field, and panel name that will be the name o~ this sub-menu, leaving the output procedure name blank. This continues (repeats3 for up to four levels.

Figures 37a d depict the flowchart of the preferred embodiment of the EM procedure detailing these functions further.

The GTD edit menu hierarchy procedure begins (Block 110320) by copying the last menu hierarchy select request into the workarea select field, w.gtdsel. Block 11330 blanks the menu names and selects codes for each level of the hierarchy, then Block 110430 validates and parses the selection request (if any) into select codes for each level in the hierarchy. The format of a selection request is S(xl.x2.x3); the "S(" or "s(" is searched for as the be.ginning of the request~ If the keyword is found, then each x value is located and assigned to a hierarchy selection code. (xl is assigned to hierarchy level 1, x2 is assigned to hierarchy level 2, and x3 i5 assigned to hierarchy level 3). If no hierarchy level is requested then its value is left blank, indicating no reque~t specified for that level. If the display request is not for the first level of the hierarchy (Block 110490), the program proceeds to Block 110580. If it is, Block 110500 prepares the menu display workareas with the first level menu entries/
procedure EMS (Figure 38, Block 111240) and gets the next level menu name. Block 110510 displays the first level of the hierarchy edit list and saves the next hierarchy selection request panel in GTDEM0 (displays an edit list for ~. ~ ' ' :

.. :., ' .~ , , ' . :

'~ ''; , ~

information in the first level of the hierarchy). This process involves getting the new date/time and formatting the screen date/time fields. The panel interpretor is called to generate the screen output. GTDMSG is set to blanks and the panel map interpretor is called to obtain user panel input. After input is obtained, the user select field is saved ~Block 110510).

Block 11052Q executes the edit menu list, procedure EMX
(Figure 39, Block 111640). Block 110530 checks for a user end indication, procedure FE (Figure 22, Block 48130). If the end is indicated (Block 110535) the program exits the procedure (Block 110~90). If not, the program returns to Block 110320 and continues processing.

If the display request was not for the first level of the hierarchy (Block 110490), Block 110580 determines if the request is for the second level of the hierarchy. If not, the program jumps to Block 110680. If it is, Block 110590 prepares the menu display workareas with the first level requested menu entries, procedure EMS and gets the next level menu name. Block 110600 prepares the second level menu display workareas with the seconcl level requested menu entries, procedure EMS and gets the next level menu name.
Block 110610 displays the second level hierarchy edit list and saves the next hierarchy selection request on panel GTDEMl (displays an edit list for the second level menu as well as selection and description information on the previous level) as described in Block 110510. BlocX 110620 executes the edit menu list, procedure EMS. Block 110630 checks for a user end indication, procedure FE. If the end is indicated (Block 110632) the program exits the procedure (Block 110890). If not, the program returns to Block 110320 and continues processing.

If the display request was not for the second level of - . ' : ... ,. .. : `' . :

~' : : , ' ' .:

the hierarchy (Block 110580), Block 110680 determines if tha request is for the third level of the hierarchy. If not, the program jumps to Block 110790. If it is, ~lock 110690 prepares the first level menu display workareas with the first level requested menu entries, procedure EMS and gets the next level menu name. Block 110700 prepares the second level menu display and workareas with ~he second requested menu entries, procedure EMS and gets the next level menu name. Block 110710 prepares the third level menu display workareas with the third level request menu entries, procedure EMS and gets the next level menu name. Block 110720 displays the third level hierarchy edit list and saves the next hierarchy selection request panel in GTDEM2 (displays an edit list for the third level menu as well as selection and descriptive information on the previous 2 level menus) using the process described in Block 110510.
Block 110730 executes the edit menu list, procedure EMX~
Block 110740 checks for a user end indication, procedure FE.
If the end is indicated (Block 110745) the program exits the procedur~ (Block 110890). If not, the program returns to Block 110320 and continues processing.

I~ the display request was not for the third level of the hierarchy (block 110680), Block 110790 prepares the first level menu display work areas with the ~irst level requested menu entries, procedure EMS and gets the next level menu name. Block 110800 prepares the second level menu display and workareas with the second requested menu entries, procedure EMS and gets the next level menu nam~.
Block 110810 prepares the menu third level display workareas with the third level request menu entries, procedure EMS and gets the next level menu name. Block 110820 prepares the forth level menu display work areas with the fourth level request menu entries, procedure EMS and gets the next level menu name. Block 110830 displays the fourth level hierarchy edit list and saves the next hierarchy selection request on ,: : . , ':,,., ~
. : ~, ,:,: i. .. . .

":''' " ' `' , ~
::~

panel GTDEM3 ~display and edit list for fourth level with selection and description information for the previous 3 levels~ using the process described in Block 110510.

In the currently supported menu hierarchy, only four levels are supported, but more levels could be supported by extending the logic presented here to cover more levels.
Since the edit menu list display panel actually displays description and select information from previous levels in the hierarchy, new panels could be desi~ned to display more levels and thereby extend the current logic and data area usage. Alternatively, logic could be added after handling the fourth menu hierarchy to display the previous 3 levels selected and describe information for menu hierarchy levels greater than 4.

Block 110850 checks for a user end indication, procedure FE ~Figure ~, Block 48130). If the end is indicated (Block 110855) the program exits the procedure (Block 110890). If not, the program returns to Block 110320 and continues processing.

GTD PR~PAR~ NE~ DI~P~Y: EN~ PROC~DURE. Figure 38 depicts a flowchart of the preferred embodiment of this procedure, according to the present invention. The GTD
prepare menu display procedure initializes the display areas for the description, output panel, and output procedure for each menu entry in the current menu. It takes as input the name of the current menu to be displayed, the workarea in which to place the select/description information, and the next menu select code. The EMS procedure outputs the initialized workareas for the current menu and the menu name corresponding to the next menu select code.

The EMS procedure begins by blanking out the menu : : :. :.,.. . .:; . . ~ .

: - , -, ~ ~::, ;

2 ~
display areas dnamea, dopnm, and dipnm in the workarea description (Block 111320), then initializing j to zero and the pointer e to point to the beginning of the STDE table (Block 111400~. Decision Block 111405 checks if e is pointing beyond the end of the STDE table. If so, the program exits the procedure tBlock 111550). If e is not pointing bayond the end of th~ STDE table, the next Decision Block 111420 checks i~ the entry will fit on the screen, that is, if index j is greater than or equal to the number of menu entries that will fit on the screen (16). If so, the program exits the procedure ~Block 111560). If not, Decision Block 111425 checks if the STDE entry is a menu entry (STDETYP=E) and if the STDE menu entry name STDENAME
is ~qual to the input menu name, menu. If not, the program exits the procedure (Block 111560). If so, the program initializes the jth item in the edit list and sets the following parameters: panel name is set to dnamea=STDEIPNM;
output procedure name is set to dopnm=STDEOPNM; description is set to ST~ESEL, ' - ', including the portion of STDEDESC
that will fit in the field, (Block 111430). The next step increments index j for the panel edit list (Block 111500).
Then~ decision block 111510 checks if the select code o~ the menu entry is equal to the next select code input value. If th~ menu entry is equal to the next select code input value, then the procedure initializes the next menu name t~ the menu entry panel name, STDEIP~M (Block 111510). Otherwise, the program increments pointer e to point to the next STDE
entry (Block 111550t and returns to Decision Block 111405 to check if e is pointing beyond end of ST~E table. If so, the program exit~ the procedure (Block 111560). If not, at Block 111405, the program returns to Block 111420 and continues processing.

GTD ~DIT NEN~ T: EM~ P~OC~D~RÆ. Figure 39 depicts a flowchart of. the preferred embodiment of this procedure ~, .

~, ..
~. , :

wherein, the EMX procedure processes the user add, delete, and change menu entry request operations for the menu entry edit list displayed.

The GTD edit menu list procedure begins (Block 1116703 by initializing index j to zero and setting pointer e to the beginning of the STDE table. At Block 11680, the procedure then determines whe~h r the e pointer has moved beyond the end of the STDE table. If so, the program jumps to Block 111790. If the e pointer has not moved beyond the end of the ST~E table, the procedure determines (Block 11690~ whether the entry is a menu entry (STDETYP = E) and if the menu entry name is equal to the input menu name (STDENAME =
menu). If not, the procedure continues at Block 111780, to examine the next entry in the STDE table. If it is, the procedure determines whether the command for the jth menu entry on panel is a change command (Block 111700).

If it is a change request, the values in the STDE menu entry are copied into the work area fields which correspond to a STDE entry and a menu is displayed requesting changes for the menu characterization information. The input values are validated by translating the output panel and output procedure, gtdeipnm and gtdeopnm, to upper case, and then moved back into the STDE entry to complete the change. The only change the user is not permitted to perform wi~h this implementation i5 any change to the menu name; although, this changa could easily be performed by deleting the old STDE entry and adding the new STDE entry.

If it is not a change co~mand, the pro~ram determines iP the command for the jth menu entry on the panel is a delete command (Block 111730). If it i~, the procedure deletes the menu en~ry in the STDE table by overwriting the deleted entry with the later entries in the STDE table. The STDE entry count, nent, is decremented and e is modified to : .~ ' ' . ::

~ ~3 point to the previous STDE entry.

If not, the procedure increments index j for panel edit list (Block 111760), then moves the e pointer to the next STDE entry (Block 111780), and returns to Block 111680 to continue processing.

Block 111790 initiali~es the panel menu entry counter and se~s index j to z~ro. The procedure then determines if the panel menu entry counter, j, is greater than or equal to the number of menu entries which will fit on the screen (14) tBlock 111795). If the counter has reached the maximum, the program exits the procedure (Block 111850). If the counter has not reach~d the maximum, the program determines if the command for the jth menu entry on panel is an add request (Block 111800). If it is, the work area fields which correspond to a STDE entry are cleared, the menu name initialized, and a panel is displayed requesting new menu entry characterization information from the user. The user input values are validated by translating the output panel and output procedure names, gtdeipnm and gtdeopnm, to upper case and then the menu entry is added using the process described in Figure 33, Block 4~290. If not, the procedure clears the menu entry command code (Block 111830), increments index j for panel edit list (Block 111840), and return~ to Block 111795 to continue processing.

~ DIT ~ANGUAGE LI8T. This procedure is another third level procedure which provides a display panel which includes information from the T~F languagie record type.
This information characterizes a language entry definition and is displayed on the panel in a list. Since more language entries may be defined than may be displayed at one time, facilities are provided to allow navigation through the language list. Functions are also provided for adding . -:
, . :, . ' , ; ::i :,, ~. ~ "
' ~'' ` ' ` ; ` , , 1 : - :
;

2 ~ ~J '~f;

new language definitions, modifying current language definitions, deleting current language definitions, and displaying current definitions.

When the user requests HEL~ documentation, GLOSsary support, or INFOrma~ion, the Language of Preference field determines the appropriate documentation to present to the user. If the documentation does not exist in the user's language of preference, English documentation will be presented, if available.

The GTD system supports applications that use HELP, GLOS, and INFO documentation to describe the functionality of the application. This documentation is maintained as part o~ the TDT. As the TDT is initially built, the designer can specify the report and generation to designate the documentation location. This feature can be extended to support multiple languages through the Edit Lanuage List facility. The Edit Language list facility allows the designer to edit a list of languages and the associated report.generation for the documentation. The application designer can then provide documentation in the user's language of preference.

GTD 1.5 presents the designer with a list of languages specified for this TDT. Each language entry includes a report and generation specification to identify where the documentation resides for that language. The designer can add, change, or delete entries within this language list, by entering 'A', 'C', or 'D', respectively, and modifying the entries as necessary.

Figures 40a-f depict the flow chart of the preferred embodiment of the EL procedure, detailing these functions further.

,~ ~ ; ;,.......... .. . . ..

:
.: : .

.:
. :~ ~ :::.:, ,,, :
, . :;
:: :, ,:
. , : :

~2~

The GTD edit language list procedure begins by gcanning the select field for the locate command input by the user.
The locate name i5 saved in the dname field of the transaction view. This locate name is used as the initial language entry to be displayed in the edit list. If there is no locate command, dname is set to blank (Block 113100).
The following ~isplay area variables are blanked (Block 113110): select, variable gtdsela; name, variable dnamea;
report, variable dipnm; and generation, variable dopnm.
Index, j, and pointer E are initialized to the ~eginning of the STDE tahle (Block 113180).

Blocks 113185 through 113260 constitute a process by which the initial language list item to be displayed on the screen is located in the STDE table. Then the initial language name, and as many subsequent languages names as will fit on the display, are placed in language list display fields with the corresponding language characterization information from the STDE table for each language entry displayed. The process is finished when all language names up to the end of the list, or all languages names which will fit on the screen, and their characterization data have been placed in the display fields.

Decision Block 11318S checks to see if e is pointing past the end of the STDE table. If it is, the procedure jumps to Bl~ck 113270. If not, the procedure checks to see if j is greater than or equal to the number of language entrie~ (16) which will fit on a screen (Block 113200). If j is greater than or equal to 16, the procedure jumps to Block 113270. If not, the procedure checks to see if the current language ~STDETYP=L) is an STDE table language name, STDENAME, greater ~han or equal to the next languaye name, dname, requested by the user (Block 113205). If the current language name is not greater or equal to the request language name, the procedure jumps to block 113260. If the - . ~
,:,., . :, : ',' ~ .' - , . .
, .
, . . ~ '' : .. , , ~

current language name is greater or equal to the next language name, the jth item in the edit list is initialized to the following values: name, variable dnamea = STDENAME;
report, variable dipnm = ST~EIPNM, and generation, variable dopnm = STDEOPNM (Block 113210). The procedure increments index j (Block 113240), increments pointer e to point to the next STDE entry (Block 113260) r and then returns t~ Block 113185, to continue processing.

Block 113270 performs the procedure to display a panel (Figure 21, Block 47300), electing to display the GTDEC
panel.

Blocks 1132~5 through 113475 constitute a process by which each user request for each language list item is examined. If an add, delete, or change, request is identified then the appropriate task is performed. The process is complete after the requests have been identified and performed for each language entry in the list.

J is initialized to zero (block 113280) and the procedure checks to see if j is greater than or equal to the number of language entries (16) which will fit on a screen (Block 113285). If j is yreatar or equal to 16, the procedure proceeds to Block 113480. If not, the procedure checks to see if there is an add language request, gtdsela =
'a' ~r 'A' (Block 113310).

If there is an add request, a language is displayed requesting the language characterization information as described in the language record type of the TDF. The input values are validated. This typically involves translating the language, documentation report, and documentation generation names to upper case. After the input values are validated an attempt is made to add the new language entry - .. .
,. :

, , to the STDE table for later storage in the TDF. The attempt will fail if the language name provided is blank, if the STDE table is full, or if the language name provided already exists in the table. If the no error is detected the language entry is inserted in the STDE table ascending language sequence. The STDE entry count, nent, is incremented. Once the language is added, the procedure jumps to Block 113470. If there is no add request, the procedure checks to see i~ a change language request gtdsela = 'c' or 'C' (Block 113360).

If there is a change request, the change request language name is verified. ~ change request can not be performed if the language is not defined in the STDE table.
If the language is listed in the STDE table, the values in the STDE language entry are then copied into the workarea fields which correspond to a STDE entry and a language is displayed requesting changes for the language characterization information. The input values are validated as described for an add language re~lest (Block 113310) and moved back into the STDE entry to complete the change. The only change the user is not permittecl to perform with this implementation is a change to the language name. Once the language is changed the procedure proceeds to Block 113470.
If there is no change request, the procedure checks to see if there is an delete language request, gtdsela = 'd' or 'D' (Bloc~ 113410).

If there is a delete request, the delete request language name is verified. ~ delete request can not be performed if the language is not defined in the STDE table.
If the language is listed in the STDE table, then the language is deleted by overwriting the deleted entry wîth the later entries in the STDE table. The STDE entry count, nent, is decremented. once the language is deleted the procedure moves to Block 113470. If there is no delete . . .
.
..
. , ~, .

request, the procedure increments j (Block 113470) and returns to Block 113285.

BlocX 104040 performs the FE procedure (Figure 2?, Block 48l3n) to check for user input end indications. If an end is not indicated ~Block 113485), the procedure jumps back to block 113~00. I~ an end is indicated the program exits procedure EL.

PUT TDF: PTDT PROCEDURE Looking now at Figures 4~a-d, which depict a flowchart of the preferred embodiment of this procedure according to the present invention, the Put TDF
procedure begins by determining (Block 46790) if an STDE is created (number of entries, nent, is less than zero). If not, the program returns from the procedure with an error.
If an STDE is created, the program opens a TDF file for output (Block 46820). If the TDF file open is not successful, the program returns from the procedure with an error. If it is successful, the program (Block 46850) copies the TDF header from the transaction view work area into the output buffer and at Block 46860 writes the TDF
header record to the TDF file using TDTPUT procedure (Figure 43, Block 15440). Next the TDF first header extension record fields are copied ~rom the transaction view workarea into the buffer (Block 46870~, and at Block 46880, the TDT
head~r record is written to the TDF file using the TDTPUT
procedure. Next the TDF second extension header record fields are copied from the transaction view workarea into the buffer (Block 46890), and at Block 46900, the TDT header record is written to the TDF file again usi~g the TDTPUT
procedure.

Block 46940 moves pointer e to the beginning of the STDE table. If the pointer (Block 46945) is past the end of the STDE table, the program continues at Block 47010. If ,. ';
- ;. ... ~: , ; : : . .
~; "' , , . .
: .
. :: : . :.
: . :
' ~

not, Block 46950 copies the STDE entry at e into the buffer and Block 46960 writes the TDF record to the TDF file using the TDTPUT procedure. Decision Block 46965 determines if the write is success~ul. If so, the proyram proceeds to Block 47000 where pointer e is increm~nted to the next STDE entry in the table and the program proceeds to Block 469~5. If not, the error message field is set, GTDMSG= "TDT ~RITE
ERROR" (Block 46970), and the program jumps to Block 47010 which blanks the output buffer, and Block 47020 writes the TDT record to the TDF file using the TDTPUT procedure. The TDF file is then closed (Block 47090) and the procedure is exited (Block 47040).

W~ITB ~DF R~CORD: ~D~PUT PROCED~E. Moving now to Figures 43a-b, which show a flowchart of the preferred embodiment for this procedure, according to the present invention, the GTD write TDF record procedure begins by setting the buffer length to equal the length of the position of last non-blank character in the buffer (Block 15480). The record length is set equal to the length of the buffer plus the 4 byte header (Block 15530). The first two bytes of the header are set equal to the buffer length in BI~_ENDIAN format (Block 15570). The second 2 bytes of the header are set to zeros (Block 15590) and the 4 byte header is written to the transaction definition file (TDF).
Decision Block 15605 checks to see if the write was successful. If it was not successful, the error message out, GTDMSG~ is set equal to "MAPLIB WRITE ERROR" (Block 15610) and the procedure is exited with an error (Block 15620).

If the write was successful, the procedure checks to see if the buffer length is equal to zeros (Block 15640).
If the buffer length is zeros, the program exits the procedure without an error. If not, the buffer is written ': , .
.
..
.
.

~ $ ~

to the TDF (Block 15670). The procedure checks to see if the write was successful (Block 15675), and if it was, exits procedure TDTPUT at Block 15710. If the write was not successful, the procedure sets the error message out, GTDMSG, to ~MAPLIB WRITE ERROR'I (Block 15680) and exits the procedure with an error (Block 15690).

EDIT TRAN8AC~IO~ WIEW. This third level procedure provides a capability to edit the application transaction view. A default transaction view is generated at the time default TDF entries are defined. This default transaction view consists of a workarea definition which includes only the system-required IETTVW structure variables, typically with a C "include" or CO~OL "copy" statement. The application dependent variables are defined following the IETTVW variables.

.. ' . ' ' ' ' '' ' '"' "' ' ~' ~ ' ' . .~ .~.. ,. .. ~
. ', ' ~

GENERATE TRAN8ACTION VIE~W/~;OURCE PROGRA~. The next major area of the GTD involves the Generate Transaction View/Source program which provides function to allow the application developer to generate the source files for the transaction view (the application data area) and programs.
The transaction view and source programs ar~ constructed so as to be compatible with the IET. This builds the required IET application interfaces into the data areas in the transaction view and into the program linkage for the application procedure.
;~

~ ENERATING GTD TRANSACTION VIE~8. Transaction views are the basis for procedures, panels and views to reference data itemsO The application designer must define the structure of the transaction view. A required portion of the transaction view is used by the system to reference system data items. These system variables include userid using transaction, system where transaction is running, current date, current time, function key pressed when transaction was invoked, and other key parameters.

The system generates a start~ar transaction view upon the first save of the TDT. The GC procedure presents the application designer with a transaction view generation screen. This screen allows the designer to specify the MAPLIB in which the TDT member is maintained, and the name of the TDT member. The format of the system-defined transaction view is described in Appendix C.

Figures 44-46 depict flowcharts of the preferred embodiments of various aspects of this program.

The GC procedure defined at Figure 44, Block 6900 provides the interfaces neccessary to generate a transaction . . . ~ .:

G
' " ' , ~ , :

- , Cf_'_ view, C procsdure, or COBOL procedure. Specifically, the source is generated to be compatible with the IET. The transaction view generated stores the data fields required by the IET in a portion of the application transaction view, known as the IET transacaction view, named IETTVW. The programs generated have the appropriate program entry points and program linkage defined so that the IET can call the generated application procedure and receive control back when the procedure terminates. The application program must be generated to be a callable procedure with one data area to be used as input. This data area is the transaction view. The application program must use the procedure name as the entry point and must return control back to its caller when program processing is complete. Generating a skeleton transaction view and application procedures, GT~ facilitates the generation of applications which are compatible with the I~T, thereby ensuring the IE~ will operate on these panels as intended.

The technique used to generate the transaction view, C
procedure and COBOL procedures is basically the same. An initialized data structure is defined in the GTD program which contains the standard definition. Each data structure record is moved into a buffer, customized if neccessary, and then written to the source file. This process continues until the end of the data structure is located.

Other techniques for accomplishing the present invention could involve obtaining the standard definition from other sources such as a GTD system configuration file.
Also, the process could be extended through the use of a CASE product such as Texas Instruments' IEF, which would allow the application developer to build a specification o~
the application procedure with the CASE product,and then a complete, or more fully defined, procedure may then be generated using the same CASE product. The requirements for , :. : .. .
: : . .,: . ~ '; :

:;
,, :
, : .
::

IET interfaces and data areas would be comprehended in the application procedure specifications.

~ elow are listed the third level menu options under the second level m~nu GENERATE TRANSACTION VlEW/SOURCE PROGRAM.
In addition to selecting a menu option to perform, the user is also required to provide 2 additional pieces of information: the name of the TDF file (gtdmmem), and the library or pathname under which the TDF file may be accessed (gtdmlib). These 2 pieces of information are required to perform any of the menu functions. Input fields for these values are included on each of the second level hierarchy menues.

2. GENERATE TRANSACTION VIEW/SOURCE PROGRAM
2.1 GENERATE TRANSACTION VIEW
2.2 GENERATE SKELETON COBOL PROGRAM
2.3 GENERATE SKELETON C PROGRAM
2.4 EXIT

Menu option 2u1, GENERATE TRANSACTION VIEW, provides a capability to generate the application transaction view.
This default transaction view consists of a workarea definition which includes only the system required IETTVW
structure variables, typically with a C "include" or COBOL
"copy" statement. The application dependent variables are defined after the IETTVW variables. The flow chart of the GTVW proceduxe starting with Figure 26, Block 8200 details this functions further. The GTVW procedure has been explained in detail earlier, therefore such discussion will not be repreated here.

Menu option 2.2, GENERATE SKELETON COBOL PROGRAM, provides a capability to generate an application COBOL
skeleton program. The flow chart of the GCOBP procedure (Figure 45) starting with Block 7230) details this '.' ,' .

.
- .

.F. ~.
2 ~ 2 3 ~ C~ i~
capability further.

Menu option 2O3~ GENERAT~ SKELETON C P~OGRAM, provides a capability to generate an application C skeleton program.
The flow chart of the GCP proceduxe (Figure 46, starting with Block 8000) details this capability further.

GTD ~N~RA~B ~RAN8ACTION/VIEW, COBOL/C PROGRAM: Gr P~OC~DURÆ. Looking first at Figures 44a-b, which depict the pre~erred embodiment of this procedure, the second level GTD
generate transaction/view, COBOL/C program procedure begins by performing the proceduxe (Figure 21, Block 47300) to display a GTDGC panel (Block 6940). When the procedure is completed, the FE procedure (Figure 22, Block ~8130) checks to see i~ the user has indicated he is finished using this procedure (Block 6950). If a user end is indicated, the program jumps to Block 7150 and exits procedure GC. If not, the program (Block 6980) performs the load/create transaction definition file (TDF) GTDT procedure (Figure 24, Block 44960).

When the GTDT procedure is completed, the program checks to see i~ variable GTDSEL=1 (Block 7000). The GTDSEL
variable represents user input, typically a menu selection, from the panel. When GTDSEL=l, the user accesses the create transaction view GTVW procedure (Figure 26 r Block 8200~ ~
When the GTVW procedure is complete, the program returns to Block 6940 to see if ~he user requires any other procedures from this panel.

If GTDSEL does not equal 1, the program checks to see if GTDSEL=2 (Block 7050). When GTDSEL=2, the user accesses the generate COBOL skeleton program GCOBP procedure (Figure 45, Block 7230). When the GCOBP procedure is complete, the program returns to Block 6940 to see if the user requires . . . .

:: :,: '-, ' : :.: :

any other procedures from this panel. If GTDSEL does not equal 2, the program checks to see if GTDSEL=3 (Block 7100).
When GTDSEL=3, the user accesses the generate C skeleton program GCP procedure (Figure 46, Block 8000). When the GCP
procedure is complete, or if GTDSEL does not equal 3, the program xeturns to Block 6940 to see if the user requires any other procedures from this panel.

GEN~R~TB COBO~ PROCED~RE U~R INTERFACE: GCOBP
PROC~D~RB. Looking now at Figure 45, which shows a preferred embodiment of this procedure, the GTD generate COBOL procedure usex interface procedure begins by performing the procedure ~Figure 21, Block 47300) to display a GTDGCP panel (Block 7230). When the procedure is completed, the F~ procedure (Figure 22, Block 48130) checks for user end indications (Block 7260). If a user end is not indicat~d, the program returns to Block 7260. If a user end is indicated, the program (Block 7310) performs the generate COBOL GCOBPROG procedure (Figure 35, Block 7400). The GCOBPROG procedure generates a skeleton COBOL program, that can be edited by the user to meet his specific needs. When the procedure is completed, the program exits procedure GCOBP (Block 7320).

GE~Ra~E C PROCEDUR3 USER IN~ERFACE: GCP PROCEDURE.
Continuing to Figure 46, which shows a preferred embodiment of this procedure, the GTD generate C procedure user interface procedure begins at Block 8030 by performing the procedura (Figure 21, Block 47300) to display a GTDGCP
panel. When the procedure is completed, the FE procedure (Figure 22, Block 48130) checks for user end indications (Block 8040). If a user end is not indicated, the program returns to Block 8030. If a user end is indicated, the program at Block 80gO performs the generate C GCPPROG

.

' :,'`''':. . ' :

~ . D~
~2~
procedure (Figure 36, Block 114950). The GCPPROG procedure generates a skeleton C program, that can be edited by the user to meet his specific needs. When the procedure is completed, the program exits procedure GCP (Block 8090).

G~NERa~E P~æL~ PROGRAN.
The next major area of the GTD involves the Generate Panels program which provides functions to allow the application developer to generate customized system-provided panels for his application and provides base panels for procedure dialog flow with the user. These panels are generated to be compatible with the IET, and have the fileds required by the IET to perform its panel and menu dialog flow management.

The GM procedure defined at Figure 47, Block 9030 provides the interfaces neccessary to generate menu panels and the system- defined GLOS, INFO and HELP panels. These panels have all the fields pre-defined in standard locations to allow the IET to provide the application with dialog management, menu navigation, glossary, information, and help functions. The standard location provide the application user with a common application interfaca for all DAA
applications. The application developer has the option of customizing the look of the panel generated, but should not delete fields required by the IET~

The application designer can generate the system-provi~ed panels and skeleton panels to be customized for the application using the generate panels procedures.
The designer is presented with a selection panal to generate the system-provided panels for this application. Normally, the designer would specify Option 1 which generates the panels to perform standard MENU, GLOSary, HELP, and INFOrmation functions for the GTD application being developed. The designer can elect to generate a sub-set of these panels by entering other options.

To generate a skeleton panPl (MAP) the application designer must specify the MAPLIB and panel name to be - ,:. . .:. . .

:~ :

generated to the skeleton panel. The panel name must be unique within that library. For inclusion in a TDT, the panel must be included with the panel list. Once the data is entered on the skeleton panel, the panel is generated.
The method used to generate the panels is to generate the m~p source records in the format required by the map services employed. Specifically the definition of each map record is built in a buffer using hard coded specifications for each type of panel being generated (menu, glossary, informationg help, or skeleton panels) and then written out to map file. Specifications written into the map source include field names, field types, field row and column information, field lengths, field attributes and literal data. All these specifications are hard coded for each type of panel and are written out to the file in the most convenient manner.
.

Alternative embodiments of this aspect of the GM
pro~ram would be to copy the panel source from a location specified in a G~D system configuration file and then plug in the particular customized information required (e.g., the panel name; for menu entries, the selection and description info~mation).

Below are listed the third lev~sl menu options under the second level menu GENERATE PANELS. In addition to selecting a menu option to perform, the user is also required to provide 2 additional pieces of information: the name of the TDF file (gtdmmem), and the library or pathname under which the TDF file may be accessed (gtdmlib). These 2 pieces of information ars reguired to perform any of the menu functions. Input fields for these values are included on each of the second level hierarchy menues.

3. GEN RATE PANELS
3.1 GENERATE MENUS(ALL),HELP,INFO, AND GLOS PANELS

. ~

.: , . .: , - : ", , :.

~ 63(~ ~ 3 :~
3.2 GENERATE MENU PANELS
3.3 GENER~TE HELP PANEL
3.4 GENERATE INFO PANEL
3.5 GENERATE GLOS PANEL
3.6 GENERATE SKELETON PANEL
3.7 EXIT

Menu option 3.1, GENERATE MENUS(ALL),HELP,INFO, AND
GLOS PANELS, provides a capability to generate panel source for all menus and the system provided help, information, and glossary panels. The menu option lines are constructed from menu entries stored in the TDF.
All req~lested panels are g~nerated in turn.

Menu option 3.2, GENERATE MENUS provides a capability to generate panel source for all menus. The menu option lines are constructed from menu entries stored in the TDF.

Menu option 3.2, GENERATE HELP PANEL provides a capability to generate panel source for the system-provide HELP panel.

Menu option 3.3, GENERATE INFO PANEL provides a capability to generate panel source for the system-provide INFO panel.

Menu option 3.4, GENERATE GLOS PANEL provides a capability to generate panel source for the system-provide GLOS panel.

The flow chart of the GPM procedure (Figure 48, starting with Block 9600) details these menu option rapabilities further.

Menu option 3.5, GENERATE SKELETON PANEL provides a capability to generate a user panel skeleton source file.

~ : : .- :, . .
.: ;
, The generated panel skeleton panel provides a starting point-from which the application developer can work when composing the application panels. The flow chart of the GSP procedure (Figure 49 starting with Block 12540) details this capability further.

G~NERAT~ MAP8 ~8~R INTERFACEo GM PROCEDURE. Starting with Figures 47a-f, which depict a preferred embodiment of this procedure according to the present invention, the GTD
generate maps user interface procedure begins at Block 9070 by performing the load/create transaction definition file GTDT procedure (Figure 24, Block 44960). When the GTDT
procedure is completed, control is returned to Block 9090 which performs the display procedure (Figure 21, Block 47300~, electing to display a GTDGM panel (Block 9090).
Procedure FE (Figure 22, Block 48130) then checks for user end indications (Block 9100). If a user end is indicated, the program jumps to Block 9520 and exits procedure GM. If a user end is not indicated, the program saves the generate option flag (GTD~OF) value (Block 9130), and the generate lookahead flag (GTDGLF) value (Block 9140). Procedure GTDT
(Figure 24, Block 44960) then loads and creates the TDF
(Block 9150). The generate option flag value (Block 9160) and ganerate lookahead flag (Block 9170) are restored to the GTD transaction view, and the flags are validated by translating the values to u~per case and then changing their values to "N" if the values contained are not "Y" (Block 9180). When the flags have been validated, procedure PTDT
writes a new TDF from the information in the GTD transaction view.

Decision Block 9200 checks to see if the user input option code of GTDSEL=l, which is a request for all panels to be created. If not, the program jumps to ~lock 9270. If GTSEL equals 1, the GPM procedure (Figure 48, Block 9600) ~,,:,: .: / :
., ' , , . ~ :~
,, :::
,. . , -.:

~3t` ~
~ ~3~
generates the menu panels (Block 9210), followed by all the-system-defined panels.

The HELP panel is created at Block 9220 with the following fields defined in th~ IETTVW and required by the IET: IEF1-TRAN, IEF1-PANEL, IEF1-SYSTEM, IEFl-CURROW, IEF1-CURCOL, IEFl-FUNKEY, IEF1-CURDT, IEFl-MSGID, IEF1-MSGTX, IEFl-MSGTX, IEFl-MSGAE, IEFl-USER, IEF1-HELPPNL, IEFl-OPTION (optionally generated when gtdgof = Y), IEFl~TEXT(01) thru IEF1-TEXT(21).

The INFOrmation panel is created at Block 9230 with the following fields defined in the IETTVW and required by the IET: IEF1-TRAN, IEFl-PANEL, IEF1-SYSTEM, IEFl~CURROW, IEFl-CURCOL, IEF1-FUNKEY, IEFl-CURDT, IEF1-MSGID, IEFl-MSGTX, IEFl-MSGTX, IEFl-MSGAE, IEF1-USER, IEF1-INFOCHP, IEFl-INFOSEC, IEFl-INFOPAG, IEFl-OPTION (optionally generated when gtdgof = Y), IEFl-TEXT(01) thru IEF1-TEXT(21).

The GLOSsary panel is created at Blo¢k 9240 with the following fields defined in the IETTVW and required by the IET: IEFl-TRAN, IEF1 PANEL, IEF1-SYSTEM, IEF1-CURROW, IEFl-CURCOL, IEFl-FUNKEY, IEFl-CURDT, IEF1-MSGID, IEFl-MSGTX, IEFl-MSGTX, IEFl-MSGAE, IEF1-USER, IEFl-GLOSSEC, IEFl-OPTION (optionally generated when gtdgof = Y), IEFl-TEXT(01) thru IEFl-TEXT(21).

When all the panels have been generated, GTDMSG is set equal to PANEL GEN COMPLETE, and the message is output to the user tBlock 9250).

Decision Block 9270 checks to see if the user has input an option code of GTDSEL=2, a request for only the menu panels to be created. If not, the program proceeds to Block 9310. If GTDSEL equals 2, the GPM procedure (Figure 48, :, . . . .

.: ::' '' ,,,, :
. .
:, .: ,. : .
:. .: :,, ., , j.
'', ' ~
,:; - -2 ~ 3 ~
Block 9600) generates the menu panels (Block 9280). When the procedure is complete, GTDMSG is set equal to "PANEL GEN
COMPLETE", and the message is output to the user (Block 9290).

Decision Block 9310 checks to see if the user has input an option code of GTDSEL=3, a request for only the help panels to be created~ If not, the program continues to Block 9350. At Block 9320, if GTDSEL equals 3, the help panel is generated as described for Block 9220. When the help panel has been generated, GTDMSG is set equal to "PANEL GEN
COMPLETE~', and the message is output to the user (Block 9330).

Decision Block 9350 checks to see if the user has input an option code of GTDSEL=4, a request for only the information panels to be created. If not, the program jumps to Block 9390. At Block 9360, if GTDSEL equals 4, the informaton panel is generated as discussed Block 9230. When the in~ormation panel has been generated GTDMSG is set equal to "PANEL GEN COMPLETE~, and the message is output to the user (Block 9370).

Decision Block 9390 checks to see if the user has input an option code of GTDSEL=5, a request for only the glossary panels to be created. If not, the program proceeds to Block 9430. At Block 9400, if GTDSEL equals 5, the glossary panel is generated as described for Block 9240. When the glossary panel has been generated, GTDMSG is set equal to "PANEL GEN
COMPLETE", and the message is output to the user (Block 9410).

Decision Block 9430 checks to see if the user has input an option code of GTDSEL=6, a request to generate a skeleton panel. If not, the program continues to Block 9480. If GTDSEL equals 6, procedure GSP (Figure 49, Block 12540) .

1.L
generates the skeleton panel (Block 9440). When the procedure is complete, GTDMSG is set equal to "PANEL GEN
COMPLETE", and the message is output to the user (Block 9450).

Procedure FE (Figure 22, Block 48130) then checks for user end indications (Block 9480). If a user end is indicated, the program moves to Block 9520 and exits procedure GM. If a user end is not indicated, the program returns to Block 9090 to continue processing.

~ ENBR~TE MEN~ PANELS: GPM PROCEDURE. Moving now to Figures 48a~d, which depict the preferred embodiment of this procedure according to the present invention, the GTD
generate menu panels procedure begins at Block 9680 by setting khe number o~ entries in the menu count index to zero and blanking the menu names in the menu table (Block 9700). The procedure initializes a pointer to the beginning of the STDE table (Block 9740). Decision Block 9745 checks to see if the end of the STDE tahle has been reached (Block 9745). If it has, the procedure -jumps to Block 9940. If not, the procedure checks if the curxent STDE table entry is a menu entry, STDETYPE=E. If the entry is not a menu entry, the procedure proceeds to Block 9885. If the entry is a menu, the menu name is added to the menu table (slock 9760~.
The menu name table is built in a sorted manner and contains only unique menu names. The new menu name is loaded into the location ~ound (block 9a50) and the menu count is incremented (Block 9860~. Block 9885 increments the STDE
pointer to point to the next STDE table entry and the procedure returns to Block 9745.

When the end of the STDE table has been reached, the index is initialized to the beginning of the menu table (Block 9940~ and checked to see if it is still less than the :,, , : . , : -.

:: , ~ :-.. . ..

3 :~
menu count (Block 9945). If not, the program exits procedure GPM (Block 9980). If the index is still less than the menu count, GTDPMEM is set to the menu name (Block 9950), and the individual menu panel is created.

The menu entry field containing the selection values STDESEL and menu selection description STDEDESC are placed on the screen in a list as constants together on the same line with a list of the menu entries constituting the menu options.

The menus are created with the following fields defined in the IETTVW and required by the IET: IEF1-TRAN, IEFl-PANEL, IEF1-SYSTEM, IEF1-CURROW, IEFl-CURCOL, IEFl-FUNKEY, IEFl-CURDT, IEF1-MSGID, IEFl-MSGTX, IEF1-MSGTX, IEFl-MSGAE, IEFl-USER, IEF1-COMMAND, IEF1-GDATE, IEF1-GTIME, IEFl-APPL, IEFl-TDTID, IEF1-RELN, IEF1-OPTION (optionally generated when gtdgof = Y), IEF1-LOOKAHEAD (optionally generated when gtdglf = Y).

When the menu has been created, the index is incremented, and the program returns to 81Ock 9945.

GENERATE ~E~ETON PANEL USER I~NTERFACE: ~8P PROCEDURE.
Considering next Figure 49, which depicts the preferred embodiment of this procedure, the GTD generate skeleton panel user interface prccedure begins at Block 12570 by performing the procedure (Figure 21, Block 47300) to display a GTDGP panel.

At Block 12580, the generate option and lookahead flag fields are validated by translating the values to upper case and then changing their values to "N" if the values contained are not "Y". When the flags have been validated, proc.edure F~ (Figure 22, Block 48130) checks for user end indications (Block 125903. If a user end is not indicated, TI-13766 l99 - , ...... . . ..

., .. ,.- ' ~'., . . .:

:,. .. : :.. , :
' ~''''" ' ~ "
,, , .' ' ' . ~ ~ " ~ ' the program returns to Block 17570. If a user end is indicated, the program (Block 12630) generates the skeleton panel. Skeleton panels are created with the following fields defined in the IETTVW and required by the IET: IEF1-TRAN, IEF1-PANEL, IEFl-SYSTEM, IEF1-CURROW, IEF1-CURCOL, IEFl-FUNKEY, IEF1-CURDT, IEFl-MSGID, IEF1-MSGTX, IEFl-MSGTX, IEF1-MSGAE, IEFl-USER, IEF1-OPTION (optionally generated when gtdgof = Y), IEFl-LOOKAHEAD (optionally generated when gtdglf = Y) The generated panel may then be edited by an appropriate map editor and customized to meet specific application needs. After the skeleton panel is generated, the program exits procedure GSP (Block 12640).

' . ' ! : :

~' . ', . `, : :
: ': ' . .:

.:' . ' , , . , . , . - , . " , f~

COMPI~E TRAN8AC~IO~ DEF/VIEW~/PANELS/PROCEDURE8.

The next major area of the GTD involves the Compile Transaction ~efinition, Views, Panels and Procedures program which provides the application developer with the construction tools necessary to build a DAA application, particularly the TDT and view tables required to characterize the application to the IET. When th~ TDT edit has been completed, the designer can request an object module be created for the TDT using the CTREQ procedure.
This presents a panel allowing the designer to specify the TDT member to be compiled. The CTREQ procedure ensures that applications built with GTD are constructed with consistent compile and link-editor options for the DAA platform.

Furthermore, the CTREQ procedure defined Figure 50 at Block 16440 provides the user interfaces neccessary to construct an application load module and install it in an executable load module library or directory. The application is built with the neccessary TDT and view tables required by IET. The information in these tables are checked for consistency and completeness before the table objects are b~ilt.

If the edit specifications for a selected transaction are consistent (all panels and procedures referenced in TDT
member are defined as entries in TDT) the compilation will create the appropriate object module. The object module builds the tables that interrelate the panels, procedures, menu entries, and vie~s within the TDT suitable for controlling execution of this transaction at run time.

If errors exist in this process (for example, panel is referenced on menu and panel is not defined to menu hierarchy or as a discrete panel specification) these error :: , "

. . ', , ::, : :
: : : : :

conditions will be noted for the designer to correct.

In addition to providing the user interfaces for compiling/cons~ructing the tables required by IET, the CTREQ
procedure includes user interfaces for compiling the application panels and procedures as well as building the load module. The menu options provided construct each type of component as a group, either conditionally or unconditionally. By treating each type of component as a group, the program helps to ensure synchronization within a component type.

Other menu options provided construct the entire application in a sequence which ensures synchronization between all components of the application. When one of is selected, the entire application is constructed in the following sequence by type: the TDT, the views, the panels, the procedures, the application load module. This construction sequence comprehends the data dependencies between different types of application objects.

The conditional construction options ensure sychronization by checking modificzltion dates of both the source module and the transaction view source and comparing t~ose dates with modification dates on compile objects.
Source modules which have been modified later than their corresponding object module require reconstruction. Each object module with an earlier modify date than the transaction view will also re~uire reconstruction. The conditional construction permits a shorter (but still synchronized) construction process when only a few changes have been made to the application. The unconditional construction forces reconstruction of all objects.

Below are listed the third level menu options under the second level menu CO~PILE TRANSACTION DEF/VIEW/PANELS/

," . ~
, . , ~: . : :, :~ . - , ,:

PROCEDURES. In addition to selecting a menu option to perform, the user is also required to provide 2 additional pieces of information: the name of the TDF file ~gtdmmem), and the library or pathname under which the TDF file may be accessed (gtdmlib). These 2 pieces of information are required to perform any of the menu functions. Input fields for these values are included on each of the second level hierarchy menus.

4. COMPILE TR~NSACTION DEF/VIEWS/P~NELS/PROCEDURES
4.1 COMPILE TRANSACTION DEFINITION
4.2 COMPILE VIEWS
4.3 COMPILE PANELS-~CONDITIONAL
4.4 COMPILE PANELS--UNCONDITIONAL
4.5 COMPILE PROCEDURES--CONDITIONAL
4.6 COMPILE PROCEDURES--UNCONDITIONAL
4.7 BIND TRANSACTION
4.8 COMPILE/BIND ALL ELEMENTS--CONDITIONAL
4.9 COMPILE/BIND ALL ELEMENTS--UNCONDITIONAL
4.10 EXIT

Menu option 4.1, COMPILE TRANSACTION DEFINITION
provides the capability to generate and compile application description/control tables into linkable objects which can be used by the IET when performing dialog management, obtaining profile information, performing cooperative processing, and interfacing with the applieation. The flowchart of the CT procedure Figure 51, starting with Block 17450) details these capabilities further.

Menu option 4.2, COMPILE VIEWS provides the capability to generate and compile view tables into linka~le objects which can be used by the IET when saving/restoring application profile information and when obtaining/retrieving input/output information during cooperative processing. The flowchart of the CV procedure : , ~ ".

: ::: -.:,. .,. : ~ .. :

~Figure 54, starting with Block 25870) details this capability further.

Menu option 4.3, COMPILE PANELS--CONDITIONAL and Menu option 4.4, COMPILE PANELS--UNCONDITIONAL pxovide the capability to compile all application panels either conditionally (Menu option 4.3) or unconditionally (Menu option 4.4). A flag is set indicating the conditional state for the compilation, then a procedure is invoked to manage the compilation of all the application panels. The flowchart of the CP procedure (Figure 55, starting with Block 31540) details this capability ~urther.

Menu option 4.5, COMPILE PROCEDURES--CONDITIONAL and Menu option 4.6, COMPILE PROCEDURES--UNCONDITIONAL provide the capability to compile all application procedures either conditionally (Menu option 4. 5) or unconditionally (Menu option 4.5). A flag is set indicating the conditional state for the compilation, then a procedure is invoked to manage the compilation of all the application procedures. The flowchart of the CC procedure (Figure 57, starting with Block 33340) details this capability further.

Menu option 4.7, BIND T~NSACTION provides the capability to link all application objects, as well as any required system objects~ into a single load module and install it in a library or directory for executable modules.
The flowchart of the BT procedure (Figure 60, starting with Block 40110) detail~ this capability further.

Menu option 4.8, COMPILE/BIND ALL ELEMENTS--CONDITIONAL
Menu option 4.9, COMPILE/BIND ALL ELEMENT5--UNCONDITIONAL
provide the capability to compile all application components either conditionally (Menu option 4.8) or unconditionally (Menu option 4.9). A flag is set indicating the conditional state for the compilation then all the compile procedures ,: . ~ ,., -,, ~;
~: : ..
- ~ . . , ~.
,; , . . :

. .

r~ ~

are invoked in turn to manage the compilation of the application components.

CONPIL~BI~D: CTR~Q PROCEDURE. Starting with Figures 50a-j, which depict a preferred embodiment of this procedure according to the present invention, the GTD compile/bind procedure begins at Block 16500 by performing the procedure to display a panel (Figure 21, Block 47300) electing to display the GTDCT panel. This panel is a menu of all the construction processes available5 Block 16510 performs the FE procedure (Figure 22, Block 48130) to check for user input end indications. At Block 16520, if an end is indicated, the procedure proceeds to exit the program at Block 17370. If an end is not indicated, at Block 16540 the procedure performs the load/create TDF (Figure 24, Block 44960) GTDT procedure. The temporary working directory is initialized from gtdslib (Block 16550). Block 16580 then obtains the transaction view modify date/time and saves it in gtvwtime. This is later used when evaluating conditional compilation cases.

Decision Block 16590 checks to see if there is a compile TDT re~uest, GTDSEL = 1. Xf not, the program jumps to Block 16630 to continue identifying the user request. If G~DSEL equals 1, the compile TDT (Figure 51, Block 17450) CT
procedure is performed (Block 16600). The compile status is checked (Block 16610). The program then returns to Block 16500 to redieplay the menu.

Decision Block 16630 checks to see if there is a compile views request, GTDSEL=2. If not, the program procaeds to Block 16680 to continue identifying the user request. If GTDSEL equals 2, the unconditional compile flag is set, gtdcflag = U (Block 16640). The compile views (Figure 54, Block 25~70) CV procedure is performed (Block .

, . . . . .

:: : :.:: ~ . : . . . :

. : / :
: . ,. , :, g'--.D 1~
~23~ 3~
166503. Block 16655 then checks the compile views status after which the program returns to Block 16500 to redisplay the menu.

Decision Block 16680 checks to see if there is a conditional compile panels request, GTDSEL = 3. If not, the program proceeds to Block 16730 to continue identifying the user request. If GTDSEL equals 3, the conditional compile flag is set, gtdcflag = C (Block 16690). The compile panels (Figure 55, Block 31540) CP procedure is performed (Block 16700). The program then returns to Block 16500 to redisplay the menu.

Decision Block 16730 checks to see if there is an unconditional compile panels request, GTDSEL = 4. If not, the program moves to Block 16780 to continue identifying the user request. If GTDSEL equals 4, an unconditional compile flag is set, gtdflag = u (Block 167~0). The compile panels (Figure 55, Block 31540) CP procedure is performed (Block 16700). The program then returns to Block 16500, to redisplay the menu.

Decision Block 16780 chacks to see if there is a conditional compile procedures request, GTDSEL = 5. If not, then the procedure jumps to Block 16830 to continue identifying the user request. If GTDSEL equals 5, the conditional compile flag is set, gtdfl~g = c (Block 16790).
The compile procedures (Figure 57, Block 33340) cc procedure is performed (Block 16800). The program then returns to Block 16500 to redisplay the menu.

Decision Block 16830 checks to see if there is an unconditional compile procedure request, GTDSEL = 6. If not, the program moves to Block 16880 to continue identifying the user request. If GTDSEL equals 6, the unconditional compile flag is set, gtdcflag = U (Block 16840). The compile ::
- ' ' . ' ~ , . , .: ,. . - : .. : -.. . . .

.

r~~
~2~ 3-~
procedure (Figure 57, Block 33340) CC procedure is performed (Block 16850). The program then returns to Block 16500 to redisplay the menu.

Decision Block 16880 checks to see if there is a bind transaction request, GTDSEL = 7. If not, the program jumps to ~lock 16930 to con~inue identifying the user request. If GTDSEL equals 7, the conditional compile flag is set, gtdcflag = C (Block 16~90). The bind transaction (Figure 60, Block 40110) BT procedure is performed (Block 16850). The program then returns to Block 16500 to redisplay the menu.

Decision Block 16g30 checks to see if there is a conditional compile/bind all request, GTDSEL=8. If not, the program jumps to Block 17060 to continue identifying the user request. If GTDSEL equals 8, the conditional compile flag is set, gtdcflag = C, (Block 16940). The compile TDT
(Figure 51, ~lock 17450) CT procedure is performed (Block 16950). The status of the compile is then checked (Block 16960). If the TDT compile was not successful, the program returns to Block 16500 to redisplay the menu. If the TDT
compile was successful, the compile views (Figure 54, Block CV 25870) procedure is performed (Block 16970). The status of the views compile is then checked (Block 16975). If the views compile was not successful the program returns to Block 16500 to redisplay the menu.

If the views compile was successful the status messages are displayed but no input is accepted from the user (Block 16980). The compile panels (Figure 55, Block 31540) CP
procedure is performed (Block 16990). Again the status messages are displayed but no input is accepted from the user (Block 17000). The compile procedures (Figure 57, Block 33340) CC procedure is performed (Block 17010). The status of the compile is checked (Block 17015). If the compile was not successful, the program returns to Block 16500 to . " !. :~: ' . ' ~', ;' . :~' ~ ` ' - .. . ., :

r~
2 ~ v ~
redisplay the menu panel. If the compile was successful, the status messages are displayed, but still no input is accepted from the user (Block 17020). The bind transaction (Figure 60, Block 40110) BT procedure is performed, and the procedure xeturns to Block 16500 to redisplay the menu panel.

Decision Block 17060 checks to see if there is an unconditional compile/bind all request GTDSEL = 9. If not, the program returns to Block 16500 to redisplay the menu panel. I~ there is, the unconditional compile flag is set, gtdc~lag = U (Block 17160). The compile TDT (Figure 57, Block 17450) CT procedure is then performed (Block 17170).
The TDT compile status is then checked (Block 17175). If the TDT compile was not successful, the program returns to Block 16500 to redisplay the menu panelO If the TDT compile was successful the status messages are displayed but no input is accepted from the user (Block 17180). Next, the compile views (Figure 54, Block 25870) CV procedure is then performed (Block 17190). The status of the views compile is then checked (Block 17195). If the compile was not successful, the program returns to Block 16500 to redisplay the menu panel. If the compile was successful, the status messages are displayed but no input is accepted from the user (Block 17200). The compile panels (Figure 55, Block 31540) CP procedure is then performed (Block 17210). The status messages are displayed but again no input is accepted from the user (Block 17220~. The compile procedures (Figure 57, Block 33340) CC procedure is then performed (Block 17230~. The status of the compile procedures is then checked (Block 17235). If the status of the compile was not successful, the program returns to Block 16500 to redisplay the menu panel. If the compile was successful, the status messages are displayed but still no input is accepted from the user (Block 17240). Finally, the bind transaction (Figure 60, Block 40110) BT procedure is performed (Block : ~... . ,-: :., . . - :' , ', ' '~ ' ~:, : ~ . ~, :.

2 ~ ~ 3 ~
17250) and the program returns to Block 16500 to redisplay the menu panel.

r 2~2~ c~ ~
CO~PII.E T~N8P.CTION D~3FINITION: CT PROCEDU~E

Looking next at Figures 51a-rr, which depict a flowchart of the preferred embodiment of this procedure according to the present invention, the CT procedure is responsible for building the transaction definition table, TDT object module. This procedure must produce a standard object module that is to be link-edited with IET, application panel maps and procedures to produce an executable transaction. The TDT consists of various separate tables with in~er-related pointers that allows IET at execution time to control the dialog between the user and the application code using the application defined maps and menus. In addition to the dialog, IET handles all panel input/output Ior the application and facilitating the communications from one transaction to a remote transaction via the DAA link and return facility~

In summary, the following table types are constructed by GTD through the CT procedure: TDT anchor block (consists mainly of pointers to other TDT tables);
transaction panel entries table, l'PETAB, with one TPE per panel; transaction code entries table, TCETAB, with one TCE
p~r referenced executable procedure entry point; transaction menu entries table, TMETAB, with one TME per menu panel;
transaction language entries table, TLETAB, with one TLE per language supported; and the data base sync table referencing SQL data base support routine entry points.

Building this TDT object module can be accomplished different ways. On UNIX, the CT procedure, as flowcharted here, builds a C language source file that is later compiled by the C compiler to produce a link-editable object module.
On MVS a CT version exists that constructs 370 linkable object modules directly, without the aid of a C compiler.

, : .. . :

;,, , :~ ; ; :
'';'.: ~' ` ': `

2 ~
The CT procedure involves building and compiling the TDT. The TDT is built in the following manner. First the STDE table is inspected to ensure that all the definitions are complete and consist~nt by determining if any panels or procedures have been left undefined (i.e., without a source file). Then all panels, menus, procedures, languages, and views are counted and a table built containing the names for each type of component. Once all the components are accounted for, a source procedure is built containing source languaye statements which define the customized TDT
information. In the case of the current implementation for UNIX, this source file is built as a C source file. The TDT
source generation proceeds by generating a standard source prefix, external name definitions for the panels, views, procedures; generating the TDT, TPETAB, TCETAB, TMETAB, TLETAB, and DB synchronization function address table; and then generating a standard source suffix. The standard source prefix contains files, function prototypes, and external definitions common to all TDT source. The standard source suffix contains a small procedure, DLITCBL, that is called by the transaction sub-system main module upon execution of the transaction. DLITCBL, in turn, calls IET, passing the address of the TDT and any input/output control block passed by the transaction sub--system main module. Once the TDT source file is built, it is compiled using a standard compiler. In the case of an UNIX implementation, a C compiler is used.

The first section of the CT procedure (Blocks 17450-17850) determines if there are any undefined panels (i.e., menu panel refarences with no corresponding panel defined). It begins by clearing the output file information and rewinding to the heginning of the file (Block 17580).
The display area, DNAMEA is blanked out (Block 17630) and the counter for undefined panels is set to zero (Block 17660). Pointer e is set to the first STDE table component . .
-: -, .,. . ~, , ., : ,- . : ..

:. . : ::. ,; . : .
.

':;

f ~ ?

name (Block 17670). Decision Block 17675 checks to see if pointer e is past the end of the STDE table. If so, the procedure jumps to Block 17830. If not, Decision Block 17680 checks to see if the component type, STDETYP, of the component indicated by e is equal to 'E', indicating a menu entry definition. If not, the procedure proceeds to Block 17815. If e equals E, the procedure searches the STDE table looking for a component where component name, STDENAME, is equal to the panel name referenced by the current menu entry, STDEIPNM, for the menu component indicated by e (Block 17700). If search is successful, the procedure advances to Block 17815.

The panel name, STDEIPNM, is copied to the current position in the display area, DNAMEA, indicated by the number o~ undefined panels in Block 17770, and the number of undefined panels is incremented by one (Block 17780). In Decision Block 17790, if the number of undefined panels is greater than the maximum number for the error display screen, then the procedure moves to Block 17830. Otherwise, it increments e to the next component (Block 17815) and returns to Block 17675.

Decision Block 17830 checks to see if the number of undefined panels is greater than zero. If not, the procedure moves to Block 17920. If the number is greater than zero, Block 17840 performs the procedure to display a GTDCTEl panel (Figure 21 , Block 47300), and the CT
procedure exits with the error return code set to 4 (Block 17850~.

The next section of the CT procedure verifies (Blocks 17920-18480) each panel's procedures. The rule is that every panel must have an input procedure and the name given must match the name of a defined procedure. The panel output procedure is optional, but if present, must match a defined : . .

:.
. : ; , ,:: ~ ~:

procedure. In addition, menu entries may optionally specify a procedure name and, if present, it must be the name of a defined procedure.

This section of the CT procedure begins at Block 17920 by blanking out the display area, DNAMEA, and setting the counter for undefined procedures, j, to zero (Block 17950).
The pointer, e, is set to the first STDE table component name tBlock 17960).

Decision Block 17965 checks to see if e is pointing past end of the STDE table. If so, the procedure advances to Block 18460. Next, Decision Block 17970 checks to see if the component type, STDETYP, of the component indicated by e i6 equal to "p", (indicating a panel entry definition). If e does not equal "p", the procedure continues at Block 18270.

In Block 17990, the program searches the STDE table looking for a procedure entry where STDETYP equals "C" (for component) and where component name, STDENAME, equals the input procedure name referenced by the current panel entry, STDEIPNM for the panel component indicated by e. If the search is successful, the procedure continues to Block 181~0.

At this point, if no procedure name was found for the input procedure name specified, the procedure name, STDEIPNM, is copied to the current position in the display area, DNAMEA, indicated by the number of undefined procedures, j (Block 18060). The number of undefined procedures is then incremented (Block 18070). In Decision Block 18080, if the number of undefined procedures is greater than the maximum number for the error display screen, the procedure then jumps to Block 18460.

. .
.
~ ~: ' ' `. . :
'. . . ~ ~
,. , , . ~ . .

2 ~ f ~
Decision Block 18110 checks to see if the output procedure name, STDEOPNM, for panel entry, e, is not defined (i.e., contains blanks). If so, the procedure advances to Block 18270.

In Block 18115, the STDE table is searched for a procedure entry where STDETYP equals "C", and where the component name, STDENAME, equals the output procedure name referenced by the current panel entry, STDEOPNM, for the panel component indicated by e. If the search is successful, the procedure continues to Block 18270.

At this point, if no procedure name was found for the output procedure name specified. The procedure name, STDEOPNM, is copied to the current position in the display area, DNAME~, indicated by the number of undefined procedures, j (Block 18220). The number of undefined procedures is then incremented (Block 18230). In Decision Block 18240, if the number of undefined procedures is greater than the maximum number for the error display screen, then the procedure jumps to Block 18460.

~ ecision Block 18270 checks to see if the component type, STDETYP, of the component indicated by e is equal to an 'E' (indicating a menu entry definition). If not, the procedure advance~ to Block 184S0.

Decision Block 18290 checks to see if the output procedure name, STDEOPNM, for menu entry, e, is not defined (i.e., contains blanks). If so, the procedure jumps to Block 18450.

In Block 18300, the STDE table is searched for a procedure entry, STDETYP, that equals the output procedure referenced by the current panel entry, STDEOPNM, for the panel component indicated by e. If the search is :' .: '` ': ~ . : ,, : .
. ~

successful, the procedure continues at Block 18450.

At this point, if no procedure name was found for the menu procedure name specified, the procedure name, STDEOPNM, is copied to the current position in the display area, DN~MEA, indicated by the number of undefined procedures, j (Block 18400). The number of undefined procedures is then incremented (Block 18410). In decision block 1~420, if the number of undefined procedures is greater than the maximum number for the error display screen, ~he procedure jumps to Block 18460. Otherwise the procedure increments e to the next component (Block 18450), and returns to Block 17965.

Decision Block 18460 checks to see if the number of undefined procedures is greater than zero. If not, the procedure continues at BlocX 18570. If so, Block 18470 performs the procedure to display a GTDCTE2 panel (Figure 21, Block 47300), and the CT procedure exits with an error return code set to 4 (Block 18480).

During Blocks 18570-18980, a pass is made through the STDE table to count panels, menus, procedures and views. In addition, if a panel or menu is found, it's name is stored alphabetically in a master table, TP, and duplicates are ignored. If a procedure is found marked as a relational data base process, a global flag, dbtype, is set to true.
And lastly, each defined view name for a given procedure is added to the master table, TV.

This section begins by zeroing out each counter: NP for panels, NC for procedures, NL for languages, NV for views, and NM menu components or entries in STDE table. The DBMS
procedure found flag is initialized to zero (Block 18630), the panel table, TP is blanked (Block 18660), and the pointer, e, is set to the first STDE table component name - . -~ ~ .
.: :.

;:

, .

(Block 18700).

Decision Block 18705 then checks to see if e is pointing past the end of the STDE table. If so, the procedure jumps to Block 19040. Otherwise, Decision Block 18710 checks to see if the component type, STDETYP, of the component indicated by e is equal to "P" (panel) or "E" (menu). If e is not equal to either, the procedure proceeds to Block 18850.

Block 18720 finds the panel table location in which to place the name, STDENAME. The table is built in an ascending sorted manner. In Decision Block 18770, if tha name, STDENAME, is already contained at the location found, the procedure jumps to Block 18850. Otherwise, it moves panel table entries over to make room for the new name (Block 18780~, and put the new entry, STDENAME, in the panel table at the location found (Block 18810). Then the panel count, NP, is incremented, (Block 18820).

Decision Block 18850 checks to see if the component type, STDETYP, of the component ind:icated by e is equal to a 'C' (indicating a procedure entry definition). If it is not, the procedure continues at Block 189960, where the procedure counter, NC is increml3nted (Block 18860). In Decision Block 18880, if the procedure has STDECDB2 equal to 'Y' (to use the application ~BMS), then procedure sets DBTYPE equal to '1', indicating an application that uses DBMS has heen found (Block 18900).

Block 18920 adds a view name to the table (Figure 52, Block 25170) by using the TVA procedure for the current procedure entry input view name STDEIPNM (Block 18920).
Decision Block 18925 checks to see if the view was successfully added to view table. If not, the program exits the CT procedure with an error return code.

,"," ~ "~ ",, ;,, ,", , ~ :

~ ~ 2 ~

The CT procedure executes the add view name to table (Figure 52, Block 25170) TVA procedure for the current procedure entry output view name STDEOPNM (Block 18930).
Decision Block 18935 then checks to see if the view was successfully added to view table. If not, the program exits the CT procedure with an error return code.

The CT procedure then executes the add view name to table (Figure 52, Block 25170) TVA procedure again, this time for the current procedure entry profile view name STDERV~M (Block 18940). Decision Block 18945 checks to see if the view was successfully added to view table. If not, the program exits the CT procedure with an error return code.

Decision Block 18960 checks to see if the component type, STDETYP, of the component indicated by e is equal to an 'L' (indicating a language entry definition). If so, the language counter, NL, is incremented. Decision Block 18970 checks then to see if the component type, STDETYP, of the component indicated by e is equal to an "E" (indicating a menu entry definition). If so, the menu counter, NE, is incremented. At Block 18980, the procedure increments pcinter e to the next STDE table component entry and then jumps to Block 18705.

The next CT procedure section (Blocks 19040-19230), open~ the output file for the TDT "C" source statements that are to be compiled later into the TDT object module. The file name is consist with the user-specified source library name, plus the TDT name, plus the extension of ".c".
Finally the sourcP prefix is written to the beginning of the file. This prefix consists of the C statement necessary to compile the table, such as "includes" and "extern"
statements.

, ' '~ . ~' ' ' . ' ,:

'' . ., . ., .;, , , ` ''~ '' ~ , ~ ' ~2~ Y,~t~, Specifically, Block 19040 builds the TDT C source name with pathname: gtdslib/ filename: gtdmmem, UNIX extension:
.c., and opens the TDT C source file for create and write only options (Block 19100). In Decision Block 19101, if the open is unsuccessful, the program exits the CT procedure with an error return code.

Block 19150 sets the index to the beginning of the TDT
prefix initialization data. Decision Block 19160 checks to see if this is the last line of prefix initialization data.
If so, the procedure moves to Block 19130.

At Block 19190, the line of TDT prefix is copied into the output buf~er, and the line in the buffer is terminated by placing a new line character after the data (Block 19210). In Block 19220, the write buffer TDT source file WTS procedure ~Figure 53, Block 25500) is perfarmed. At this point, the procedure increments the index (Block 19230) and ~umps to Block 19160.

The next CT procedure portion (BlocXs 19300 through 19730) generates the C extern definitions for the panels, views, and tables. Since each of these items is actually defined in another object module, the CT procedure must declare the names of these items to be external so that references to them by pointers in the to-be-yenerated TDT
can be resolved at link edit time.

This section begins by zeroing out the index, i, at Block 19300. In Decision Block 19305, if index, i, is equal to the number of panels, TP, then the procedure jumps to Block 19460.

Block 19310 initializes buffer TDTBUF to blanks, and builds a C language external entry in the buffer as an - .; , ,. :~ -. . .. ... ... ... .
: . ~ ~ :. . . . :

r-,,... ~..-J ~L
"extern char", panel name from table at index loc i, "[];"
(Block 19320). The line in the buffer is terminated by placing a new line character after the data (Block 19370).
In Block 19380, the write buffer TDT source file WTS
procedure (Figure 53, Block 25500). The procedure then increments the index, i, in Block 19390, and proceeds to Block 19135.

In Block 19460, index, i, is .initialized to zero.
Decision Block 19465 checks to see if index, i, is equal to the number of views. If so, th~ procedure jumps to Block 19620. Otherwise, the buffer, TDTBUF, is set to blanks (Block 19470), and a C language external view entry is built in the buffer as "extern struct VMOH", view name from table, TV~ at index loc i, "[];" (Block 19480).

The line in the buffer is terminated by placing a new line character after the data (Block 19530), and the procedure performs (Block 19540) a write bu~fer TDT source file WTS procedure (Figure 53, Blo~k 25500). The index, i, is incremented (Block 19550), and the procedure returns to block 19465.

Blocks 19620 through 19730 generate EXTERN entries for procedures. The pointer, e, is set to the first STDE table component name (Block 19620), and then the procedure checks to see if e points past the end of the STDE table component name table. If so, the procedure jumps to Block 19800.
If not, the procedure next checks to see if the component indicated by e is a language (STDETYP = C) entry type, with an external procedure type (STDECTYP = EXTE~N). If not, the procedure continues at Block 19730. If it is, the procedure initializes the buffer, TD~BIF, to blanks (Block 19640).

The C language external procedure entry is built in the buffer as "extern int", with the procedure name from the : : -~. . . ...;

, . . ~.

,; ; .:

r~

STDE table (STDENAME) at index location i, "()" (Block 19650). The line in the buffer is terminated by placing a new line character after the data (Block 19700) and the procedure performs (Block 19710) the write buffer TDT source file WTS procedure (Figure 53, Block 25500). (Block 19730 increments e to the next STDE table component entry, and the procedure then returns to Block 19625.

Blocks 19800 through 20740 generate the TDT overhead structure source statements. This consists of the C
statement necessary to build the TDT table portion shown in Figure ~2, as TDT fields labeled TDTID through TDTATLEo As show in the Figure, a large portion this table is made up of pointers to other tables and table entries. Examination of the TDT documentation section will help in understanding the logic required to build this overhead structure.

Pointers throughout the CT procedure, are constructed in C source as a pointer to a given table name subscripted by the index of the entry needed. For example, field TDTAMENU is a pointer to the panel entry, TPE, whose name, TPENAME, is equal to application-generated menu name.
Assuming that this entry is the 5th entry, subscript 4 in C.
The C statement for such a definition would be "&TPETAB[
43". So in each case, the entry's subscript is located and then the statement is generated as in the example.

This section starts at Block 19800 by initializing the large buffer to blanks. The buffer C language TDT table structure definition header is built in the buffer as "struct TDT IETTDT=~0 (Block 19810). The C source to initialize the TDTID is built in the buffer using the value of gtdmmem (Block 19830). The C source to initiali~e the TDTRELN is built in ~he buffer using the value of gtdreln (Block 19870). The C source to initialize the TDTGTIME is built in the buffer using the current clock time recorded as : , ~ ., . . . - .
., : : .. :

~ a~

seconds since 70/01/01 (Block 19960).

The C source to initialize the TDTGDATÆ is built in the buffer using a zero. Because the date is implied in TDTGTIME, another implementation could record data and time information using both fields in TDT with different encoded values (Block 20010~.

The C source to initialize the TDTDREP is built in the buffer using the value of the report name contained in gtdhdr (Block 20030).

The C source to initialize the TDTDGEN is built in the buffer using the value of the generation name contained in gtdhdg (Block 20060). The index number of the panel table entry which has the same value as gtdhmenu is then identified (Block 20090).

The C source to initialize the TDTAMENU is built in the buffer using the index number identified. This is stored as the pointer to nth entry in TPETAB identified by the index number, the TPE number of TDTAMENU (Block 20100).

The index number of the panel table entry which has the value the same as gtdhhelp is then identified (Block 20170).
At Block 20180, the C source to initialize the TDTAHELP is built in tAe buffer using the index number identi~ied. This is stored as the pointer to nth entry in TPETAB identified by thè index numberj the TPE number of TDTAHELP.

The index number of the panel table entry which has the value the same as gtdhinfo is next identified (Block 20250), and the C source to initialize the TDTAINF0 is built in the buffer u~ing the index number identified. This is stored as the pointer to nth entry in TPETAB identified by the index number, the ~PE number of TDTAINF0 (Block 20260).

TI-13766 22~

, - ,, ' .. ~ :: ' ,~ :

The index number of the panel table entry which has the value the same as gtdhglos is identified (Block 20320) and the C source to initialize the TDTAGLOS is built in the buffer using the index number identified. This is stored as the pointer to nth entry in TPETAB identified by the index num~er, the TPE number of TDTAGLOS (Block 20330).

Tha C source to initialize the TDTNTPE is built in the buffer using the value of NP as the number of panels (number of TPEs).

The C source to initialize the TDTATPE is built in the buffer and stored as the pointer to the first entry in TPETAB, the transaction panel entry table (Block 20460).

The C source to initialize the TDTNTCE is built in the buffer using the value of NC as the number of procedures (number of TCEs) (Block 20490).

The C source to initialize the TDTATPE is built in the buffer and stored as the pointer to the first entry in TCETAB, the transaction procedure entry table (Block 20540).

The C source to initialize thle TDTAPPL is built in the buffer usiny the value of GTAPPL, the application name (Block 20570).

The C source to initialize the TDTNTLE is built in the buffer using the value o~ NL as the number of language entries (number of TLEs~ (Block 20610).

Block 20660 checks to see if the number of language entries is greater than zero (Block 20660). If it is, the C
source to initialize the TDTAT~E is built in the ~uffer and stored as the pointer to the first entry in TLETAB.

. : ., ':: '~.

r ~
~2~
Otherwise, the C source to initialize the TDTATLE is built in the buffer and stored as zero, or a NULL pointer reference, indicating that there is no language table, TLETAB.

The C language TDT table structure definition, IETTDT
structure termination data is built in Block 20720. The procedure then performs the write large buffer TDT source file WTS procedure (Figure 53, Block 25500) to complete this section.

The next CT section, comprising Blocks 20800 through 21900, generates the panel table, TPETAB. TPETAB is a table of entries, TPE. The structure for the TPETAB source file is to defined TPETAB as an array of structure type TPETAB, with a max occurrence equal to the number of panel entries.
Pointers in these entries are created the same way as they were for the TDT overhead, see the discussion above. There will be one entry built for each panel defined.
~, This section begins by initializing the large buffer to blanks (Block 20800). Block 20810 then builds the source statement to declare TPETAB as an array of structures of type TPE with an occurrence of the value NP. The buffer is then written to file at block 20840.

Next block 20860 prepares to build all the panel entries by initializing index, i, to zero. Block 20865 check~ for the end of the panel definitions by determining whether i is equal to NP. If it is, control is passed to Block 21920. Otherwise, the large buffer is initialized to blankg tBlock 20~70), and the C language TDT structure array element prefix is built (Block 20880).

The C source to initialize the TPENAME is built in the buffer using the value of the element in the panel name - .
,~ :, . ~ .
:
:- : . :
- -:~

~ ~ 2 ~
table indicated by the index (TP at index location i) (Block 20910).

The C source to initialize the TPEAMAP is built in the buffer using the value of th~ element in the panel name table indica~ed by the index (TP at index location i) (Block 20910), and is stored as a pointer.

Block 21000 locates the STDE table entry with the name, ST~ENA~E, tha sa~e as panel name table entry indicated by index, TP at index location i, and sets the pointer e to indicate this element. Block 21030 then checks to see if the STDE table element indicated by e is a menu entry. If it is, the menu input procedure is saved as "IETIMENU" in the variable procname. If not, the input procedure name, STDEIPNM, of the STDE table element indicated by e, is saved and placed in the variable procname.

Block 21070 locates the STDE table procedure entry (STDETYP = procname. The number of procedures encountered in the STDE table before the desireid procedure is located are counted and j is initialized with this count.

Block 21150 checks to see if the procname is blank. If it is, the C source to initialize th~ TPEAITCE is built in the buffer using zero or null as the pointer value. If not, the C source to initialize the TPEAITCE is built in the buf~er and stored as a pointer to the first eintry in TCETAB, the Transaction Procedure Entry table, indexed by j, the count of procedures encountereid in the STDE table before the procedure procnamei was located.

Block 21240 checks to see if the STDE table element indicated by e is a menu entry. If it is~ the procedure saves the menu input procedure as "IETOMENU" in the variable .. . : : ... ,~ , , :, ..

., . . .~:
, ~ ., , ; .

. ~ ., .
:. . , .:
:.;:. . .,: , . , : ~ :: : ' . ~ . ; ' `: ' :' ~' ; ' . !

procname. If not, the procedure saves the output procedure name, STDEOPNM, of the STDE table element indicated by e, and places it in the variable procname. The procedure then locates the STDE table procedure entry (STDETYP = C) with the name (STDENAME) the same as the value of procname. The number of procedures encountered in STDE table before procedure is located is counted and j initialized with this count 7 Block 21360 checks again to seP if the procname is blank. If it is, the C source to initialize the TPEAOTCE is built in the buffer using zero or null as the pointer value.
If not, the C source to initialize the TPEAOTCE is built in the buffer and stored as a pointer to the first entry in TCETAB, the Transaction Procedure Entry table, indexed by the count, j, of procedures encountered in the STDE table before the procedure procname was located.

The C source to initialize TPERSVD1 to zeros is built in the buffer (Block 21450). This is currently unused. It is here to allow room for expansion and enhancements.

The C source to initialize QPCHTA to zeros is built in the bu~er (Block 21490). This is also currently unused.
It is here to ~llow room for expansion and enhancements.

Block 21520 locates the STDE table first entry with the name, STDENAME, the same as the panel name table entry indicated by the index, TP, at index location, i. Pointer, e, is set to indicate this element. The number of menu entries encountexed in the STDE table before the desired panel is located are counted and j initialized with this count.

Block 21570 checXs to see if the STDE table entry is a menu, STDETYP = 'E'. If not, the procedure jumps to Block .

:

3 i~
21740. If it is, Block 21580, locates subsequent entries in the STDE table with name, STDENAME, the same as panel name table entry indicated by TP at location i. The pointer is set to indicate the number of subsequent entries found in the rest of table, and initializes k with count.

The C source to initialize TPENTME is built in the buffer using the value of k as the number of menu entries which are related for the current menu panel (Block 21620).

The C source to initialize TPEATME is built in the buffer and stored as a pointer to the menu entry in TMETAB, indexed by j (Block 21680), after which the procedure jumps to Block 21840. This is the first menu entry related to the current menu panel.

The C sources to initialize TPENTME (Block 21740) and TPEATME (Block 21790) to zeros are built in the buffer. The procedure builds the C language TDT structure array element suffix (Block 21840) and performs (Block 21890) the write buffer TDT source file WTS procedure (Fiyure 53, Block 25500). Index i is incremented (Block 21900) and the procedure jumps to Block 20865.

The procedure initializes the large buffer to blanks (Block 21920), and then builds the C language TPETAB table structure array definition suffix in the buffer (Block 21930). The procedure then performs (Block 21940) the write buffer TDT source file WTS procedure (Figure 53, Block 25500).

Blocks 22010 through 22720 generate the TCETAB in a very similar manner to the way the TPETAB was built. There will be one entry generated for each procedure defined. This section begins by initializing the large buffer to blanks (Block 22010)~

.. .. -, .: :: ,: ,. , , ;:
-. -:; ; ~ ,. .:.. , .~, i:

.. :.: .: :. . ~ . : . . . :: ~ , .
.: ~ ', .: ~ ~ :: . . :
. :: : .~ . : .
.. " : . - :
.: .:, :: : .
::

2 ~ 3 :~

The C language TCETAB table structure array is built in the buffer using the value of NC as the number of procedures (TCE) stucture elements in the TCETAB table (Block 22020).
The procedure performs (Block 22050) the write buffer TDT source file WTS procedure (Figure 53, Block 25500) and then initializes the pointer to the first STDE table component name (Block 22080). (Block 22085 checks to see if e points past the end of the STDE component table. If so, the procedure jumps to Block 22700. Otherwise, Block 22090 checks to see if the component type of the component indicated by e is a procedure, STDETYP = C, entry definition. If it is not, the procedure jumps to block 22670.

The procedure initializes the large buffer to blanks (Block 22100), and then builds the C language TDT structure array element prefix (Block 22110).

The C source to initialize TCENAME is built using the value of STDENAME in the STDE table name table entry indicated by index e (Block 22140). (Block 22~80 checks to see if the procedure component procedure type indicates a procedure that belongs to another application transaction pro~ram, STDECTYP = "EXTERN". If it: does, the procedure builds the C source to initialize TPEAPROC to zeros or null value. If not, the procedure builds the C source in the buffer to initialize TPEAPROC, using the value of STDENAME
in the STDE table name table entry indicated by index, e, and stores it as a pointer.

Block 22280 checks if the procedure component input view is not defined, STDEIPNM = blanks. If it is not defined, the procedure builds the C source in the buffer to initialize TCEAIVW to zeros or null -value. If it is, the procedure builds the C source to initialize TCEAIVW using .

' .

r~ ~.

value of STDEIPNM in the STDE table name table entry indicated by the index, e, and stores it as a pointer.

Block 22360 chacks if the procedure component output view is not defined, STDEOPNM = blanks. If it is not defined, the procedure builds tha C source in the buffer to initialize TCEAOVW to zeros or null value. If it is, the procedure builds the C source to initialize TCEAOVW using value of STDEOPNM in the STDE table name table entry indicatad by the index, e, and stores it as a pointer.

Block 22440 checks if the procedure component profile view is not defined, STDEPVNM = blanks. If it is not defined, the procedure builds the C source in the buffer to initialize TCEAPVW to zeros or null value. If it is d~fined, the procedure builds the C source to initialize TCEAPVW using value of STDEPVNM in the STDE table name table entry indicated by the index, e, and stores it as a pointer.

Block 22520 checks if the procedure component is a DBMS
type procedure, STDECDB2 = Y. If it is a DBMS type, the procedure builds the C source in the buffer to initialize TCEDBTYP to 1, flagging it as a database procedure. If it is not, the procedure builds the C source to initialize TCEDBTYP to zeros, flagging it as a non-database procedure.
The procedure builds the C language TDT structure array element suffix (Block 22610) and performs (Block 22650) the write buffer TDT source file WTS procedure (Figure 53, Block 25500). Pointer e is incremented (Block 22670), after which the procedure returns to Block 22085.

At this point, the CT procedure creates SGUrCe to build the menu table, TMETAB. Here too, there will be one entry per menu. The proce~ure initiali~as the large buffer to blanks (Block 22700) and builds a C language, TMETAB, table structure array de~inition suffix in the buffer (Block -:
-;, , ~ : .

. , - . : :
,, ~ .

22710). At Block 22710 the procedure then performs the write buffer TDT source file WTS procedure (Figure 53, Block 25500) .

Blocks 22790 through 23420 generate the TMETAB. This section begins at Block 22790 by initializing the large buffer to blanks. The C language TMETAB table structure array is then built in the buffer using the value of NE as the number of procedure (TME) stucture elements in the TMETAB table (Block 22800). The procedure performs (Block 22830) the WTS procedure (Figure 53, Block 25500) and then initializes the pointer, e, to the first STDE table component name. ~Block 20865 checks to see if e points past the end of STDE table component table. If it is, the procedure jumps to Block 23400. Otherwise, the procedure (Block 22870) checks to see if the component type of the component indicate by e is a menu entry de~inition (STDETYP = E).

Block 22890 builds a C language TDT structure array element prefix. The C source to initialize TMESEL is built using the value of STDENAME in the STDE table name table entry indicated by index, e tBlock 22920). (Block 22180 locates the panel name in the panel table with the same name as the menu output panel indicated by pointer e. Index j is initialized with the number of panels encountered in the panel table before the desired panel is located.

Block 23000 checks if the procedure component profile view is not defined, STDEIPNM = blanXs. If it is not defined, the procedure builds the C source in the buffer to initialize TPEATPE to zeros or null value. If it is defined, the procedure builds the C source to initialize TPEATPE using the j as an index into the panel table, TPETAB
and stores it as a pointer to the jth entry in TPETAB
identified by the value o~ j and the TPE number of the ! ~ ' ;

', ' ' ' ' ' ` ' , '....
'. ', ' ~ , ~ ' ' .. '; ' ' ' "~ ' " '' .:
'' , ' ~,: ', ' , ' ' r,.
20~J~
STDEIPNM panel.

Block 23100 locates the STDE table procedure entry, STDETYP = 'C', with the name, STDENAME, the same as the value of the menu output procedure name, STDEOPNM, in the menu entry in the STDE table indicated by pointer e. Index j is initialized with the number of procedure encountered in the STDE table before the procedure is located~

Block 23170 checks if the procedure menu output procedure is not defined, STDEOPNM = blanks. If it is not defined, the procedure builds the C source in the buffer to initialize TPEATCE to zeros or null value. If it is defined, the procedure builds the C source to initialize TPEATCE using the j as an index into the panel table, TCETAB
and stores it as a pointer to the jth entry in TCETAB
identified by the value of j and the TCE number of the STDEOPNM panel.

The procedure builds the C source to initialize TMEDESC
using the value of STDEDESC in the STDE table name table entry as indicated by the index, e.

81Ock 23300 builds the C language TDT structure array element suffix and performs (Block 23350) the WTS procedure (Figure 53, Block 25500). Pointer e is incremented tBlock 23380) after which the procedure returns to Block 220B5.

The large buffer is initialized to blanks (Block 23400), a C language TMETAB table structure array definition suffix is built in the buffer (Block 23410), and the procedure performs (Block 23420) the WTS procedure (Figure 53, Block 25500).

The next portion of the CT procedure (Blocks 23490 through 23870) generates the transaction language .. . .. .
,: . ~ . :
.
. .: ,:. : . , :. :: . . : ;
,. .

~2~
table,TLETAB. As noted by the flow chart, no transaction language entries will be built if none are defined. (Block 23490 checks to see if the number of language entries, NL, are greater than zero. If they are not, the procedure advance to block 23950. If they are, the pro~-edure initializes the large buffer to blanks ~Block 23550).

Block 23510 builds the C language TMETAB structure array definition using ne as the number of procedure (TME) sturcture elements in the TMETAB table. The procedure performs the WTS procedure (Figure 53, Block 25500) and pointer e is incremented to the first STDE table component name (Block 23380).

Block 23575 checks to see if e points past the end of the STDE table component table. If it does, the procedure jumps to block 23~50. If it does not, the procedure checks to see if the component type (STDETYP) of the component indicated by e is a language ~ntry definition. If not, the procedure jumps to block 23830. If it is, the procedure initializes large buffer to blanks (Block 23590) and builds a C language TDT structure array element prefix (Block 23600).

Block 23630 builds the C source in the buffer to initialize TLENAME using the language name in the STDE table name table entry indicated by index, e.

Block 23670 builds the C source in the buffer to initializa TLEDREP using the documentation report file name, the value of STDEIPN~ in the STDE table name table entry indicated by index, e.

Block 23671 builds the C source in the buffer to initialize TLEDGEN using the documentation generation name, the value of STDEOPNM in the STDE table name table entry : , ,: .
, .

,,, : ,. .. . ...

r.~ f~
2 ~ 2 ~
indicated by index, e.

The procedure initializes the large bufer to blanks (Block 23850), builds the C language TLETAB table structure array definition suffix (Blo~k 23860)l and performs (Block Z3870) the WTS procedure (Figure 53~ Block 25500).

The next section of the CT procedure (Blocks 23950 through 242230) generates the DB synchronization function address table. This table is used only if a procedure has been declared to be a DB user. However, although the table exists, the procedure pointer generated will be 0, so that the link editor will not try to link in the DB
routines.

This section of the procedure begins at Block 23960 by initializing the large buffer to blanks and builds the C language DB synchronization function address table structure definition (Block 23960).

Block 23980 checks to see if the application contains any procedures with STDECDB2 ~lagged (flag set to dbtype =
1). If not, the procedure jumps to block 24100. If STDECDB2 was flagged, the procedure builds the C source to initialize the connect using the IETCONN function address. IETCONN
performs a DBMS login or connect function within IET. The procedure then builds the C source in the buffer to initialize the commit using the IETCOMM function address (Block 240503. IETCOMM performs a DBMS commit function within IET.

The procedure builds the C source in the buffer to initialize th~ r~lease using the IETREL function address (Block 24055) and then proceeds to block 24210. IETREL
performs a DBMS release or logout function within IET.

,.. ,,:; i. :.

....

2~3~3~
The procedure builds the C source in the buffer to initialize the connect using zeros or null pointer value in Block 24100. At Block 24130 tha procedure builds the C
source in the buffer to initialize the commit using zeros or null pointer value, and then builds the C source in the b~ffer to initialize the release using zeros or null pointer value in Block 2~160.

The procedure builds the C language DB synchronization structure initialization suffix (Block 24210), and performs (Block 24230) the WTS procedure (Figure 53, Block 25500).

The next portion of CT procedure Blocks 24250 through 24500 generates the TDT source suffix and closes the source file. This section of the procedure begins at Block 2~260 by setting the index to the beginning of the TDT suffix initialization data. The procedure checks to see if the index points to the last line of the suffix initialization data in Block 24270. If so, the procedure jumps to block 24440. If not, the procedure copies the line of TDT suffix into the output buffer (Block 24300) and terminates the line in the buffer by placing a new l:ine character after the data (Block 24320).

Block 24330 performs the WTS procedure: (Figure 53, Block 25500) and saves the return code. The index is incremented and the procedure xeturns to block 24350.

Block 24440 checks to see if the return code is good.
If it is, the procedure proceeds to Block 24500 and closes the TDT source file. If not, the error message out, gtdmsg, is set equal to "TDT SOURCE ~RITE ER~OR" (Block 24460) and the program exits the CT procedure with an error.

The last portion of the CT procedure (Blocks 24560 through 25070) compiles the TDT. This section of the :. : ~ : ::: ,: . .,. . :.
.
.. -.. :. ;

procedure begins at Block 24560 by satting up the compile parameter values. The compile parameters are copied to the list Block 24790). For UNIX implementation, the original directory is saved (Block 24890) and the directory where the TDT source is located is changed (Block 24900).

(Block 24910 next calls the C compiler with the parameter list and saves the return code. For a UNIX
implementation, the procedure changes back to the original directory (Block 24920). Block 24g50 checks to see if the return code indicates the call to the C compiler failed. If it did not, the program advances to Block 2~000. If it did fail, the error message out, gtdmsg, is set equal to "TDT cc spawnvp failed, errno = rc" (Block 24960) and the program axits the CT procedure with an error (Block 24970).

Block 25000 checks to see if the return code indicates the C compiler terminated with error conditions. If it did not, the program jumps to block 25070. If it did terminate with an error, the GTD output file is shown to the user with the compiler error messages.
Block 24960 sets the error message out, gtdmsg, equal to "TDT COMPILE FAILED" and the program exits the CT
procedure with an error (Block 25030).

Block 25070 sets the message out, gtdmsg, to "TDT
COMPILE COMPLETE", and the program exits procedure CT.

- : :

',' ',~
:' ~ ' ' ~ ' ' '' ' :: : ' `

2~2~3~3 3 ~ TD ~DD VIEW NAME TO TABLE: TVA PROCEDURE. Looking now at Figures 52a-b, which depict the preferred embodiment of this procedure according to the present invention, the GTD
add view name to table procedure adds an input view name to the view table in ascending sequence and updates a view table count, and begins with the Decision Block 25210 to check if the input view name is blank. If blank, the program exits the procedure with no error. If the input ~iew name is not blank, Decision Block 25220 checks if the input view name is zero. If so, the program exits the TVA procedure with no error. If no~, Decision Block 25250 checks if the number of views exceed the maximum view table size. If yes, the program sets the error message field, GTDMSG=VIEW TABLE
FULL (Block 25260) and exits the TVA procedure with an error ~block 25270).

If the number of views do not exceed the maximum view table size, a view table location is ~ound for the view table name (Block 25350~. The view table is built in an ascending sorted manner. Deoision Block 25355 checks for the input view name, vname, to see if it was found at the view table location. If found, the program exits the TVA
procedure (Block 25420). If input view name, vname, is not found at the table l~cation, the procedure moves the table entries over to make room for the new name (block 25360) and then proceeds to Block 25390.

Block 25390 step puts the name, vname, in the table at the location that was found, and then increments the view count NV (Block 25400). When this is completed, the program exits the TVA procedure (Block 25420).

GTD WRITE B~FFBR TO FILE: WTS PRO~ED~R~. Briefly considering Figure 53, which depicts the preferred :

r~
2 ~`2 .~ i7 embodiment of this procedure, the GTD write buffer to file procedure begins at Block 25530 by writing the data buffer to file. Decision Block 25550 then checks if the write was successful. If not, the error message field is set GTDMS&=TDT SOURCE WRITE ERROR (Block 25560), and the program exits the WTS procedure with an error (Block 25570~.
Otherwise, the program exits the WTS procedure at Block 25420. Z5420~.

.

~.: , : , .,. , -;

:,:, .:

r G~ CO~PILE VIEW: CV PROC~DURE. Considering now Figures 54a-mm, which d~pic~ the preferred embodiment of this procedure according to the present invention, this process involves verifying the view compile is required, as well as building and compiling the views. The verifying process is done in the following manner. First, the name of the view object modul~ is built and the modify date and time is collected. Next, list of all the views is built from the TDF. Then, the modify dates of user view files and the transaction view file are checked against the date of the view object module. The build and compile process is required if any of the user view files or the transaction view file has an equal or later date than the view object module, or if an unconditional compile is re~uested by the user.

During the build view process the C transaction view file (.h)is regenerated from the COBOL transaction view file to maintain consistent transaction views between COBOL and C
language procedures.

VMOH and VMOF tables are const:ructed for each user view. Help, glossary, and information profile views are constructed with VNOH and VMOF tables and written out to the view C source file. For each user view, the view fields are read into a ~able, and the VMOH and VMOF tables are constructed and wxitten out to the view C source file. If the construction is successful, the view source file is closed and the view is compiled.

Starting at Block 25870, the GTD compile view CV
procedure rewinds the GTD output file and saves the maximum view length in the variable gtdmvwl (Block 26120).

Blocks 26170 through 26285 set the fully qualified ','., ' , , ` ,, ', ', "' " ' ' ' ' , , ". ' ' , , ' pathname of the view object module and obtain the object module modification date and time. The fully qualified view object module file p~thname is built using the map library pathname: gtdmlib, the TDT name: gtdmmem, and the suffix VIEW.o (Block 26170).

In Block 26280 the existence of the view object module is checked and the file description information is obtained.
Block 26285 checks if the view object module exists. If so, the view object module modify date/time is stored in otim and the program continues executing with Block 26380. If not, otime is set to zero and the program continues executing with Block 26380.

The next portion of the CV procedure, (Blocks 26380 through 26465) builds a list of views from information contained in the STDE table. First the number of views is set to zero, NV = 1 ~Block 26465), and the pointer, e, is initiali~ed to the beginning of the STDE ta~le. Decision Block 26405 checks to see if e points b~eyond the end of the STDE table. If so, the procedure jumps to BlocX 26510. If not, the procedure checks to see if the current entry in the STDE table is a procedure entry, STDETYP = C (Block 26410).

If the STDE table entry is not a procedure entry (Block 26410), the program continues executing at Block 26460. If the STDE table entry is a procedure entry, then TVA
procedure (Figure 52, Block 25170) is performed to add the input view name STDEIPNM to the view table (Block 26420).
If the input view is not successfully added, the CV
procedure is exited with an error (Block 26425). Otherwise, the procedure adds the output view name STDEOPMM to the view table by performing the TVA procedure (Block 26430).

If the output view is not successfully added, the CV
procedure is exited with an error (Block 26435). If the :. : ~ .:::

r ~
t ~'~

output view is successfully added, the TVA procedure is performed to add the profile view name STDEPVNM to the view table (Block 26440). If the profile view is not successfully added, the CV procedure is exited with an error (Block 26445). If the profile view is successfully added to the view table, e is se~ to point to the next STDE entry in the STDE table ~Block 26460), and the procedure returns to Block 2 6405.

The section of the CV procedure represented by Blocks 26510 through 26590 determines whether the view compile i5 required in order to maintain program source/object consistency. This involves checking the unconditional compile flag and then chec:kin~ the modify date/times of all view source (including the transaction view modify date and time) against the modify date/time of the view object as stored in otime. Decision Block 26510 checks to see if an unconditional compile is requested by the application developer, gtdcflag = U (Bloclc 26510). If so, the view compile is required, compile is set to î (Block 26510), and execution continues with Block 26550. If not, the view compile requirement has not yet been fully determined, compile is set to 0 (~lock 26510), ancl execution c:ontinues with Rlock 26550. Block 26~50 sets view table index, IV, to zero.

Decision Block 26555 checks to see if the view table index is less than the number of views in the view table, IV
< NV. At Bloclc 26555 if the view table index is less than the number of views in the view table, execution continues with Block 26560 which sets the current modify date/time variable to zero, mtime. Otherwise, the program proceeds to Block 26920. Block 26560 sets the current modify date/time variable to zero, mtime.

Decision Block 26570 chec:ks if the current view ' :, .. :
.: . .
.. :.. ~. : ,,: :. ,: ,~ .
., ,. ~
:

s ~ ~ h identified by index IV in the view table is the glossary profile view IETGP~W. If so, at Block 26270 the modify date/time is set to negative one (-1) indicating that no conditional compile file check is required later and execution proceeds with Block 26580. If not, execution continues with Block 26580 which checks i~ the current view identified by index IV in the view table is the help profile view IETHPVW. If so, the modify date/time is set to negative one (-1) indicating that no conditional compile file check is required later. Execution proceeds with Block 26590.

Decision Block 26590 checks if the current view identi~ied by index, IV, in the view table is the information profile view IETIPVW. If so, the modify date/time is set to negativP one (-1) indicating that no conditional compile file check is required later. Execution of the CV procedure then continues with Block 26600.

At Block 26600, if a file check is not required (mtime not = 0), the program jumps to Block 26900. If a file check is required (mtime = 0), the fully quali~ied user view file name is built using pathname: gtdslib, current table view name, and suffix ".v" (Block 26610).

Block 26680 checXs the existence of the user view file and obtains the file description information. If the view user file exists (Block 26685), the view user file modify date/time is stored in mtime (Block 26700), and the program pro~eeds to Block 26850. If the view file does not exist, an Prror has occurred and the program advances to Block 26720. Block 26720 saves the current view table name indicated by IV into gtdvmem and performs the procedure to display a panel (Figure 21, Block 47300), electing to display the GTDCVE3 compile view error panel (Block 26760).
Block 26760 per~orms the FE procedure (Figure 22, Block : ,:: , :, : ,. ..
: . ,: ,. - : ~ :

. . . : :: ., : . -: . : . : ::
:: : : ::

48130) to check for user inpu~ end indications. If an end is indica~ed (Block 26785), the program exits the CV
procedure with an error (Block Z6830). Otherwise, the program returns to Block 26760.

In Decision Block 26850 a check is madP to see if the user view ~ile modify date/time is less than the transaction view modify date/time, m~ime < tvwtime. If so, the transaction view file modify date/time is saved in mtime (Block 26850) and execution continues with Block 26860. If not, the larger of the transaction view date/time and user view file date/time, mtime, is compared to the object module modify date/time, otime. If mtime is greater than or equal to otime, then a view source has been modified and a view compile is required. The procedure at Block 26860 sets the compile flag to one and continues execution with Bloc~
26900. If mtime is less than otime, the procedure increments the view ~able index IV (Block 26900) and retirms to Block 26555 to check date/time validation on the remaining views in the view table.

Decision Block 26920, checks to see if a view compile is required either by the application developer (gtdcflag =
U) or by the date/time validation process (compile = 1). I~
a vi~w compile is required (~lock 26920), the procedure advances to Block 27020 to start the view compile process.
If a view compile is not required, the GTD message field gtdmsg is set to "VIEW CONPILE NOT REQUIRED" (Block 26930), and the CV procedure is exited with no errors indicated (Block 26g40).

Blocks 27020 through 27160 set up an internal table of transaction view field information. This process is essentially a compiler for the transaction view COBOL source which encodes the field displacement, type and length information output from the compile, ~nd places that TI~13766 241 : . ,, , , , :
,: : : ~ . ;

r~

information into an internal table. The internal table contains for each field: the field displacement relative to the beginning of the transaction view, the field type, the field length, and the field occurrence multiple. This information is used when creating the VMOF table entries and as inpu~ to the COBOL/C translation utility which translates the COBOL transaction view into a C version of the same transaction view. Another translation utility may he employed w~ich does not use the internal table as input. The method of the preferred embodiment used here, is efficient because it does not require any duplication of effort between generating the field offset, length~ etc.
in~ormation and generating the C version of the transaction view. The two views are required to result in the same memory usage and allocation for each language version of the transaction view~

Block 27020 builds the fully qualified pathname of the COBOL transaction view and then calls the internal compiler utility to generate a memory table of the transaction view field attributes discussed above. This memory table is accessed through a pointer cpytable. Decision Block 27125 checks to see if the utility was ~uccessful. If so, the program proceeds to Block 27260 to continue with the compile view process. If the utility was not successful, an error occurred, so the GTD error message field gtdmsg is set to "TVW OPEN ERROR" (Block 27150) and the CV procedure is exited with an error (Block 27160).

Blocks 27260 and 27360 invoke the COBOL to C translator to generate the C transaction view from the COBOL
transaction view. This technique ensures data consistency and integrity of the transaction view interpretation between the IET and the application program as well as for applications which have both C and COBOL procedures within ne load module. Block 27260 builds the fully qualified ', - :' ," ,. ' ~' ,"' :

:: ',, ,'',: . '' ':

2 ~ 2 ~ e~ :~

pathname of the C transaction view and then calls the COBOL
to C translator (Block 27360).

Blocks 27460 through 27630 open the view source module to be generated and place constant prefix information into the source module. Every line of prefix source is copied to a buffex and then the buffer is writ:ten using WTS procedure (Figure 53, Block 25500).

Block 27460 builds the file pathname of the view module to be generated using the SRCLI~3 pathname GTDSLIB, the transaction view name, and the standard suffix "VIEW.c".
Block 27510 then attempts to create the view module with that constructed path. Decision Block 27515 tests for a successful create and if so, execution proceeds to Block 27550. If the create file was not successful, the CV
procedure is exited with an error.

Block 27550 sets an index to the beginning of the prefix source and then proceeds to Decision Block 27555 which tests for the last line of the c view prefix source.
If found, execution proceeds to Block 27700. If the last line of the prefix source has not been reached, that line of c view source is copied to an output buffer (Block 27590) and the line is terminated in the buffer (Block 27610). The buffer is then written to the c view source file (Block 27620) using the WTS procedure and the prefix source index is incremented (Block 27630).
' Block 27700 initializes the index (IV) to the first name in the view table and Decision Block 27705 then determines if the index is less than the number of view table entries. If the index is greater than the number of view table entries, control is passed to Block 30660.

If the index points to a valid view table entry, blocks " :., ::: -.. . . " , . . :,:

.. ... .. .

:. , : ;: :: .. : ~: ~ . . :
::` ~ , : : ~ .. , ,..... ;.;, , , j.

r~
2~23~ 3~
27710 through 28190 initialize multiple field names and values for that view. ~lock 27710 saves the vi~w name (from the view table, indexed by IV), ~o a memory area.

Specifically, Block 27720 sets the view header length.
The procedure then initializes the number of fields to indicate no fields coun~ed in the user view files (Block 27770) and initializes the version with the value (0100) of the default version (Block 27780).

Decision block 27840 tes~s for whether the view name (from the view table) is equal to the HELP PROFILE VIEW and, if not, execution continues at Block 27990. If so, control passes to Block 27850 which initializes the number of fields in the HELP PROFILE VIEW to 4. ~lock 27860 then initializes the field table to blanks, and Blocks 27890 through 27920 th~n save field names "IEFl-HELPPNL," "IEFl-HELPCHP,"
"IEF1-RELPSEC," and "IEFl-HELPPAG" as the first through fourth fields in the field table respectively, beginning at index 0.

Decision Block 27990 tests for the view name (from the view table, indexed by IV) equal to the glossary view and, if not found, passes control to Block 28120. If found, control passes to Block 28000 which initializes the number of fields in the HELP GLOSSARY VIEW to three. Block 28010 then initializes the field ta~le to blanks. Blocks 28040 through 28060 then save the field names "IEFl-GLOSPNL,"
"IEFl-GLOSCHP, " and "IEFl-GLOSSEC" as the first through third fields in the field table b~ginning at index 0.

Decision Block 28120 then tests for the view name (from the view table at index IV) equal to the INFORMATION PROFILE
VIEW and, if not found, passes control to block 28270. If found, Block 28130 initializes the number of fields in the help information view to three and Block 28140 initializes ,-, , ~ :

.. ,.
, . ... ,. : .
- : : :: , .
~,. :: ,, , .": .::
. . ~ . : ~ , ,:
: .,:. .,: :

r ,,~

2 ~ 2 3 ~ ~ I
the field table to blanks. Blocks 28170 through 28190 then save the field names "IEFl-INFOCHP," "IEF1-INFOSEC," and "IEFl-INFOPAG" as the first through third fields in the field table beginning at index 0.

Decision BlocX 28270 tests for the number of fields still negative and, if none are found, passes control to Block 28750. If any are found, control passes to Block 28280 which builds the user view file name using the gtdslib pathname from SRCLIB, the table view name as indexed, and the suffix 1l . v" .

Block 28340 then opens the user file using this pathname ~or read only and Block 28350 initializes the number of fields to zero. Block 28360 then reads a line from the view file and places that line in the buffer. Decision Block 28360 tests for a successful r0ad. If not successful, control passes to Block 28610. Otherwise, control passes to Decision Block 28364 which tests whether the number of fields in the field table is less than the maximum table length and if not, pa~ses control to Block 28610. If so, control passes to Decision Block 28390 which tests for the read buffer (Block 28360) beginning with a blank, or asterik, or binary zero, or new line and, if found, continues execution at Block 28630. If not found, Decicion Block 28400 looks for the read buffer beginning with a period. I~ not found, control passes to Block 28520. If found, Block 28460 translates the buf~er data to upper case.
Decision Block 28470 tests for the buffer containing a keyword for version information and, if not found, passes control to Block 28630. If found, Block 28480 extracts version data from the kuffer and places that data in the version variable. Block 28520 moves the field name to the field table at the index location of the field count. Block 28610 then increments the field count. The procedure then returns to Block 28360 to read the next line from the view r~

2~J ~ 3 file.

Block 28640 closes the user view file. Decision Block 28750 tests for whether the number of fields is non-zero and, if so, generates a reference to VMOF and passes control to Block 2~760. If the number of fields is zero, control passes to block 28~50. Block ~8760 builds C source in the buffer ~o generate a reference to VMOF, to resolve VMOF
references embedded in VMOH, using the value of the view table index in the VMOF table name.

Block 28830 builds C source in the buffer to define VMOH structure, using the value of thP view table name at the current index as the VMOH table name. Block 28870 builds C source in the buffer to initialize VMOHAPPL, using the value of the GTD name. Block 28920 builds C source in the buffer to initialize VMOHVIEW using the value of the view table name at the current index. Block 28980 builds C
source in the buffer to initialize VMOHTME to zeros. Block 29010 builds C source in the buffer to initialize VMOHDTE to zeros. Block 29040 builds C source in the buffer to initialize VMOHVER using the value of t:he version variable (the default or user specified version id). Block 29080 builds C source in the buffer to initialize V~OHFMT to 1.
Block 29120 builds C source in buffer to initialize VMHORSV0 to zero. Block 29160 builds C source in the buffer to initialize VMOHNE using the value of the number of fields in the viewO

Decision Block 29230 tests for the number of fields in the view greater than zero and, if none, builds C source in the buffer to initialize VMOHAE to zeros and then passes control to Block 29320, If the number of fields in the view is greater than zero, C source is built in the buffer to initialize VMOHAE using the value of the view table index number to generate the VMOF table name and is stored as a TI~13766 246 :, . , :. . ~

r~

pointer t~ the first ~lement in the corresponding VMOF array table.

Block 29320 builds C source in the buffer for VMOH
structure de~inition initialization suffix. Block 29340 writes the buffer to the TDT source file using WTS procedure and saves the return code. Decision Block 29~20 tests for the number of fields greater than zero and, if there are none, passes control to Block 30570.

If the number of fields i5 greater than zero, Block 29430 initializes a large buffer to blanks. Block 29440 builds in that buffer C source language for a VMOF table structure array definition using the number of fields as the number of VMOF structure elements in the table. The values of the view table index number is used to generate VMOF
table names as VMOFnnnn where nnnn contains the index value.
Block 29490 writes the buffer TDT source file using the WTS
procedure. Block 29510 initializes an index to point to the first name in the field table.

Decision Block 29515 tests whether the table index is less than the number of field table entries and, if not, passes control to Block 30390. If so, E~lock 29530 saves the table file name at the index location in gtdaname, Block 2g540 initializes variables fldd, fldl, fldt, and fldn to zeros, and Block 29550 finds the index value gtdaname in the internal transaction view field table.

De~ision Block 29630 tests for whether the search was successful and, if so, passes control to block 29640. If not, control passes to Block 29780. Blocks 29640 through 29670 save the field displacement, field length, field type, and field zero occurrences found in the internal table into fldd, fldl, fldt, and ~ldn, respectively.

:; ~ : : . .. : : .

.: - ; ~ '. "': ' .. : ' `" , ' , , ~; . ~'.!
': . "', ;' ` " , ,; '.': ~ '`', "
. ' ' ' ', '~

. ' ~ ~3 Decision Block 29680 tests whether the field has zero multiple occurrences and, if so, increments the view length by the field lenyth. Otherwise, the view length is incremented by the field length multiplied by the number of field multiple occurrences. Execution continues with Block 29910.

Block 29780 performs a procedure display (Figure 21, Block 47300) of the GTDCVE2 panel view error display panel.
Block 29800 checks for user end indication and performs the FE procedure ~Figure 22, Block 48130). If an end was indicated, execution continues with Block 29850 where the program exits the CV procedure with an error (Block 29850).
If not, control is passed to Block 29780.

81Ock 29910 initializes a large buffer to blanks.
Block 29g20 builds C source in that buffer for a comment identifying the field name using gtdanam~. Block 29960 builds C source for a TDT structure array element prefix.
Blocks 30000 through 30210 build C source in the buffer to initialize VMOFRlED using the value of fldd (~ield displacement in the work area), to initialize VMOF~lEL using the value of fldl (field length in the work area), to initialize VMOFRlEN using the value of fldn (field number of occurrences in the work area), to initialize VMOFRlET using the value of fldt (field element data type), and to initialize VMOFRSV2 to zeros, respectively.

Block 30300 builds C source for the TDT structure array element suffix. Block 30305 writes the buffer TDT source file using the WTS procedure. Block 30310 increments the index i. The program then returns to Block 29515.

Decision Block 30390 tests whether the view is too long (gtdcvwl greater than RFVHML) and, Block 30420 performs the procedure display of GTDCVEl panel (view error display :: : :: : .,. : . . :- .............. ::
-:- :: ,.: . : . :

~ 2 ~ ~ 3 :~

panel). If so, Block 30440 tests for a user end indication (FE procedure, Figure 22, Block 48130). If the view is not too long, control passes to ~lock 30520.

Decision Block 30445 tests the result of Block 30440 and if an end was indicated, passes control to Block 30490.
Otherwise, control i5 passed to Block 30480 which forwards control to Block 30420.

Decision Block 30490 exits the CV procedure with an error indication. Block 30520 builds C source in the buffer for the VMOF structure array definition initialization suffix. Block 30540 writes the buffer TDT source file using the WTS procedure and saves tha return code. Block 30570 increments the view table index and passes control to Block 277~5.

Decision Block 30660 tests whether the return code from the last write is good and, if so, passes control to Block 30730. I~ not, control is passed to Block 30680 which sets an error message gtdmsg = "TDT SOURCE WRITE ERROR". At Block 30690, the program exits from the CV procedure with an error.

Block 30730 closes the view C source file. Block 30740 releases memory used by the internal transaction view table.
Block 30810 sets up compile parameter values. Block 30990 copies the compile parameters to a list. Block 31080 saves the original directory and Block 31090 changes to the directory in which the view source is located (UNIX
implementation only). Block 31100 calls the C compiler with the parameter list built above (Block 30990) and saves the return code.

Decision Block 31130 tests whether the compiler return code indicates the compiler terminated with an error and, if ,.

: : .. . ~, ;: :
. . - . . . . ... .
~, . . : : :, :: ::: . .. ; : :
~.: . , , . :.
.: ~ : , .. : : :.. .:: : . : :;

: . :. :-. ~ : . :
.. .-: : ,:.
: .~ :::.
. :: . , . ~ :

~2~ ~ 3:~

so, passes control to Block 31150. If not, execution continues at Block 31200. Block 31150 shows the GTD output file to the user with the compiler error message. Block 31160 sets the ~rror message for output gtdmsg = "VIEW
COMPILE FAILED". The program exits the CV procedure with an error (Block 31170)o Block 31200 sets the message for output gtdmsg = "VIEW
COMPILE CO~PLETE". Block 31210 ends the CV procedure.

.. . . . ................ ....

: , GTD COMPILE PANBL~: CP PROCEDURE ~23~ ~, 9 Looking next at Figure 55, which depicts the preferred embodiment o~ this procedure according to the present invention, the compile panels procedure initiates a compile process for each panel in the application. It first builds a list of all the panels in the application ~rom the menus and panel names listed in the STDE table and then initiates the compile process for each panel in the list.

The CP procedure begins at Block 31540 by building the panel name table from the STDE panel and menu entries, and counting the number of panel names, NP (Block 31670). Then, the i index is initialized to the beginning of the panel name table (Block 31870).

~ ecision Block 31875 checks if i is less than or equal to the number of panels in the panel table, NP. If so, the procedure sets the message field to GTDMSG="PANEL COMPILE
complete" tBlock 31950) and the program exits the CP
procedure (Block 31960). If i is greater than NP, the procedure moves the panel name into GTDP~EM in the work area (Block 31880). Block 31B90 next performs the compile the panel procedure CP0 (Figure 56, Block 32030), Decision Block 31895 checks if the compile wa~ successful. If it was, and is incremented (Block 31930), and execution proceeds to Decision Block 31875. If compile was not successful, the get error message field is set to GTDMSG="PANEL COMPILE
FAILED" (Block 31900). The procedure returns with the error (Block 31910), increments i (Block 31930), and returns to Decision Block 31875.

CO~PILE PaNEL- CP0 PROC~DURE

Looking now at Figure 56a-c, which depict the preferred . . . : : . .: ~" .. ,:, , . . :
:: .. . . . ~ ,:, , :
, , i : i ~ ..... :'''::. ' ~ ' ' . " ';
' ~ : :i ': , - : . : .
i : . ::: :

~ ~ 2 .~
embodiment of the GTD compile panel procedure, the CP0 procedure begins by building the fully qualified file pathname of the panel source module (Block 32150). The file statistics on the panel source are obtained (Block 32220) and the modify date and time are saved in mtim~ (Block 32230). The transaction view modify date and time are then compared to the panel source date and time. If the transaction view modify date/time is greater than the panel source date/time, the transaction view modify date/time is savad in mtime (Block 32240) and execution continues with Block 32260. If not, execution continues with Block 32260.

The fully qualified pathname of the panel object module is then built (Block 32260). The file statistics on the panel object module are obtained (Block 32370). Decision Block 32375 checks to see if th~ file statistics were obtained successfully.

If the statistics were obtained successfully, the object modify date and time are saved in otime. Otherwise, otime is initialized to zeros (Block 32375). The source and object modify times are then compared (Block 32420). If the source modify time is greater than the object modify time (mtime > otime) the program jumps to Block 32440.

If the sourc~ modify time is not greater than the object modify time, the program checks to see if this is a conditional compile (gtdcflag = C) (Block 32425). If so, the CP0 pro edure ends and returns with no error (Block 32425). If this is not a conditional compile, compiler parameters are built (Block 32440). The panel compiler is then called to produce the object file ~Block 33070). The compile status is checked (Block 33180). If the compile was successful, the CP0 procedure ends (Block 33180).
Otherwise, the gtdmsg is set to "COMPILE FAILED" (Block 33230). The error messages are displayed, but no input is ., . :
. . , .
. ~

': `,.'' ., , ~ ~' ` ':
:
. : :: ' , ` .::' , 2 ~ 2 ~
accepted from the user (Block 33240). The procedure then returns with an error status (Block 33325).

~OMPIL~- CC PROCED~RE

Moving now to Figures 57a-d, which depict the preferred embodiment of the CC procedure, the compile procedure initiates a compile process for each procedure in the application. It examines each procedur~ in the STDE table and calls the appropriate compiler for the procedure. In the current implementation only C and COBOL compilers are supported, however, any language may be used which can produce linkable object code.

The CC procedure begins by initializing E to point to the beginning of the ST~E table (Block 33380). Decision block 33420 checks to see if E points past the end of STDE
table. If it does, the program jumps to Block 33600 and sets the message field, GTDMSG to "PROCEDURE COMPILE
COMPLETE" at which time the program exits the CC procedure (Block 33610). If E does not point past the end of STDE
table, the STDE entry is checked to see if it is a procedure entry, STDETYP = C (Block 33~25). If the STDE table entry is not a procedure, execution continues at Block 33520. If the STDE table entry is a procedure, the procedure language is checked to see if the procedure is written in the C
language, STDECTYP = C, (Block 33426). If the procedure language of the STDE entry is not the C language then the program jumps to Block 33520. If the procedure language of the STDE entry is the C language, Block 33430 calls the compile C procedure: CC0 (Figure 58, Block 33690).

Decision Block 33435 determines if the compile is successful. If the compile is successful, the program jumps to Block 33520. If not, ~ET error message filed, GTDMSGF is ,, ~ '' , ' , ' ~' ';
, .~ ' ' ' . ,' " " . ~ ' ' , ;` .

f~ ~~ ~ ~23 set to "PROCEDURE COMPILE FAILED" (Block 33440) and the program returns from the CC0 procedure with an error (Block 3~450)-Decision Block 33520 determines if the STDE procedureentry is a COBOL procedure, STDECTYP = COBOI. (Block 33520).
If the procedure language is COBOL, at Block 33530 the program calls compile C procedure, CCOB0 (Figure 59, Block 36270). If not, the program jumps to Block 33580. Decislon Block 33535 determines if the compile is successful. If the compile is successful, the program jumps to Block 33580. If the compile is not successful, error message field, GTDMSG
is set to "PROCEDURE COMPILE FAILS" (Block 33540) and the program returns from the CCOB0 procedure with an error (Block 33550).

Block 33580 increments E to the next STDE table entry and returns to Block 33420 to examine the next STDE table entry.

CO~PILE C PROGRAM: CC0 PROCED~RE

Looking now at Figures 58a-j, which depict the preferred embodiment of the CC0 procedure, this procedure invokes the compiler (or compilers) necessary to build an output object for the C procedure. It first determines if a compile is necessary for the current procedure. It is necessary if the compile is an unconditional compile, or if it is a conditional compile and the transaction view source or procedure source modify date/time is larger than the object module date time. If the compile is necessary, then the compile proceeds as follows. First a DBMS compile is performed, if the procedure is flagged as a DBMS procedure in the STDE table. Then the compile is performed, followed by any required cleanup to get rid of temporary files.

r ~ `; ` ~` ' ''`' ': `
~, ' ' I : ~ `

, ~ ;:'' ~ ,:

:. ~' i "' ~ " '' ' The CC0 procedure starts execution by rewinding the GTD
output file (Block 33780), and building the fully qualified C source module file name (Block 33820). It then obtains the file statistics on the procedure source file (Block 33890) and saves the modified date~time in mtime (Block 33900)-The Decision Block 33910 determines if the transactionview modify date/time, stored in tvwtime, is greater than the procedure date time stored in mtime (Block 33910). If this is true, the transaction view modify data/time is saved in mtime (Block 33910).

If the transaction view modify date/time stored in tvwtime is not greater than the procedure date/time stored in mtime, then execution continues with BlocX 33~30. In Block 33930, a C object module pathname for the output object is built, and file C object module statistics on procedure object module are obtained ~Block 3~040).

Decision Block 34045 determines if the statistics were obtained successfully, and if they were, the modify date/time in otime is saved. If they were not obtained suc~essfully, otime is initialized to zeros. Decision Block 34090 determines if souree modify time is greater than object modify ti~e. If true, the procedure jumps to Block 34110. Decision Block 34095 determines if gtdcflag equals 'C', indicating a conditional compile. If this is true, the procedure returns with no errors.

Decision Block 34110 checks to see if the procedure is a DBMS type procedure (STDECDB2 = Y)u If it is not, the program jumps to Block 35170 to compile the C procedure. If the procedure is a DBMS type, the program sets up the data sets required for the DBMS pre-compiler and then invokes the ~' ': : `. . .:

'- , :'''` ~
.' .:. ~ . ' ':' " ' : :

3 ~
DBMS pre-compiler. Block 34140 copies the C source file to a temporary file for precompiling, and builds the C DBMS
pre-compiler parameters (Block 35170). It then calls the C
DBMS pre-compiler (Block 35030).

Decision Block 35060 determines if the pre~compile was successful. If the pre-compile was successful, the program jumps to Block 34110. Otherwise, the user is shown the pre-compiler GTD output file containing the error messages from the pre-compiler (Block 35070) and the error message field, gtdmsg, i5 set up to contain the name of the failed procedure, STDEN~ME, together with the "PRECOMPILE FAILED"
message (Block 350~30~. The error messages are displayed, but no input is accepted from the user (Block 35090). The procedure then returns with an error (Block 35100).

In Block 35170, the program builds C compiler parameters for the compile procedure, saves the current directory pathname (Block 35600), changes to directory gtdslib (Block 35610), calls the C compiler (Block 35620) and after the C
compiler has completed, changes back to the original directory (Block 35630).

Decision Block 35670 checks to see if the C compile was successful. If it was, the program jumps to Block 35740.
If the C compile was not successful t:he GTD output jumps to Block 35740. If the C compile was not successful the GTD
output file containing the compiler error messages is shown to ~he user (Block 35680) and the error message gtdmsg field set up to contain the name of the failed procedure, STDENAME, together with the "COMPILE FAILED" message (Block 35690~. The error messages are displayed, but no input is accepted from the user (Block 35700). The procedure returns with an error (Block 35710).

Decision Block 35740 checks to see if the procedure is a .

,.. '' ''', ',.~ ' ''', " : '.', ' , ' :
. . . .
: ~ "~ ".:." ' "': ;' ` ' ` ' . :: ~
'' :

DBMS type proceduxe. If it is not, the program jumps to Block 36600. If the procedure is a DBMS type procedure, the program moves the compiler output object file named with a temporary name to the correct name (Block 35780), removes the DBMS temporary files (Block 36240) and sets up the message field, gtdmsg, to contain the name of the compiled procedure, STDENAME, together with the COMPILE COMPLRTE"
message (Block 36600). The status messages are displayed, but no input is accepted from the user (Block 36610), and the program exits the CC0 procedure (Block 36630).

CONPII.E COBOL PROGR~i: CC:OB0 PROCEDIJRl~

Moving now to Yigures 59a-c, which depict the preferred embodiment of the CCOB0 procedure aspect of the present inventions, this procedure invokes the compiler (or compilers) necessary to build an output object for the C
procedure. It first determines if a compile is necessary for the current procedure. It is necessary if the compile is an unconditional compile, or if it is a conditional compile and the transaction view source or procedure source modify date/time is larger than the o~ject module date time.
If the compile is necessary, then the compile proceeds as follows. First a DBMS compile is performed, if the procedure is flagged as a DBMS procedure in the STDE table.
Then the compile is performed, followed by any required cleanup to get rid of temporary files.

The compile COBOL program procedure begins (Block 36810) by rQwinding the GTD output file to the beginning. Block 36850 builds a fully qualified file pathname of the COBOL
source module. Block 36920 gets the file statistics on the procedure source. Block 36930 saves modified date/time in field mtime. Block 69640 determines if the transaction view modified date/time is greatPr than the procedure date/time.

:~., ' .. ~ ", ',' ;

- . . ... .
, : . . ~ ~ . ~. : .. : .

,: , ~- , ., ~ ~ 2 ~
If it is, the program saves the transaction view modified date/time in mtim~. Block 36960 then builds the fully qualified pathname of the COBOL object module.

Block 37070 gets the file statistics on the procedure object module. Decision Block 37075 determines if the file statistics were obtained successfully. If they were, the program saves the modified date/time in otime and jumps to Block 37120. If the statistics were not obtained successfully, the program initializes otime to zeros and continues execution with Block 37120.

Block 37120 determines if the source file modify date/time is greater than the object file modify date/time.
If the source file modify date/time is not greater than the object modify date/time, then the program returns from the CCOB0 procedure. If the source file modify date/time is greater than the object modify date/time, then execution continues with Block 37150.

Decision Block 37150 determines if the procedure is a DBMS type procedure. If it is not, the program jumps to Block 38650~ If the procedure is a DBMS type procedure, Block 37190 determines if the environment configuration information indicates that a machine-dependent DBMS
translation is required. If so, the program translates COBOL standard DBMS source to machine dependent DBMS source placing it into a temporary file, and execution continues with Block 38150. If not, the program copies the COBOL
source file to a temporary file for a standard DBMS
pre-compile.

Block 38150 builds the COBOL DBMS pre-compile parameters, and Block 38630 calls the COBOL DBMS
pre-compiler. Decision Block 38650 determines if the pre-compile was successful. If it is, the program jumps to TI-1~766 258 .

, .
.
~: , Block 38730. If not, the pre-compile error output in the GTD output file (Block 38660) is displayed, the error message filed, GTDMSG, is set up to contain the name of the failed procedure, STDENAME, together with the "PRECOMPILE
FAILED" message (Block 38670) and the error messages are displayed, but no input is accepted from the user (Block 38680)o The procedure returns with an error (Block 38690).

If the pre-compile is successful, the program (Block 3S730) builds the compiler parameters for the compile, (Block, 3g320) saves the current directory, (Block 39330) changes to directory gtdslib, (Block 39340) calls the COBOL
compiler, and (Block 39350) changes back to the original directory.

Decision Block 39450 determines if the compile was successful. If so, it jumps to Block 39530. If not, the program shows the compiler error output in GTD output file (Block 39460), sets the error messaye field to contain the name o~ the failed procedure, STDENAME, together with the "COMPILE FAILED" message (Block 39470). The error messages are displayed, but no input is accepted from the user (Block 39480), and (Block 39490) returns from the procedure with an error.

If the compile i5 successful, the program determines (Block 39530) if the procedure is a DBMS type procedure. If not, the program jumps to Block 39930. If the procedure is a DBMS type procedure, the program removes the DBMS
temporary files.

Block 39930 removes other temporary files. Block 40030 sets the status message field to contain the name of the compiled procedure, STDENAME< together with the "COMPILE
COMPLETE" message (Block 40030). The status messages are displayed, but no input is accepted from the user (Block , . , , , . . i- . ,.. ~ . .

: :;' ~ : . ,. - j , .
' ':' :' ,, ,. , , . ~

~2~13~
40040). The program exits the CCOB0 procedure (Block 40050)-BIND ~RA~æACTION~ B~ PROCEDURE

The final step in preparation of a GTD transaction isthe BIND process for the TDT member. This process extracts all GTD system-provided runtime members nece~sary to execute the transaction along with each of the designer-specified procedures, panels and views creating the appropriate load module.

Consider now Figures 60a-b, which depict the preferred embodiment of the BT procedure aspect according to the present invention. The bind transaction procedure builds the application load module and installs it in an executable directory or library. It may also perform a data base bind if required by the DBMS used. In the implementation documented here this was not necessary; however, on the mainframe a DB~S bind must be performed before the load module can access the DBMS successfully. The load module is built with a linkage editor. This utility resolves all unresolved references made to DAA, application, or system libraries~ Library references can either be dynamically loaded at execution time or linked in with the load module.
It is preferred to have library modules dynamically loaded at execution time.
:i`
The BT procedure begins by rewinding the GTD output file (Block 40260), sets up the link editor parameter values and application input file with link editor files to be included in the link editor procedure (Block 40580) identifies the DBMS procedure types, if any, and procedure language types ~Block 41790), sets up names of language, DBMS (if any), DAA
system, operating system libraries and object files to be . .

, ` ' ' ~`,.'.. ~ ' ' ~: .
.. ;

included in the link (Block 42060). 2~2 The appropriate linkage editor to use is determined (Block 42790).

The parameter list is built from the setup values (Block 42840).

The link editor is called with the generated parameter list and the link editor return code is saved (Block 43020).

The linkage editor output module is opened for read only (Block 43070) and the module size is initialized (Block 430~0)-Decision Block 43090 checks to see if opening thelinkage editor output module was successful. If the open was not successful, the program jumps to Block 43160. If the open is successful, the module siæe is determined (Block 43100) and the linkage editor output module is closed (Block 43110~.

Decision Block 43160 checks to sele if the linkage editor return code is good. If not, the program proceeds to Block 43170. If the return code is good, the linkage editor output module is checked to see if its size is greater than zero (Block 43165). If the module is greater than zero, the program jumps to Block 43460. If not, the output file containing the linkage editor error messages is displayed (Block 43170), the error message field, GTDMSG is set to "BXND FAILED" (Block 43180), and the program returns with an error (Block 43190).

The program rewinds the GTD output file (Block 43460) and calls the task termination utility to stop the currently executing application module (Block 43500). This is due to .. . . :, :. :

3:l an operating system restriction on UNIX which prevents a currently executing load module from being overwritten by a new copy. This does not apply to the mainframe implementation. A way to get around the problem is to kill the task and then replace the load module.

If the stop is successful, the program advances to Block 43Z50, removes the original load module (Block 43650), renames the temporary file to the original name (Block 436080), sets the error message fiald, GTDMSG to "BIND
COMPLETE~' (Block 43760), and the program exits the BT
procedure (Block 43770).

If the stop is not successful, the program shows the user the output file containing the linkage editor error messages (Block 43170) sets the error message field, GTDMSG, to "STOP TRAN FAILED" (Block 43550) and returns from the BT
procedure with an error (Block 43560).

.
"

, . . .
- .
, .. : : , , ;. ; : .:

: ' ' ~, ', , , :, ' ~

3 ~

FIL~: ~RANSFE~R PANEI,8/PR0~13DIJRE ~VI2W8~DOC~JMENq~ATION

The last area of the GTD involve the File Transfer Panels, Procedure, Views, Documentation Procedure which provides ths interfaces neccessary to file transfer all or part of the application source from one DAA machine to another.

The file transfer file is built by passing a list of all data sets for transfar to an archive utility, which is supported on both platforms, to archive the application files into one large file. This archive file is then shipped to the destination sys~em using standard data transfer channels between ~he 2 systems. This data transfer should have a capability to kit an unarchive utility, once the file is shipped, to unarchive the file into its component files into appropriate corresponding file locations on the destination machine.

The file transfer menu option needs only to present panels to $he user permitting the selection of required components for transfer to the destination environment. It may then modify a copy of the TDF to comply with the target machine naming conventions. Other application source components are independent of the naming conventions on the different platforms due to the capabilities provided by the IET.

Specifically, the GTD file transfer procedure begins at Block 115640 by building a parameter list for the file transfer user interface utility including ~SERID, MAPLIB, and TDTNAME ~Block 115750~. The output file is rewound to the beginning to capture any utility output messages (block 116260) and the file transfer user interface utility is invoked (Block 116300). Decision Block 116410 checks to see , ` - ;; ~ : , ' .' : . :
-: ": : :.~

': . ;:~ , ' :~

2~13~

if the file transfer was successful. If it was, the program exits tje FT procedure. If not, the procedure shows the messages in the output file (Block 116450), sets the error message field, GTDMSG equal to "FT FAILED" (Block 116455~, and exits the ~T procedure with an error.

,: .: , . .

, , , , , : . , .

~`~2~
TRAN8ACTION DEFINITION TABL13 .
The Transaction Definition Table, or TDT, as used throughout this description, consists of various tables of information stacked together so that the IET can easily access the appropriate information at run-time for the transaction procedures. As seen in Figure 4, the TDT
consis~s of the following table types, described in further detail below: TDT overhead 3~, list of pan~l map entries (TPE) 44, list of procedure entries (TCE) 46, list o~ menu entries (TME) 48, list of language entries (TLE) 50 defining the various languages (i.2. English, French, German, etc.) in which the documentation is available, and list of SQL
data base processing procedures (DBSYNC) 52.

Where pointers are used~ if the number of entries is zero or this particular type of entry is not used by this specific transaction, the pointer value may be NULL.

Each table type is described below by listing the name of the entry type and a brief description of its purpose.

TDT OVERHEA~. The TDT overhead 36 contains all of the global information about the transaction and pointers to the various tables. It consists of the followiny fields:

TDTID is the four character application identi~ication.
TDTRELN is the four character release number.
TDTGTIME is the time that this TDT was generated.
TDTGDATE is the date that this TDT was generated.
TDTDREP is the eight character documentation report name.
TDTDGEN is the eight character documentation generation name.
TDTAMENU is the pointer to the menu entry in the TPE
tablQ .
TDTAHELP is the pointer to the help entry in the TPE

, - :; , , ~ ~ , ~. ~, , .
,'. ~ " ~, . ' `' : . :
~: : , ~ æ~
2 ;~ 3 1 table.
TDTAINFO is the pointer to the info entry in the TPE
table.
TDTA~LOS is the pointer to the glossary entry in the TPE table.
TDTNTPE is the number of entries in the TPE table.
TDTATPE is the pointer to the first entry in the TPE
table.
TDTNTCE is the number of entries in the TCE table.
TDTATCE is the pointer to the first entry in the TCE
table.
TDTAPPL is the four character application name.
TDTNTLE is the number of entries in the TLE table.
TDTATLE is the pointer to the first entry in the TLE
table.

8ACTION P~NlEI. ENTP~I~58 ~TPE). The TPE list 44 is an array of TPEs each describing a single transaction panel, the combination of which includes all panels required for the processing of a procedure and containing the following f ields:

TPENAME is the eight character panel name.
TPEAMAP is the pointer to the panel map data for this panel. This i5 generated by the map compiler, external to the TDT.
TPEAITCE is the pointer to the input TCE for this panel.
TPEAOTCE is the pointer to the output TCE for this panel.
TPERSVDl is a twelve character reserved field.
OPCHT~ is the pointer to the help table.
TPENTME is the number of TMEs for this pan~l if it is a menu panel.
TPEATME is the pointer to the first entry in the TME
table for this panel i~ it is a menu panel.

.
, .. . .
. ~ :

2 ~
TPERSVD2 is a twenty character reserved field.

TRANf;ACTION PROCBDURE ENTRIE~ CE). The TCE list 46 contains pointers to various VIEWs which are described by the View Map Object Header (VMOH) and View Map Object Field (VMOF) structures which define views and are described later. The TCE list is an array of TCEs each describing a single application-supplied procedure, the combination of which includes all procedures required for 'he processing of an application transaction. The TCE contains the following ~ields:

TCENAME is the eight character procedure name.
TCEAPROC is the pointer to the entry point of the application supplied procedure.
TCEAIVW is the pointer to the input view VMOH.
TCEAO~W is the pointer to the output view VMOH.
TCEAPVW is the pointer to the profile view VMOH.
TCEDBT~P is a character describing the data base type.
(SQL = 1).
TCERSVD is a seven character reserved field.

TRAN~AC~ION MENU E~RIE~ E3. The TME list 48 is an array of TMEs each describing a single menu entry. Each TME
points to a TPE or a TCE, or both, and contains the following fields:

TMESEL is the eight character selection code for this entry.
TMEATPE is the pointer to the TPE to be used for this selection code.
TMEATCE is the pointer to the TCE to be used for this selection code.
TMEDESC is the thirty-two character description of this entry.

: : : :

: . .,: . . .
..... ... ..
: :: ~: :, ~ ,.:
. . : . :

f `3.
3 ~

TRAN8AC~ION L~NG~G~ EN~RI~8 (TL~). The TLE list 50 is an array of TLEs each describing a language (i.e. English, French, German, etc.) in which the documentation is available, and containing ~he following fields:

TLENAME is the eight character language name.
TLEDREP is the eight character documentation report name.
TLEDGEN is the eight character documentation generation name.
TLERSVD is a twenty-four character reserved field.

SQL DA~ BA~ PROCES8IN~ PROCEDURE ~DB8YNC~. The DBSYNC
table 52 contains the pointers to the various entry points for the data base procedures defined by the data base protocol and needed by IET during the execution of a transaction. It consists of the following fields:

CONNECT is the procedure pointer to the entry point of the data base connect procedure.

COMMIT is the procedure pointer to the entry point of the data base commit procedure.

RELEASE is the procedure pointer to entry point of the the data base release procedure.

VIE~ MAP OBJECT ~EAD~R ~VMO~). The Views discussed earlier are described by a Vi~w Map Object Header (VMOH) 54 and a list of View Map Object Fields (VMOF) 56. The description of the VMOF 56 follows the VMOH d~cription given directly below. The VMOH 54 contains the static information about a view and a pointer to the array of VMOFs. It consists of the following fields:

VMOHAPPL is the four character application name.

; . ~
~ , .

: . ~ ;
, , ~ . . , : .
, ~2~3 VMOHVIEW is the eight character view name.
VMOHVTME is the view compile time.
VMOHVDTE is the view compile date.
YMOXVE~ is the four character version.
VMOHFMT is the one character view format.
VMOHRSVO is a one character reserved field.
VMOHNE is the number of VMOF entries.
VMOH~E is the pointer to this view's VMOF array.

VIEW ~P ORJ~CT ~I~LD ~V~OF) AR~AY. The VMOF array 56 contains the displacement, length and type of each field in the view. Each VMOF entry consists of the following information:

VMOFRlED is the displacement of this data elQment in the transaction view work area.

VMOFRlEL is the length of this data element.

VMOFRlEN is the numb~r of occurrences for this data element.

VMOFRlET is the one character data element type. This type includes, but is not restricted to the following types:
binary; character; signed character; unsigned character;
small; short; long; hyper; unsigned small; unsigned short;
unsigned long; unsigned hyper; single: and double.

VMOFRSV2 is a three character reserved field.

:

~ , :.' , . ,- . :, .. , . :
. :, :

: : .' ~ : , ., :. , .
: :

The last major area of the present invention is the IET, or dialog manager. The IET communicatss with the user indirectly thruugh the input and output messages. Whenever messages are communicated to the user the IET calls an transaction processor interface function which communicates with the transaction processor. The transaction processor is then responsible for the presentation of output messages to the user and accepting input messages from the user. In this way a dialog may be maintained between the user and the application program through the IET and the transaction processor.

Communication between the application program and the IET is performed through the transaction view. The data fields within the transaction view are initialized by the IET when it receives an input message. When the input data contains formatted text, the IET interprets the formatted text by using the header information in the input message to locate the appropriate map and then calls the map interpreter to extract the input field information from the input message and place in the transaction view. The data fields are also inltialized by the application procedure before relinquishing control to the IET. The data fields are then placed in the formatted output data when the IET
calls the map interpreter again. The formatted output is placed in the data portion of the output message and header information built. Communication fields within the transaction view exist to allow the application procedure to instruct the IET as to what action to perform once the application has relinquished control. Two typical actions are to present a new panel to the user or to perform a link request to a new procedure.

The IET communicates with the application profile. The IET maintains a separate application profile record for each unique user/application/transaction. A DBMS interface :.

:
: : ' ' .:
.

, 3 ~
procedure called by IET performs all application profile input and output. Typically, the IET reads the application profile whenever a new message is received from the transaction processor and writes the application profile before sending a message to the transaction processor.

The IET provides the application with services for handling menus, help and documentation, message and screen formatting, and cooperative processing. The TDT includes the structure and names of the panels which contain the application menus. It also contains the list of application procPdurss and panels referenced by each menu entry. An IET
input and output procedure exists to perform processing and navigation for each level of menu supported by IET. Thus menu handling logic is completely handled by the IET without involving any application procedures. Help and documentation is supported by the IET in a similar manner.
The help and documentation files are listed in the TDT.
There are IET input and output procedures for handling both help and documentation processing or navigation without involving any application procedure. The IET provides for cooperative proce~sing through its link and return capabilities and its use of a profile view. This protocol allow data to be passed between two processes and profiles for tha maint~nance of saved data in the two processes and application profile, allowing a dialog between the processes to obtain a cooperatively achieved result. The IET provides the application control over message and screen formatting ~ervices through the control fields in the transaction view which indicate the current and next panel display names.
The application can control the panel displayed by changing these fields~

The services the IET provides for the application which include menu handling, help and documentation handling, application profile management, cooperative processing and - , : : - . .

: ,; , ;. :. ~ ~: ::
, : , ,~ . , :. :: :, : :
,, : :, . :, : .
.~ , . , :- ~ . : : ~:

,~:, . ..
....
'' ,' `' ~ ~ :
: . ,,~ "... ' :
: ' : ', ' message/screen formatting isolate the application from the platform software by allowing the IET to handle any differences in platform software and hardware related to interface differences for file input/output, screen formatting and message handling. The IET implementation for each platform provide isolation for the application program.
Further isolation is maintained through the use of common high level languages and a common embedded DBMS language interface for data base applications on all platforms. It i5 a result of the isolation from the hardware and software-dependent interfaces and the use of common language implementations which allow application portability across multiple execution environments.

The IET communicates ~ith a remote application through the use of link and return protocols, data input and output view interfaces and a routing request header. The LINK is a request to IET to initiate the execution of a remote application procedure. The RETURN is a request to IET to return control to the initiator of the LINK request. The interface view includes documentation on the initiating procedure, thQ remote application procedure, the user terminal devices and the systems on which they are located.
The INPUT view lists the items which are to be included as input then a LINR request is performed. The OUTPUT view lists the data items which are to be included as output on a RETURN request. All these views are included in the view ob~ects huilt by GTD for use by IET in the processing of LINK and RETURN requests.

The IET performs different functions for both the LINK
and RETURN requests depending on whether the application procedure is requesting LINK or RETURN functions or whether the IET has just received an input message containing either a LINK or RETURN routing request header. Whenever the IET
complies with an application LINK or RETURN request it .
.
.
:
.
:.

, ;- ~ ,,: , ~

3 :~
builds the header as part of the output message. The header uses an identifying keyword at a well-known location in the data and includes the interface view as well as data ohtained from the transaction view which corresponds to the data items listed in the input (for LINK request) and output (for RETURN request) views for the application procedure just executed. The output message is then sent to the transaction processor for handling. The transaction proc~ssor recognizes a routing request header on the output message and treats it appropriately. Whenever the IET
receives an input message containing a routing request header, the IET determines if the message has come to the correct system; if not, the message is forwarded to the appropriate system. Otherwise, the application profile is retrieved and placed in the transaction view, then the interface and input (for LINK requests~ and output (for RETURN requests) view data is placed in the corresponding data names in the transaction view for the application pxocedure to be executed. The application procedure is then executed. The applications procedures involved are in control of exactly when the LINK and RETURN requests are performed.

At this point, the Information Engineering Task will be consider~d in greater dPtail. Figures 62a-bb depict a flow chart of the preferred embodiment of this aspect of the present invention. As stated earlier, the IET is the control module for every DAA transaction and is written to be entered through a call from the transaction processing subsystem when the DAA transaction is executed by the user.
Such subsystems might be IMS on MVS or Tuxedo on Unix platforms.

IET must get control of a transaction via the transaction processing system, for every instance of the transaction execution. GTD forms an executable transaction module by :
::' ' , ~,', ' ~' :

,.,,:
':' ~'' ' , ~
::
'' '., '' !,: ' ~ : . : ' .. , . ' "' link-editting the TDT, maps, user procedures and the IET
module together with the transaction sub-system main interface module which calls the IET.

Several key variable areas and components are referenced throughout the description of the IET logic, and are briefly described here.

Transaction Definition Table (TDT): As indicated earlier, the TDT is critical to the success of IET since the TDT provides all o~ the variable information, in table form, that the IET module needs to control the flow of panels and data between the user and the application procedures. The TDT also provides pointers to the menu panels, help panel, and glossary panel. Reference ts the TDT discussion presented earlier will enable one to better understand the IET logic flow.

Transaction View (TV) As defined earlier, a transaction view is a collection of variables that contains state in~ormation, names and pointers used throughout IET to control flow of processing between IET and the user procedures. It consists of a set of well-known IET variables followed by user-specified variables. This is the only way IET and the user procedures have to c:ommunicate information back and forth. A pointer to this area is passed to a user's procedure every time it is called. Example of fields contained in this view are the executing-system-name, active~panel-name, user-id and transaction-name.

IETM/IETI headers: These headers are separate collections of blocks that precede the IET interface messages exchanged between systems and transactions. IET
interface messages are used to communicate requests between systems and between transactions. They contain a header, a control block and the message or view data. The data in the OE~ ~

header (IETM) and the control block (IETI) provide IET with information regarding the origin and destination system environments of the message as well as the capabilities of the requesting terminal. This data is used to route the message to the destination and the response back to the originator. It is also used to determine what conversion, if any, needs to be done on the data in the message. It should be noted that the names of the various fields are strictly of choice and should not limit the scope of the invention.

The IETM header defines the total length of the interface message and the transaction requested. It consists of th~ following fields:

IETMLL is the length of the IETM message including this header.
IE~MZZ is a reserved field and contains zero.
IETMTRAN is the eight character transaction name.
IETMBLNK is a one character field and contains blank.
IETMCONT is the eight character control code and contains "=IETCONT". This field is the key used by IET
to identify this as an interface message.

The IETI control ~lock follow~s the IETM header and describes the originating and destination system environments. It consists of the fol:Lowing fields:

IETlLL is the length of the IETI control block.
IETlZZ is a reserved field and contains zero.
IETIAPPL is the four character application ID.
IETIVIEW is the eight character view name.
IETISYST is the eight character name of the system owning the requesting terminal. This may not be the originating system for the message.
IETIRSVl is an eight character reserved field.

2~2~
IETICC is the one character command codeO It specifies the type of request (LINK, RETURN, FORWARD, or TERMINAL).
IETIRC is the one character return codeO
IETIMC is the one character message code.
IETIHCNT is the one character hop count. This field is used to prevent looping in the network during routiny.
IETIUSER is the eight character user ID.
IETITERM is the eight character terminal name.
IETION0 is a four character reserved field.
IETIAPL0 is the four character originating application identification.
IETISYSO is the eight character originating system name.
IETIT~N0 is the eight character originating transaction name.
IETIPRC0 is the eight character originating procedure name.
IETIFMT is the one character IETI format (Normal = 1).
IETIRSV2 is a three character reserved field.
IETIAPL1 is the four character Destination Application Identification.
IETISYS1 is the eight character destination system name.
IETITRN1 is the eight charactar destination transaction name.
IETIPRC1 is the eight character destination procedure name.
IE~IMTCH is a one character, character type (EBCDIC =
0, ASCII = 1). It is used by IET at the destination to determine what character code conversion may be needed on the message data.
IETIMTIN is the one character integer type (Normal = 0, Byte-swapped = 1).
IETIRSV4 is a six character reserved field.
IETITRMD is the sixteen character terminal definition . ~ .

:

~2~
in~ormation. This defines the capabilities of the terminal.
IETIRSV5 is an eight chaxacter reserved field.

IBM 3270 data streams are referenced in the following description because it reflects the preferred embodiment of the present invention. Nevertheless, such reference should not in any way limit the scope of the invention.

Consider first Figure 62a, which depicts the beginning of the IET flowchart. As a result of the transaction subsystem main module having called the IET, IET logic at Block 10 does first time initialization of global accessible variables and key fields in the transaction view. Some of these variables and key fields include: a TDT pointer, iopcb and altpch (both of which are passed to the IET by the transaction ~ub-system main module), as well as pointers to a screen build area, message buffer, view buffers, and documentation screen buf~er. At Block 20, the IET obtains the ~ocal system name from the system.

The main loop of IET begins at Block 30, wherein new messages are fetched from the transaction sub-system for the given transaction identification. This block starts by closing the documentation intexface, if it was left open due to, for example, a previous pass through the main logic.

Block 40 initializes the transaction view. This consists o~ clearing the TV by zeroing the pointers and setting the character fields to blank, loading the system name, date and time from the operating system, and getting the TDT identification, application identification, and release number from the TDT.

At this point, Block 50 is executed to get the next input from the transaction subsystem. Decision block (60) .

. :

then determines if any new data is available to the DAA
system: STATUS = NO DATA?. If there is not a new data stream available, the IET interface jumps to block 1660 of Figure 62bb, discussed later, to exit the IET interface.

If the logic of Block 60 has determined there is a new data stream available, Block 90 is executed. The user identification and terminal identification are retrieved from the sub-system iopcb and stored into the TV. Block 100 saves the terminal attributes, such as color capability, highlighting, reverse video, etc., and stores them in the TV.

Continuing to Figure 62b, Block 110 gets the transaction identification from the data stream and translates it to native code (ASCII or EBCDIC). Block 120 saves the transaction identification and stores it in the TV.

Next, Decision Block 130 checks the input data stream to see i~ the data is formatted, i.e. directly from a 3270 formatted screen. The check is made by looking for a 3270 SBA in the first byte of the 3270 data stream and, if found, the stream is declared formatted. This implies the data stream came from a 3270 type terminal with a formatted panel displayed D

"Unformatted" implies input from a clsared (unformatted 3270 screen) or at least the first part of the input has no 3270 data stream. The latter case may occur, where formatted data is ~ound later in the message following a special header. If the data stream is formatted then IET
will ju~p to block 780 of Figure 621, discussed later, where the formatted screen is processed.

The logic of Decision Block 140 at this point begins the processing of the "unformatted" data stream. This block : . .

... . .

, ~ , : "

~ ~ 2 ~
checks to see if the data was built by IET in another DAA
transaction, and inserted into this transaction, by looking for a literal 1l =IETCONT" following the clear text tran code in the input message. If the data stream is from a DAA
transaction, then it will have an IET header consisting of IETM and IETI, described earlier. If the test yields a negative decision, the IET interface moves to decision block 470 of Figure 62g, discussed later, where processing begins for a true unformatted message from a 3270 terminal.

If, however, the test yields a positive decision, the IET move$ to Decision Block 150, where it checks if the sending IET's character set is different from the the receiving IET's character set (e.g., ASCII versus EBCDIC).
by comparing the character type field of the IETI header with the receiver's type. If the IET header is from an EBCDIC system, and the local IET is ASCII, the IET interface converts all IETI character fields to ASCII (Block 160).

When a message has IET headers, there should be three separate 2 byte binary length fields, one in IETM, one in IETI and one preceding the messages data following the IETI
headerO Since the lengths are built by the sending IET
process, they will be in the native machine format of that IET's hardware. Some hardware stores the high-order byte first followed by the low order byte (e.g., IBM 370) while other hardwaxe stores there short values byte-swapped with tha low order byte first followed by the high-order byte (e.g., Intel). Therefore at Block 170, the IET compares the local, or receiving, IET's binary length storage type to that of the sending IET's hardware type. Continuing to Figure 62c, if the types are compatible then IET jumps to Block l90. Otherwise the bytes are swapped in the three different length fields at Block 180. The IET then continues to Block 90 where it saves the user identification, terminal system, terminal identification, and terminal attributes , .: ~ :
: : : .: .: :
. '' ;; ' ~ : ' i : :

from the IETI header and stores them into the TV.

The logic at Decision Block 220 checks the IETI command code field for a LINK request code. A LINK request indicates that the requesting IET has attached an input view block (following the IETI header) to be processed by this system and this transaction. If this is not a LINX request then control is passed to block 310 of Figure 62e, discussed later.

If there is a LINK request code, the view stack is cleared (Block 230). The view stack is kept on disk (heretofore referred to as ROLLFILE), indexed by user identification and application identification. Throughout IET operation this stack is used to save and restore view variables at different points in the transaction execution.
In addition, when a view is stored, the panel name and transaction name are also stored with the request. When a link request is received, the IET at Block 230 clears all previo~s views for the current user identification and application identification. The IET at Block 240 then puts the current IETI header onto the top of the stack for the user and application identifications.

At Block 250, the IET moves the name of the requested link-to-procedure from the IETI header to the TV in preparation for execution of the procedure for the given input view that follows the I~TI header. Continuing to Figure 62d, once the procedure name is identified, at Block 260, the IET scans the procedure table entries (TCE, discussed earlier~ for the named procedure and saves a pointer to the TCE with a matching name.

Proceeding to Block 270, the IET uses the TCE block to locate the profile view list, TCEPVW. This list is used to extract the pro~ile view data fields from the TV and move .

,: ~ ., ' , , ~
.. ,: ,. " .
.~, :. . ..

2 ~
them to a separate view work area. Once the view work area is built, the IET has a contiguous list of fields which represents the profile view prior to processing the LINK
request input view Block 280 then saves this profile view by putting it an to the stacX for the specified user and application id.

Block 290 then uses the above input view list (VMOH/VMOF) and moves each field in the input view into the TV. As they are moved characiter fields are translated, if nece~sary, from EBCDIC to ASCII or visa-versa. Also byte swapping is done if the machine storage types are different (see Block 170 for discussion). As documented in the TDT, the VMOF entry for a given field contains the appropriate information to do the mapping, including the offset into the TV, the length of the field, and the format of the field (character, etc.). After the TV is populated, the IET
interface continues to Block 1200 of Figure 62s, discussed later, to start the input procedure specified by the TCE
(Block 260 above).

If, a LINK request has not been indicated (Block 220), control is passed to Block 310. At: this point, the IET
checks the IETI command code for a RETURN command. If it is not a RETURN control is passed to Block 400 of Figure 62f, discussed later. If it is a RETURN request, Block 320 is executed to extract the returned-to-procedure name from the IETI.

Block 330 operates similar to Block 260 and locates the TCE pointer for the raturned-to-procedure.

At Block 340, the IET restores the profile view fields by popping the last pushed view off the stack for the user and application identification. Included in the restore process is the output panel name saved when the LINK was done~ Then . .

~: ... , ... : -, : ~ ,:

. ,, ,., i., ,::
,, ' .': :, :: ~,', ~ , :-: : . ~ .: :, . ..... .
, : ,:. : ,.. : " ~ ;

~ 2 the IET uses the TCE field, TCEP~W, as a pointer to the profile view list structure, VMOH, and its list of VMOF
entries (one per field in the view), to restore all the fields from the profile view to the TV (Block 350).

The TCE is then used to locate the output view list, TCEOVW tBlock 370). From this list of fields the TV is populated with the data from the view data that followed the IETI header. Block 370 employs similar logic to that of Block 350, except the output view list is used instead of the profile view list.

At this point, the IET at Block 380 sets the output panel name into the TV using the the panel name that was restored from the profile data base in block 340. Control is then passed to block 1200 of Figure 62s, discussed later, to start the output procedure specified by the TCE (Block 330 above).

Looking now at Figure 62f, Block 400 checks the IETI
command code for a FORWARD command. If there is no FORWARD
command, then control is passed to Block 430.

The FORW~RD request is used by a DAA transaction on one system to pass input data, usually input terminal data, to anokher system to be executed by the same or different transaction on the destination system. For example, a terminal on one system can use the DA transaction to route a transaction xequest to a remote system for execution. This can be done by entering '~DA sysid tran tran-input" from a cleared screen. Where "sysid" is the name of the remote system, "tran" is the name of the transaction to be executed, and 1I tran-input" is optional transaction data.
The DA transaction would make use of this FORWARD request to build the IETM/IETI/message buffer to be executed on system sysid.

. .

: , , .. , , :: ~ .,: : .
: :
.

: : . :

~2~ 3~

If Block 400 has found a FORWARD command, at Block 410 the IET copies the message buffer following the IETI header to a work area and then branches back to Block 120 of Figure 62b, for processing as if the message buffer was originated on the local system. It is possible in the preferred embodiment of the present invention for this messag~ block to be examined and forwarded yet again to another system for execution. However, generally the FORWARD request is executed after one pass.

Block 430 checks the IETI command code for a TERMINAL
command. I~ it is not a TERMINAL command then control is passed to Block 110 to get the next transaction input.
Otherwise, the message from the data stream following the IETI header is sent to the local terminal specified in the IETI header. Control is then passed back to Block 40 to process tha next input for this transaction.

At Block 470, the IET checks the local machine character set for type of ASCII If it is not an ASCII machine, the IET
interface skips the next step and mov~es to Block 510. If it is an ASCII machine, the IET interface converts the data stxeam to ASCII code (500), and then moves to Block 510.

Next, the IET at Decision Block 510 checks if the data strea~ contains non-blank data passed the transaction code.
Non-blank data passed the transaction code means that a menu option may be present, or option data may await processing by the "UNFORMATTED" panel input procedure. If there is no data passed the transaction code then control is passed to Block 550.

Block 520 is executed when extra data exists. The first non-blank character following the tran code is compared with a 17/ll or "=~' indicating whether the user wants to invoke a ,: . : . : :: : :
.: . :. , ", ~, : ;, ,. ~ : :: : ~:
: . . .",~ , .' ~,:
:::. ,: ,.
.
: .: ., ~ : ~ :
:: ... .. : .. , ~2~
specified command that follows that character. If neither "/" or ;'=" are found, then control is passed to BlocX 550.

If "/" or "=" is found, Decision Block 530 further compares the command string following the character to a "RESET". If the string equals "RESET", control is passed to Block 1560, of Figure 62y, discussed later, where the transaction state is reset and the top level menu is displayed. If the string does not equal "RESET", Block 540 checks if the string equals "QUIT". Skipping to Figure 62x for a ~oment, control is then passed to Block 1530 if the string does equal "QUIT". Here the IET begins processing the QUIT request for the specified user and application identifications by deleting the application identification from the profile data base. Block 1540 then queues the message "DA =1" to the local system for execution. This invokes the Display Active transaction. Control is then passed to Block 30 where the next transaction message is received and processed.

Returning to Figure 62h, the logic at Block 550 begins the processing of transactions usinq only the tran code, which has been invoked from a clear screen. This is one way a user may restart a transaction at the last known state and panel. The process is begun by blanking the panel name in the TV.

Decision Block 567 checks the current user identification for blanks. If the user identification has blanks, there is no user id, and the IET bypasses restoring the profile and passes control to Block 620. If the user identification has not blanks, the logic at Block 570 restores the profile view from the stack, including the output panel name, for the given user identification and application identification.

"~ . ~ - ;

:: : :: : . . : ~

~ ~ 2 ~ ~ ~ 1 3 At this point, Decision Block 580 checks if the last profile was a IETI control block by comparing the first part of the restored view to the literal "IETCONT ". If the result is negative, then control is passed to Block 615 where the TV is populated from the restored profile view.

Block 590 is entered when an IET control block was restored (i.e., the result of Block 580 comparison is positive). A test is made to determine if the IET request was last passed to a different transaction code than this code and passed to a different system identification than the current system. If the result of the test is positive, then control is passed to block 615 where the TV is populated from the just restored view.

Block 600 is executed when the result of the test in 590 is negative. The IET employs a process called TRACE FORWARD
whereby the IET can resend a message to the destination transaction and system id found in the restored IETI. This block builds a new message block which consist oE the IETM, IETI, and a message buffer equal to the IETI tran code. The IETI request code is set to FORWARD. This message block, when transmitted, is designed to restart the transaction on the destination system at the last requested state from this tran/system. After the buffer is constructed, control is passed to Block 1420 of Figure 62v, discussed later, where tbe message is sent to the designated tran/system.

Block 615 populates the transaction view variables from the profile view restored in Block 570, much as the process described for Block 350 of Figure 62e. The input panel name is set to "UNFORMAT" (Block 620).

Moving on to Figure 62j, Block 630 locates the TPE entry for the specified panel name. The TPE contains all the information to build and display a panel. Locating a panel ` ' ~
. .

' '`, ' ` ,`

f . 11~
, - ~ .

is simply a matter of scanning each TPE entry until the desired panel name is found equal to the name in the TPE.
The first TPE is anchored in the TDT at field TDTATPE .

Next, the IET at Decision Block 640 checks to see if the data in the message buffer following the tran code was preceded with an 11=~1. If it was not, then control is passed to block 680. If, on the other hand, the tran code was preceded with an "=", Block 650 handles the menu restart request from the user. For example, XYZ =2 indicated transaction XYZ menu option 2 should be executed. The top level menu panel entry, TPE is located from the TDT using variable TDTAMENU. From this TPE the menu input procedure entry, TCE, is located by using the TPEAITCE field in the TPE.

A~ter Block 650 executes, Block 652 pops each of the views for thi~ user identification and application identification until it locates the first view on the stack, which is the top menu view. If the top view is found, i.e.
the top menu profile view, the TV is restored from the view and the view stack is cleared. If the the top view is not found then nothing is restored in the TV, and the stack is left empty. Block 660 moves the command code following the "=" to the command field in the TV. Control is then passed to Block 1200 of Figure 62s, discussed later, where the input procedure is executed for the menu panel.

Returning to a trans code not preceded by an "=", Block 6~0 checks for a blank output panel name and an input panel name of ''UNFORMAT'I. If both are found, the input message buffer is copied to the outpu~ area (Block 690) and control is passed to Block 960 where the input procedure for the input panel of UNFORMAT is called.

If either are not found, Block 710 starts the logic that ".
: , . .
. : ~:
.

:. , .

~ ~5~ 3 ~

prepares to restart a transaction from a given panel. First the command code is blanked, then block 720 moves the output panel name to the TV. Block 730 then finds the TPE entry for the specified panel name.

In Figure 6Zk, Block 740 checks the TPE for an output procedure entry pointer in the field TPEAOTCE. If the pointer exists, it points to a TCE entry of the procedure to be called prior to outputting the panel. Block 750 then sets the TCE ad~ress and passes control to Block 1200 of Figure 62s, where the specified procedure is executed. If an output procedure does not exist, then control is passed to Block 1610 of Figure 62z, discussed later, where the panel display is built and output to the terminal.

Block 780 begins the logic for messages that are f~rmatted with 3270 data streams. (I.e. the message was determined to have a 3270 SBA at the beginning; see Block 130). At this point the IET expects to have a 3270 input stream that was received from a 3270 terminal that had a DAA
transaction panel displayed. An integral part of IET's processing of input from a terminal is the design of the screen. This is enforced to some degree by GTD when the panels are created. The rule is that the first three fields on a DAA screen that are returned by the 327~ terminal must be the tran code, the panel name and the system id. This is facilitated in 3270 data streams by having these three f.ields as input/output fields with a modified data tag set.
This causes the 3270 to always return them when any transmit key is pressed. When these three fields are returned, the IET can continue processing where the transaction was last exited, invoking the next procedure specified to process the input.

Therefore, Decision Block 780 checks to see if the panel name is present in the data stream by looking for a second 3270 SBA and extracting the characters returned as the panel name. If the data stream is too short or does not have the second SBA, then control is passed to Block 870 of Figure 62n, discussed below, where this input is treated as a restart for the transaction. If the panel name was found, it is stored in ~he TV (BlocX 790) and is translated to ASCII provided IET is running on an ASCII machine.

Decision Block 800 operates similar to Decision Block 780 except the next SBA expected following the panel name is the system name. If this field is not present then control is passed to Block 870 of Figure 62n, where this input is treated as a restart for the transaction. Considering Fiqure 62m, if the field is found, Block 810 stores the panel name in the TV and translates it to ASCII provided IET
is running on an ASCII machine.

Decision block 820 compares the system name from the panel with the system on which IET is running; if they are equal the IET processes this screen and control is passed to block 860 where the profile is to be restored. Block 830 is executed when the system name from the pane.l is not the same as the system on which IET is executing. Therefore, IET
must forward this panel input for processing to the system name on the panel. IET verifies that the panel system name is a valid network system by examining a local data base of valid names. Some systems' implementations may not have a table and therefore all names are potentially valid and should be forwarded to the next higher DAA system for delivery. If the system name is not deemed valid, control is passed to block 860 for processin~ on the local system.

Block 840 is e~ecuted when a forward request to a remote system is needed. This block constructs the IETM,IETI, followed by the message panel input from the terminal. The exact field definitions were discussed earlier in connection : . .: , ;,.: ~
:. , .: : - : : ~;:: . : ' ; . .
~:

~ ~ 2 ~
with the IET message format. The remote IET processing to handle this forward request is handled at Block 400. It is important to note that the IETI is updated to contain information about the requesting terminal, the local and remote IET-systems, relative tran code on each system, panel name on each system, and the type of machine that the local IET is executing on, whether ASCII/EBCDIC and byte swapped or not. As mention earlier, these IET headers facilitate routing to the remote system and proper translation when it arrives. After the message block is formatted by block 840, control is passed to Block 1410 of Figure 62v, discussed later, for delivery to remote system.

Block 860 is executed for a local system terminal input.
The system name in the TV is set to the local system identification and control is passed to Block 870, which blanks the output name.

Continuing with Figure 62n, Blocks 880, 900, and 910 are identical logic to previous blocks 570-590 (i.e., the profile is restored for this user and application identifications). If the last thing done was an IET request to another system or transaction, then a trace forward request is built to restart the transaction/system found in the restored IETI profile (Block glO) and control is passed to Block 1420 of ~igure 62v, for transmission of the request to the desired system. For example, if the last thing done for this user and transaction was a link request to another system, and a return has not yet occurred, or the profile would not show a link outstanding, then this trace forward request is designed to get the remote transaction to do a return again.

If the profile was nok an IET request then control is passed to Block 930 which populates the TV from the restored profile view. (See Block 350 for discussion). Then Block ,.. . , , . ,. , .

:, ., .:
- "~, ':, ~ ' - 2~2~
940 finds the TPE for the panel name specified in the TV
(see Block 630 for discussion).

Block 950 takes the panel map data pointed to by the TPE~MAP field of the TPE, along with the input 3270 data stream and calls TMS to extract the fields returned from the terminal to the appropriate fields in the TV as described by the panel map data area. TMS is a Texas Instruments, Incorporated 3270 scraen facility, but other facilities could be developed or adapted use with the present invention, such as IBM's IMS MFS facility. The important thing is that the input fields returned from the terminal are mapped, including conversion to internal representation, to the application's TV fields. In addition, the 3270 AID
key representation is updated in the TV.

Block 960 gets the TPE entry for the panel name. Then block 962 uses the TPEAITCE to locate the TCE entry for the input procedure to be called. Moving to Figure 62O, Block 970 then saves the procedure name from the TCE into the TV.

Block 980 thereafter updates the binary field in the TV
for the function key. DAA application developers can generate their panels with an option ~ield displayed on the panel as "OPTION:" and if the user types a string "Fnn", IET
will interpret this the same as if the Fnn key was pressed.
This logic only applies if the user typed the function Xey name and pressed the ENTER key. If the function name was typed and another function key was depressed, the IET will used the 3~70 genera~ed AID key as the function key and the user'~ typed function key name will be ignored. In any case after this function key logic, Block 990 will cause this option field to be blanked in the TV.

At this point, the IET at Decision Block 1000 checks to see if the function key selected is F15. If F15 was : ::: -.:, :. .

: . :
: ~ ::
:, : ~
:; .. : ~
~: : . . ~ :
:, : . . .:
: ~ , : : . , : .

.

selected, the IET interface jumps to Block 1530 of Figu 62x, discussed earlier. F15 is used by DAA to indicate that the user wants to QUIT this application, so branching to 1530 will remove this application from the profile data base for the user and the DA transaction will be inserted. If the function key selected is not F15, the IET interface checks to see if the function key F24 is selected (Block 1010). If so, this indicates the user wants to suspend the current application and see a list of his current active applications by use of the DA transaction. Block 102 builds a message buffer of "DA =l" for the user and inserts it to the transaction processing subsystem. After this, control is passed to Block 1630 of Figure 62z, where transaction cleanup is performed.

Decision Block 1040 checks to see if the current panel is the HELP, GLOSSARY or MENU panel. If it is one of these, the control is passed to Block 1190 where the input procedure associated with the panel is to be executed.
Considering Figure 62e, if the current panel is not one of these panels, Decision Block 1050 checks to see if the value of a selected function key equals 1, which is the standard DAA HELP key. If it is not a 1 then control passes to Block 1150, where the next value for the selected key is tested.

Block 1060 begins the logic for displaying HELP panels for a particular application. First the help logic must save enough information that upon exit from the help screen, IET can restart the current panel with all o~ its fields.
This logic builds the help view area consisting of all the current input and output fields contained in the T~S buffer.
The view n~me is set to ''HELPVIEWI' to identify this view.

Block 1070 then pushes and puts this help view onto the stack file. After the environment has been saved, the help logic can now prepare to output the help panel. Blocks 1080 .,:. j ':
~............. .. ~ :

2~2~
and 1090 save the current panel name, documentatlon chapter, section, and page names in the TV.

Block 1100 locates the TPE and TCE for the help panel and help procedure respectively. The help panel TPE is anchored off TDT using field TDTAHELP. Next a help profile buffer is built (Block 1110) and, moving to Figure 62q, saved to the profile file (Block 1120). This is comparable to the logic for Blocks 270 and 280. Block 1130 opens the documentation file, locates the specified help page and reads 20 lines into the TV. Then control is passed to Block 1610 of Figure S2z, discussed later, where the panel is built and output to the terminal.

Decision Block 1150 checks to see i.f the function key is a 3. F3 is usad by IET to allow the user to go back to the top menu. If it is 3, then control is passed to Block 1590 where the top menu panel is built and output.

If the function key is not 3, Decision Block 1160 checks to see i~ it is a 12. F12 is used by IET to perform a "CANCEL". At thi~ point the IET cancels the current panel and redisplays the last panel that preceded the canceled panel.

Moving now to Figure 62s, the IET at this point blanks the message area in the TV.

Block 1200 begins the logic of executing a procedure that is already setup via the TCE. This logic is branched to from several places in IET. This block gets the address of the procedure from the TCE.

Decision Block 1210 examines the TDT to see if this procedure is a SQL procedure and if not, control is passed to Block 1240. If it is, Block 1220 checks a global flag to , .. .. .

.

. : :: .: .:.:
, . : , ... .

... , ., ~ . : :

see if a SQL connect has been done for this user and application. If it has, control is passed to Block 1240.
If not, Block 1230 is executed do the SQL connect. IET uses he application id string as the SQL user id and SQL
password. This facilitates not requiring every user of the transaction be registered with the SQL system, but rather the application id is registered as the user id.

Block 1240 calls the procedure passing the TV, and the transaction I/O control blocXs.

Decision Block 1250 checks to see if the procedure was an SQL procedure and whether an SQL commit needs to be done.
If no, then control is passed to Block 1270. Otherwise, Block 1260 does the required SQL commit.

Block 1270 starts the logic to examine the exit-status of the just-called procedure. If ths exit-state field in the TV is not equal to "ILINK", then control is passed to Bloc~ 1320.

Block 1280 processes khe ILINK request which indicates that the called procedure wishes to invoke another procedure immediately. The name of the new procedure is first obtained from the TV. Next, Block 1290 blanks the exit-state in the TV, and Block 1300 scans the list of TCE's for a match on the name specified. The results is the address of the TCE
for th~ new procedure. Control is then passed to Block 1200 of Figure 62s, where the new procedure is executed.

When the exit-state does not equal ILINK, Decision Block 1320 checks the exit-state for "QUIT". If it is there, then control is passed to Block 1530 o~ Figure 62x, discussed earlier, where the application is deleted from the profile and the DA transaction is inserted for the user.
;

' ::

. . . . .

ae~ "" .~ , ~
~2~
When the exit-state does not equal QUIT either, Block 1330 next checks the exit-state for "RESET". If found, control is passed to Block 1560 of Figure 62y, discussed later, where the stack is cleared for the user/application and the top menu is invoked.

Turning now to Figure 62u, Decision Block 1340 checks the exit-state for "LINK". If not found, control is passed to Block 1430 of Figure 62v, to check for a RETURN request;
otherwise, Block 1350 handles the "LINK'~ request. First the profile area for the current TCE is built. Then Block 1360 puts this profile area on the stack fi~e. (See Blocks 270-280 discussion above).

Block 1370 starts the process of building an IETM and IETI header in the message area. As previously discussed the IETM/IETI construct is used to route data to a different transaction/system. After the IETM/IETI headers are constructed, Block 1380 scans the list of TCE's for the name of the linked to procedure found in the TV. Block 1390 then uses the TCE block to locate the profile view list, VMOH/VMOF (see TDT discussion earlier). This list i5 used to extract the profile view data fields from the TV and move them to the area following the IETM/IETI in the message buffer.

Moving now to Figure 62v, ~lock 1410 sa~es the IETI
header on the profile data base. The IET at Block 1420 then takes the current message block and finishes building the IETM and IETI header. All the character fields of the IETI
header are converted to EBCDIC if necessary and the destination tran code and the total length of the message are added to the IETM header. If the destination system is the same as the local system then the message block is queued to the tran code on the local system, otherwise the block is queued for transmission to the destination system.

.: : . : : . . ..

, : , , , , . . :

... . . .. .
., . ~ ~ :

~2~ 3.~.
Control i5 then passed to Block 30 where the next input message is received from the transaction processing system.

Block 1430 checks the exit-state for "RETURN". If it is not "RETURN", then control is passed to Block 1490 for the IET to process the next panel.

Block 1435 handles the "RETURN" request. The procedure has been invoked by a LINK request and is now returning to the invoking procedure. First the IETM and IETI pointers are constructed in the message buffer (Block 1435). Then Block 1440 restores the IETI view from the stack. The IETI
was stored on the stack by the original LINK request. Block 1450 next builds the output view area after the IETI header in the buffer, using the procedures output view list, anchored o~f the TCE in field TCEOVW. Each field referenced by the list is moved to the output area.

Block 1460 clears the view stack, whereafter Block 1470 is executed to setup the tran code in the IETM header and the target system identification for transmission. Block 1480 then marks the IETI field IETICC to indicate a return request, and Block 1490 blanks the exit-state.

Decision Block 1500 tests the current panel name in the TV for blanks and if present, then control is passed to Block 1630 of Figure 62z, to build the transaction profile view in preparation for executing the next transaction request.

If the panel name is not blank, Block 1510 uses the panel name to find the correct TPE. Control is then passed to Block 1610 o~ Figure 62z, where the panel specified is processed~

Looking now at Figure 62y, Block 1560 is executed to : .
:; . ::,.: ;: . , ,: ~ . .:

3 ~
returns the user to the top menu. Here the view stack is cleared and Block 1570 initialiæes the TV (see Block 40).
Then, according to Figure ~2z, Block 1580 clears the message area in the TV, and Block 1590 displays the top menu. First the TPE is located from the TDT field TDTAMENU. Then at Block 1600 the TCE pointer is set to the menu procedure using the TMEATCE pointer in the TME entry for the top menu.

The IET at Block 1610 builds the 3270 data stream from the panal map and the TV. The logic of this block employs T~S, but as mentioned earlier, other facilities such as IBM's IMS MFS could be used. Block 1620 then outputs the data streams to the terminal. If the destination system is locall the message is queued to the local transaction system for delivery to the specified terminal. If the system is not the local system, then a IETM/IETI header is built and the 3270 data stream is appended. ~he IETI request code is set to TERMINAL and the message is queued for transmission to the remote destination system.

Block 1630 builds the transaction profile view for the current procedure. Then, as seen in Figure 62aa Block 1640 puts this view on the stack file. Control is then passed to Block 30 where the next transaction message is received and processed.

Decision Block 1660 exits the transaction by testing to see if a SQL connect was done and, if so, Block 1665 is executed to release the SQL data base. If not, control is passed to Block 1670 which closes the documentation file i~
it is still open. Block 1680 then finishes the cleanup by closing the profile data base and freeing any allocated memory. Finally the IET returns to the transaction sub-system main module for termination of this transaction.

While a specific embodiment of the invention has been - . , . ,, ~ ,,: , . .

::, , : ~ , :: :: : :: ~ :.
" ~:

2 ~
shown and described, various modifications and alternate embodiments will occur to those skilled in the art.
Accordingly, it is intended that the invention be limited only in terms of the appended claims.

~ ` ,, ' , ~ '! ; " '

Claims (21)

1. A global transaction information table for use by a dialog flow manager when processing a transaction, comprising:
an overhead containing a plurality of pointers, as well as containing a plurality of fields for designating information about said transaction;
at least one of said plurality of pointers pointing to an entry in a transaction panel entries table;
at least one of said plurality of pointers pointing to an entry in a transaction language entries table; and at least one of said plurality of pointers pointing to an entry in a transaction procedure entries table.
2. The global transaction information table of claim 1, said plurality of fields further comprising:
an application identification field;
a release number field;
a time field for indicating generation time for this global transaction information table;
a date field for indicating generation date for this global transaction information table;
a documentation report name field;
a documentation generation name field;
a transaction panel entries field for designating the number of entries in said transaction panel entries table;
a transaction language entries field for designating the number of entries in said transaction language entries table; and a transaction procedure entries field for designating the number of entries in said transaction procedure entries table.
3. The global transaction information table of claim 1, wherein said transaction processing entries table is an array of transaction processing entries, each describing a single transaction panel, the combination of which includes all panels needed for a particular transaction.
4. The global transaction information table of claims 1, 2, or 3, wherein said at least one of said plurality of pointers pointing to an entry in a transaction panel list, further comprising:
a pointer pointing to a menu entry in said transaction panel entries table;
a pointer pointing to a help entry in said transaction panel entries table;
a pointer pointing to a glossary entry in said transaction panel entries table; and a pointer pointing to a first entry in said transaction panel entries table.
5. The global transaction information table of claims 1, 2, or 3, wherein said at least one of said plurality of pointers pointing to an entry in a transaction language entries table is pointing to a first entry in said transaction language entries table.
6. The global transaction information table of claims 1, 2, or 3, wherein said at least one of said plurality of pointers pointing to an entry in a transaction procedure entries table is pointing to a first entry in said transaction procedure entries table.
7. The global transaction information table of claim 4, wherein said at least one of said plurality of pointers pointing to an entry in a transaction language entries table is pointing to a first entry in said transaction language entries table.
8. The global transaction information table of claim 4, wherein said at least one of said plurality of pointers pointing to an entry in a transaction procedure entries table is pointing to a first entry in said transaction procedure entries table.
9. The global transaction information table of claims 1, 2, or 3, wherein said transaction processing entries table further comprises:
a plurality of pointers;
a plurality of fields for designating information about said transaction;
at least one of said plurality of transaction panel entries pointers pointing to panel map data for said transaction;
at least one of said plurality of transaction panel entries pointers pointing to a transaction menu entries table; and at least one of said plurality of transaction panel entries table pointers pointing to said transaction procedure entries table.
10. The global transaction information table of claim 9, wherein said plurality of fields of said transaction panel entries table further comprises:
a panel name field;
one of said plurality of transaction panel entries pointers pointing to an input transaction procedure entry for said transaction;
one of said plurality of transaction panel entries pointers pointing to an output transaction procedure entry for said transaction;
one of said plurality of transaction panel entry pointers pointing to a help table;
a transaction menu entries field for designating the number of transaction menu entries for said single transaction panel, if it is a menu panel; and one of said plurality of transaction panel entries pointers pointing to a first entry in said transaction menu entries table for said panel, if it is a menu panel.
11. The global transaction information table of claims 1, 2, 3, 4, or 9, wherein said transaction procedure entries table is an array of transaction procedure entries each describing a single application-supplied procedure, the combination of which includes all procedures required for the processing of an application.
12. The global transaction information table of claim 11, wherein said transaction procedure entries table further comprises:
a plurality of fields;
at least one of said plurality of fields containing a pointer pointing to a view map object header;
at least one of said plurality of fields containing a character describing a data base type for said procedure entry; and at least one of said plurality of fields containing a pointer pointing to an entry location of said application-supplied procedure.
13. The global transaction information table of claim 12, wherein said plurality of fields for said transaction procedure entries table further comprises:
a pointer to an input view within said view map object header;
a pointer to an output view within said view map object header; and a pointer to a profile view within said view map object header.
14. The global transaction information table of claim 12, wherein said view map object header includes a plurality of fields containing static information about each view necessary to complete a panel.
15. The global transaction information table of claim 13, wherein said plurality of fields further comprises:
an application name field;
a view name field;
a time field designating compile time of a particular view;
a date field designating compile date of said particular view;
a version field;
a view format field;
a view map object field array field designating how many view map object field entries are associated with said particular view; and a pointer to said particular view' view map object field array.
16. The global transaction information table of claim 1, wherein said transaction language entries table is an array of transaction language entries each describing a language in which documentation is available.
17. The global transaction information table of claim 16, wherein said array of transaction language entries further comprises:
a plurality of fields;
one of said plurality of fields is a language name field;
one of said plurality of fields is a documentation report name field; and one of said plurality of fields is a documentation generation name field.
18. The global transaction information table of claim 9, wherein said transaction menu entries table is an array of transaction menu entries each describing a single menu entry.
19. The global transaction information table of claim 18, wherein said array of transaction menu entries further comprises:
a plurality of fields;
one of said plurality of fields contains a selection code for said single menu entry;
one of said plurality of fields contains a pointer to a transaction panel entry to be used for said selection code;
one of said plurality of fields contains a pointer to a transaction procedure entry to be used to said selection code; and one of said plurality of fields contains a description of sand single menu entry.
20. The global transaction information table of claim 15, wherein said view map object field array further comprising:
a displacement of a data element in a transaction view work area;
a length of said data element;
an indicator representing the number of occurence for said data element; and a data element type indicator.
21. The global transaction information table of claim 20, wherein said data element type indicator indicates whether the data element is binary, charcter, signed, unsigned, small, short, long, hyper, unsigned small, unsigned short, unsigned long, unsigned hyper, single or double.
CA002025131A 1989-09-28 1990-09-12 Portable and dynamic distributed applications architecture Abandoned CA2025131A1 (en)

Applications Claiming Priority (2)

Application Number Priority Date Filing Date Title
US41422189A 1989-09-28 1989-09-28
US414,221 1989-09-28

Publications (1)

Publication Number Publication Date
CA2025131A1 true CA2025131A1 (en) 1991-03-29

Family

ID=23640496

Family Applications (5)

Application Number Title Priority Date Filing Date
CA002025160A Abandoned CA2025160A1 (en) 1989-09-28 1990-09-12 Portable and dynamic distributed applications architecture
CA002025170A Abandoned CA2025170A1 (en) 1989-09-28 1990-09-12 Portable and dynamic distributed applications architecture
CA002025131A Abandoned CA2025131A1 (en) 1989-09-28 1990-09-12 Portable and dynamic distributed applications architecture
CA002025120A Abandoned CA2025120A1 (en) 1989-09-28 1990-09-12 Portable and dynamic distributed application architecture
CA002025142A Abandoned CA2025142A1 (en) 1989-09-28 1990-09-12 Portable and dynamic distributed applications architecture

Family Applications Before (2)

Application Number Title Priority Date Filing Date
CA002025160A Abandoned CA2025160A1 (en) 1989-09-28 1990-09-12 Portable and dynamic distributed applications architecture
CA002025170A Abandoned CA2025170A1 (en) 1989-09-28 1990-09-12 Portable and dynamic distributed applications architecture

Family Applications After (2)

Application Number Title Priority Date Filing Date
CA002025120A Abandoned CA2025120A1 (en) 1989-09-28 1990-09-12 Portable and dynamic distributed application architecture
CA002025142A Abandoned CA2025142A1 (en) 1989-09-28 1990-09-12 Portable and dynamic distributed applications architecture

Country Status (5)

Country Link
US (7) US5428782A (en)
EP (5) EP0420461A3 (en)
JP (5) JPH041842A (en)
AU (5) AU648515B2 (en)
CA (5) CA2025160A1 (en)

Families Citing this family (306)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
EP0458495A3 (en) * 1990-05-21 1993-04-14 Texas Instruments Incorporated Apparatus and method for managing versions and configurations of persistent and transient objects
GB2272085A (en) * 1992-10-30 1994-05-04 Tao Systems Ltd Data processing system and operating system.
JPH0827769B2 (en) * 1992-10-30 1996-03-21 インターナショナル・ビジネス・マシーンズ・コーポレイション Communication interface generation system and method
US6182106B1 (en) * 1993-08-30 2001-01-30 International Business Machines Corporation Method and system for providing a common hardware system console interface in data processing systems
US5583761A (en) * 1993-10-13 1996-12-10 Kt International, Inc. Method for automatic displaying program presentations in different languages
SE515344C2 (en) * 1994-02-08 2001-07-16 Ericsson Telefon Ab L M Distributed database system
US5781743A (en) * 1994-02-18 1998-07-14 Hitachi, Ltd. System and method for distributed data processing using different server system specifications
US6330582B1 (en) * 1994-03-21 2001-12-11 International Business Machines Corporation Apparatus and method enabling a client to control transaction message traffic between server and client processes
GB9407971D0 (en) * 1994-04-21 1994-06-15 British Telecomm Messaging system
US5530961A (en) * 1994-04-21 1996-06-25 Janay; Gad Terminal emulator enhancer with local configurability
US6243765B1 (en) * 1994-04-28 2001-06-05 Nortel Networks Limited Method and apparatus for data communication
US6418484B1 (en) * 1994-06-17 2002-07-09 Sun Microsystems, Inc. Method of remotely executing computer processes
US5564017A (en) * 1994-06-30 1996-10-08 International Business Machines Corporation Procedure for safely terminating network programs during network logoff
US5550970A (en) * 1994-08-31 1996-08-27 International Business Machines Corporation Method and system for allocating resources
US5764949A (en) * 1994-09-29 1998-06-09 International Business Machines Corporation Query pass through in a heterogeneous, distributed database environment
US5619639A (en) * 1994-10-04 1997-04-08 Mast; Michael B. Method and apparatus for associating an image display area with an application display area
US5548704A (en) * 1994-11-08 1996-08-20 The Consulting Team, Inc. Method for windowing using mainframe hosted CICS
JP3853387B2 (en) * 1994-11-15 2006-12-06 富士通株式会社 Data access right management method in data independent computer system
US5689645A (en) * 1994-12-01 1997-11-18 Hewlett-Packard Co. Persistence specification system and method for producing persistent and transient submaps in a management station for a data communication network
CA2168087A1 (en) * 1995-02-13 1996-08-14 James S. Coman Operating system based remote communication system
US6249822B1 (en) * 1995-04-24 2001-06-19 Microsoft Corporation Remote procedure call method
US6044382A (en) * 1995-05-19 2000-03-28 Cyber Fone Technologies, Inc. Data transaction assembly server
US20070299808A1 (en) * 1995-05-19 2007-12-27 Cyberfone Technologies, Inc. Telephone/Transaction Entry Device and System for Entering Transaction Data into Databases
US20050119992A1 (en) 1995-05-19 2005-06-02 Martino Rocco L. Telephone/transaction entry device and system for entering transaction data into databases
US7334024B2 (en) 1995-05-19 2008-02-19 Cyberfone Technologies, Inc System for transmission of voice and data over the same communications line
US5805676A (en) 1995-05-19 1998-09-08 Pcpi Phone, Inc. Telephone/transaction entry device and system for entering transaction data into databases
US6973477B1 (en) 1995-05-19 2005-12-06 Cyberfone Technologies, Inc. System for securely communicating amongst client computer systems
EP0829046B1 (en) * 1995-05-29 1999-09-29 Siemens Aktiengesellschaft Method and system for setting up user programs as well as user computer in a computer net
US5678044A (en) * 1995-06-02 1997-10-14 Electronic Data Systems Corporation System and method for improved rehosting of software systems
US7337440B1 (en) * 1997-01-07 2008-02-26 International Business Machines Corporation Methodology for generating accessing functions for programmed execution of panel-driven business applications
WO1997007453A1 (en) * 1995-08-16 1997-02-27 International Business Machines Corporation Methodology for generating accessing functions for programmed execution of panel-driven business applications
US5721914A (en) * 1995-09-14 1998-02-24 Mci Corporation System and method for hierarchical data distribution
US5860007A (en) * 1995-09-29 1999-01-12 Siemens Corporate Research, Inc. Automated software modification facilitator
US5799305A (en) * 1995-11-02 1998-08-25 Informix Software, Inc. Method of commitment in a distributed database transaction
US6111576A (en) * 1995-11-06 2000-08-29 International Business Machines Corporation Method and apparatus for providing selected menu functions as an attachment menu bar on graphic user interface systems
US6714945B1 (en) * 1995-11-17 2004-03-30 Sabre Inc. System, method, and article of manufacture for propagating transaction processing facility based data and for providing the propagated data to a variety of clients
US6615251B1 (en) * 1995-12-11 2003-09-02 John R. Klug Method for providing node targeted content in an addressable network
US6591245B1 (en) * 1996-02-02 2003-07-08 John R. Klug Media content notification via communications network
US5790785A (en) 1995-12-11 1998-08-04 Customer Communications Group, Inc. World Wide Web registration information processing system
US6023694A (en) * 1996-01-02 2000-02-08 Timeline, Inc. Data retrieval method and apparatus with multiple source capability
US5802511A (en) * 1996-01-02 1998-09-01 Timeline, Inc. Data retrieval method and apparatus with multiple source capability
US6631382B1 (en) 1996-01-02 2003-10-07 Timeline, Inc. Data retrieval method and apparatus with multiple source capability
US6625617B2 (en) 1996-01-02 2003-09-23 Timeline, Inc. Modularized data retrieval method and apparatus with multiple source capability
US20030195848A1 (en) 1996-06-05 2003-10-16 David Felger Method of billing a purchase made over a computer network
US7555458B1 (en) 1996-06-05 2009-06-30 Fraud Control System.Com Corporation Method of billing a purchase made over a computer network
US8229844B2 (en) 1996-06-05 2012-07-24 Fraud Control Systems.Com Corporation Method of billing a purchase made over a computer network
US6175854B1 (en) 1996-06-11 2001-01-16 Ameritech Services, Inc. Computer system architecture and method for multi-user, real-time applications
JP4533974B2 (en) * 1996-08-01 2010-09-01 康 清木 Heterogeneous database integration system
US5805158A (en) * 1996-08-22 1998-09-08 International Business Machines Corporation Copying predicted input between computer systems
US6038587A (en) * 1996-09-03 2000-03-14 Insession, Inc. System, method and article of manufacture for universal transaction processing over multiple transaction processing systems
US6289393B1 (en) * 1996-09-03 2001-09-11 Insession Inc. System, method and article of manufacture for transaction processing and monitoring of independent interacts
US5857100A (en) * 1996-09-03 1999-01-05 Insession Inc. System, method and article of manufacture for extending externalization for universal transaction processing
US5854750A (en) * 1996-09-03 1998-12-29 Insession, Inc. System and method for processing transactions in an environment containing a number of object oriented applications
US6151637A (en) * 1996-09-04 2000-11-21 Insession, Inc. System, method and article of manufacture for dynamic addition of new components to a universal transaction processing system
US5911071A (en) * 1996-09-13 1999-06-08 Sun Microsystems, Inc. Persistent programming system and method for deploying self-containing executable applications
US6442618B1 (en) * 1996-09-23 2002-08-27 Insession, Inc. System, method and article of manufacture for universal transaction processing
MY126363A (en) * 1996-10-25 2006-09-29 Gemalto Sa Using a high level programming language with a microcontroller
US8392285B2 (en) 1996-11-12 2013-03-05 Syncada Llc Multi-supplier transaction and payment programmed processing approach with at least one supplier
US20070055582A1 (en) * 1996-11-12 2007-03-08 Hahn-Carlson Dean W Transaction processing with core and distributor processor implementations
US20080172314A1 (en) 1996-11-12 2008-07-17 Hahn-Carlson Dean W Financial institution-based transaction processing system and approach
US8396811B1 (en) 1999-02-26 2013-03-12 Syncada Llc Validation approach for auditing a vendor-based transaction
US7627499B2 (en) * 1996-11-12 2009-12-01 Syncada Llc Automated transaction processing system and approach
US5752249A (en) * 1996-11-14 1998-05-12 Macon, Jr.; Charles E. System and method for instantiating a sharable, presistent parameterized collection class and real time process control system embodying the same
JP2000505224A (en) * 1996-11-27 2000-04-25 ソニー オイローパ ビーブイ Data communication method using typed continuation
CA2191640A1 (en) * 1996-11-29 1998-05-29 Kenn S. Jennyc User-interactive system and method for integrating applications
US5913195A (en) * 1996-12-27 1999-06-15 Intervoice Limited Partnership System and method for developing VRU voice dialogue
US6029171A (en) 1997-02-10 2000-02-22 Actioneer, Inc. Method and apparatus for group action processing between users of a collaboration system
US5884312A (en) * 1997-02-28 1999-03-16 Electronic Data Systems Corporation System and method for securely accessing information from disparate data sources through a network
US5950009A (en) * 1997-03-10 1999-09-07 International Business Machines Coporation Method and apparatus for profile-based reordering of program portions in a computer program
US6029004A (en) * 1997-03-17 2000-02-22 International Business Machines Corporation Method and apparatus for modular reordering of portions of a computer program based on profile data
US6026234A (en) * 1997-03-19 2000-02-15 International Business Machines Corporation Method and apparatus for profiling indirect procedure calls in a computer program
US5960198A (en) * 1997-03-19 1999-09-28 International Business Machines Corporation Software profiler with runtime control to enable and disable instrumented executable
CA2201254C (en) * 1997-03-27 2002-08-20 John Wright Stephenson A system for automated interface generation for computer programs operating in different environments
US5946677A (en) * 1997-04-14 1999-08-31 Electronic Data Systems Corporation System and method for locating and deleting computer files stored on a mass storage device
US6292827B1 (en) * 1997-06-20 2001-09-18 Shore Technologies (1999) Inc. Information transfer systems and method with dynamic distribution of data, control and management of information
US7441254B1 (en) 1997-07-09 2008-10-21 International Business Machines Corporation Simulation of memory-mapped I/O
US5953719A (en) * 1997-09-15 1999-09-14 International Business Machines Corporation Heterogeneous database system with dynamic commit procedure control
US5926177A (en) * 1997-10-17 1999-07-20 International Business Machines Corporation Providing multiple views in a model-view-controller architecture
US5996025A (en) * 1997-10-31 1999-11-30 International Business Machines Corp. Network transparent access framework for multimedia serving
US5973690A (en) * 1997-11-07 1999-10-26 Emc Corporation Front end/back end device visualization and manipulation
US5964828A (en) * 1997-11-13 1999-10-12 Electronic Data System Corporation Method and system for maintaining the integrity of objects
US6085199A (en) * 1997-11-24 2000-07-04 International Business Machines Corporation Method for distributing a file in a plurality of different file formats
US6055547A (en) * 1997-12-30 2000-04-25 Unisys Corporation Shared file allocation and release
US6148296A (en) * 1998-02-04 2000-11-14 Microsoft, Inc. Automatic generation of database queries
US6167401A (en) * 1998-02-09 2000-12-26 Ciena Corporation Manufacturing control network having a relational database
US7028312B1 (en) * 1998-03-23 2006-04-11 Webmethods XML remote procedure call (XML-RPC)
JPH11282779A (en) * 1998-03-27 1999-10-15 Matsushita Electric Ind Co Ltd File distribution system
US6260070B1 (en) 1998-06-30 2001-07-10 Dhaval N. Shah System and method for determining a preferred mirrored service in a network by evaluating a border gateway protocol
US6446121B1 (en) 1998-05-26 2002-09-03 Cisco Technology, Inc. System and method for measuring round trip times in a network using a TCP packet
US6741994B1 (en) * 1998-07-27 2004-05-25 Hewlett-Packard Development Company, L.P. Method and automatic organization of data
US6341288B1 (en) * 1998-07-29 2002-01-22 Sybase, Inc. Database system with methodology for accessing a database from portable devices
US8326361B2 (en) 1998-10-01 2012-12-04 Lupine Investments Llc Phone to phone data exchange
US6374259B1 (en) * 1998-10-01 2002-04-16 Onepin, Llc Method and apparatus for storing and retreiving business contact information in computer system
US7970792B2 (en) * 1998-10-01 2011-06-28 Onepin, Inc. Phone to phone data exchange
US7349907B2 (en) * 1998-10-01 2008-03-25 Onepin, Inc. Method and apparatus for storing and retrieving business contact information in a computer system
US7836011B2 (en) * 1998-10-01 2010-11-16 Onepin, Inc. Phone to phone data exchange
US20080015998A1 (en) * 1998-10-01 2008-01-17 Feyzi Celik Method and Apparatus for Storing and Retrieving Business Contact Information in a Computer System
US6324681B1 (en) * 1998-10-01 2001-11-27 Unisys Corporation Automated development system for developing applications that interface with both distributed component object model (DCOM) and enterprise server environments
US7509349B2 (en) 1998-10-01 2009-03-24 Onepin, Inc. Method and apparatus for storing and retrieving business contact information in a computer system
US7813725B2 (en) * 1998-10-01 2010-10-12 Onepin, Llc Wireless data exchange
US6298381B1 (en) 1998-10-20 2001-10-02 Cisco Technology, Inc. System and method for information retrieval regarding services
US6366964B1 (en) 1998-10-22 2002-04-02 Sony Corporation Method of and apparatus for dynamically enumerating objects representing devices within an IEEE 1394 serial bus networking
US6446142B1 (en) 1998-10-22 2002-09-03 Sony Corporation Method of and apparatus for dynamically binding subobjects into objects to represent functions and characteristics of a device within an IEEE 1394 serial bus network
US6282703B1 (en) 1998-10-29 2001-08-28 International Business Machines Corporation Statically linking an application process with a wrapper library
KR100299623B1 (en) * 1998-12-18 2001-09-06 윤덕용 How to Debug Integrated Client and Server Programs
US6542880B2 (en) * 1998-12-22 2003-04-01 Indeliq, Inc. System, method and article of manufacture for a goal based system utilizing a table based architecture
JP3645723B2 (en) * 1998-12-25 2005-05-11 日本電気株式会社 Exchange service development support system with automatic replacement function of edited contents
US6724724B1 (en) 1999-01-21 2004-04-20 Cisco Technology, Inc. System and method for resolving an electronic address
US7296037B1 (en) * 1999-01-21 2007-11-13 Microsoft Corporation Database item versioning
US6671704B1 (en) * 1999-03-11 2003-12-30 Hewlett-Packard Development Company, L.P. Method and apparatus for handling failures of resource managers in a clustered environment
US6470342B1 (en) 1999-03-12 2002-10-22 Compaq Computer Corporation Process of maintaining a distributed map of transaction identifiers and using hashing to access these maps
US6295548B1 (en) * 1999-03-12 2001-09-25 Compaq Computer Corporation Detection of an imported transaction for finding the global transaction identifier
US6411981B1 (en) 1999-03-12 2002-06-25 Compaq Computer Corporation Method and apparatus for conducting a transaction between homogeneous and/or heterogeneous transaction processing systems using asynchronous pull of a transaction transfer
US6269480B1 (en) * 1999-03-29 2001-07-31 International Business Machines Corporation Cross platform installer-with the ability to create platform independent variables of specific operating system variables from a scripting language
AU3993500A (en) * 1999-03-31 2000-10-16 Telefonaktiebolaget Lm Ericsson (Publ) Distribution of service execution environments with respect to a centralized service supplier environment
US6795860B1 (en) 1999-04-05 2004-09-21 Cisco Technology, Inc. System and method for selecting a service with dynamically changing information
US6243737B1 (en) * 1999-04-09 2001-06-05 Translink Software, Inc. Method and apparatus for providing direct transaction access to information residing on a host system
US6370683B1 (en) * 1999-05-07 2002-04-09 Arnold Sobers Computer software for generating flowchart images of a source program
TW501046B (en) * 1999-06-11 2002-09-01 Ind Tech Res Inst A portable dialogue manager
US6988138B1 (en) 1999-06-30 2006-01-17 Blackboard Inc. Internet-based education support system and methods
US7908602B2 (en) 1999-06-30 2011-03-15 Blackboard Inc. Internet-based education support system, method and medium providing security attributes in modular, extensible components
US6389385B1 (en) 1999-07-02 2002-05-14 International Business Machines Corporation System and method for translating source code
US7152228B2 (en) * 1999-07-08 2006-12-19 Science Applications International Corporation Automatically generated objects within extensible object frameworks and links to enterprise resources
US6578054B1 (en) * 1999-10-04 2003-06-10 Microsoft Corporation Method and system for supporting off-line mode of operation and synchronization using resource state information
WO2001025926A1 (en) * 1999-10-05 2001-04-12 Ejasent Inc. Virtual network environment
JP3739615B2 (en) * 1999-11-30 2006-01-25 三菱電機株式会社 In-vehicle information processing apparatus and recording medium
US6516310B2 (en) 1999-12-07 2003-02-04 Sybase, Inc. System and methodology for join enumeration in a memory-constrained environment
AU5252200A (en) * 1999-12-20 2001-07-03 Luckynet Corporation Limited Method for putting job hunting/job offers to auction over computer network and storage medium for storing the same therein
US6594661B1 (en) 1999-12-27 2003-07-15 International Business Machines Corporation Method and system for controlling access to a source application
US6457016B1 (en) * 2000-01-04 2002-09-24 International Business Machines Corporation Timestamp commit
US6986128B2 (en) * 2000-01-07 2006-01-10 Sony Computer Entertainment Inc. Multiple stage program recompiler and method
US6658658B1 (en) * 2000-02-17 2003-12-02 International Business Machines Corporation Implicit forwarding and resolving of a reference made by an importing module to an exporting module for a specified export
BR0109145A (en) * 2000-03-10 2003-04-22 Siemens Dematic Electronics As Electronic assembly engineering system that employs naming and manipulation functions for user-defined data structures in a data system using a transaction service.
US8397223B2 (en) * 2000-03-17 2013-03-12 Gutenberg Printing Llc Web application generator
US20010047387A1 (en) * 2000-03-27 2001-11-29 Exoplex, Inc. Systems and methods for providing distributed cross-enterprise portals
US6687735B1 (en) 2000-05-30 2004-02-03 Tranceive Technologies, Inc. Method and apparatus for balancing distributed applications
US6961934B2 (en) * 2000-05-08 2005-11-01 Microtune (San Diego), Inc. Portable thread environment
US7657887B2 (en) * 2000-05-17 2010-02-02 Interwoven, Inc. System for transactionally deploying content across multiple machines
WO2001088697A2 (en) * 2000-05-17 2001-11-22 Adc Telecommunications Israel Ltd. Methods for modularizing network software
JP3619958B2 (en) * 2000-06-13 2005-02-16 富士通株式会社 Crisis management system and computer
US7219304B1 (en) * 2000-06-19 2007-05-15 International Business Machines Corporation System and method for developing and administering web applications and services from a workflow, enterprise, and mail-enabled web application server and platform
US6742026B1 (en) * 2000-06-19 2004-05-25 International Business Machines Corporation System and method for providing a distributable runtime
US20030121027A1 (en) * 2000-06-23 2003-06-26 Hines Kenneth J. Behavioral abstractions for debugging coordination-centric software designs
US20030005407A1 (en) * 2000-06-23 2003-01-02 Hines Kenneth J. System and method for coordination-centric design of software systems
US7162450B2 (en) * 2000-06-30 2007-01-09 Ponzio Jr Frank J Business method for determining quality and integrity of data content
US6898783B1 (en) * 2000-08-03 2005-05-24 International Business Machines Corporation Object oriented based methodology for modeling business functionality for enabling implementation in a web based environment
US7870107B2 (en) * 2000-08-04 2011-01-11 Agile Software Corporation Data management system and method for propagating product manufacturing information to disparate information systems
WO2002013068A1 (en) * 2000-08-04 2002-02-14 Carr Scott Software Incorporated Automatic transaction management
US6684388B1 (en) 2000-08-22 2004-01-27 International Business Machines Corporation Method for generating platform independent, language specific computer code
US7171455B1 (en) 2000-08-22 2007-01-30 International Business Machines Corporation Object oriented based, business class methodology for generating quasi-static web pages at periodic intervals
US6853994B1 (en) * 2000-08-30 2005-02-08 International Business Machines Corporation Object oriented based, business class methodology for performing data metric analysis
US7596784B2 (en) 2000-09-12 2009-09-29 Symantec Operating Corporation Method system and apparatus for providing pay-per-use distributed computing resources
WO2002029594A1 (en) * 2000-10-03 2002-04-11 Attachmate Corporation System and method for communication with host internal area access
AU2002232594A1 (en) * 2000-10-30 2002-05-15 Tririga, Inc. Item specification object management system
US6910045B2 (en) 2000-11-01 2005-06-21 Collegenet, Inc. Automatic data transmission in response to content of electronic forms satisfying criteria
US6886160B1 (en) * 2000-11-29 2005-04-26 Hyung Sup Lee Distribution of mainframe data in the PC environment
US7072936B2 (en) * 2000-12-13 2006-07-04 Riskspan, Inc. System and method for aggregating data having data and application dependencies
US6892377B1 (en) * 2000-12-21 2005-05-10 Vignette Corporation Method and system for platform-independent file system interaction
US7111077B1 (en) * 2000-12-22 2006-09-19 Unisys Corporation Method and apparatus for passing service requests and data from web based workstations directly to online transaction processing (OLTP) server systems
US20060149556A1 (en) * 2001-01-03 2006-07-06 Sridhar Krishnamurthy Sequential-data correlation at real-time on multiple media and multiple data types
WO2002073402A1 (en) * 2001-01-05 2002-09-19 Consystant Design Technologies, Inc. Coordination synthesis for software systems
US7213231B1 (en) * 2001-01-11 2007-05-01 Cisco Technology, Inc. Cross-spectrum application model for dynamic computing environments in software lifecycle
US6744451B1 (en) * 2001-01-25 2004-06-01 Handspring, Inc. Method and apparatus for aliased item selection from a list of items
US6848103B2 (en) * 2001-02-16 2005-01-25 Telefonaktiebolaget Lm Ericsson Method and apparatus for processing data in a multi-processor environment
US7734715B2 (en) * 2001-03-01 2010-06-08 Ricoh Company, Ltd. System, computer program product and method for managing documents
WO2002086768A2 (en) * 2001-03-08 2002-10-31 Tririga, Inc. Data storage and access system employing clustering of servers
US6978442B2 (en) * 2001-05-03 2005-12-20 International Business Machines Corporation Auditing data using observable and observer objects
US6944594B2 (en) * 2001-05-30 2005-09-13 Bellsouth Intellectual Property Corporation Multi-context conversational environment system and method
US20020184611A1 (en) * 2001-05-30 2002-12-05 Palm, Inc. Design system and method having improved display of code
WO2002103536A1 (en) * 2001-06-19 2002-12-27 Teruten Inc. Security system for securing exchange and execution of digital data
US6839896B2 (en) * 2001-06-29 2005-01-04 International Business Machines Corporation System and method for providing dialog management and arbitration in a multi-modal environment
US20030054806A1 (en) * 2001-08-15 2003-03-20 Raymond Ho System and method for defining, creating and deploying wireless applications
US7920682B2 (en) 2001-08-21 2011-04-05 Byrne William J Dynamic interactive voice interface
US20040006745A1 (en) * 2001-08-31 2004-01-08 Van Helden Wico Methods, apparatuses, system, and articles for associating metadata with datastream
US20040088448A1 (en) * 2001-10-16 2004-05-06 Userspace Corporation Embedded system and method for controlling, monitoring of instruments or devices and processing their data via control and data protocols that can be combined or interchanged
US7725490B2 (en) * 2001-11-16 2010-05-25 Crucian Global Services, Inc. Collaborative file access management system
US6901417B2 (en) * 2002-01-11 2005-05-31 International Business Machines Corporation Method, system, and program for updating records in a database when applications have different version levels
AU2002259247A1 (en) * 2002-02-25 2003-09-09 Predictive Media Corporation Compact implementations for limited-resource platforms
US20030169289A1 (en) * 2002-03-08 2003-09-11 Holt Duane Anthony Dynamic software control interface and method
US7133894B2 (en) * 2002-03-12 2006-11-07 International Business Machines Corporation Method, apparatus, and program for synchronous remote builds
EP1388786A1 (en) * 2002-03-15 2004-02-11 Alcatel User interface for interaction with a computer
JP2003308277A (en) * 2002-04-17 2003-10-31 Sony Corp Terminal device, data transmitting device, and system and method for transmitting and receiving data
US20030233437A1 (en) * 2002-04-24 2003-12-18 Hiroshi Kitada Browser, method, and computer program product for managing documents
CA2391733A1 (en) * 2002-06-26 2003-12-26 Ibm Canada Limited-Ibm Canada Limitee Framework to access a remote system from an integrated development environment
CA2391756A1 (en) * 2002-06-26 2003-12-26 Ibm Canada Limited-Ibm Canada Limitee Accessing a remote iseries or as/400 computer system from the eclipse integrated development environment
JP2004062781A (en) * 2002-07-31 2004-02-26 Fujitsu Ltd Information managing device
US7234132B2 (en) * 2002-08-29 2007-06-19 International Business Machines Corporation Application integration model for dynamic software component assembly within an application at runtime
GB0230169D0 (en) * 2002-12-24 2003-02-05 British Telecomm Method for co-ordinating networked group members and devices performing the method
US8225290B2 (en) * 2003-02-11 2012-07-17 V. i. Laboratories, Inc. Systems and methods for regulating execution of computer software
US20040237091A1 (en) * 2003-05-20 2004-11-25 Ballantyne Alando M. Method and system for program conversion
US20040261055A1 (en) * 2003-06-20 2004-12-23 Bertelrud P. Anders I. Predictively processing tasks for building software
US7363313B2 (en) * 2003-08-07 2008-04-22 International Business Machines Corporation Method, system, and program product for rebasing an application
EP1664992A4 (en) 2003-08-15 2010-05-19 Blackboard Inc Content system and associated methods
US7526489B2 (en) * 2003-11-18 2009-04-28 International Business Machines Corporation Methods to integrate user-defined operations into a database
US7822992B2 (en) * 2004-04-07 2010-10-26 Microsoft Corporation In-place content substitution via code-invoking link
US7890744B2 (en) * 2004-04-07 2011-02-15 Microsoft Corporation Activating content based on state
EP1591916B1 (en) * 2004-04-26 2013-11-06 Sap Ag Method, computer program and device for deleting data sets contained in a table system
DE102004023634B4 (en) * 2004-05-10 2007-09-27 Siemens Ag Method for checking the completeness and consistency of an information library
US7765539B1 (en) 2004-05-19 2010-07-27 Nintendo Co., Ltd. System and method for trans-compiling video games
US8762238B2 (en) 2004-06-09 2014-06-24 Syncada Llc Recurring transaction processing system and approach
AU2005255456B2 (en) 2004-06-09 2007-09-13 Syncada Llc Order-resource fulfillment and management system and approach
EP1782259A4 (en) 2004-06-09 2009-04-22 Us Bancorp Licensing Inc Distributor-based transaction processing arrangement and approach
US7925551B2 (en) * 2004-06-09 2011-04-12 Syncada Llc Automated transaction processing system and approach
US7574386B2 (en) 2004-06-09 2009-08-11 U.S. Bank National Association Transaction accounting auditing approach and system therefor
US7711721B2 (en) * 2004-09-01 2010-05-04 International Business Machines Corporation Apparatus, system, and method for suspending a request during file server serialization reinitialization
US7490088B2 (en) * 2004-09-01 2009-02-10 International Business Machines Corporation Apparatus, system, and method for preserving connection/position data integrity during file server serialization reinitialization
US7627578B2 (en) 2004-09-01 2009-12-01 International Business Machines Corporation Apparatus, system, and method for file system serialization reinitialization
US7716305B2 (en) * 2004-09-01 2010-05-11 International Business Machines Corporation Apparatus, system, and method for preserving cluster level serialization during file server serialization reinitialization
US8020141B2 (en) 2004-12-06 2011-09-13 Microsoft Corporation Operating-system process construction
US7571430B2 (en) * 2005-01-24 2009-08-04 Lsi Logic Corporation Adaptive dispatch table based on templates
US7676797B2 (en) * 2005-01-31 2010-03-09 Computer Associates Think, Inc. System and method for managing long names in an application programming interface
US8862852B2 (en) * 2005-02-03 2014-10-14 International Business Machines Corporation Apparatus and method to selectively provide information to one or more computing devices
US7437080B2 (en) * 2005-02-03 2008-10-14 Stratalight Communications, Inc. Optical transmission system having optimized filter wavelength offsets
US7930182B2 (en) * 2005-03-15 2011-04-19 Nuance Communications, Inc. Computer-implemented tool for creation of speech application code and associated functional specification
US20060230286A1 (en) * 2005-03-30 2006-10-12 Hiroshi Kitada System and method for authenticating a user of an image processing system
US7533155B2 (en) * 2005-03-30 2009-05-12 Ricoh Company, Ltd. System and method for managing documents with multiple network applications
US7821660B2 (en) * 2005-03-30 2010-10-26 Ricoh Company, Ltd. System and method for compensating for resource unavailability in an image processing system
US7970671B2 (en) * 2005-04-12 2011-06-28 Syncada Llc Automated transaction processing system and approach with currency conversion
US7293022B2 (en) 2005-04-14 2007-11-06 International Business Machines Corporation List update employing neutral sort keys
US8117597B2 (en) 2005-05-16 2012-02-14 Shia So-Ming Daniel Method and system for specifying and developing application systems with dynamic behavior
US8239757B2 (en) * 2005-06-16 2012-08-07 Zoot Enterprises, Inc. System and method for creating and modifying test data files
US8849968B2 (en) * 2005-06-20 2014-09-30 Microsoft Corporation Secure and stable hosting of third-party extensions to web services
US20070112579A1 (en) * 2005-09-01 2007-05-17 Ads Alliance Data Systems, Inc. Market management system
US8074231B2 (en) * 2005-10-26 2011-12-06 Microsoft Corporation Configuration of isolated extensions and device drivers
US8108851B2 (en) * 2006-01-30 2012-01-31 International Business Machines Corporation External registration for function configuration within a client platform application
US7797273B2 (en) * 2006-03-27 2010-09-14 Emoze Ltd. System and a method for reliable symmetric data synchronization
US7797670B2 (en) * 2006-04-14 2010-09-14 Apple Inc. Mirrored file system
US8200844B2 (en) 2006-04-17 2012-06-12 Infoprint Solutions Company, Llc Using a resource context to access resources and source data for a transform
US20070250499A1 (en) * 2006-04-21 2007-10-25 Simon Widdowson Method and system for finding data objects within large data-object libraries
US9405521B2 (en) * 2006-06-29 2016-08-02 Microsoft Technology Licensing, Llc Mapping of virtualized setup-free applications for a computing system
US8032898B2 (en) * 2006-06-30 2011-10-04 Microsoft Corporation Kernel interface with categorized kernel objects
US8064956B2 (en) * 2006-08-02 2011-11-22 Onepin, Inc. Event sharing
US7831637B2 (en) * 2006-08-29 2010-11-09 Sap Ag System on the fly
US20080082517A1 (en) * 2006-08-29 2008-04-03 Sap Ag Change assistant
US8065661B2 (en) * 2006-08-29 2011-11-22 Sap Ag Test engine
US8131644B2 (en) * 2006-08-29 2012-03-06 Sap Ag Formular update
US20080071555A1 (en) * 2006-08-29 2008-03-20 Juergen Sattler Application solution proposal engine
US20080059630A1 (en) * 2006-08-29 2008-03-06 Juergen Sattler Assistant
US7908589B2 (en) * 2006-08-29 2011-03-15 Sap Ag Deployment
US20080127082A1 (en) * 2006-08-29 2008-05-29 Miho Emil Birimisa System and method for requirements-based application configuration
US7912800B2 (en) * 2006-08-29 2011-03-22 Sap Ag Deduction engine to determine what configuration management scoping questions to ask a user based on responses to one or more previous questions
US7827528B2 (en) 2006-08-29 2010-11-02 Sap Ag Delta layering
US7823124B2 (en) * 2006-08-29 2010-10-26 Sap Ag Transformation layer
US7831568B2 (en) 2006-08-29 2010-11-09 Sap Ag Data migration
US8712884B2 (en) 2006-10-06 2014-04-29 Syncada Llc Transaction finance processing system and approach
US8352538B2 (en) * 2006-10-16 2013-01-08 Siemens Medical Solutions Usa, Inc. Transaction monitoring system
KR100853933B1 (en) * 2006-10-17 2008-08-25 삼성에스디에스 주식회사 Migration apparatus which convert application program of mainframe system into application program of open system and method for thereof
US20080090597A1 (en) * 2006-10-17 2008-04-17 Feyzi Celik Short message formatting for information exchange
US7447510B2 (en) * 2006-10-22 2008-11-04 Onepin, Inc. Short message service network plug-in
US8275750B2 (en) * 2006-11-08 2012-09-25 International Business Machines Corporation Method to efficiently use the disk space while unarchiving
US7792661B1 (en) * 2007-02-14 2010-09-07 Symantec Corporation Realtime feature adaptation responsive to dynamically gathered usability information
US8789063B2 (en) * 2007-03-30 2014-07-22 Microsoft Corporation Master and subordinate operating system kernels for heterogeneous multiprocessor systems
US20080244507A1 (en) * 2007-03-30 2008-10-02 Microsoft Corporation Homogeneous Programming For Heterogeneous Multiprocessor Systems
US8761744B2 (en) * 2007-04-20 2014-06-24 Lupine Investments Llc Mobile virtual communication invitations
US8335813B2 (en) 2007-05-01 2012-12-18 Illinois Institute Of Technology Systems, methods, and protocols for process migration and group membership management
US8806459B2 (en) * 2007-09-28 2014-08-12 Texas Instruments Incorporated Java stack machine execution kernel dynamic instrumentation
US8751337B2 (en) 2008-01-25 2014-06-10 Syncada Llc Inventory-based payment processing system and approach
CN101546260B (en) * 2008-03-28 2012-07-11 国际商业机器公司 Method and device thereof for reconstructing service-oriented applications
US8738360B2 (en) 2008-06-06 2014-05-27 Apple Inc. Data detection of a character sequence having multiple possible data types
US8311806B2 (en) 2008-06-06 2012-11-13 Apple Inc. Data detection in a sequence of tokens using decision tree reductions
GB2478376B (en) * 2008-06-25 2013-04-10 Fujitsu Ltd Configuration management apparatus, configuration management program, and configuration management method
US8135659B2 (en) * 2008-10-01 2012-03-13 Sap Ag System configuration comparison to identify process variation
US8489388B2 (en) 2008-11-10 2013-07-16 Apple Inc. Data detection
US8396893B2 (en) * 2008-12-11 2013-03-12 Sap Ag Unified configuration of multiple applications
US8336035B2 (en) * 2008-12-16 2012-12-18 Microsoft Corporation Customizable dynamic language expression interpreter
US8255429B2 (en) * 2008-12-17 2012-08-28 Sap Ag Configuration change without disruption of incomplete processes
US9600247B2 (en) * 2008-12-29 2017-03-21 International Business Machines Corporation Extensible definition of interactive system productivity facility (ISPF) panels
US8201155B2 (en) * 2009-01-09 2012-06-12 Microsoft Corporation Handling multiple definition of types
JP2010165221A (en) * 2009-01-16 2010-07-29 Seiko Instruments Inc Pedometer system and pedometer
US11182752B2 (en) * 2009-04-29 2021-11-23 International Business Machines Corporation Generating transaction message
US20110239146A1 (en) * 2010-03-23 2011-09-29 Lala Dutta Automatic event generation
US8843893B2 (en) * 2010-04-29 2014-09-23 Sap Ag Unified framework for configuration validation
US20110302217A1 (en) * 2010-06-08 2011-12-08 Robert Heidasch Semantic user interface data assembling
US8918856B2 (en) 2010-06-24 2014-12-23 Microsoft Corporation Trusted intermediary for network layer claims-enabled access control
US8528069B2 (en) * 2010-09-30 2013-09-03 Microsoft Corporation Trustworthy device claims for enterprise applications
US8774010B2 (en) 2010-11-02 2014-07-08 Cisco Technology, Inc. System and method for providing proactive fault monitoring in a network environment
US8559341B2 (en) 2010-11-08 2013-10-15 Cisco Technology, Inc. System and method for providing a loop free topology in a network environment
US8982733B2 (en) 2011-03-04 2015-03-17 Cisco Technology, Inc. System and method for managing topology changes in a network environment
US8670326B1 (en) 2011-03-31 2014-03-11 Cisco Technology, Inc. System and method for probing multiple paths in a network environment
CN103649918A (en) * 2011-05-16 2014-03-19 Abb研究有限公司 A method and a system for online and dynamic distribution and configuration of applications in a distributed control system
US8724517B1 (en) 2011-06-02 2014-05-13 Cisco Technology, Inc. System and method for managing network traffic disruption
US8830875B1 (en) 2011-06-15 2014-09-09 Cisco Technology, Inc. System and method for providing a loop free topology in a network environment
JP2013004003A (en) * 2011-06-21 2013-01-07 Olympus Corp Service manual creation and management system, service manual creation method, service manual creation program, service manual management method and service manual management program
US8863082B2 (en) 2011-09-07 2014-10-14 Microsoft Corporation Transformational context-aware data source management
US20130067069A1 (en) 2011-09-13 2013-03-14 International Business Machines Corporation Flow topology of computer transactions
US9361342B2 (en) * 2011-10-10 2016-06-07 Hewlett Packard Enterprise Development Lp Query to streaming data
US9450846B1 (en) 2012-10-17 2016-09-20 Cisco Technology, Inc. System and method for tracking packets in a network environment
US9026553B2 (en) * 2012-11-29 2015-05-05 Unisys Corporation Data expanse viewer for database systems
US9678745B2 (en) * 2013-01-28 2017-06-13 Paptap Ltd Automatic submission of applications to applications stores
US9141803B2 (en) 2013-02-26 2015-09-22 Microsoft Technology Licensing, Llc Self-healing of operating system components
US11061965B1 (en) * 2013-03-15 2021-07-13 Teradata Us, Inc. Stored procedure execution in a distributed database system
US9116777B1 (en) * 2014-09-25 2015-08-25 International Business Machines Corporation In-flight process instance migration between business process execution language (BPEL) suites
US9652367B1 (en) * 2015-10-21 2017-05-16 Sap Portals Israel Ltd. Exploratory testing on multiple system landscapes
US10705835B2 (en) * 2015-12-03 2020-07-07 International Business Machines Corporation Transparent multi-architecture support in a container based cloud
US10083015B2 (en) * 2016-12-15 2018-09-25 International Business Machines Corporation Mobile accessibility evaluation from application binary
RU2722239C1 (en) * 2019-11-26 2020-05-28 Общество с ограниченной ответственностью «ПИРФ» (ООО «ПИРФ») Method of creating and using an executable file format with a dynamic extensible header
CN111867006B (en) * 2020-06-29 2023-10-24 新华三技术有限公司 Configuration file recovery method and device
US11354115B2 (en) * 2020-07-30 2022-06-07 Ncr Corporation Methods and a system for interface extensions
US20220091707A1 (en) 2020-09-21 2022-03-24 MBTE Holdings Sweden AB Providing enhanced functionality in an interactive electronic technical manual
US11687523B2 (en) 2020-11-25 2023-06-27 Salesforce, Inc. System and method for efficiently transferring data for offline use
US11675800B2 (en) * 2020-11-30 2023-06-13 Salesforce, Inc. Version control and execution on a mobile device
US20220261530A1 (en) 2021-02-18 2022-08-18 MBTE Holdings Sweden AB Providing enhanced functionality in an interactive electronic technical manual
US11947906B2 (en) 2021-05-19 2024-04-02 MBTE Holdings Sweden AB Providing enhanced functionality in an interactive electronic technical manual
CN113204330B (en) * 2021-06-01 2024-03-26 李麟 Program development design method and system based on artificial intelligence
US20230325800A1 (en) * 2022-04-11 2023-10-12 Ncr Corporation Providing remote access to a select portion of a transaction interface during a transaction at a transaction terminal
CN115190184B (en) * 2022-06-14 2023-06-23 深圳市圣麾科技有限公司 Binary message cell editing method, system and storage medium

Family Cites Families (47)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
US3774164A (en) * 1972-05-22 1973-11-20 Western Data Prod Inc Data terminal system
US4333144A (en) * 1980-02-05 1982-06-01 The Bendix Corporation Task communicator for multiple computer system
US4348739A (en) * 1980-02-12 1982-09-07 International Business Machines Corporation Terminal providing communication system information output
US4377852A (en) * 1980-03-31 1983-03-22 Texas Instruments Incorporated Terminal emulator
JPS56168263A (en) * 1980-05-30 1981-12-24 Hitachi Ltd Program making device
US4413318A (en) * 1980-11-20 1983-11-01 International Business Machines Corporation Use of nodes to uniquely identify processes
US4575816A (en) * 1980-12-19 1986-03-11 International Business Machines Corporation Interactive transactions processor using sequence table pointers to access function table statements controlling execution of specific interactive functions
US4525780A (en) * 1981-05-22 1985-06-25 Data General Corporation Data processing system having a memory using object-based information and a protection scheme for determining access rights to such information
US4454579A (en) * 1981-09-11 1984-06-12 Data General Corporation System for performing call and return operations
US4530051A (en) * 1982-09-10 1985-07-16 At&T Bell Laboratories Program process execution in a distributed multiprocessor system
JPS60103848A (en) * 1983-11-08 1985-06-08 インタ−ナショナル ビジネス マシ−ンズ コ−ポレ−ション Method of transmitting message between nodes capable of using plural languages
US4692858A (en) * 1984-02-02 1987-09-08 Trillian Computer Corporation Visual interface between user and computer system
US4615001A (en) * 1984-03-29 1986-09-30 At&T Bell Laboratories Queuing arrangement for initiating execution of multistage transactions
US4841441A (en) * 1984-08-01 1989-06-20 Adata Software Limited Method of creating a computer system
US4882674A (en) * 1985-03-05 1989-11-21 Wang Laboratories, Inc. Apparatus and method for control of one computer system by another computer system
US4734854A (en) * 1985-10-08 1988-03-29 American Telephone And Telegraph Company System for generating software source code components
JPS62174878A (en) * 1985-10-09 1987-07-31 Hitachi Ltd Design reference preparing method and its preparing device
US5287537A (en) * 1985-11-15 1994-02-15 Data General Corporation Distributed processing system having plural computers each using identical retaining information to identify another computer for executing a received command
US5007013A (en) * 1986-04-01 1991-04-09 Westinghouse Electric Corp. Bidirectional communication and control network with programmable microcontroller interfacing digital ICS and controlled product
JP2585535B2 (en) * 1986-06-02 1997-02-26 株式会社日立製作所 Process connection method in compound computer system
US5062040A (en) * 1986-12-22 1991-10-29 At&T Bell Laboratories Handling of notification of asynchronous events by user and stub processes of a distributed process executing on a plurality of processors of a multi-processor system
US4901231A (en) * 1986-12-22 1990-02-13 American Telephone And Telegraph Company Extended process for a multiprocessor system
US5335323A (en) * 1987-01-05 1994-08-02 Motorola, Inc. Computer human interface with multiapplication display
US4823304A (en) * 1987-01-15 1989-04-18 International Business Machines Incorporated Method of providing synchronous message exchange in an asychronous operating environment
US4860204A (en) * 1987-02-05 1989-08-22 Softron, Inc. Computer based workstation for development of graphic representation of computer programs
US4882727A (en) * 1987-03-11 1989-11-21 Aristacom International, Inc. Adaptive digital network interface
JPS63259757A (en) * 1987-04-17 1988-10-26 Nec Corp Multiplex control system for collective data input/ output type transaction processing
US4809170A (en) * 1987-04-22 1989-02-28 Apollo Computer, Inc. Computer device for aiding in the development of software system
US4881166A (en) * 1987-07-24 1989-11-14 Amoco Corporation Method for consistent multidatabase transaction processing
CA1312959C (en) * 1987-11-06 1993-01-19 Kiritkumar Talati Virtual interface system and method for enabling software applications to be environment-independent
US4961133A (en) * 1987-11-06 1990-10-02 Visystems, Inc. Method for providing a virtual execution environment on a target computer using a virtual software machine
US5220657A (en) * 1987-12-02 1993-06-15 Xerox Corporation Updating local copy of shared data in a collaborative system
US5008853A (en) * 1987-12-02 1991-04-16 Xerox Corporation Representation of collaborative multi-user activities relative to shared structured data objects in a networked workstation environment
US4918653A (en) * 1988-01-28 1990-04-17 International Business Machines Corporation Trusted path mechanism for an operating system
JPH0833834B2 (en) * 1988-03-17 1996-03-29 インターナシヨナル・ビジネス・マシーンズ・コーポレーシヨン Display panel generation method
JPH022419A (en) * 1988-06-10 1990-01-08 Hitachi Ltd Program information control system
US5036484A (en) * 1988-11-23 1991-07-30 International Business Machines Corporation Personal computer/host emulation system for handling host data with personal computer application programs at personal computers
JP2592955B2 (en) * 1989-04-04 1997-03-19 株式会社東芝 Automatic program generator
US5075847A (en) * 1989-05-26 1991-12-24 Hewlett-Packard Company Method and apparatus for computer program encapsulation
US5212792A (en) * 1989-06-01 1993-05-18 Hewlett-Packard Company Method and apparatus for controlling execution of tools in a computer-aided software engineering system
US5410675A (en) * 1989-08-21 1995-04-25 Lisa M. Shreve Method of conforming input data to an output data structure and engine for accomplishing same
US5159687A (en) * 1989-11-14 1992-10-27 Caseworks, Inc. Method and apparatus for generating program code files
US5093914A (en) * 1989-12-15 1992-03-03 At&T Bell Laboratories Method of controlling the execution of object-oriented programs
US5220675A (en) * 1990-01-08 1993-06-15 Microsoft Corporation Method and system for customizing a user interface in an integrated environment
US5032979A (en) * 1990-06-22 1991-07-16 International Business Machines Corporation Distributed security auditing subsystem for an operating system
US5263164A (en) * 1991-01-09 1993-11-16 Verifone, Inc. Method and structure for determining transaction system hardware and software configurations
US5119475A (en) * 1991-03-13 1992-06-02 Schlumberger Technology Corporation Object-oriented framework for menu definition

Also Published As

Publication number Publication date
EP0421622A3 (en) 1993-02-24
EP0420461A2 (en) 1991-04-03
US5896530A (en) 1999-04-20
US5428782A (en) 1995-06-27
EP0421622A2 (en) 1991-04-10
AU6469894A (en) 1994-08-25
AU6876794A (en) 1994-10-06
AU6312090A (en) 1991-04-11
AU6312190A (en) 1991-04-18
JPH04657A (en) 1992-01-06
EP0421623A2 (en) 1991-04-10
US5819089A (en) 1998-10-06
CA2025160A1 (en) 1991-03-29
AU652127B2 (en) 1994-08-18
US6115711A (en) 2000-09-05
EP0421624A3 (en) 1993-03-10
CA2025170A1 (en) 1991-03-29
EP0420461A3 (en) 1993-03-10
JPH03294953A (en) 1991-12-26
US5694601A (en) 1997-12-02
EP0423937A3 (en) 1993-05-26
AU663826B2 (en) 1995-10-19
AU665912B2 (en) 1996-01-18
JPH041842A (en) 1992-01-07
CA2025142A1 (en) 1991-03-29
AU6311990A (en) 1991-04-11
EP0421624A2 (en) 1991-04-10
EP0421623A3 (en) 1993-03-10
US6115710A (en) 2000-09-05
AU648515B2 (en) 1994-04-28
JPH04547A (en) 1992-01-06
JPH04546A (en) 1992-01-06
US5754845A (en) 1998-05-19
EP0423937A2 (en) 1991-04-24
CA2025120A1 (en) 1991-03-29
AU648263B2 (en) 1994-04-21

Similar Documents

Publication Publication Date Title
CA2025131A1 (en) Portable and dynamic distributed applications architecture
US5960200A (en) System to transition an enterprise to a distributed infrastructure
US7444643B2 (en) Accessing a ERP application over the internet using strongly typed declarative language files
Sutherland et al. The Hybrid Object-Relational Architecture (HORA) an integration of object-oriented and relational technology
Ram et al. Constraint meta-object: a new object model for distributed collaborative designing
Özsu et al. An object-oriented sgml/hytime compliant multimedia database management system
Schwabe et al. Hypertext development using a model‐based approach
Yen et al. An extensible view system for multidatabase integration and interoperation
King et al. Information management trends in office automation
Kolsch Object-oriented re-engineering of information systems in a heterogeneous distributed environment
Alia et al. A middleware framework for the persistence and querying of java objects
Durand et al. Object View Broker: A mediation service and architecture to provide object-oriented views of heterogeneous databases
Noll et al. A hypertext system for integrating heterogeneous, autonomous software repositories
Waite Error Analysis and Reporting in Programming Environments
Bauer et al. Managing Global Information in the CORDS Multidatabase System.
Hu et al. CORBA as Infrastructure for Database Interoperability
Heimbigner Computer Science Dept.
Schefström The Arcs Experience
Erbacher 9 The Place of Data Dictionaries in Large Scale Data Management
Waite Error Analysis and Reporting in Programming Environments; CU-CS-456-90
Yen An extensible view system for supporting the integration and interoperation of heterogeneous, autonomous, and distributed database management systems
Isnard et al. Tools for XML-based Maintenance of Heterogeneous Software

Legal Events

Date Code Title Description
FZDE Discontinued