Sun Microsystems, Inc.

Oracle America, Inc.

Oracle International Corporation

Samsung Electronics Co., Ltd.

Aplix Corporation

Ioi Kim Lam

Oleg A Pliss

Karen Margaret Pearson Kinnear

Frank N Yellin

Jiangli Zhou

Daniel David Blaukopf

Eran Davidov

Dov Zandman

Calvin C Cheung

Harold David Seigel

Lois Dickinson Foltan

Kuldipsingh A Pabla

Bernd J W Mathiske

Bernd J Mathiske

Bing Xia

Vijay G Nagarajan

Kinsley Wong

Saul G Wold

Qiuyuan Yang

Bernd Jw Mathiske

Junichi Monma

Returning a runtime type loaded from an archive in a module system is disclosed. Operations include (a) identifying, by a class loader implemented in a runtime environment, an archived runtime type loaded into an archive from a module source; (b) identifying a particular package associated with the archived runtime type; (c) determining that the particular package is defined to a runtime module that is defined to (i) the class loader or (ii) any class loader in the class loader hierarchy to which the class loader delegates; and (d) returning directly or indirectly, by the class loader, a runtime type loaded based on the archived runtime type from the archive.

Returning a runtime type loaded from an archive in a module system

Operations include (a) receiving a request to verify a first runtime type loaded based on a first runtime type reference; (b) identifying verification metadata comprising a stored assignable relationship between a second runtime type reference and a third runtime type reference; (c) determining whether an actual assignable relationship between a second runtime type and a third runtime type adheres to the stored assignable relationship between the second runtime type reference and the third runtime type reference; and (d) responsive at least to determining that the actual assignable relationship adheres to the stored assignable relationship, determining that the first runtime type is verified based on the verification metadata.

Generating verification metadata and verifying a runtime type based on verification metadata

The present disclosure involves systems, methods, and/or computer-readable mediums for reducing load time of an application. The systems, methods, and/or computer-readable mediums store metadata in an archive prior to execution of an application. The metadata corresponds to a type of class loading operation used to load a class required by the application, where different types of class loading operations perform different security checks as a part of loading classes. During execution of the application, based on the metadata and based in part on a request for the class loading operation to load the class, it is determined whether the class is stored in the archive. When the class is stored in the archive, a particular type of class loading operation loads the class from the archive and the system checks that the particular type of the class loading operation matches the type of the class loading operation in the metadata.

Mechanism for class data sharing using extension and application class-loaders

An apparatus and method for providing a user interface are provided. The method includes determining a status of the mobile terminal, and rendering a user interface using one of the software mode and the hardware mode based on the status of the mobile terminal. Accordingly, because a hardware mode provides a high quality user interface but requires more power as compared to the software mode, the mobile terminal is able to reduce power consumption by automatically switching to the software mode based on the status of the mobile terminal.

Dynamic switching between software and hardware graphics rendering for power consumption

A method, a non-transitory computer readable medium having instructions recorded therein for performing the method, and processing device for rendering an animation for a screen. The method includes rendering a frame of animation of a screen, attaching a Move Surfaces at BufferSwap (MSBS) command to at least one surface to be aligned with the frame of animation, swapping the buffer of the frame of animation, updating at least one of a size and a location of the at least one surface having an attached MSBS command, and composing a scene including the contents of the at least one surface of which the at least one of the size and the location has been updated.

Techniques for synchronizing hardware accelerated graphics rendering and surface composition

A user-space virtualization (USV) program to allow legacy applications in embedded systems to share resources without modification without compromising security is provided. A computer-implemented USV program may be characterized by a method in a user-space including retrieving a native code of an application, and identifying an instruction sequence. Further, identifying the instruction sequence includes, first, determining if executing the instruction sequence to perform processing is a possible security risk. If it is a possible security risk, then confirming that there is an execute authority for an active application. Execute authority may be confirmed by a security manager or a processor. If it is confirmed by the security manager that the active application has the execute authority for processing, then executing the instruction sequence with a processor. If the active application has no execute authority for processing, then not executing the instruction sequence. On the other hand, if executing the instruction sequence to perform processing is not a possible security risk, then executing the instruction sequence with the processor.

