Data processing: database and file management or data structures – Database design – Data structure types
Reexamination Certificate
1999-01-19
2003-05-13
Kindred, Alford (Department: 2172)
Data processing: database and file management or data structures
Database design
Data structure types
C712S200000, C717S152000, C717S152000
Reexamination Certificate
active
06564200
ABSTRACT:
TECHNICAL FIELD
The present invention relates in general to data processing systems, and in particular, to a mechanism for tracking routine dependencies in data processing system software.
BACKGROUND INFORMATION
It is commonplace in the data processing art for software to be written in a modular structure. The tasks which the software performs are typically embodied in a set of subtasks which, depending on the development environment, may be referred to as procedures, functions, methods, subroutines or events. An event is a particular software routine that receives user interactions via standard user interface devices. Although, again depending on the development system, these may have different connotations, for the purposes of the present invention they will be collectively referred to as routines.
A complex software program which may be typical of the complex tasks performed by modem data processing systems may include a multitude of such procedures. Moreover, routines typically refer to other routines, whereby a hierarchical structure results. In a sophisticated software product, a complex hierarchical, or nested, chain of routine references may result. Tracking this hierarchical chain of dependencies as a development of a software program progresses, may be difficult. Additionally, maintenance of the product, which may be performed by persons other than the developers, may also be complicated by the complex hierarchical structure. Thus, there is a need in the art for a mechanism to track and display the cross referencing of procedures in data processing software, thereby allowing the programmer to have knowledge of the calling and called routines that will be affected if changes are applied to any given routine.
SUMMARY OF THE INVENTION
The aforementioned needs are addressed by the present invention. Accordingly, there is provided, in a first form, a method of cross-referencing routines. The method includes the step of searching a program file for routine declarations, and entering a routine identifier in a first table in response to a corresponding routine declaration. Each routine corresponding to the routine identifier is searched for routine calls in response to the routine identifier.
There is also provided, in a second form, data processing system circuitry operable for searching a program file for routine declarations. The data processing system also includes circuitry operable for entering a routine identifier in a first table in response to a corresponding routine declaration, and circuitry operable for searching for routine calls in each routine in response to each routine identifier.
Additionally, there is provided, in a third form, a computer program product operable for storage on program storage media, the program product operable for cross-referencing software routines. The program product includes programming for searching a program file for routine declarations. Also included is programming for entering a routine identifier in a first table in response to a corresponding routine declaration, and programming for searching for routine calls in each routine in response to each routine identifier.
The foregoing has outlined rather broadly the features and technical advantages of the present invention in order that the detailed description of the invention that follows may be better understood. Additional features and advantages of the invention will be described hereinafter which form the subject of the claims of the invention.
REFERENCES:
patent: 4833594 (1989-05-01), Familetti et al.
patent: 5201048 (1993-04-01), Coulter et al.
patent: 5202985 (1993-04-01), Goyal
patent: 5241671 (1993-08-01), Reed et al.
patent: 5511186 (1996-04-01), Carhart et al.
patent: 5515488 (1996-05-01), Hoppe et al.
patent: 5528735 (1996-06-01), Strasnick et al.
patent: 5546529 (1996-08-01), Bowers et al.
patent: 5613117 (1997-03-01), Davidson et al.
patent: 5636350 (1997-06-01), Eick et al.
patent: 5652899 (1997-07-01), Mays et al.
patent: 5671381 (1997-09-01), Strasnick et al.
patent: 5692176 (1997-11-01), Holt et al.
patent: 5715444 (1998-02-01), Danish et al.
patent: 5715445 (1998-02-01), Wolfe
patent: 5768423 (1998-06-01), Aref et al.
patent: 5768581 (1998-06-01), Cochran
patent: 5778367 (1998-07-01), Wesinger, Jr. et al.
patent: 5778368 (1998-07-01), Hogan et al.
patent: 5787275 (1998-07-01), Li
patent: 5794178 (1998-08-01), Caid et al.
patent: 5911048 (1999-06-01), Graf
patent: 0 694 829 (1996-01-01), None
patent: 9-83888 (1997-03-01), None
patent: 9-91299 (1997-04-01), None
patent: 9-128281 (1997-05-01), None
patent: 9-160931 (1997-06-01), None
“Tree Traversal Techniques to Implement Enhanced Searches in Tree View”,IBM Technical Disclosure Bulletin, vol. 38 No. 02, Feb. 1995, pp. 289-291.
“Parci Architecture”,IBM Technical Disclosure Bulletin, vol. 38 No. 03, Mar. 1995, pp. 13-18.
“Function Cross Reference Utility”,IBM Technical Disclosure Bulletin, vol. 36, Mar. 1993, pp. 511-512.
Perkins Alan Curtis
Young Paul Brian
International Business Machines - Corporation
Kindred Alford
LaBaw Jeffrey S.
Newberger Barry S.
Winstead Sechrest & Minick P.C.
LandOfFree
Apparatus for cross referencing routines and method therefor does not yet have a rating. At this time, there are no reviews or comments for this patent.
If you have personal experience with Apparatus for cross referencing routines and method therefor, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Apparatus for cross referencing routines and method therefor will most certainly appreciate the feedback.
Profile ID: LFUS-PAI-O-3001015