Oracle International Corporation

Christian Wimmer

Peter Hofer

Oleg A Pliss

Thomas Wuerthinger

Lukas Stadler

Douglas Norman Simon

Aleksandar Prokopec

Gilles Marie Duboscq

Vojin Jovanovic

Liviu Codrut Stancu

Matthew Weingarten

Paul Woegerer

Improving program execution using interprocedural escape analysis with inlining includes expanding a call graph of a target program to obtain an expanded call graph, performing, using the expanded call graph, an interprocedural escape analysis (IEA) to generate a materialization map, and calculating an inlining benefit value for a callee using the materialization map. Improving program execution further includes inlining, using the expanded call graph and in the target program, the callee according to the inlining benefit value, updating, after inlining the callee, an allocation in the target program, and completing, after updating the allocation, compilation of the target program.

Program execution using interprocedural escape analysis with inlining

A flow graph of a first compilation unit of the program is expanded. The first corresponding parameter states of statements of the first compilation unit are marked as empty. The statements of the first compilation unit are processed to update the first corresponding parameter states with an exact type and a value set. Processing the statements include tracking a control flow predicate of a block in the first compilation unit, wherein the block comprises a first subset of the statements. Only after the control flow predicate indicates that the block is executable, the method includes processing an invocation statement in the first subset of the first statements, and expanding, responsive to the invocation statement, the flow graph for a second compilation unit of the program that is identified by the invocation statement.

Cross compilation unit sparse conditional constant propagation

A method may include obtaining, for a thread executing application code, a recurring task, a recurring interval, a previous callback time, a starting counter value, and a counter trigger, initializing a current counter value to the starting counter value, and performing checks in response to adjustments to the current counter value. Each check may determine whether the respective adjusted current counter value satisfies the counter trigger. The method may further include in response to a check determining that the adjusted current counter value satisfies the counter trigger, invoking a callback handler with a callback that performs the recurring task, and in response to an elapsed time exceeding the recurring interval, executing, by the callback handler, the callback. The elapsed time may be an amount of time elapsed between the previous callback time and the first invocation. The method may further include modifying the starting counter value using the elapsed time.

Application code callbacks at regular intervals

A method may include generating, for a host application, an image including an image heap including objects and a writeable object partition including a subset of the objects. The method may further include initializing, by executing the image in a process of a computer system, a first isolate including a first address space and a first read-only map of the image heap. The first read-only map may designate the writeable object partition of the image heap as copy-on-write. The method may further include initializing, by executing the image in the process, a second isolate including a second address space and a second read-only map of the image heap. The method may further include performing, in the first isolate and using the first read-only map, a first task that accesses an object, and performing, in the second isolate and using the second read-only map, a second task that accesses the object.

Managing multiple isolated execution contexts in a single process

A method for a compiler includes receiving, by the compiler and from an interpreter, a representation of a code section having a control path that changes the representation. The representation has profiling data, and the profiling data has a threshold. The method further includes performing, by the compiler and based on the threshold, a partial evaluation of the interpreter executing the representation, compiling, by the compiler, a machine code of the representation, with the control path replaced by a deoptimization point during the compilation of the machine code, triggering the deoptimization point during execution of the machine code, and returning execution to the interpreter based on the triggering.

Growing community of inventors

Belmont, CA, United States of America

Christian Wimmer