Abstract: Whole program analysis during a link time code generation part of compilation can be used to detect and eliminate dead catch handlers. If all catch handlers of a try clause in a computer program are found to be dead then the try clause can also be eliminated. Detection of dead catches can be automatic, using iterative propagation of the types of thrown exceptions from callee function to caller function from bottom to top in the call-graph and iterative propagation of the types of in-flight exceptions from caller function to callee function from top to bottom in the call-graph.

Abstract: Whole program analysis during a link time code generation part of compilation can be used to detect and eliminate dead catch handlers. If all catch handlers of a try clause in a computer program are found to be dead then the try clause can also be eliminated. Detection of dead catches can be automatic, using iterative propagation of the types of thrown exceptions from callee function to caller function from bottom to top in the call-graph and iterative propagation of the types of in-flight exceptions from caller function to callee function from top to bottom in the call-graph.

Abstract: A system and method for performing multi-threaded compilation of source code is provided. A representation such as a directed acyclic graph (DAG) may be generated representing functions and their dependency relationships on each other. Code is generated and optimized for each function. The code generation is scheduled, based on the representation, so that multiple functions may be compiled concurrently, while enforcing ordering restrictions to generate code in a deterministic manner. An application executable may be generated that is deterministic, based on the input source code and regardless of variations due to multi-threading.