Abstract:
Aspects include apparatuses, systems, and methods for hardware acceleration for inline caches in dynamic languages. An inline cache may be initialized for an instance of a dynamic software operation. A call of an initialized instance of the dynamic software operation may be executed by an inline cache hardware accelerator. The inline cache may be checked to determine that its data is current. When the data is current, the initialized instance of the dynamic software operation may be executed using the related inline cache data. When the data is not current, a new inline cache may be initialized for the instance of the dynamic software operation, including the not current data of a previously initialized instance of the dynamic software operation. The inline cache hardware accelerator may include an inline cache memory, a coprocessor, and/or a functional until one an inline cache pipeline connected to a processor pipeline.
Abstract:
A method and an apparatus for concurrent accessing of dynamically type objects based on inline cache code are described. Inline cache initialization in a single thread may be off loaded to an interpreter without incurring unnecessary synchronization overhead. A thread bias mechanism may be provided to detect whether a code block is executed in a single thread. Further, the number of inline cache initializations performed via a compiler, such as baseline JIT compiler, can be reduced to improve processing performance.
Abstract:
The present invention relates generally to data processing systems and, more particularly, to dynamically switching statically bound function calls to dynamically bound function calls without recompilation. There is provided a method for compiling a computer program into object code, the computer program having functions containing code and function calls to the functions, the method comprising steps of determining when a function call is umambiguous; and compiling the function call to generate object code that performs static binding and inserting a placeholder into the object code for an instruction to be inserted into the placeholder to switch to dynamic binding when it is determined that the function call is unambiguous.
Abstract:
Various methods, apparatuses and systems for supporting polymorphic elements at run-time in portable computing devices are provided. One embodiment includes a development tool that can be incorporated into an integrated development environment. (IDE) The development tool is configured to detect when a programming instruction corresponding to a polymorphic element is received. Upon such detection, the developer operating the IDE is prompted to provide specific mapping information such that an application that is finally generated using the IDE avoids or reduces the use of polymorphic elements and thereby reduce computing resource stresses on the device on which such an application is ultimately deployed.
Abstract:
A computer system which includes a plurality of threads and a garbage collector that traces memory objects and identifies memory objects according to a three-color abstraction. The computer system also includes two methods of deleting compiled code in a self-modifying multi-threaded computer system. The computer system also utilizes a method of handling links between fragments of code in a self-modifying multi-threaded computer system. The computer system also handles patches between two pieces of code.
Abstract:
The present invention relates generally to data processing systems and, more particularly, to dynamically switching statically bound function calls to dynamically bound function calls without recompilation. There is provided a method for compiling a computer program into object code, the computer program having functions containing code and function calls to the functions, the method comprising steps of determining when a function call is umambiguous; and compiling the function call to generate object code that performs static binding and inserting a placeholder into the object code for an instruction to be inserted into the placeholder to switch to dynamic binding when it is determined that the function call is unambiguous.
Abstract:
A method and an apparatus for concurrent accessing of dynamically type objects based on inline cache code are described. Inline cache initialization in a single thread may be off loaded to an interpreter without incurring unnecessary synchronization overhead. A thread bias mechanism may be provided to detect whether a code block is executed in a single thread. Further, the number of inline cache initializations performed via a compiler, such as baseline JIT compiler, can be reduced to improve processing performance.
Abstract:
The present invention relates generally to data processing systems and, more particularly, to dynamically switching statically bound function calls to dynamically bound function calls without recompilation. There is provided a method for compiling a computer program into object code, the computer program having functions containing code and function calls to the functions, the method comprising steps of determining when a function call is umambiguous; and compiling the function call to generate object code that performs static binding and inserting a placeholder into the object code for an instruction to be inserted into the placeholder to switch to dynamic binding when it is determined that the function call is unambiguous.
Abstract:
Techniques for performing static binding of dispatched-calls in the presence of dynamic linking and loading are provided. A method for increasing the execution performance of a function at run-time includes compiling the function, which may either be interpreted or previously compiled, and identifying a call within the function to a process. The method also includes adding dependency information to the function. The dependency information is arranged to indicate a status of the function, and contains information pertaining to the class, the name, and the signature associated with the process.