Abstract: A method, system, and computer program product for timing the execution of code to facilitate the debugging of a Korn shell script. A user specifies the starting point and stopping point of a block of code by placing a time-code function at the beginning and end of the block of code. Furthermore, the user specifies a threshold value within the time-code function that corresponds to a maximum amount of time allotted for execution. The user defines a label variable to identify the output. When the block of code is executed, the time-code function calculates the time of execution and outputs the results. If the code contains an error that causes the execution time to exceed the threshold value, the time-code function halts the execution of the block of code and an error message is displayed. The error message then assists the user in debugging the block of code.

Abstract: A method, system, and computer program product for timing the execution of code to facilitate the debugging of a Korn shell script. A user specifies the starting point and stopping point of a block of code by placing a time-code function at the beginning and end of the block of code. Furthermore, the user specifies a threshold value within the time-code function that corresponds to a maximum amount of time allotted for execution. The user defines a label variable to identify the output. When the block of code is executed, the time-code function calculates the time of execution and outputs the results. If the code contains an error that causes the execution time to exceed the threshold value, the time-code function halts the execution of the block of code and an error message is displayed. The error message then assists the user in debugging the block of code.

Abstract: A method and system for minimizing the cycle time when compiling a program in a computer system is disclosed. The program includes a plurality of directories and each of the directories includes a code file. The method and system comprises the steps of providing a master array of directories of the program, wherein the master array lists the dependencies of the directories; providing a code change to the program to provide an updated program; providing associated dependency changes to the master array to provide an updated master array; and compiling the updated program utilizing the updated master array wherein the code files of the directories are compiled in an ordered manner based upon the dependencies of the plurality of directories. Through the use of the method and system in accordance with the present invention, compile cycle time for large programs is significantly reduced.

Abstract: A method and system for optimizing the use of a plurality of processors when compiling a program in a computer system is disclosed. The method and system comprises providing a list of directories and a list of processors. The method and system further includes determining when a directory is available. The method and system includes assigning a directory to a next available processor in an ordered manner to allow the next available processor to compile at least one file within the directory. Finally, the method and system includes ensuring that the maximum number of directories can be processed by assigning a processor thereto. Through the use of the method and system in accordance with the present invention, compile cycle time for large programs is significantly reduced. Accordingly, the dependencies are updated simultaneously with the code changes, thereby allowing for the compiling of the large program with minimal dependency violations.

Abstract: A method and system for minimizing the cycle time when compiling a program in a computer system is disclosed. The program includes a plurality of directories and each of the directories includes a code file. The method and system comprises the steps of providing a master array of directories of the program, wherein the master array lists the dependencies of the directories; providing a code change to the program to provide an updated program; providing associated dependency changes to the master array to provide an updated master array; and compiling the updated program utilizing the updated master array wherein the code files of the directories are compiled in an ordered manner based upon the dependencies of the plurality of directories. Through the use of the method and system in accordance with the present invention, compile cycle time for large programs is significantly reduced.

Abstract: A method and system for optimizing the use of a plurality of processors when compiling a program in a computer system is disclosed. The method and system comprises providing a list of directories and a list of processors. The method and system further includes determining when a directory is available. The method and system includes assigning a directory to a next available processor in an ordered manner to allow the next available processor to compile at least one file within the directory. Finally, the method and system includes ensuring that the maximum number of directories can be processed by assigning a processor thereto. Through the use of the method and system in accordance with the present invention, compile cycle time for large programs is significantly reduced. Accordingly, the dependencies are updated simultaneously with the code changes, thereby allowing for the compiling of the large program with minimal dependency violations.