Abstract: An approach is provided in preparing a dynamically loaded kernel extension. The approach includes compiling a kernel extension program that includes a symbol, such as a function. The symbol is exported from the kernel extension program and a symbol broker that references the exported symbol is compiled. A kernel extension loader library is created with a defined callable symbol that corresponds to the exported symbol. The kernel extension loader library is linked by an external program after compilation of the external program resulting in a compiled external program. The kernel extension loader library dynamically loads the compiled kernel extension program, the compiled symbol broker, and the exported symbol when the defined callable symbol is referenced by during execution of the compiled external program.

Abstract: An approach is provided in preparing a dynamically loaded kernel extension. The approach includes compiling a kernel extension program that includes a symbol, such as a function. The symbol is exported from the kernel extension program and a symbol broker that references the exported symbol is compiled. A kernel extension loader library is created with a defined callable symbol that corresponds to the exported symbol. The kernel extension loader library is linked by an external program after compilation of the external program resulting in a compiled external program. The kernel extension loader library dynamically loads the compiled kernel extension program, the compiled symbol broker, and the exported symbol when the defined callable symbol is referenced by during execution of the compiled external program.

Abstract: A process for managing customizations for components in a component tree includes for each customization associated with the parent of a component, matching the pathname of the component with the customization path. The process further includes associating the customization with the component, if the matching results in a partial match. The process further includes applying the customization to the component, if the matching results in a complete match.

Abstract: A computer implemented method, computer program product, and computer usable program code for preventing execution of program components having errors. First, a software application is executed. The software application interacts with a number of programs. Next, an error message is received. The error message indicates an error has occurred in a first program within the number of programs. The first program is then isolated such that the first program no longer interacts with the software application.

Abstract: A process for managing customizations for components in a component tree includes for each customization associated with the parent of a component, matching the pathname of the component with the customization path. The process further includes associating the customization with the component, if the matching results in a partial match. The process further includes applying the customization to the component, if the matching results in a complete match.

Abstract: A method and apparatus for managing data structures associated with large files are provided. With the apparatus and method, region control blocks for a data file are allocated on demand from an array of control blocks and are organized into a tree data structure. The tree data structure includes a base region control block and zero or more extended region control blocks. The base region control block includes a pointer to a root of the tree data structure and information about the data file. The extended region control blocks have pointers to the base region control block, to a successor region control block, and pointers to zero to four child region control blocks. Using this tree data structure, the operating system may perform various operations on the region control blocks with improved performance.

Abstract: A method and apparatus for managing data structures associated with large files are provided. With the apparatus and method, region control blocks for a data file are allocated on demand from an array of control blocks and are organized into a tree data structure. The tree data structure includes a base region control block and zero or more extended region control blocks. The base region control block includes a pointer to a root of the tree data structure and information about the data file. The extended region control blocks have pointers to the base region control block, to a successor region control block, and pointers to zero to four child region control blocks. Using this tree data structure, the operating system may perform various operations on the region control blocks with improved performance.

Abstract: A method and system within a data processing system are disclosed which enable a number of object files to be linked together to construct a compact executable program. First, the number of object files to be linked together are identified. Each of the object files to be linked includes one or more debugging strings that define a variable type or associate a variable name with a variable type, where a selected variable type is uniquely specified within a particular object file utilizing a type identifier. Each type identifier within each of the number of object files is mapped to a corresponding universal type identifier that uniquely specifies a selected variable type within all of the number of object files. Debugging strings which are not repeated in any two of the number of object files are written to the compact executable program, thereby minimizing a number of debugging strings written to the compact executable program.