User space virtualization system

One embodiment of the present invention provides a system that reduces the number of heap handles in a program. First, the system builds an intermediate representation of the program. The system then analyzes the intermediate representation to determine whether executing a function may cause a garbage-collection operation. If so, the system further analyzes the program to determine whether a heap handle in the program is defined and/or used in proximity to a call to the function. Next, the system determines whether the heap handle can be replaced by an ordinary pointer, in order to facilitate subsequently converting the heap handle to an ordinary pointer, if possible. Note that converting a heap handle to an ordinary pointer reduces the space requirements for the program and increases the speed and efficiency of the program and garbage collection operations.

Reducing the number of heap handles in a program

One embodiment of the present invention provides a system that determines whether a data structure, such as an array, is modifiable. First, the system loads a source file for a class. The system then examines the source file to identify a set of data structures in the class, and uses escape analysis to determine whether each data structure is modifiable. The system then performs an action based on the determination. In a variation on this embodiment, if the data structure is not determined to be modifiable, performing the action involves storing the data structure in a read-only memory (ROM) instead of a random-access memory (RAM), which leaves more RAM available for other purposes.

System and method for determining whether an array is a read-only array

Systems and methods for the efficient handling of rare events by modification of executable code is provided. The present invention eliminates the need for event checking code and handling in the primary execution path of compiled code by using a patch table to modify code during execution. Accordingly, event handling does not introduce additional instructions to the primary execution path, and thus will not interfere with compiler optimizations for maximal performance along the primary execution path. The present invention, therefore, provides event handling for events that occur rarely while reducing the size of the code for execution on memory-constrained devices.

System and method for handling rare events by modification of executable code

One embodiment of the present invention provides a system that facilitates managing compiled program methods in a unified heap. The system partitions the unified heap into a first area and a second area. This allows the system to store objects other than compiled program methods and temporary compiler data structures in the first area, and to store compiled program methods and temporary compiler data structures in the second area.

Method and apparatus for managing compiled methods in a unified heap

A method is disclosed for reducing dynamic pauses during dynamic compilation. Applications running on a system detect the rendering of dynamic output to a user. The dynamic output represents a change in visual or audio data while any application is running. When an application detects such output it notifies the system, which monitors the frequency of the dynamic output. If the frequency of the dynamic output exceeds a threshold, the system informs a compiler on the system to suspend compilation. Compilation normally occurs when an interpreter on the system is instructed to pass processing control to the compiler. One way this occurs is if a method currently being processed by the interpreter has been marked for compilation. Thus, in order to suspend compilation, the compiler ceases to mark methods for compilation so that the interpreter will not be instructed to pass processing control to the compiler.

Mechanism for reducing detectable pauses in dynamic output caused by dynamic compilation

Apparatus, methods and computer program products are disclosed to improve allocation of physical memory in a memory limited device when the amount of unallocated memory approaches a threshold. In this situation the disclosed technology will identify memory pages that have substantially the same content, identify the process-contexts that map to the identified memory pages, remap these process-contexts to one of the identical memory pages, recycle all of the other identical memory pages to increase the amount of unallocated memory, and conditions the process-contexts to appropriately trap accesses to the mapped page.

Memory allocation in memory constrained devices

One embodiment of the present invention provides a method and a system for patching a set of objects containing references. The system uses a location structure to keep track of the locations of references within the set of objects. During the patching process, the system converts the references within the set objects from an absolute form into an offset-based form, where offsets are computed with respect to base addresses of objects. The system then applies an offset-based patch to the set of objects and to the location structure using a binary-patching technique. After applying the patch, the system converts the references in the set of objects back into absolute form. By using an offset-based patch, the system reduces the number of reference changes that need to be specified in the patch, thereby reducing the size of the patch.

Growing community of inventors

Mountain View, CA, United States of America

Ioi Kim Lam