Abstract: A system for packaging a dynamically linked computer program function includes a compiler configured to compile a source file iteratively to create a plurality of corresponding object files, the source file associated with a specific computer program function having an established an attribute, with each attribute exhibiting a plurality of at least one of variations, characteristics and parameters, wherein each iteration of the compiling the source file results in the plurality of object files having the specific computer program function but with each object file having distinct attributes from one another; and a linker configured to link the plurality of resulting object files to create a single executable file, such that the single executable file comprises different versions of the specific computer program function; and wherein the single executable file is configured to facilitate choice of a selected version of the specific computer function.

Abstract: A system for packaging a dynamically linked computer program function includes a compiler configured to compile a source file iteratively to create a plurality of corresponding object files, the source file associated with a specific computer program function having an established an attribute, with each attribute exhibiting a plurality of at least one of variations, characteristics and parameters, wherein each iteration of the compiling the source file results in the plurality of object files having the specific computer program function but with each object file having distinct attributes from one another; and a linker configured to link the plurality of resulting object files to create a single executable file, such that the single executable file comprises different versions of the specific computer program function; and wherein the single executable file is configured to facilitate choice of a selected version of the specific computer function.

Abstract: A method of packaging a dynamically linked computer program function comprising: establishing an attribute, each attribute exhibiting a plurality of at least one of variations, characteristics and parameters associated with the dynamically linked computer program function; obtaining a source file associated with the dynamically linked computer program function; and compiling and linking the source file iteratively to create a single executable file based on the at least one of variations, characteristics, and parameters for each attribute. The single executable file is configured to facilitate choice of a selected version of the function based on a particular at least one of variations, characteristics, and parameters for each attribute.

Abstract: A method of packaging a dynamically linked computer program function comprising: establishing an attribute, each attribute exhibiting a plurality of at least one of variations, characteristics and parameters associated with the dynamically linked computer program function; obtaining a source file associated with the dynamically linked computer program function; and compiling and linking the source file to create an executable file based on the at least one of variations, characteristics, and parameters for each attribute. The executable file is configured to facilitate choice of a selected version of the function based on a particular at least one of variations, characteristics, and parameters for each attribute.

Abstract: Processing an asynchronous interrupt of a processing entity which executes in a computer system is disclosed. An invocation stack is maintained in the computer system. The invocation stack includes a plurality of stack frames, wherein each of the stack frames has a fixed part of a predetermined length and a variable part of a variable length. An interrupt service routine is pre-defined to service the asynchronous interrupt. Processing of the asynchronous interrupt is performed by determining an address of a next available memory location in the invocation stack. A starting address in the invocation stack for a new stack frame is determined by adding a predetermined "skip" value to the next available memory location address. The new stack frame is to be used by the interrupt service routine.

Abstract: A computer program product and program storage device for supporting native and non-native signals transferred between processing entities of a computer program, for processing of a first type of interprocess signals and a second type of interprocess signals in a computer system is disclosed. The first type of signals conform to a first signal handling standard and the second type of signals conform to a second signal handling standard. Signal processing operates by determining whether an interprocess signal is a synchronous signal or an asynchronous signal. The interprocess signal originates from a first processing entity and is received by a second processing entity. The interprocess signal is processed using signal handling semantics defined by the first signal handling standard if the interprocess signal is an asynchronous signal.

Abstract: Processing of a first type of interprocess signals and a second type of interprocess signals in a computer system is disclosed. The first type of signals conform to a first signal handling standard and the second type of signals conform to a second signal handling standard. Signal processing operates by determining whether an interprocess signal is a synchronous signal or an asynchronous signal. The interprocess signal originates from a first processing entity and is received by a second processing entity. The interprocess signal is processed using signal handling semantics defined by the first signal handling standard if the interprocess signal is an asynchronous signal. Alternatively, the interprocess signal is processed using a combination of signal handling semantics defined by the first and second signal handling standards if the interprocess signal is a synchronous signal.

Abstract: Processing of an asynchronous signal directed to a thread comprising a software routine executing in a computer system such that data consistency is maintained is discussed. Such processing proceeds by determining whether the routine is signal safe such that processing of the routine may be interrupted in order to process the signal without possibly causing inconsistency of data. The routine is asynchronously interrupted and the signal is processed immediately if the routine is signal safe. If the routine is not signal safe, then the routine is not asynchronously interrupted and processing of the signal is deferred to a time when the signal may be processed without possibly causing inconsistency of data.

Abstract: Processing of an asynchronous signal directed to a thread comprising a software routine executing in a computer system such that data consistency is maintained is discussed. Such processing proceeds by determining whether the routine is signal safe such that processing of the routine may be interrupted in order to process the signal without possibly causing inconsistency of data. The routine is asynchronously interrupted and the signal is processed immediately if the routine is signal safe. If the routine is not signal safe, then the routine is not asynchronously interrupted and processing of the signal is deferred to a time when the signal may be processed without possibly causing inconsistency of data.